Synthesis of sparse linear array using IFT-inflating deflating exploration algorithm

• Published in: Digital signal processing Vol. 158; p. 104952
• Main Authors: Guo, Qiang, Liu, Taiyan, Li, Daren, Huang, Shuai, Kaliuzhnyi, Mykola
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 01.03.2025
• Subjects: Antenna arrays; Antenna radiation pattern synthesis; Iterative Fourier technique (IFT); Null placement; Weighting density; Weighting density; Antenna radiation pattern synthesis; Null placement; Iterative Fourier technique (IFT); Antenna arrays
• ISSN: 1051-2004
• DOI: 10.1016/j.dsp.2024.104952

In this paper, we propose a new antenna array synthesis algorithm (IFT-IDEA), aimed at synthesizing sparse arrays with low sidelobe levels (SLL) under specified sparsity. The algorithm starts by selecting an initial thinned linear array using Iterative Fourier techniques (IFT). Then, it uses convex optimization to iteratively expand and contract the elements, further optimizing the element excitations and positions to achieve lower sidelobe levels under specified sparsity. During the iterative optimization process, the array's weighted linear density is approximated to a reference value to ensure that all elements are retained. Numerical results demonstrate that IFT-IDEA is effective for synthesizing both symmetric and asymmetric arrays, it also performs well in optimization of large linear array. Additionally, we explored the use of IFT-IDEA for synthesizing low sidelobe patterns with null placement. Compared to other algorithms, IFT-IDEA exhibits superior performance and robustness in the problem of low sidelobe array synthesis.