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.
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 ...
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
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 ...
The integration of sample pretreatment into microfluidic devices represents one of the remaining hurdles towards achieving true miniaturized total analysis systems (μTAS). The challenge is made more complex by the enormous variation in samples to be analyz ...
This paper presents general methods for obtaining power spectra of a large class of signals and random fields driven by an underlying point processes, in particular spatial shot noises with random impulse response and arbitrary basic stationary point proce ...
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 ...
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 ...
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 ...
We present an explicit formula for spline kernels; these are defined as the convolution of several B-splines of variable widths h and degrees n. The spline kernels are useful for continuous signal processing algorithms that involve B-spline inner-products ...
We observe that the time required to compute the star discrepancy of a sequence of points in a multidimensional unit cube is prohibitive and that the best known upper bounds for the star discrepancy of (t,s)-sequences and (t,m,s)-nets are useful only for s ...
