التفاصيل البيبلوغرافية
| العنوان: |
Array pattern synthesis using semidefinite programming and a bisection method. |
| المؤلفون: |
Lee, Jong‐Ho, Choi, Jeongsik, Lee, Woong‐Hee, Song, Jiho |
| المصدر: |
ETRI Journal; Oct2019, Vol. 41 Issue 5, p619-625, 7p |
| مصطلحات موضوعية: |
SEMIDEFINITE programming, RELAXATION for health |
| مستخلص: |
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. [ABSTRACT FROM AUTHOR] |
|
Copyright of ETRI Journal is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Supplemental Index |
Full Text Finder