Share Email Print

Proceedings Paper

Antenna pattern synthesis through convex optimization
Author(s): Herve Lebret
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 7 June 1995
PDF: 11 pages
Proc. SPIE 2563, Advanced Signal Processing Algorithms, (7 June 1995); doi: 10.1117/12.211396
Show Author Affiliations
Herve Lebret, Office National d'Etudes et de Recherches Aerospatiales (France)

Published in SPIE Proceedings Vol. 2563:
Advanced Signal Processing Algorithms
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top