This book 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.
This book is also available in 8.5 x 11 format
here.
You can view or download a digital version of this book for free from Connexions
here.
About Connexions
Connexions is an environment for collaboratively developing, freely sharing, and rapidly publishing scholarly content on the Web. Our Content Commons contains educational material for everyone, from children to college students to professionals. All content is free to use and reuse under the Creative Commons Attribution License (CC-BY 3.0).
Nice to meet you, how is everything, hope all is well with you. My name is Madam Avelin Regato, I found your contact after reading your profile I picked interest to contact you. I've something very important which I would love to share with you privately, therefore, would advise you to kindly write me back on: ( avregato@live.fr) so that I'll give you details. Waiting anxiously for your anticipated corporation,
Yours,
Madam Avelin
Email me on: avregato@live.fr