Performance Analysis of Uplink Uncoordinated Code-Domain NOMA for SINs

Ming Gan, J. Jiao, Lianqin Li, Shaohua Wu, Qinyu Zhang
{"title":"Performance Analysis of Uplink Uncoordinated Code-Domain NOMA for SINs","authors":"Ming Gan, J. Jiao, Lianqin Li, Shaohua Wu, Qinyu Zhang","doi":"10.1109/WCSP.2018.8555942","DOIUrl":null,"url":null,"abstract":"Space information networks (SINs) are regarded as an effective solution to enable a broadband access capability in a global coverage and cost-effective manner for massive machine type communications (mMTC). A collision often occurs when two or more user equipments (UEs) select the same pilot in mMTCs, and the received colliding signals are treated as interference. In this paper, we first analyze the problem of pilot collision for uplink mMTCs in SIN, then we investigate the performance of an uncoordinated code domain non-orthogonal multiple access (NOMA) protocol. Moreover, to recover the information in collisions, we adopt successive interference cancellation (SIC) and successive joint decoding (SJD) under a shadowed-Rician fading and path loss satellite-ground channel model, and derive the expressions of the outage probability and maximum system throughput for SIC and SJD, respectively. Numerical and simulation results validate our analytical results and show that the maximum system throughput of SJD is almost double that of SIC.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP.2018.8555942","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Space information networks (SINs) are regarded as an effective solution to enable a broadband access capability in a global coverage and cost-effective manner for massive machine type communications (mMTC). A collision often occurs when two or more user equipments (UEs) select the same pilot in mMTCs, and the received colliding signals are treated as interference. In this paper, we first analyze the problem of pilot collision for uplink mMTCs in SIN, then we investigate the performance of an uncoordinated code domain non-orthogonal multiple access (NOMA) protocol. Moreover, to recover the information in collisions, we adopt successive interference cancellation (SIC) and successive joint decoding (SJD) under a shadowed-Rician fading and path loss satellite-ground channel model, and derive the expressions of the outage probability and maximum system throughput for SIC and SJD, respectively. Numerical and simulation results validate our analytical results and show that the maximum system throughput of SJD is almost double that of SIC.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
SINs上行非协调码域NOMA性能分析
空间信息网络(SINs)被认为是实现大规模机器类型通信(mMTC)的全球覆盖和成本效益方式的宽带接入能力的有效解决方案。当mmtc中两个或多个用户设备选择同一个导频时,通常会发生碰撞,接收到的碰撞信号被视为干扰。本文首先分析了sins中上行mmtc的导频碰撞问题,然后研究了一种非协调码域非正交多址(NOMA)协议的性能。此外,为了恢复碰撞中的信息,我们采用了一种阴影衰落和路径损失星地信道模型下的连续干扰抵消(SIC)和连续联合解码(SJD),并分别推导了SIC和SJD的中断概率和最大系统吞吐量表达式。数值和仿真结果验证了我们的分析结果,表明SJD的最大系统吞吐量几乎是SIC的两倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Energy Depositing for Energy Harvesting Wireless Communications Experimental Demonstration of Acoustic Inversion Using an AUV Carrying Source Channel Tracking for Uniform Rectangular Arrays in mmWave Massive MIMO Systems Rate Matching and Piecewise Sequence Adaptation for Polar Codes with Reed-Solomon Kernels Utility Maximization for MISO Bursty Interference 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