By Topic

Tree encoding of memoryless time-discrete sources with a fidelity criterion

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
$33 $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)

In this paper we show that for memoryless time-discrete sources with a bounded fidelity criterion, the limiting average distortion achievable by tree codes of rate R is D , the solution of the equation R = R(D) , where R( ) denotes the usual rate distortion function. Thus the performance of tree codes is as good as that of block codes. Some theoretical and experimental results are also discussed indicating that tree codes and corresponding encoding algorithms exist having for given values of R and D an implementation complexity that is far smaller than the one obtainable from block codes.

Published in:

Information Theory, IEEE Transactions on  (Volume:15 ,  Issue: 5 )