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, which 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.
Subject
Electrical and Electronic Engineering,Computer Networks and Communications,Hardware and Architecture,Signal Processing,Control and Systems Engineering
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献