计算机应用与软件2017，Vol.34Issue(3)：233-237,283,6.DOI:10.3969/j.issn.1000-386x.2017.03.042
基于OpenCL的FFT算法研究
RESEARCH ON FFT ALGORITHM BASED ON OPENCL
贾格 1彭先蓉 2左颢睿1
作者信息
- 1. 中国科学院光电技术研究所 四川 成都 610209
- 2. 中国科学院大学 北京 100039
- 折叠
摘要
Abstract
Fast Fourier transform, as a commonly used computational tool in the field of image processing, especially in image restoration algorithm, transforms the time-domain computation into frequency-domain computation and has great significance for engineering applications.By adopting thread blocks and parallel mapping method, we can make FFT algorithm reach the maximum degree of parallelism.In view of the storage features of OpenCL and the optimisation of the algorithm, the AMD GPU platform has been significantly accelerated.Compared with CPU platform and CUDA with the same processing capability, the performance of the optimised algorithm has increased by 7 times and 4 times respectively.关键词
傅里叶变换/OpenCL/GPU/并行加速Key words
Fast Fourier transform/OpenCL/GPU/Parallel speedup分类
信息技术与安全科学引用本文复制引用
贾格,彭先蓉,左颢睿..基于OpenCL的FFT算法研究[J].计算机应用与软件,2017,34(3):233-237,283,6.
