Low-complexity hybrid interference cancellation for sparse code multiple access

被引:2
|
作者
Ghani, Bilal [1 ]
Launay, Frederic [1 ]
Pousset, Yannis [2 ]
Perrine, Clency [2 ]
Cances, Jean Pierre [3 ]
机构
[1] Univ Poitiers, LIAS EA 6315, Poitiers, France
[2] Univ Poitiers, XLIM UMR CNRS 7252, Poitiers, France
[3] Univ Limoges, XLIM UMR CNRS 7252, Limoges, France
关键词
SCMA; NOMA; 5G; MPA; IC; HIC-MPA; SIC; MUD; Soft and hard interference cancellation; PARITY-CHECK CODES; DESIGN; CAPACITY;
D O I
10.1186/s13638-022-02162-y
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Sparse Code Multiple Access (SCMA) is one of Non Orthogonal Multiple Access (NOMA) candidates for 5G, the fifth generation mobile network. Multiple overlapped blocks of SCMA code are transmitted per frequency layer which compels the receiver to cancel unwanted SCMA code blocks. Thanks to the sparsity of SCMA, Message Passing Algorithm (MPA) achieves near-optimal performance. Nevertheless, this process is time-consuming and has a high degree of complexity even if Max-Log Algorithm is used. The major contribution of this paper is to propose a new decoding scheme called Hybrid Interference Cancellation (HIC) to reduce time processing without degrading a target Bit Error Rate (BER). The HIC decodes and removes the strongest user, reducing the complexity of Log Domain MPA decoding of remaining users, followed by a Low Density Parity Code (LDPC) decoder. The interference cancellation decoder is either a hard interference cancellation or a soft interference cancellation. The originality of the paper is to calculate a threshold value based on power measurements to decide whether hard decoder or soft decoder should be used to reach the BER target with a lower complexity. Results show a significant reduction in terms of complexity as compared to the traditional MPA process for the same values of BER.
引用
收藏
页数:26
相关论文
共 50 条
  • [31] Cutoff Rate of Sparse Code Multiple Access in Downlink Broadcast Channels
    Li, Li
    Ma, Zheng
    Wang, Li
    Fan, Ping Zhi
    Hanzo, Lajos
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2017, 65 (08) : 3328 - 3342
  • [32] Sparse Code Multiple Access applied in the Generalized Frequency Division Multiplexing
    Aquino, Guilherme Pedro
    Mendes, Luciano Leonel
    2018 IEEE 5G WORLD FORUM (5GWF), 2018, : 49 - 54
  • [33] Low-complexity sparse detector for generalised space shift keying
    Zhang, Licheng
    Zhu, Sining
    Zhang, Lijuan
    Jin, Minglu
    ELECTRONICS LETTERS, 2019, 55 (05) : 268 - 269
  • [34] Comparison of Parallel and Successive Interference Cancellation for Non-Orthogonal Multiple Access
    Manglayev, Talgat
    Kizilirmak, Refik Caglar
    Kho, Yau Hee
    2018 2ND INTERNATIONAL CONFERENCE ON COMPUTING AND NETWORK COMMUNICATIONS (COCONET), 2018, : 84 - 87
  • [35] A Low-Complexity Location-Based Hybrid Multiple Access and Relay Selection in V2X Multicast Communications
    Wei, Chun-Yi
    Wang, Yung Kai
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2022, 71 (09) : 10185 - 10190
  • [36] Modified Sphere Decoding for Sparse Code Multiple Access
    Li, Lanping
    Wen, Jinming
    Tang, Xiaohu
    Tellambura, Chintha
    IEEE COMMUNICATIONS LETTERS, 2018, 22 (08) : 1544 - 1547
  • [37] Fractional Sparse Code Multiple Access and Its Optimization
    Wang, Yicheng
    Zhao, Ming
    Deng, Dan
    Zhou, Shengli
    Zhou, Wuyang
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2018, 7 (06) : 990 - 993
  • [38] Hybrid Iterative Detection and Decoding of Near-Instantaneously Adaptive Turbo-Coded Sparse Code Multiple Access
    Liu, Yusha
    Xiang, Luping
    Maunder, Robert G.
    Yang, Lie-Liang
    Hanzo, Lajos
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2021, 70 (05) : 4682 - 4692
  • [39] A Progressive Codebook Optimization Scheme for Sparse Code Multiple Access in Downlink Channels
    Lei, Tuofeng
    Ni, Shuyan
    Luo, Qu
    Chen, Shimiao
    Song, Xin
    Xiao, Pei
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2024, 73 (09) : 13038 - 13046
  • [40] Sparse Code Multiple Access-Based Edge Computing for IoT Systems
    Alnoman, Ali
    Erkucuk, Serhat
    Anpalagan, Alagan
    IEEE INTERNET OF THINGS JOURNAL, 2019, 6 (04): : 7152 - 7161