Iterative Threshold Decoding of Spatially Coupled, Parallel-Concatenated Codes
Abstract
Spatially coupled, parallel concatenated codes (SC-PCCs) have been shown to approach channel capacity when decoded using optimal iterative methods. However, under complexity constraints such decoding strategies can result in unacceptable power and latency costs. In this work, we employ convolutional self-orthogonal component codes along with low-complexity, suboptimal a posteriori probability (APP) threshold decoders with SC-PCCs to reduce decoding complexity. The proposed code design is faster, more energy efficient, and easier to implement than optimal methods, while offering significant coding gain over existing threshold decodable, turbo-like constructions of similar latency and complexity. The design also serves to further illustrate the advantages spatial coupling can provide to existing code constructions and decoder implementations.
Read the paper
Related studies
- Regulation of nucleolus assembly by non-coding RNA polymerase II transcripts
- For a Healthy Histone Code, a Little SUMO in the Tail Keeps the Acetyl Away
- Discovering a binary CTCF code with a little help from BORIS
- Article Commentary: Stabilizing the Code–-Methods to Preserve RNA Prove Their Worth
- Foreword to the Special Issue for the RINTC (The Implicit Seismic Risk of Code-Conforming Structures) Project
- Commentary: Promoting Health and Well-being in Pediatric Primary Care Settings: Using Health and Behavior Codes at Routine Well-child Visits
Go deeper in Evidence Hub
Evidence Hub adds a study data sheet (design, sample size, evidence level, key numbers), an AI summary and a chat grounded in the paper's text.