用于NAND Flash的长BCH编码快速算法  

Long BCH encoding fast algorithm for NAND Flash

作　　者：任克强[1] 吴帆[1] 谢斌[1] 

机构地区：[1]江西理工大学信息工程学院,江西赣州341000

出　　处：《计算机应用研究》2015年第7期2027-2029,共3页Application Research of Computers

基　　金：江西省教育厅青年科学基金项目(GJJ11132);江西省研究生创新基金项目(YC2013-S199)

摘　　要：为满足大容量NAND Flash的容错需求,解决传统BCH编码存在长码字编码效率低下的问题,提出一种长BCH编码的快速算法。算法利用分圆陪集和中国剩余定理,在确定生成多项式时,由每个最小多项式的根构造分圆陪集,避免了重复计算所有的根;采用等价多项式代替除法多项式,将计算的最小多项式和理想循环码的生成元加入分圆陪集,后续编码可通过查找分圆陪集得到等价余数多项式,无须每次都进行除法运算,减少了除法运算时间。实验结果表明,与传统BCH编码算法和相关算法相比,该算法在长BCH编码时具有较高的编码效率,特别是对极长BCH编码,效果更加明显。Aiming at inefficient problem of long encoding in traditional BCH, this article proposed a long BCH encoding fast algorithm for large capacity NAND Flash. In order to avoid repeated calculating all roots, the algorithm made use of cyclotomic eosets and Chinese remainder theorem to construct cyclotomic cosets of minimal polynomial roots when it was determining the generator polynomial. It used the equivalent polynomial substituting for the division polynomial, and joined the minimal polynomial and ideal generating element to eyclotomic cosets. The subsequent encoding could obtain equivalent remainder polynomial by looking for cyclotomie cosets, which reduced division operation time. The experimental results show that compares with traditional BCH algorithm and relevant algorithm, the algorithm has higher encoding efficiency for long BCH code, especially for very long BCH code, the effect is more obvious.

关 键 词：长BCH编码 分圆陪集 中国剩余定理 NAND FLASH 

分 类 号：TP333[自动化与计算机技术—计算机系统结构] TP301.6[自动化与计算机技术—计算机科学与技术]