By Topic

A tree coding theorem for stationary Gaussian sources and the squared-error distortion measure

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)

For a class of stationary Gaussian sources and the squared-error distortion measure, an asymptotically optimal tree coding scheme is derived using tree codes with finite branch length. The distribution of the reproduction process is derived in an explicit form, and using the random coding argument and results from the theory of branching processes with stationary ergodic environmental processes, the source coding theorem is proved. The theorem is applicable to all Gaussian sources with a power spectrum that satisfies the Lip 1 condition with no restriction on the coding rate.

Published in:

Information Theory, IEEE Transactions on  (Volume:32 ,  Issue: 2 )