Delayed Feedback Capacity of Stationary Sources over Linear Gaussian Noise Channels

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

submitted to ISIT 2007

Scientific paper

We consider a linear Gaussian noise channel used with delayed feedback. The channel noise is assumed to be a ARMA (autoregressive and/or moving average) process. We reformulate the Gaussian noise channel into an intersymbol interference channel with white noise, and show that the delayed-feedback of the original channel is equivalent to the instantaneous-feedback of the derived channel. By generalizing results previously developed for Gaussian channels with instantaneous feedback and applying them to the derived intersymbol interference channel, we show that conditioned on the delayed feedback, a conditional Gauss-Markov source achieves the feedback capacity and its Markov memory length is determined by the noise spectral order and the feedback delay. A Kalman-Bucy filter is shown to be optimal for processing the feedback. The maximal information rate for stationary sources is derived in terms of channel input power constraint and the steady state solution of the Riccati equation of the Kalman-Bucy filter used in the feedback loop.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Delayed Feedback Capacity of Stationary Sources over Linear Gaussian Noise Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Delayed Feedback Capacity of Stationary Sources over Linear Gaussian Noise Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Delayed Feedback Capacity of Stationary Sources over Linear Gaussian Noise Channels will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-188723

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.