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

被引：322
作者：
Gastpar, M [1 ]
Rimoldi, B
Vetterli, M
机构：
[1] Univ Calif Berkeley, Dept Elect Engn & Comp Sci, Berkeley, CA 94720 USA
[2] Ecole Polytech Fed Lausanne, Inst Commun Syst, CH-1015 Lausanne, Switzerland
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2003年 / 49卷 / 05期
关键词：
joint source-channel coding; separation theorem; single-letter codes; single-source broadcast; uncoded transmission;
D O I：
10.1109/TIT.2003.810631
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：1147 / 1158
页数：12
相关论文
共 20 条
  • [1] [Anonymous], 1971, RATE DISTORTION THEO
  • [2] BERGER T, 2002, IEEE INT S INF THEOR
  • [3] Cover T. M., 2005, ELEM INF THEORY, DOI 10.1002/047174882X
  • [4] CSISZAR I, 1981, INFORMATION THEORY C
  • [5] SUCCESSIVE REFINEMENT OF INFORMATION
    EQUITZ, WHR
    COVER, TM
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (02) : 269 - 275
  • [6] GALLAGER RG, 1968, INFORMATION THEORY R
  • [7] Gastpar M., 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252), DOI 10.1109/ISIT.2001.936124
  • [8] To code or not to code
    Gastpar, M
    Rimoldi, B
    Vetterli, M
    [J]. 2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 236 - 236
  • [9] GASTPAR M, UNPUB IEEE T INFORM
  • [10] GASTPAR M, 2002, THESIS ECOLE POLYTEC
12