[Numeric]
[A]
[B] [C]
[D] [E]
[F]
[G]
[H] [I] [J]
[K]
[L] [M] [N]
[O] [P] [Q]
[R] [S] [T]
[U] [V] [W]
[X] [Y] [Z]
FFT - Fast Fourier Transform
By: Christine Martz
Meaning of FFT – “Fast Fourier Transform”, is a mathematical algorithm
that is used to indicate any algorithm attempting to determine the power versus frequency
graph for a signal.
This algorithm shows what high, medium, and low sounds, and what volume of each,
are combined to make a complex sound like the human voice. This information is used in the feature
analysis method of voice recognition.
FFT is also used for digital signal processing and to remove or enhance
patterns of periodic "noise" in an image.
The Fourier transform is named after Jean Baptiste Joseph Fourier.
Other Related Definitions:
“…The Fourier transform has the unique capability of taking functions from
the time domain to the frequency domain. A few hundred years ago French mathematician Jean Baptiste
Joseph Fourier developed the calculus based transform to solve heat diffusion problems. A number of
decades ago a method to quickly calculate discrete FFT's of the power was developed, and first
implemented in Fortran.” [Magmai Kai Holmlor - Gamedev.net]
“…Fourier transforms are also used to solve partial differential equations.
Accordingly, they are used in applications where partial differential equations arise, such as
physics and financial engineering.” [Contingency Analysis]
“…FFTs were first discussed by Cooley and Tukey (1965), although Gauss had actually
described the critical factorization step as early as 1805 (Bergland 1969, Strang 1993).” [Eric W. Weisstein - MathWorld]
Related Links:
Fast Fourier Transforms
- Description of FFT.
The FFT
- Making Technology Fly.
Technical Resources:
Discrete Fourier Transform
The Scientist and Engineer's Guide to Digital Signal Processing
General Purpose FFT (Fast Fourier/Cosine/Sine Transform) Package
Products and Solutions:
A C subroutine library for computing the discrete Fourier transform
Blogs, News, Feeds, Discussion Lists:
FFT Mailing List
Books About:
Fast Fourier Transform and Its Applications
- by E. Brigham
The Fast Fourier Transform: An Introduction to Its Theory and Application
- by E. Oran Brigham
Fast Fourier Transforms, Second Edition
- by James S. Walker
See Also:
Other FFT Related Resources
[Numeric]
[A]
[B] [C]
[D] [E]
[F]
[G]
[H] [I] [J]
[K]
[L] [M] [N]
[O] [P] [Q]
[R] [S] [T]
[U] [V] [W]
[X] [Y] [Z]
|
|
(C) Copyright Birds-Eye.Net, All rights reserved.
It is against the law to reproduce this content or any portion of it in any form without the explicit written permission of Birds-Eye Network Services, LLC. Federal copyright law (17 USC 504) makes it illegal, punishable with fines up to $100,000 per violation plus attorney's fees.
|
