A Lower Bound on the Expected Distortion of Joint Source-Channel Coding
Name
isit2019_jscc_fbl_.pdf
Description
Accepted version
Size
98.46 KB
Format
Adobe PDF
Checksum (MD5)
aa762736fb4b0d47985c5ad680e5b183
Author(s)
Kochman, Yuval
Ordentlich, Or
Polyanskiy, Yury
Date Issued
September 2019
Journal
2019 IEEE International Symposium on Information Theory (ISIT)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Kochman, Yuval et al. "A Lower Bound on the Expected Distortion of Joint Source-Channel Coding." 2019 IEEE International Symposium on Information Theory (ISIT), July 2019, Paris, France, Institute of Electrical and Electronics Engineers, September 2019. © 2019 IEEE
Version
Author's final manuscript
Abstract
We consider the classic joint source-channel coding problem of transmitting a memoryless source over a memoryless channel. The focus of this work is on the rate of convergence of the smallest attainable expected distortion to its asymptotic value, as a function of blocklength n. Our main result is that in general the convergence rate is not faster than n-1/2. In particular, we show that for the problem of transmitting i.i.d uniform bits over a binary symmetric channels with Hamming distortion, the smallest attainable distortion (bit error rate) is at least Ω(n-1/2) above the asymptotic value, if the "bandwidth expansion ratio" is above 1.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/isit.2019.8849390
