AN ALGORITHM FOR SOURCE-CODING SUBJECT TO A FIDELITY-CRITERION, BASEDON STRING-MATCHING

Authors
STEINBERG Y GUTMAN M
Citation
Y. Steinberg et M. Gutman, AN ALGORITHM FOR SOURCE-CODING SUBJECT TO A FIDELITY-CRITERION, BASEDON STRING-MATCHING, IEEE transactions on information theory, 39(3), 1993, pp. 877-886
Citations number
15
Categorie Soggetti
Mathematics,"Engineering, Eletrical & Electronic
Journal title
IEEE transactions on information theory → ACNP
ISSN journal
00189448
Volume
39
Issue
3
Year of publication
1993
Pages
877 - 886
Database
ISI
SICI code
0018-9448(1993)39:3<877:AAFSST>2.0.ZU;2-2
Abstract
A practical, suboptimal universal block source coding scheme, subject to a fidelity criterion, is proposed. The algorithm is an extension of the Lempel-Ziv algorithm and is based on string matching with distort ion. It is shown that given average distortion D > 0, the algorithm ac hieves a rate not exceeding R(D/2) for a large class of sources and di stortion measures. Tighter bounds on the rate are derived for discrete memoryless sources and for memoryless Gaussian sources.