Design and Analysis of Time-Invariant SC-LDPC Convolutional Codes With Small Constraint Length

Abstract

In this paper, we deal with time-invariant spatially coupled low-density parity-check convolutional codes (SC-LDPC-CCs). Classic design approaches usually start from quasi-cyclic low-density parity-check (QC-LDPC) block codes and exploit suitable unwrapping procedures to obtain SC-LDPC-CCs. We show that the direct design of the SC-LDPC-CCs syndrome former matrix or, equivalently, the symbolic parity-check matrix, leads to codes with smaller syndrome former constraint lengths with respect to the best solutions available in the literature. We provide theoretical lower bounds on the syndrome former constraint length for the most relevant families of SC-LDPC-CCs, under constraints on the minimum length of cycles in their Tanner graphs. We also propose new code design techniques that approach or achieve such theoretical limits.

arXiv comment30 pages, 5 figures, accepted for publication in IEEE Transactions on Communications

References in corpus (9)

• Spatially Coupled LDPC Codes Constructed from Protographs
• Windowed Decoding of Protograph-based LDPC Convolutional Codes over Erasure Channels
• Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds
• Searching for Voltage Graph-Based LDPC Tailbiting Codes with Large Girth
• Terminated LDPC Convolutional Codes with Thresholds Close to Capacity
• Hierarchical and High-Girth QC LDPC Codes
• Construction of High-Rate Regular Quasi-Cyclic LDPC Codes Based on Cyclic Difference Families
• Progressive Differences Convolutional Low-Density Parity-Check Codes
• On Advisability of Designing Short Length QC-LDPC Codes Using Perfect Difference Families

Cited by in corpus (7)

• Analysis and Optimization of Tail-Biting Spatially Coupled Protograph LDPC Codes for BICM-ID Systems
• Spatially-Coupled QLDPC Codes
• Efficient Search and Elimination of Harmful Objects in Optimized QC SC-LDPC Codes
• GRADE-AO: Towards Near-Optimal Spatially-Coupled Codes With High Memories
• Breaking the Computational Bottleneck: Design of Near-Optimal High-Memory Spatially-Coupled Codes
• Nested Array-Based Spatially Coupled LDPC Codes
• Integer Ring Sieve for Constructing Compact QC-LDPC Codes with Girths 8, 10, and 12