By Topic

Optimum linear causal coding schemes for Gaussian stochastic processes in the presence of correlated jamming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Basar, T.U. ; Dept. of Electr. & Comput. Eng., Illinois Inst. of Technol., Chicago, IL, USA

The complete solution is obtained to the following problem. A Gaussian stochastic process {θt,t∈[0,tf]} satisfying a certain stochastic differential equation is to be transmitted through a stochastic channel to a receiver under minimum mean-squared error distortion measure. The channel is to be used for exactly tf seconds, and, in addition to white Gaussian noise with a given energy level, the channel is corrupted by another source whose output may be correlated with the input to the channel and which satisfied a given power constraint. There is an input power constraint to the channel, and noiseless feedback is allowed between the receiver (decoder) and the transmitter (encoder). The authors determine the linear causal encoder and decoder structures that function optimally under the worst admissible noise inputs to the channel. The least favorable probability distribution for this unknown noise is found to be Gaussian and is correlated with the transmitted signal. Also included is a comparative study of these results with earlier ones that addressed a similar problem without a causality restriction imposed on the transmitter

Published in:

Information Theory, IEEE Transactions on  (Volume:35 ,  Issue: 1 )