Search

Search Results

• METHOD FOR GENERATING TOPOLOGICAL CONSTRAINTS OF COMPUTATIONAL STRUCTURES FOR RECONFIGURABLE COMPUTING SYSTEMS

  А.А. Dichenko , I. I. Levin , D.А. Sorokin

  33-46

  2025-12-30

  Abstract ▼

  For reconfigurable computing systems based on FPGAs, efficient application programs are parallel-pipeline programs that achieve real performance exceeding 50% of the peak. This article addresses the problem of reducing the development time of such programs. The computational structures of these programs utilize a large volume of FPGA resources operating at high clock frequencies. However, simultaneously maximizing both the amount of FPGA resources used and the clock frequency presents a certain contradiction: as resource utilization increases, the placement flexibility of the functional units of the computational structures decreases, and the FPGA switching matrix fails to provide the required signal propagation characteristics when routing information channels between them. Moreover, in modern CAD tools, placement and routing algorithms consider only the architectural and geometric features of the FPGA. Therefore, when a large number of specialized primitives with very limited placement flexibility are used, achieving high clock frequencies in automatic synthesis mode becomes virtually impossible. To address this problem, it is also necessary to consider the information dependencies between the functional units of the computational structures, but the nature of these dependencies in tasks from different subject areas can vary significantly. As a result, developers are often forced to manually place the functional units of the computational structures on the FPGA by creating script-based instructions for topological constraints. In earlier generations of FPGAs, the time required to generate topological constraints was acceptable, as they typically contained only a few hundred specialized primitives. However, in modern FPGAs, the number of such primitives reaches several thousand or even tens of thousands, significantly increasing the development time of efficient application programs. The proposed method makes it possible to automate the process of developing topological constraints for computational structures. The research was carried out during the development of application programs for solving a range of problems based on FFT, AES, and LU decomposition algorithms for the reconfigurable computer “Tertius-2.” As a result of significantly reducing the time required for optimization iterations of computational structures, the total synthesis time was reduced by up to three times.

• NOISE GENERATION METHOD BASED ON A SET OF NOISY IMAGES WITHOUT CLEAN EXAMPLES

  А.S. Kovalenko , Y. М. Demyanenko

  243-254

  2025-11-10

  Abstract ▼

  In this work, a novel method is proposed for noise generation from noisy images that does not require aligned pairs of clean and noisy data. Unlike traditional approaches demanding matched image sets or a priori noise models, the developed technique models complex noise characteristics intrinsic to specific CMOS sensors solely from observed noisy data. Noise synthesis is achieved via a U‑Net‑like generative adversarial architecture based on StyleGANv2, featuring a modified discriminator conditioned on camera parameters and input image metadata. Special emphasis is placed on preserving the spatial–color structure and textural details of each image, enforced through a dedicated loss function that ensures fidelity to the original color rendering and fine-grained patterns. Training of the noise generator is performed without any paired clean and noisy images, which proves particularly valuable when handling real-world datasets acquired from multiple camera models under varied lighting conditions. The experimental section presents a detailed comparative analysis of the synthesized images using PSNR and SSIM metrics, along with an evaluation of the noise distribution based on intensity statistics and spectral characteristics. It is demonstrated that the generated dataset functions effectively as a standalone training corpus for denoising neural networks and, when combined with a real dataset (e.g., SIDD), yields further enhancements in denoising performance. Results indicate that combined training on the union of generated and real examples produces an average PSNR improvement of 1.5 dB compared to existing methods reliant on aligned data. Independence from the specific optical characteristics of any given sensor significantly broadens the method’s applicability. These findings confirm the utility of the proposed approach for realistic noise synthesis and removal in scenarios lacking clean reference images, and they open avenues for future research into adaptive noise-model generation

