Publication

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

Martin Hasler, Thomas Schimming
2002
Conference Papers

Abstract

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 considered throughout the paper is that of additive white Gaussian noise (AWGN). In particular, an example using the dyadic shift (Bernoulli shift) map is presented to illustrate the fact that the use chaotic piecewise linear maps has no systematic negative effect for digital communications applications.

Official source

https://infoscience.epfl.ch/entities/publication/1cab8b25-8bed-402a-ab52-49ce51637ac4

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Martin Hasler, Thomas Schimming
2002
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/1cab8b25-8bed-402a-ab52-49ce51637ac4

About this result

Related concepts (32)

Data communication

Data communication or digital communications, including data transmission and data reception, is the transfer and reception of data in the form of a digital bitstream or a digitized analog signal transmitted over a point-to-point or point-to-multipoint communication channel. Examples of such channels are copper wires, optical fibers, wireless communication using radio spectrum, storage media and computer buses. The data are represented as an electromagnetic signal, such as an electrical voltage, radiowave, microwave, or infrared signal.

Noisy-channel coding theorem

In information theory, the noisy-channel coding theorem (sometimes Shannon's theorem or Shannon's limit), establishes that for any given degree of noise contamination of a communication channel, it is possible to communicate discrete data (digital information) nearly error-free up to a computable maximum rate through the channel. This result was presented by Claude Shannon in 1948 and was based in part on earlier work and ideas of Harry Nyquist and Ralph Hartley.

Dyadic transformation

The dyadic transformation (also known as the dyadic map, bit shift map, 2x mod 1 map, Bernoulli map, doubling map or sawtooth map) is the mapping (i.e., recurrence relation) (where is the set of sequences from ) produced by the rule Equivalently, the dyadic transformation can also be defined as the iterated function map of the piecewise linear function The name bit shift map arises because, if the value of an iterate is written in binary notation, the next iterate is obtained by shifting the binary point one bit to the right, and if the bit to the left of the new binary point is a "one", replacing it with a zero.

Related publications (1)

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

Chat with Graph Search

On Network Correlated Data Gathering