Publications related to Shannon–Hartley theorem

On the (Im)possibility of Commitment over Gaussian Unfair Noisy Channels

Commitment is a key primitive which resides at the heart of several cryptographic protocols. Noisy channels can help realize information-theoretically secure commitment schemes; however, their imprecise statistical characterization can severely impair such ...

2023

On the Advantage of Coherent LoRa Detection in the Presence of Interference

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Orion Afisiadis, Joachim Tobias Tapparel, Sitian Li

It has been shown that the coherent detection of long range (LoRa) signals only provides marginal gains of around 0.7 dB on the additive white Gaussian noise (AWGN) channel. However, ALOHA-based massive Internet-of-Things systems, including LoRa, often ope ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Modified Joint Channel-and-Data Estimation for One-Bit Massive MIMO

Saeed Saadatnejad, Mohammadhossein Bahari, Mahdi Amiri

Centralized and cloud computing-based network architectures are the promising tracks of future communication systems where a large scale compute power can be virtualized for various algorithms. These architectures rely on high-performance communication lin ...

IEEE2021

Differential Entropy of the Conditional Expectation under Gaussian Noise

Michael Christoph Gastpar, Alper Köse, Ahmet Arda Atalik

This paper considers an additive Gaussian noise channel with arbitrarily distributed finite variance input signals. It studies the differential entropy of the minimum mean-square error (MMSE) estimator and provides a new lower bound which connects the diff ...

IEEE2021

An Event-Based System for Low-Power ECG QRS Complex Detection

David Atienza Alonso, Tomas Teijeiro Campo, Silvio Zanoli, Fabio Montagna

One of the greatest challenges in the design of modern wearable devices is energy efficiency. While data processing and communication have received a lot of attention from the industry and academia, leading to highly efficient microcontrollers and transmis ...

IEEE2020

On the Error Rate of the LoRa Modulation With Interference

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Orion Afisiadis, Matthieu Cotting

LoRa is a chirp spread-spectrum modulation developed for the Internet of Things (IoT). In this work, we examine the performance of LoRa in the presence of both additive white Gaussian noise and interference from another LoRa user. To this end, we extend an ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Bits through Time

Elie Najm

In any communication system, there exist two dimensions through which the information at the source becomes distorted before reaching the destination: the noisy channel and time. Messages transmitted through a noisy channel are susceptible to modification ...

EPFL2019

Gaussian channel transmission of images and audio files using cryptcoding

Vladimir Ilievski

Random codes based on quasigroups (RCBQ) are cryptcodes, i.e. they are error-correcting codes, which provide information security. Cut-Decoding and 4-Sets-Cut-Decoding algorithms for these codes are defined elsewhere. Also, the performance of these codes f ...

2019

Reed-Muller codes polarize

Emmanuel Abbé, Min Ye

Reed-Muller (RM) codes were introduced in 1954 and have long been conjectured to achieve Shannon's capacity on symmetric channels. The activity on this conjecture has recently been revived with the emergence of polar codes. RM codes and polar codes are gen ...

IEEE COMPUTER SOC2019

Characterizations of Two Channel Orderings: Input-Degradedness and the Shannon Ordering

Rajai Nasser

The ordering of communication channels was first introduced by Shannon. In this paper, we aim to find characterizations of two orderings: input-degradedness and the Shannon ordering. A channel W is said to be input-degraded from another channel W' if W can ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2018

High-Dimensional Inference on Dense Graphs with Applications to Coding Theory and Machine Learning

Mohamad Baker Dia

We are living in the era of "Big Data", an era characterized by a voluminous amount of available data. Such amount is mainly due to the continuing advances in the computational capabilities for capturing, storing, transmitting and processing data. However, ...

EPFL2018

Overcoming the time-bandwidth limit

Camille Sophie Brès, Davide Grassani, Simon Julien Fabbri, Ivan Cardea, Kosmas Tsakmakidis

We are so accustomed to the time-bandwidth limit that we often take it to be a fundamental relation that cannot be overcome. Contrary to this belief we here propose that the storage/delay time of a system can in fact be decoupled from the operating bandwid ...

IEEE2018

Polarization and Channel Ordering: Characterizations and Topological Structures

Rajai Nasser

Information theory is the field in which we study the fundamental limitations of communication. Shannon proved in 1948 that there exists a maximum rate, called capacity, at which we can reliably communicate information through a given channel. However, Sha ...

EPFL2017

A Cryogenic 1 GSa/s, Soft-Core FPGA ADC for Quantum Computing Applications

Edoardo Charbon, Harald Arjan Robert Homulle

We propose an analog-to-digital converter (ADC) architecture, implemented in an FPGA, that is fully reconfigurable and easy to calibrate. This approach allows to alter the design, according to the system requirements, with simple modifications in the firmw ...

2016

From Polar to Reed-Muller Codes : Unified Scaling, Non-standard Channels, and a Proven Conjecture

Marco Mondelli

The year 2016, in which I am writing these words, marks the centenary of Claude Shannon, the father of information theory. In his landmark 1948 paper "A Mathematical Theory of Communication", Shannon established the largest rate at which reliable communica ...

EPFL2016

Robustness of classifiers: from adversarial to random noise

Pascal Frossard, Seyed Mohsen Moosavi Dezfooli, Alhussein Fawzi

Several recent works have shown that state-of-the-art classifiers are vulnerable to worst-case (i.e., adversarial) perturbations of the datapoints. On the other hand, it has been empirically observed that these same classifiers are relatively robust to ran ...

2016

On lattice codes for Gaussian interference channels

Michael Christoph Gastpar, Jingge Zhu

The usefulness of lattice codes is investigated for two-user Gaussian interference channels (IC). A coding scheme based on the compute-and-forward technique is shown to achieve the capacity region of the Gaussian IC under strong interference. The proposed ...

2015

Integer-forcing Linear Receivers

Michael Christoph Gastpar

Linear receivers are often used to reduce the implementation complexity of multiple-antenna systems. In a traditional linear receiver architecture, the receive antennas are used to separate out the codewords sent by each transmit antenna, which can then be ...

Institute of Electrical and Electronics Engineers2014

EXIT-based Side Information Refinement in Wyner-Ziv Video Coding

Pascal Frossard, Yiqiang Chen

The accuracy of the side information (SI) is critical in the performance of distributed video coding algorithms. The SI is typically built at a decoder based on the reconstructed data and on channel coding parity bits transmitted by the encoder. The optima ...

Institute of Electrical and Electronics Engineers2014

Multiuser Broadcast Erasure Channel With Feedback-Capacity and Algorithms

We consider the N-user broadcast erasure channel with unicast sessions (one for each user) where receiver feedback is regularly sent to the transmitter in the form of ACK/NACK messages. We first provide a generic outer bound to the capacity of this system; ...

Institute of Electrical and Electronics Engineers2013