Optimal Memory Order of Memory-Based LT Encoders for Finite Block-Length Codes Over Binary Erasure Channels.

Memory-based LT encoders (MBLTEs) have been shown to have better performance than the regular LT encoder in terms of bit error rate (BER) and decoding convergence speed. In this paper, we explore the entire family of MBLTEs for finite block-length codes over the binary erasure channel (BEC). We propose an algorithm to extend the first and second order MBLTE approach to an arbitrary $i$ -th order MBLTE. We analyze the performance of such encoders mathematically by characterizing the expected accumulated number of recovered variable nodes at each decoding round. We define the threshold of the memory-based encoding method (MBEM) and show that the performance of MBLTEs increases as the memory order increases up to the point where this threshold is achieved. Beyond this point, we show that the performance of MBLTEs saturates if the channel erasure probability is zero and degrades otherwise. We formulate an optimization problem to solve for the optimal memory order based on whether or not the MBEM threshold is achieved. We present an extensive set of numerical results. These show agreement between our analysis and computer simulations. They also show that our optimization problem is efficient in determining the optimal memory order of MBLTEs in terms of decoding convergence speed, BER/frame-error-rate, and error floor. [ABSTRACT FROM AUTHOR]