A Sparse Broadband Optimization Method for Concentric Ring Arrays

Abstract

The invention discloses a thin-distributed broadband optimization method for concentric circular ring arrays. The method firstly aims at the comprehensive problem of circular aperture broadband arrays, establishes a genetic algorithm population based on concentric circular ring arrays, and designs optimization targets corresponding to multiple frequency points; and then loops At the beginning, the multiple objective functions of the population individuals are normalized on the hyperplane; then the adaptive normalized intersection radius is calculated, and the intersection subpopulations are divided according to this, and the corresponding probabilities are obtained respectively; Merge, perform non-dominated sorting based on the crowding distance, and obtain the offspring population; judge whether the maximum number of cycles is reached, if so, the algorithm ends, otherwise re-enter the cycle to start. This method applies multi-objective optimization to wideband arrays with sparse arrays, which effectively improves the convergence level of the algorithm, suppresses the peak sidelobes of sparsely arrayed arrays in wide frequency bands, and realizes high-performance round-aperture wideband array synthesis.

Description

technical field [0001] The invention relates to the field of array synthesis, in particular to a thin-distributed broadband optimization method for concentric circular arrays. Background technique [0002] In the fields of phased array radar and radio astronomy, wideband or ultra-wideband arrays have a wide range of practical application scenarios; and concentric ring arrays are also widely used because of their symmetry. With the expansion of the array scale, compared with the synthesis of uniform arrays, the sparse arrays with non-uniform and equal-amplitude excitation can greatly reduce the cost and complexity of the antenna system, and can achieve the comprehensive index of uniform arrays, so it is widely used. Research and Application. However, for a sparse array with high bandwidth, how to design the position of the array element and realize the optimization of the pattern on the broadband is the difficulty of this type of research. [0003] The main ideas of the exi...

AI Technical Summary

Problems solved by technology

These methods rely too much on design experience or mathematical approximation, or use a single index, and the existing multi-objective algorithm itself is difficult to achieve comprehensive optimization due to its high complexity and poor convergence when applied to broadband arrays.

Images