Synthesis of Large Sparse Arrays Using IDEA (Inflating-Deflating Exploration Algorithm)

We introduce an effective antenna array synthesis algorithm which is aimed to the generation of sparse arrays radiating patterns with arbitrary upper bounds. The approach based on a convex optimization exploits an iterative polygonal expansion and contraction of the sources, and is suitable for the synthesis of linear and planar arrays. Numerical simulations show that the proposed algorithm allows a degree of sparsification equal or better than the one achievable by concurrent algorithms, with a significantly lower computational burden with respect to the best ones, allowing the effective synthesis of sparse arrays of hundreds of wavelengths with simple office computers.