Abstract
This paper discusses the application of Genetic Algorithms (GAs) to the problem of searching for a set of synchronisation codes for TDMA based mobile radio systems. The problem may be formulated as a constrained optimisation problem and is transformed into an unconstrained one by including a penalty term within the fitness function. The quality of the sequences obtained, using the genetic algorithms, are compared with some previously published results. The paper discusses the sensitivity of the genetic algorithm's behaviour to the formulation of the fitness function and algorithm parameters. Using results from polyphase codes it is also shown how sets of sequences for different modulation formats can be obtained from either a BPSK or QPSK code
Original language | English |
---|---|
Title of host publication | First International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications (GALESIA), 1995 |
Publisher | Institution of Engineering and Technology (IET) |
Pages | 379 - 384 |
ISBN (Print) | 0852966504 |
DOIs | |
Publication status | Published - Sept 1995 |
Bibliographical note
Sponsorship: The authors wish to express their gratitude to the members of the Centre for Communications Research, University of Bristol. We also wish to thank EPSRCand Hewlett Packard Laboratories for their support of this work. In particular we would iike to thank Mu Li for helpful discussions
Other identifier: IEE Conf. Publ. No. 414
Keywords
- genetic algorithms
- constraint handling
- mobile radio
- optimisation