應(yīng)用遺傳算法進(jìn)行陣列天線綜合
Synthesis of Antenna Arrays Using Genetic Algorithm
-
摘要: 該文采用了兩種基于遺傳算法的方法對(duì)線陣列天線進(jìn)行了綜合。仿真結(jié)果表明，這兩種方法均能夠逼近Chebyshev綜合的結(jié)果。與Chebyshev法相比，具有靈活性強(qiáng)，不受天線工作頻率限制等優(yōu)點(diǎn)。其中第二種方法將遺傳算法與Schelkunoff法結(jié)合起來，能夠方便精確地在指定位置得到零點(diǎn)并滿足其它的優(yōu)化條件。
-
關(guān)鍵詞:
- 遺傳算法; 陣列天線; 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. -
謝處方,邱文杰.天線原理與設(shè)計(jì).西安:西北電訊工程學(xué)院出版社,1985:109-118.[2]王樸中,石長生.天線原理.北京:清華大學(xué)出版社,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. -
計(jì)量
- 文章訪問數(shù): 2201
- HTML全文瀏覽量: 106
- PDF下載量: 951
- 被引次數(shù): 0
下載:
