Efficient Termination of Spatially-Coupled Codes
Koji Tazoe, Kenta Kasai, Kohichi Sakaniwa

TL;DR
This paper introduces modified spatially-coupled LDPC codes that achieve higher coding rates and efficient termination using an accumulator, maintaining threshold performance while reducing rate-loss.
Contribution
The paper proposes a new class of spatially-coupled codes with improved rate and efficient termination via an accumulator, enhancing practical implementation.
Findings
Higher coding rate due to reduced rate-loss
Maintains threshold performance of original codes
Enables efficient termination with an accumulator
Abstract
Spatially-coupled low-density parity-check codes attract much attention due to their capacity-achieving performance and a memory-efficient sliding-window decoding algorithm. On the other hand, the encoder needs to solve large linear equations to terminate the encoding process. In this paper, we propose modified spatially-coupled codes. The modified codes have less rate-loss, i.e., higher coding rate, and have the same threshold as codes and are efficiently terminable by using an accumulator.
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 Data Storage Technologies
