On Near-Optimal Codebook and Receiver Designs for MIMO-SCMA Schemes
Yen‐Ming Chen, Yu-Chen Hsu, Meng-Chen Wu, Rupender Singh, Yuan-Chu Chang
Abstract
Sparse code multiple access (SCMA) is a promising code-domain non-orthogonal multiple access (NOMA) technique that supports high-level connectivity. Through the combination of SCMA and multiple-input multiple-output (MIMO) techniques, MIMO-SCMA schemes are capable of enhancing the overall spectral efficiency. This paper proposes novel MIMO-SCMA designs for both uplink and downlink Rayleigh fading channels. Rather than directly combining the SCMA and spatial multiplexing techniques presented in the previous literature, the proposed designs consider not only the frequency or time diversity, but also simultaneously include space diversity. Codebook design criteria for different transmission scenarios are respectively investigated, and a low-complexity codebook design algorithm is proposed based on the cross-entropy method. In addition, since the new designs suggest a dense factor graph, conventional message-passing algorithm (MPA)-based detectors are less suitable. Consequently, low-complexity MIMO-SCMA codeword detectors based on depth-first and breadth-first tree-search algorithms are respectively investigated. It is shown that the overall designs are able to simultaneously achieve a higher diversity order, enhanced BER results, and lower levels of detection complexity for both uplink and downlink scenarios, when compared to conventional MIMO-SCMA schemes.