A low-complexity detector for uplink SCMA by exploiting dynamical superior user removal algorithm

Li, S., Feng, Y., Sun, Y. and Xia, Z. (2022) A low-complexity detector for uplink SCMA by exploiting dynamical superior user removal algorithm. Electronics, 11(7), e1020. (doi: 10.3390/electronics11071020)

[img] Text
268055.pdf - Published Version
Available under License Creative Commons Attribution.



Sparse Code Multiple Access (SCMA) is capable of ameliorating the performance of wireless communication systems for massive connectivity. The sparsity of the codeword allows SCMA to employ the message-passing algorithm (MPA) at the receiver to address the connection overload. The detection complexity of traditional MPA, on the other hand, is exponentially exploding with the increasing number of connected devices. In this paper, a low-complexity MPA scheme is developed with the threshold and dynamical user removal algorithm (TB-RMPA) based on shuffled MPA (SMPA). By introducing the concept of Iterative Elimination of Dominated Strategies (IEDS) in game theory, a novel method of assigning different dominance levels to users is proposed hereby, and a threshold criterion is discussed to judge the reliability of user decoding. Inspired by this, users with reliable decoding in the iterative process will be dynamically eliminated in each iteration. The numerical analysis revealed that the new TB-RMPA detector’s implementation complexity decreases significantly compared with SMPA, while the symbol error ratio performance degrades unnoticeably.

Item Type:Articles
Keywords:SCMA, SMPA, threshold selection, superior users removal.
Glasgow Author(s) Enlighten ID:Sun, Dr Yao
Authors: Li, S., Feng, Y., Sun, Y., and Xia, Z.
College/School:College of Science and Engineering > School of Engineering > Autonomous Systems and Connectivity
Journal Name:Electronics
ISSN (Online):2079-9292
Copyright Holders:Copyright © 2022 The Authors
First Published:First published in Electronics 11(7):e1020
Publisher Policy:Reproduced under a Creative Commons licence

University Staff: Request a correction | Enlighten Editors: Update this record