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

References

  1. Chu, E., & George, A. (2000). Inside the FFT black box: serial and parallel fast fourier transform algorithms. Washington, D.C.: CRC Press.10.1201/9781420049961
  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.10.1007/978-3-642-22714-1_59
  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.10.1007/978-3-319-62392-4_29
  6. 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.130
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.