Advances in soft-output decoding

This paper tries to give a unified presentation of soft-output decoding algorithms. It is intended to be tutorial on one hand, but on the other hand it covers some recent advances as well. The presentation includes the list-output Viterbi algorithm (LOVA), the soft (symbol)-output Viterbi algorithm (SOVA), the optimal symbol-by-symbol detector (OSSD, "symbol-by-symbol MAP"), the optimal subblock-by-subblock detector (OBBD, "vector MAP"), and finally a SOVA based on likelihood post-processing. The relation between these algorithms is derived in a structured manner. The average mutual information for i.i.d. input bits is chosen as a measure for the quality of the reliability outputs.<<ETX>>

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

[2]  P. Hoeher.  On channel coding and multiuser detection for DS-CDMA , 1993, Proceedings of 2nd IEEE International Conference on Universal Personal Communications.

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

[4]  Joachim Hagenauer,et al.  The Decoding of Multidimensional Codes Using Separable Map "Filters" , 1992 .

[5]  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.

[6]  Peter Adam Hoeher,et al.  Separable MAP "filters" for the decoding of product and concatenated codes , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[7]  Rémi Sfez,et al.  A weighted-output variant of the Viterbi algorithm for concatenated schemes using a convolutional inner code , 1990, EUROCODE.

[8]  Takeshi Hashimoto.  A list-type reduced-constraint generalization of the Viterbi algorithm , 1987, IEEE Trans. Inf. Theory.

[9]  Subbarayan Pasupathy,et al.  Reduced complexity symbol detectors with parallel structures , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

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

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

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

[13]  N. Seshadri,et al.  Generalized Viterbi algorithms for error detection with convolutional codes , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[14]  Frank K. Soong,et al.  A Tree.Trellis Based Fast Search for Finding the N Best Sentence Hypotheses in Continuous Speech Recognition , 1990, HLT.

[15]  Gérard Battail.  Weighting the symbols decoded by the viterbi algorithm , 1987 .

[16]  Heinrich Meyr,et al.  High-speed VLSI architectures for soft-output viterbi decoding , 1994, J. VLSI Signal Process..

[17]  Nambi Seshadri,et al.  On post-decision symbol-reliability generation , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[18]  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.

[19]  G. David Forney,et al.  Convolutional codes I: Algebraic structure , 1970, IEEE Trans. Inf. Theory.

[20]  G. David Forney,et al.  Convolutional Codes II. Maximum-Likelihood Decoding , 1974, Inf. Control..