• THE MATHEMATICAL PROBLEM OF OPTIMAL CONTROL OF THE STRING

  G. V. Kupovykh, A. G. Klovo , I. A. Lyapunova

  2020-11-22

  Abstract ▼

  It is generally accepted that optimal control problems or system design problems determine
  for a given object or system of control objects a law or a certain control sequence of actions that
  provide a maximum or minimum of a given set of system quality criteria. In this case, the speed
  problem can be considered, i.e. the problem of bringing the system to a given state in the shortest
  time. We also study the problems of minimizing a given functional for a fixed time of system management.
  Optimal control is closely related to the choice of the most rational modes for managing
  complex objects. A lot of works has been devoted to the problem of control, in addition, wellknown
  mathematical schools are currently engaged in such research. In problems with concentrated
  parameters, the systems under study are described by ordinary differential equations or
  their systems. In this case, the Pontryagin maximum principle plays an important role in this
  study. For partial differential equations, we talk about systems with distributed parameters. In thispaper, we investigate the possibility of synthesizing optimal control of a single system with distributed
  parameters. A model of string oscillation under the influence of control functions under
  boundary conditions is considered. The role of the choice of the functional to be minimized in creating
  opportunities for the synthesis of optimal control. In this case, the control action is searched
  for at each point of the time interval, which leads to the possibility of constructing it explicitly.
  The conditions for the existence of optimal control everywhere in the corresponding functional
  spaces are formulated. In a specific statement of the problem, everywhere optimal control is explicitly
  constructed.

• AUTOMATED STRUCTURAL-PARAMETRIC SYNTHESIS OF A STEPSED DIRECTIONAL RESPONDER ON CONNECTED LINES BASED ON A GENETIC ALGORITHM

  Y. V. Danilchenko , V.I. Danilchenko, V. M. Kureichik

  2020-11-22

  Abstract ▼

  An automated approach to the structural-parametric synthesis of a stepped directional coupler
  on connected lines based on a genetic algorithm (GA) is described, which makes it possible to
  create an algorithmic environment in the field of genetic search for solving NP complete problems,
  in particular, the structural-parametric synthesis of a stepped directional coupler on connected
  lines. The purpose of this work is to find ways of structural-parametric synthesis of a stepped directional
  coupler on coupled lines based on the bionspiration theory. The scientific novelty lies in
  the development of a modified genetic algorithm for automated structural-parametric synthesis ofa stepped directional coupler on connected lines. The problem statement in this work is as follows:
  to optimize the synthesis of passive and active microwave circuits by using a modified GA. A fundamental
  difference from the known approaches in the use of new modified genetic structures in
  automated structural-parametric synthesis, in addition, a new method for calculating a stepped
  directional coupler on connected lines based on a modified GA is righteous in the work. Thus, the
  problem of creating methods, algorithms and software for automated structural synthesis of microwave
  modules is currently of particular relevance. Its solution will improve the quality characteristics
  of the designed devices, reduce design time and costs, and reduce the requirements for
  developer qualifications.

• APPLICATION OF FORBIDDEN SHAPES IN THE GRAPH COLORING PROBLEM WHEN DESIGNING PRINTED CIRCUIT BOARDS

  V. I. Potapov

  2021-01-19

  Abstract ▼

  Designing a printed circuit board in the form of flat structures without jumpers is one of the
  most difficult tasks at the stage of circuit design. The task in this formulation is especially relevant for
  micro-assemblies for electronic modules of control and verification, on-board equipment, made using
  surface-mount technology, where, for example, due to a metal heat sink or a ceramic base, the structure
  of connections is possible only in one layer. The paper deals with the problem of designing
  printed circuit boards in the form of synthesis of flat structures of electronic circuits. The goal is to
  position the connections on the PCB without overlapping, making it easier for any router in modern
  design programs to route. To solve it, a large number of different algorithms have been proposed, the
  main disadvantage of which is the principle of sequential and fragmentary viewing of the switching
  space inherent in them. The complexity of the algorithms for the synthesis of such structures is also
  due to the need to take into account a large number of different requirements associated with the
  specifics of their manufacture and the features of the developed constructive and technological solution.
  In this paper, it is proposed to design a printed circuit board with a high efficiency of routing
  connections by solving the problem of stratifying the original graph-scheme and constructing a flat
  graph-scheme both on the installation side of the electrical radio elements and on the reverse side of
  the board - the soldering side, excluding forbidden figures according to Potryagin's theorem -
  Kuratovsky. The criterion is to minimize vias as well as minimize conductors (fins) on one side of the
  PCB. The bundle problem is a graph coloring problem in two colors using the principles of characterization
  control, the solution of which is based on the Koenig theorem, which defines a forbidden
  figure in the form of cycles of odd length. For the design of printed circuit boards, an algorithm and
  method for constructing planar graphs and stratifying the graph into two sides of the printed circuit
  board with a decrease in the number of undistributed edges have been developed. The exact solution
  takes the form of a polynomial dependence not higher than the 5th degree, it allows you to get the
  result in a reasonable time and increase the tracing efficiency by 5–15 %

