arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1204.4686cs.ITmath.IT
收藏

具有不等恢复时间的LT码分析

Analysis of LT Codes with Unequal Recovery Time

Jesper H. Sørensen, Petar Popovski, Jan Østergaard

摘要:

在本文中,我们分析了一类特殊的无比率码,称为LT码不等恢复时间。这些代码提供了将传输数据的不同片段优先于其他片段的选项。结果是在无速率传输期间分段解码,其中以较低开销解码较高优先级的分段。我们的分析集中于量化接收符号的预期量,这些符号在到达时已经是冗余的,即接收符号中包含的所有输入符号已经被解码。这种分析提供了新的见解LT码的概率机制不等恢复时间,这还没有在文献中。我们表明,虽然这些无比率代码成功地提供了不平等的恢复时间,但它们在优先级较低的段中的冗余方面付出了高昂的代价。我们提出并分析了一个修改,其中一个单一的中间反馈被发送,当第一段被解码的代码与两个段。我们的分析表明,这种修改提供了一个显着的改善解码性能的优先级较低的部分。

英文摘要:

In this paper we analyze a specific class of rateless codes, called LT codes with unequal recovery time. These codes provide the option of prioritizing different segments of the transmitted data over other. The result is that segments are decoded in stages during the rateless transmission, where higher prioritized segments are decoded at lower overhead. Our analysis focuses on quantifying the expected amount of received symbols, which are redundant already upon arrival, i.e. all input symbols contained in the received symbols have already been decoded. This analysis gives novel insights into the probabilistic mechanisms of LT codes with unequal recovery time, which has not yet been available in the literature. We show that while these rateless codes successfully provide the unequal recovery time, they do so at a significant price in terms of redundancy in the lower prioritized segments. We propose and analyze a modification where a single intermediate feedback is transmitted, when the first segment is decoded in a code with two segments. Our analysis shows that this modification provides a dramatic improvement on the decoding performance of the lower prioritized segment.

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

↑