Efficient Large Sparse Arrays Synthesis by Means of Smooth Re-Weighted L1 Minimization
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, which is based on iterative smooth re-weighted L1 minimizations, is very flexible and is capable of achiev...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-01-01
|
| Series: | Electronics |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2079-9292/8/1/83 |