1 research outputs found
The 2D Tree Sliding Window Discrete Fourier Transform
We present a new algorithm for the 2D Sliding Window Discrete Fourier
Transform (SWDFT). Our algorithm avoids repeating calculations in overlapping
windows by storing them in a tree data-structure based on the ideas of the
Cooley- Tukey Fast Fourier Transform (FFT). For an array and
windows, our algorithm takes operations.
We provide a C implementation of our algorithm for the Radix-2 case, compare
ours with existing algorithms, and show how our algorithm easily extends to
higher dimensions.Comment: 15 pages, 4 figures, submitted to ACM TOM