4-Cycle Free Spatially Coupled LDPC Codes with an Explicit Construction
Authors:
- Zeinab RoostaieZRZeinab Roostaie
- Mohammad GholamiMGMohammad Gholami
- Farzad ParvareshFPFarzad Parvaresh
Preprint
Abstract
Spatially coupled low-density parity-check (SC-LDPC) codes are a class of capacity approaching LDPC codes with low message recovery latency when a sliding window decoding is used. In this paper, we first present a new method for the construction of a class of SC-LDPC codes by the incidence matrices of a given non-negative integer matrix $E$, and then the relationship of 4-cycles between matrix $E$ and the corresponding SC-LDPC code are investigated. Finally, by defining a new class of integer finite sequences, called {\it good sequences}, for the first time, we give an explicit method for the construction of a class of 4-cycle free SC-LDPC codes that can achieve (in most cases) the minimum coupling width.
Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Designing Protograph-Based Quasi-Cyclic Spatially Coupled LDPC Codes With Large GirthIEEE Transactions on Communications, 2020
- Spatially Coupled LDPC Codes With Small Constraint Length and Low Error FloorIEEE Communications Letters, 2019
- Design and Analysis of Time-Invariant SC-LDPC Convolutional Codes With Small Constraint LengthIEEE Transactions on Communications, 2017
- High‐performance binary and non‐binary Low‐density parity‐check codes based on affine permutation matricesIET Communications, 2015
- Spatially coupled sparse codes on graphs: theory and practiceIEEE Communications Magazine, 2014
- On the Girth of Quasi-Cyclic Protograph LDPC CodesIEEE Transactions on Information Theory, 2013
- Minimum Distance and Trapping Set Analysis of Protograph-Based LDPC Convolutional CodesIEEE Transactions on Information Theory, 2012
- Deriving Good LDPC Convolutional Codes from LDPC Block CodesIEEE Transactions on Information Theory, 2011
- Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BECIEEE Transactions on Information Theory, 2011
- Iterative Decoding Threshold Analysis for LDPC Convolutional CodesIEEE Transactions on Information Theory, 2010