Abstract
In this study, we investigate analytically the stability and convergence properties of the iterative turbo decoding with the Max-Log-MAP algorithm for soft-output generation. With respect to the turbo decoding algorithm (TDA) using Max-Log-MAP, several equivalent forms of the mathematical formulation are derived to facilitate the stability analysis. Based on the derived formulation, we show that the TDA using Max-Log-MAP has at least one fixed point regardless of the choice of constituent codes. By some specially constructed examples, we also show that the TDA using Max-Log-MAP is in general suboptimal for symbol decision and may not even converge. Finally, from the viewpoint of the derived formulation, some conditions are given to guarantee the convergence of the iterative turbo decoding.
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.
References
C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: Turbo-codes,” in Proc. IEEE Int. Conf. Commun.,Geneva, Switzerland, May 1993, pp. 10641070.
L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 284–287, Mar. 1974.
R. J. McEliece, E. R. Rodemich, and J.-F. Cheng, “The turbo decision algorithm,” in Proc. 33rd Allerton Conference on Communication, Control, and Computing, Allerton, IL, Oct. 1995, pp. 366–379.
L. Duan and B. Rimoldi, “The turbo decoding algorithm has fixed points,” in Proc. IEEE Int. Symp. Inform. Theory, Cambridge, MA, Aug. 1998, p. 277.
T. Richardson, “The geometry of turbo-decoding dynamics,” IEEE Trans. Inform. Theory, vol. 46, pp. 9–23, Jan. 2000.
D. Agrawal and A. Vardy, “The turbo decoding algorithm and its phase trajectories,” in Proc. IEEE Int. Symp. Inform. Theory, Sorrento, Italy, June 2000, p. 316.
G. Caire, G. Taricco, and E. Biglieri, “On the convergence of the iterative decoding algorithm,” in Proc. IEEE Int. Symp. Inform. Theory, Whistler, BC, Canada, Sept. 1995, p. 472.
A. Sella and Y. Be’ery, “Convergence Analysis of turbo-decoding of product codes,” in Proc. IEEE Int. Symp. Inform. Theory, Sorrento, Italy, June 2000, p. 484.
A. Ambroze, G. Wade, and M. Tomlinson, “Practical aspects of iterative decoding,” in Proc. IEE Commum., vol. 147, pp. 69–74, Apr. 2000.
D. J. C. Mackay, R. J. McEliece, and J. F. Cheng, “Turbo decoding as an instance of Pearl’s ”belief propagation“ algorithm,” IEEE J. Select. Areas Commun., vol. 16, pp. 140–152, Feb. 1998.
J. A. Erfanian, S. Pasupathy, and G. Gulak “Reduced complexity symbol detectors with parallel structures for ISI channels,” IEEE Trans. Commun., vol. 42, pp. 1661–1671, Feb./Mar./Apr. 1994.
A. J. Viterbi, “An intuitive justification and a simplified implementation of the MAP decoder for convolutional codes,” IEEE J. Select. Areas Commun., vol. 16, pp. 260–264, Feb. 1998.
J. Hagenauer, “Source-controlled channel decoding,” IEEE Trans. Commun., vol. 43, pp. 2449–2457, Sept. 1995.
J. Hagenauer and P. Robertson, “Iterative (turbo) decoding of systematic convolutional codes with the MAP and SOVA algorithms,” in Proc. ITG Conf. on Source and Channel Coding, Frankfurt, Germany, Oct. 1994, pp. 1–9.
F. Battail, “Ponderation des symboles decodes par l’algorithme de Viterbi,” Ann. Telecommun., vol. 42, pp. 31–38, Jan. 1987.
M. P. C. Fossorier, F. Burkert, S. Lin, and J. Hagenauer, “On the equivalence between SOYA and Max-Log-MAP decodings,” IEEE Commun. Lett., vol. 2, pp. 137–139, May 1998.
B. Mendelson, Introduction to Topology, 3rd ed. New York: Dover, 1990.
E. Zeidler, Nonlinear Functional Analysis and its Applications, I: Fixed-Point Theorems. New York: Springer-Verlag, 1985.
J. Gilbert and L. Gilbert, Linear Algebra and Matrix Theory. New York: Academic Press, 1994.
R. Horn and C. Johnson, Matrix Analysis. Cambridge: Cambridge University Press, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Wu, WS., Wang, CH., Chiu, MC., Chao, Cc. (2002). Stability Analysis of the Turbo Decoding Algorithm Using Max-Log-MAP. In: Blaum, M., Farrell, P.G., van Tilborg, H.C.A. (eds) Information, Coding and Mathematics. The Springer International Series in Engineering and Computer Science, vol 687. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3585-7_16
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3585-7_16
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5289-9
Online ISBN: 978-1-4757-3585-7
eBook Packages: Springer Book Archive