Glance on Parallelization of FFT Algorithms
This paper implores the parallelization of Fast Fourier Transform (FFT) algorithms and evaluates the resultant parallelized source codes. The FFT algorithm is considered to be among the most important algorithms in the digital era. There are various FFT algorithms but just a few are considered in th...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2019-03-01
|
| Series: | Revista Academiei Forţelor Terestre |
| Subjects: | |
| Online Access: | https://doi.org/10.2478/raft-2019-0009 |
| id |
doaj-64b76fdddc684153a01d6a6df52307de |
|---|---|
| record_format |
Article |
| spelling |
doaj-64b76fdddc684153a01d6a6df52307de2021-09-05T14:01:17ZengSciendoRevista Academiei Forţelor Terestre2247-840X2019-03-01241778210.2478/raft-2019-0009raft-2019-0009Glance on Parallelization of FFT AlgorithmsFarhan Mhnd0University of Baghdad, IraqThis paper implores the parallelization of Fast Fourier Transform (FFT) algorithms and evaluates the resultant parallelized source codes. The FFT algorithm is considered to be among the most important algorithms in the digital era. There are various FFT algorithms but just a few are considered in this paper. The Cooley-Tukey FFT is the most widely known and used. With no exception, in this paper, the radix-2 Decimation in Time (DIT) and Decimation in Frequency (DIF) are studied and implemented. Another important FFT algorithm that is the Goertzel is also considered in this paper.https://doi.org/10.2478/raft-2019-0009parallelizationfftalgorithms |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Farhan Mhnd |
| spellingShingle |
Farhan Mhnd Glance on Parallelization of FFT Algorithms Revista Academiei Forţelor Terestre parallelization fft algorithms |
| author_facet |
Farhan Mhnd |
| author_sort |
Farhan Mhnd |
| title |
Glance on Parallelization of FFT Algorithms |
| title_short |
Glance on Parallelization of FFT Algorithms |
| title_full |
Glance on Parallelization of FFT Algorithms |
| title_fullStr |
Glance on Parallelization of FFT Algorithms |
| title_full_unstemmed |
Glance on Parallelization of FFT Algorithms |
| title_sort |
glance on parallelization of fft algorithms |
| publisher |
Sciendo |
| series |
Revista Academiei Forţelor Terestre |
| issn |
2247-840X |
| publishDate |
2019-03-01 |
| description |
This paper implores the parallelization of Fast Fourier Transform (FFT) algorithms and evaluates the resultant parallelized source codes. The FFT algorithm is considered to be among the most important algorithms in the digital era. There are various FFT algorithms but just a few are considered in this paper. The Cooley-Tukey FFT is the most widely known and used. With no exception, in this paper, the radix-2 Decimation in Time (DIT) and Decimation in Frequency (DIF) are studied and implemented. Another important FFT algorithm that is the Goertzel is also considered in this paper. |
| topic |
parallelization fft algorithms |
| url |
https://doi.org/10.2478/raft-2019-0009 |
| work_keys_str_mv |
AT farhanmhnd glanceonparallelizationoffftalgorithms |
| _version_ |
1717810419163201536 |