Generalized Sampling: Stability and Performance Analysis
Graph Chatbot
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.
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 ...
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 ...
Reconstruction method for reconstructing a first signal (x(t)) regularly sampled at a sub-Nyquist rate, comprising the step of retrieving from the regularly spaced sampled values (ys[n], y(nT)) a set of weights (cn, cnr, ck) and shifts (tn, tk) with which ...
This paper provides a time-domain feedback analysis of the robustness performance of Gauss-Newton recursive methods that are often used in identification and control. These are recursive estimators that also involve updates of sample covariance matrices. S ...
We consider the problem of reconstructing a multidimensional and multivariate function ƒ: ℜm \rightarrow ℜn from the discretely and irregularly sampled responses of q linear shift-invariant filters. Unlike traditional approaches which r ...
We consider the problem of the reconstruction of a continuous-time function f(x) ∈ H from the samples of the responses of m linear shift-invariant systems sampled at 1 ⁄ m the reconstruction rate. We extend Papoulis' generalized sampling theory in two impo ...
Consider classes of signals that have a finite number of degrees of freedom per unit of time and call this number the rate of innovation. Examples of signals with a finite rate of innovation include streams of Diracs (e.g., the Poisson process), nonuniform ...
Institute of Electrical and Electronics Engineers2002
This paper presents an account of the current state of sampling, 50 years after Shannon's formulation of the sampling theorem. The emphasis is on regular sampling where the grid is uniform. This topic has benefited from a strong research revival during the ...
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 ...
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 ...
