Array pattern synthesis with low sidelobe levels is widely used in practice. An effective way to incorporate sensor patterns in the design procedure is to use numerical optimization methods. However, the dimension of the optimization variables is very high for large-scale arrays, leading to high computational complexity. Fortunately, sensor arrays used in practice usually have symmetric structures that can be utilized to accelerate the optimization algorithms. This paper studies a fast pattern synthesis method by using the symmetry of array geometry. In this method, the problem of amplitude weighting is formulated as a second-order cone programming (SOCP) problem, in which the dynamic range of the weighting coefficients can also be taken into account. Then, by utilizing the symmetric property of array geometry, the dimension of the optimization problem as well as the number of constraints can be reduced significantly. As a consequence, the computational efficiency is greatly improved. Numerical experiments show that, for a uniform rectangular array (URA) with 1024 sensors, the computational efficiency is improved by a factor of 158, while for a uniform hexagonal array (UHA) with 1261 sensors, the improvement factor is 284.
Read full abstract