Optimal Beamforming via Interior Point Methods

Author: Lebret H.

Source: The Journal of VLSI Signal Processing, Volume 14, Number 1, 1996 , pp. 29-41(13)

Publisher: Springer

Buy & download fulltext article:

Price: $47.00 plus tax (Refund Policy)

Abstract:

We show that two antenna array pattern synthesis problems can be expressed as convex optimization problems. The first one deals with a symmetric planar array with real weights, which can be expressed as a linear program. The second one concerns a broadband acoustic array, which becomes a convex quadratically constrained quadratic program. Because these two problems are convex, they can be (numerically) solved with great efficiency by recently developed interior-point methods. Thanks to the efficiency of the interior point methods, we also built a computer-aided design tool for the first problem.

Language: English

Document Type: Regular paper

Affiliations: 1: ENSTA, DFR/A, 32 Bd Victor, 75 739 PARIS Cedex 15, France

Publication date: 1996-01-01