Descripción
|
|
---|---|
We consider the problem of approximating a regular function f(t) from its samples, f(nT), taken in a uniform grid. Quasi-interpolation schemes approximate f(t) with a dilated version of a linear combination of shifted versions of a kernel G(t), specifically f_aprox(t)=\sum a_f[n]G(t/T-n), in a way that the polynomials of degree at most L-1 are recovered exactly. These approximation schemes give order L, i.e., the error is O(T^L) where T is the sampling period. Recently, quasi-interpolation schemes using a discrete prefiltering of the samples f(nT) to obtain the coefficients a_f[n], have been proposed. They provide tight approximation with a low computational cost. In this work, we generalize considering rational filter banks to prefilter the samples, instead of a simple filter. This generalization provides a greater flexibility in the design of the approximation scheme. The upsampling and downsampling ratio r of the rational filter bank, plays a significant role. When r=1 the scheme has similar characteristics to those related to a simple filter. Approximation schemes corresponding to smaller ratios, give less approximation quality but, in return, they have less computational cost and involve less storage load in the system. | |
Internacional
|
Si |
JCR del ISI
|
Si |
Título de la revista
|
IEEE TRANSACTIONS ON SIGNAL PROCESSING |
ISSN
|
1053-587X |
Factor de impacto JCR
|
2,212 |
Información de impacto
|
|
Volumen
|
58 |
DOI
|
10.1109/TSP.2009.2037063 |
Número de revista
|
3 |
Desde la página
|
1628 |
Hasta la página
|
1637 |
Mes
|
FEBRERO |
Ranking
|