Analysis of Fast Fourier Transformations algorithm for CUDA Architecture
Articles
Beatričė Andziulienė
Klaipėdos universitetas
Evaldas Žulkas
Klaipėdos universitetas
Audrius Kuprinavičius
Klaipėdos universitetas
Published 2012-12-20
https://doi.org/10.15388/LMR.B.2012.46
PDF

Keywords

FFT
general purpose GPU algorithms
CUDA

How to Cite

Andziulienė B., Žulkas E. and Kuprinavičius A. (2012) “Analysis of Fast Fourier Transformations algorithm for CUDA Architecture”, Lietuvos matematikos rinkinys, 53(B), pp. 254–259. doi: 10.15388/LMR.B.2012.46.

Abstract

In this work Fast Fourier transformation algorithm for general purpose graphics processing unit processing (GPGPU) is discussed. Algorithm structure and individual stages performance were analysed. With performance analysis method algorithm distribution and data allocation possibilities were determined, depending on algorithm stages execution speed and algorithm structure. Ratio between CPU and GPU execution during Fast Fourier transform signal processing was determined using computer-generated data with frequency. When adopting CPU code for CUDA execution, it not becomes more complex, even if stream procesor parallelization and data transfering algorith stages are considered. But central processing unit serial execution).

PDF
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Please read the Copyright Notice in Journal Policy