By Topic

Beampattern Synthesis for Linear and Planar Arrays With Antenna Selection by Convex 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

4 Author(s)
Siew Eng Nai ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore, Singapore ; Wee Ser ; Zhu Liang Yu ; Huawei Chen

A convex optimization based beampattern synthesis method with antenna selection is proposed for linear and planar arrays. Conjugate symmetric beamforming weights are used so that the upper and non-convex lower bound constraints on the beampattern can be convex. Thus, a mainlobe of an arbitrary beamwidth and response ripple can be obtained. This method can achieve completely arbitrary sidelobe levels. By minimizing a re-weighted objective function based on the magnitudes of the elements in the beamforming weight vector iteratively, the proposed method selects certain antennas in an array to satisfy the prescribed beampattern specifications precisely. Interestingly, a sparse array with fewer antennas (compared to other methods) is produced. This method can design non-uniformly spaced arrays with inter-element spacings larger than one half-wavelength, without the appearance of grating lobes in the resulting beampattern. Simulations are shown using arrays of up to a few hundred antennas to illustrate the practicality of the proposed method.

Published in:

Antennas and Propagation, IEEE Transactions on  (Volume:58 ,  Issue: 12 )