Symmetrical Constructions for Regular Girth-8 QC-LDPC Codes
- 13 October 2016
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 65 (00906778) , 1
Abstract
In this paper, we propose new constructions for regular girth-8 quasi-cyclic low-density parity-check (QC-LDPC) codes based on circulant permutation matrices (CPM). The constructions assume symmetries in the structure of the parity-check matrix and employ a greedy exhaustive search algorithm to find the permutation shifts of the CPMs. As a result of symmetries, the new codes have a more compact representation compared with their counterparts. In majority of cases, also, they achieve the girth 8 at a shorter block length for the same degree distribution (code rate). Deterministic (explicit) constructions are also presented to expand the proposed parity-check matrices to larger block lengths and higher rates. The proposed long high-rate codes are often substantially shorter than regular girth-8 QC-LDPC codes of similar rate in the literature. Simulation results demonstrate that the proposed symmetric codes have competitive performance in comparison with similar existing QC-LDPC codes that lack symmetry.Keywords
Funding Information
- Huawei Technologies
This publication has 16 references indexed in Scilit:
- Efficient Search of Girth-Optimal QC-LDPC CodesIEEE Transactions on Information Theory, 2016
- On the girth of (3,L) quasi-cyclic LDPC codes based on complete protographs2015
- A Survey on Protograph LDPC Codes and Their ApplicationsIEEE Communications Surveys & Tutorials, 2015
- Deterministic Girth-Eight QC-LDPC Codes with Large Column WeightIEEE Communications Letters, 2014
- Bounds on the Size of Parity-Check Matrices for Quasi-Cyclic Low-Density Parity-Check CodesIEEE Transactions on Information Theory, 2013
- Several Explicit Constructions for (3,L) QC-LDPC Codes with Girth at Least EightIEEE Communications Letters, 2013
- On the Girth of Quasi-Cyclic Protograph LDPC CodesIEEE Transactions on Information Theory, 2013
- Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large GirthIEEE Transactions on Information Theory, 2011
- Low-complexity girth-8 high-rate moderate length QC LDPC codesAEU - International Journal of Electronics and Communications, 2010
- High-Rate Girth-Eight Low-Density Parity-Check Codes on Rectangular Integer LatticesIEEE Transactions on Communications, 2004