D-IRA Codes Over Integer Rings for Lattice-Based Multiple Access

IF 3.7 3区 计算机科学 Q2 TELECOMMUNICATIONS
Tianbo Zhang;Fangtao Yu;Tao Yang;Rongke Liu
{"title":"D-IRA Codes Over Integer Rings for Lattice-Based Multiple Access","authors":"Tianbo Zhang;Fangtao Yu;Tao Yang;Rongke Liu","doi":"10.1109/LCOMM.2024.3484580","DOIUrl":null,"url":null,"abstract":"We study capacity-approaching irregular repeat accumulate (IRA) codes over integer rings \n<inline-formula> <tex-math>$\\mathbb {Z}_{2^{m}}$ </tex-math></inline-formula>\n for \n<inline-formula> <tex-math>$2^{m}$ </tex-math></inline-formula>\n-PAM signaling, \n<inline-formula> <tex-math>$m=1,2,\\cdots $ </tex-math></inline-formula>\n. Such codes belong to the ensemble of lattice codes. First, the effect of zero-divisors on the iterative belief-propagation (BP) decoding is analyzed. We show that the symmetric Gaussian approximation is invalid for existing IRA codes over integer rings. Then we propose a new doubly IRA (D-IRA) ring code structure, which consists of irregular multiplier distribution and irregular node-degree distribution. Such structure can restore the symmetry and optimize the BP decoding threshold. Numerical result demonstrates the improved performance of D-IRA codes for AWGN channel. Also, it is demonstrated that the lattice based multiple-access scheme with D-IRA code performs within 3 dB the capacity limit.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 12","pages":"2719-2723"},"PeriodicalIF":3.7000,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Communications Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10729264/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

We study capacity-approaching irregular repeat accumulate (IRA) codes over integer rings $\mathbb {Z}_{2^{m}}$ for $2^{m}$ -PAM signaling, $m=1,2,\cdots $ . Such codes belong to the ensemble of lattice codes. First, the effect of zero-divisors on the iterative belief-propagation (BP) decoding is analyzed. We show that the symmetric Gaussian approximation is invalid for existing IRA codes over integer rings. Then we propose a new doubly IRA (D-IRA) ring code structure, which consists of irregular multiplier distribution and irregular node-degree distribution. Such structure can restore the symmetry and optimize the BP decoding threshold. Numerical result demonstrates the improved performance of D-IRA codes for AWGN channel. Also, it is demonstrated that the lattice based multiple-access scheme with D-IRA code performs within 3 dB the capacity limit.
基于格子多址的整数环上的D-IRA码
我们研究了整数环$\mathbb {Z}_{2^{m}}$上的容量逼近不规则重复累积(IRA)码,用于$2^{m}$ -PAM信令,$m=1,2,\cdots $。这种码属于点阵码的集合。首先,分析了零因子对迭代信念传播(BP)译码的影响。我们证明了对称高斯近似对于整数环上现有的IRA代码是无效的。在此基础上,提出了一种由不规则乘数分布和不规则节点度分布组成的双IRA (D-IRA)环码结构。这种结构可以恢复对称性,优化BP解码阈值。数值结果表明,在AWGN信道中,D-IRA码的性能得到了改善。此外,还证明了基于点阵的D-IRA码多址方案在3db容量限制内的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Communications Letters
IEEE Communications Letters 工程技术-电信学
CiteScore
8.10
自引率
7.30%
发文量
590
审稿时长
2.8 months
期刊介绍: The IEEE Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of communication over different media and channels including wire, underground, waveguide, optical fiber, and storage channels. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of communication systems.
×
引用
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学术官方微信