Design of LT Codes with Equal and Unequal Erasure Protection over Binary Erasure Channels

被引:33
作者
Hussain, Iqbal [1 ,2 ]
Xiao, Ming [1 ,2 ]
Rasmussen, Lars K. [1 ,2 ,3 ]
机构
[1] KTH Royal Inst Technol, Sch Elect Engn, Commun Theory Lab, Stockholm, Sweden
[2] ACCESS Linnaeus Ctr, Stockholm, Sweden
[3] Univ S Australia, Adelaide, SA 5001, Australia
基金
欧洲研究理事会; 瑞典研究理事会;
关键词
LT codes; erasure channels; erasure floor; unequal erasure protection; ERROR PROTECTION; RAPTOR CODES;
D O I
10.1109/LCOMM.2013.011113.122283
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
The erasure floor performance of Luby Transform (LT) codes is mainly determined by the minimum variable-node degree. Thus we propose a modified encoding scheme that maximizes the minimum variable-node degree for transmission over binary erasure channels. The proposed scheme leads to an almost-regular variable-node degree distribution. The encoding process is generalized to accommodate arbitrary variable-node degree distributions for additional improved performance. The asymptotic performance is investigated using density evolution and compared with a conventional LT code. The scheme is further extended to enable a higher level of unequal erasure protection.
引用
收藏
页码:261 / 264
页数:4
相关论文
共 15 条
[11]   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
[12]   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
[13]   Raptor codes [J].
Shokrollahi, Amin .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) :2551-2567
[14]   Prioritized LT codes [J].
Woo, Simon S. ;
Cheng, Michael K. .
2008 42ND ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1-3, 2008, :568-573
[15]   Doped accumulate LT codes [J].
Yuan, Xiaojun ;
Ping, Li .
2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, :2001-2005