Publications de Yann Barbotin | EPFL Graph Search

Sequences with Minimal Time-Frequency Uncertainty

Martin Vetterli, Yann Barbotin, Reza Parhizkar

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

Parametric estimation of sparse channels : theory and applications

Yann Barbotin

EPFL2014

Fast and robust estimation of jointly sparse channels

Martin Vetterli, Yann Barbotin, Ali Hormati

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, Yann Barbotin, Reza Parhizkar

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

Estimation of Sparse MIMO Channels with Common Support

Martin Vetterli, Yann Barbotin, Ali Hormati

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, Yann Barbotin, Ali Hormati

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

Fast and Robust Parametric Estimation of Jointly Sparse Channels

Martin Vetterli, Yann Barbotin

We consider the joint estimation of multipath channels obtained with a set of receiving antennas and uniformly probed in the frequency domain. This scenario fits most of the modern outdoor communication protocols for mobile access (ETSI Std. 125 913) or di ...

2012

Sampling of Sparse Channels with Common Support

Martin Vetterli, Yann Barbotin, Ali Hormati

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

Estimating Sparse MIMO Channels Having Common Support

Martin Vetterli, Yann Barbotin, Ali Hormati

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

Methods and apparatus for estimating a sparse channel

Martin Vetterli, Yann Barbotin, Ali Hormati

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

Equalization by the pulse shape inverse of the input to the FRI processing in pulse based communications

Yann Barbotin

Certain aspects of the present disclosure relate to a method for equalizing a pulse signal corrupted by a noise and by various channel effects for obtaining a signal based on the periodic-sinc pulse, which is suitable for Finite Rate of Innovation (FRI) pr ...

USPTO2010

Fast Computation of Polyharmonic B-Spline Autocorrelation Filters

Michaël Unser, Thierry Blu, Dimitri Nestor Alice Van De Ville, Yann Barbotin

A fast computational method is given for the Fourier transform of the polyharmonic B-spline autocorrelation sequence in d dimensions. The approximation error is exponentially decaying with the number of terms taken into account. The algorithm improves spee ...

IEEE Institute of Electrical and Electronics Engineers2008