Extreme Sparse-Array Synthesis via Iterative Convex Optimization and Simulated-Annealing Expanded Array
Sparse-array synthesis can considerably reduce the number of sensor elements while optimizing the beam-pattern response performance. The sparsity of an array is related to the degrees of freedom of the array elements. A sparse-array method based on iterative convex optimization and a simulated-annea...
Main Authors: | Boxuan Gu, Rongxin Jiang, Xuesong Liu, Yaowu Chen |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-03-01
|
Series: | Electronics |
Subjects: | |
Online Access: | https://www.mdpi.com/2079-9292/12/6/1401 |
Similar Items
-
Optimization of Sparse Cross Array Synthesis via Perturbed Convex Optimization
by: Boxuan Gu, et al.
Published: (2020-08-01) -
Synthesis of Linear and Planar Arrays Via Sequential Convex Optimizations
by: Zhengdong Qi, et al.
Published: (2020-01-01) -
Synthesis of Sparse Arrays Based On CIGA (Convex Improved Genetic Algorithm)
by: Jianxiong Li, et al.
Published: (2020-11-01) -
Simulated Annealing Assisted Sparse Array Selection Utilizing Deep Learning
by: Steven Wandale, et al.
Published: (2021-01-01) -
Gain and Phase Calibration of Uniform Rectangular Arrays Based on Convex Optimization and Neural Networks
by: Xiran Jie, et al.
Published: (2022-02-01)