Share Email Print
cover

Proceedings Paper

A novel sliding window algorithm for 2D discrete Fourier transform
Author(s): Zhifang Dong; Jiasong Wu; Jiyong Gui
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 14 December 2015
PDF: 6 pages
Proc. SPIE 9814, MIPPR 2015: Parallel Processing of Images and Optimization; and Medical Imaging Processing, 981406 (14 December 2015); doi: 10.1117/12.2209014
Show Author Affiliations
Zhifang Dong, Southeast Univ. (China)
Jiasong Wu, Southeast Univ. (China)
Jiyong Gui, Southeast Univ. (China)


Published in SPIE Proceedings Vol. 9814:
MIPPR 2015: Parallel Processing of Images and Optimization; and Medical Imaging Processing
Jianguo Liu, Editor(s)

© SPIE. Terms of Use
Back to Top