期刊
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION
卷 67, 期 11, 页码 6847-6858出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAP.2019.2922817
关键词
Antenna arrays; Optimization; Convex functions; Amplitude modulation; Switches; Iterative algorithms; Array synthesis; convex optimization; 4-D antenna arrays; iterative convex optimization
资金
- National Natural Science Foundation of China [61631006, 61721001, 61571101]
A novel iterative convex optimization algorithm is proposed for the efficient synthesis of 4-D antenna arrays in this paper. A general nonconvex programming problem in terms of pencil beam synthesis at the center frequency and the suppression of multiple sidebands with different time schemes is first established. In order to decrease the nonconvexity with respect to equivalent excitations, the nonconvex programming problem is then decomposed into a convex optimization problem at the center frequency and a simplified nonconvex optimization problem at sidebands. Based on the optimized results at the center frequency, an iterative convex optimization algorithm that consists in solving a sequence of convex optimization problems is adopted to solve the nonconvex optimization problem efficiently. Because of the introduction of iterative idea and convex optimization, the proposed method achieves a good tradeoff between the optimization time and the optimality of the solution for the synthesis of 4-D antenna arrays of various scales. Numerical examples of uniformly or nonuniformly spaced 4-D antenna arrays are presented to demonstrate the excellent performance of the proposed algorithm in comparison with those of the previously reported methods.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据