Sparse code multiple access (SCMA) is a new multiple access technique which supports massive connectivity. Compared with the current Long Term Evolution (LTE) system, it enables the overloading of active users on limited orthogonal resources and thus meets the requirement of the fifth generation (5G) wireless networks. However, the computation complexity of existing detection algorithms increases exponentially with df (the degree of the resource nodes). Although the codebooks are designed to have low density, the detection still takes considerable time. The parameter df must be designed to be very small, which largely limits the choice of codebooks. In this paper, a new detection algorithm is proposed by discretizing the probability distribution functions (PDFs) in the layer nodes (variable nodes). Given M as the size of one codebook, the detection complexity of each resource node (function node) is reduced from O(dfMdf) to O(df3ln(df)). Its detection accuracy can quickly approach that of the previous detection algorithms with the decrease of sampling interval in discretization.
@article{arxiv.1611.08853,
title = {A Low Complexity Detection Algorithm for SCMA},
author = {Chenchen Zhang and Yuan Luo and Yan Chen},
journal= {arXiv preprint arXiv:1611.08853},
year = {2016}
}