Spatially Coupled Repeat-Accumulate Codes
Sarah J. Johnson, Gottfried Lechner
TL;DR
This paper introduces a new class of spatially coupled repeat-accumulate codes that offer simpler encoding and higher code rates compared to similar spatially coupled LDPC codes, while maintaining comparable decoding performance.
Contribution
The paper proposes spatially coupled repeat-accumulate codes with advantages over spatially coupled LDPC codes, including simpler encoders and higher code rates.
Findings
Simpler encoders for the proposed codes
Higher code rates than comparable spatially coupled LDPC codes
Similar decoding thresholds and complexity
Abstract
In this paper we propose a new class of spatially coupled codes based on repeat-accumulate protographs. We show that spatially coupled repeat-accumulate codes have several advantages over spatially coupled low-density parity-check codes including simpler encoders and slightly higher code rates than spatially coupled low-density parity-check codes with similar thresholds and decoding complexity (as measured by the Tanner graph edge density).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Cooperative Communication and Network Coding · Advanced biosensing and bioanalysis techniques