为什么我们不能超越能力:匹配条件
Why We Can Not Surpass Capacity: The Matching Condition
摘要:
我们表明,迭代编码系统不能超过容量,只使用自然出现在密度演化的数量。虽然结果本身是微不足道的,我们应用的方法表明,为了实现容量的各种组件在迭代编码系统中必须完全匹配。这概括了完美的匹配条件,这是以前已知的情况下,通过二进制擦除通道的一般类的二进制输入无记忆输出对称通道的传输。这种完美匹配条件的潜在应用是构建容量实现度分布和确定所需的迭代次数作为容量的乘法间隙的函数。
英文摘要:
We show that iterative coding systems can not surpass capacity using only quantities which naturally appear in density evolution. Although the result in itself is trivial, the method which we apply shows that in order to achieve capacity the various components in an iterative coding system have to be perfectly matched. This generalizes the perfect matching condition which was previously known for the case of transmission over the binary erasure channel to the general class of binary-input memoryless output-symmetric channels. Potential applications of this perfect matching condition are the construction of capacity-achieving degree distributions and the determination of the number required iterations as a function of the multiplicative gap to capacity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。