An Effective Compressed-Sensing Inspired Deterministic Algorithm for Sparse Array Synthesis

• Published in: IEEE transactions on antennas and propagation Vol. 66; no. 1; pp. 149 - 159
• Main Authors: Pinchera, Daniele, Migliore, Marco Donald, Schettino, Fulvio, Lucido, Mario, Panariello, Gaetano
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.01.2018; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Antenna arrays; Antenna measurements; antenna radiation pattern synthesis; Compressed sensing; Convergence; Minimization; optimization methods; Radar antennas; sparse array antennas; Synthesis
• ISSN: 0018-926X; 1558-2221
• DOI: 10.1109/TAP.2017.2767621

The aim of this paper is to discuss a novel technique for sparse array synthesis. The synthesis strategy is based on a sparse-forcing algorithm using an improvement of the reweighted <inline-formula> <tex-math notation="LaTeX">\ell _{1} </tex-math></inline-formula> minimization proposed in the framework of the compressed-sensing literature, specifically modified in order to tailor both linear and conformal array synthesis problems. The numerical examples show that the proposed algorithm improves the results provided by concurrent techniques, reducing the number of radiating elements and/or the computational effort.