Publication

Low-Complexity Subspace Methods for Channel Estimation and Synchronization in Ultra-Wideband Systems

Publications associées (38)

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

High-Resolution Acquisition Methods for Wideband Communication Systems

Martin Vetterli, Irena Maravic

We consider the problem of low-complexity timing synchronization in digital receivers for DS-CDMA and UWB systems operating over channels with single or multiple propagation paths. We extend some of our recent sampling results for certain classes of non-ba ...

2003

Sampling With Finite Rate of Innovation: Channel and Timing Estimation for UWB and GPS

Martin Vetterli, Irena Maravic

Abstract—In this work, we consider the problem of channel estimation by using the recently developed theory for sampling of signals with a finite rate of innovation [1]. We show a framework which allows for lower than Nyquist rate sampling applicable ...

2003

Sampling signals with finite rate of innovation: the noisy case

Martin Vetterli, Andrea Ridolfi, Irena Maravic

Recently a sampling theorem for a certain class of signals with finite rate of innovation (which includes for example stream of Diracs) has been developed. In essence, such non band-limited signals can be sampled at or above the rate of innovation. In the ...

2002

Sampling of communications systems with bandwidth expansion

Martin Vetterli, Andrea Ridolfi

Many communication systems are {\em bandwidth-expanding}: the transmitted signal occupies a bandwidth larger than the {\em symbol rate}. The sampling theorems of Kotelnikov, Shannon, Nyquist et al. shows that in order to represent a bandlimited signal, it ...

2002

Sampling innovations

Pina Marziliano

Sampling theory has prospered extensively in the last century. The elegant mathematics and the vast number of applications are the reasons for its popularity. The applications involved in this thesis are in signal processing and communications and call out ...

EPFL2002

A sampling theorem for periodic piecewise polynomial signals

Martin Vetterli, Pina Marziliano, Thierry Blu

We consider the problem of sampling signals which are not bandlimited, but still have a finite number of degrees of freedom per unit of time, such as, for example, piecewise polynomials. We demonstrate that by using an adequate sampling kernel and a sampli ...

2001

On simple oversampled A/D conversion in L2(R)

Martin Vetterli

Accuracy of oversampled analog-to-digital (A/D) conversion, the dependence of accuracy on the sampling interval, t, and on the bit rate are characteristics fundamental to A/D conversion but not completely understood. These characteristics are studied in th ...

Institute of Electrical and Electronics Engineers2001

The commutativity of up- and down-sampling in two dimensions

Martin Vetterli

The authors state and prove a theorem solving the problem of commutativity in two dimensions. It is shown under which conditions upsampling and downsampling can be interchanged in two dimensions. This is the generalization to arbitrary two-dimensional latt ...

1991