• Title Fast Fourier Transforms
• Author(s) C. Sidney Burrus
• Publisher: Connexions (November 18, 2012)
• License(s): CC BY 4.0
• Paperback 254 pages
• eBook HTML, PDF, ePub, etc
• Language: English
• ISBN-10: N/A
• ISBN-13: N/A
• Share This:  

Book Description

This book focuses on the Discrete Fourier Transform (DFT), discrete convolution, and, particularly, the fast algorithms to calculate them. These topics have been at the center of digital signal processing since its beginning, and new results in hardware, theory and applications continue to keep them important and exciting.

It uses an index map, a polynomial decomposition, an operator factorization, and a conversion to a filter to develop a very general and efficient description of fast algorithms to calculate the discrete Fourier transform (DFT). The work of Winograd is outlined, chapters by Selesnick, Pueschel, and Johnson are included, and computer programs are provided.

• C. Sidney Burrus received the PhD degree from Stanford University in 1965 after which he joined the faculty at Rice University where he is now Research Professor in ECE,

• Amazon

• Fourier Transforms and Wavelet
• Digital Signal Processing (DSP), Sound and Imaging Processing
• Discrete Mathematics
• Data Structures and Algorithms
• Computational Complexity

• Fast Fourier Transforms (C. Sidney Burrus, et al)
• The Mirror Site (1) - PDF

• Mathematics Of The Discrete Fourier Transform (DFT) (Julius Orion Smith III)
• Fourier Transforms - High-tech Application and Current Trends
• Discrete Wavelet Transforms - Algorithms and Applications