Strategies for Delay-Limited Source-Channel Coding
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
In this paper, we explain how to build a turbo-like structure with binary inputs and chaotic outputs for efficient coding and decoding in additive white Gaussian noise (AWGN). We analyze the convergence of the decoding algorithm, the performance in the err ...
This paper shows that the capacity achieving input distribution for a fading Gaussian broadcast channel is not Gaussian in general. The construction of non-Gaussian distributions that strictly outperform Gaussian ones, for certain characterized fading dist ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009
The addition of a feedback link to a discrete memoryless channel does not increase its capacity, but it does bring with it other benefits. One of these benefits is an increase to the best achievable error exponent. In the first part of this thesis we revis ...
We consider source coding with a fidelity criterion, channel coding with a channel input constraint, and the combined problem of reproducing a source across a noisy channel. All three cases face a similar tradeoff between resource and performance, and the o ...
We consider the problem of optimizing the parameters of an arbitrary denoising algorithm by minimizing Stein's Unbiased Risk Estimate (SURE) which provides a means of assessing the true mean-squared-error (MSE) purely from the measured data assuming that i ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008
We consider the problem of optimizing the parameters of an arbitrary denoising algorithm by minimizing Stein's Unbiased Risk Estimate (SURE) which provides a means of assessing the true mean-squared-error (MSE) purely from the measured data assuming that i ...
A single memoryless Gaussian source is observed by many terminals, subject to independent Gaussian observation noises. The terminals are linked to a fusion center via a standard Gaussian multiple-access channel. The fusion center needs to recover the under ...
We investigate two closely related successive refinement (SR) coding problems: 1) In the hypothesis testing (HT) problem, bivariate hypothesis H-o : P-XY against H-1 : P-X P-Y, i.e., test against independence is considered. One remote sensor collects data ...
We consider the problem of optimizing the parameters of a given denoising algorithm for restoration of a signal corrupted by white Gaussian noise. To achieve this, we propose to minimize Stein's unbiased risk estimate (SURE) which provides a means of asses ...
A single memoryless Gaussian source is observed by many terminals, subject to independent Gaussian observation noises. The terminals are linked to a fusion center via a standard Gaussian multiple-access channel. The fusion center needs to recover the under ...
Institute of Electrical and Electronics Engineers2008
