Fast Fourier Transform Algorithms for Parallel Computers
Book information
Description
Following an introduction to the basis of the fast Fourier transform (FFT), this book focuses on the implementation details on FFT for parallel computers. FFT is an efficient implementation of the discrete Fourier transform (DFT), and is widely used for many applications in engineering, science, and mathematics. Presenting many algorithms in pseudo-code and a complexity analysis, this book offers a valuable reference guide for graduate students, engineers, and scientists in the field who wish to apply FFT to large-scale problems. Parallel computation is becoming indispensable in solving the large-scale problems increasingly arising in a wide range of applications. The performance of parallel supercomputers is steadily improving, and it is expected that a massively parallel system with hundreds of thousands of compute nodes equipped with multi-core processors and accelerators will be available in the near future. Accordingly, the book also provides up-to-date computational techniques relevant to the FFT in state-of-the-art parallel computers. Following the introductory chapter, Chapter 2 introduces readers to the DFT and the basic idea of the FFT. Chapter 3 explains mixed-radix FFT algorithms, while Chapter 4 describes split-radix FFT algorithms. Chapter 5 explains multi-dimensional FFT algorithms, Chapter 6 presents high-performance FFT algorithms, and Chapter 7 addresses parallel FFT algorithms for shared-memory parallel computers. In closing, Chapter 8 describes parallel FFT algorithms for distributed-memory parallel computers. Front Matter ....Pages i-ix Introduction (Daisuke Takahashi)....Pages 1-3 Fast Fourier Transform (Daisuke Takahashi)....Pages 5-13 Mixed-Radix FFT Algorithms (Daisuke Takahashi)....Pages 15-20 Split-Radix FFT Algorithms (Daisuke Takahashi)....Pages 21-33 Multidimensional FFT Algorithms (Daisuke Takahashi)....Pages 35-40 High-Performance FFT Algorithms (Daisuke Takahashi)....Pages 41-68 Parallel FFT Algorithms for Shared-Memory Parallel Computers (Daisuke Takahashi)....Pages 69-76 Parallel FFT Algorithms for Distributed-Memory Parallel Computers (Daisuke Takahashi)....Pages 77-112 Back Matter ....Pages 113-114
Similar books
Structural Information and Communication Complexity: 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29–July 1, 2020, Proceedings
2020 · PDF
Swarm Intelligence: 12th International Conference, ANTS 2020, Barcelona, Spain, October 26–28, 2020, Proceedings
2020 · PDF
Computer Algebra in Scientific Computing: 22nd International Workshop, CASC 2020, Linz, Austria, September 14–18, 2020, Proceedings
2020 · PDF
Algorithms and Data Structures: Foundations and Probabilistic Methods for Design and Analysis
2020 · PDF
Computational Logistics: 11th International Conference, ICCL 2020, Enschede, The Netherlands, September 28–30, 2020, Proceedings
2020 · PDF
Theory and Applications of Models of Computation: 16th International Conference, TAMC 2020, Changsha, China, October 18–20, 2020, Proceedings
2020 · PDF
Algorithms for Sensor Systems: 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, Pisa, Italy, September 9–10, 2020, Revised Selected Papers
2020 · PDF
Theoretical Computer Science: 37th National Conference, NCTCS 2019, Lanzhou, China, August 2–4, 2019, Revised Selected Papers
2019 · PDF