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
来源
IWCMC 2021: 2021 17TH INTERNATIONAL WIRELESS COMMUNICATIONS & MOBILE COMPUTING CONFERENCE (IWCMC) | 2021年
关键词
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
相关论文
共 10 条
[1]  
[Anonymous], 1998, P 33 ANN ACM SIAM S
[2]   Channel coding: The road to channel capacity [J].
Costello, Daniel J., Jr. ;
Forney, G. David, Jr. .
PROCEEDINGS OF THE IEEE, 2007, 95 (06) :1150-1177
[3]   Raptor codes on binary memoryless symmetric channels [J].
Etesami, O ;
Shokrollahi, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (05) :2033-2051
[4]  
Jeon WG, 1999, IEEE T COMMUN, V47, P27, DOI 10.1109/26.747810
[5]  
Luby M, 2002, ANN IEEE SYMP FOUND, P271, DOI 10.1109/SFCS.2002.1181950
[6]   Fountain codes [J].
MacKay, DJC .
IEE PROCEEDINGS-COMMUNICATIONS, 2005, 152 (06) :1062-1068
[7]  
Perry Jonathan., 2011, 10th ACM Workshop on Hot Topics in Networks, P6
[8]   Rateless codes with unequal error protection property [J].
Rahnavard, Nazanin ;
Vellambi, Badri N. ;
Fekri, Faramarz .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (04) :1521-1532
[9]   Expanding Window Fountain Codes for Unequal Error Protection [J].
Sejdinovic, Dino ;
Vukobratovic, Dejan ;
Doufexi, Angela ;
Senk, Vojin ;
Piechocki, Robert J. .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2009, 57 (09) :2510-2516
[10]   Raptor codes [J].
Shokrollahi, Amin .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) :2551-2567