期刊
ELECTRONICS
卷 11, 期 20, 页码 -出版社
MDPI
DOI: 10.3390/electronics11203366
关键词
array synthesis; genetic algorithm; Newton's iterative method; sidelobe calculation; sparse array
资金
- National Natural Science Foundation of China [62001025]
In this paper, an iterative sidelobe-seeking method for calculating the sidelobe level of arbitrarily distributed planar arrays is proposed, which significantly reduces the computation time compared to the conventional method. Numerical experiments have verified the effectiveness of the proposed method, showing similar optimization results with 80% algorithm time saved in synthesizing a sparse planar array.
Sidelobe level is a key parameter for phased array design. However, the conventional method for sidelobe level calculation is time-consuming due to the high sampling number of the radiation pattern. In this paper, an iterative sidelobe-seeking method for sidelobe calculation of arbitrarily distributed planar arrays is proposed to shorten the computing time. By applying Newton's iterative method with an approximate formula, the proposed method uses less sampling to obtain the sidelobe positions and the peak sidelobe level. Numerical experiments were carried out and verified the effectiveness of the proposed method. Compared with the conventional method, the proposed method had a similar optimization effect but saved 80% of the algorithm time in the synthesis of a sparse planar array.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据