首页> 外文会议>International Conference on Electron Devices and Solid-State Circuits >A Low Latency Decoding Algorithm for Grouping Variable Nodes on TLC NAND Flash Devices
【24h】

A Low Latency Decoding Algorithm for Grouping Variable Nodes on TLC NAND Flash Devices

机译:一种低延迟解码算法,用于在TLC NAND闪存设备上对变量节点进行分组

获取原文

摘要

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.
机译:基于本文所采用的信道模型,分析了TLC NAND闪存的单元内特性。为了解决分别由LDPC软判决解码和闪存存储密度增加引起的读取延迟和可靠性下降,提出了一种动态块分组方法,将所有可变节点(VN)分为三个子块。为了利用三个子块内的VN的可靠性,按顺序执行不同的更新操作。此外,对于最可靠的子块中的VN,通过减少迭代次数来减少解码延迟,同时,更新可靠的子块的优先级和及时处理低信息量的VN更为有用。信息在迭代解码过程中传输,从而提高了收敛速度。从数量上看,我们的仿真结果表明,与VNBP-MP算法相比,所提出的算法与VNBP-MP算法相比,收敛速度提高了约28.6%,平均迭代次数减少了约27.7%。 。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号