Keywords: FFT
Displaying 1-20 of 53 results.
2D DFT
| Rating: | |
| Type: | Course Related Materials |
Abstract: This module extends the ideas of the Discrete Fourier Transform (DFT) into two-dimensions, which is necessary for any image processing.
Alternate FFT Structures
| Rating: | |
| Type: | Course Related Materials |
Abstract: FFT structures with different memory layout and interconnection patterns are occasionally useful for certain applications. These alternate structures include decimation-in-frequency FFTs with in-order outputs, decimation-in-time FFTs with in-order inputs, structures with both in-order inputs and outputs, ... More »
Biological Engineering II: Instrumentation and Measurement, Fall 2006
| Rating: | |
| Type: | Course Related Materials |
Abstract: This course covers sensing and measurement for quantitative molecular/cell/tissue analysis, in terms of genetic, biochemical, and biophysical properties. Methods include light and fluorescence microscopies; electro-mechanical probes such as atomic force microscopy, laser and magnetic traps, and MEMS ... More »
Choosing the Best FFT Algorithm
| Rating: | |
| Type: | Course Related Materials |
Abstract: Power-of-two-length FFTs are usually best for general use when the DFT length is somewhat at the user's discretion. The best power-of-two algorithm may depend on the type of computer to be used.
Decimation-in-Frequency (DIF) Radix-2 FFT
| Rating: | |
| Type: | Course Related Materials |
Abstract: The radix-2 algorithms are the simplest FFT algorithms. The decimation-in-frequency (DIF) radix-2 FFT partitions the DFT computation into even-indexed and odd-indexed outputs, which can each be computed by shorter-length DFTs of different combinations of input samples. Recursive application of this decomposition ... More »
Decimation-in-time (DIT) Radix-2 FFT
| Rating: | |
| Type: | Course Related Materials |
Abstract: The radix-2 algorithms are the simplest FFT algorithms. The decimation-in-time (DIT) radix-2 FFT recursively partitions a DFT into two half-length DFTs of the even-indexed and odd-indexed time samples.
Derivando la Transformada Rápida de Fourier
| Rating: | |
| Type: | Course Related Materials |
Abstract: Usando el algoritmo de Cooley-Tukey para derivar la transfromada rápida.
Deriving the Fast Fourier Transform
| Rating: | |
| Type: | Course Related Materials |
Abstract: Using the Cooley-Tukey algorithm to derive fast transforms.
Detecting Notes or Chords
| Rating: | |
| Type: | Course Related Materials |
Abstract: This module demonstrates how we use Matlab to determine if a guitar player is playing single notes or chords.
DFT as a Matrix Operation
| Rating: | |
| Type: | Course Related Materials |
Abstract: This module introduces linear algebra, DFT, FFT, matrix and vector.
DFT: Fast Fourier Transform
| Rating: | |
| Type: | Course Related Materials |
Abstract: The DFT can be reduced from exponential time with the Fast Fourier Transform algorithm.
DFT: Transformada Rápida de Fourier
| Rating: | |
| Type: | Course Related Materials |
Abstract: La DFT puede ser reducida del tiempo exponencial con el algoritmo de la transformada rápida de Fourier
Digital Signal Processing: A User's Guide
| Rating: | |
| Type: | Course Related Materials |
Abstract: Digital Signal Processing: A User's Guide is intended both for the practicing engineer with a basic knowledge of DSP and for a second course in signal processing at the senior or first-year postgraduate level. FFTs, digital filter design, adaptive filters, and multirate signal processing are covered ... More »
Discrete Fourier Transformation
| Rating: | |
| Type: | Course Related Materials |
Abstract: This module covers the fundamentals of Discrete-Fourier Transformations.
Discrete-Time Filtering Example
| Rating: | |
| Type: | Course Related Materials |
Abstract: Average stock price as an example of discrete-time filtering.
DSP Optimization Techniques
| Rating: | |
| Type: | Course Related Materials |
Abstract: An overview of DSP optimization techniques, from the design stage, through high-level implementations, to assembly implementations.
Efficiency in Filtering
| Rating: | |
| Type: | Course Related Materials |
Abstract: Compares the efficiency of frequency-domain and time-domain filtering.
Efficiency of Frequency-Domain Filtering
| Rating: | |
| Type: | Course Related Materials |
Abstract: Compares the efficiency of frequency domain and time domain filtering.
Efficient FFT Algorithm and Programming Tricks
| Rating: | |
| Type: | Course Related Materials |
Abstract: Many tricks and techniques have been developed to speed up the computation of FFTs. Significant reductions in computation time result from table lookup of twiddle factors, compiler-friendly or assembly-language programming, special hardware, and FFT algorithms for real-valued data. Higher-radix algorithms, ... More »
Fast Convolution
| Rating: | |
| Type: | Course Related Materials |
Abstract: Efficient computation of convolution using FFTs.
Loading...
