Submitted:
02 November 2018
Posted:
05 November 2018
You are already at the latest version
Abstract
In this paper we present an efficient technique for the synthesis of very large sparse arrays, with arbitrary circularly symmetrical upper bounds for the pattern specifications. The algorithm, that is based on iterative smooth re-weighted L1 minimizations is very flexible, and is capable of achieving very good performances with respect to competitive algorithms. Furthermore, thanks to its efficiency, planar arrays of hundreds of wavelengths can be synthesized with limited computational effort.
Keywords:
Antenna Arrays
; Sparse arrays
; Radar
; Pattern Synthesis
; Signal Processing
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
