On iterative LDPC-based joint decoding scheme for binary input Gaussian multiple access channel

A. Frolov, P. Rybin, F. Ivanov
{"title":"On iterative LDPC-based joint decoding scheme for binary input Gaussian multiple access channel","authors":"A. Frolov, P. Rybin, F. Ivanov","doi":"10.1109/RED.2016.7779328","DOIUrl":null,"url":null,"abstract":"Non-orthogonal multiple access schemes are of great interest for next generation wireless systems, as such schemes allow to reduce the total number of resources (frequencies or time slots) in comparison to orthogonal transmission (TDMA, FDMA, CDMA). In this paper we consider an iterative LDPC-based joint decoding scheme suggested in [1]. We investigate the most difficult and important problem where all the users have the same power constraint and the same rate. For the case of 2 users we use a known scheme and analyze it by means of simulations. We found the optimal relation between the number of inner and outer iterations. We further extend the scheme for the case of any number of users and investigated the cases of 3 and 4 users by means of simulations. Finally, we showed, that considered non-orthogonal transmission scheme is more efficient (for 2 and 3 users), than orthogonal transmission.","PeriodicalId":237844,"journal":{"name":"2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 XV International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RED.2016.7779328","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Non-orthogonal multiple access schemes are of great interest for next generation wireless systems, as such schemes allow to reduce the total number of resources (frequencies or time slots) in comparison to orthogonal transmission (TDMA, FDMA, CDMA). In this paper we consider an iterative LDPC-based joint decoding scheme suggested in [1]. We investigate the most difficult and important problem where all the users have the same power constraint and the same rate. For the case of 2 users we use a known scheme and analyze it by means of simulations. We found the optimal relation between the number of inner and outer iterations. We further extend the scheme for the case of any number of users and investigated the cases of 3 and 4 users by means of simulations. Finally, we showed, that considered non-orthogonal transmission scheme is more efficient (for 2 and 3 users), than orthogonal transmission.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于迭代ldpc的二进制输入高斯多址信道联合译码方案
非正交多址方案对下一代无线系统非常有兴趣,因为与正交传输(TDMA、FDMA、CDMA)相比,这种方案允许减少资源(频率或时隙)的总数。本文考虑了[1]中提出的一种基于ldpc的迭代联合解码方案。我们研究了所有用户具有相同功率约束和相同速率的最困难和最重要的问题。对于2个用户的情况,我们使用了已知的方案,并通过仿真对其进行了分析。我们找到了内部迭代次数和外部迭代次数之间的最优关系。我们进一步将该方案推广到任意数量用户的情况,并通过模拟的方式研究了3个和4个用户的情况。最后,我们表明,考虑的非正交传输方案(对于2和3个用户)比正交传输更有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On iterative LDPC-based joint decoding scheme for binary input Gaussian multiple access channel Efficiency of transport layer coding in networks with changing capacities An upper bound on the error probability of a communication system with nonparametric detection About one structural attack on McEliece cryptosystem Lower bound and optimal scheduling for mean user rebuffering percentage of HTTP progressive download traffic in cellular networks
×
引用
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