Low Complexity MIMO-SCMA Detector

Abstract

The implementation of Multiple Input Multiple Output (MIMO) on the Sparse Code Multiple Access (SCMA) can enhance performance in 5G future communication. Low complexity detector for the MIMO-SCMA system to achieve near-optimum bit error rate (BER) performance is still hot topic in this research field. This paper is investigate low complexity MIMO-SCMA detector by combining a joint factor graph (JFG) and sphere decoding (SD) algorithm based on message passing algorithm (MPA) called by SD-JFG-MPA. SD-JFG-MPA is combine n-th single factor graph become one virtual factor graph to deal with MIMO detector. SD algorithm is used to reduce high complexity of the JFG-MPA by calculating possible combination codeword within search radius R SD . SD-JFG-MPA is investigated under Rayleigh channel model with overloading factor 150%. The simulation result shows that complexity and BER performance is determined by a selected radius of SD-JFG-MPA. Optimum performance with less processing time for one bit error on single SCMA when $R_{SD} = \sqrt {E_b} \times 3/2 \times r_{max}$ meanwhile for 2x2 MIMO-SCMA when $R_{SD} = \sqrt {E_b} \times N_{mimo} \times r_{max}$. 2×2 MIMO-SCMA performance is better with 5 dB gap at BER = 10−3 compared to single SCMA.