Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published August 2011 | Submitted
Book Section - Chapter Open

Fixed-length lossy compression in the finite blocklength regime: discrete memoryless sources

Abstract

This paper studies the minimum achievable source coding rate as a function of blocklength n and tolerable distortion level d. Tight general achievability and converse bounds are derived that hold at arbitrary fixed blocklength. For stationary memoryless sources with separable distortion, the minimum rate achievable is shown to be q closely approximated by R(d) + √v(d)/nQ^(-1)(ϵ), where R(d) is the rate-distortion function, V (d) is the rate dispersion, a characteristic of the source which measures its stochastic variability, Q-1 (·) is the inverse of the standard Gaussian complementary cdf, and ϵ is the probability that the distortion exceeds d. The new bounds and the second-order approximation of the minimum achievable rate are evaluated for the discrete memoryless source with symbol error rate distortion. In this case, the second-order approximation reduces to R(d) + 1/2 log n/n if the source is non-redundant.

Additional Information

© 2011 IEEE. This work was partially supported by NSF under grant CCF-1016625 and by the Center for Science of Information, an NSF Science and Technology Center, under grant agreement CCF-0939370. The first author was supported in part by the Natural Sciences and Engineering Research Council of Canada. Useful discussions with Dr. Yury Polyanskiy are gratefully acknowledged. In particular, Theorem 3 arose from discussions with him.

Attached Files

Submitted - 1102.3944v3.pdf

Files

1102.3944v3.pdf
Files (843.6 kB)
Name Size Download all
md5:7db3203832a8d15d555f6d0bd20fa792
843.6 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 17, 2023