Publications by Yann Barbotin | EPFL Graph Search

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Sequences with Minimal Time-Frequency Uncertainty

Martin Vetterli, Reza Parhizkar, Yann Barbotin

A central problem in signal processing and communications is to design signals that are compact both in time and frequency. Heisenberg's uncertainty principle states that a given function cannot be arbitrarily compact both in time and frequency, defining a ...

Elsevier2015

Fast and robust estimation of jointly sparse channels

Martin Vetterli, Ali Hormati, Yann Barbotin

A device and method for estimating multipath jointly sparse channels. The method comprises receiving a number K of signal components by a number P of receiving antennas, where P≧2. The method further comprises estimating the sparsity condition of the multi ...

2013

Sequences with Minimal Time-Frequency Spreads

Martin Vetterli, Reza Parhizkar, Yann Barbotin

For a given time or frequency spread, one can always find continuous- time signals, which achieve the Heisenberg uncertainty principle bound. This is known, however, not to be the case for discrete-time sequences; only widely spread sequences asymptoticall ...

Ieee2013

ESTIMATING SPARSE MIMO CHANNELS HAVING COMMON SUPPORT

Martin Vetterli, Ali Hormati, Yann Barbotin

According to a first aspect of the present invention there is provided a method of estimating, jointly, a set of multipath channels having a common path support, the method comprising the steps of, estimating jointly the common path support of the set of m ...

USPTO2012

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

Estimating Sparse MIMO Channels Having Common Support

Martin Vetterli, Ali Hormati, Yann Barbotin

We propose an algorithm (SCS-FRI) to estimate multipath channels with Sparse Common Support (SCS) based on Finite Rate of Inno- vation (FRI) sampling. In this setup, theoretical lower-bounds are derived, and simulation in a Rayleigh fading environment show ...

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

Sampling of Sparse Channels with Common Support

Martin Vetterli, Ali Hormati, Yann Barbotin

The present paper proposes and studies an algorithm to estimate chan- nels with a sparse common support (SCS). It is a generalization of the classical sampling of signals with Finite Rate of Innovation (FRI) and thus called SCS-FRI. It is applicable to OFD ...

2011

Methods and apparatus for estimating a sparse channel

Martin Vetterli, Ali Hormati, Yann Barbotin

Embodiments include a method for sending a selected number of pilots (20) to a sparse channel having a channel impulse response limited in time comprising sending the selected number of the pilots (20). The pilots (20) are equally spaced in the frequency d ...

USPTO2011

Yann Barbotin

Graph Chatbot

Chat with Graph Search

Sequences with Minimal Time-Frequency Uncertainty

Fast and robust estimation of jointly sparse channels

Sequences with Minimal Time-Frequency Spreads

ESTIMATING SPARSE MIMO CHANNELS HAVING COMMON SUPPORT

Fast and Robust Parametric Estimation of Jointly Sparse Channels

Estimation of Sparse MIMO Channels with Common Support

Estimating Sparse MIMO Channels Having Common Support

Sampling of Sparse Channels with Common Support

Methods and apparatus for estimating a sparse channel

FINITE RATE OF INNOVATION (FRI) TECHNIQUES FOR LOW POWER BODY AREA NETWORK

Sequences with Minimal Time-Frequency Uncertainty

Estimating Sparse MIMO Channels Having Common Support

Sampling of Sparse Channels with Common Support

Sequences with Minimal Time-Frequency Spreads

Fast and robust estimation of jointly sparse channels

ESTIMATING SPARSE MIMO CHANNELS HAVING COMMON SUPPORT

Fast and Robust Parametric Estimation of Jointly Sparse Channels

Estimation of Sparse MIMO Channels with Common Support

FINITE RATE OF INNOVATION (FRI) TECHNIQUES FOR LOW POWER BODY AREA NETWORK

Methods and apparatus for estimating a sparse channel