<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2003-12-18 08:51:43Polynomial Fast Fourier transform Euclidean algorithm Primitive polynomial Multiplication Finite fields Multiplication algorithm Finite field arithmetic Mathematics Abstract algebra Algebra |
| 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 |