Journal
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION
Volume 48, Issue 12, Pages 1837-1847Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/8.901272
Keywords
antenna synthesis; arrays; near-field constraints; optimal focusing; optimal synthesis
Ask authors/readers for more resources
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 are 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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available