Title :
The bidirectional stack algorithm
Author :
V. Senk;P. Radivojac
Author_Institution :
Fac. of Eng., Novi Sad Univ., Serbia
Abstract :
A new procedure for sequential decoding of trellis codes, whose decoding effort is unaffected by single correctable bursts of errors of desired length (but not longer than the code constraint length) is simulated and compared with the classical stack algorithm. The results show an immense reduction in decoding effort.
Keywords :
"Convolutional codes","Tree graphs","Maximum likelihood decoding","Error correction codes","Viterbi algorithm","Tail"
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613437
