Engineering Tables/Fourier Transform Properties

From testwiki
Revision as of 01:44, 5 August 2017 by imported>Pi zero ({{BookCat}})
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:BookCat

Signal Fourier transform
unitary, angular frequency
Fourier transform
unitary, ordinary frequency
Remarks
g(t)

12πG(ω)eiωtdω
G(ω)

12πg(t)eiωtdt
G(f)

g(t)ei2πftdt
1 ag(t)+bh(t) aG(ω)+bH(ω) aG(f)+bH(f) Linearity
2 g(ta) eiaωG(ω) ei2πafG(f) Shift in time domain
3 eiatg(t) G(ωa) G(fa2π) Shift in frequency domain, dual of 2
4 g(at) 1|a|G(ωa) 1|a|G(fa) If |a| is large, then g(at) is concentrated around 0 and 1|a|G(ωa) spreads out and flattens
5 G(t) g(ω) g(f) Duality property of the Fourier transform. Results from swapping "dummy" variables of t and ω.
6 dng(t)dtn (iω)nG(ω) (i2πf)nG(f) Generalized derivative property of the Fourier transform
7 tng(t) indnG(ω)dωn (i2π)ndnG(f)dfn This is the dual to 6
8 (g*h)(t) 2πG(ω)H(ω) G(f)H(f) g*h denotes the convolution of g and h — this rule is the convolution theorem
9 g(t)h(t) (G*H)(ω)2π (G*H)(f) This is the dual of 8
10 For a purely real even function g(t) G(ω) is a purely real even function G(f) is a purely real even function
11 For a purely real odd function g(t) G(ω) is a purely imaginary odd function G(f) is a purely imaginary odd function