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 条
  • [1] Low-complexity hybrid interference cancellation for sparse code multiple access
    Bilal Ghani
    Frederic Launay
    Yannis Pousset
    Clency Perrine
    Jean Pierre Cances
    EURASIP Journal on Wireless Communications and Networking, 2022
  • [2] Low-complexity Interference Cancellation Receiver for Sparse Code Multiple Access
    Zou, Jia
    Zhao, Hui
    Zhao, Wenxiu
    2015 IEEE 6TH INTERNATIONAL SYMPOSIUM ON MICROWAVE, ANTENNA, PROPAGATION, AND EMC TECHNOLOGIES (MAPE), 2015, : 277 - 282
  • [3] A Low-Complexity Codebook Optimization Scheme for Sparse Code Multiple Access
    Jiang, Chengxin
    Wang, Yafeng
    Cheng, Peng
    Xiang, Wei
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2022, 70 (04) : 2451 - 2463
  • [4] Novel Successive Interference Cancellation (SIC) With Low-Complexity for GFDM Systems
    Tazehkand, Behzad Mozaffari
    Aghdam, Mohammad Reza Ghavidel
    Vakilian, Vida
    Abdolee, Reza
    IEEE ACCESS, 2022, 10 : 40063 - 40072
  • [5] Low Complexity Iterative Receiver Design for Sparse Code Multiple Access
    Wei, Fan
    Chen, Wen
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2017, 65 (02) : 621 - 634
  • [6] A Tutorial on Decoding Techniques of Sparse Code Multiple Access
    Chaturvedi, Saumya
    Liu, Zilong
    Bohara, Vivek Ashok
    Srivastava, Anand
    Xiao, Pei
    IEEE ACCESS, 2022, 10 : 58503 - 58524
  • [7] Sparse Code Multiple Access
    Nilopour, Hosein
    Baligh, Hadi
    2013 IEEE 24TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR, AND MOBILE RADIO COMMUNICATIONS (PIMRC), 2013, : 332 - 336
  • [8] Sparse Code Multiple Access: Potentials and Challenges
    Rebhi, Manel
    Hassan, Kais
    Raoof, Kosai
    Charge, Pascal
    IEEE OPEN JOURNAL OF THE COMMUNICATIONS SOCIETY, 2021, 2 : 1205 - 1238
  • [9] Delayed Bit Interleaved Coded Sparse Code Multiple Access
    Mheich, Zeina
    Liu, Zilong
    Xiao, Pei
    Maaref, Amine
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2020, 69 (07) : 8018 - 8022
  • [10] Sub-Graph BasedJoint Sparse Graph for Sparse Code Multiple Access Systems
    Lai, Ke
    Wen, Lei
    Lei, Jing
    Xiao, Pei
    Maaref, Amine
    Imran, Muhammad Ali
    IEEE ACCESS, 2018, 6 : 25066 - 25080