Bidirectional Decoding of Convolutional Codes Over Rayleigh Fading Channels
Jean Belzile, David Haccoun, S. Forest · 2005
A suboptimal breadth-first multiple-path bidirectional decoding algorithm for convolutional codes has been shown to provide very attractive error performances over the binary symmetric channel. In this paper, new computer simulation results for bidirectional decoding of convolutional codes over soft-decision Rayleigh fading channels are presented. Using a memory length v = 19 and rate R = 1/2 code, these results show that a gain near 5 dB can be achieved for a low frame error probability (P/sub f/ < 10/sup -3/) over the Viterbi algorithm of equivalent decoding complexity (v = 6, R = 1/2). The results also indicate that, depending on the length of the frames, a significant gain can also be achieved for low bit error probability (P/sub b/ < 10/sup -5/).