中继信道的一级LDPC点阵码

Hassan Khodaiemehr, D. Kiani, Mohammad-Reza Sadeghi
{"title":"中继信道的一级LDPC点阵码","authors":"Hassan Khodaiemehr, D. Kiani, Mohammad-Reza Sadeghi","doi":"10.1109/IWCIT.2015.7140213","DOIUrl":null,"url":null,"abstract":"LDPC lattices were first family of lattices which have efficient decoding algorithm in high dimensions. An LDPC lattice can be constructed from Construction D' and a number of nested LDPC codes. When we consider one code as underlying code of these lattices, one-level LDPC lattices will be obtained. In this paper we propose a new encoding and decoding method for one-level LDPC lattices. We also establish an efficient shaping method for these lattices based on hypercube shaping. Then, based on this encoding and decoding, we propose the implementation of block Markov encoding for one-way relay networks, using obtained one-level LDPC lattice codes. Our proposed decoding algorithm has lower complexity than those given for LDLC lattices.","PeriodicalId":166939,"journal":{"name":"2015 Iran Workshop on Communication and Information Theory (IWCIT)","volume":"74 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"One-level LDPC lattice codes for the relay channels\",\"authors\":\"Hassan Khodaiemehr, D. Kiani, Mohammad-Reza Sadeghi\",\"doi\":\"10.1109/IWCIT.2015.7140213\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"LDPC lattices were first family of lattices which have efficient decoding algorithm in high dimensions. An LDPC lattice can be constructed from Construction D' and a number of nested LDPC codes. When we consider one code as underlying code of these lattices, one-level LDPC lattices will be obtained. In this paper we propose a new encoding and decoding method for one-level LDPC lattices. We also establish an efficient shaping method for these lattices based on hypercube shaping. Then, based on this encoding and decoding, we propose the implementation of block Markov encoding for one-way relay networks, using obtained one-level LDPC lattice codes. Our proposed decoding algorithm has lower complexity than those given for LDLC lattices.\",\"PeriodicalId\":166939,\"journal\":{\"name\":\"2015 Iran Workshop on Communication and Information Theory (IWCIT)\",\"volume\":\"74 2\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-05-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 Iran Workshop on Communication and Information Theory (IWCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWCIT.2015.7140213\",\"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 Iran Workshop on Communication and Information Theory (IWCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWCIT.2015.7140213","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

LDPC格是第一类具有高维高效解码算法的格族。一个LDPC格可以由构造D'和一些嵌套的LDPC码构造而成。当我们考虑一个码作为这些格的底层码时,将得到一层LDPC格。本文提出了一种新的单层LDPC格的编解码方法。我们还建立了一种基于超立方体整形的有效整形方法。然后,在此基础上,我们提出了用得到的一层LDPC格码实现单向中继网络的块马尔可夫编码。我们提出的解码算法比LDLC格的解码算法具有更低的复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
One-level LDPC lattice codes for the relay channels
LDPC lattices were first family of lattices which have efficient decoding algorithm in high dimensions. An LDPC lattice can be constructed from Construction D' and a number of nested LDPC codes. When we consider one code as underlying code of these lattices, one-level LDPC lattices will be obtained. In this paper we propose a new encoding and decoding method for one-level LDPC lattices. We also establish an efficient shaping method for these lattices based on hypercube shaping. Then, based on this encoding and decoding, we propose the implementation of block Markov encoding for one-way relay networks, using obtained one-level LDPC lattice codes. Our proposed decoding algorithm has lower complexity than those given for LDLC lattices.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A novel approach to mathematical multiple criteria decision making methods based on information theoretic measures An iterative bit flipping based decoding algorithm for LDPC codes Statistical characterization of the output of nonlinear power-cubic detection unit for ultrashort light pulse communication in the presence of Gaussian noise Perfect interference alignment utilizing channel structure One-level LDPC lattice codes for the relay channels
×
引用
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