Abstract
This paper is concerned with block Markov super-position transmission of BCH (BMST-BCH) codes. Compared with other BMST codes, BMST-BCH codes can achieve a lower error floor with an encoding memory of two, which is critical to reduce both delay and implementation complexity. To further reduce the implementation complexity, we propose a hard-decision sliding-window decoding algorithm, in which only binary and/or erasure messages are processed and exchanged between nodes. A fast simulation approach is proposed, with the help of the genie-aided lower bound and the density evolution analysis, to evaluate the performance of BMST-BCH codes at the BER of 10−15. BMST-BCH codes are constructed with overheads ranging from 15% to 25%, exhibiting performances comparable to staircase codes with similar latencies. The proposed construction is more flexible to trade off latency against performance, and may find applications in optical transport networks as an attractive candidate.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
