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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on antennas and propagation Ročník 66; číslo 1; s. 149 - 159
Hlavní autoři: Pinchera, Daniele, Migliore, Marco Donald, Schettino, Fulvio, Lucido, Mario, Panariello, Gaetano
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.01.2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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