论文信息 - An optimal circular Viterbi decoder for the bounded distance criterion

An optimal circular Viterbi decoder for the bounded distance criterion

We propose a Viterbi-type decoder for tailbiting trellis codes that works by traversing the tailbiting circle somewhat more than once. The traversal is the least possible for any bounded distance Viterbi decoder. Procedures are given that compute this minimum. Unlike previous decoders of the type, the new scheme does not suffer limit cycles or from pseudocodewords. The bit-error rate is compared to that of Bahl-Cocke-Jelinek-Raviv and maximum-likelihood decoding.

John B. Anderson | Stephan M. Hladik

[1] John B. Anderson,et al. Decision depths of convolutional codes , 1989, IEEE Trans. Inf. Theory.

[2] Kemal E. Tepe,et al. Iterative decoding techniques for correlated rayleigh fading and diversity channels , 2001 .

[3] John B. Anderson. Best short rate 1/2 tailbiting codes for the bit-error rate criterion , 2000, IEEE Trans. Commun..

[4] Shu Lin,et al. An iterative bidirectional decoding algorithm for tail biting codes , 1999, Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253).

[5] R. V. Cox,et al. An efficient adaptive circular Viterbi algorithm for decoding generalized tailbiting convolutional codes , 1994 .

[6] John B. Anderson,et al. Tailbiting MAP Decoders , 1998, IEEE J. Sel. Areas Commun..

[7] G. Horn. Iterative decoding and pseudo-codewords , 1999 .

[8] John B. Anderson,et al. Properties of the Tailbiting BCJR Decoder , 2001 .

[9] G. Forney,et al. Iterative Decoding of Tail-Biting Trellises and Connections with Symbolic Dynamics , 2001 .