Publications associées à Entropy rate

A 3.3-Gb/s SPAD-Based Quantum Random Number Generator

Edoardo Charbon, Pouyan Keshavarzian, Francesco Gramuglia, Mario Stipcevic

Quantum random number generators (QRNGs) are a burgeoning technology used for a variety of applications, including modern security and encryption systems. Typical methods exploit an entropy source combined with an extraction or bit generation circuit in or ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

A New Entropy Power Inequality for Integer-Valued Random Variables

Emmanuel Abbé, Saeid Haghighatshoar

The entropy power inequality (EPI) yields lower bounds on the differential entropy of the sum of two independent real-valued random variables in terms of the individual entropies. Versions of the EPI for discrete random variables have been obtained for spe ...

Institute of Electrical and Electronics Engineers2014

Real-time Prediction of Fast and Slow Delivery of Mental Commands in a Motor Imagery BCI: An Entropy-based Approach

José del Rocio Millán Ruiz, Michael Christoph Gastpar, Ricardo Andres Chavarriaga Lozano, Sareh Saeedi

Providing adaptive shared control for Brain- Computer Interfaces (BCIs) can result in better performance while reducing the user’s mental workload. In this respect, online estimation of accuracy and speed of command delivery are important factors. This stu ...

2012

Entropy in the Coil-to-Globule Transition of Macromolecules : Insights from Simple Models

Carlo Maffi

The coil to globule transition is a fundamental phenomenon in the physics of macro-molecules by reason of the multiplicity of arrangements of their conformation. Such conformational freedom is the main source of entropy in the molecule and is the main oppo ...

EPFL2012

Network simplification: the Gaussian diamond network with Multiple Antennas

Christina Fragouli, Ayfer Özgür Aydin, Javad Ebrahimi Boroojeni

We consider the N-relay Gaussian diamond network when the source and the destination have ns ≥ 2 and nd ≥ 2 antennas respectively. We show that when ns = nd = 2 and when the individual MISO channels from the source to each relay and the SIMO channels from ...

2011

Finite Block-Length Achievable Rates for Queuing Timing Channels

Thomas Riedl

The exponential server timing channel is known to be the simplest, and in some sense canonical, queuing timing channel. The capacity of this infinite-memory channel is known. Here, we discuss practical finite-length restrictions on the codewords and attemp ...

2011

Polar Coding Theorems for Discrete Systems

Eren Sasoglu

Polar coding is a recently invented technique for communication over binary-input memoryless channels. This technique allows one to transmit data at rates close to the symmetric-capacity of such channels with arbitrarily high reliability, using low-complex ...

EPFL2011

Successive refinement for hypothesis testing and lossless one-helper problem

Jun Chen

We investigate two closely related successive refinement (SR) coding problems: 1) In the hypothesis testing (HT) problem, bivariate hypothesis H-o : P-XY against H-1 : P-X P-Y, i.e., test against independence is considered. One remote sensor collects data ...

2008

Proof of replica formulas in the high noise regime for communication using LDGM codes

Nicolas Macris, Shrinivas Kudekar

We consider communication over a binary input memoryless output symmetric channel with low density generator matrix codes and optimal maximum a posteriori decoding. It is known that the problem of computing the average conditional entropy, over such code e ...

2008

Exact solution for the conditional entropy of Poissonian LDPC codes over the Binary Erasure Channel

Nicolas Macris, Shrinivas Kudekar, Satish Babu Korada

We consider communication over a binary erasure channel with low density parity check codes and optimal maximum a posteriori decoding. It is known that the problem of computing the average conditional entropy, over such code ensembles, in the asymptotic li ...

2007

Hypothesis testing under successive refinement communication constraints

Jun Chen

We investigate the distributed successive refinement (SR) hypothesis testing problem. Bivariate hypothesis H-0 : P-XY against H-1 : PXPY, i.e., test against independence is considered, when a remote sensor sends compressed information about data stream X s ...

Ieee Service Center2007

A Stochastic Model for Video and its Information Rates

Martin Vetterli, Minh Do

We propose a stochastic model for video and compute its information rates. The model has two sources of information representing ensembles of camera motion and visual scene data (i.e. "realities"). The sources of information are combined generating a vecto ...

2007