Efficient Symbol Sorting for High Intermediate Recovery Rate of LT Codes

TL;DR

This paper introduces a new algorithm that rearranges the transmission order of LT code symbols, significantly improving intermediate recovery rates while maintaining near-capacity performance.

Contribution

The paper presents a novel symbol sorting algorithm that enhances LT codes' intermediate recovery rate without sacrificing their efficiency.

Findings

Increased intermediate recovery rate demonstrated through simulations.

Preserved near-capacity performance of LT codes.

Effective in various channel erasure conditions.

Abstract

LT codes are modern and efficient rateless forward error correction (FEC) codes with close to channel capacity performance. Nevertheless, in intermediate range where the number of received encoded symbols is less than the number of source symbols, LT codes have very low recovery rates. In this paper, we propose a novel algorithm which significantly increases the intermediate recovery rate of LT codes, while it preserves the codes' close to channel capacity performance. To increase the intermediate recovery rate, our proposed algorithm rearranges the transmission order of the encoded symbols exploiting their structure, their transmission history, and an estimate of the channel's erasure rate. We implement our algorithm for conventional LT codes, and numerically evaluate its performance.