Automatic Generation of Prime Length FFT Programs by C. Sidney Burrus - HTML preview
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.
Download the book in PDF, ePub, Kindle for a complete version.
Automatic Generation of Prime Length FFT Programs
Table of Contents
- Chapter 1. Introduction
- Chapter 2. Preliminaries
- Chapter 3. Bilinear Forms for Circular Convolution
- Chapter 4. A Bilinear Form for the DFT
- Chapter 5. Implementing Kronecker Products Efficiently
- Chapter 6. Programs for Circular Convolution
- Chapter 7. Programs for Prime Length FFTs
- Chapter 8. Conclusion
- Chapter 9. Appendix: Bilinear Forms for Linear Convolution
- Chapter 10. Appendix: A 45 Point Circular Convolution Program
- Chapter 11. Appendix: A 31 Point FFT Program
- Chapter 12. Appendix: Matlab Functions For Circular Convolution and Prime Length FFTs
- Chapter 13. Appendix: A Matlab Program for Generating Prime Length FFT Programs
- Index