• RESTORATION OF DEFECTS AND BLIND ZONE ON IMAGES OF UNDERLYING SURFACE FOR ONBOARD RADAR SYSTEMS OF MAPPING BASED ON DOPPLER BEAM SHARPENING

  R.R. Ibadov, S.R. Ibadov, V.P. Fedosov

  2021-02-13

  Abstract ▼

  The problem of forming a radar image (RI) of the earth's surface in real time remains one of
  the most urgent in solving radio imaging problems, despite the appearance of a large number of
  publications in this area, reflecting a whole range of new methods and algorithms for processing
  trajectory signals in order to improve the quality of images. The main goal in the formation of
  radar images is to achieve the maximum resolution and image quality under real constraints associated
  with the drift of the parameters of the received trajectory signal (synthesis time), measurement
  inaccuracy and variability of flight characteristics (speed, acceleration, flight trajectory),
  exposure to a wide range of noise and interference, both external and internal, against the background
  of a low-power received signal from remote radio reflectors (energy resources). The article
  investigates an algorithm for constructing and restoring images of the underlying surface and
  develops its software implementation. The effectiveness of the new approach is shown using several examples for various areas of the underlying surface with a blind spot. The subject of the research
  is methods and algorithms for constructing a terrain map and reconstructing lost image
  areas. The research object is a set of test images. The result of the research is the development of a
  method for image restoration in order to restore the lost area. The novelty of the work is an algorithm
  that improves the quality of image restoration based on a neural network. The results obtained
  make it possible to restore the areas. Evaluation of the efficiency of the image restoration
  method was carried out using a statistical criterion - the root mean square error of the processing
  result from the true image. As a result of solving the tasks, we can draw conclusions:  A method
  was developed for constructing and restoring images of the underlying surface based on the
  search for similar blocks with their subsequent combining by a neural network.  Analysis of the
  results of the study showed that the proposed method improves the quality of image reconstruction.

• MULTICHANNEL SYSTEM DESIGN OPTIMIZATION USING LOGICAL SYNTHESIS FOR QUALITY IMPROVEMENT OF VOLUME VISUALIZATION

  N.I. Vitiska, N.A. Gulyaev, V.V. Selyankin

  2021-02-25

  Abstract ▼

  The paper reviewes a problem of optimization and quality improvement of development and
  design of multi-channel systems which perform direct volume visualization. Volume visualization
  is widely used in modern computer graphics and visualization systems. Volume visualization is
  well-know for its requrements - it demands large amounts of data to be processed to produce a
  high quality result. The optimization problem is considered as a quality-cost dependence, where
  the target is to achieve is the required quality level at minimal cost. The paper proposes a method
  for logical synthesis of such systems, which allows to obtain optimal quality-cost ratios depending
  on the required parameters. The proposed method allows to achieve a quality level, that is close to
  results of a full-search solutions, but it requires a significantly smaller amount of calculations. For
  each channel of the system, a set of variables is defined, the optimization of which will ensure the
  quality of the resulting images. Based on the optimization parameters, a switching function is constructed
  using a Veitch diagram. This approach is implemented programmatically in each channel
  of the distributed system in real time, what sets the general scheme of the method. In described
  study, experimental research of relatationship between the accuracy of the solution and the
  amount of calculations of direct volume visualization in each channel of a distributed system was
  performed. A method for optimal image synthesis based equalizing the playback quality in a small
  group of channels in a distributed system was developed.

