Have a personal or library account? Click to login
Glance on Parallelization of FFT Algorithms Cover

Glance on Parallelization of FFT Algorithms

By: Mhnd Farhan  
Open Access
|Apr 2019

Abstract

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.

DOI: https://doi.org/10.2478/raft-2019-0009 | Journal eISSN: 3100-5071 | Journal ISSN: 3100-5063
Language: English
Page range: 77 - 82
Published on: Apr 24, 2019
Published by: Nicolae Balcescu Land Forces Academy
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2019 Mhnd Farhan, published by Nicolae Balcescu Land Forces Academy
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.