.png){kind=icon}
Return
Sparse Code Multiple Access Decoding Based on a Monte Carlo Markov Chain Method
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2016.2544792.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Nonorthogonal multiple access technology has been proposed for use in 5G communications systems. In particular, the sparse code multiple access (SCMA) scheme is believed to be one of the most promising techniques among the various nonorthogonal approaches that have been investigated. In this letter, we focus on reducing the complexity of SCMA decoding and we propose a Monte Carlo Markov Chain (MCMC) based SCMA decoder. Benefiting from the linearly increasing complexity of the MCMC method, the proposed SCMA decoder has only 10% of the computational load compared to previous state-of-the-art methods when the codebook size is 64. Consequently, the MCMC SCMA decoder has great potential for use in practical system implementations.
Keywords:
Low computational complexity
Monte Carlo Markov Chain (MCMC)
nonorthogonal multiple access
sparse code multiple access (SCMA)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
View more