Concept# Communication channel

Summary

A communication channel refers either to a physical transmission medium such as a wire, or to a logical connection over a multiplexed medium such as a radio channel in telecommunications and computer networking. A channel is used for information transfer of, for example, a digital bit stream, from one or several senders to one or several receivers. A channel has a certain capacity for transmitting information, often measured by its bandwidth in Hz or its data rate in bits per second.
Communicating an information signal across distance requires some form of pathway or medium. These pathways, called communication channels, use two types of media: Transmission line (e.g. twisted-pair, coaxial, and fiber-optic cable) and broadcast (e.g. microwave, satellite, radio, and infrared).
In information theory, a channel refers to a theoretical channel model with certain error characteristics. In this more general view, a storage device is also a communication channel, which can be sent to (wri

Official source

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.

Related publications

Loading

Related people

Loading

Related units

Loading

Related concepts

Loading

Related courses

Loading

Related lectures

Loading

Related publications (100)

Loading

Loading

Loading

Related people (53)

, , , , , , , , ,

Related concepts (90)

Radio

Radio is the technology of signaling and communicating using radio waves. Radio waves are electromagnetic waves of frequency between 3 hertz (Hz) and 3,000 gigahertz (GHz). They are genera

Telecommunications

Telecommunication, often used in its plural form, is the transmission of information by various types of technologies over wire, radio, optical, or other electromagnetic systems. It has its origin i

Modulation

In electronics and telecommunications, modulation is the process of varying one or more properties of a periodic waveform, called the carrier signal, with a separate signal called the modulation sign

Related courses (30)

MICRO-310(a): Signals and systems I (for MT)

Présentation des concepts et des outils de base pour la caractérisation des signaux ainsi que pour l'analyse et la synthèse des systèmes linéaires (filtres ou canaux de transmission). Application de ces techniques au traitement du signal et aux télécommunications.

COM-404: Information theory and coding

The mathematical principles of communication that govern the compression and transmission of data and the design of efficient methods of doing so.

COM-401: Cryptography and security

This course introduces the basics of cryptography. We review several types of cryptographic primitives, when it is safe to use them and how to select the appropriate security parameters. We detail how they work and sketch how they can be implemented.

Related units (28)

Shannon, in his landmark 1948 paper, developed a framework for characterizing the fundamental limits of information transmission. Among other results, he showed that reliable communication over a channel is possible at any rate below its capacity. In 2008, Arikan discovered polar codes; the only class of explicitly constructed low-complexity codes that achieve the capacity of any binary-input memoryless symmetric-output channel. Arikan's polar transform turns independent copies of a noisy channel into a collection of synthetic almost-noiseless and almost-useless channels. Polar codes are realized by sending data bits over the almost-noiseless channels and recovering them by using a low-complexity successive-cancellation (SC) decoder, at the receiver. In the first part of this thesis, we study polar codes for communications. When the underlying channel is an erasure channel, we show that almost all correlation coefficients between the erasure events of the synthetic channels decay rapidly. Hence, the sum of the erasure probabilities of the information-carrying channels is a tight estimate of the block-error probability of polar codes when used for communication over the erasure channel. We study SC list (SCL) decoding, a method for boosting the performance of short polar codes. We prove that the method has a numerically stable formulation in log-likelihood ratios. In hardware, this formulation increases the decoding throughput by 53% and reduces the decoder's size about 33%. We present empirical results on the trade-off between the length of the CRC and the performance gains in a CRC-aided version of the list decoder. We also make numerical comparisons of the performance of long polar codes under SC decoding with that of short polar codes under SCL decoding. Shannon's framework also quantifies the secrecy of communications. Wyner, in 1975, proposed a model for communications in the presence of an eavesdropper. It was shown that, at rates below the secrecy capacity, there exist reliable communication schemes in which the amount of information leaked to the eavesdropper decays exponentially in the block-length of the code. In the second part of this thesis, we study the rate of this decay. We derive the exact exponential decay rate of the ensemble-average of the information leaked to the eavesdropper in Wyner's model when a randomly constructed code is used for secure communications. For codes sampled from the ensemble of i.i.d. random codes, we show that the previously known lower bound to the exponent is exact. Our ensemble-optimal exponent for random constant-composition codes improves the lower bound extant in the literature. Finally, we show that random linear codes have the same secrecy power as i.i.d. random codes. The key to securing messages against an eavesdropper is to exploit the randomness of her communication channel so that the statistics of her observation resembles that of a pure noise process for any sent message. We study the effect of feedback on this approximation and show that it does not reduce the minimum entropy rate required to approximate a given process. However, we give examples where variable-length schemes achieve much larger exponents in this approximation in the presence of feedback than the exponents in systems without feedback. Upper-bounding the best exponent that block codes attain, we conclude that variable-length coding is necessary for achieving the improved exponents.

Related lectures (45)

Nowadays, a wide variety of terminals are proposed to nomadic users. Generally these terminals provide wireless communication operating at frequencies between one and a few GHz. For technical reasons, including multiple access to the communication channel and battery autonomy, these terminals transmit only during very short periods i.e. transmission bursts. For a direct observation of certain characteristics of the transmitted signals radiated by such terminals, only a few measurement setups exist. This article proposes such a novel real-time 3D electromagnetic field measurement instrument with direct visualization. The prototype used for validation is based on an array of probes regularly attached on a non-conductive rigid loop which is put into fast rotation around the terminal under test. To cite this article: J. Rioult et al., C. R. Physique 10 (2009). (C) 2008 Academie des sciences. Published by Elsevier Masson SAS. All rights reserved.

Network information theory explores the fundamental data transport limits over communication networks. Broadcasting and relaying are two natural models arising in communication contexts where multiple users share a common communication medium. Number of relay and broadcasting models are considered in this thesis. We first collect the existing methodologies of communication over a discrete memoryless relay channel. A new communication strategy over this channel is also proposed, which achieves the same data-rates as the best known schemes in literature, incurring a lower delay at the same time. We then consider the Gaussian broadcast channel (GBC), and show that its capacity region is enlarged by the availability of feedback, even if the feedback is from only one of the receivers. We further show a low complexity, explicit capacity achieving strategy over a GBC with degraded receivers. A combination of relay and broadcast models, called the relay-broadcast channel (RBC) is analyzed next. Achievable regions are proposed for different RBC scenarios. For the Gaussian version of an RBC, we characterize the complete capacity region when the receivers are degraded with respect to the relay. The final part of this thesis investigates communication over fading channels. We propose upper bounds for non-coherent, as well as lower bounds for coherent communication over a MIMO fading channel.