By Topic

Reducing the Number of Elements in Linear and Planar Antenna Arrays With Sparseness Constrained Optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wenji Zhang ; Inst. of Electron., Chinese Acad. of Sci., Beijing, China ; Lian Li ; Fang Li

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 )