5 search results - page 1 / 1 » Fast convolution and Fast Fourier Transform under interval a... |
JCSS
2010
13 years 3 months ago
2010
Convolution y(t) = a(t − s) · x(s) ds is one of the main techniques in digital signal processing. A straightforward computation of the convolution y(t) requires O(n2) steps, wh...
IV
2006
IEEE
13 years 10 months ago
2006
IEEE
Many contemporary visualization tools comprise some image filtering approach. Since image filtering approaches are very computationally demanding, the acceleration using graphic...
SIAMSC
2010
12 years 11 months ago
2010
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
ARITH
2003
IEEE
13 years 10 months ago
2003
IEEE
This paper introduces the Interval Logarithmic Number System (ILNS), in which the Logarithmic Number System (LNS) is used as the underlying number system for interval arithmetic. ...
SIAMAM
2010
13 years 3 months ago
2010
We address the stochastic characteristics of a recently-proposed greedy routing scheme. The stochastic behaviour of individual hop advancements is examined to observe the overall ...