Channel Parameter and Read Reference Voltages Estimation in 3-D NAND Flash Memory Using Unsupervised Learning Algorithms
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS(2024)
摘要
In 3-D NAND flash memory, the channel is always offset due to the complicated interference from the program/erase (PE), including the data retention and layer interference, so that the channel estimation is desired. However, due to the physical structure of 3-D flash memory, there exists significant variation in channel parameters and inconsistent channel offsets among different wordlines. As a result, the process of estimating channel parameters for each individual wordline typically requires a considerable amount of computational resources, resulting in the high latency of system, which becomes a new challenge. To tackle this problem, two unsupervised learning algorithms are proposed to estimate the channel parameters, based on analyzing the error distribution in 3-D flash memory. To address the longer read latency introduced by the unsupervised learning algorithm for the channel estimation, we further propose a low-latency detection algorithm, which first detects whether the current channel needs to be updated. In the event that an update is required, the algorithm only periodically estimates the channel parameters during system idle times, resulting in a more efficient and streamlined process. Compared to the existing methods, the proposed algorithms can efficiently estimate channel parameters with lower-computational complexity. Moreover, combining with the search algorithm, a correction scheme is proposed to minimize the error between the estimated read reference voltage (RRV) and the optimal RRV in the actual device. Theoretical analysis and simulation results demonstrate that the proposed method can improve the lifetime of flash memory and reduces the number of read retries.
更多查看译文
关键词
3-D NAND flash memory,low complexity,param-eter estimation,read reference voltage (RRV),unsupervised learning algorithm
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要