Skip to Main content Skip to Navigation
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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal-univ-rennes1.archives-ouvertes.fr/hal-01082699
Contributor : Muriel Cadieu <>
Submitted on : Friday, November 14, 2014 - 10:26:33 AM
Last modification on : Monday, October 5, 2020 - 9:50:18 AM
Long-term archiving on: : Friday, April 14, 2017 - 2:43:29 PM

File

Array synthesis problems_accep...
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

326

Files downloads

473