English

Feedback Capacity of the First-Order Moving Average Gaussian Channel

Information Theory 2007-07-16 v2 math.IT

Abstract

The feedback capacity of the stationary Gaussian additive noise channel has been open, except for the case where the noise is white. Here we find the feedback capacity of the stationary first-order moving average additive Gaussian noise channel in closed form. Specifically, the channel is given by Yi=Xi+Zi,Y_i = X_i + Z_i, i=1,2,...,i = 1, 2, ..., where the input {Xi}\{X_i\} satisfies a power constraint and the noise {Zi}\{Z_i\} is a first-order moving average Gaussian process defined by Zi=αUi1+Ui,Z_i = \alpha U_{i-1} + U_i, α1,|\alpha| \le 1, with white Gaussian innovations Ui,U_i, i=0,1,....i = 0,1,.... We show that the feedback capacity of this channel is logx0,-\log x_0, where x0x_0 is the unique positive root of the equation ρx2=(1x2)(1αx)2, \rho x^2 = (1-x^2) (1 - |\alpha|x)^2, and ρ\rho is the ratio of the average input power per transmission to the variance of the noise innovation UiU_i. The optimal coding scheme parallels the simple linear signalling scheme by Schalkwijk and Kailath for the additive white Gaussian noise channel -- the transmitter sends a real-valued information-bearing signal at the beginning of communication and subsequently refines the receiver's error by processing the feedback noise signal through a linear stationary first-order autoregressive filter. The resulting error probability of the maximum likelihood decoding decays doubly-exponentially in the duration of the communication. This feedback capacity of the first-order moving average Gaussian channel is very similar in form to the best known achievable rate for the first-order \emph{autoregressive} Gaussian noise channel studied by Butman, Wolfowitz, and Tiernan, although the optimality of the latter is yet to be established.

Keywords

Cite

@article{arxiv.cs/0411036,
  title  = {Feedback Capacity of the First-Order Moving Average Gaussian Channel},
  author = {Young-Han Kim},
  journal= {arXiv preprint arXiv:cs/0411036},
  year   = {2007}
}

Comments

Updated version, 36 pages, 4 figures, submitted to IEEE Trans. Inform. Theory