research-article

To code, or not to code: lossy source-channel communication revisited

Authors:

M. Gastpar,

B. Rimoldi,

M. VetterliAuthors Info & Claims

IEEE Transactions on Information Theory, Volume 49, Issue 5

Pages 1147 - 1158

https://doi.org/10.1109/TIT.2003.810631

Published: 01 September 2006 Publication History

Abstract

What makes a source-channel communication system optimal? It is shown that in order to achieve an optimal cost-distortion tradeoff, the source and the channel have to be matched in a probabilistic sense. The match (or lack of it) involves the source distribution, the distortion measure, the channel conditional distribution, and the channel input cost function. Closed-form necessary and sufficient expressions relating the above entities are given. This generalizes both the separation-based approach as well as the two well-known examples of optimal uncoded communication. The condition of probabilistic matching is extended to certain nonergodic and multiuser scenarios. This leads to a result on optimal single-source broadcast communication.

Cited By

View all

Wang WCai DDong ZYu LXu YLiu Z(2024)Two-View Image Semantic Cooperative Nonorthogonal Transmission in Distributed Edge NetworksInternational Journal of Intelligent Systems10.1155/int/50810172024Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1155/int/5081017
Reisizadeh HMaddah-Ali MMohajer S(2024)Cache-Aided K-User Broadcast Channels With State Information at ReceiversIEEE Transactions on Information Theory10.1109/TIT.2023.332289770:4(2518-2537)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1109/TIT.2023.3322897
Floor PRamstad T(2024)Shannon–Kotel’nikov Mappings for Analog Point-to-Point CommunicationsIEEE Transactions on Information Theory10.1109/TIT.2023.329796270:4(2491-2517)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1109/TIT.2023.3297962
Show More Cited By

Recommendations

Sufficient Conditions for a Regular LDPC Code Better than an Irregular LDPC Code

Decoding performance of LDPC (Low-Density Parity-Check) codes is highly dependent on the degree distributions of the Tanner graphs which define the LDPC codes. We compare two LDPC code ensembles, one has a uniform degree distribution and the other a non-...
Code design for MIMO broadcast channels

Recent information-theoretic results show the optimality of dirty-paper coding (DPC) in achieving the full capacity region of the Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). This paper presents a DPC based code design for BCs. ...
MIMO-assisted space-code-division multiple-access: linear detectors and performance over multipath fading channels

In this contribution, we propose and investigate a multiple-input-multiple-output space-division, code-division multiple-access (MIMO SCDMA) scheme. The main objective is to improve the capacity of the existing direct-sequence (DS)-CDMA systems, for ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

IEEE Transactions on Information Theory Volume 49, Issue 5

May 2003

314 pages

ISSN:0018-9448

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 September 2006

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

60
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wang WCai DDong ZYu LXu YLiu Z(2024)Two-View Image Semantic Cooperative Nonorthogonal Transmission in Distributed Edge NetworksInternational Journal of Intelligent Systems10.1155/int/50810172024Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1155/int/5081017
Reisizadeh HMaddah-Ali MMohajer S(2024)Cache-Aided K-User Broadcast Channels With State Information at ReceiversIEEE Transactions on Information Theory10.1109/TIT.2023.332289770:4(2518-2537)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1109/TIT.2023.3322897
Floor PRamstad T(2024)Shannon–Kotel’nikov Mappings for Analog Point-to-Point CommunicationsIEEE Transactions on Information Theory10.1109/TIT.2023.329796270:4(2491-2517)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1109/TIT.2023.3297962
Zhang WZhang HMa HShao HWang NLeung V(2023)Predictive and Adaptive Deep Coding for Wireless Image Transmission in Semantic CommunicationIEEE Transactions on Wireless Communications10.1109/TWC.2023.323440822:8(5486-5501)Online publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1109/TWC.2023.3234408
Mahmood AWagner A(2023)Minimax Rate-DistortionIEEE Transactions on Information Theory10.1109/TIT.2023.332853269:12(7712-7737)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1109/TIT.2023.3328532
Buvarp ATaylor RMishra KMili LZaghloul A(2023)Constant Curvature Curve Tube Codes for Low-Latency Analog Error CorrectionIEEE Transactions on Information Theory10.1109/TIT.2023.330231869:12(7738-7754)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1109/TIT.2023.3302318
Sun LYang YChen MGuo CSaad WPoor H(2023)Adaptive Information Bottleneck Guided Joint Source and Channel Coding for Image TransmissionIEEE Journal on Selected Areas in Communications10.1109/JSAC.2023.328823841:8(2628-2644)Online publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1109/JSAC.2023.3288238
Mital NGündüz D(2022)Bandwidth Expansion for Over-the-Air Computation with One-Sided CSI2022 IEEE International Symposium on Information Theory (ISIT)10.1109/ISIT50566.2022.9834270(1271-1276)Online publication date: 26-Jun-2022
https://dl.acm.org/doi/10.1109/ISIT50566.2022.9834270
Dong Y(2020)Distributed Sensing With Orthogonal Multiple Access: To Code or not to Code?IEEE Transactions on Signal Processing10.1109/TSP.2020.297120368(1315-1330)Online publication date: 1-Jan-2020
https://dl.acm.org/doi/10.1109/TSP.2020.2971203
Varshney L(2019)Mathematical limit theorems for computational creativityIBM Journal of Research and Development10.1147/JRD.2019.289390763:1(2:1-2:12)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1147/JRD.2019.2893907
Show More Cited By

Abstract

Cited By

Recommendations

Sufficient Conditions for a Regular LDPC Code Better than an Irregular LDPC Code

Code design for MIMO broadcast channels

MIMO-assisted space-code-division multiple-access: linear detectors and performance over multipath fading channels

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations