Optimal Design of the Joint Network LDPC Codes for Half-Duplex Cooperative Multi-access Relay Channel

Jingyi Wang, S. Che, Y. Li, Junlong Wang
{"title":"Optimal Design of the Joint Network LDPC Codes for Half-Duplex Cooperative Multi-access Relay Channel","authors":"Jingyi Wang, S. Che, Y. Li, Junlong Wang","doi":"10.1109/INCoS.2013.116","DOIUrl":null,"url":null,"abstract":"Optimization of degree distribution of the joint network LDPC code for orthogonal multiple-access relay channel (MARC) is investigated in this paper. We first calculated the code capacity of the source-destination link of orthogonal MARC based on a Gaussian approximation, where two sources communicate with one destination in the presence of one relay. Then, a new generalized differential evolution algorithm is developed to iteratively improve the degree distribution of the joint network LDPC code. Simulation results show that, the gap between bit error rate (BER) performance of our designed codes and the decoding threshold is about 0.4dB, and that between the capacity limit and decoding threshold is less than 0.7dB at BER = 10-6.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INCoS.2013.116","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Optimization of degree distribution of the joint network LDPC code for orthogonal multiple-access relay channel (MARC) is investigated in this paper. We first calculated the code capacity of the source-destination link of orthogonal MARC based on a Gaussian approximation, where two sources communicate with one destination in the presence of one relay. Then, a new generalized differential evolution algorithm is developed to iteratively improve the degree distribution of the joint network LDPC code. Simulation results show that, the gap between bit error rate (BER) performance of our designed codes and the decoding threshold is about 0.4dB, and that between the capacity limit and decoding threshold is less than 0.7dB at BER = 10-6.
半双工协同多址中继信道联合网络LDPC码的优化设计
研究正交多址中继信道(MARC)联合网络LDPC码的度分布优化问题。我们首先基于高斯近似计算了正交MARC的源-目的链路的码容量,其中两个源在一个中继存在的情况下与一个目的通信。然后,提出了一种新的广义差分进化算法,迭代改进联合网络LDPC码的度分布。仿真结果表明,设计的码在误码率(BER)性能与译码阈值之间的差距约为0.4dB,在BER = 10-6时,容量限制与译码阈值之间的差距小于0.7dB。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信