Open AccessLow complexity receiver of sparse code multiple access based on dynamic trellis
Author(s) -
Peng Xiaohuan,
Pan Zhipeng,
Lai Ke,
Wen Lei,
Lei Jing
Publication year - 2020
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2019.0719
Subject(s) - codebook , computer science , algorithm , computational complexity theory , code (set theory) , bit error rate , trellis (graph) , spectral efficiency , channel (broadcasting) , decoding methods , theoretical computer science , telecommunications , set (abstract data type) , programming language
Sparse code multiple access (SCMA) is one of the non‐orthogonal multiple access schemes to meet the demands of massive connection and high spectral efficiency in the 5G communications. Since the sparsity of the codebook, the message passing algorithm (MPA) can be utilised for multi‐user detection. However, the high computational complexity of MPA hinders the practical application of SCMA. The extended Max‐Log MPA (EML‐MPA) and the channel‐adaptive extended Max‐Log MPA (CAD‐EML‐MPA) help to reduce the complexity of conventional Log‐MPA with trellis representation. On this basis, the authors propose a dynamic trellis based MPA (DT‐MPA) in this study. DT‐MPA selects symbols dynamically according to a specific threshold τ in each iteration of MPA. The impact of the threshold on the complexity and convergence behaviour is analysed. Simulation results show that the DT‐MPA with variable τ which is related to bit signal‐to‐noise can achieve better bit error rate performance and lower complexity than EML‐MPA and CAD‐EML‐MPA.