In this article, we investigate a novel iterative antenna array synthesis method. The method is based on the iterative addition of antenna array elements. After defining the synthesis algorithm, we prove that the discrepancy between the goal and the synthesized pattern converges to the theoretical lower bound in the sense of a certain norm. The algorithm is also extended to iteratively replace already placed elements and for the synthesis of multiple goal patterns with the same array geometry but with different excitations. Some numerical examples are shown to illustrate the convergence properties of the proposed method. Possible applications include circularly polarized patterns, since the algorithm can handle the rotation as well as translation of the antenna elements.

中文翻译：

---

使用迭代方法的天线阵列方向图合成

在本文中，我们研究了一种新颖的迭代天线阵列合成方法。该方法基于天线阵元的迭代相加。在定义了合成算法之后，我们证明了目标和合成模式之间的差异收敛到一定范数意义上的理论下界。该算法还扩展到迭代替换已放置的元素，并用于合成具有相同阵列几何形状但具有不同激励的多个目标模式。给出了一些数值例子来说明所提出方法的收敛特性。可能的应用包括圆极化模式，因为该算法可以处理天线元件的旋转和平移。