| Summary: | As data storage demands continue to grow, ensuring the reliability of NAND flash devices after a large number of Program/Erase (P/E) cycles have elapsed has become a critical requirement. With an addition in the number of Program/Erase (P/E) cycles in NAND flash devices, it is observed that there is an increase in the Raw Bit Error Rates (RBER) returned by the device. To address these challenges, this paper presents the design, implementation, and evaluation of advanced Error Correction Codes (ECC), including Euclidean Geometry Low-Density Parity Check (EG-LDPC), Quasi Cyclic Euclidean Geometry Low-Density Parity Check (QC-EG-LDPC), and Quasi-Cyclic Low-Density Parity Check (QC-LDPC) codes constructed over finite fields and adapted to meet the architectural constraints of flash memory devices. These codes are carefully optimized to meet the architectural and performance constraints of modern flash memory systems, with all designs achieving code rates in excess of 0.9. We have also synthesized LDPC codes having a code rate exceeding 0.92—to accommodate scenarios in which the parity check overhead has to be reduced to a minimum. The performance of the synthesized codes measured in terms of Undetected Bit Error Rate (UBER) has been evaluated as a function of the P/E cycles experienced by the NAND flash device. The process of constructing suitable parity check and generator matrices for each synthesized LDPC code is described. The designed QC-LPDC codes have been decoded using the Min Sum Algorithm (MSA) with a maximum of five decoding iterations. The evaluation of these codes has been compared with other state-of-the-art codes synthesized for this purpose, and an appropriate performance comparison has been presented. The encoders and decoders of the codes synthesized in this paper have been implemented using Xilinx Vivado software. It has been demonstrated that the QC-EG-LDPC code with a code rate of 0.92, synthesized in this paper, improves the lifetime of the NAND flash device to as many as 10,000 P/E cycles.
|