eduzhai > Applied Sciences > Engineering >

On the Complexity Reduction of Uplink Sparse Code Multiple Access for Spatial Modulation

  • king
  • (0) Download
  • 20210506
  • Save

... pages left unread,continue reading

Document pages: 13 pages

Abstract: Multi-user spatial modulation (SM) assisted by sparse code multiple access(SCMA) has been recently proposed to provide uplink high spectral efficiencytransmission. The message passing algorithm (MPA) is employed to detect thetransmitted signals, which suffers from high complexity. This paper proposesthree low-complexity algorithms for the first time to the SM-SCMA. The firstalgorithm is referred to as successive user detection (SUD), while the secondalgorithm is the modified version of SUD, namely modified SUD (MSUD). Then, forthe first time, the tree-search of the SM-SCMA is constructed. Based on thattree-search, another variant of the sphere decoder (SD) is proposed for theSM-SCMA, referred to as fixed-complexity SD (FCSD). SUD provides a benchmarkfor decoding complexity at the expense of bit-error-rate (BER) performance.Further, MSUD slightly increases the complexity of SUD with a significantimprovement in BER performance. Finally, FCSD provides a near-optimum BER witha considerable reduction of the complexity compared to the MPA decoder and alsosupports parallel hardware implementation. The proposed algorithms provideflexible design choices for practical implementation based on system designdemands. The complexity analysis and Monte-Carlo simulations of the BER areprovided for the proposed algorithms.

Please select stars to rate!

         

0 comments Sign in to leave a comment.

    Data loading, please wait...
×