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

带记忆信源的信源-信道匹配

Source-Channel Matching for Sources with Memory

Christos Kourtellaris, Charalambos D. Charalambous, Photios A. Stavrou

摘要:

在本文中,我们分析的概率匹配的源与内存的内存通道,使无预期的记忆的符号码是最佳的,相对于平均失真和过量失真的概率。我们展示了这样一个逐符号码的可识别性,它具有无预期的记忆,并且我们展示了在一阶对称信道上具有成本约束的二进制对称马尔可夫源(BSMS(p))的匹配。

英文摘要:

In this paper we analyze the probabilistic matching of sources with memory to channels with memory so that symbol-by-symbol code with memory without anticipation are optimal, with respect to an average distortion and excess distortion probability. We show achievability of such a symbolby- symbol code with memory without anticipation, and we show matching for the Binary Symmetric Markov source (BSMS(p)) over a first-order symmetric channel with a cost constraint.

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

↑