By Topic

Optimal far-field focusing of uniformly spaced arrays subject to arbitrary upper bounds in nontarget directions

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)
Bucci, O.M. ; Dipt. di Ingegneria Elettronica e delle Telecomunicazioni, Univ. di Napoli "Federico II", Italy ; Caccavale, L. ; Isernia, T.

A new approach providing new theoretical results to the optimal far-field focusing of uniformly spaced arrays, subject to a completely arbitrary mask for sidelobe bounds, is presented and discussed. In both cases of linear or planar arrays (with rectangular boundaries), it is first shown that the problem can be formulated, without any loss to performances on the maximum, as a linear programming one, guaranteeing a globally optimal solution. Second, a sufficient uniqueness criterion for the solution of the overall problem is also developed, which shows how the solution may not be unique (as is actually the case) when planar arrays are considered. In addition, further globally effective optimization procedures are proposed for the latter case in order to optimize directivity, smoothness of excitations, or other performance parameters in the set of equivalent solutions. Last, an extension to planar arrays with a nonrectangular boundary is also given. A thorough numerical analysis confirms the effectiveness of the approach proposed and of the solution codes developed.

Published in:

Antennas and Propagation, IEEE Transactions on  (Volume:50 ,  Issue: 11 )