Design of Raptor Codes for Small Message Length

New Raptor codes, based on low rate low-density parity-check (LDPC) codes, are proposed for short message length over various channels. The proposed Raptor codes are obtained by pre-coding the information bits by low rate LDPC codes and utilizing a low constant average degree distribution with high intermediate symbol recovery rate (ISRR). Simulation results demonstrate that the proposed Raptor codes outperform conventional Raptor codes for small message length.

[1]  Nazanin Rahnavard,et al.  On the Intermediate Symbol Recovery Rate of Rateless Codes , 2012, IEEE Transactions on Communications.

[2]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[3]  Jianping An,et al.  Design of UEP-Raptor codes over BEC , 2010, Eur. Trans. Telecommun..

[4]  Joong Bum Rhim,et al.  Fountain Codes , 2010 .

[5]  Toshiaki Koike-Akino,et al.  Ripple Design of LT Codes for BIAWGN Channels , 2014, IEEE Transactions on Communications.

[6]  Omid Etesami,et al.  Raptor codes on binary memoryless symmetric channels , 2006, IEEE Transactions on Information Theory.

[7]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[8]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[9]  Yong Liang Guan,et al.  A Design of Physical-Layer Raptor Codes for Wide SNR Ranges , 2014, IEEE Communications Letters.

[10]  Meixiang Zhang,et al.  Soft decoding method for systematic raptor codes , 2015, IET Commun..

[11]  Harry Leib,et al.  Fixed-Rate Raptor Codes Over Rician Fading Channels , 2008, IEEE Transactions on Vehicular Technology.

[12]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.

[13]  David Declercq,et al.  Jointly Decoded Raptor Codes: Analysis and Design for the BIAWGN Channel , 2009, EURASIP J. Wirel. Commun. Netw..

[14]  Sujay Sanghavi.  Intermediate Performance of Rateless Codes , 2007, 2007 IEEE Information Theory Workshop.

[15]  Michael Mitzenmacher,et al.  Analysis of random processes via And-Or tree evaluation , 1998, SODA '98.

[16]  Ian D. Marsland,et al.  A Comparison of Rateless Codes at Short Block Lengths , 2008, 2008 IEEE International Conference on Communications.

[17]  Jorma T. Virtamo,et al.  Optimal Degree Distribution for LT Codes with Small Message Length , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.