Algorithms for discrete Fourier transform and convolution

Focusing on the intersection of mathematics and algorithm design, the book offers a comprehensive exploration of algorithms for computing the finite Fourier transform (FFT) and finite convolution. Originally intended for a mixed audience of engineers and scientists, it expands to address the need for a deeper understanding of mathematical principles in algorithm development. The text emphasizes tools that bridge the gap between algorithm theory and practical implementation, particularly for complex digital signal processing (DSP) tasks, while providing rules to streamline coding for modern computing systems.