Efficient Search of Compact QC-LDPC and SC-LDPC Convolutional Codes With Large Girth
- 17 April 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 22 (6) , 1156-1159
Abstract
We propose a low-complexity method to find quasicyclic low-density parity-check block codes with girth 10 or 12 and shorter length than those designed through classical approaches. The method is extended to time-invariant spatially coupled low-density parity-check convolutional codes, permitting to achieve small syndrome former constraint lengths. Several numerical examples are given to show its effectiveness.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Design and Analysis of Time-Invariant SC-LDPC Convolutional Codes With Small Constraint LengthIEEE Transactions on Communications, 2017
- Symmetrical Constructions for Regular Girth-8 QC-LDPC CodesIEEE Transactions on Communications, 2016
- An Explicit Method to Generate Some QC LDPC Codes with Girth 8Iranian Journal of Science and Technology, Transactions A: Science, 2016
- Efficient Search of Girth-Optimal QC-LDPC CodesIEEE Transactions on Information Theory, 2016
- Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large GirthIEEE Transactions on Information Theory, 2011
- Algebraic construction of sparse matrices with large girthIEEE Transactions on Information Theory, 2006
- Terminated LDPC convolutional codes with thresholds close to capacity2005
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation MatricesIEEE Transactions on Information Theory, 2004
- Time-varying periodic convolutional codes with low-density parity-check matrixIEEE Transactions on Information Theory, 1999
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981