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

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

PINCHERA, Daniele;MIGLIORE, Marco Donald;SCHETTINO, Fulvio;LUCIDO, Mario;PANARIELLO, Gaetano
2018-01-01

Abstract

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 ℓ1 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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11580/64971
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 60
social impact