1 Review of Applied Algebra.- 2 Tensor Product and Stride Permutation.- 3 Cooley-Tukey FFT Algorithms.- 4 Variants of FT Algorithms and Implementations.- 5 Good-Thomas PFA.- 6 Linear and Cyclic Convolutions.- 7 Agarwal-Cooley Convolution Algorithm.- 8 Multiplicative Fourier Transform Algorithm.- 9 MFTA: The Prime Case.- 10 MFTA: Product of Two Distinct Primes.- 11 MFTA: Composite Size.- 12 MFTA: p2.- 13 Periodization and Decimation.- 14 Multiplicative Characters and the FT.- 15 Rationality.
Review of Applied Algebra.- Tensor Product and Stride Permutation.- Cooley-Tukey FFT Algorithms.- Variants of FT Algorithms and Implementations.- Good-Thomas PFA.- Linear and Cyclic Convolutions.- Agrawal-Cooley Convolution Algorithm.- Multiplicative Fourier Transform Algorithm.- MFTA: The Prime case.- MFTA: Product of Two Distinct Primes.- MFTA: Composite Size.- MFTA: p2.- Periodization and Decimation.- Multiplicative Characters and the FT.- Rationality.
This graduate-level text provides a language for understanding, unifying, and implementing a wide variety of algorithms for digital signal processing - in particular, to provide rules and procedures that can simplify or even automate the task of writing code for the newest parallel and vector machines. It thus bridges the gap between digital signal processing algorithms and their implementation on a variety of computing platforms. The mathematical concept of tensor product is a recurring theme throughout the book, since these formulations highlight the data flow, which is especially important on supercomputers. Because of their importance in many applications, much of the discussion centres on algorithms related to the finite Fourier transform and to multiplicative FFT algorithms.
This book provides a broad view of the latest developments in the field of fast digital signal processing algorithms. It thus serves both as a textbook for graduate courses and as a reference book of algorithms for signal processing.