Array pattern synthesis using semidefinite programming and a bisection method

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 v...

Full description

Saved in:
Bibliographic Details
Published inETRI journal Vol. 41; no. 5; pp. 619 - 625
Main Authors Lee, Jong-Ho, Choi, Jeongsik, Lee, Woong-Hee, Song, Jiho
Format Journal Article
LanguageKorean
Published 한국전자통신연구원 31.10.2019
ETRI
Subjects
semidefinite programming
semidefinite relaxation
bisection method
array pattern synthesis
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:KISTI1.1003/JNL.JAKO201972468200524
ISSN:1225-6463
2233-7326