Application of Convex Relaxation to Array Synthesis Problems - Université de Rennes Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Antennas and Propagation Année : 2014

Application of Convex Relaxation to Array Synthesis Problems

Résumé

A general procedure to solve efficiently non convex array synthesis problems is presented. It is based on the SemiDefinite Relaxation (SDR) technique. The way to properly relax the constraints in order to formulate the synthesis of shaped beams, phase-only arrays and reconfigurable arrays as semidefinite programming problems is detailed. These so-approximated array synthesis problems are then convex, easy to implement and can be efficiently solved using off-the-shelf numerical routines. The conditions under which the relaxed problems provide the optimal solution to the original non convex synthesis problems are specified. Various representative numerical comparisons with arrays designed by other approaches show the validity of the proposed method and illustrate its potentialities.

Domaines

Electronique
Fichier principal
Vignette du fichier
Application_of_Convex_Relaxation_to_Array_Synthesis_Problems.pdf (208.67 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00996644 , version 1 (26-05-2014)

Identifiants

Citer

Benjamin Fuchs. Application of Convex Relaxation to Array Synthesis Problems. IEEE Transactions on Antennas and Propagation, 2014, 62 (2), pp.634-640. ⟨10.1109/TAP.2013.2290797⟩. ⟨hal-00996644⟩
459 Consultations
907 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More