By Topic

Information rates of non-Gaussian processes

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

2 Author(s)

The rate distortion function R(D) of an information source was introduced by Shannon to specify the channel capacity required in transmitting information from the source with an average distortion not exceeding D . Exact rates have been calculated for Gaussian sources under a mean-square error criterion. For non-Gaussian continuous sources, Shannon has given upper and lower bounds on R(D) . In specific cases, the difference between these two bounds may not be sufficiently small to provide a useful estimate of R(D) . The present paper is concerned with improving estimates of information rates of non-Gaussian sources under a mean-square error criterion. The sources considered are ergodic, and their statistical properties are characterized by a bounded and continuous n -dimensional probability density function. The paper gives a set of necessary and sufficient conditions for R(D) to equal Shannon's lower bound. For sources satisfying these conditions, exact rate calculations are possible. For sources that do not satisfy the required conditions, an improved upper bound is obtained that never exceeds Shannon's upper bound. Under rather general conditions, the new upper bound approaches Shannon's lower bound for small values of distortion, so that the true value of R(D) can be estimated very accurately for small D .

Published in:

Information Theory, IEEE Transactions on  (Volume:10 ,  Issue: 4 )