Efficient Pencil Beam Synthesis in 4-D Antenna Arrays Using an Iterative Convex Optimization Algorithm

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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on antennas and propagation Ročník 67; číslo 11; s. 6847 - 6858
Hlavní autori: Yang, Feng, Yang, Shiwen, Chen, Yikai, Qu, Shiwei, Hu, Jun
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.11.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
4-D antenna arrays
Algorithms
Amplitude modulation
Antenna arrays
Antennas
Array synthesis
Computational geometry
Convex analysis
Convex functions
convex optimization
Convexity
Iterative algorithms
iterative convex optimization
Iterative methods
Nonlinear programming
Optimization
Optimization algorithms
Pencil beams
Sidebands
Switches
Synthesis
ISSN:0018-926X, 1558-2221
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-926X
1558-2221
DOI:10.1109/TAP.2019.2922817