A Low Latency Decoding Algorithm for Grouping Variable Nodes on TLC NAND Flash Devices
- 1 June 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-3
Abstract
The intra-cell characteristics of TLC NAND Flash memory are analyzed based on the channel model employed in this paper. In order to solve the read latency and the reliability degradation, caused by LDPC soft decision decoding and by the increase of flash storage density, respectively, a dynamic block grouping approach is proposed to divide all variable nodes (VNs) into three sub-blocks. To exploit the reliability of the VNs within the three sub-blocks, different update operations are performed in order. Moreover, the decoding latency is reduced with fewer iterations for the VNs in the most reliable sub-block, at the same time, the priority for updating of the reliable sub-block and the timely processing of the VNs with low-information have more useful information transmitted in the iterative decoding process, resulting in the improved convergency speed. In quantity, our simulation results show that the proposed algorithm improves the convergency rate by about 28.6% and reduces the average number of iterations by around 27.7%, compared with the VNBP-MP algorithm without compromising the error correction performance on the TLC NAND Flash devices.Keywords
This publication has 7 references indexed in Scilit:
- Process Variation Aware Read Performance Improvement for LDPC-Based nand Flash MemoryIEEE Transactions on Reliability, 2019
- An Improved Variable-Node-Based BP Decoding Algorithm for NAND Flash Memory2018
- Read and Write Voltage Signal Optimization for Multi-Level-Cell (MLC) NAND Flash MemoryIEEE Transactions on Communications, 2016
- Performance of the modified SRBI-MLGD algorithm for LDPC codes in MLC NAND flash memory2015
- Advanced error prediction LDPC for high-speed reliable TLC nand-based SSDs2014
- On the Use of Soft-Decision Error-Correction Codes in nand Flash MemoryIEEE Transactions on Circuits and Systems I: Regular Papers, 2010
- Regular and irregular progressive edge-growth tanner graphsIEEE Transactions on Information Theory, 2005