English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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.

A Low-Complexity Detector for Uplink SCMA by Exploiting Dynamical Superior User Removal Algorithm