A Low-Complexity and Fast Convergence Message Passing Receiver Based on Partial Codeword Transmission for SCMA Systems

2018 ◽  
Vol E101.B (11) ◽  
pp. 2259-2266 ◽  
Author(s):  
Xuewan ZHANG ◽  
Wenping GE ◽  
Xiong WU ◽  
Wenli DAI
2017 ◽  
Vol 53 (6) ◽  
pp. 403-405
Author(s):  
Wei Wang ◽  
Zhongyong Wang ◽  
Qinghua Guo ◽  
Chuanzong Zhang ◽  
Peng Sun

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Wenping Ge ◽  
Haofeng Zhang ◽  
Shiqing Qian ◽  
Lili Ma ◽  
Gecheng Zhang

Sparse code multiple access (SCMA) has been proposed to obtain high capacity and support massive connections. When combined with the multiple-input multiple-output (MIMO) techniques, the spectrum efficiency of the SCMA system can be further improved. However, the detectors of the MIMO-SCMA system have high computational complexity. For the maximum likelihood (ML) detection, though it is optimal decoding algorithm for the MIMO-SCMA system, the detection complexity would grow exponentially with the number of both the antennas and users increase. In this paper, we consider a space-time block code (STBC) based MIMO-SCMA system where SCMA is used for multiuser access. Besides, we propose a low-complexity utilizing joint message passing algorithm (JMPA) detection, which narrowing the range of superimposed constellation points, called joint message passing algorithm based on sphere decoding (S-JMPA). But for the S-JMPA detector, the augment of the amount of access users and antennas leads to the degradation of decoding performance, the STBC is constructed to compensate the performance loss of the S-JMPA detector and ensure good bit error rate (BER) performance. The simulation results show that the proposed method achieves a close error rate performance to ML, JMPA, and a fast convergence rate. Moreover, compared to the ML detector, it also significantly reduces the detection complexity of the algorithms.


Sign in / Sign up

Export Citation Format

Share Document