Abstract

The sparse array pattern synthesis (APS) has many important implications in some special situations where the weights, size, and cost of antennas are limited. In this chapter, the APS with a minimum number of elements problem is investigated from the perspective of sparseness constrained optimization. Firstly, to reduce the number of antenna elements in the array, the APS problem is formulated as sparseness constrained optimization problem under compressive sensing (CS) framework and solved by using the reweighted L1-norm minimization algorithm. Besides, to address left-right radiation pattern ambiguity problem, the proposed algorithm exploits the array orientation diversity in the sparsity constraint framework. Simulation results demonstrate the proposed method's validity of achieving the desired radiation beampattern with the minimum number of antenna elements.

Keywords: array beampattern synthesis, compressive sensing, array orientation diversity, convex optimization
