SCMA with Low Complexity Symmetric Codebook Design for Visible Light Communication

Sparse code multiple access (SCMA) is attracting significant research interests currently, which is considered as a promising multiple access technique for 5G systems. It serves as a good candidate for the future communication network with massive nodes due to its capability of handling user overloading. Introducing SCMA to visible light communication (VLC) can provide another opportunity on design of transmission protocols for the communication network with massive nodes due to the limited communication range of VLC, which reduces the interference intensity. However, when applying SCMA in VLC systems, we need to modify the SCMA codebook to accommodate the real and positive signal requirement for VLC.We apply multidimensional constellation design methods to SCMA codebook. To reduce the design complexity, we also propose a symmetric codebook design. For all the proposed design approaches, the minimum Euclidean distance aims to be maximized. Our symmetric codebook design can reduce design and detection complexity simultaneously. Simulation results show that our design implies fast convergence with respect to the number of iterations, and outperforms the design that simply modifies the existing approaches to VLC signal requirements

Sub-graph based joint sparse graph for sparse code multiple access systems

Sparse code multiple access (SCMA) is a promising air interface candidate technique for next generation mobile networks, especially for massive machine type communications (mMTC). In this paper, we design a LDPC coded SCMA detector by combining the sparse graphs of LDPC and SCMA into one joint sparse graph (JSG). In our proposed scheme, SCMA sparse graph (SSG) defined by small size indicator matrix is utilized to construct the JSG, which is termed as sub-graph based joint sparse graph of SCMA (SG-JSG-SCMA). In this paper, we first study the binary-LDPC (B-LDPC) coded SGJSG- SCMA system. To combine the SCMA variable node (SVN) and LDPC variable node (LVN) into one joint variable node (JVN), a non-binary LDPC (NB-LDPC) coded SG-JSG-SCMA is also proposed. Furthermore, to reduce the complexity of NBLDPC coded SG-JSG-SCMA, a joint trellis representation (JTR) is introduced to represent the search space of NB-LDPC coded SG-JSG-SCMA. Based on JTR, a low complexity joint trellis based detection and decoding (JTDD) algorithm is proposed to reduce the computational complexity of NB-LDPC coded SGJSG- SCMA system. According to the simulation results, SG-JSGSCMA brings significant performance improvement compare to the conventional receiver using the disjoint approach, and it can also outperform a Turbo-structured receiver with comparable complexity. Moreover, the joint approach also has advantages in terms of processing latency compare to the Turbo approaches