Pattern Synthesis of Time-Modulated Sparse Array by an OPM-CVX Algorithm

Abstract

This paper addresses the constrained multiobjective optimization problem of time-modulated sparse arrays. The synthesis objective is to find an optimal element arrangement and associated excitation strategy of sparse arrays, which realize the balance of radiation power and sideband suppression performance with minimum number of elements, and suppress side lobe level simultaneously. A novel hybrid algorithm based on orthogonal perturbation method and convex optimization (OPM-CVX) for the synthesis of time-modulated sparse antenna array is presented in this paper. In order to satisfy the main lobe beamforming and side lobe suppression of sparse arrays, the proposed method optimizes element positions with minimum array numbers by orthogonal perturbation method and optimizes excitations of array element with dynamic range ratio constraint by convex optimization. Furthermore, a trapezoidal pulse time-modulated switching function is proposed to find the balance of radiation power and sideband suppression performance. The numerical results indicate that the proposed algorithm can be an effective approach for synthesis problems of time-modulated sparse arrays.

Fast Synthesis Method for Large Aperture Array Pattern in the Presence of Array Errors

“…To address this issue, several synthesis methods have been proposed in recent years. e array pattern synthesis methods can be classified into three categories: analytical methods [13][14][15], intelligent algorithms [16][17][18][19][20][21], and convex optimization methods [22][23][24][25][26][27][28].…”