Concept

Théorème de Shannon-Hartley

Publications associées (90)

Transmitters for chaos based communication: How chaotic is optimal?

In a systematic way, the impact of chaos present in transmitters for chaos based communications is discussed; based on arguments from information theory. Conditions for the optimality of communication systems involving chaos in the transmitter are develope ...

2002

Ergodic chaos shift keying for 2 users

Martin Hasler, Thomas Schimming

We show how a multiuser chaos-based communication system can be designed. The approach builds on the recently introduced method of ergodic chaos shift keying. This method uses a nonlinear correlation estimator for extracting the binary information from the ...

2001

Design of capacity-approaching irregular low-density parity-check codes

Rüdiger Urbanke, Mohammad Amin Shokrollahi

We design low-density parity-check (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the c ...

2001

Design of provably good low-density parity check codes

Rüdiger Urbanke, Mohammad Amin Shokrollahi

We design sequences of low-density parity check codes that provably perform at rates extremely close to the Shannon capacity. These codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. We further show ...

2000

Analysis of optimal filter banks for multiple description coding

Martin Vetterli, Pier Luigi Dragotti

We study the problem of multiple description (MD) coding of stationary Gaussian sources with memory. First, we compute an approximate rate distortion region for these sources, which we prove to be asymptotically tight at high rates: this region generalizes ...

2000

A spectral criterion for feedback coding

Michael Christoph Gastpar

This work considers the Gaussian channel with noiseless feedback and an average block or symbol energy constraint. For first-order Markov noise, the optimal form of the output power spectrum for the average symbol energy constraint is derived. A simple cod ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa1998

Approaching the AWGN Channel Capacity without Active Shaping

Rüdiger Urbanke, Bixio Rimoldi

It is shown that the capacity of the AWGN channel can be approached via a multilevel coding scheme with the output of each encoder mapped into an independent signal constellation. No active shaping is required in this scheme, regardless of the signal-to-no ...

1997

A rate-splitting approach to the Gaussian multiple-access channel

Rüdiger Urbanke, Bixio Rimoldi

It is shown that any point in the capacity region of a Gaussian multiple-access channel is achievable by single-user coding without requiring synchronization among users, provided that each user splits data and signal into two parts. Based on this result, ...

1996

Combining queueing theory with information theory for multiaccess

Emre Telatar

We develop and analyze a multiaccess communication model over the additive Gaussian noise channel. The framework is information-theoretic; nonetheless it also incorporates some queueing-theoretic aspects of the problem. ...

1995

New developments in the field of semiconductors lasers. II

René Salathé

For pt.I see ibid., vol.68, no.40 (1976). The theoretical bandwidth of 1014 hertz for optical laser communications is mentioned and contrasted with the present practical limit of 5 GHz. Glass fire properties are discussed in detail. Laser distance measurem ...

1977

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