By Topic

Tree encoding for symmetric sources with a 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
$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)

A simple algorithm is developed for mapping the outputs of a source into the set of code sequences generated by a tree code. The algorithm is analyzed for a special case in which the source produces discrete independent equiprobable letters, and the distortion measure satisfies a symmetry condition. Letting R be the code rate and D^{\ast } be the minimum average distortion for that rate as given by Shannon's rate-distortion theorem, we show that the algorithm is capable of achieving average distortion as close to D^{\ast } as desired. Furthermore an upper bound is developed on the average amount of computation for the algorithm. Asymptotically as the average distortion < d> approaches the theoretical limit D^{\ast } , the bound on average computation has the form \exp [a/ \sqrt {< d> - D^{\ast } }] for some constant a .

Published in:

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