Computer Science – Information Theory
Scientific paper
2010-06-07
Computer Science
Information Theory
2010 IEEE International Symposium on Information Theory (ISIT 2010)
Scientific paper
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.
Rahnavard Nazanin
Shahrasbi Behzad
Talari Ali
No associations
LandOfFree
Efficient Symbol Sorting for High Intermediate Recovery Rate of LT Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Efficient Symbol Sorting for High Intermediate Recovery Rate of LT Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Symbol Sorting for High Intermediate Recovery Rate of LT Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-29129