Efficient Search of Compact QC-LDPC and SC-LDPC Convolutional Codes with Large Girth
Information Theory
2018-04-19 v1 math.IT
Abstract
We propose a low-complexity method to find quasi-cyclic 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.
Cite
@article{arxiv.1804.06454,
title = {Efficient Search of Compact QC-LDPC and SC-LDPC Convolutional Codes with Large Girth},
author = {Mohammad H. Tadayon and Alireza Tasdighi and Massimo Battaglioni and Marco Baldi and Franco Chiaraluce},
journal= {arXiv preprint arXiv:1804.06454},
year = {2018}
}
Comments
4 pages, 3 figures, 1 table, accepted for publication in IEEE Communications Letters