Low Complexity Uplink Grant-Free NOMA Based on Boosted Approximate Message Passing

Takanori Hara, K. Ishibashi
{"title":"Low Complexity Uplink Grant-Free NOMA Based on Boosted Approximate Message Passing","authors":"Takanori Hara, K. Ishibashi","doi":"10.1109/IEEECONF44664.2019.9048976","DOIUrl":null,"url":null,"abstract":"We propose a new framework of uplink grant-free non-orthogonal multiple access (NOMA) composed of user activity detection, channel estimation, and data detection. Since the original problem becomes the multiple-measurement vector recovery (MMVR) problem and requires high complexity to solve, we employ an approach based on reduce-MMV-and-boost (ReMBo) together with approximate message passing (AMP) to reduce the complexity significantly. Computer simulations confirm that the proposed framework exhibits the symbol error rate (SER) close to the conventional one while even lower complexity.","PeriodicalId":6684,"journal":{"name":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","volume":"17 1","pages":"1877-1880"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 53rd Asilomar Conference on Signals, Systems, and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEECONF44664.2019.9048976","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

We propose a new framework of uplink grant-free non-orthogonal multiple access (NOMA) composed of user activity detection, channel estimation, and data detection. Since the original problem becomes the multiple-measurement vector recovery (MMVR) problem and requires high complexity to solve, we employ an approach based on reduce-MMV-and-boost (ReMBo) together with approximate message passing (AMP) to reduce the complexity significantly. Computer simulations confirm that the proposed framework exhibits the symbol error rate (SER) close to the conventional one while even lower complexity.
基于增强近似消息传递的低复杂度上行链路无授权NOMA
提出了一种由用户活动检测、信道估计和数据检测组成的无授权非正交多址(NOMA)框架。由于原问题变成了多测量向量恢复(MMVR)问题,且求解复杂度较高,我们采用了基于ReMBo和近似消息传递(AMP)的方法来显著降低复杂度。计算机仿真结果表明,该框架具有与传统框架相近的符号错误率,且复杂度更低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信