Hybrid Iterative Fourier Transform and Convex Optimization for Pattern Synthesis of Sparse Linear Arrays

The paper deals with the peak sidelobe level (PSLL) suppression problem with sparse linear array antenna. Firstly, the iterative Fourier transform (IFT) algorithm is utilized to optimally selected a thinned linear array which would meet the predetermined fill factor. With the first-order Taylor expa...

Full description

Saved in:
Bibliographic Details
Published in2021 International Conference on Microwave and Millimeter Wave Technology (ICMMT) pp. 1 - 3
Main Authors Xie, Qi, Chen, Bo, Lin, Zhipeng, Lei, Shiwen, Zhang, Yinghao, Xu, Jun
Format Conference Proceeding
LanguageEnglish
Published IEEE 23.05.2021
Subjects
Array synthesis
Convex functions
convex optimization
Fourier transforms
iterative Fourier transform (IFT)
Microwave integrated circuits
Microwave technology
Millimeter wave technology
Optimization methods
sparse array
Taylor series
Online AccessGet full text
DOI10.1109/ICMMT52847.2021.9618200

Cover

More Information
Summary:The paper deals with the peak sidelobe level (PSLL) suppression problem with sparse linear array antenna. Firstly, the iterative Fourier transform (IFT) algorithm is utilized to optimally selected a thinned linear array which would meet the predetermined fill factor. With the first-order Taylor expansion of the far field with respect to the element position, the original optimization problem is converted to be convex. Then, the element positions of the thinned arrays are further optimized via a convex optimization algorithm. Compared with the existing method, the proposed one can greatly improve the sidelobe performance. Numerical results indicate the proposed method is effective for sparse array synthesis with low PSLL.
DOI:10.1109/ICMMT52847.2021.9618200