Allele Gene Based Adaptive Genetic Algorithm to the Code Design

In this work, an allele gene adaptive mutation (AGAM) and a schemata crossover (SC) operators are designed to improve the performance of the conventional genetic algorithm (GA) and applied to the code design. Specifically, the proposed AGAM exploits both global and local information of the population to maintain an appropriate level of diversity throughout the search process. The SC utilizes high-performance schemata to enhance the traditional crossover operation. The combination of the AGAM and SC achieves both goals of maintaining population diversity and simultaneously sustaining the convergence capability of the GA. As a result, the SC and AGAM based genetic algorithm alleviates the inherent premature convergence of the GA, thus significantly increasing the chance of locating the global optimal solution. The application of the proposed allele based adaptive genetic algorithm (AGAGA) to the universal mobile telecommunications system (UMTS) time-division duplex (TDD) mode leads to significant performance gains on autocorrelation (6.1 dB) and cross-correlation properties (2.0 dB) over those of the current standard.

[1]  John Holland,et al.  Adaptation in Natural and Artificial Sys-tems: An Introductory Analysis with Applications to Biology , 1975 .

[2]  Larry J. Eshelman,et al.  Preventing Premature Convergence in Genetic Algorithms by Preventing Incest , 1991, ICGA.

[3]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[4]  Riccardo Poli,et al.  Coarse-Grained Dynamics for Generalized Recombination , 2007, IEEE Transactions on Evolutionary Computation.

[5]  Ian Oppermann,et al.  Complex spreading sequences with a wide range of correlation properties , 1997, IEEE Trans. Commun..

[6]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[7]  Chang-Yong Lee,et al.  Entropy-Boltzmann selection in the genetic algorithms , 2003, IEEE Trans. Syst. Man Cybern. Part B.

[8]  Yee Leung,et al.  Degree of population diversity - a perspective on premature convergence in genetic algorithms and its Markov chain analysis , 1997, IEEE Trans. Neural Networks.

[9]  Chin Kuan Ho,et al.  Optical orthogonal code design using genetic algorithms , 2001 .

[10]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[11]  Lloyd R. Welch,et al.  Lower bounds on the maximum cross correlation of signals (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[12]  Jorma Lilleberg,et al.  Genetic algorithms for multiuser detection in synchronous CDMA , 1997, Proceedings of IEEE International Symposium on Information Theory.

[13]  Shiu Yin Yuen,et al.  A Genetic Algorithm That Adaptively Mutates and Never Revisits , 2009, IEEE Trans. Evol. Comput..

[14]  Lalit M. Patnaik,et al.  Adaptive probabilities of crossover and mutation in genetic algorithms , 1994, IEEE Trans. Syst. Man Cybern..

[15]  Euntai Kim,et al.  A New Evolutionary Particle Filter for the Prevention of Sample Impoverishment , 2009, IEEE Transactions on Evolutionary Computation.

[16]  MARCEL J. E. GOLAY,et al.  Sieves for low autocorrelation binary sequences , 1977, IEEE Trans. Inf. Theory.