Loading [MathJax]/extensions/MathMenu.js
Tree encoding of memoryless time-discrete sources with a fidelity criterion | IEEE Journals & Magazine | IEEE Xplore

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


Abstract:

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 rateRisD, t...Show More

Abstract:

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 rateRisD, the solution of the equationR = R(D), whereR( )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 ofRandDan implementation complexity that is far smaller than the one obtainable from block codes.
Published in: IEEE Transactions on Information Theory ( Volume: 15, Issue: 5, September 1969)
Page(s): 584 - 590
Date of Publication: 06 January 2003

ISSN Information:


References

References is not available for this document.