A Partial Gaussian Tree Approximation (PGTA) Detector for Random Multiple Access Oriented SCMA Uplink With Codebook Collisions
- 8 December 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 20 (4) , 2295-2308
Abstract
By means of random multiple access (RMA), there is a prevailing tendency for massive machine-type terminals to have access into networks without numerous signaling interactions and frequent resource scheduling. Being one of the promising techniques to fulfill this requirement, sparse code multiple access (SCMA) is anticipated to notably broaden connections for the communication system. However, when applying RMA in the SCMA uplink, as massive terminals would randomly transmit their packets in an uncoordinated way, it is quite possible for some terminals to share an identical codebook so as to introduce the codebook collision problem. In this case, an indefinite number of terminals with possible codebook collisions would competitively share a same block of channel resources, resulting in an overloading status and deteriorated performance. To deal with this problem, we illustrate first the potential utilization of codebook collisions for RMA and propose then a partial Gaussian tree approximation (PGTA) detector to relieve heavy computational burden due to overloading conditions. With approximate decomposition of likelihood functions that has rarely been discussed, the proposed PGTA detector with proper message passing rules is able to approach the performance of a traditional message passing detector with considerably lower complexity.Keywords
Funding Information
- National Natural Science Foundation of China (61801352)
- China Postdoctoral Science Foundation (2016M590924)
- Fundamental Research Funds for Central Universities
This publication has 18 references indexed in Scilit:
- Low Complexity Decoding Method for SCMA in Uplink Random Access2016
- Low Complexity Iterative Receiver Design for Sparse Code Multiple AccessIEEE Transactions on Communications, 2016
- Approximate Message Passing-Based Joint User Activity and Data Detection for NOMAIEEE Communications Letters, 2016
- An Improved Uplink Sparse Coded Multiple AccessIEEE Communications Letters, 2016
- Dynamic Compressive Sensing-Based Multi-User Detection for Uplink Grant-Free NOMAIEEE Communications Letters, 2016
- Low Complexity Techniques for SCMA Detection2015
- Prototype for 5G new air interface technology SCMA and performance evaluationChina Communications, 2015
- Sparse code multiple access: An energy efficient uplink approach for 5G wireless systems2014
- Random access for machine-to-machine communication in LTE-advanced networks: issues and approachesIEEE Communications Magazine, 2013
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001