Path partitions and forward-only trellis algorithms

This is a semitutorial paper on trellis-based algorithms. We argue that most decoding/detection algorithms described on trellises can be formulated as path-partitioning algorithms, with proper definitions of mappings from subsets of paths to metrics of subsets. Thereby, the only two operations needed are path-concatenation and path-collection, which play the roles of multiplication and addition, respectively. Furthermore, we show that the trellis structure permits the path-partitioning algorithms to be formulated as forward-only algorithms (with structures resembling the Viterbi (1967) algorithm), thus eliminating the need for backward computations regardless of what task needs to be performed on the trellis. While all of the actual decoding/detection algorithms presented here are rederivations of variations of previously known methods, we believe that the exposition of the algorithms in a unified manner as forward-only path-partitioning algorithms is the most intuitive manner in which to generalize the Viterbi algorithm. We also believe that this approach may, in fact, influence the practical implementation of the algorithms as well as influence the construction of other forward-only algorithms (e.g., byte-wise forward-only detection algorithms).

[1]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

[2]  Aleksandar Kavcic.  On the capacity of Markov sources over noisy channels , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[3]  Robert J. McEliece,et al.  The generalized distributive law , 2000, IEEE Trans. Inf. Theory.

[4]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[5]  Niclas Wiberg,et al.  Codes and Decoding on General Graphs , 1996 .

[6]  G. Forney,et al.  Codes on graphs: normal realizations , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[7]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[8]  Lawrence R. Rabiner,et al.  A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.

[9]  Stephen B. Wicker,et al.  Turbo Coding , 1998 .

[10]  Stephen G. Wilson,et al.  Stream-oriented turbo codes , 2001, IEEE Trans. Inf. Theory.

[11]  Andrew J. Viterbi,et al.  An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolutional Codes , 1998, IEEE J. Sel. Areas Commun..

[12]  Carl-Erik W. Sundberg,et al.  List Viterbi decoding algorithms with applications , 1994, IEEE Trans. Commun..

[13]  Wolfgang Koch,et al.  Optimum and sub-optimum detection of coded data disturbed by time-varying intersymbol interference (applicable to digital mobile radio receivers) , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[14]  Yoichi Sato,et al.  Optimum soft-output detection for channels with intersymbol interference , 1995, IEEE Trans. Inf. Theory.

[15]  Patrick Robertson,et al.  Optimal and sub-optimal maximum a posteriori algorithms suitable for turbo decoding , 1997, Eur. Trans. Telecommun..

[16]  J. Hagenauer,et al.  Decoding "turbo"-codes with the soft output Viterbi algorithm (SOVA) , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[17]  G. David Forney,et al.  Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference , 1972, IEEE Trans. Inf. Theory.

[18]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.

[19]  Jung-Fu Cheng,et al.  Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..

[20]  L. Lee.  Real-Time Minimal-Bit-Error Probability Decoding of Convolutional Codes , 1974, IEEE Trans. Commun..

[21]  John B. Anderson,et al.  Concatenated Decoding with a Reduced-Search BCJR Algorithm , 1998, IEEE J. Sel. Areas Commun..

[22]  Thomas M. Cover,et al.  Optimal Sequence Detection and Optimal Symbol-by-Symbol Detection: Similar Algorithms , 1982, IEEE Trans. Commun..

[23]  K. Abend,et al.  Statistical detection for communication channels with intersymbol interference , 1970 .

[24]  L. Baum,et al.  Statistical Inference for Probabilistic Functions of Finite State Markov Chains , 1966 .

[25]  R. Chang,et al.  On receiver structures for channels having memory , 1966, IEEE Trans. Inf. Theory.

[26]  Hans-Andrea Loeliger.  A posteriori probabilities and performance evaluation of trellis codes , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[27]  Hans-Andrea Loeliger,et al.  Codes and iterative decoding on general graphs , 1995, Eur. Trans. Telecommun..

[28]  Sergio Benedetto,et al.  Algorithm for continuous decoding of turbo codes , 1996 .

[29]  Robert J. McEliece,et al.  On the BCJR trellis for linear block codes , 1996, IEEE Trans. Inf. Theory.

[30]  Li Ping,et al.  Decoding low density parity check codes with finite quantization bits , 2000, IEEE Communications Letters.

[31]  Gerhard Fettweis,et al.  On memory redundancy in the BCJR algorithm for nonrecursive shift register processes , 2000, IEEE Trans. Inf. Theory.

[32]  Marc P. C. Fossorier,et al.  On the equivalence between SOVA and max-log-MAP decodings , 1998, IEEE Communications Letters.

[33]  Baoming Bai,et al.  Novel algorithm for continuous decoding of turbo codes , 1999 .

[34]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[35]  X. Jin.  Factor graphs and the Sum-Product Algorithm , 2002 .

[36]  Van Nostrand,et al.  Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm , 1967 .

[37]  Joachim Hagenauer,et al.  A Viterbi algorithm with soft-decision outputs and its applications , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.