F[(f(t))]≡f~(ω)≡F(ω)
- Generally, the Fourier transform a function is denoted by the uppercase letter version
F[af1(t)+bf2(t)]=aF1(ω)+bF2(ω)
F[f(at)]=∣a∣1F(jaω)
F[f(−t)]=F(−jω)
F[f∗(t)]=F∗(−jω)
F[F(t)]=2πf(−jω)
- Duality
- Shown by taking f(t)=2π1∫−∞∞F(jω)ejωtdω
- then rearranging to 2πf(−t)=∫−∞∞F(jω)e−jωtdω=F[F(t)]
F[f(t−τ)]=e−jωτF(jω)
F[f′(t)]=jωF(jω)
F[(f1∗f2)(t)]=F1(jω)F2(jω)
∫−∞∞∣f(t)∣2dt=2π1∫−∞∞∣F(jω)∣2dω
F[f1(t)f2(t))]=2π1(F1∗F2)(jω)
- Multiplication
- Can be proved by using duality + convolution
F[f(t)ejω0t]=F(j(ω−ω0))
∫−∞tf(τ)dτ<⇒πF(0)δ(ω)+jωF(jω)