Low complexity detection based on dynamic factor graph for SCMA systems

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

22 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)2666-2669
Journal / PublicationIEEE Communications Letters
Volume21
Issue number12
Online published20 Sep 2017
Publication statusPublished - Dec 2017

Abstract

Sparse code multiple access (SCMA) has been proposed to support massive connections, and becomes a promising non-orthogonal multiple access in future fifth generation wireless communication systems. In SCMA, message passing algorithm (MPA) is utilized to achieve nearly optimal multiuser detection, but the high complexity of MPA detector still makes it hard to implement in practice. To tackle this issue, we present a low complexity MPA detector based on the dynamic factor graph, named DFG-MPA, in which the branches with large belief values in the factor graph model do not participate in the message propagation in current and later iterations. Moreover, choosing the number of partial branches with large belief values for each iteration adaptively depends on practical application scenarios. Numerical results show that the proposed detection scheme provides a commendable tradeoff between bit-error-rate (BER) performance and computational complexity compared with some existing MPA schemes.

Research Area(s)

  • Dynamic factor graph, Low complexity, Message passing algorithm (MPA), Sparse code multiple access (SCMA)

Citation Format(s)

Low complexity detection based on dynamic factor graph for SCMA systems. / Ma, Xinying; Yang, Lin; Chen, Zhi; Siu, Yunming.

In: IEEE Communications Letters, Vol. 21, No. 12, 12.2017, p. 2666-2669.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review