Loading...
Please wait, while we are loading the content...
Similar Documents
An implementable lossy version of the lempel-ziv algorithm - part i: optimality. Optimality for memoryless sources (1998).
| Content Provider | CiteSeerX |
|---|---|
| Author | Kontoyiannis, I. |
| Abstract | A new lossy variant of the Fixed-Database Lempel-Ziv coding algorithm for encoding at a fixed distortion level is proposed, and its asymptotic optimality and universality for memoryless sources (with respect to bounded single-letter distortion measures) is demonstrated: As the database size m increases to infinity, the expected compression ratio approaches the rate-distortion function. The complexity and redundancy characteristics of the algorithm are comparable to those of its lossless counterpart. A heuristic argument suggests that the redundancy is of order (log log m)= log m, and this is also confirmed experimentally; simulation results are presented that agree well with this rate. Also, the complexity of the algorithm is seen to be comparable to that of the corresponding lossless scheme. We show that there is a trade-off between compression performance and encoding complexity, and we discuss how the relevant parameters can be chosen to balance this trade-off in practice. We also d... |
| File Format | |
| Publisher Date | 1998-01-01 |
| Access Restriction | Open |
| Subject Keyword | Memoryless Source Lempel-ziv Algorithm Part Implementable Lossy Version Asymptotic Optimality Log Log Simulation Result Single-letter Distortion Measure Lossless Counterpart Redundancy Characteristic New Lossy Variant Expected Compression Ratio Compression Performance Corresponding Lossless Scheme Rate-distortion Function Fixed Distortion Level Fixed-database Lempel-ziv Coding Algorithm Database Size Increase Heuristic Argument Relevant Parameter |
| Content Type | Text |
