Abstract

Sparse code multiple access (SCMA) is a competitive nonorthogonal access scheme for the next mobile communication. As a multiuser sharing system, SCMA adopts message passing algorithm (MPA) for decoding scheme in receiver, but its iterative method leads to high computational complexity. Therefore, a serial message passing algorithm based on variable node (VMPA) is proposed in this paper. Making some subtle alterations to message update in original MPA, VMPA can greatly reduce overall computing complexity of decoding scheme. Furthermore, considering that serial structure may increase decoding delay, a novel grouping scheme based sparse matrix is applied to VMPA. Simulation results verify that the new algorithm, termed as grouping VMPA (G-VMPA), can achieve a better tradeoff between bit error rate (BER) and computing complexity than MPA.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call