Glossary Definition for FFT

Definition

A Fourier transform (FT) converts a signal from the time domain (signal strength as a function of time) to the frequency domain (signal strength as a function of frequency). It shows the signal's spectral content, divided into discrete bins (frequency bands).

The Fast Fourier Transform is a common algorithm for Fourier transforms. It is more efficient (faster) than the DFT, Discrete Fourier Transform.

Synonyms

• Fast Fourier Transform
• Fourier Transform
• DFT
• Discrete Fourier Transform

See Also

• Frequency Bin
• Show application notes for: "FFT"
• Show site-wide search results for: "FFT"

Find a term alphabetically:

0-9

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

Comment on This Term (Corrections, Suggestions, etc.)

Suggest Another Term We Should Add