Read Voltage Optimization in MLC NAND Flash Memory via the Density Evolution

Chatuporn Duangthong, W. Phakphisut, P. Supnithi
{"title":"Read Voltage Optimization in MLC NAND Flash Memory via the Density Evolution","authors":"Chatuporn Duangthong, W. Phakphisut, P. Supnithi","doi":"10.1109/ICT.2019.8798808","DOIUrl":null,"url":null,"abstract":"The multi-level-cell (MLC) NAND flash memory can typically use multiple reads for obtaining soft information for the LDPC decoder. The multiple reads give the soft information which is quantized to a certain level. The major challenge is that the read voltages must be precisely selected to provide better soft information. In the previous work, the read voltages are selected so that the soft information has the maximum mutual information (MMI). However, the error-correction capability of LDPC decoder is not considered. Therefore, in this work, we analyze the performance of LDPC decoder by density evolution whereby the soft information is quantized. Then the optimal read voltages for given LDPC codes are obtained. As a result, for a regular LDPC code with the read voltages optimized by density evolution can provide the lower BER performance compared with the MMI technique.","PeriodicalId":127412,"journal":{"name":"2019 26th International Conference on Telecommunications (ICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 26th International Conference on Telecommunications (ICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICT.2019.8798808","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The multi-level-cell (MLC) NAND flash memory can typically use multiple reads for obtaining soft information for the LDPC decoder. The multiple reads give the soft information which is quantized to a certain level. The major challenge is that the read voltages must be precisely selected to provide better soft information. In the previous work, the read voltages are selected so that the soft information has the maximum mutual information (MMI). However, the error-correction capability of LDPC decoder is not considered. Therefore, in this work, we analyze the performance of LDPC decoder by density evolution whereby the soft information is quantized. Then the optimal read voltages for given LDPC codes are obtained. As a result, for a regular LDPC code with the read voltages optimized by density evolution can provide the lower BER performance compared with the MMI technique.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于密度演化的MLC NAND闪存读电压优化
多电平单元(MLC) NAND闪存通常可以使用多次读取来获取LDPC解码器的软信息。多次读取得到的软信息被量化到一定程度。主要的挑战是必须精确地选择读取电压以提供更好的软信息。在之前的工作中,为了使软信息具有最大的互信息(MMI),选择了读电压。但没有考虑LDPC解码器的纠错能力。因此,在这项工作中,我们通过密度演化来分析LDPC解码器的性能,从而将软信息量化。然后得到给定LDPC码的最优读电压。结果表明,对于普通LDPC码,采用密度演化优化的读电压可以提供比MMI技术更低的误码率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Dual-polarized Antennas Based Directional Modulation Scheme Sliding-Window Processing of Turbo Equalization for Partial Response Channels Feature fusion by using LBP, HOG, GIST descriptors and Canonical Correlation Analysis for face recognition Periodic Time Series Data Classification By Deep Neural Network SFDS: A Self-Feedback Detection System for DNS Hijacking Based on Multi-Protocol Cross Validation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1