In this paper, a practical technique for the conventional 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 discrepancies during the decoding iteration and make a decision to early stop the decoding process. This technique is subject to decoding failure in exchange for the decoding latency. We analyze our proposed 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.

翻译：本文针对传统Berlekamp-Massey（BM）算法，提出了一种通过提前终止或早停检查来降低译码延迟和节省译码功耗的实用技术。我们研究了译码迭代过程中出现的连续零差值，并据此决策是否提前终止译码流程。该技术以译码失败为代价换取译码延迟的降低。通过考虑BCH码的重量分布，并将未检测错误概率的界限估算为大规模停检事件，我们对所提技术进行了分析。数值结果表明该方法有效，对于码长为16383的BCH码，其译码失败概率低于$10^{-119}$。此外，本文还比较了传统早停方法与所提方法在长BCH码译码时的复杂度，所提方法可将传统方法的复杂度降低高达80%。最终，在USB设备上的FPGA测试验证了所提方法的可靠性。