Fast Fourier Transform Algorithms for Parallel Computers
✍ Scribed by Daisuke Takahashi
- Publisher
- Springer Singapore
- Year
- 2019
- Tongue
- English
- Leaves
- 120
- Series
- High-Performance Computing Series 2
- Edition
- 1st ed. 2019
- Category
- Library
No coin nor oath required. For personal study only.
✦ Synopsis
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.
✦ Table of Contents
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
✦ Subjects
Computer Science; Algorithm Analysis and Problem Complexity; Algorithms; Mathematical and Computational Engineering
📜 SIMILAR VOLUMES
Personally, I am satisfied with what I bought. I wrote an uninspired fast fourier transform from its mathematical formula and it took 30 seconds to execute. I knew I could do better. After buying the book I learn to play close attention to the bit reversal on the twiddles (trig functions). I als
Philadelpia, SIAM, 1992. - 291 p.<div class="bb-sep"></div>Монография известного специалиста по вычислительной математике посвящена разработке алгоритмов быстрого преобразования Фурье (БПФ), включая реализации для ограниченной и распределённой памяти, многомерный случай, а также применениям БПФ для
Personally, I am satisfied with what I bought. I wrote an uninspired fast fourier transform from its mathematical formula and it took 30 seconds to execute. I knew I could do better. After buying the book I learn to play close attention to the bit reversal on the twiddles (trig functions). I als
Are some areas of fast Fourier transforms still unclear to you? Do the notation and vocabulary seem inconsistent? Does your knowledge of their algorithmic aspects feel incomplete? The fast Fourier transform represents one of the most important advancements in scientific and engineering computing. Un