scispace - formally typeset
Journal ArticleDOI

Distortion Bounds for Broadcasting With Bandwidth Expansion

Z. Reznic, +2 more
- 01 Aug 2006 - 
- Vol. 52, Iss: 8, pp 3778-3788
TLDR
It is shown how a system with a partial feedback, returning from the bad receiver to the transmitter and to the good receiver, achieves a distortion pair that lies on the outer bound derived here.
Abstract
We consider the problem of broadcasting a single Gaussian source to two listeners over a Gaussian broadcast channel, with rho channel uses per source sample, where rho>1. A distortion pair (D1 ,D2) is said to be achievable if one can simultaneously achieve a mean-squared error (MSE) D1 at receiver 1 and D2 at receiver 2. The main result of this correspondence is an outer bound for the set of all achievable distortion pairs. That is, we find necessary conditions under which (D1,D2) is achievable. We then apply this result to the problem of point-to-point transmission over a Gaussian channel with unknown signal-to-noise ratio (SNR) and rho>1. We show that if a system must be optimal at a certain SNRmin, then, asymptotically, the system distortion cannot decay faster than O(1/SNR). As for achievability, we show that a previously reported scheme, due to Mittal and Phamdo (2002), is optimal at high SNR. We introduce two new schemes for broadcasting with bandwidth expansion, combining digital and analog transmissions. We finally show how a system with a partial feedback, returning from the bad receiver to the transmitter and to the good receiver, achieves a distortion pair that lies on the outer bound derived here

read more

Citations
More filters
Journal ArticleDOI

Slepian-Wolf coding over broadcast channels

TL;DR: It is shown with an example that an optimal joint source-channel coding strategy is strictly advantageous over the combination of stand-alone source and channel codes, and thus "informational separation" does not hold.
Proceedings ArticleDOI

Lattices are everywhere

TL;DR: This tutorial paper covers close to 20 years of research in the area; of enjoying the beauty of lattice codes, and discovering their power in dithered quantization, dirty paper coding, Wyner-Ziv DPCM, modulo-lattice modulation, distributed interference cancelation, and more.
Journal ArticleDOI

Joint Source–Channel Codes for MIMO Block-Fading Channels

TL;DR: In this paper, the authors considered transmission of a continuous amplitude source over an L-block Rayleigh-fading Mt x Mr multiple-input multiple-output (MIMO) channel when the channel state information is only available at the receiver and provided an upper bound and lower bound for the distortion exponent with respect to the bandwidth ratio among the channel and source bandwidths.
Proceedings ArticleDOI

SoftCast: one-size-fits-all wireless video

TL;DR: This demonstration is the performance of streaming video over the mobile wireless channel and compares two schemes: the standard approach to video which transmits H.264/AVC-encoded stream over 802.11-like PHY, and SoftCast -- a clean-slate design for wireless video where the source transmits one video stream that each receiver decodes to a video quality commensurate with its specific instantaneous channel quality.
Journal ArticleDOI

Wireless Scalable Video Coding Using a Hybrid Digital-Analog Scheme

TL;DR: A hybrid digital-analog (HDA) joint source-channel coding (JSCC) scheme that integrates the advantages of digital coding and analog coding and has strong adaptability to channel variation with higher coding efficiency and better fairness among all receivers is presented.
References
More filters
Book

Elements of information theory

TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
Journal ArticleDOI

The rate-distortion function for source coding with side information at the decoder

TL;DR: The quantity R \ast (d) is determined, defined as the infimum ofrates R such that communication is possible in the above setting at an average distortion level not exceeding d + \varepsilon .
Journal ArticleDOI

Nested linear/lattice codes for structured multiterminal binning

TL;DR: Nested codes are proposed, or more specifically, nested parity-check codes for the binary case and nested lattices in the continuous case, which connect network information theory with the rich areas of linear codes and lattice codes, and have strong potential for practical applications.
Journal ArticleDOI

On a source-coding problem with two channels and three receivers

TL;DR: This paper treats the problem of communicating a memoryless unit-variance Gaussian source to three receivers and obtains an expression for the simultaneously achievable distortions (mean-squared error) of this source.
Journal ArticleDOI

The convolution inequality for entropy powers

TL;DR: An improved version of Stam's proof of Shannon's convolution inequality for entropy power is presented, which is obtained by mathematical induction from the one-dimensional case.
Related Papers (5)