Constructing Grith Eight GC-LDPC Codes Based on the GCD FLRM Matrix with a New Lower Bound
Open Access
Abstract
By connecting multiple short, local low-density parity-check (LDPC) codes with a global parity check, the globally coupled (GC) LDPC code can attain high performances with low complexities. The typical design of a local code is a quasi-cyclic (QC) LDPC for which the code length is proportional to the size of circulant permutation matrix (CPM). The greatest common divisor (GCD)-based full-length row multiplier (FLRM) matrix is constrained by a lower bound of CPM size to avoid six length cycles. In this paper, we find a new lower bound for the CPM size and propose an algorithm to determine the minimum CPM size and the corresponding FLRM matrix. Based on the new lower bound, two methods are proposed to construct the GC-QC-LDPC code of grith 8 based on the GCD based FLRM matrix. With the proposed algorithm, the CPM size can be 45% less than that given by sufficient condition of girth 8. Compared with the conventional GC-LDPC construction, the codes constructed with the proposed method have improved performance and are more flexible in code length and code rate design.Keywords
This publication has 24 references indexed in Scilit:
- Design and Analysis of Non-Binary LDPC-CPM System for Hybrid Check Matrix Construction Algorithm of WSNSensors, 2018
- Explicit APM-LDPC Codes With Girths 6, 8, and 10IEEE Signal Processing Letters, 2017
- A 3.0 Gb/s Throughput Hardware-Efficient Decoder for Cyclically-Coupled QC-LDPC CodesIEEE Transactions on Circuits and Systems I: Regular Papers, 2016
- Large Girth Column-Weight Two and Three LDPC CodesIEEE Communications Letters, 2014
- Spatially coupled sparse codes on graphs: theory and practiceIEEE Communications Magazine, 2014
- Deterministic Girth-Eight QC-LDPC Codes with Large Column WeightIEEE Communications Letters, 2014
- Column-Weight Three QC LDPC Codes with Girth 20IEEE Communications Letters, 2013
- Construction of Girth-Eight QC-LDPC Codes from Greatest Common DivisorIEEE Communications Letters, 2013
- CRC-Aided Decoding of Polar CodesIEEE Communications Letters, 2012
- Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large GirthIEEE Transactions on Information Theory, 2011