Beam broadening algorithm based on inheritance quasi-global segmentation search

Abstract

The invention discloses a beam broadening algorithm based on inheritance quasi-global segmentation search, and the algorithm comprises the steps: S1, calculating the broadening multiple of a to-be-optimized directional diagram in a to-be-optimized directional diagram, and sorting the to-be-optimized directional diagram according to the broadening multiple; S2, calculating a ratio of broadening multiples between two adjacent to-be-optimized directional diagrams, inserting a virtual to-be-optimized directional diagram between the two adjacent to-be-optimized directional diagrams according to a preset target index when the ratio is judged to be greater than or equal to a constraint threshold, and recording the virtual to-be-optimized directional diagram as a revised to-be-optimized directional diagram; S3, calculating and revising universal amplitude distribution of the directional diagram group to be optimized according to the Taylor function; and S4, according to the phase excitation calculation formula, calculating and revising the phase excitation of the to-be-optimized directional diagram by adopting a sectional search algorithm. By means of the technical scheme, the optimizationefficiency of the directional diagram is improved, the calculation requirement for quick beam broadening in the array antenna is met, and the array antenna has the continuous beam characteristic.

Description

Technical field [0001] This application relates to the technical field of array antenna radar imaging, in particular, to a beam broadening algorithm based on inherited quasi-global segmented search. Background technique [0002] The fast beamforming algorithm is an important technology in the field of array antennas. Its main implementation methods can be divided into the following two categories: [0003] The first type is to obtain the amplitude and / or phase distribution of each radiating element through direct analytical calculation of the target pattern. For example, based on the far-field pattern analysis algorithm, through this algorithm, the amplitude and phase distribution of each radiating element in the array antenna can be obtained analytically. [0004] However, the application scenarios of this algorithm are more restrictive. Normally, the expanded pattern cannot be accurately described; and the amplitude and phase excitation based on Fast Fourier Transformation (FFT) a...

AI Technical Summary

Problems solved by technology

[0011] The purpose of this application is to: solve the demand for fast beam broadening in array antennas, solve the problems of traditional array antenna beamforming algorithms that rely too much on random or pseudo-random quantities, slow solution speed, and unstable solution process, etc., and propose a method based on inheritance The beam-broadening algorithm of the quasi-global segmented search has the advantages of fast solution speed, no dependence on random quantities, repeatable solution results, good coverage, and difficulty in converging on local extremes.

Images