<--- Back to Details
First PageDocument Content
Algorithm / Linear programming / Fast Fourier transform / Sorting algorithm / Computational complexity theory / Numerical linear algebra / Integer relation algorithm / Quicksort / Mathematical optimization / Mathematics / Operations research / Applied mathematics
Date: 2005-05-15 21:35:22
Algorithm
Linear programming
Fast Fourier transform
Sorting algorithm
Computational complexity theory
Numerical linear algebra
Integer relation algorithm
Quicksort
Mathematical optimization
Mathematics
Operations research
Applied mathematics

Add to Reading List

Source URL: web.ist.utl.pt

Download Document from Source Website

File Size: 36,91 KB

Share Document on Facebook

Similar Documents

Frobenius Additive Fast Fourier Transform Wen-Ding Li Ming-Shing Chen Po-Chun Kuo

DocID: 1xVYf - View Document

Mathematics / Mathematical analysis / Algebra / Fourier analysis / Polynomials / Unitary operators / Multiplication / Discrete Fourier transform / Numerical analysis / Polynomial / Fourier transform / Root of unity

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 University

DocID: 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

Mathematical analysis / Digital signal processing / Signal processing / Mathematics / Fourier analysis / Unitary operators / Joseph Fourier / Spectral density estimation / Discrete Fourier transform / Fast Fourier transform / Fourier transform / Filter bank

© DIGITAL VISION A Tutorial on Fast Fourier Sampling [How to apply it to problems] C. Gilbert,

DocID: 1rugj - View Document