Construction of High-Rate Regular Quasi-Cyclic LDPC Codes Based on Cyclic Difference Families
- 16 July 2013
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 61 (8), 3108-3113
- https://doi.org/10.1109/tcomm.2013.070213.120879
Abstract
For a high-rate case, it is difficult to randomly construct good low-density parity-check (LDPC) codes of short and moderate lengths because their Tanner graphs are prone to have short cycles. Also, the existing high-rate quasi-cyclic (QC) LDPC codes can be constructed only for very restricted code parameters. In this paper, based on special classes of cyclic difference families, we propose a new construction method of high-rate regular QC LDPC codes having parity-check matrices consisting of a single row of circulants with column-weight 3 or 4. The proposed QC LDPC codes can be constructed for various code rates and lengths including the minimum achievable length for given column-weight and design rate under girth 6. It is observed that the parity-check matrices of the proposed QC LDPC codes have full rank for column-weight 3 and just one redundant row for column-weight 4. It is shown that the error correcting performance of the proposed QC LDPC codes of short and moderate lengths is almost the same as that of the existing ones through numerical analysis.This publication has 19 references indexed in Scilit:
- Perfect difference families, perfect difference matrices, and related combinatorial structuresJournal of Combinatorial Designs, 2010
- A Construction of High Rate Quasi-Cyclic Regular LDPC Codes from Cyclic Difference Families with Girth 8IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2007
- Directed–ordered whist tournaments and (v,5,1) difference families: existence results and some new classes of Z-cyclic solutionsDiscrete Applied Mathematics, 2004
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation MatricesIEEE Transactions on Information Theory, 2004
- Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative DecodingIEEE Transactions on Information Theory, 2004
- Codes for Iterative Decoding From Partial GeometriesIEEE Transactions on Communications, 2004
- Resolvable 2-designs for regular low-density parity-check codesIEEE Transactions on Communications, 2003
- Spectral graphs for quasi-cyclic LDPC codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Low-density parity-check codes based on finite geometries: a rediscovery and new resultsIEEE Transactions on Information Theory, 2001
- Constructions for Cyclic Steiner 2-designsPublished by Elsevier BV ,1987