A Lower Bound on the Expected Distortion of Joint Source-Channel Coding
Name
Journal version.pdf
Description
Submitted version
Size
376.63 KB
Format
Adobe PDF
Checksum (MD5)
b4479aa784240ea9a234d90d6d31a40f
Author(s)
Kochman, Yuval
Ordentlich, Or
Polyanskiy, Yury
Date Issued
2020
Journal
IEEE Transactions on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Version
Original manuscript
Abstract
© 1963-2012 IEEE. 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 long-standing open problem of finding the rate of convergence of the smallest attainable expected distortion to its asymptotic value, as a function of the 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 Omega (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
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Massachusetts Institute of Technology. Institute for Data, Systems, and Society
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/TIT.2020.2983148
