Fast Fourier Transform Algorithms for Parallel Computers
«“This well-written book can serve as useful reference for graduate students and engineers.” (Manfred Tasche, zbMATH 1477.65005, 2022)»
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. Les mer
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.
Detaljer
- Forlag
- Springer Verlag, Singapore
- Innbinding
- Innbundet
- Språk
- Engelsk
- Sider
- 114
- ISBN
- 9789811399640
- Utgivelsesår
- 2019
- Format
- 24 x 16 cm
Anmeldelser
«“This well-written book can serve as useful reference for graduate students and engineers.” (Manfred Tasche, zbMATH 1477.65005, 2022)»