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

喷泉不可校正集与长度分析

Fountain Uncorrectable Sets and Finite-Length Analysis

Wen Ji, Bo-Wei Chen, Yiqiang Chen

摘要:

喷泉码在二进制擦除信道(BEC)中的译码性能取决于两个方面。一个是基本的代码结构,停止集分析操作。另一个是信道特性的影响,这是很难给出一个精确的估计。针对这些问题,本文提出了一种基于不可纠正集的喷泉码性能分析方法。给出了BEC上喷泉译码失败的条件。然后,我们对Fountain码的不可纠正集进行了分析。最后,我们结合停止集和不可纠正集对喷泉码的BEC性能进行了综合分析。

英文摘要:

Decoding performance of Fountain codes for the binary erasure channel (BEC) depends on two aspects. One is the essential code structure, on which stopping set analysis operates. The other is the effect from the channel characteristic, which is difficult to give a precise estimation. To tackle these problems, in this paper, we propose a solution to analyzing the performance of Fountain codes based on the uncorrectable set. We give the condition for Fountain decoding failure over the BEC. Then, we conduct the analysis of uncorrectable set on Fountain codes. Finally, we combine the stopping set and the uncorrectable set to provide the integrated analysis on the performance of Fountain codes for BEC.

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

↑