Open Access

Glance on Parallelization of FFT Algorithms

   | Apr 24, 2019

Cite

Chu, E., & George, A. (2000). Inside the FFT black box: serial and parallel fast fourier transform algorithms. Washington, D.C.: CRC Press.Search in Google Scholar

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.Search in Google Scholar

Li, P., & Dong, W. (2010). Computation oriented parallel FFT algorithms on distributed computer. IEEE 3rd International Symposium on Parallel Architectures, Algorithms and Programming, China.Search in Google Scholar

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.10.1007/978-3-642-22714-1_59Search in Google Scholar

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.10.1007/978-3-319-62392-4_29Search in Google Scholar

Zhang, X., Shen, K., Xu, C., & Wang, K. (2013). Design and implementation of parallel FFT on CUDA. IEEE 11th International Conference on Dependable, Autonomic and Secure Computing, China.10.1109/DASC.2013.130Search in Google Scholar