| 摘要: |
| 针对现有的平顶波束综合形成算法计算量较大的问题，提出了一种迭代求解平顶波束的快速形成算法。该算法首先设置方向图参数、迭代条件，然后利用方向图与阵元加权系数的变换关系设计投影算法并通过二阶差分运算确定过渡带，最后结合蝶形计算方法快速迭代逼近理想的平顶方向图。实验结果表明，该算法相比凸优化算法运算效率较高，并且可修复阵元失效后的平顶方向图。算法运算次数随着副瓣阈值、主瓣宽度和零陷深度等参数的变化而变化。 |
| 关键词: 阵列天线 平顶方向图 迭代傅里叶变换 方向图修复 |
| DOI： |
|
| 基金项目:国防预研基金(9140A19031015JB34001) |
|
| An iterative projected algorithm in synthesis of flat-top pattern |
| LIU Qiwei,MA Yanheng,LI Gen,DONG Jian,TANG Xiuyuan |
| (Department of Unmanned Aerial Vehicle Engineering,Army Engineering University Shijiazhuang Campus,Shijiazhuang 050003,China;Unit 32183 of PLA,Jinzhou 121000,China) |
| Abstract: |
| In view of the problem of complex calculations of existing pattern synthesis algorithm for antenna arrays,iterative Fourier transform(IFT) used in the synthesis of flat-top pattern for uniform linear array is proposed.This algorithm firstly sets the parameters of pattern and iterative conditions.Then,the projected algorithm is designed by using the transformational relationship between the pattern and the weights coefficient of array elements,and the transitional band is determined by the operation of second-order difference.Finally,combined with the butterfly calculation,fast iterative method is used to approximate to the ideal flat-top pattern.The experimental results show that the proposed algorithm is more efficient than the convex optimized algorithm and can repair the flat-top pattern after the array elements fail.The number of operations varies with the parameters of pattern,such as sidelobe threshold,mainlobe width,and depth of depression. |
| Key words: antenna arrays flat-top pattern iterative Fourier transform pattern repairing |
