Finite-Length Construction of High Performance Spatially-Coupled Codes via Optimized Partitioning and Lifting
Homa Esfahanizadeh, Ahmed Hareedy, and Lara Dolecek

TL;DR
This paper introduces a novel two-stage construction framework for finite-length spatially-coupled codes, optimizing partitioning and lifting to significantly reduce error floors and enhance performance over additive white Gaussian noise channels.
Contribution
It presents a general enumeration method for detrimental objects in finite-length SC codes and a new optimization framework for partitioning and lifting to improve code performance.
Findings
Nearly 5 orders of magnitude error floor improvement
Effective enumeration of detrimental objects for various code parameters
Optimized partitioning and lifting significantly enhance code performance
Abstract
Spatially-coupled (SC) codes are a family of graph-based codes that have attracted significant attention thanks to their capacity approaching performance and low decoding latency. An SC code is constructed by partitioning an underlying block code into a number of components and coupling their copies together. In this paper, we first introduce a general approach for the enumeration of detrimental combinatorial objects in the graph of finite-length SC codes. Our approach is general in the sense that it effectively works for SC codes with various column weights and memories. Next, we present a two-stage framework for the construction of high-performance binary SC codes optimized for additive white Gaussian noise channel; we aim at minimizing the number of detrimental combinatorial objects in the error floor regime. In the first stage, we deploy a novel partitioning scheme, called the…
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.
