Discrete Fourirer Transform (DFT)
From wiki : “A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT). Fourier analysis converts a signal from its original domain (often time or space) to a representation in the frequency domain and vice versa.”
Phase - Frequency - Amplitude
3 fundamental properties of a wave. Two waves have the same amplitude and frequency but different phase
Frequency (Hertz) – number of circles in 1 second!
- MathBitsNotebook – Trigonometric Graphs Vocabulary
- Math is fun – Amplitude, Period, Phase Shift and Frequency
- BetterExplained – An Interactive Guide To The Fourier Transform
- OSCON 2014 (video) – Intuitive Understanding of the Fourier Transform and FFTs
•Notes with this notation aren't good enough. They are being updated.