TY - GEN
T1 - Lossy joint source-channel coding in the finite blocklength regime
AU - Kostina, Victoria
AU - Verdú, Sergio
PY - 2012
Y1 - 2012
N2 - This paper shows new tight finite-blocklength bounds for the best achievable lossy joint sour ce-channel code rate, and demonstrates that joint sour ce-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.
AB - This paper shows new tight finite-blocklength bounds for the best achievable lossy joint sour ce-channel code rate, and demonstrates that joint sour ce-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.
KW - Achievability
KW - Shannon theory
KW - converse
KW - finite blocklength regime
KW - joint source-channel coding
KW - lossy source coding
KW - memoryless sources
KW - rate-distortion theory
UR - http://www.scopus.com/inward/record.url?scp=84867562505&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84867562505&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2012.6283533
DO - 10.1109/ISIT.2012.6283533
M3 - Conference contribution
AN - SCOPUS:84867562505
SN - 9781467325790
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1553
EP - 1557
BT - 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
T2 - 2012 IEEE International Symposium on Information Theory, ISIT 2012
Y2 - 1 July 2012 through 6 July 2012
ER -