Suboptimum multistage decoding of multilevel block codes

This paper proposes a new method for multistage decoding of multilevel block codes. The technique achieves better error performance than conventional multistage decoding at expense of higher decoding complexity.

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

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

[3]  Branka Vucetic,et al.  Multilevel block codes for Rayleigh-fading channels , 1995, IEEE Trans. Commun..

[4]  Shu Lin,et al.  On multilevel block modulation codes , 1991, IEEE Trans. Inf. Theory.

[5]  Hideki Imai,et al.  A new multilevel coding method using error-correcting codes , 1977, IEEE Trans. Inf. Theory.

[6]  G. David Forney,et al.  Coset codes-II: Binary lattices and related codes , 1988, IEEE Trans. Inf. Theory.

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

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

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

[10]  Shu Lin,et al.  On linear structure and phase rotation invariant properties of block M-PSK modulation codes , 1991, IEEE Trans. Inf. Theory.

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

[12]  Soheil I. Sayegh,et al.  A Class of Optimum Block Codes in Signal Space , 1986, IEEE Trans. Commun..

[13]  Branka Vucetic,et al.  Block coded modulation and concatenated coding schemes for error control on fading channels , 1991, Discret. Appl. Math..