A Joint Update Parallel MCMC-Method-Based Sparse Code Multiple Access Decoder

被引:12
作者
Chen, Jienan [1 ]
Zhang, Zhenbin [1 ]
Fu, Shengli [2 ]
Hu, Jianhao [1 ]
机构
[1] Univ Elect Sci & Technol China, Natl Key Lab Sci & Technol Commun, Chengdu 611731, Sichuan, Peoples R China
[2] Univ North Texas, Dept Elect Engn, Denton, TX 76201 USA
基金
中国国家自然科学基金;
关键词
Monte Carlo Markov Chain (MCMC); nonorthogonal multiple access; resource-constrained networks; sparse code multiple access (SCMA);
D O I
10.1109/TVT.2017.2754552
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
With the requirement for growth of massive connections in the fifth-generation (5G) system, there is an increasing challenge for traditional multiple access techniques to meet the needs of the exponentially increased number of terminals for the resource constrained networks. The sparse code multiple access (SCMA) technology has been proposed for the 5G communication systems to supply stronger connectivity with limited resources. However, a low-complexity decoding algorithm is required by the SCMA decoder for the high computation complexity of decoding nonorthogonal signals. In this paper, we propose a high-performance and low-cost decoding algorithm based on a Bayesian program learning method, Monte Carlo Markov Chain (MCMC). We also propose a new MCMC sampling method to generate samples from a joint update parallel (JUP) MCMC sampler. The simulation results show that the JUP-based MCMC SCMA decoder can save 60% computation complexity compared to the existing decoding method with a codebook size 16, which only has 0.5-dB performance loss compared to the maximum-likelihood-like decoding algorithm.
引用
收藏
页码:1280 / 1291
页数:12
相关论文
共 30 条
[1]  
[Anonymous], 2015, P IEEE INT C WIR COM
[2]  
[Anonymous], 2015, P 2015 INT C WIR COM
[3]  
[Anonymous], 2015, IEEE GLOBE WORK
[4]  
[Anonymous], 2015, P 10 ANN CYBER INFOR
[5]  
[Anonymous], 2015, P 2015 IEEE CIC INT
[6]  
[Anonymous], THESIS
[7]  
[Anonymous], 2015, 2015 INT C WIR COMM, DOI DOI 10.1109/WCSP.2015.7341328
[8]  
Au K, 2014, IEEE GLOBE WORK, P900, DOI 10.1109/GLOCOMW.2014.7063547
[9]  
Benjebbour A, 2013, I S INTELL SIG PROC, P770, DOI 10.1109/ISPACS.2013.6704653
[10]  
Bujari Armir, 2014, 2014 IEEE 11th Consumer Communications and Networking Conference (CCNC), P502, DOI 10.1109/CCNC.2014.6940514