First Page | Document Content | |
---|---|---|
Date: 2013-07-15 15:20:39Abstract algebra Algebra Root-finding algorithms Computational complexity theory Fast Fourier transform Durand–Kerner method Factorization of polynomials Time complexity System of polynomial equations Mathematics Polynomials Theoretical computer science | Add to Reading ListSource URL: comet.lehman.cuny.eduDownload Document from Source WebsiteFile Size: 527,76 KBShare Document on Facebook |
Frobenius Additive Fast Fourier Transform Wen-Ding Li Ming-Shing Chen Po-Chun KuoDocID: 1xVYf - View Document | |
Polynomials and the Fast Fourier Transform (FFT)DocID: 1xUw0 - View Document | |
Lecture XI: The Fast Fourier Transform (FFT) algorithm Maxim Raginsky BME 171: Signals and Systems Duke UniversityDocID: 1ubp9 - View Document | |
Fast Fourier Transform on FPGA: Design Choices and Evaluation Peter A. Milder, Franz Franchetti, James C. Hoe, and Markus P¨uschel Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh,DocID: 1seVm - View Document | |
© DIGITAL VISION A Tutorial on Fast Fourier Sampling [How to apply it to problems] C. Gilbert,DocID: 1rugj - View Document |