Sparse Code Multiple Access Decoding Using Message-Passing Algorithm

被引:0
|
作者
Andhary, Lathifa Rizqi [1 ]
Nuha, Hilal H. [1 ]
Haryanti, Tita [1 ]
机构
[1] Telkom Univ, Sch Comp, Bandung, Indonesia
关键词
5G; SCMA; MPA; codebook;
D O I
10.1109/ICoDSA55874.2022.9862831
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In no time, 4G will be replaced by 5G. Furthermore, 5G still uses the Orthogonal Frequency Division Multiple Access schemes. However, Orthogonal Frequency Division Multiple Access has shortcomings in terms of massive connectivity, so a new scheme is needed to replace Orthogonal Frequency Division Multiple Access for 5G. So, this paper discusses the performance evaluation of the Sparse Code Multiple Access for 5G. In addition to the Orthogonal Frequency Division Multiple Access, a message-passing algorithm can also be used to decode Sparse Code Multiple Access messages so they can deal with large amounts of traffic. If the amount of traffic is large, it can accommodate big number of users in the use of 5G. The message-passing algorithm can meet 5G specifications, so it is suitable for 5G use. The performance of Sparse Code Multiple Access will confirm its usability for the 5G system. So, the message-passing algorithm can detect the user information on Sparse Code Multiple Access, to increasing complexity and to find bit error rate in the algorithm. This paper uses the message-passing algorithm to test the bit error rate on six types of codebooks. From all the codebooks, the codebook with smallest bit error rate is best codebook to choose for Sparse Code Multiple Access.
引用
收藏
页码:161 / 165
页数:5
相关论文
共 50 条
  • [41] Message-passing parallel algorithm for Bayesian image restoration
    Doallo, R
    Eiroa, J
    Sanjurjo, J
    Carazo, JM
    [J]. CISST'2000: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON IMAGING SCIENCE, SYSTEMS, AND TECHNOLOGY, VOLS I AND II, 2000, : 361 - 367
  • [42] A PARALLEL GRAPH PARTITIONING ALGORITHM FOR A MESSAGE-PASSING MULTIPROCESSOR
    GILBERT, JR
    ZMIJEWSKI, E
    [J]. INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 1987, 16 (06) : 427 - 449
  • [44] A PARALLEL GRAPH PARTITIONING ALGORITHM FOR A MESSAGE-PASSING MULTIPROCESSOR
    GILBERT, JR
    ZMIJEWSKI, E
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1988, 297 : 498 - 513
  • [45] Sequential message-passing decoding of LDPC codes by partitioning check nodes
    Kim, Sunghwan
    Jang, Min-Ho
    No, Jong-Seon
    Hong, Song-Nam
    Shin, Dong-Joon
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2008, 56 (07) : 1025 - 1031
  • [46] Inferring the origin of an epidemic with a dynamic message-passing algorithm
    Lokhov, Andrey Y.
    Mezard, Marc
    Ohta, Hiroki
    Zdeborova, Lenka
    [J]. PHYSICAL REVIEW E, 2014, 90 (01):
  • [47] Graph-based message-passing schedules for decoding LDPC codes
    Xiao, H
    Banihashemi, AH
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2004, 52 (12) : 2098 - 2105
  • [48] A Message-Passing Approach for Joint Channel Estimation, Interference Mitigation, and Decoding
    Zhu, Yan
    Guo, Dongning
    Honig, Michael L.
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2009, 8 (12) : 6008 - 6018
  • [49] An Efficient Majority-Logic Based Message-Passing Algorithm for Non-binary LDPC Decoding
    Lu, Yichao
    Qiu, Nanfan
    Chen, Zhixiang
    Goto, Satoshi
    [J]. 2012 IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS (APCCAS), 2012, : 479 - 482
  • [50] Practical Decoding Scheme for Doubly Irregular Sparse Code Multiple Access
    Hidayat, Iswahyudi
    Meylani, Linda
    Kurniawan, Adit
    Arifianto, M. Sigit
    Anwar, Khoirul
    [J]. 2019 26TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS (ICT), 2019, : 135 - 141