为实现任意分集顺序的空间耦合码设计原型机

N. Hassan, I. Andriyanova, M. Lentmaier, G. Fettweis
{"title":"为实现任意分集顺序的空间耦合码设计原型机","authors":"N. Hassan, I. Andriyanova, M. Lentmaier, G. Fettweis","doi":"10.1109/ITWF.2015.7360752","DOIUrl":null,"url":null,"abstract":"This work focuses on the design of SC-LDPC codes for transmission over non-ergodic, block-fading channels. Our main contribution is an algorithm, allowing to start from a (J,K)-regular, uncoupled LDPC ensemble, from which one can recursively build up a protograph-based SC-LDPC ensemble having any target diversity order d. The diversity order is achieved assuming a low-complexity iterative decoding algorithm. The increase of d comes at the cost of increasing the memory constraint (i.e., the coupling parameter) of the SC-LDPC ensemble.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Protograph design for spatially-coupled codes to attain an arbitrary diversity order\",\"authors\":\"N. Hassan, I. Andriyanova, M. Lentmaier, G. Fettweis\",\"doi\":\"10.1109/ITWF.2015.7360752\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work focuses on the design of SC-LDPC codes for transmission over non-ergodic, block-fading channels. Our main contribution is an algorithm, allowing to start from a (J,K)-regular, uncoupled LDPC ensemble, from which one can recursively build up a protograph-based SC-LDPC ensemble having any target diversity order d. The diversity order is achieved assuming a low-complexity iterative decoding algorithm. The increase of d comes at the cost of increasing the memory constraint (i.e., the coupling parameter) of the SC-LDPC ensemble.\",\"PeriodicalId\":281890,\"journal\":{\"name\":\"2015 IEEE Information Theory Workshop - Fall (ITW)\",\"volume\":\"136 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-12-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE Information Theory Workshop - Fall (ITW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITWF.2015.7360752\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Information Theory Workshop - Fall (ITW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITWF.2015.7360752","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

本工作的重点是设计SC-LDPC码,用于在非遍历、块衰落信道上传输。我们的主要贡献是一种算法,允许从(J,K)规则,解耦合的LDPC集成开始,从中可以递归地构建具有任意目标分集阶数d的基于原型的SC-LDPC集成。分集阶数是在假设低复杂度迭代解码算法的情况下实现的。d的增加是以增加SC-LDPC集成的内存约束(即耦合参数)为代价的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Protograph design for spatially-coupled codes to attain an arbitrary diversity order
This work focuses on the design of SC-LDPC codes for transmission over non-ergodic, block-fading channels. Our main contribution is an algorithm, allowing to start from a (J,K)-regular, uncoupled LDPC ensemble, from which one can recursively build up a protograph-based SC-LDPC ensemble having any target diversity order d. The diversity order is achieved assuming a low-complexity iterative decoding algorithm. The increase of d comes at the cost of increasing the memory constraint (i.e., the coupling parameter) of the SC-LDPC ensemble.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信