迭代傅里叶算法用于六边形稀疏阵列天线  

Iterative Fourier technique applied for Hexagon thinned array antenna

作　　者：刘恒[1] 刘波[1] 谢广钱[1] 赵宏伟[1] 

机构地区：[1]中国空间技术研究院西安分院,西安710100

出　　处：《电波科学学报》2015年第6期1235-1240,共6页Chinese Journal of Radio Science

基　　金：国家自然科学基金(61201089);国防重点实验室基金(9140C530101130C53013)

摘　　要：针对迭代傅里叶技术在优化稀疏阵列天线时对阵元激励大规模截断带来的不利影响,提出了一种逐步截断的迭代傅里叶算法.该算法从满阵依次减少数个阵元,从而避免阵列大规模截断陷入局部最优解.将其应用到六边形平面天线阵列的稀疏布阵优化中,以改善最大副瓣电平为目的.为了计算六边形天线阵的方向图,通过在口径中添加虚拟阵元转化为可以实现二维傅里叶变换的矩形阵列.仿真结果表明,改进的迭代傅里叶算法对稀疏天线阵最大旁瓣电平的优化比采用遗传算法的结果更理想,且具有计算量小和速度快等优点.A modified iterative Fourier technique (IFT) is proposed for disadvantage of numerous elements truncated in the thinned planar arrays synthesis of standard IFT. The method initialized form filled arrays and decreased several elements step by step to avoid running into local optimization. Then the modified IFT is applied to design a low side lobe hexagonal planar array by thinning process. Virtual elements are added in the array for translating the array to rectangle for calculating the array factor of hexagon conveniently. The simulated results show that the performance of the hexagonal planar array is better comparing with using genetic algorithm, and also has the advantage of less computation and high speed. Copyright © 2015 by Editorial Department of Chinese Journal of Radio Science

关 键 词：阵列天线 稀疏阵列 迭代傅里叶算法 副瓣电平 

分 类 号：TN820[电子电信—信息与通信工程]