Abstract
Turbo and serial concatenated codes can be decoded by MAP or ML decoding methods based on the overall code trellis presented in the previous chapter. These decoders could be implemented for small interleavers only as they are too complex for medium and large interleaver sizes. The practical importance of turbo and serial concatenated codes lies in the availability of a simple subopti-mum decoding algorithm [1]. In this chapter we present a heuristic explanation of iterative decoding algorithms for turbo and serial concatenated codes. There are no proofs of convergence of the iterative decoding methods to the optimum MAP or ML decoding. We present the performance results of the iterative decoding relative to the ML performance bounds and some heuristic evidence that the suboptimum iterative methods can come very close to the optimum algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
C. Berrou, A. Glavieux and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: turbo-codes (1),” in Proc. ICC’93, May 1993.
G. Ungerboeck, “Channel coding with multilevel/phase signaling”, IEEE Trans. Information Theory, Vol. 25, pp. 55–67, Jan. 1982.
J. Hagenauer, P. Robertson and L. Papke, “Iterative (‘Turbo’) decoding of systematic convolutional codes with the MAP and SOVA algorithms”, in Proc. of the 1994 ITG Conference on Source and hannel Coding, Munich, October 1994.
B. Vucetic, “Iterative decoding algorithms”, PIMRC’97, pp. 99–120, Sept. 1997, Helsinki, Finland.
J. Hagenauer, E. Offer and L. Papke, “Iterative decoding of binary block and convolutional codes”, IEEE Trans. Inform. Theory, Vol. 42, No. 2, March 1996, pp. 429–445.
G. Battail, M. C. Decouvelaere, and P. Godlewski, “Replication decoding”, IEEE Trans. Inform. Theory, Vol. IT-25, pp. 332–345, May 1979.
J. Lodge, R. Young, P. Hoeher and J. Hagenauer, “Separable MAP”filters” for the decoding of product and concatenated codes”, Proc. IEEE ICC’93, Geneva, Switzerland, may 1993, pp. 1740–1745.
P. Robertson, “Illumunating the structure of decoders of parallel concatenated recursive systematic (turbo) codes”, Proc. IEEE Globecom Conf, San Francisco, CA, Dec. 1994, pp. 1298–1303.
P. Robertson, E. Villebrun and P. Hoeher, “A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain”, Proc. IEEE ICC’95, Seattle, WA, June 1995, pp. 1009–1013.
S. Benedetto, G. Montorsi, D. Divsalar and F. Pollara, A soft-input soft-output maximum a posteriori (MAP) module to decode parallel and serial concatenated codes, TDA Progress Report 42-127.
P. Jung, “Novel low complexity decoder for turbo codes”, Electronics Letters, 19th Jan. 1995, Vol. 31, No. 2, pp. 86–87.
A. Ushirokawa, T. Okamura, N. Kamiyaand B. Vucetic, “Principles of turbo codes and their application to mobile communications,” IEICE, Trans. Fundamentals, Vol. E81-A, No. 7, July 1998, pp. 1320–1329.
B. Vucetic, Coding for fading channels, Lecture Notes, The University of Sydney, Sydney.
W. Feng and B. Vucetic, “A list bidirectional soft output decoder of turbo codes,” in Proc. Int. Symp. on Turbo Codes and Related Topics, Brest, France, Sep. 1997, pp. 288–292.
M. Moher, “Decoding via cross entropy minimization,” in Proc. IEEE Globecom. Conf., Houston, TX, Dec. 1993, pp. 809–813.
R. Shao, S. Lin, and M. Fossorier, “Two simple stopping criteria for turbo decoding,” IEEE Trans. Commun., vol. 47, no. 8, Aug. 1999, pp. 1117–1120.
B. Vucetic, W. Feng, and J. Yuan, “Performance of turbo and serial concatenated convolutional codes,” Technical Report, The University of Sydney, Aug. 1997.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Vucetic, B., Yuan, J. (2000). Iterative Decoding. In: Turbo Codes. The Springer International Series in Engineering and Computer Science, vol 559. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4469-2_6
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4469-2_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7013-0
Online ISBN: 978-1-4615-4469-2
eBook Packages: Springer Book Archive