Please use this identifier to cite or link to this item:
|Title:||Synthesis of unequally spaced antenna arrays by a new differential evolutionary algorithm||Authors:||Lin, C.
Best of random
|Issue Date:||2009||Citation:||Lin, C.,Qing, A.,Feng, Q. (2009). Synthesis of unequally spaced antenna arrays by a new differential evolutionary algorithm. International Journal of Communication Networks and Information Security 1 (1) : 20-25. ScholarBank@NUS Repository.||Abstract:||The differential evolution (DE) algorithm with a new differential mutation base strategy, namely best of random, is applied to the synthesis of unequally spaced antenna arrays. In the best of random mutation strategy, the best individual among three randomly chosen individuals is used as the mutation base while the other two are for the vector difference. Hence a good balance of diversity and evolution speed can be obtained. An indirect coding method is utilized to convert the constrained synthesis problem to an unconstrained one. The effect of angle resolution of the radiation pattern is also discussed. Simulation results demonstrate that the new DE algorithm is promising.||Source Title:||International Journal of Communication Networks and Information Security||URI:||http://scholarbank.nus.edu.sg/handle/10635/111491||ISSN:||20760930|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 25, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.