Concept

Nyquist rate

Publications associées (148)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Lossy Source Coding with Gaussian or Erased Side-Information

Emre Telatar, Suhas Diggavi, Etienne Perron

In this paper we find properties that are shared between two seemingly unrelated lossy source coding setups with side information. The first setup is when the source and side information are jointly Gaussian and the distortion measure is quadratic. The sec ...

2009

Lossy Source Coding with Gaussian or Erased Side-Information

Emre Telatar, Suhas Diggavi, Etienne Perron

In this paper we find properties that are shared between two seemingly unrelated lossy source coding setups with side-information. The first setup is when the source and side-information are jointly Gaussian and the distortion measure is quadratic. The sec ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Polar Codes are Optimal for Lossy Source Coding

Rüdiger Urbanke, Satish Babu Korada

We consider lossy source compression of a binary symmetric source with Hamming distortion function. We show that polar codes combined with a low-complexity successive cancellation encoding algorithm achieve the rate-distortion bound. The complexity of both ...

2009

Real-time MPC - Stability through robust MPC design

Colin Neil Jones, Melanie Nicole Zeilinger

Recent results have suggested that online Model Predictive Control (MPC) can be computed quickly enough to control fast sampled systems. High-speed applications impose a hard real-time constraint on the solution of the MPC problem, which generally prevents ...

IEEE2009

Lower Bounds on the Rate-Distortion Function of Individual LDGM Codes

Rüdiger Urbanke, Shrinivas Kudekar

We consider lossy compression of a binary symmetric source by means of a low-density generator-matrix code. We derive two lower bounds on the rate distortion function which are valid for any low-density generator-matrix code with a given node degree distri ...

2008

Compressive Sensing for Background Subtraction

Volkan Cevher

Compressive sensing (CS) is an emerging field that provides a framework for image recovery using sub-Nyquist sampling rates. The CS theory shows that a signal can be reconstructed from a small set of random projections, provided that the signal is sparse i ...

2008

Estimating Physical Parameters in a Diffusive Field

Reza Parhizkar

In the recent researches, some methods have been proposed for interpolating the diffusive field values along space, but they either do not use point-wise sampling or deploy large number of sensors in space to keep themselves near Niquist’s sampling rate. I ...

2008

Analysis of Error Propagation Due to Frame Losses in a Distributed Video Coding System

Thomas Maugey

In this paper, we propose a theoretical model for the error propagation phenomenon generated by a frame loss in a distributed video coding framework. Using rate-distortion functions, we analyze the impact of a frame loss on the average distortion of a grou ...

2008

A Low-Rate Identification Method for Digital Predistorters Based on Volterra Kernel Interpolation

A novel identification and digital predistortion scheme of weakly nonlinear passband systems such as RF power amplifiers (PA) is presented. It is well known that for the identification of weakly nonlinear systems, despite the spectral regrowth, it suffices ...

2007

Separation theorems and partial orderings for sensor network problems

Michael Christoph Gastpar

In the absence of complexity and delay constraints, the quality of a noisy communication channel can be characterized by a single number, called its capacity and usually measured in bits. Shannon [1] showed that this number is universal in the sense that v ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007