Fast Fourier Transforms by C. Sidney Burrus, Matteo Frigo, Steven G. Johnson, - HTML preview

/ Home / Engineering / Fast Fourier Transforms

PLEASE NOTE: This is an HTML preview only and some elements such as links or page numbers may be incorrect.
Download the book in PDF, ePub, Kindle for a complete version.

Fast Fourier Transforms

Table of Contents

Chapter 1. Preface: Fast Fourier Transforms
- 1.1.
  - References
Chapter 2. Introduction: Fast Fourier Transforms
- 2.1.
  - References
Chapter 3. Multidimensional Index Mapping
- 3.1.
Chapter 4. Polynomial Description of Signals
- 4.1.
Chapter 5. The DFT as Convolution or Filtering
- 5.1.
Chapter 6. Factoring the Signal Processing Operators
- 6.1.
Chapter 7. Winograd's Short DFT Algorithms
- 7.1.
Chapter 8. DFT and FFT: An Algebraic View
- 8.1.
Chapter 9. The Cooley-Tukey Fast Fourier Transform Algorithm
- 9.1.
Chapter 10. The Prime Factor and Winograd Fourier Transform Algorithms
- 10.1.
Chapter 11. Implementing FFTs in Practice
- 11.1.
Chapter 12. Algorithms for Data with Restrictions
- 12.1.
Chapter 13. Convolution Algorithms
- 13.1.
Chapter 14. Comments: Fast Fourier Transforms
- 14.1.
  - Other work and Results
  - References
Chapter 15. Conclusions: Fast Fourier Transforms
- 15.1.
  - References
Chapter 16. Appendix 1: FFT Flowgraphs
- 16.1.
  - Signal Flow Graphs of Cooley-Tukey FFTs
Chapter 17. Appendix 2: Operation Counts for General Length FFT
- 17.1.
  - Figures
Chapter 18. Appendix 3: FFT Computer Programs
- 18.1.