List Viterbi decoding algorithms with applications

A list Viterbi decoding algorithm (LVA) produces a rank ordered list of the L globally best candidates after a trellis search. The authors present two such algorithms, (i) a parallel LVA that simultaneously produces the L best candidates and (ii) a serial LVA that iteratively produces the k/sup th/ best candidate based on knowledge of the previously found k-1 best paths. The application of LVA to a concatenated communication system consisting of an inner convolutional code and an outer error detecting code is considered in detail. Analysis as well as simulation results show that significant improvement in error performance is obtained when the inner decoder, which is conventionally based on the Viterbi algorithm (VA), is replaced by the LVA. An improvement of up to 3 dB is obtained for the additive white Gaussian noise (AWGN) channel due to an increase in the minimum Euclidean distance. Ever larger gains are obtained for the Rayleigh fading channel due to an increase in the time diversity. It is also shown that a 10% improvement in throughput is obtained along with significantly reduced probability of a decoding failure for a hybrid FEC/ARQ scheme with the inner code being a rate compatible punctured convolutional (RCPC) code. >

[1]  Charles L. Weber,et al.  Elements of Detection and Signal Design , 1968 .

[2]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[3]  Joachim Hagenauer,et al.  Rate-compatible punctured convolutional codes (RCPC codes) and their applications , 1988, IEEE Trans. Commun..

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

[5]  N. Seshadri,et al.  Estimation of unreliable packets in subband coding of speech (digital mobile radio) , 1991 .

[6]  I. M. Jacobs,et al.  Principles of Communication Engineering , 1965 .

[7]  Robert H. Deng,et al.  High rate concatenated coding systems using bandwidth efficient trellis inner codes , 1989, IEEE Transactions on Communications.

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

[9]  Gottfried Ungerboeck,et al.  Channel coding with multilevel/phase signals , 1982, IEEE Trans. Inf. Theory.

[10]  Nambi Seshadri,et al.  Joint data and channel estimation using blind trellis search techniques , 1994, IEEE Trans. Commun..

[11]  V. Wei,et al.  Error-Correcting Codes for List Decoding , 1994 .

[12]  Chin-Hui Lee,et al.  A network-based frame-synchronous level building algorithm for connected word recognition , 1988, ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing.

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

[14]  Tor Aulin,et al.  Digital Phase Modulation , 1986, Applications of Communications Theory.

[15]  John B. Anderson,et al.  Sequential Coding Algorithms: A Survey and Cost Analysis , 1984, IEEE Trans. Commun..

[16]  Peter Adam Hoeher.  TCM on frequency-selective fading channels: a comparison of soft-output probabilistic equalizers , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[17]  Kohji Itoh,et al.  Viterbi decoding algorithm for convolutional codes with repeat request , 1980, IEEE Trans. Inf. Theory.

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

[19]  G. David Forney,et al.  Convolutional Codes III. Sequential Decoding , 1974, Inf. Control..

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

[21]  N. Seshadri,et al.  Joint data and channel estimation using fast blind trellis search techniques , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[22]  Andrew J. Viterbi,et al.  Principles of Digital Communication and Coding , 1979 .

[23]  Carl-Erik W. Sundberg,et al.  Multilevel trellis coded modulations for the Rayleigh fading channel , 1993, IEEE Trans. Commun..

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