arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1006.1383cs.ITmath.IT
收藏

LT码高中间恢复率的有效符号排序

Efficient Symbol Sorting for High Intermediate Recovery Rate of LT Codes

Ali Talari, Behzad Shahrasbi, Nazanin Rahnavard

摘要:

LT码是现代高效的无比率前向纠错(FEC)码,具有接近信道容量的性能。然而,在接收的编码符号的数量小于源符号的数量的中间范围中,LT码具有非常低的恢复率。在本文中,我们提出了一种新的算法,显着提高LT码的中间恢复率,而它保持了代码的接近信道容量的性能。为了提高中间恢复率,我们提出的算法重新安排的编码符号的传输顺序,利用它们的结构,它们的传输历史,和信道的擦除率的估计。我们实现了我们的算法为传统的LT码,并数值评估其性能。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