.png){kind=icon}
Return
Threshold-Based Edge Selection MPA for SCMA
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2020.2966333.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 for the newest generation of communication systems, considering overloaded non-orthogonal multiple access. To deal with the overload, SCMA exploits the sparsity feature with the aid of receivers based on the messsage-passing algorithm (MPA). In this paper, we review a low-complexity MPA receiver based on edge selection and gaussian approximation (ESGA). We improve this receiver by proposing a threshold-based criterion for the edge selection (TB-ESGA). With the threshold, the number of interfering neighbors considered in the calculation of each message of the MPA becomes a random variable. We derive the probability of selecting a given number of edges in our strategy and also an expression for the average complexity order, as a function of the threshold. We also show that the proposed threshold results in a better trade-off between complexity and error-rate performance.
Keywords:
SCMA
message-passing algorithm
Gaussian approximation
threshold selection
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.1
Papers:
1.8W
Citations:
6.6W
Organization
View more organizations
Cited Papers
.png){kind=icon}
On Capacity-Based Codebook Design and Advanced Decoding for Sparse Code Multiple Access Systems
PREAI
ShareSaveShareSaveShareSave View more