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