
Analysis of Fast Fourier Transformations algorithm for CUDA Architecture
Author(s) -
Beatričė Andziulienė,
Evaldas Žulkas,
Audrius Kuprinavičius
Publication year - 2012
Publication title -
lietuvos matematikos rinkinys
Language(s) - English
Resource type - Journals
eISSN - 2335-898X
pISSN - 0132-2818
DOI - 10.15388/lmr.b.2012.46
Subject(s) - cuda , computer science , parallel computing , fast fourier transform , algorithm , graphics processing unit , central processing unit , graphics , fourier transform , transformation (genetics) , general purpose computing on graphics processing units , signal processing , computational science , digital signal processing , computer graphics (images) , computer hardware , mathematics , mathematical analysis , biochemistry , chemistry , gene
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).