A New Cross-Level Decoding Scheme for LT Codes

被引:2
作者
Cao, Chen [1 ]
Li, Hongxiang [1 ]
Hu, Zixia [2 ]
机构
[1] Univ Louisville, Dept Elect & Comp Engn, Louisville, KY 40292 USA
[2] Qualcomm Inc, San Jose, CA 95110 USA
关键词
LT codes; cross-level decoding; And-Or Tree; RAPTOR CODES;
D O I
10.1109/LCOMM.2015.2407352
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
In this letter, we propose a new cross-level decoding method for LT codes, where the results of packet-level decoding are fed back to bit-level decoding to improve the overall decoding performance. Another advantage of ourmethod is that it keeps the original LT decoder structure and does not require extra real field computation. We provide the revised And-Or Tree analysis for the proposed method and validate it with numerical simulations.
引用
收藏
页码:893 / 896
页数:4
相关论文
共 11 条
[1]   Cross-layer Raptor coding for broadcasting over wireless channels with memory [J].
Cao, Yu ;
Blostein, Steven D. .
2009 11TH CANADIAN WORKSHOP ON INFORMATION THEORY, 2009, :130-135
[2]  
Courtade T., 2009, IEEE International Conference on Communications, ICC, P1
[3]   Raptor codes on binary memoryless symmetric channels [J].
Etesami, O ;
Shokrollahi, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (05) :2033-2051
[4]  
Ezio B., 1999, SIGNAL PROCESSING MU, P253
[5]  
Luby M, 2002, ANN IEEE SYMP FOUND, P271, DOI 10.1109/SFCS.2002.1181950
[6]  
Luby M., 1998, PROC 9 ANN ACM SIA, P364
[7]   Verification-based decoding for packet-based low-density parity-check codes [J].
Luby, MG ;
Mitzenmacher, M .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (01) :120-127
[8]   Reliable multimedia download delivery in cellular broadcast networks [J].
Luby, Michael ;
Gasiba, Tiago ;
Stockhammer, Thomas ;
Watson, Mark .
IEEE TRANSACTIONS ON BROADCASTING, 2007, 53 (01) :235-246
[9]   Analysis and design of a new fountain codec under belief propagation [J].
Mirrezaei, Seyed Masoud ;
Faez, Karim ;
Yousefi, Shahram .
IET COMMUNICATIONS, 2014, 8 (01) :27-40
[10]   Raptor codes [J].
Shokrollahi, Amin .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) :2551-2567