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

将二元分布匹配到通道

Matching Dyadic Distributions to Channels

Georg Böcherer, Rudolf Mathar

摘要:

许多具有离散输入的通信信道具有实现概率质量函数(PMF)的非均匀容量。通过根据完全无前缀码解析独立和等概率比特流,调制器可以在信道输入处生成二元PMF。在这项工作中,我们表明,对于离散无记忆信道和无记忆离散无噪声信道,寻找良好的二元输入PMF相当于最小化二元PMF和实现PMF的能力的加权版本之间的Kullback-Leibler距离。我们定义了一个新的算法称为几何霍夫曼编码(GHC),并证明GHC发现最佳的二元PMF在O(m \log m)的步骤,其中m是所考虑的信道的输入符号的数量。此外,我们证明了通过生成连续输入符号块的二元PMF,GHC在块长度趋于无穷大时达到容量。

英文摘要:

Many communication channels with discrete input have non-uniform capacity achieving probability mass functions (PMF). By parsing a stream of independent and equiprobable bits according to a full prefix-free code, a modu-lator can generate dyadic PMFs at the channel input. In this work, we show that for discrete memoryless channels and for memoryless discrete noiseless channels, searching for good dyadic input PMFs is equivalent to minimizing the Kullback-Leibler distance between a dyadic PMF and a weighted version of the capacity achieving PMF. We define a new algorithm called Geometric Huffman Coding (GHC) and prove that GHC finds the optimal dyadic PMF in O(m \log m) steps where m is the number of input symbols of the considered channel. Furthermore, we prove that by generating dyadic PMFs of blocks of consecutive input symbols, GHC achieves capacity when the block length goes to infinity.

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

↑