Publication

Approximately achieving Gaussian relay network capacity with lattice codes

Publications associées (32)

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.

Connectez-vous pour utiliser Chat avec Graph Search

The Kaspi Rate-Distortion Problem with Encoder Side-Information: Gaussian Case

Emre Telatar, Suhas Diggavi, Etienne Perron

We consider the problem of compressing a Gaussian source for two decoders, one of which has access to side-information. Kaspi has solved this problem for discrete memoryless sources for the two cases with and without encoder side-information. We focus on t ...

2005

Joint source-channel coding with feedback

Communications is about conveying information from one point to another subject to certain performance constraints. The information is assumed to be generated by a source and may, for example, represent a voice waveform, the reading of a thermal sensor, or ...

EPFL2005

Rayleigh Fading Multiple Access Channel without Channel State Information

Ninoslav Marina

In this paper we determine bounds of the capacity region of a two-user multiple-access channel with Rayleigh fading when neither the transmitters nor the receiver has channel state information (CSI). We assume that the fading coefficients as well as the ad ...

2004

RAYLEIGH FADING MULTIPLE ACCESS CHANNEL WITHOUT CHANNEL STATE INFORMATION

Ninoslav Marina

2004

Potential of chaos communication over noisy channels - Channel coding using chaotic piecewise linear maps

Martin Hasler, Thomas Schimming

The paper gives an information theoretic analysis of the potential of chaos in digital communication schemes, underlining that there is no fundamental principle that speaks against the use of chaotic systems in digital communications. The channel model con ...

2002

Optimal and suboptimal chaos receivers

Martin Hasler, Thomas Schimming

The paper describes the state of the art in the design of receivers for chaos based digital communication over noisy channels. In the first part, an information theoretic analysis of the potential of chaos in digital communication schemes is given, underli ...

2002

To code or not to code

Michael Christoph Gastpar

It is well known and surprising that the uncoded transmission of an independent and identically distributed Gaussian source across an additive white Gaussian noise channel is optimal: No amount of sophistication in the coding strategy can ever perform bett ...

EPFL2002

Wavelet footprints and frames for signal processing and communication

Pier Luigi Dragotti

Linear transforms and expansions are fundamental mathematical tools of signal processing. In particular, the wavelet transform has played an important role in several signal processing tasks, compression being a prime example. A signal can be represented i ...

EPFL2002

To Code, Or Not To Code: On the Optimality of Symbol-by-Symbol Communication

Martin Vetterli, Michael Christoph Gastpar, Bixio Rimoldi

When is uncoded transmission optimal? This paper derives easy-to-check necessary and sufficient conditions that do not require finding the rate-distortion and the capacity-cost functions. We consider the symbol-by-symbol communication of discrete-time memo ...

2001

Capacity and mutual information of wideband multipath fading channels

Emre Telatar

We investigate the capacity and mutual information of a broadband fading channel consisting of a finite number of time-varying paths. We show that the capacity of the channel in the wideband limit is the same as that of a wideband Gaussian channel with the ...

2000