Decoding method of ldpc code based on dynamic block update of variable nodes

Abstract

The invention relates to an LDPC (Low Density Parity Check Code) decoding method based on variable node dynamic block update for an MLC (Multi-Link Control) type NAND-Flash, which comprises the stepsthat S1, in an NAND-Flash storage channel, dividing variable nodes in a non-overlapping region into Data blocks, and dividing the variable nodes in the overlapping region into overlap sub-blocks; S2,continuously subdividing the Data blocks into a plurality of data sub-blocks; s3, skipping a plurality of data sub-blocks, sequentially updating the variable nodes in the remaining data sub-blocks andoverlapping sub-blocks respectively according to the sequence, searching out low-value variable nodes in each data sub-block and overlap sub-block respectively, and updating the low-value variable nodes according to the sequence; s4, judging whether a judgment condition is met or not, if yes, updating variable nodes of the plurality of data sub-blocks skipped in the step S3 in sequence and repeating the step S3, and if not, repeating the step S3; and S5, judging whether the decoding is successful or not, if not, continuing the step S4, and if so, ending. Information generated by updating thereliable nodes is used for driving and updating unreliable nodes, and the utilization rate of iteration updating information is increased.

Description

technical field [0001] The invention relates to the technical field of communication coding, in particular to an LDPC code decoding method for MLC-type NAND-Flash based on dynamic block updating of variable nodes. Background technique [0002] In 1962, Gallager proposed the LDPC (Low Density Parity Check) code for the first time in a paper, and gave the definition, construction method and decoding method of the LDPC code in the paper. The two decoding methods mentioned in the paper are: hard-decision decoding based on bit flipping (BF, Bit Flipping) and soft-decision decoding based on posterior probability (Posteriori Probability), which laid a theoretical foundation for subsequent research , but due to the limitations of computer processing power and storage capacity at that time, LDPC codes did not attract the attention of researchers. Until 1996, MacKay and Neal re-researched LDPC codes on the basis of Gallager's research. The two used randomized construction to construc...

AI Technical Summary

Problems solved by technology

[0005] With the improvement of cell storage density, traditional error correction codes such as Hamming codes and BCH codes have been difficult to meet the error correction performance requirements of NAND-Flash. Since LDPC codes can approach the Shannon limit to the maximum extent, in the case of high code rates It can also achieve good error correction performance without causing too much delay, so it is currently the mainstream error correction code scheme for the reliability of data stored in flash memory technology, and it is also the main research hotspot in the field of high-density storage coding and decoding.

Images