TY - GEN
T1 - Genetic algorithm based distance spectrum technique for performance union bound of space-time trellis coded OFDM
AU - Hong, Yi
AU - Dong, Zhaoyang
AU - Yuan, Jinhong
N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].
PY - 2003
Y1 - 2003
N2 - 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. © 2003 IEEE.
AB - 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. © 2003 IEEE.
UR - https://www.scopus.com/pages/publications/84901420900
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84901420900&origin=recordpage
U2 - 10.1109/CEC.2003.1299424
DO - 10.1109/CEC.2003.1299424
M3 - RGC 32 - Refereed conference paper (with host publication)
VL - 4
T3 - 2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings
SP - 2659
EP - 2664
BT - 2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings
PB - IEEE Computer Society
T2 - 2003 Congress on Evolutionary Computation, CEC 2003
Y2 - 8 December 2003 through 12 December 2003
ER -