• ANALYSIS OF MATLAB SYSTEM APPLICABILITY FOR SYNTHESIS OF CONTROLLED BUTTERWORTH DIGITAL RECURSIVE IIR FILTERS

  Hussein Sh. Mogheer, I. I. Turulin

  2021-08-11

  Abstract ▼

  A number of digital signal processing applications use controlled IIR digital recursive filters.
  The word " controlled " refers to filters whose structure ratios clearly depend on the cut rate or
  boundary frequencies. Controlled IIR filters can be synthesized using a variety of tools to compute
  traditional, uncontrolled IIR filters. The article dealt with the synthesis uncontrolled IIR filters and
  analyzed the suitability of the presentation of the results of synthesis for the construction of controlled
  IIR filters. The design techniques based on MATLAB (2021a) and the fundamental concepts of IIRButterworth
  digital filters were described and explained. The composited signal was processed by the
  analyzed filter to find whether it met the filtering progress criteria. To check the calculated filters, the
  Simulink prototype was used, as well as FDA tool of signal processing toolbox. Based on the results
  obtained, a conclusion was made about the applicability of the MAT LAB (2021a) system for the
  synthesis of controlled digital recursive IIR-Butterworth filters. The analyzed technique was more
  efficient, faster, decreased the tasks and found the results are satisfying.

• ANALYTICAL SYNTHESIS OF THE CONTROL ALGORITHM FOR THE ELECTRIC BRAKING SYSTEM OF THE AIRCRAFT LANDING GEAR

  A.Z. Asanov, A.V. Kukovinets, A.Y. Chekin

  2022-03-02

  Abstract ▼

  Nowadays, researchers are developing technologies in the aviation industry related to the
  electrification of aircraft functional systems. The braking system has a direct impact on the safety,
  stability and functionality of the aircraft. Therefore, the motivation for replacing the hydraulic
  system is accompanied by the results of comprehensive studies of the architectures of electric
  braking systems, including the possibility of improving the quality of such systems through the
  introduction of effective control. The work is devoted to the methodology of analytical synthesis of
  the control algorithm for the electric braking system of the aircraft landing gear, as a multiconnected
  control object, based on the theory of embedded systems. The mathematical model contains
  a description of the electrical, mechanical and thermal processes of the system. The require ments for the quality of transients in terms of the angular velocity of the wheel and the temperature
  on the surface of the frictional disc are set in the form of restrictions on the settling time and overshoot
  and then transformed into the form of a reference model. The results of computer simulation
  of the dynamics of the initial and linearized systems, as well as a system with a synthesized regulator
  by the full vector of states are shown. The discussion about the robustness of the resulting solution
  are presented and the results of computer simulation of a system with a "simplified" regulator
  are shown.

