.png){kind=icon}
返回
Threshold-Based Edge Selection MPA for SCMA
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2020.2966333.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
SCMA
message-passing algorithm
Gaussian approximation
threshold selection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.1
论文数:
1.8W
被引数:
6.6W
机构
引用论文
.png){kind=icon}
On Capacity-Based Codebook Design and Advanced Decoding for Sparse Code Multiple Access Systems
PREAI
分享收藏分享收藏
查看更多内容