Block Markov Superposition Transmission of BCH Codes with Iterative Erasures-and-Errors Decoders
Suihua Cai, Nina Lin, Xiao Ma

TL;DR
This paper introduces BMST-BCH codes with a low-complexity iterative decoding algorithm, achieving near-capacity performance and low error floors, suitable for optical networks.
Contribution
It proposes a novel BMST-BCH code construction with an efficient sliding-window decoding algorithm and a fast simulation method for low error rate evaluation.
Findings
Achieves a net coding gain of 10.55 dB at BER of 10^{-15} with hard decoding.
Soft decoding improves net coding gain to 10.74 dB.
Flexible code design balances latency and performance.
Abstract
In this paper, we present the block Markov superposition transmission of BCH (BMST-BCH) codes, which can be constructed to obtain a very low error floor. To reduce the implementation complexity, we design a low complexity iterative sliding-window decoding algorithm, in which only binary and/or erasure messages are processed and exchanged between processing units. The error floor can be predicted by a genie-aided lower bound, while the waterfall performance can be analyzed by the density evolution method. To evaluate the error floor of the constructed BMST-BCH codes at a very low bit error rate (BER) region, we propose a fast simulation approach. Numerical results show that, at a target BER of , the hard-decision decoding of the BMST-BCH codes with overhead can achieve a net coding gain (NCG) of dB. Furthermore, the soft-decision decoding can yield an NCG of…
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 · Advanced Wireless Communication Techniques · Cellular Automata and Applications
