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

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>...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on antennas and propagation Jg. 66; H. 1; S. 149 - 159
Hauptverfasser: Pinchera, Daniele, Migliore, Marco Donald, Schettino, Fulvio, Lucido, Mario, Panariello, Gaetano
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.01.2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
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
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-926X
1558-2221
DOI:10.1109/TAP.2017.2767621