DocumentCode
2603583
Title
Convex optimization for antenna array processing
Author
Lebret, Hervé
Author_Institution
ENSTA, Paris, France
fYear
1996
fDate
24-26 Jun 1996
Firstpage
74
Lastpage
77
Abstract
Antenna array pattern synthesis deals with choosing the complex weights of an antenna array in order to satisfy a set of specifications or to say if such a set is feasible. It appears that these problems can often be expressed as convex optimization problems which can be solved numerically with algorithms such as interior point methods. Two examples are given dealing with constrained adaptive array processing and robustness issues
Keywords
adaptive signal processing; antenna radiation patterns; array signal processing; linear antenna arrays; optimisation; algorithms; antenna array pattern synthesis; antenna array processing; complex weights; constrained adaptive array processing; convex optimization; interior point methods; linear array; robustness; Adaptive arrays; Antenna arrays; Array signal processing; Azimuth; Books; Design optimization; Directive antennas; Geometry; Linear antenna arrays; Robustness;
fLanguage
English
Publisher
ieee
Conference_Titel
Statistical Signal and Array Processing, 1996. Proceedings., 8th IEEE Signal Processing Workshop on (Cat. No.96TB10004
Conference_Location
Corfu
Print_ISBN
0-8186-7576-4
Type
conf
DOI
10.1109/SSAP.1996.534823
Filename
534823
Link To Document