Open AccessLow complexity detection based on selective message passing for SCMA systems
Author(s) -
Wu Hanguang,
Xiong Xiaoming,
Gao Huaien
Publication year - 2018
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2018.0125
Subject(s) - codebook , message passing , computational complexity theory , computer science , code (set theory) , multiuser detection , decoding methods , algorithm , reliability (semiconductor) , detection theory , bit error rate , computer engineering , parallel computing , computer network , telecommunications , code division multiple access , set (abstract data type) , detector , programming language , power (physics) , physics , quantum mechanics
The sparse code multiple access (SCMA) systems rely on multiuser detection schemes to achieve high spectral efficiency and massive connectivity. The existing multiuser detection schemes employ a message passing algorithm (MPA) to achieve the goal by utilising the sparse structure of the SCMA codebook. However, it remains a challenging task to obtain a good trade‐off between the BER performance and computational complexity due to the iterative nature and the associated search space in the MPA detection. In this Letter, a novel MPA detection scheme based on selective message passing is proposed. By dynamically eliminating the branches with high reliability from the message passing process, the proposed scheme significantly reduces the computational complexity with negligible BER performance compared with the conventional MPA detection. Simulation results show that the proposed scheme is able to achieve a good trade‐off between the BER performance and computational complexity, especially at moderate and high signal–to‐noise ratio conditions.