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 version is to printed in a 6"x9" size.
This book is downloadable in PDF, ePub, Kindle and TXT format.
<div id="page-error">You currently don't have Adobe Reader installed. In order to view this file, please <a href="https://get.adobe.com/reader/" target="_blank">download Adobe Reader</a>.<br><br>Alternatively, you can try to <a href="https://www.free-ebooks.net/engineering-textbooks/Fast-Fourier-Transforms-6x9-Version/pdf?dl&preview" target="_blank">open the preview in a new tab or window</a>.</div>
