Abstract
Using algebraic techniques, one of the co-authors has designed a [155,64, 20] low density parity check code based on permutation matrices. This code is quasi-cyclic by construction and hence admits a convolutional representation. A set of low density parity check convolutional codes is derived from this quasi-cyclic code and its generalizations. The performance of these convolutional codes is investigated when decoded using belief propagation on their corresponding graph representations.
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
I. F. Blake and R. C. Mullin, The Mathematical Theory of Coding, Academic Press, New York, 1975.
R. M. Tanner, ”A [155,64,20] Sparse Graph (LDPC) Code,” Presented at the recent results session, IEEE Intl. Symposium on Information Theory, Sorrento, Italy, June, 2000.
D. Sridhara, T. Fuja and R. M. Tanner, ”Low Density Parity Check Matrices from Permutation Matrices,” Proceedings of 2001 Conference on Information Sciences and Systems, pp. 142, Johns Hopkins University, Baltimore, MD, March 2001.
R. M. Tanner, ”Convolutional Codes from Quasi-Cyclic Codes: A Link between the Theories of Block and Convolutional Codes,” Technical Report, Computer Research Laboratory, UC Santa Cruz, November 1987.
Y. Levy and D. J. Costello, ”An Algebraic Approach to Constructing Convolutional Codes from Quasi-Cyclic Codes,” DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 14, pp. 189–198, 1993.
R. Gallager, Low-Density Parity-Check Codes, M.I.T. Press, 1963.
R. Johannesson and K. Sh. Zigangirov, Fundamentals of Convolutional Coding, IEEE Press, 1999.
D. J. C. MacKay and M. C. Davey, ”Evaluation of Gallager Codes for Short Block Length and High Rate Applications,” in Codes, Systems and Graphical Models, vol. 123 of IMA Volumes in Mathematics and its Applications, pp. 113–130, New York: Springer-Verlag, 2000.
R. M. Tanner, ”Toward an Algebraic Theory for Turbo Codes,” Proceedings of the Second International Symposium on Turbo Codes, pp. 17–26, ENST-Bretagne, Brest, France, September 2000.
A. J. Felstrom and K. S. Zigangirov, ”Time-Varying Periodic Convolutional Codes with Low-Density Parity-Check Matrix,” IEEE Transactions on Information Theory, vol. 45, pp. 2181–2191, September 1999.
T. Richardson and A. Shokrollahi and R. Urbanke, ”Design of Capacity-Approaching Irregular Low-Density Parity-Check Codes,” IEEE Transactions on Information Theory, vol. 47, pp. 619–637, February 2001.
M. Fossorier, ”Iterative Reliability-Based Decoding of Low-Density Parity Check Codes,” IEEE Journal on Selected Areas in Communications, vol. 27, pp. 533–547, May 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Costello, D.J., Sridharan, A., Sridhara, D., Tanner, R.M. (2003). Low Density Parity Check Convolutional Codes Derived from Quasi-Cyclic Block Codes. In: Bhargava, V.K., Poor, H.V., Tarokh, V., Yoon, S. (eds) Communications, Information and Network Security. The Springer International Series in Engineering and Computer Science, vol 712. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3789-9_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3789-9_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5318-6
Online ISBN: 978-1-4757-3789-9
eBook Packages: Springer Book Archive