Turbo decoding with tail-biting trellises

Conference Proceedings of the International Symposium on Signals, Systems and Electronics

Volumn , Issue , 1998, Pages 343-348

  Weiss, Christian ^a   Bettstetter, Christian ^a   Riedel, Sven ^a   Costello Jr , Daniel J ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK CODES; COMPUTATIONAL COMPLEXITY; CONVOLUTIONAL CODES; SIGNAL TO NOISE RATIO; TRELLIS CODES; TWO DIMENSIONAL;

TAIL BITING CODES; TURBO DECODING;

DECODING;

EID: 0032217918     PISSN: None     EISSN: None     Source Type: None    
DOI: 10.1109/issse.1998.738095     Document Type: Article

References (5)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-Codes," Proc. IEEE Int. Conf. Comm. (ICC), Geneva, Switzerland, pp. 1064-1070, May 1993.
2. J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes," IEEE Trans, on Inf. Theory, Vol. IT-42, No. 2, pp. 429-445, March 1996.
3. G. Solomon and H. C. A. van Tilborg, "A connection between block and convolutional codes," SIAM J. App. Math., Vol. 37, No. 2, pp. 358-369, October 1979.
4. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans, on Inf. Theory, Vol. IT-20, pp. 284-287, March 1974.
5. I. E. Bocharova and B. D. Kudryashov, "Rational rate punctured convolutional codes for soft-decision Viterbi decoding," IEEE Trans, on Inf. Theory, Vol. IT-43, pp. 1305-1313, July 1997.