Synthesis of Sparse Circular-Arc Arrays with Wide Angle Scanning Based on Iterative Convex Optimization

An iterative convex optimization algorithm for wide scanning sparse conformal array synthesis is proposed. Combined with the compressed sensing (CS) theory, the proposed method is used to find the optimal element position for multiple scanning angle patterns by using cooperative synthesis strategy. The iterative algorithm first uses Euler’s calculation transformation to overcome the problem that the element pattern cannot be superimposed in a unified coordinate system due to the different distribution positions of the array elements. Secondly, the non-convex sparsity problem of circular-arc array with limited mainlobe width is transformed into a convex form with minimized l
1
norm. Several numerical simulations are operated to validate the correctness and effectiveness of the proposed algorithm.