Research On High Efficiency Technology Of Sparse Array Synthesis Based On Convex Optimization

With the increasing demand for high-performance,and low-cost array antennas,sparse array antennas have wider and wider application prospects,so higher and higher requirements are placed on the performance of sparse array synthesis algorithms.The convex optimization algorithm has excellent optimization ability,and the algorithm based on convex optimization is a major research hotspot in the sparse array synthesis algorithm.In the context,this thesis focuses on analyzing the characteristics of convex optimization algorithms,researching methods to further improve the performance of convex optimization algorithms,and devoting to summarizing methods that can efficiently synthesize sparse arrays with excellent performance.This thesis carries out research work around the above goals,and the main contents are as follows:1)Aiming at the problem that it is difficult to take into account the solution efficiency and the optimality of the solution in the iterative convex optimization algorithm,the characteristics of the convex optimization algorithm based on the interior point method are analyzed,and the reduction of the number of variables and the simplified boundary are summarized.The two feasible methods of the condition,through the analysis of the solution process of the traditional iterative convex optimization algorithm,two subdivision techniques of non-uniform grid and adaptive grid are introduced,and the Adaptive-Gridding Iterative Convex Optimizations(AGICO)algorithm is proposed.2)The AGICO algorithm is used in the research of array synthesis,and the problems of sparse wiring array and planar array are synthesized.The calculation example proves that this method can improve the calculation efficiency when synthesizing the array with high sparse rate or many grid points.The proposed method has better stability than the traditional iterative convex optimization algorithm when there are many grid points.On this basis,for the large-scale planar array synthesis problem,the quadratic optimization method is adopted,and good optimization results are obtained.3)The AGICO algorithm is used to synthesize the conformal array and the array with broadband FI characteristics respectively,and it is verified that the method is the same as the traditional iterative convex optimization algorithm,and has good applicability to a variety of complex array synthesis problems.Based on the sparse array synthesis problem of AGICO algorithm and non-uniform sampling,a sparse array with good optimality can be obtained efficiently.