Fixed-normal lossy Lempel-Ziv algorithm

The idea of a lossy Lempel-Ziv algorithm is to find a scheme that maps a sequence u/sub i//sup n/ /spl epsiv/ /spl Ascr//sup n/ into a binary sequence LZ(u/spl circ//sub 1//sup n/) such that the pair (/spl rho/(u/sub i//sup n/,u/spl circ//sub 1//sup n/), |LZ(u/spl circ//sub 1//sup n/)|/n) converges asymptotically to a point on the source rate-distortion curve, where u/spl circ//sub 1//sup n/ /spl epsiv/ /spl Ascr//spl tilde//sup n/, /spl Ascr//spl tilde//sup n/ is the, reproduction alphabet of /spl Ascr//sup n/, /spl rho/ is a distortion measure and |LZ(u/spl circ//sub 1//sup n/)| is the length of the Lempel-Ziv codeword. We present an approach that achieves this aim theoretically and discuss its practical implementation.