摘要
对一种占用硬件资源最少的码长为n=2m-1的纠二错二进制BCH码译码器电路进行了改进,使其能用于信道的连续译码,并对算法中的关键点 S_3 ( x ) 查找表的实现提出一种新的简单方法。
This paper improves a high-speed algorithm of double-error-correcting BCH codes of length n=2m-1 in continuous decoding condition.A new method for the key point of this algorithm, the lookup table of ,S^3 ( x )is presented to simplify the difficulty of realizing the circuit.
出处
《计算机工程》
CAS
CSCD
北大核心
2004年第22期178-180,共3页
Computer Engineering
