Low Complexity MPA Detector Based on Sphere Decoding for SCMA

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 sig...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE communications letters Ročník 21; číslo 8; s. 1855 - 1858
Hlavní autori: Yang, Lin, Ma, Xinying, Siu, Yunming
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.08.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
AWGN
Codes
Complexity
Computational complexity
Computer simulation
Decoding
Detectors
Error detection
Iterative decoding
Message passing
message passing algorithm (MPA)
Multiple access
Simulation
Sparse code multiple access (SCMA)
sphere decoding
superposed constellation points (SCPs)
ISSN:1089-7798, 1558-2558
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2017.2697425