Abstract

Introduction. The use of non-equidistant pulse sequences as probing radar signals makes it possible to eliminate blind spots in speed and range. However, the implementation of multi-channel Doppler filtering (MDF) based on the classical fast Fourier transform (FFT) algorithm of non-equidistant signal samples in the signal detection problem is associated with energy losses. The use of modified FFT algorithms increases the efficiency of MDF against the background of white Gaussian noise, while reducing the efficiency of signal accumulation in the part of signal processing channels blocked by the narrow-band clutter. To eliminate this drawback, the authors previously proposed using combined classical and modified FFT algorithms. However, the use of the combined method does not lead to an optimal solution in terms of MDF efficiency.Aim. Optimization of weight processing of non-equidistant signals to improve the efficiency of MDF.Materials and methods. An MDF synthesis was carried out using optimization procedures, and the effectiveness of the algorithms was assessed using computer calculations.Results. The results show that the Kaiser Bessel window with a window parameter of 4.42 provides the highest signal-(clutter+noise) ratio improvement coefficient averaged over frequency channels equal to 30.06 dB and the highest probability of correct signal detection averaged over MDF channels equal to 0.5 at processing of non-equidistant pulse sequences. Optimization of the weight processing of MDF under the specified conditions increased the average efficiency characteristics used of up to 53.18 dB and 0.92, respectively.Conclusion. Separate optimization of weighting processing for each frequency channel can significantly improve the average efficiency characteristics of a multichannel Doppler filter and eliminate all the shortcomings of the classical and modified FFT algorithms when processing non-equidistant pulse sequences. However, these advantages are achieved at the cost of not using the FFT, i.e., implemented within the framework of the discrete Fourier transform (DFT) algorithm.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call