{"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.