{'fraction_non_alphanumeric': 0.02818489289740699, 'fraction_numerical': 0.0, 'mean_word_length': 5.5777777777777775, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Low Complexity SCMA Detector Based on Avoiding Redundant Iterations

Sparse code multiple access (SCMA), a competitive air-interface technology with the message passing algorithm (MPA) employed at the receiver, has a broad application prospect. However, the computational complexity of MPA is still an extreme challenge for SCMA decoding. In this paper, a low complexity multiuser detection algorithm based on avoiding redundant iterations, namely Avoiding Redundant Iterations-MPA (ARI-MPA), is proposed for the uplink SCMA system. ARI-MPA can achieve low complexity by avoiding redundant iterations, in which the number of iterations required is determined by the convergence rate of codeword probability. Numerical results demonstrate that the proposed scheme can achieve an affordable trade-off between bit error ratio (BER) performance and decoding complexity for the SCMA system.