Adaptive array directional diagram comprehensive method based on binary search

Abstract

The invention provides an adaptive array directional diagram comprehensive method based on binary search. The method comprises the following steps: calculating an incident signal vector and a covariance matrix, obtaining an optimal weight vector, obtaining a directional diagram, calculating a maximal minor lobe level and a main beam peak value of the directional diagram, updating the interferencepower for iteration, wherein the figured out optimal weight vector is the actual antenna array excitation, and generating an antenna array directional diagram by using the actual antenna array excitation. By adoption of the adaptive array directional diagram comprehensive method provided by the invention, the dependency of the interference power update on the loop gain is reduced, and the influence of the loop gain value on a comprehensive effect of an algorithm is reduced; the correlation between adjacent iterations is improved, and the convergence speed of the algorithm is accelerated; and the interference power is updated via the binary search of a power interval after a non-positive value appears in the interference power, the minor lobe level for generating the directional diagram islow and stable, and the robustness of the algorithm is improved.

Description

technical field [0001] The invention belongs to the field of array pattern synthesis and relates to an adaptive array pattern synthesis method. Background technique [0002] Because array antennas are easy to form narrow beams, multi-beams, and achieve specific shaped beams, low sidelobes and beam scanning, they have been widely used in radar, sonar, astronomy, and radio communications. As an important research branch of array antenna theory, array pattern synthesis refers to the design of the antenna system with one or more methods according to the specified pattern requirements, so that the pattern generated by the system can achieve a good approximation to the required pattern. . [0003] Adaptive array pattern synthesis uses the characteristic that adaptive processing will produce nulls in the array pattern. Assuming that the antenna array is an adaptive array, the adaptive weights are adjusted to reduce the sidelobe potential by continuously applying interference and i...

AI Technical Summary

Problems solved by technology

[0004] In the adaptive array pattern synthesis algorithm, the optimization performance has a great dependence on the loop gain. When the loop gain is small, the convergence rate of the algorithm is very slow, and it is easy to fall into the local optimal solution; when the loop gain is large When the value is large, the output maximum sidelobe gain fluctuates violently, and the stability of the algorithm is poor, such as figure 1 shown

However, there is no specific theoretical support for the selection of the loop gain, and the value is usually based on the experimental statistical results, and the optimal value will change with the different synthesis conditions of the array, even in the iterative process of the algorithm. Limit the performance of the algorithm, resulting in a decline in algorithm optimization performance

Images