Robust quaternary fountain codes in AWGN interference

被引:0
|
作者
Spencer, James [1 ]
Hayajneh, Khaled F. [2 ]
Yousefi, Shahram [1 ]
机构
[1] Queens Univ, Dept Elect & Comp Engn, Kingston, ON, Canada
[2] Yarmouk Univ, Dept Telecommun Engn, Irbid 21163, Jordan
基金
加拿大自然科学与工程研究理事会;
关键词
binary codes; AWGN channels; channel coding; transform coding; probability; error correction codes; error rate; realised code rate; additive white Gaussian noise channel; rateless criteria; zero error probability; FDD; robust quaternary fountain codes; AWGN interference; nonbinary fields; robust soliton distribution; RSD; binary erasure channel; fundamental degree distribution; nonbinary LT codes; Luby transform codes; AWGN channel; nonsystematic 4-ary LT code; noise figure 12; 0; dB; PERFORMANCE; DESIGN;
D O I
10.1049/iet-com.2018.5491
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Luby transform (LT) codes have received less attention in larger non-binary fields. Robust soliton distribution (RSD) was designed to provide universal optimality over the binary erasure channel in terms of minimising the overhead. In this study, the authors introduce a fundamental degree distribution (FDD), which when used with non-binary LT codes, outperforms their binary counterparts using the RSD in terms of error rate and realised code rate. For instance, over an additive white Gaussian noise (AWGN) channel at of 12dB and a rateless criteria (zero error probability), a non-systematic 4-ary LT code using the FDD can achieve a code rate of 0.75, compared to its binary counterpart which only achieves a code rate of 0.7.
引用
收藏
页码:2561 / 2567
页数:7
相关论文
共 50 条
  • [31] A BER model for turbo codes on AWGN channel
    Zhu, GX
    Feng, B
    Liu, WY
    Proceedings of 2005 IEEE International Workshop on VLSI Design and Video Technology, 2005, : 419 - 422
  • [32] Fountain Communication using Concatenated Codes
    Wang, Zheng
    Luo, Jie
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2013, 61 (02) : 443 - 454
  • [33] 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
  • [34] Multilevel Network Steganography in Fountain Codes
    Keller, Joerg
    PROCEEDINGS OF THE 2021 EUROPEAN INTERDISCIPLINARY CYBERSECURITY CONFERENCE, EICC 2021, 2021, : 72 - 76
  • [35] Interleaved Subspace Codes in Fountain Mode
    Sidorenko, Vladimir
    Bartz, Hannes
    Wachter-Zeh, Antonia
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 799 - 803
  • [36] 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
  • [37] Distributed fountain codes for networked storage
    Dimakis, Alexandros G.
    Prabhakaran, Vinod
    Ramchandran, Kannan
    2006 IEEE International Conference on Acoustics, Speech and Signal Processing, Vols 1-13, 2006, : 6007 - 6010
  • [38] Multiple Access Analog Fountain Codes
    Shirvanimoghaddam, Mahyar
    Li, Yonghui
    Vucetic, Branka
    2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 2167 - 2171
  • [39] Fountain Codes Over GF(q)
    Li, Xiangming
    Jiang, Tao
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2013, 13 (16): : 1423 - 1434
  • [40] Fountain codes for lossless data compression
    Caire, G
    Shamai, S
    Shokrollahi, A
    Verdú, S
    ALGEBRAIC CODING THEORY AND INFORMATION THEORY, 2005, 68 : 1 - 20