Fast Fourier Transform Algorithms for Parallel Computers
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...
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Singapore
Springer Nature Singapore
2019, 2019
|
| Edition: | 1st ed. 2019 |
| Series: | High-Performance Computing Series
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer eBooks 2005- - Collection details see MPG.ReNa |
Table of Contents:
- Chapter 1: Introduction
- Chapter 2: Fast Fourier Transform
- Chapter 3: Mixed-Radix FFT Algorithms
- Chapter 4: Split-Radix FFT Algorithms
- Chapter 5: Multidimensional FFT Algorithms
- Chapter 6: High-Performance FFT Algorithms
- Chapter 7: Parallel FFT Algorithms for Shared-Memory Parallel Computers
- Chapter 8: Parallel FFT Algorithms for Distributed-Memory Parallel Computers