Spatially coupled protograph-based LDPC codes for incremental redundancy

Walter P. Nitzold, M. Lentmaier, G. Fettweis
{"title":"Spatially coupled protograph-based LDPC codes for incremental redundancy","authors":"Walter P. Nitzold, M. Lentmaier, G. Fettweis","doi":"10.1109/ISTC.2012.6325218","DOIUrl":null,"url":null,"abstract":"We investigate a family of protograph based rate-compatible LDPC convolutional codes. The code family shows improved thresholds close to the Shannon limit compared to their uncoupled versions for the binary erasure channel as well as the AWGN channel. In fact, the gap to Shannon limit is almost uniform for all members of the code family ensuring good performance for all subsequent incremental redundancy transmissions. Compared to similar code families based on regular LDPC codes [1] the complexity of our approach grows slower for the considered rates.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTC.2012.6325218","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

We investigate a family of protograph based rate-compatible LDPC convolutional codes. The code family shows improved thresholds close to the Shannon limit compared to their uncoupled versions for the binary erasure channel as well as the AWGN channel. In fact, the gap to Shannon limit is almost uniform for all members of the code family ensuring good performance for all subsequent incremental redundancy transmissions. Compared to similar code families based on regular LDPC codes [1] the complexity of our approach grows slower for the considered rates.
增量冗余的基于空间耦合原型的LDPC码
我们研究了一类基于速率兼容的LDPC卷积码。与二进制擦除通道和AWGN通道的非耦合版本相比,代码族显示了接近香农极限的改进阈值。事实上,对于代码族的所有成员,到香农极限的差距几乎是一致的,确保了所有后续增量冗余传输的良好性能。与基于常规LDPC代码的类似代码族相比[1],我们的方法的复杂性在考虑的速率下增长较慢。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信