the two-dimensional Hamming code algorithm for NAND flash memory is proposed.Any two-dimensional length of 2 J bit storage data From the row and column view
the uniform Hamming encoding algorithm formula is provided.by calculating error-correcting-pairs
multiple bit data error can be corrected.The error of the MLC structure and the integrity of data storage system is solved by first decoding
and then check decoding.On this basis
the error no-corrected pattern is analyzed.XOR operation which is the core structure of the algorithm is easy to implement and suitable for NAND flash memory.Experimental results show that the effective data in two-dimensional structure 1 024 * 128.Coding efficiency is 11%
actual12.6%.Its encoding speed and decoding speed are up to 102 Gbps
suitable for high-speed storage system.
关键词
Keywords
references
Ding C, Fan C, Zhou Z. The dimension and minimum distance of two classes of primitive BCH codes[J]. Finite Fields and Their Applications, 2017 (45): 237-263. DOI: 237
Peng X, Zhang W, Ji W, et al. Reduced-complexity multiplicity assignment algorithm and architecture for low-complexity chase decoder of reed-solomon codes[J]. IEEE Communications Letters, 2015, 19 (11): 1865-1868. DOI: 1865