Research on the fast Fourier transform of image based on GPU
This work provides a faster method for image processing tasks on micro-computer systems, but it is incremental as it applies an existing GPU parallelization approach to a standard FFT algorithm.
This paper tackled the problem of accelerating image processing by implementing a 2D Fast Fourier Transform (FFT) algorithm on a GPU, achieving improved performance over CPUs especially for large input sizes.
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.