The weight consistency matrix framework for general non-binary LDPC code optimization: Applications in flash memories

Ahmed Hareedy, Chinmayi Lanka, Clayton Schoeny, L. Dolecek
{"title":"The weight consistency matrix framework for general non-binary LDPC code optimization: Applications in flash memories","authors":"Ahmed Hareedy, Chinmayi Lanka, Clayton Schoeny, L. Dolecek","doi":"10.1109/ISIT.2016.7541791","DOIUrl":null,"url":null,"abstract":"Transmission channels underlying modern memory systems, e.g., Flash memories, possess a significant amount of asymmetry. While existing LDPC codes optimized for symmetric, AWGN-like channels are being actively considered for Flash applications, we demonstrate that, due to channel asymmetry, such approaches are fairly inadequate. We propose a new, general, combinatorial framework for the analysis and design of non-binary LDPC (NB-LDPC) codes for asymmetric channels. We introduce a refined definition of absorbing sets, which we call general absorbing sets (GASs), and an important subclass of GASs, which we refer to as general absorbing sets of type two (GASTs). Additionally, we study the combinatorial properties of GASTs. We then present the weight consistency matrix (WCM), which succinctly captures key properties in a GAST. Based on these new concepts, we then develop a general code optimization framework, and demonstrate its effectiveness on the realistic highly-asymmetric normal-Laplace mixture (NLM) Flash channel. Our optimized codes enjoy over one order (resp., half of an order) of magnitude performance gain in the uncorrectable BER (UBER) relative to the unoptimized codes (resp. the codes optimized for symmetric channels).","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2016.7541791","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Transmission channels underlying modern memory systems, e.g., Flash memories, possess a significant amount of asymmetry. While existing LDPC codes optimized for symmetric, AWGN-like channels are being actively considered for Flash applications, we demonstrate that, due to channel asymmetry, such approaches are fairly inadequate. We propose a new, general, combinatorial framework for the analysis and design of non-binary LDPC (NB-LDPC) codes for asymmetric channels. We introduce a refined definition of absorbing sets, which we call general absorbing sets (GASs), and an important subclass of GASs, which we refer to as general absorbing sets of type two (GASTs). Additionally, we study the combinatorial properties of GASTs. We then present the weight consistency matrix (WCM), which succinctly captures key properties in a GAST. Based on these new concepts, we then develop a general code optimization framework, and demonstrate its effectiveness on the realistic highly-asymmetric normal-Laplace mixture (NLM) Flash channel. Our optimized codes enjoy over one order (resp., half of an order) of magnitude performance gain in the uncorrectable BER (UBER) relative to the unoptimized codes (resp. the codes optimized for symmetric channels).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通用非二进制LDPC代码优化的权重一致性矩阵框架:在闪存中的应用
现代存储系统(例如,闪存)的传输通道具有大量的不对称性。虽然现有的LDPC代码优化对称,awgn类通道正在积极考虑Flash应用程序,我们证明,由于通道不对称,这种方法是相当不足的。我们提出了一种新的、通用的组合框架,用于分析和设计非对称信道的非二进制LDPC (NB-LDPC)码。我们引入了吸收集的一个精细化定义,我们称之为一般吸收集(GASs),以及吸收集的一个重要子类,我们称之为二类一般吸收集(gast)。此外,我们还研究了GASTs的组合特性。然后我们给出了权重一致性矩阵(WCM),它简洁地捕获了GAST中的关键属性。基于这些新概念,我们开发了一个通用的代码优化框架,并证明了它在现实的高度不对称正拉普拉斯混合(NLM) Flash信道上的有效性。我们的优化代码享受超过一个订单(响应)。在不可校正误码率(UBER)中,相对于未优化的代码(resp. 1),性能增加了半个数量级。为对称信道优化的代码)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
String concatenation construction for Chebyshev permutation channel codes Cyclically symmetric entropy inequalities Near-capacity protograph doubly-generalized LDPC codes with block thresholds On the capacity of a class of dual-band interference channels Distributed detection over connected networks via one-bit quantizer
×
引用
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