CaltechAUTHORS
  A Caltech Library Service

On the rate loss and construction of source codes for broadcast channels

Feng, Hanying and Effros, Michelle (2005) On the rate loss and construction of source codes for broadcast channels. In: International Symposium on Information Theory (ISIT 2005), Adelaide, South Australia, Australia, 4-9 September 2005. IEEE , pp. 82-86. ISBN 0-7803-9151-9 http://resolver.caltech.edu/CaltechAUTHORS:FENisit05

[img]
Preview
PDF
See Usage Policy.

270Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:FENisit05

Abstract

In this paper, we first define and bound the rate loss of source codes for broadcast channels. Our broadcast channel model comprises one transmitter and two receivers; the transmitter is connected to each receiver by a private channel and to both receivers by a common channel. The transmitter sends a description of source (X, Y) through these channels, receiver 1 reconstructs X with distortion D1, and receiver 2 reconstructs Y with distortion D2. Suppose the rates of the common channel and private channels 1 and 2 are R0, R1, and R2, respectively. The work of Gray and Wyner gives a complete characterization of all achievable rate triples (R0,R1,R2) given any distortion pair (D1,D2). In this paper, we define the rate loss as the gap between the achievable region and the outer bound composed by the rate-distortion functions, i.e., R0+R1+R2 ≥ RX,Y (D1,D2), R0 + R1 ≥ RX(D1), and R0 + R2 ≥ RY (D2). We upper bound the rate loss for general sources by functions of distortions and upper bound the rate loss for Gaussian sources by constants, which implies that though the outer bound is generally not achievable, it may be quite close to the achievable region. This also bounds the gap between the achievable region and the inner bound proposed by Gray and Wyner and bounds the performance penalty associated with using separate decoders rather than joint decoders. We then construct such source codes using entropy-constrained dithered quantizers. The resulting implementation has low complexity and performance close to the theoretical optimum. In particular, the gap between its performance and the theoretical optimum can be bounded from above by constants for Gaussian sources.


Item Type:Book Section
Additional Information:© Copyright 2005 IEEE. Reprinted with permission. The authors wish to thank Dr. Qian Zhao for many helpful exchanges. This material is based upon work partially supported by NSF Grants No. CCR-0220039 and the Caltech’s Lee Center for Advanced Networking.
Record Number:CaltechAUTHORS:FENisit05
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:FENisit05
Alternative URL:http://dx.doi.org/10.1109/ISIT.2005.1523297
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:7301
Collection:CaltechAUTHORS
Deposited By: Archive Administrator
Deposited On:27 Jan 2007
Last Modified:26 Dec 2012 09:30

Repository Staff Only: item control page