• METHOD AND ALGORITHM FOR SYNTHESIS OF CONTROLLED CHEBYSHEV DIGITAL FILTERS OF THE FIRST KIND OF LOW FREQUENCIES BASED ON THE BILINEAR TRANSFORMATION METHOD

  I.I. Turulin, S.M. Hussein

  2022-11-01

  Abstract ▼

  The article presents a technique for the synthesis of controlled digital recursive Chebyshev lowpass
  filters of the first kind with an infinite impulse response. The frequency response of such filters has
  ripples in the passband and is as flat as possible in the stopband. Controllability is understood as an
  explicit dependence of the filter coefficients on the cutoff frequency. The technique is based on the bilinear
  transformation of the transfer function of the analog low-pass filter prototype and the frequency
  transformation of the amplitude-frequency characteristics of the obtained digital filter. The main idea ofthe technique is that for an analog prototype filter with a cutoff frequency of 1 rad/s, the parameters of
  the transfer function of biquadratic or bilinear links, which have the dimension of frequency, will be
  numerically equal to the correction factors for similar parameters of a controlled filter with an arbitrary
  cutoff frequency. As an example, the synthesis of a digital Chebyshev filter of the first kind of the fifth
  order is considered. In this article, the transfer function of an arbitrary order filter is represented as a
  cascade connection of II order links if the filter is of an even order. In the case of an odd order greater
  than one, one cascaded link of the first order is added. Despite the relative simplicity of the frequency
  conversion, in its practical use for digital filters synthesized using computer-aided design of digital filters
  (or using reference books containing calculated prototype low-pass filters for various approximations
  of the frequency response of an ideal low-pass filter), a series arises non-trivial specific moments
  that complicate the engineering use of this method of synthesizing controlled digital filters. Therefore, in
  addition to the technique, a step-by-step algorithm has been developed that allows one to synthesize a
  filter without knowing these moments. The algorithm is implemented in the Mathcad environment; as
  an example, a digital recursive Chebyshev filter of the 1st kind of the 5th order is calculated.
  The example shows the calculated coefficients of a digital controlled low-pass filter, which explicitly
  depend on the cutoff frequency, the amplitude-frequency characteristics of this filter and its lowfrequency
  prototype converted into a filter with the same cutoff frequency, the amplitude-frequency
  characteristics are given in the same coordinates. Due to the good formalization of the algorithm, the
  latter is suitable for the implementation of computer-aided design systems for controlled digital
  Chebyshev low-pass filters of the first kind.

• MODEL AND ALGORITHM OF OPERATIONAL PLANNING OF LOGISTIC PROCESSES OF TIMELY DELIVERY OF CARGO WITH THE INTERACTION OF A GROUP OF ROBOTIC COMPLEXES

  Е.D. Grigoreva, V.А. Ushakov

  2025-04-27

  Abstract ▼

  The purpose of the study is to improve the quality of operational planning (program control) of logistics
  processes in the conditions of modern urban systems with the interaction of a group of robotic systems.
  The quality of management in this study will be assessed by the number of deliveries completed after
  established directive deadlines. The goal set during the study is decomposed into the following tasks: system
  analysis of the current state of research in the field of metropolitan logistics, implementation of a
  substantive and formal formulation of the problem of operational planning of logistics processes in a metropolis
  using a group of robotic complexes, development of a model and algorithm for operational planning
  of logistics processes in a metropolis using a grouping of robotic complexes, development of special
  model-algorithmic support and its software prototype for solving the problem of operational planning of
  logistics processes in a metropolis using a grouping of robotic complexes. Proactive (anticipatory) management
  of a group of robotic systems when solving transport and logistics problems in a metropolis within the framework of the “Smart City” concept allows increasing the economic efficiency of cargo delivery.
  The article examines the scientific and technical problem of synthesizing technologies (plans) for the timely
  delivery of small-sized cargo using a group of robotic systems. The scientific significance lies in the
  application of the concept of integrated (system) modeling and proactive (anticipatory) management, and
  the practical significance lies in ensuring timely delivery of goods using a group of robotic complexes in a
  metropolis. The article discusses an example of solving the problem of operational planning of logistics
  processes using the example of Innopolis using the characteristics of Yandex delivery robots (as robotic
  complexes). During the study, an analysis of various options for objective functions was carried out: maximizing
  profit and minimizing delivery time; profit maximization; minimizing time; minimizing the number
  of robotic systems. The following indicators were chosen to evaluate the results obtained: total profit from
  deliveries; the number of deliveries not delivered on time and the total number of completed orders.
  The most suitable objective functions for solving the problem are time minimization or simultaneous time
  minimization and profit maximization. In addition, the conclusion provides directions for further research