Research on the Optimal Decoding Overhead of LT Codes

被引:0
|
作者
Wu, Shuang [1 ]
Guan, Qingyang [1 ]
Cui, Chen [2 ]
机构
[1] Xian Int Univ, Coll Engn, Xian, Peoples R China
[2] Harbin Inst Technol, Sch Elect & Informat Engn, Harbin, Peoples R China
关键词
Rateless codes; LT codes; transmission efficiency; recovery ratio per symbol; optimal decoding overhead;
D O I
10.1109/IWCMC51323.2021.9498769
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The LT codes can generate coded symbols as much as needed, which property makes the LT codes be the first class of rateless codes. As the encoding process of a traditional LT code would depends on the feedback message, which code can suit for various channel states, at the cost of affected by twice transmission delay. But in many scenarios, the feedback messages would bring some drawbacks, such as the feedback channels are not existed or the transmission distances are too much, etc.. And the error performances of LT codes also can be pre-determined by using different output degree distributions. For these reasons, if the encoder can pre-known the channel states, there is a chance to make the data transmitted with a optimal efficiency. As in the research field on rateless codes, the code rate were barely to be concerned, instead of its reciprocal, which named as overhead. In this paper, by quantized the transmission efficiency by using the proposed notation Recovery Ratio Per Symbol (RRPS), the optimal decoding overhead and optimal encoding overhead which are related to the maximum coding efficiency, and which would make the LT codes have the potential to transmit data without feedback messages with a higher transmission efficiency.
引用
收藏
页码:1829 / 1834
页数:6
相关论文
共 50 条
  • [41] Optimal symbol-by-symbol decoding of binary block codes
    Nazarov, L.E.
    Smol'yaninov, V.M.
    Radiotekhnika i Elektronika, 1999, 44 (05): : 561 - 565
  • [42] Optimal symbol-by-symbol decoding of binary block codes
    Nazarov, LE
    Smol'yaninov, VM
    JOURNAL OF COMMUNICATIONS TECHNOLOGY AND ELECTRONICS, 1999, 44 (05) : 518 - 522
  • [43] Design and decoding of optimal high-rate convolutional codes
    Amat, AGI
    Montorsi, G
    Benedetto, S
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (05) : 867 - 881
  • [44] Optimal threshold sequential decoding algorithms for linear block codes
    Chen, J
    Sun, R
    Wang, XM
    2000 IEEE 51ST VEHICULAR TECHNOLOGY CONFERENCE, PROCEEDINGS, VOLS 1-3, 2000, : 605 - 607
  • [45] New optimal hard decoding of convolutional codes with reduced complexity
    Dany, JC
    Antoine, J
    Husson, L
    Paul, N
    Wautier, A
    Brouet, J
    WCNC 2003: IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE RECORD, VOLS 1-3, 2003, : 289 - 293
  • [46] ASYMPTOTICALLY OPTIMAL SOFT DECISION DECODING ALGORITHMS FOR HAMMING CODES
    SUNDBERG, CE
    ELECTRONICS LETTERS, 1977, 13 (02) : 38 - 40
  • [47] Optimal decoding of convolutional codes in channels with additive Markov noise
    Korzhik, V.I.
    Lopato, Yu.P.
    Problems of information transmission, 1988, 23 (04) : 276 - 280
  • [48] An optimal decoding algorithm for LDPC codes based on reverse distance
    Xiong, L
    Tan, ZH
    Yao, DP
    Zhu, G
    ICEMI 2005: Conference Proceedings of the Seventh International Conference on Electronic Measurement & Instruments, Vol 3, 2005, : 585 - 588
  • [49] OPTIMAL INFORMATION BIT DECODING OF LINEAR BLOCK-CODES
    KIELY, AB
    COFFEY, JT
    BELL, MR
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (01) : 130 - 140
  • [50] Optimal Distributed Codes with Delay Four and Constant Decoding Complexity
    Lu, Hsiao-feng
    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 2026 - 2030