Array pattern synthesis using semidefinite programming and a bisection method

Jong Ho Lee, Jeongsik Choi, Woong Hee Lee, Jiho Song

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

In this paper, we propose an array pattern synthesis scheme using semidefinite programming (SDP) under array excitation power constraints. When an array pattern synthesis problem is formulated as an SDP problem, it is known that an additional rank-one constraint is generated inevitably and relaxed via semidefinite relaxation. If the solution to the relaxed SDP problem is not of rank one, then conventional SDP-based array pattern synthesis approaches fail to obtain optimal solutions because the additional rank-one constraint is not handled appropriately. To overcome this drawback, we adopted a bisection technique combined with a penalty function method. Numerical applications are presented to demonstrate the validity of the proposed scheme.

Original languageEnglish
Pages (from-to)619-625
Number of pages7
JournalETRI Journal
Volume41
Issue number5
DOIs
StatePublished - 1 Oct 2019

Keywords

  • array pattern synthesis
  • bisection method
  • semidefinite programming
  • semidefinite relaxation

Fingerprint

Dive into the research topics of 'Array pattern synthesis using semidefinite programming and a bisection method'. Together they form a unique fingerprint.

Cite this