Title :
Asymptotic properties of algorithms of data compression with fidelity criterion based on string matching
Author :
Koga, Hiroki ; Arimoto, Suguru
Author_Institution :
Fac. of Eng., Tokyo Univ., Japan
fDate :
27 Jun-1 Jul 1994
Abstract :
A data compression scheme proposed by Steinberg and Gutman [1993] is essentially an extension of the Ziv-Lempel algorithm [1977]. Their scheme, however, does not achieve the rate-distortion bound in their original form. In the present paper, sufficient conditions that the rate of the scheme achieves the rate-distortion bound are analyzed for discrete memoryless sources and memoryless gaussian sources under the single-letter fidelity criterion and squared-error fidelity criterion, respectively
Keywords :
Gaussian processes; data compression; discrete systems; memoryless systems; rate distortion theory; Ziv-Lempel algorithm; asymptotic properties; data compression; discrete memoryless sources; fidelity criterion; memoryless gaussian sources; rate-distortion bound; single-letter fidelity criterion; squared-error fidelity criterion; string matching; Algorithm design and analysis; Convergence; Data compression; Data engineering; Entropy; Equations; Information theory; Probability distribution; Random variables; Rate-distortion;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.395004
