Optimizing the Degree Distribution of LT codes with an Importance Sampling Approach

Fountain coding principle introduced by Byers et al. in 1998 describes an efficient way to transfer information over erasure channels. In this paper, we focus on a particular class of fountain codes, the LT codes. The key component of LT codes is the so-called degree distribution used in the encoding procedure. The degree distribution is the sole component responsible for the efficiency of the LT codes. In general, the optimization of the degree distribution is not a trivial problem. This paper describes an algorithm for iterative optimization of parameterized degree distributions for LT codes. In particular, we use methods utilized in importance sampling theory to construct an objective function which eventually is optimized with non-linear optimization methods. The proposed method is studied for message lengths of a couple of hundred blocks and less. We present some examples of degree distributions optimized with the proposed algorithm with comparisons to the performance of previously proposed distributions.

[1]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[2]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[3]  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.

[4]  Katta G. Murty,et al.  Nonlinear Programming Theory and Algorithms , 2007, Technometrics.

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

[6]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

[7]  P. Farrell,et al.  Essentials of Error-control Coding , 2006 .

[8]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.