Low Complexity Resource Allocation in Frequency Domain Non-Orthogonal Multiple Access

IF 0.7 4区 计算机科学 Q4 ENGINEERING, ELECTRICAL & ELECTRONIC IEICE Transactions on Communications Pub Date : 2023-01-01 DOI:10.1587/transcom.2023ebp3009
S. Denno, Taichi Yamagami, Yafei Hou
{"title":"Low Complexity Resource Allocation in Frequency Domain Non-Orthogonal Multiple Access","authors":"S. Denno, Taichi Yamagami, Yafei Hou","doi":"10.1587/transcom.2023ebp3009","DOIUrl":null,"url":null,"abstract":"SUMMARY This paper proposes low complexity resource allocation in frequency domain non-orthogonal multiple access where many devices access with a base station. The number of the devices is assumed to be more than that of the resource for network capacity enhancement, which is demanded in massive machine type communications (mMTC). This paper proposes two types of resource allocation techniques, all of which are based on the MIN-MAX approach. One of them seeks for nicer resource allocation with only channel gains. The other technique applies the message passing algorithm (MPA) for better resource allocation. The proposed resource allocation techniques are evaluated by computer simulation in frequency domain non-orthogonal multiple access. The proposed technique with the MPA achieves the best bit error rate (BER) performance in the proposed techniques. However, the computational complexity of the proposed techniques with channel gains is much smaller than that of the proposed technique with the MPA, whereas the BER performance of the proposed techniques with channel gains is only about 0 . 1dB inferior to that with the MPA in the multiple access with the overloading ratio of 1 . 5 at the BER of 10 − 4 . They attain the gain of about 10dB at the BER of 10 − 4 in the multiple access with the overloading ration of 2 . 0. Their complexity is 10 − 16 as small as the conventional technique.","PeriodicalId":50385,"journal":{"name":"IEICE Transactions on Communications","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEICE Transactions on Communications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1587/transcom.2023ebp3009","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

SUMMARY This paper proposes low complexity resource allocation in frequency domain non-orthogonal multiple access where many devices access with a base station. The number of the devices is assumed to be more than that of the resource for network capacity enhancement, which is demanded in massive machine type communications (mMTC). This paper proposes two types of resource allocation techniques, all of which are based on the MIN-MAX approach. One of them seeks for nicer resource allocation with only channel gains. The other technique applies the message passing algorithm (MPA) for better resource allocation. The proposed resource allocation techniques are evaluated by computer simulation in frequency domain non-orthogonal multiple access. The proposed technique with the MPA achieves the best bit error rate (BER) performance in the proposed techniques. However, the computational complexity of the proposed techniques with channel gains is much smaller than that of the proposed technique with the MPA, whereas the BER performance of the proposed techniques with channel gains is only about 0 . 1dB inferior to that with the MPA in the multiple access with the overloading ratio of 1 . 5 at the BER of 10 − 4 . They attain the gain of about 10dB at the BER of 10 − 4 in the multiple access with the overloading ration of 2 . 0. Their complexity is 10 − 16 as small as the conventional technique.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
频域非正交多址低复杂度资源分配
本文提出了多台设备接入同一个基站的频域非正交多址低复杂度资源分配方法。在大规模机器类型通信(mMTC)中,假设设备的数量大于网络容量增强所需的资源的数量。本文提出了两种基于MIN-MAX方法的资源分配技术。其中一种方法寻求更好的资源分配,只获得渠道收益。另一种技术应用消息传递算法(MPA)来更好地分配资源。通过频域非正交多址的计算机仿真,对所提出的资源分配技术进行了评价。在上述技术中,该技术具有最佳的误码率(BER)性能。然而,考虑信道增益的方法的计算复杂度远小于考虑MPA的方法,而考虑信道增益的方法的误码率性能仅为0左右。在过载比为1的多路接入中,比MPA低1dB。5在BER为10−4时。在多址中,当误码率为10−4时,它们的增益约为10dB,过载比为2。0. 它们的复杂性是传统技术的10 - 16。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEICE Transactions on Communications
IEICE Transactions on Communications 工程技术-电信学
CiteScore
1.40
自引率
28.60%
发文量
101
审稿时长
3.7 months
期刊介绍: The IEICE Transactions on Communications is an all-electronic journal published occasionally by the Institute of Electronics, Information and Communication Engineers (IEICE) and edited by the Communications Society in IEICE. The IEICE Transactions on Communications publishes original, peer-reviewed papers that embrace the entire field of communications, including: - Fundamental Theories for Communications - Energy in Electronics Communications - Transmission Systems and Transmission Equipment for Communications - Optical Fiber for Communications - Fiber-Optic Transmission for Communications - Network System - Network - Internet - Network Management/Operation - Antennas and Propagation - Electromagnetic Compatibility (EMC) - Wireless Communication Technologies - Terrestrial Wireless Communication/Broadcasting Technologies - Satellite Communications - Sensing - Navigation, Guidance and Control Systems - Space Utilization Systems for Communications - Multimedia Systems for Communication
期刊最新文献
IEICE Transactions on Communications: Editor's Message 1-D and 2-D Beam Steering Arrays Antennas Fed by a Compact Beamforming Network for Millimeter-Wave Communication Parameter Selection and Radar Fusion for Tracking in Roadside Units User Scheduling at Base Station Cluster Boundary for Massive MIMO Downlink Transmission Non-Orthogonal Multiple Access Based on Orthogonal Space-Time Block Codes for Mobile Communications
×
引用
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