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

零延迟信源-信道编码的研究

On Zero Delay Source-Channel Coding

Emrah Akyol, Kumar Viswanatha, Kenneth Rose, Tor Ramstad

摘要:

在本文中,我们研究的零延迟源信道编码问题,特别是获得最佳的m维源空间和k维信道空间之间的映射,在给定的传输功率约束和均方误差失真的矢量变换的问题。我们首先研究这个问题的功能特性,并表明,目标是凹的源和噪声密度和凸的输入通道的密度。然后,我们推导出的编码器和解码器映射的最优性的必要条件。信息论中的一个众所周知的结果涉及标量高斯源和信道设置中的最佳编码和解码映射在所有信道信噪比(CSNR)下的线性度。在本文中,我们研究这一结果更一般,超越高斯源和信道,并推导出必要和充分条件的线性最佳映射,给定的噪声(或源)分布,和指定的功率约束。我们还证明了高斯源通道对是唯一的意义上说,它是唯一的源通道对的最佳映射是线性在一个以上的CSNR值。此外,我们显示的渐近线性的最佳映射低CSNR,如果信道是高斯的源,而在另一个极端,对于高CSNR,如果源是高斯的,不管信道。我们的数值结果表明,严格的改进比以前的方法。数值方法被扩展到具有解码器侧信息的源信道编码的场景。所得到的编码映射是连续的亲属,事实上subsuberantic作为特殊情况下,Wyner-Ziv映射中遇到的数字分布式信源编码系统。

英文摘要:

In this paper, we study the zero-delay source-channel coding problem, and specifically the problem of obtaining the vector transformations that optimally map between the m-dimensional source space and the k-dimensional channel space, under a given transmission power constraint and for the mean square error distortion. We first study the functional properties of this problem and show that the objective is concave in the source and noise densities and convex in the density of the input to the channel. We then derive the necessary conditions for optimality of the encoder and decoder mappings. A well known result in information theory pertains to the linearity of optimal encoding and decoding mappings in the scalar Gaussian source and channel setting, at all channel signal-to-noise ratios (CSNRs). In this paper, we study this result more generally, beyond the Gaussian source and channel, and derive the necessary and sufficient condition for linearity of optimal mappings, given a noise (or source) distribution, and a specified power constraint. We also prove that the Gaussian source-channel pair is unique in the sense that it is the only source-channel pair for which the optimal mappings are linear at more than one CSNR values. Moreover, we show the asymptotic linearity of optimal mappings for low CSNR if the channel is Gaussian regardless of the source and, at the other extreme, for high CSNR if the source is Gaussian, regardless of the channel. Our numerical results show strict improvement over prior methods. The numerical approach is extended to the scenario of source-channel coding with decoder side information. The resulting encoding mappings are shown to be continuous relatives of, and in fact subsume as special case, the Wyner-Ziv mappings encountered in digital distributed source coding systems.

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

↑