Pattern-reconfigurable sparse array synthesis with minimum element spacing constraint
Due to the coupling effects caused by closely spaced array elements, the minimum spacing constraint is introduced into the synthesis of a multiple-pattern sparse array, and a low-complexity off-grid sparse reconstruction algorithm is applied to achieve precise array element position. The auxiliary w...
Saved in:
Published in | Journal of electromagnetic waves and applications Vol. 39; no. 7; pp. 810 - 821 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Taylor & Francis
03.05.2025
|
Subjects | |
Online Access | Get full text |
ISSN | 0920-5071 1569-3937 |
DOI | 10.1080/09205071.2025.2477662 |
Cover
Summary: | Due to the coupling effects caused by closely spaced array elements, the minimum spacing constraint is introduced into the synthesis of a multiple-pattern sparse array, and a low-complexity off-grid sparse reconstruction algorithm is applied to achieve precise array element position. The auxiliary weighted vector with spacing constraint is incorporated into the off-grid synthesis problem, transforming the initial l
0
-norm optimization into the mixed l
0
/l
1
-norm optimization, and a sequential alternating iteration (SAI) method has been presented to approach the optimization problems. In addition, convex optimization is employed to simultaneously obtain offsets to decrease reconstruction errors in different beam patterns. The experimental results show that the SAI method achieves the desired antenna patterns for multiple scanning angles through the optimal arrangement of sparse array elements while ensuring sufficient array element spacing. Compared to the previous method, the pattern error is reduced by 16.67% and the sparsity is increased by 20%. |
---|---|
ISSN: | 0920-5071 1569-3937 |
DOI: | 10.1080/09205071.2025.2477662 |