Title :
A truncated best-path algorithm
Author :
Kwan, David ; Kallel, Samir
Author_Institution :
Narrowband Telecommun. Res. Inc., Burnaby, BC, Canada
fDate :
5/1/1998 12:00:00 AM
Abstract :
A variant of the best-path (BP) algorithm that can be used for deducing a posteriori symbol probabilities for input sequences of unlimited length is proposed. Decoders using the proposed algorithm have fixed memory requirements and fixed decoding delays regardless of the length of the transmitted sequence. This is made possible by utilizing the Viterbi algorithm´s ability to self-initialize itself and by segmenting the decoding process
Keywords :
Viterbi decoding; convolutional codes; delays; probability; sequences; trellis codes; BP algorithm; Viterbi algorithm; a posteriori symbol probabilities; decoding process; fixed decoding delays; fixed memory requirements; segmentation; self-initialization; transmitted sequence length; truncated best-path algorithm; unlimited length input sequences; Concatenated codes; Convolutional codes; Delay; Finishing; Helium; Maximum likelihood decoding; Maximum likelihood estimation; Probability; Random access memory; Viterbi algorithm;
Journal_Title :
Communications, IEEE Transactions on
