Time-Invariant Spatially Coupled Low-Density Parity-Check Codes with Small Constraint Length
Abstract
We consider a special family of SC-LDPC codes, that is, time-invariant LDPCC codes, which are known in the literature for a long time. Codes of this kind are usually designed by starting from QC block codes, and applying suitable unwrapping procedures. We show that, by directly designing the LDPCC code syndrome former matrix without the constraints of the underlying QC block code, it is possible to achieve smaller constraint lengths with respect to the best solutions available in the literature. We also find theoretical lower bounds on the syndrome former constraint length for codes with a specified minimum length of the local cycles in their Tanner graphs. For this purpose, we exploit a new approach based on a numerical representation of the syndrome former matrix, which generalizes over a technique we already used to study a special subclass of the codes here considered.
Cite
@article{arxiv.1605.05560,
title = {Time-Invariant Spatially Coupled Low-Density Parity-Check Codes with Small Constraint Length},
author = {Marco Baldi and Massimo Battaglioni and Franco Chiaraluce and Giovanni Cancellieri},
journal= {arXiv preprint arXiv:1605.05560},
year = {2016}
}
Comments
5 pages, 4 figures, to be presented at IEEE BlackSeaCom 2016