SCMA Joint Coding and Decoding Algorithm Based on Code Reliability

被引:1
|
作者
Zhao, Hongwei [1 ]
Wang, Huanzhu [1 ]
Yan, Yue [1 ]
机构
[1] Northwestern Polytech Univ, Sch Elect & Informat, Xian 710129, Peoples R China
来源
MOBILE NETWORKS & APPLICATIONS | 2023年 / 28卷 / 01期
基金
中国国家自然科学基金;
关键词
Internet of things; High capacity; Sparse code multiple access; Decoding algorithm; RECEIVER; NOMA;
D O I
10.1007/s11036-022-01935-5
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The wide application of the Internet of Things (IoT), large-scale satellite clusters and drone clusters requires multiple access capabilities for massive devices. In order to meet the high-capacity and low-latency access requirements in application scenarios such as the IoT, this paper proposes to apply sparse code multiple access (SCMA) technology to the massive terminal access of the IoT, focusing on the study of SCMA decoding algorithm. Aiming at the high complexity of its traditional decoding algorithm, a decoding algorithm based on codeword reliability is proposed. The algorithm reduces the number of codeword iterations with higher reliability by setting a threshold to reduce the algorithm complexity. The simulation results show that the algorithm reduces the complexity of the algorithm while the loss of bit error rate performance is very small. Then, aiming at the poor bit error rate performance of SCMA technology under the condition of low signal-to-noise ratio, a joint coding and decoding simulation link based on soft input and soft output Turbo code and SCMA technology is proposed. The simulation results prove that Turbo codes can speed up the convergence speed of the decoding algorithm. When the SNR is 4 dB, the bit error rate of the joint system has been reduced to below 10e-3, which has obvious advantages compared with the SCMA system without Turbo coding. Therefore, the two methods proposed in this paper can be used for the high-capacity demand of the IoT communication system.
引用
收藏
页码:285 / 295
页数:11
相关论文
共 50 条
  • [21] NOISE-IMMUNE CODE REDUNDANCY WHEN CODING AND DECODING CIRCUITS HAVE FINITE RELIABILITY
    MELNIKOV, YN
    TELECOMMUNICATIONS AND RADIO ENGINEER-USSR, 1966, (12): : 1 - &
  • [22] Optimization of the joint coding/decoding structure
    Parisot, C
    Antonini, M
    Barlaud, M
    Tramini, S
    Latry, C
    Lambert-Nebout, C
    2001 INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOL III, PROCEEDINGS, 2001, : 470 - 473
  • [23] A High Performance Joint Detection and Decoding scheme for LDPC coded SCMA system
    Han, Kaining
    Zhang, Zhenbing
    Hu, Jianhao
    Chen, Jienan
    2016 IEEE GLOBECOM WORKSHOPS (GC WKSHPS), 2016,
  • [24] Research on LDPC Code Decoding Algorithm Based on Scheduling Strategy
    Xiao, Feng
    PROCEEDINGS OF THE 28TH CHINESE CONTROL AND DECISION CONFERENCE (2016 CCDC), 2016, : 3816 - 3821
  • [25] Iterative reliability-based decoding in bandwidth efficient coding schemes
    Isaka, M
    Fossorier, M
    ANNALS OF TELECOMMUNICATIONS, 2005, 60 (1-2) : 132 - 146
  • [26] Efficient coding and decoding algorithm based on generalized Huffman tree
    Guo, Jianguang
    Zhang, Weijie
    Yang, Jian
    An, Wentao
    Xiong, Tao
    Qinghua Daxue Xuebao/Journal of Tsinghua University, 2009, 49 (01): : 73 - 77
  • [27] MUSICAM coding/decoding algorithm and realization of decoding software
    Wang, Xuan
    Sun, Shixin
    Yao, Zhiqin
    Diansheng Jishu/Audio Engineering, (01): : 7 - 11
  • [28] Windowed Joint Detection and Decoding with IR-HARQ for Asynchronous SCMA Systems
    Guan, Mengsheng
    Zhu, Min
    Bai, Baoming
    ENTROPY, 2023, 25 (06)
  • [29] A joint detection and iterative decoding algorithm of optical concatenated space-time code
    College of Computer & Communication, Lanzhou University of Technology, Lanzhou
    Gansu
    730050, China
    不详
    Shaanxi
    710048, China
    Guangxue Xuebao, 8
  • [30] The optimization scheme for joint iterative detection and decoding of polar coded SCMA system
    Zhang, Yongxing
    Ge, Wenping
    Zhang, Pengju
    Gao, Mengyao
    OPTICAL FIBER TECHNOLOGY, 2020, 58 (58)