Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Glance on Parallelization of FFT Algorithms

Glance on Parallelization of FFT Algorithms AbstractThis 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Land Forces Academy Review de Gruyter

Glance on Parallelization of FFT Algorithms

Farhan, Mhnd
Land Forces Academy Review , Volume 24 (1): 6 – Mar 1, 2019
Download PDF
6 pages

Loading next page...
 
/lp/de-gruyter/glance-on-parallelization-of-fft-algorithms-DECdbynnuo
Publisher
de Gruyter
Copyright
© 2019 Mhnd Farhan, published by Sciendo
eISSN
2247-840X
DOI
10.2478/raft-2019-0009
Publisher site
See Article on Publisher Site

Abstract

AbstractThis 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.

Journal

Land Forces Academy Review – de Gruyter

Published: Mar 1, 2019

There are no references for this article.