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

无比率码的中间性能

Intermediate Performance of Rateless Codes

Sujay Sanghavi

摘要:

无比率/喷泉码被设计成使得可以使用迭代解码器以高概率从稍大数量的编码符号中恢复所有输入符号。在本文中,我们调查的输入符号的数量,可以恢复由同一个解码器,但当可用的编码符号的数量小于输入符号的总数。当然,恢复所有输入是不可能的,并且可以恢复的部分将取决于代码的输出度分布。在本文中,我们(a)外边界的输入,可以恢复任何输出度分布的代码的分数,和(b)设计度分布,满足/执行接近这个界限。我们的研究结果是感兴趣的实时系统使用无比率码,猛禽型两阶段的设计。

英文摘要:

Rateless/fountain codes are designed so that all input symbols can be recovered from a slightly larger number of coded symbols, with high probability using an iterative decoder. In this paper we investigate the number of input symbols that can be recovered by the same decoder, but when the number of coded symbols available is less than the total number of input symbols. Of course recovery of all inputs is not possible, and the fraction that can be recovered will depend on the output degree distribution of the code. In this paper we (a) outer bound the fraction of inputs that can be recovered for any output degree distribution of the code, and (b) design degree distributions which meet/perform close to this bound. Our results are of interest for real-time systems using rateless codes, and for Raptor-type two-stage designs.

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

↑