We derive the performance union bound of space-time trellis codes in orthogonal frequency division multiplexing system (STTC-OFDM) over quasistatic frequency selective fading channels based on the distance spectrum technique. The distance spectrum is the enumeration of the codeword difference measures and their multiplicities by exhausted searching through all the possible error event paths. Exhaustive search approach can be used for low memory order STTC with small frame size. However with moderate memory order STTC and moderate frame size the computational cost of exhaustive search increases exponentially, and may become impractical for high memory order STTCs. This requires advanced computational techniques such as genetic algorithms (GAs). A GA with sharing function method is used to locate the multiple solutions of the distance spectrum for high memory order STTCs. Simulation evaluates the performance union bound and the complexity comparison of nonGA aided and GA aided distance spectrum techniques. It shows that the union bound give a close performance measure at high signal-to-noise ratio (SNR). It also shows that GA sharing function method based distance spectrum technique requires much less computational time as compared with exhaustive search approach but with satisfactory accuracy.
|Number of pages||6|
|Publication status||Published - 1 Jan 2003|
|Event||IEEE Congress on Evolutionary Computation 2003 - Canberra, Australia|
Duration: 8 Dec 2003 → 12 Dec 2003
|Conference||IEEE Congress on Evolutionary Computation 2003|
|Abbreviated title||IEEE CEC 2003|
|Period||8/12/03 → 12/12/03|