用于NANDFlash的长BCH编码快速算法.docVIP

用于NAND Flash的长BCH编码快速算法* 任克强，吴 帆，谢 斌 （江西理工大学 信息工程学院，江西 赣州 341000） 摘 要：为满足大容量NAND Flash的BCH编码存在提出一种长BCH编码快速算法分圆倍集构造采用等价多项式代替除法多项式，将计算的最小多项式和理想循环码的生成元加入分圆倍集，后续编码可通过查找分圆倍集得到等价余数多项式，不需每次都进行除法运算，减少除法运算时间。实验结果表明，BCH编码算法和相关算法相比，本文算法长BCH编码，特别极长BCH，效果更明显。 长BCH编码分圆倍集；；NAND FlashLong BCH Encoding Fast Algorithm for NAND Flash REN Ke-qiang, WU Fan, XIE Bin (School of Information Engineering, Jiangxi University of Science and Technology, Ganzhou Jiangxi 341000, China) Abstract：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 cosets 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 cyclotomic cosets. The subsequent encoding could obtain equivalent remainder polynomial by looking for cyclotomic cosets, which reduced division operation time. The experimental results show that compared 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. Key words：long BCH encoding; cyclotomic cosets; Chinese remainder theorem(CRT); NAND Flash 0 引言 NAND Flash是目前市场的主流存储器之一，具有非易失、低功耗、容量大、速度快、体积小以及可反复擦写等优点，广泛的应用于众多的移动电子设备中[1]。随着工艺尺寸的进一步缩小，比特错误率（bit error rate，BER）的急剧增加[23]，NAND Flash的存储可靠性面临着严峻的挑战[4]，传统的单比特纠错码已经无法满足大容量NAND Flash的需求，NAND Flash纠错设计已成为当前的研究热点[5]。 BCH码是一种线性分组循环码，结构简单，编码方便，可以纠正多位随机错误；尤其当码较短时，性能，在NAND Flash的纠错设计中获得了广泛的应用[6]。文献[7]提出一种可以纠正多位错误方案，性能有一定的提高，但只适合非线性码字，且结构复杂。文献[8]采用级联编码编码增益光通信中。文献[9]通过三种新型结构减少长BCH码字并行时的扇出瓶颈效应。文献[10]提出一种求共享表达式的贪婪算法，编码器关键路径的延迟时间有，但仅适合码字较短的情况。文献[11]提出一种并行编码结构，编码时间有较大的，空间代价。文献[12]利用中国剩余定理（Chinese remainder theorem，CRT）实现BCH