基于方向图拓展和FFT的阵列快速综合法

基于阵列方向图自身的周期特性，将方向图近似地拓展至不可见区域，使任意间隔阵列的方向矢量成为空间正交基，以便采用快速傅利叶变换算法，并通过迭代过程中迭代目标方向图的逐次改变，最终实现了阵列方向图的快速综合。数值计算结果和计算量分析表明，和现有方法比较，算法的收敛速度获得了很大的提高。这对于大规模的阵列，其优越性更加明显。

A speedy array pattern synthesis method based on pattern expansion and FFT

In this paper, a speedy pattern synthesis method is proposed by approximately expanding the array pattern to invisible region based on the periodicity of the array pattern. The directional vector of an array with various element interval could be used as a normal basis of the expansion, so that fast Fourier transform algorithm can be utilized and the synthesis algorithm is accelerated. The goal pattern is also adjusted in every step of the iteration to improve the convergent speed of the iteration. Numerical results show that the convergent speed can be greatly raised compared with the existing methods, especially for large arrays.