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 discrepancies 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 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测试验证了所提方法的可靠性。