{'fraction_non_alphanumeric': 0.029099048684946838, 'fraction_numerical': 0.0, 'mean_word_length': 5.622222222222222, '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}}
Iterative Receivers for Downlink MIMO-SCMA: Message Passing and Distributed Cooperative Detection

The rapid development of mobile communications requires even higher spectral efficiency. Non-orthogonal multiple access (NOMA) has emerged as a promising technology to further increase the access efficiency of wireless networks. Among several NOMA schemes, it has been shown that sparse code multiple access (SCMA) is able to achieve better performance. In this paper, we consider a downlink MIMO-SCMA system over frequency selective fading channels. For optimal detection, the complexity increases exponentially with the product of the number of users, the number of antennas and the channel length. To tackle this challenge, we propose near optimal low-complexity iterative receivers based on factor graph. By introducing auxiliary variables, a stretched factor graph is constructed and a hybrid belief propagation (BP) and expectation propagation (EP) receiver, named stretch-BP-EP, is proposed. Considering the convergence problem of BP algorithm on loopy factor graph, we convexify the Bethe free energy and propose a convergence-guaranteed BP-EP receiver, named conv-BP-EP. We further consider cooperative network and propose two distributed cooperative detection schemes to exploit the diversity gain, namely, belief consensus-based algorithm and the Bregman alternative direction method of multipliers (ADMM)-based method. Simulation results verify the superior performance of the proposed conv-BP-EP receiver compared with other methods. The two proposed distributed cooperative detection schemes can improve the bit error rate performance by exploiting the diversity gain. Moreover, Bregman ADMM method outperforms the belief consensus-based algorithm in noisy inter-user links.