Antenna pattern synthesis through convex optimization

Herve Lebret

doi:10.1117/12.211396

7 June 1995 Antenna pattern synthesis through convex optimization

Herve Lebret

Proceedings Volume 2563, Advanced Signal Processing Algorithms; (1995) https://doi.org/10.1117/12.211396
Event: SPIE's 1995 International Symposium on Optical Science, Engineering, and Instrumentation, 1995, San Diego, CA, United States

Abstract

Antenna pattern synthesis deals with choosing control parameters (the complex weights) of an array of antennas, in order to achieve a set of given specifications. It appears that these problems can often be formulated as convex optimization problems, which can be numerically solved with algorithms such as the ellipsoid algorithm of interior point methods. After a brief presentation of antenna pattern synthesis and of convex optimization, we illustrate then with simulations results. We first minimize the sidelobe levels of a cosecant diagram. Then we show an example of interference cancellation and compare it to adaptive techniques. We will also introduce the important problem of robust antenna arrays.

Citation Download Citation

Herve Lebret "Antenna pattern synthesis through convex optimization", Proc. SPIE 2563, Advanced Signal Processing Algorithms, (7 June 1995); https://doi.org/10.1117/12.211396

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available