Explicit APM-LDPC Codes With Girths 6, 8, and 10
- 28 March 2017
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 24 (6) , 741-745
Abstract
Recently, some attentions have been focused on a class of low-density parity-check codes from affine permutation matrices, called APM-LDPC codes, which have some advantages rather than quasi-cyclic low-density parity-check (QC-LDPC) codes in the minimum-distance, cycle distribution and error-rate performance. In this letter, first, some novel explicit constructions for exponent matrices of conventional APM-LDPC codes with girths 6, 8, and 10 are investigated, and for each given exponent matrix E corresponding to an APM-LDPC code with girth 2g , 3 ≤ g ≤ 5, a lower bound Q = Q(E,g) is obtained, such that APM-LDPC codes with exponent matrix E have girth at least 2g, for each (prime) APM size m ≥ Q. Then, regarding to reduce the lower bound, an improved bound IQ is obtained, which is significantly better than some lower bounds reported for QC-LDPC codes with explicit constructions. Simulation results show that the constructed APM-LDPC codes outperform QC-LDPC codes with the same girth.Keywords
Funding Information
- Research Council of Shahrekord University (94GRD1M584)
- Institute for Research in Fundamental Sciences (95050065)
This publication has 19 references indexed in Scilit:
- An Explicit Method to Generate Some QC LDPC Codes with Girth 8Iranian Journal of Science and Technology, Transactions A: Science, 2016
- Row and Column Extensions of 4-Cycle Free LDPC CodesIEEE Communications Letters, 2015
- High‐performance binary and non‐binary Low‐density parity‐check codes based on affine permutation matricesIET Communications, 2015
- Quasi-Cyclic LDPC Codes Based on Pre-Lifted ProtographsIEEE Transactions on Information Theory, 2014
- On the Girth of Quasi-Cyclic Protograph LDPC CodesIEEE Transactions on Information Theory, 2013
- Construction of Girth-Eight QC-LDPC Codes from Greatest Common DivisorIEEE Communications Letters, 2013
- Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large GirthIEEE Transactions on Information Theory, 2011
- Large-Girth Nonbinary QC-LDPC Codes of Various LengthsIEEE Transactions on Communications, 2010
- Regular and irregular progressive edge-growth tanner graphsIEEE Transactions on Information Theory, 2005
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999