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