 |
 |
 |
Journal articles
Array synthesis problems via convex relaxation
Abstract : A general procedure, based on the SemiDefinite Re-laxation (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
Cited literature [9 references]
https://hal-univ-rennes1.archives-ouvertes.fr/hal-01082699
Contributor : Muriel Cadieu Connect in order to contact the contributor
Submitted on : Friday, November 14, 2014 - 10:26:33 AM
Last modification on : Thursday, January 7, 2021 - 4:20:25 PM
Long-term archiving on: : Friday, April 14, 2017 - 2:43:29 PM
Contributor : Muriel Cadieu Connect in order to contact the contributor
Submitted on : Friday, November 14, 2014 - 10:26:33 AM
Last modification on : Thursday, January 7, 2021 - 4:20:25 PM
Long-term archiving on: : Friday, April 14, 2017 - 2:43:29 PM
File
Array synthesis problems_accep...
Files produced by the author(s)