Optimal Degree Distribution for Two-User Regular LDPC Codes Over GMAC by Fixed-Point Analysis

IF 4.4 3区 计算机科学 Q2 TELECOMMUNICATIONS
Meilin He;Mingjue Zhu;Zhaoyang Zhang;Rui Guo;Haiquan Wang
{"title":"Optimal Degree Distribution for Two-User Regular LDPC Codes Over GMAC by Fixed-Point Analysis","authors":"Meilin He;Mingjue Zhu;Zhaoyang Zhang;Rui Guo;Haiquan Wang","doi":"10.1109/LCOMM.2025.3589504","DOIUrl":null,"url":null,"abstract":"An analytical expression of the check nodes (CNs) degree in a two-user regular Low-Density Parity-Check (LDPC) code is derived over a Gaussian multiple access channel, and a Fixed Point Analysis (FPA) method is developed to determine the optimal degree distribution that maximizes the achievable sum rate of the system. Specifically, firstly, an analytical expression of the CNs degree is derived as a function of mutual information outputs. Secondly, based on this, a reliable region is obtained by taking a complement of a unified unreliable region. Finally, the optimal degree distribution is determined over this reliable region to achieve the optimal sum rate. Numerical results indicate that the proposed method offers superior accuracy and much lower computational complexity compared to the extrinsic information transfer (EXIT) chart.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 9","pages":"2168-2172"},"PeriodicalIF":4.4000,"publicationDate":"2025-07-15","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/11080502/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

An analytical expression of the check nodes (CNs) degree in a two-user regular Low-Density Parity-Check (LDPC) code is derived over a Gaussian multiple access channel, and a Fixed Point Analysis (FPA) method is developed to determine the optimal degree distribution that maximizes the achievable sum rate of the system. Specifically, firstly, an analytical expression of the CNs degree is derived as a function of mutual information outputs. Secondly, based on this, a reliable region is obtained by taking a complement of a unified unreliable region. Finally, the optimal degree distribution is determined over this reliable region to achieve the optimal sum rate. Numerical results indicate that the proposed method offers superior accuracy and much lower computational complexity compared to the extrinsic information transfer (EXIT) chart.
用不动点分析GMAC上两用户正则LDPC码的最优度分布
推导了高斯多址信道下双用户规则低密度奇偶校验码的校验节点度的解析表达式,并提出了一种不动点分析(FPA)方法来确定使系统可达和率最大化的最优校验节点度分布。具体而言,首先,推导出CNs度作为互信息输出函数的解析表达式。其次,在此基础上,对统一的不可靠区域取补,得到可靠区域;最后,在该可靠区域上确定最优度分布,以达到最优和率。数值结果表明,与外部信息传递(EXIT)图相比,该方法具有更高的精度和更低的计算复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信