This easily accessible book provides a broad view of the latest developments in the field of fast digital signal processing algorithms. It bridges the gap between DSP algorithms and their implementation on a variety of serial and super computers.
Inhalt
1. Introduction to Abstract Algebra.- 2. Tensor Product and Stride Permutation.- 3. Cooley-Tukey FFF Algorithms.- 4. Variants of FFT Algorithms and Their Implementations.- 5. Good-Thomas PFA.- 6. Linear and Cyclic Convolution.- 7. Agarwal-Cooley Convolution Algorithm.- 8. Introduction to Multiplicative Fourier Transform Algorithms (MFTA).- 9. MFTA: The Prime Case.- 10. MFTA: Product of Two Distinct Primes.- 11. MFTA: Transform Size N = Mr M-Composite Integer and r-Prime.- 12. MFTA: Transform Size N = p2.- 13. Periodization and Decimation.- 14. Multiplicative Character and the FFT.- 15. Rationality.