Array synthesis problems via convex relaxation - Université de Rennes Access content directly
Journal Articles APSURSI 2014 : Antennas and Propagation Society International Symposium Year : 2014

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.
Fichier principal
Vignette du fichier
Array synthesis problems_accepted.pdf (90.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01082699 , version 1 (14-11-2014)

Identifiers

Cite

Benjamin Fuchs. Array synthesis problems via convex relaxation. APSURSI 2014 : Antennas and Propagation Society International Symposium, 2014, pp.1361 - 1362. ⟨10.1109/APS.2014.6905006⟩. ⟨hal-01082699⟩
85 View
281 Download

Altmetric

Share

Gmail Facebook X LinkedIn More