Synthesis of Linear and Planar Arrays Via Sequential Convex Optimizations
In this paper, an iterative procedure for the synthesis of sparse arrays radiating focused beampattern is presented. The proposed approach provides a significant reduction in the complexity of the beam forming network, which is fulfilled by reducing the number of antenna elements in the array. An it...
Main Authors: | Zhengdong Qi, Yechao Bai, Xinggan Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8945250/ |
Similar Items
-
Extreme Sparse-Array Synthesis via Iterative Convex Optimization and Simulated-Annealing Expanded Array
by: Boxuan Gu, et al.
Published: (2023-03-01) -
Synthesis of Sparse Arrays Based On CIGA (Convex Improved Genetic Algorithm)
by: Jianxiong Li, et al.
Published: (2020-11-01) -
Concentric Ring Array Synthesis for Low Side Lobes: An Overview and a Tool for Optimizing Ring Radii and Angle of Rotation
by: Yanki Aslan, et al.
Published: (2021-01-01) -
Anti-Error Robust Pattern Synthesis Algorithm in Time-Modulated Array Antenna
by: Yuanjin Tian, et al.
Published: (2022-01-01) -
Optimization of Sparse Cross Array Synthesis via Perturbed Convex Optimization
by: Boxuan Gu, et al.
Published: (2020-08-01)