To code, or not to code: lossy source-channel communication revisited
Gastpar, M.
Rimoldi, B.
Vetterli, M.
Dept. of Electr. Eng. & Comput. Sci., Univ. of California, Berkeley, CA, USA;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: May 2003
Volume: 49,
Issue: 5
On page(s): 1147- 1158
ISSN: 0018-9448
INSPEC Accession Number: 7618693
Digital Object Identifier: 10.1109/TIT.2003.810631
Current Version Published: 2003-05-07
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
