Translator Disclaimer
14 December 2015 A novel sliding window algorithm for 2D discrete Fourier transform
Author Affiliations +
Proceedings Volume 9814, MIPPR 2015: Parallel Processing of Images and Optimization; and Medical Imaging Processing; 981406 (2015) https://doi.org/10.1117/12.2209014
Event: Ninth International Symposium on Multispectral Image Processing and Pattern Recognition (MIPPR2015), 2015, Enshi, China
Abstract
Discrete Fourier transform (DFT) is one of the most wildly used tools for signal processing. In this paper, a novel sliding window algorithm is presented for fast computing 2D DFT when sliding window shifts more than one-point. The propose algorithm computing the DFT of the current window using that of the previous window. For fast computation, we take advantage of the recursive process of 2D SDFT and butterfly-based algorithm. So it can be directly applied to 2D signal processing. The theoretical analysis shows that the computational complexity is equal to 2D SDFT when one sample comes into current window. As well, the number of additions and multiplications of our proposed algorithm are less than those of 2D vector radix FFT when sliding window shifts mutiple-point.
© (2015) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Zhifang Dong, Jiasong Wu, and Jiyong Gui "A novel sliding window algorithm for 2D discrete Fourier transform", Proc. SPIE 9814, MIPPR 2015: Parallel Processing of Images and Optimization; and Medical Imaging Processing, 981406 (14 December 2015); https://doi.org/10.1117/12.2209014
PROCEEDINGS
6 PAGES


SHARE
Advertisement
Advertisement
Back to Top