Trellis state aggregation for soft decoding of variable length codes

This paper describes a new set of state models for soft decoding of variable length codes. A single parameter T allows to trade complexity against estimation accuracy. The extrema choices for this parameter lead respectively to construct the well-known bit-level and bit/symbol trellises. For a proper choice of the parameter T, the results obtained by running a BCJR or Viterbi estimation algorithm on the proposed state models are close to those obtained with the optimum state model. The complexity is however significantly reduced. It can be further decreased by projecting the state model on two state models of reduced size, and by combining their decoding results. This combination is shown to be optimal for the Viterbi algorithm.

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[3]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

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

[5]  John P. Robinson,et al.  Error recovery for variable length codes , 1985, IEEE Trans. Inf. Theory.

[6]  M. Wada,et al.  Reversible variable length codes , 1995, IEEE Trans. Commun..

[7]  V. Balakirsky.  Joint source-channel coding with variable length codes , 1997, Proceedings of IEEE International Symposium on Information Theory.

[8]  Thomas E. Fuja,et al.  Joint source-channel decoding of variable-length encoded sources , 1998, 1998 Information Theory Workshop (Cat. No.98EX131).

[9]  Joachim Hagenauer,et al.  Symbol-by-Symbol MAP Decoding of Variable Length Codes , 2000 .

[10]  Christine Guillemot,et al.  Joint source-channel turbo decoding of entropy-coded sources , 2001, IEEE J. Sel. Areas Commun..

[11]  Susanna Kaiser,et al.  . Soft source decoding with applications , 2001, IEEE Trans. Circuits Syst. Video Technol..

[12]  Zhen Zhang,et al.  Synchronization recovery of variable-length codes , 2002, IEEE Trans. Inf. Theory.

[13]  Jörg Kliewer,et al.  Robust decoding of variable-length encoded Markov sources using a three-dimensional trellis , 2003, IEEE Communications Letters.

[14]  C. Weidmann,et al.  Reduced-complexity soft-ln-soft-out decoding of variable-length codes , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[15]  Luc Vandendorpe,et al.  New iterative decoding of variable length codes with turbo-codes , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).