J4 ›› 2013, Vol. 40 ›› Issue (4): 85-89+187.doi: 10.3969/j.issn.1001-2400.2013.04.014

• 研究论文 • 上一篇    下一篇

自适应迭代傅里叶算法用于阵列方向图综合

王新宽;焦永昌;谭艳艳   

  1. (西安电子科技大学 天线与微波技术重点实验室,陕西 西安  710071)
  • 收稿日期:2012-05-03 出版日期:2013-08-20 发布日期:2013-10-10
  • 通讯作者: 王新宽
  • 作者简介:王新宽(1981-),男,西安电子科技大学博士研究生,E-mail: xkwang@stu.xidian.edu.cn.
  • 基金资助:

    国家自然科学基金资助项目(61201022)

Adaptive iteration Fourier technique applied for antenna arrays pattern synthesis

WANG Xinkuan;JIAO Yongchang;TAN Yanyan   

  1.  (Science and Technology on Antenna and Microwave Lab., Xidian Univ., Xi'an  710071, China)
  • Received:2012-05-03 Online:2013-08-20 Published:2013-10-10
  • Contact: WANG Xinkuan

摘要:

在已有的迭代傅里叶变换方法的基础上,提出了一种用于阵列天线方向图综合的自适应迭代傅里叶算法.与原来算法相比,该算法的特点主要表现在: (1)能够自适应地计算所需的峰值旁瓣阈值,以获得满足特定需求的最优阵元激励分布.(2)采用非均匀阵元激励,从而较大程度地满足了旁瓣降低的需求.(3)对于被大幅度截断的阵列,该算法通过自适应调整主瓣边缘区域阵列因子的值来降低天线方向图的主瓣波束宽度,从而有效抑制了波束展宽效应.基于不同设计需求的方向图综合结果,表明了文中算法的有效性和高效性.

关键词: 傅里叶变换, 阵列天线, 方向图综合, 峰值旁瓣阈值, 旁瓣降低

Abstract:

Based on the existing method of iterative Fourier transforms, an adaptive iteration Fourier technique (AIFT) is proposed for antenna arrays synthesis. Compared with the initial method, three different aspects exist in AIFT. Firstly, the method could adaptively compute the peak sidelobe threshold(PST) in order to obtain the optimum distribution of element excitations satisfying the objective parameter. Secondly, un-uniform element excitations are employed to meet the requirement of sidelobe reduction. Thirdly, when the antenna arrays were massively truncated, the method could lower the beamwidth of their far field patterns by adaptively modulating the value of array factors that are located in the edge region of mainlobes so that the beam broadening caused by the initial method could be efficiently avoided. Simulation results for different design requirements show the effectiveness and high efficiency of the proposed method.

Key words: Fourier transforms, antenna arrays, pattern synthesis, peak sidelobe threshold, sidelobe reduction

中图分类号: 

  • TN820.1