Multiple Access Analog Fountain Codes

被引:0
|
作者
Shirvanimoghaddam, Mahyar [1 ]
Li, Yonghui [1 ]
Vucetic, Branka [1 ]
机构
[1] Univ Sydney, Sch Elect & Informat Engn, Sydney, NSW 2006, Australia
关键词
Analog fountain codes; belief propagation; multiple access channel;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, we propose a novel rateless multiple access scheme based on the recently proposed capacity-approaching analog fountain code (AFC). We show that the multiple access process will create an equivalent analog fountain code, referred to as the multiple access analog fountain code (MA-AFC), at the destination. Thus, the standard belief propagation (BP) decoder can be effectively used to jointly decode all the users. We further analyze the asymptotic performance of the BP decoder by using a density evolution approach and show that the average log-likelihood ratio (LLR) of each user's information symbol is proportional to its transmit signal to noise ratio (SNR), when all the users utilize the same AFC code. Simulation results show that the proposed scheme can approach the sum-rate capacity of the Gaussian multiple access channel in a wide range of signal to noise ratios.
引用
收藏
页码:2167 / 2171
页数:5
相关论文
共 50 条
  • [41] Uniquely decodable multiple access source codes
    Zhao, Q
    Effros, M
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 195 - 195
  • [42] Universal linked multiple access source codes
    Jaggi, S
    Effros, M
    ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 95 - 95
  • [43] Multiple Access Channel Resolvability Codes From Source Resolvability Codes
    Sultana, Rumia
    Chou, Remi A.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (06) : 3608 - 3619
  • [44] A Novel Weight Coefficient PEG Algorithm for Ultra-Reliable Short Length Analog Fountain Codes
    Huang, Zixuan
    Jiao, Jian
    Zhang, Ke
    Wu, Shaohua
    Zhang, Qinyu
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2019, 8 (01) : 125 - 128
  • [45] Finite Block-Length Analog Fountain Codes for Ultra-Reliable Low Latency Communications
    Zhang, Ke
    Jiao, Jian
    Huang, Zixuan
    Wu, Shaohua
    Zhang, Qinyu
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (03) : 1391 - 1404
  • [46] Fountain Communication using Concatenated Codes
    Wang, Zheng
    Luo, Jie
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2013, 61 (02) : 443 - 454
  • [47] Fountain codes based on modulo and chaos
    Huang, Cheng
    Yi, Ben-Shun
    Gan, Liang-Cai
    Deng, Zai-Hui
    Xie, Wen-Hua
    Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications, 2010, 33 (03): : 121 - 125
  • [48] Multilevel Network Steganography in Fountain Codes
    Keller, Joerg
    PROCEEDINGS OF THE 2021 EUROPEAN INTERDISCIPLINARY CYBERSECURITY CONFERENCE, EICC 2021, 2021, : 72 - 76
  • [49] Interleaved Subspace Codes in Fountain Mode
    Sidorenko, Vladimir
    Bartz, Hannes
    Wachter-Zeh, Antonia
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 799 - 803
  • [50] A Novel Construction Method of Fountain Codes
    Lu, Weiyang
    Lin, Xuehong
    Lin, Jiaru
    Niu, Kai
    PROCEEDINGS OF 2012 IEEE 14TH INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY, 2012, : 1306 - 1311