By Topic

An effective approach for the optimal focusing of array fields subject to arbitrary upper bounds

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)
Isernia, T. ; Dipt. di Ingegneria Elettronica e delle Telecommunicazioni, Naples Univ., Italy ; Di Iorio, P. ; Soldovieri, F.

A new approach to the optimal focusing of array fields subject to arbitrary upper bounds is presented. The approach formulates the problem as the minimization of a linear function in a convex set. Unlike other approaches, this one guarantees the achievement of the global optimum by using local optimization techniques and can, moreover, deal with any convex constraint on the unknowns, such as near field constraints. Optimization is performed by two ad hoc developed solution algorithms, which exploit the geometrical characteristics of the problem at hand, thus leading to extremely effective and computationally efficient numerical codes. An extensive numerical analysis has been performed in all cases of linear, planar, and circular arc arrays. The enhanced performance of the proposed technique with respect to the solution algorithms available in the literature fully confirms the effectiveness of the approach

Published in:

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