A Lower Bound on the Expected Distortion of Joint Source-Channel Coding
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 t...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2021
|
| Online Access: | https://hdl.handle.net/1721.1/129803 |
| _version_ | 1811088234002776064 |
|---|---|
| author | Kochman, Yuval Ordentlich, Or Polyanskiy, Yury |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Kochman, Yuval Ordentlich, Or Polyanskiy, Yury |
| author_sort | Kochman, Yuval |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T13:58:49Z |
| format | Article |
| id | mit-1721.1/129803 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T13:58:49Z |
| publishDate | 2021 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/1298032022-10-01T18:21:25Z A Lower Bound on the Expected Distortion of Joint Source-Channel Coding Kochman, Yuval Ordentlich, Or Polyanskiy, Yury Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 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. 2021-02-17T22:13:30Z 2021-02-17T22:13:30Z 2019-09 2019-07 2021-02-16T14:35:27Z Article http://purl.org/eprint/type/ConferencePaper 9781538692912 2157-8117 https://hdl.handle.net/1721.1/129803 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 en http://dx.doi.org/10.1109/isit.2019.8849390 2019 IEEE International Symposium on Information Theory (ISIT) Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) Prof. Polyanskiy via Phoebe Ayers |
| spellingShingle | Kochman, Yuval Ordentlich, Or Polyanskiy, Yury A Lower Bound on the Expected Distortion of Joint Source-Channel Coding |
| title | A Lower Bound on the Expected Distortion of Joint Source-Channel Coding |
| title_full | A Lower Bound on the Expected Distortion of Joint Source-Channel Coding |
| title_fullStr | A Lower Bound on the Expected Distortion of Joint Source-Channel Coding |
| title_full_unstemmed | A Lower Bound on the Expected Distortion of Joint Source-Channel Coding |
| title_short | A Lower Bound on the Expected Distortion of Joint Source-Channel Coding |
| title_sort | lower bound on the expected distortion of joint source channel coding |
| url | https://hdl.handle.net/1721.1/129803 |
| work_keys_str_mv | AT kochmanyuval alowerboundontheexpecteddistortionofjointsourcechannelcoding AT ordentlichor alowerboundontheexpecteddistortionofjointsourcechannelcoding AT polyanskiyyury alowerboundontheexpecteddistortionofjointsourcechannelcoding AT kochmanyuval lowerboundontheexpecteddistortionofjointsourcechannelcoding AT ordentlichor lowerboundontheexpecteddistortionofjointsourcechannelcoding AT polyanskiyyury lowerboundontheexpecteddistortionofjointsourcechannelcoding |