Early-Stopped Technique for BCH Decoding Algorithm Under Tolerant Fault Probability

In this paper, a technique for the Berlekamp Massey(BM) algorithm is provided to reduce the latency of
decoding and save decoding power by early termination or early stopped checking. We investigate the consecutive zero discrepan cies during the decoding iteration and decide to early stop the
decoding process. This technique is subject to decoding failure
in exchange for the decoding latency. We analyze our propose
d
technique by considering the weight distribution of BCH code and
estimating the bounds of undetected error probability as the event
of enormous stop checking. The proposed method is effective
in numerical results and the probability of decoding failure is
lower than 10
−119 for decoding 16383 code length of BCH codes.
Furthermore, the complexity compared the conventional early
termination method with the proposed approach for decoding the
long BCH code. The proposed approach reduces the complexity
of the conventional approach by up to 80%. As a result, the
FPGA testing on a USB device validates the reliability of the
proposed method