Rate-compatible non-binary LDPC codes concatenated with multiplicative repetition codes

K. Kasai, D. Declercq, C. Poulliat, K. Sakaniwa
{"title":"Rate-compatible non-binary LDPC codes concatenated with multiplicative repetition codes","authors":"K. Kasai, D. Declercq, C. Poulliat, K. Sakaniwa","doi":"10.1109/ISIT.2010.5513615","DOIUrl":null,"url":null,"abstract":"We propose non-binary LDPC codes concatenated with multiplicative repetition codes. To the best of the authors' knowledge, for the transmissions over the memoryless binary-input output-symmetric channels, 2m-ary the (2,dc)-regular LDPC code for m ∼ 8 and dc ≥ 3 is the best code so far among codes with moderate code length. By multiplicatively repeating the 2m-ary (2,3)-regular LDPC code of rate ⅓, we construct rate-compatible codes of lower rates 1/6,1/9,1/12,…. Surprisingly, such simple low-rate codes outperform the best low-rate binary codes so far.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2010.5513615","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

We propose non-binary LDPC codes concatenated with multiplicative repetition codes. To the best of the authors' knowledge, for the transmissions over the memoryless binary-input output-symmetric channels, 2m-ary the (2,dc)-regular LDPC code for m ∼ 8 and dc ≥ 3 is the best code so far among codes with moderate code length. By multiplicatively repeating the 2m-ary (2,3)-regular LDPC code of rate ⅓, we construct rate-compatible codes of lower rates 1/6,1/9,1/12,…. Surprisingly, such simple low-rate codes outperform the best low-rate binary codes so far.
速率兼容的非二进制LDPC码与乘法重复码连接
我们提出了非二进制LDPC码与乘法重复码连接。据作者所知,对于在无记忆二进制输入输出对称信道上的传输,m ~ 8和dc≥3的(2,dc)-正则LDPC码是迄今为止中等码长码中的最佳码。通过对速率为1/ 3的2m-ary(2,3)-正则LDPC码进行乘法重复,我们构建了速率为1/6,1/9,1/12,....的速率兼容码令人惊讶的是,到目前为止,这种简单的低速率代码比最好的低速率二进制代码性能更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信