Affiliation:
1. University of Baghdad , Iraq
Abstract
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.
Subject
General Economics, Econometrics and Finance
Reference6 articles.
1. Chu, E., & George, A. (2000). Inside the FFT black box: serial and parallel fast fourier transform algorithms. Washington, D.C.: CRC Press.
2. Cuixiang, Z., Guo-qiang, H., & Minghe, H. (2005). Some new parallel fast fourier transform algorithms. IEEE Sixth International Conference on Parallel and Distributed Computing Applications and Technologies, China.
3. Li, P., & Dong, W. (2010). Computation oriented parallel FFT algorithms on distributed computer. IEEE 3rd International Symposium on Parallel Architectures, Algorithms and Programming, China.
4. Morris, P., Chowdhury, S., & Deb, D. (2011). An efficient methodology for realization of parallel FFT for large data set. International Conference on Advances in Computing and Communications, India.
5. Takahashi, D. (2017). An implementation of parallel 1-D real FFT on Intel Xeon Phi processors. International Conference on Computational Science and Its Applications, Italy.