n392846SE Academic Article uri icon

abstract

  • Let X, Y, Z be zero-mean, jointly Gaussian random vectors of dimensions nx, ny, and nz, respectively. Let P be the set of random variables W such that W Y (X, Z) is a Markov string. We consider the following optimization problem: minWP I(Y ; W Z) subject to one of the following two possible constraints: 1) I(X ; W Z) RI, and 2) the mean squared error between X and X = (X W, Z) is less than d. The problem under the first kind of constraint is motivated by multiple-input multiple-output (MIMO) relay channels with an oblivious transmitter and a relay connected to the receiver through a dedicated link, while for the second case, it is motivated by source coding with decoder side information where the sensor observation is noisy. In both cases, we show that jointly Gaussian solutions are optimal. Moreover, explicit water filling interpretations are given for both cases, which suggest transform coding approaches performed in different transform domains, and that the optimal solution for one problem is, in general, suboptimal for the other. 2009 IEEE.

published proceedings

  • IEEE Transactions on Information Theory

author list (cited authors)

  • Tian, C., & Chen, J.

publication date

  • January 1, 2009 11:11 AM