Abstract
Despite numerous bounds and partial results, the feedback capacity of the stationary nonwhite Gaussian additive noise channel has been open, even for the simplest cases such as the first-order autoregressive Gaussian channel studied by Butman, Tiernan and Schalkwijk, Wolfowitz, Ozarow, and more recently, Yang, Kavccaronicacute, and Tatikonda. Here we consider another simple special case of the stationary first-order moving average additive Gaussian noise channel and find the feedback capacity in closed form. Specifically, the channel is given by Yi=Xi+Zi, i=1,2,..., where the input {X i} satisfies a power constraint and the noise {Zi} is a first-order moving average Gaussian process defined by Zi=alphaUi-1+Ui, |alpha|les 1, with white Gaussian innovations Ui, i=0,1,.... We show that the feedback capacity of this channel is CFB=-log x0 where x0 is the unique positive root of the equation rhox2=(1-x2)(1-|alpha|x)2 and rho is the ratio of the average input power per transmission to the variance of the noise innovation Ui. The optimal coding scheme parallels the simple linear signaling 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 knowledge 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. Refreshingly, 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 autoregressive Gaussian noise channel given by Butman
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.