Title :
A bidirectional multiple stack algorithm
Author :
Li, Kaiping ; Kallel, Samir
Author_Institution :
Dept. of Electr. Eng., British Columbia Univ., Vancouver, BC, Canada
fDate :
1/1/1999 12:00:00 AM
Abstract :
Bidirectional sequential decoding (BSD) substantially reduces the computational variability of conventional sequential decoding without compromising the error performance. However, BSD does not completely eliminate the erasure problem. We propose an erasure-free decoding algorithm which combines the idea of BSD in conjunction with that of the multiple stack algorithm (MSA). It is found that the new bidirectional multiple stack algorithm (BMSA) offers substantial advantages over the MSA in terms of computational effort, memory requirements, and error performance. The BMSA appears as an attractive alternative to the Viterbi algorithm (VA) where low error probabilities and high decoding speeds are required
Keywords :
error statistics; sequential decoding; Viterbi algorithm; bidirectional multiple stack algorithm; bidirectional sequential decoding; computational effort; erasure-free decoding algorithm; error performance; high decoding speeds; low error probabilities; memory requirements; multiple stack algorithm; Communications Society; Computer errors; Computer simulation; Councils; Decoding; Error probability; Random variables; Resumes; Viterbi algorithm;
Journal_Title :
Communications, IEEE Transactions on