By Topic

Optimal synthesis of difference patterns subject to arbitrary sidelobe bounds by using arbitrary array antennas

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 $31
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. ; DIET, Univ. Federico di Napoli, Italy ; D'Urso, M. ; Isernia, T.

Two new approaches to the optimal synthesis of difference patterns are proposed that can deal in an effective fashion with arbitrary sidelobe bounds. The first approach, which amounts to solving a convex programming problem, can be applied to completely arbitrary (fixed geometry) arrays and it is capable of taking into account additional constraints. The second approach, which amounts to solving a simpler linear programming problem, can be applied to uniformly spaced linear or planar arrays, and allows results about the uniqueness of the solution to be inferred. Numerical examples show the flexibility and effectiveness of the proposed procedures.

Published in:

Microwaves, Antennas and Propagation, IEE Proceedings  (Volume:152 ,  Issue: 3 )