A tight bound on the performance of a minimal-delay joint source-channel coding scheme

Abstract-This paper is concerned with the optimal linear transforms in zero-delay source channel coding for Gaussian sources and channels. In preparation for the main results, we first consider the classical problem in the point-to-point setting, which had already been solved by Lee and Petersen, where we provide an alternative proof using majorization. We then analyze the performance of linear source-channel coding in the low signalto-noise ratio (SNR) regime. We show that at asymptotically low SNR, or equivalently as the power tends to zero, the powerdistortion function of zero delay linear coding achieves optimum theoretically achievable performance. Finally, we consider zerodelay source-channel coding with decoder side information. Here, subject to structural constraints on the encoder, we find the optimal encoder-decoder pair in closed form. We analyze two structures: i) the encoder is constrained to be linear where we show that the optimal transform is product of matrices including as factor the conditional Karhunen Loéve transform (KLT) of the source given the side information. ii) the encoder consists of linear transformation followed by individual optimal nonlinear mapping of each transform coefficient. Using majorization principles, we show that the optimal transform does not depend on the nonlinearities introduced, as long as they are scale invariant, hence the optimal transform is also a product involving the conditional KLT of the source.

show abstract