DocumentCode
247259
Title
Array synthesis problems via convex relaxation
Author
Fuchs, Benjamin
Author_Institution
IETR, Univ. of Rennes 1, Rennes, France
fYear
2014
fDate
6-11 July 2014
Firstpage
1361
Lastpage
1362
Abstract
A general procedure, based on the SemiDefinite Relaxation (SDR) technique, is presented to solve efficiently a wide range of difficult (because non-convex) array synthesis problems. This powerful approximation technique is easy to implement and the so-approximated problem can then be efficiently solved using off-the-shelf numerical routines. Examples of shaped beam and reconfigurable array synthesis are shown to illustrate the potentialities of the proposed approach.
Keywords
approximation theory; linear antenna arrays; nonlinear programming; shaped beam antennas; SDR technique; approximation technique; convex relaxation; general procedure; off-the-shelf numerical routines; reconfigurable array synthesis; semidefinite relaxation technique; shaped beam array synthesis; so-approximated problem; Antennas; Approximation methods; Arrays; Optimization; Programming; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Antennas and Propagation Society International Symposium (APSURSI), 2014 IEEE
Conference_Location
Memphis, TN
ISSN
1522-3965
Print_ISBN
978-1-4799-3538-3
Type
conf
DOI
10.1109/APS.2014.6905006
Filename
6905006
Link To Document