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 July 2012 | Submitted
Book Section - Chapter Open

Lossy joint source-channel coding in the finite blocklength regime

Abstract

This paper shows new tight finite-blocklength bounds for the best achievable lossy joint source-channel code rate, and demonstrates that joint source-channel code design brings considerable performance advantage over a separate one in the non-asymptotic regime. A joint source-channel code maps a block of k source symbols onto a length - n channel codeword, and the fidelity of reproduction at the receiver end is measured by the probability ϵ that the distortion exceeds a given threshold d. For memoryless sources and channels, it is demonstrated that the parameters of the best joint source-channel code must satisfy nC - kR(d) ≈ √(nV + kV(d)) Q^(-1) (ϵ), where C and V are the channel capacity and dispersion, respectively; R(d) and V(d) are the source rate-distortion and rate-dispersion functions; and Q is the standard Gaussian complementary cdf.

Additional Information

© 2012 IEEE. This work was supported in part by the National Science Foundation (NSF) under Grant CCF-1016625 and by the Center for Science of Information (CSoI), an NSF Science and Technology Center, under Grant CCF-0939370. The first author was supported in part by the Natural Sciences and Engineering Research Council of Canada.

Attached Files

Submitted - 1209.1317v2.pdf

Files

1209.1317v2.pdf
Files (934.2 kB)
Name Size Download all
md5:7bb4868c2b53625b38d14a7391ada090
934.2 kB Preview Download

Additional details

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