期刊
IEEE TRANSACTIONS ON INFORMATION THEORY
卷 59, 期 4, 页码 2277-2292出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2012.2231465
关键词
Belief propagation (BP); erasure channels; iterative decoding; low-density parity-check codes (LDPC); spatial coupling; windowed decoding (WD)
资金
- Center for Magnetic Recording Research
- National Science Foundation [CCF-0829865]
- Swiss National Science Foundation [200021-121903]
- Swiss National Science Foundation (SNF) [200021-121903] Funding Source: Swiss National Science Foundation (SNF)
Spatially coupled codes have been of interest recently owing to their superior performance over memoryless binary-input channels. The performance is good both asymptotically, since the belief propagation thresholds approach the Shannon limit, as well as for finite lengths, since degree-2 variable nodes that result in high error floors can be completely avoided. However, to realize the promised good performance, one needs large blocklengths. This in turn implies a large latency and decoding complexity. For the memoryless binary erasure channel, we consider the decoding of spatially coupled codes through a windowed decoder that aims to retain many of the attractive features of belief propagation, while trying to reduce complexity further. We characterize the performance of this scheme by defining thresholds on channel erasure rates that guarantee a target erasure rate. We give analytical lower bounds on these thresholds and show that the performance approaches that of belief propagation exponentially fast in the window size. We give numerical results including the thresholds computed using density evolution and the erasure rate curves for finite-length spatially coupled codes.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据