Shannon–Hartley theorem

Applied sciences
Information engineering
Information theory
Channel capacity

About
Privacy
Disclaimer

Graph Chatbot

Related publications (28)

Optical Nyquist-pulse generation with a power difference to the ideal sinc-shape sequence of < 1%

Luc Thévenaz, Marcelo Alfonso Soto Hernandez, Camille Sophie Brès, Mohammad Amin Shoaie, Mohammad Mehdi Alem Karladani

Sinc-shaped Nyquist-pulses possess a rectangular spectrum. Thus, a sinc-pulse transmission minimizes the carrier spacing down to the baud rate, and therefore, substantially increases the transmissible data rates. These perspectives have led to a strong res ...

VDE Verlag GmbH2013

Windowed Decoding of Spatially Coupled Codes

Rüdiger Urbanke

Spatially coupled codes have been of interest recently owing to their superior performance over memoryless binary-input channels. The performance is good both asymptotically, since the belief propagation thresholds approach the Shannon limit, as well as fo ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Near-Nyquist optical pulse generation with fiber optical parametric amplification

Camille Sophie Brès, Mohammad Amin Shoaie

A novel method using optical fiber parametric amplification and phase modulation is proposed in order to generate Nyquist pulses. Using parabolic pulses as a pump, we show theoretically that it is possible to generate Nyquist pulses. Furthermore, we show t ...

Optical Society of America2012

Estimation of Sparse MIMO Channels with Common Support

Martin Vetterli, Ali Hormati, Yann Barbotin

We consider the problem of estimating sparse communication channels in the MIMO context. In small to medium bandwidth communications, as in the current standards for OFDM and CDMA communication systems (with bandwidth up to 20 MHz), such channels are indiv ...

2012

Simple schedules for half-duplex networks

Christina Fragouli, Siddhartha Brahma

We consider the diamond network where a source communicates with the destination through N non-interfering half-duplex relays. Deriving a simple approximation to the capacity of the network, we show that simple schedules having exactly two states and avoid ...

Ieee2012

A novel low complexity data demodulation algorithm for pulse position modulation

Pierre-André Farine, Cyril Botteron

In this paper, a low complexity data demodulation algorithm is proposed that requires time of arrival information of the received signal exclusively. As an application example, the algorithm is applied to an ultra-wideband impulse radio communication syste ...

2012

Approximation for Problems in Multi-User Information Theory

Soheil Mohajerzefreh

The main goal in network information theory is to identify fundamental limits of communication over networks, and design solutions which perform close to such limits. After several decades of effort, many important problems still do not have a characteriza ...

EPFL2010

Strategies for Delay-Limited Source-Channel Coding

Marius Kleiner

In point-to-point source-channel communication with a fidelity criterion and a transmission cost constraint, the region of achievable cost and fidelity pairs is completely characterized by Shannon's separation theorem. However, this is in general only true ...

EPFL2010

Page 2 of 2