应用遗传算法进行阵列天线综合
Synthesis of Antenna Arrays Using Genetic Algorithm
-
摘要: 该文采用了两种基于遗传算法的方法对线阵列天线进行了综合。仿真结果表明，这两种方法均能够逼近Chebyshev综合的结果。与Chebyshev法相比，具有灵活性强，不受天线工作频率限制等优点。其中第二种方法将遗传算法与Schelkunoff法结合起来，能够方便精确地在指定位置得到零点并满足其它的优化条件。Abstract: In this paper, two methods for the synthesis of the pattern of a linear array, based on Genetic Algorithm(GA), are discussed. The results of the two methods can all ap proximate the results of the Chebyshevs method. Compared with the method of Chebyshev, the two methods using GA have more flexibility and have no restriction on the frequency of the antenna. By using the second method which combines Schelkunoffs method with GA, arbitrary locations of nulls can be got in the pattern with other optimizing conditions.
-
谢处方,邱文杰.天线原理与设计.西安:西北电讯工程学院出版社,1985:109-118.[2]王朴中,石长生.天线原理.北京:清华大学出版社,1993:71-75.[3]Holland J H. Genetic algorithms. Scientific American, 1992, (6): 44-50.[4]Haupt R L. An introduction to genetic algorithms for electromagnetic. IEEE Antennas and Propagation Magazine, 1995, 37(2): 7-15.[5]Johnson J M, Rahmat-Samii Y. Genetic algorithms in engineering electromagnetics. IEEE Antennas and propagation Magazine, 1997, 39(4): 7-21.[6]Goldberg D E, Deb K. A comparative analysis of selection schemes used in genetic algorithms.Foundations of Genetic Algorithms, San Fransisco, USA, Morgan Kaufmann, 1991: 69-93.[7]Davis L. Adapting operator probabilities in genetic algorithms. Proc. of 3rd Int. Conf. on Genetic Algorithms, San Fransisco, USA, Morgan Kaufmann, 1989: 61-69.[8]Marcano D, Duran F. Synthesis of antenna arrays using genetic algorithms. IEEE Antennas and Propagation Magazine, 2000, 42(3): 12-20. -
计量
- 文章访问数: 2153
- HTML全文浏览量: 92
- PDF下载量: 944
- 被引次数: 0
下载:
