BROWSE
Detail
Journal Article
An Efficient ZJ-based Decoding Algorithm for Space-Time Trellis Codes in Slow Rayleigh Fading Channels
Cited 0 time in 
Share 
Share
- Authors
- Jongsub Cha, Youngok Kim, Heyungsub Lee, Joonhyuk Kang
- Issue Date
- 2011-02
- Citation
- IEEE Transactions on Communications, v.59, no.2, pp.337-342
- ISSN
- 0090-6778
- Publisher
- IEEE
- Language
- English
- Type
- Journal Article
- Abstract
- In this paper, we propose a computationally efficient decoding algorithm for space-time trellis codes in slow Rayleigh fading channels. The proposed scheme is based on a stack algorithm with two key ideas: (i) a variable stack size depending upon the signal-to-noise ratio to avoid the exhaustive search of paths and (ii) a normalized metric, which is defined as each cumulative path metric divided by its own length in the stack, to provide an appropriate comparison of the paths with different lengths. Simulation results demonstrate that the proposed algorithm achieves near-ML performance with significant reduction in complexity, compared with the conventional Viterbi algorithm. © 2011 IEEE.
- KSP Keywords
- Computationally Efficient, Rayleigh fading channel, Signal noise ratio(SNR), Signal-to-Noise, Space time(ST), Stack algorithm, Viterbi algorithm, decoding algorithm, efficient decoding, exhaustive search(ES), simulation results