.png){kind=icon}
.png){kind=icon}
Return
Low Complexity MPA Detector Based on Sphere Decoding for SCMA
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2017.2697425.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Sparse code multiple access (SCMA) has been proposed to obtain high capacity and support massive connections. Due to the sparse feature of codewords, SCMA achieves low complexity multiuser detection by utilizing message passing algorithm (MPA). However, the complexity reduction of MPA is still a significant issue. In this letter, a novel MPA based on sphere decoding, called SD-MPA, is proposed, which narrows down the range of believable superposed constellation points. Furthermore, simulation results show that SD-MPA detector can reach low complexity detection and maintain negligible bit error ratio performance decline compared with conventional MPA.
Keywords:
Sparse code multiple access (SCMA)
message passing algorithm (MPA)
sphere decoding
superposed constellation points (SCPs)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W