Research on the fast Fourier transform of image based on GPU

2015/05/29 by Feifei Shen, Shen, Feifei, Zhenjian Song +7
Computer Science · Engineering · #Advanced Algorithms and Applications #Advanced Vision and Imaging #Image and Video Stabilization #cs.CV #cs.MS

paper · pdf · doi:10.48550/arxiv.1505.08019

arxiv created 2015/05/29 · arxiv updated 2015/06/01

Abstract

Study of general purpose computation by GPU (Graphics Processing Unit) can improve the image processing capability of micro-computer system. This paper studies the parallelism of the different stages of decimation in time radix 2 FFT algorithm, designs the butterfly and scramble kernels and implements 2D FFT on GPU. The experiment result demonstrates the validity and advantage over general CPU, especially in the condition of large input size. The approach can also be generalized to other transforms alike.

Related

• A GPU Based Memory Optimized Parallel Method For FFT Implementation
• Efficient FFT mapping on GPU for radar processing application: modeling and implementation
• Pipelined Parallel FFT Architecture
• Scalable Multi-node Fast Fourier Transform on GPUs
• Collaborative Acceleration for FFT on Commercial Processing-In-Memory Architectures