Block Markov Superposition Transmission of BCH Codes With Iterative Erasures-and-Errors Decoders

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 10 −15 , the hard-decision decoding of the BMST-BCH codes with overhead 25% can achieve a net coding gain (NCG) of 10.55 dB. Furthermore, the soft-decision decoding can yield an NCG of 10.74 dB. The construction of BMST-BCH codes is flexible to trade off latency against performance at all overheads of interest and may find applications in optical transport networks as an attractive candidate. Index TermsBCH codes, block Markov superposition transmission (BMST), forward error correction (FEC), iterative decoding, optical communication.

Progress and prospect of 6G wireless air-interface transmission technology research

“…接收端通常 采用滑动窗口迭代译码算法, 性能可以借助精灵辅助 (genie-aided, GA) 下界进行预测 [60] . BMST 可 采用短卷积码 [56] , BCH 码 [61] 等作为基本码, 利用基本码的编译码算法进行编译码, 其具有码率可调, 构造普适的优势.…”

Design and Implementation of Bit-Coupled Recursive Decoding for Turbo Codes for IoT Networks

“…for an SNR range of 0=10 dB [4]. Typically, the error drops as a function of the iterative decoding in several error detection and correction coding techniques [5].…”

A Review on VLSI Aspects of Error Detection and Correction on SOCs

“…Implementing robust error detection and correction mechanisms is crucial for the overall reliability and performance of VLSI circuits [3]. VLSI circuits can be susceptible to different types of errors, such as single-bit errors, multiple-bit errors, and intermittent faults [4]. Single-bit errors involve the corruption of a single binary digit, while multiple-bit errors affect more than one bit simultaneously [5].…”