z-logo
open-access-imgOpen Access
Research on Pattern Synthesis of Time Modulated Sparse Array Based on Discrete Variable Convex Optimization
Author(s) -
Jing Tan,
Jiawen Hu,
Xikuan Dong,
Hailin Li,
Jianjiang Zhou
Publication year - 2021
Publication title -
wireless communications and mobile computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.42
H-Index - 64
eISSN - 1530-8677
pISSN - 1530-8669
DOI - 10.1155/2021/6622168
Subject(s) - sparse array , convex optimization , computer science , sideband , optimization problem , algorithm , mathematical optimization , modulation (music) , sensor array , regular polygon , mathematics , radio frequency , telecommunications , acoustics , physics , geometry , machine learning
Effective resource utilization is an important problem in the application of array, especially for the new time modulated array. Considering the problem of full utilization of array elements in time modulated array, a sparse optimization algorithm based on discrete variable convex optimization is proposed in this paper. The pattern optimization of equal excitation time modulation array is realized in two stages: In the first stage, the number of working array elements is as low as possible under the condition of suppressing the sidelobe of the central frequency. In the second stage, the sideband is suppressed by iterative convex optimization. The numerical simulation results are compared with other methods to verify the effectiveness of the proposed method in pattern optimization of equal excitation time modulation array. Finally, the optimization performance of the algorithm with different array parameters is verified.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom