Quasi-Cyclic LDPC Codes Based on Pre-Lifted Protographs
- 24 July 2014
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 60 (10) , 5856-5874
Abstract
Quasi-cyclic low-density parity-check (QC-LDPC) codes based on protographs are of great interest to code designers because analysis and implementation are facilitated by the protograph structure and the use of circulant permutation matrices for protograph lifting. However, these restrictions impose undesirable fixed upper limits on important code parameters, such as minimum distance and girth. In this paper, we consider an approach to constructing QC-LDPC codes that uses a two-step lifting procedure based on a protograph, and, by following this method instead of the usual one-step procedure, we obtain improved minimum distance and girth properties. We also present two new design rules for constructing good QC-LDPC codes using this two-step lifting procedure, and in each case, we obtain a significant increase in minimum distance and achieve a certain guaranteed girth compared with one-step circulant-based liftings. The expected performance improvement is verified by simulation results.Keywords
All Related Versions
Funding Information
- National Science Foundation (CCF-1161754, CCF-1252788, DMS-1313221)
This publication has 39 references indexed in Scilit:
- Hierarchical and High-Girth QC LDPC CodesIEEE Transactions on Information Theory, 2013
- Bounds on the Minimum Distance of Punctured Quasi-Cyclic LDPC CodesIEEE Transactions on Information Theory, 2013
- Counting Short Cycles of Quasi Cyclic Protograph LDPC CodesIEEE Communications Letters, 2012
- Partially Quasi-Cyclic Protograph-Based LDPC Codes2011
- Lowering the Error Floor of LDPC Codes Using Cyclic LiftingsIEEE Transactions on Information Theory, 2011
- Graph-based convolutional and block LDPC codesProblems of Information Transmission, 2009
- Regular and irregular progressive edge-growth tanner graphsIEEE Transactions on Information Theory, 2005
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation MatricesIEEE Transactions on Information Theory, 2004
- Several Properties of Short LDPC CodesIEEE Transactions on Communications, 2004
- The Magma Algebra System I: The User LanguageJournal of Symbolic Computation, 1997