Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm

Two universal lossy data compression schemes, one with fixed rate and the other with fixed distortion, are presented, based on the well-known Lempel-Ziv algorithm. In the case of fixed rate R, the universal lossy data compression scheme works as follows: first pick a codebook B/sub n/ consisting of...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory Vol. 42; no. 1; pp. 239 - 245
Main Authors: En-hui Yang, Kieffer, J.C.
Format: Journal Article
Language:English
Published: New York IEEE 01.01.1996
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Additive noise
Algorithms
Codes
Communication channels
Convolutional codes
Data compression
Educational institutions
Error correction
Gaussian channels
Source coding
Viterbi algorithm
ISSN:0018-9448, 1557-9654
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Two universal lossy data compression schemes, one with fixed rate and the other with fixed distortion, are presented, based on the well-known Lempel-Ziv algorithm. In the case of fixed rate R, the universal lossy data compression scheme works as follows: first pick a codebook B/sub n/ consisting of all reproduction sequences of length n whose Lempel-Ziv codeword length is /spl les/nR, and then use B/sub n/ to encode the entire source sequence n-block by n-block. This fixed-rate data compression scheme is universal in the sense that for any stationary, ergodic source or for any individual sequence, the sample distortion performance as n/spl rarr//spl infin/ is given almost surely by the distortion rate function. A similar result is shown in the context of fixed distortion lossy source coding.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/18.481794