By Topic

On the constrained synthesis of array patterns with applications to circular and arc arrays

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

2 Author(s)
Prasad, S. ; Indian Institute of Technology, New Delhi, India ; Charan, R.

Synthesis of array patterns involving optimization with linear and nonlinear constraints is considered. The general solution for the composite weight vector can be decomposed into a part which satisfies the linear constraints and another lying orthogonal to it. This decomposition is shown to yield simple solutions to several beam optimization problems including some with nonlinear constraints. A geometrical derivation of this result is presented which also provides new insights into the mechanism of null-steering via linear constraints. Application of this approach in conjunction with some search algorithms to the synthesis of optimum array patterns with prescribed narrow or broad nulls is shown to yield interesting and useful solutions. The results are illustrated by considering the design of "circular" and "arc" arrays.

Published in:

Antennas and Propagation, IEEE Transactions on  (Volume:32 ,  Issue: 7 )