Fast-converging bit-flipping decoder for low-density parity-check codes
A parity-check matrix and decoder technology, applied in the field of non-volatile memory devices, can solve problems such as unreliability of multi-layer NAND flash memory devices
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0019] Low density parity check (LDPC) codes are an important part of linear block error correction codes (ECC) and have been widely used in data storage systems. LDPC codes can be decoded using two classes of decoding algorithms: soft information message passing algorithms such as minimum sum or sum product algorithms, and hard decision algorithms such as bit flipping algorithms. Soft information decoding algorithms provide good decoding performance, but require a lot of computational resources. Therefore, they exhibit high complexity in hardware implementation. In contrast, hardware implementations of hard-decision decoders exhibit low complexity and reduced latency requirements due to simple computational units and smaller connection networks, and have been developed to provide similar error correction performance. In other systems, a combination of hard decoding and soft decoding implementations is employed.
[0020] In most bit-flipping decoder architectures, the correc...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


