Planar Beam-Scanning Sparse Array Synthesis with Minimum Spacing Constraint

摘要

In this paper, a new method is proposed to synthesize a planar beam-scanning sparse array with minimum inter-element spacing constraint. Perturbed compressive sampling (PCS) and convex optimization are two existing sparse array synthesis methods, which have their shortcomings in different indicators. The method of this paper combines the advantages of PCS and convex optimization to maintain the merits of synthesis speed, sparsity and gain while restraining the minimum inter-element spacing. Examples of planar sparse arrays whose minimum spacing is larger than 0.5 wavelength are given to show the performance of this method. The different situations of scanning and not scanning are also shown in the examples.