Title :
Fixed-normal lossy Lempel-Ziv algorithm
Author :
Finamore, Weiler A. ; Pinho, Marcelo S.
Author_Institution :
Center for Telecommun. Studies, Pontificia Univ. Catolica do Rio de Janeiro, Brazil
fDate :
29 Jun-4 Jul 1997
Abstract :
The idea of a lossy Lempel-Ziv algorithm is to find a scheme that maps a sequence uin ε 𝒜n into a binary sequence LZ(uˆ1n) such that the pair (ρ(uin,uˆ1n), |LZ(uˆ1n)|/n) converges asymptotically to a point on the source rate-distortion curve, where uˆ1n ε 𝒜˜n, 𝒜˜n is the, reproduction alphabet of 𝒜n , ρ is a distortion measure and |LZ(uˆ1n )| is the length of the Lempel-Ziv codeword. We present an approach that achieves this aim theoretically and discuss its practical implementation
Keywords :
binary sequences; rate distortion theory; source coding; Lempel-Ziv codeword; binary sequence; data compression; distortion measure; fixed-normal scheme; lossy Lempel-Ziv algorithm; reproduction alphabet; source rate-distortion curve; Binary sequences; Convergence; Cost function; Data compression; Distortion measurement; Length measurement; Loss measurement; Mean square error methods; Random variables; Rate-distortion;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613099
