Abstract
A theoretical and experimental analysis of iterative decoding of low-density convolutional (LDC) codes is given. Two families are investigated: homogeneous LDC codes and a convolutional code version of turbo-codes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Engdahl, K. and Zigangirov, K.Sh., To the Theory of Low-Density Convolutional Codes. I, Probl. Peredachi Inf., 1999, vol. 35, no. 4, pp. 12–27 [Probl. Inf. Trans. (Engl. Transl.), 1999, vol. 35, no. 4, pp. 295–310].
Zigangirov, K.Sh. and Lentmaier, M., Mathematical Analysis of an Iterative Decoding Algorithm for Low-Density Codes, Probl. Peredachi Inf., 2000, vol. 36, no. 4, pp. 35–46 [Probl. Inf. Trans. (Engl. Transl.), 2000, vol. 36, no. 4, pp. 314–324].
Gallager, R.G., Low-Density Parity-Check Codes, Cambridge: MIT Press, 1963. Vol. 37 No. 4 2001
Berrou, C., Glavieux, A., and Thitimajshima, P., Near-Shannon-Limit Error-Correcting Coding and Decoding: Turbo-Codes, Proc. IEEE Int. Conf. on Communications, Geneva, Switzerland, 1993, pp. 1064–1070.
Zyablov, V.V. and Pinsker, M.S., Reliable Transmission with Low Decoding Complexity, Trudy VI Vsesoyuzn. konf. po teorii kodirovaniya i peredachi informatsii (Proc. VI All-Union Conf. on Coding Theory and Information Transmission), Moscow-Tomsk, 1975, pp. 64–69.
Jimenez, A. and Zigangirov, K.Sh., Periodic Time-Varying Convolutional Codes with Low-Density Parity-Check Matrices, IEEE Trans. Inf. Theory, 1999, vol. 45, no. 5, pp. 2181–2190.
Truhachev, D.V., Lentmaier, M., and Zigangirov, K.Sh., Some Results Concerning the Design and Decoding of Turbo-Codes, Probl. Peredachi Inf., 2001, vol. 37, no. 3, pp. 6–23 [Probl. Inf. Trans. (Engl. Transl.), 2001, vol. 37, no. 3, pp. 190–205].
Bahl, L., Cocke, J., Jelinek, F., and Raviv, J., Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate, IEEE Trans. Inf. Theory, 1974, vol. 20, no. 1, pp. 284–287.
Margulis, G.A., Explicit Constructions of Graphs without Short Cycles and Low-Density Codes, Combinatorica, 1982, vol. 2, no. 1, pp. 71–78.
Margulis, G.A., Some Explicit Constructions of Low-Density codes, Trudy III Mezhdunar. seminara po teorii informatsii “Svertochnye kody; svyaz' s mnogimi pol'zovatelyami” (Proc. III Int. Workshop on Information Theory “Convolutional Codes; Communication with Many Users,”) Sochy, 1987, pp. 120–123
Margulis, G.A., Explicit Group-Theoretical Constructions of Combinatorial Schemes and Their Application to the Design of Expanders and Concentrators, Probl. Peredachi Inf., 1988, vol. 24, no. 1, pp. 51–60 [Probl. Inf. Trans. (Engl. Transl.), 1988, vol. 24, no. 1, pp. 39–46].
Richardson, T. and Urbanke, R., The Capacity of Low-Density Parity-Check Codes under Message-Passing Decoding, IEEE Trans. Inf. Theory, 2001, vol. 47, no. 2, pp. 599–618.
Johannesson, R. and Zigangirov, K.Sh., Fundamentals of Convolutional Coding, Piscataway: IEEE Press, 1999.
Rights and permissions
About this article
Cite this article
Lentmaier, M., Truhachev, D.V. & Zigangirov, K.S. To the Theory of Low-Density Convolutional Codes. II. Problems of Information Transmission 37, 288–306 (2001). https://doi.org/10.1023/A:1013815115684
Issue Date:
DOI: https://doi.org/10.1023/A:1013815115684