Referenced Items are not available for this document.
The synthesis of sparse antenna arrays has many practical applications in situations where the weight, size and cost of antennas are limited. In this communication the antenna array synthesis problem, with minimum number of elements, is studied from the new perspective of sparseness constrained optimization. The number of antenna elements in the array can be efficiently reduced by casting the array synthesis problem into the framework of sparseness constrained optimization and solving with the Bayesian compressive sensing (BCS) inversion algorithm. Numerical examples of both linear and planar arrays are presented to show the high efficiency of achieving the desired radiation pattern with a minimum number of antenna elements.
Published in:
Antennas and Propagation, IEEE Transactions on
(Volume:59
,
Issue:
8
)
Date of Publication: Aug. 2011
- Page(s):
- 3106 - 3111
- ISSN :
- 0018-926X
- INSPEC Accession Number:
- 12143195
- Digital Object Identifier :
- 10.1109/TAP.2011.2158943
- Product Type:
- Journals & Magazines
- Date of Publication :
- 06 June 2011
- Date of Current Version :
- 01 August 2011
- Issue Date :
- Aug. 2011
- Sponsored by :
- IEEE Antennas and Propagation Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
