Fourier: Cheat Sheet

FOURIER FAMILY

Continues Signal Discrete Signal

Fourier series Discrete Fourier series

Periodic

N 1
1 1
ak
Ts x(t )e s dt
jk t
x ( n) ak e jkst
k
X ( k ) ak
N
x ( n)e
n 0
j 2nk / N

Ts

N 1
X (k ) x(n)e j 2nk / N DFT & FFT
n 0

Frequency: Discrete & Aperiodic Frequency: Discrete & Periodic

Aperiodic

Fourier Transform Discrete Time Fourier Transform

x(t )e dt x ( n)e
jt
X ( j ) X () jn

Frequency: Continues & Aperiodic Frequency: Continues & Periodic

Laplace Transform Z-Transform

x(t )e dt x ( n) Z
st
X ( s) X ( z) n

ROC over Re(s) = n ROC over |Z| = r

By replacing j + j = s By replacing ej rej = Z

DFS & DFT: Discrete Fourier series is applicable for periodic discrete sequences, whereas DFT is
taken from DFS considering any aperiodic sequence as periodic with period equal to the length
of given sequence. Other way to drive DFT is by sampling DTFT of aperiodic sequence and taking
N samples from 0 to . DFT is one of the widest used transform among all Fouriers as practically
we have discrete signals (sequences) and it can be stored in memory. FFT Fast Fourier
Transform, is just fast way to compute DFT.
Laplace and Z- Transforms are extension (or generalization) of Fourier Transform and DTFT,
which is also applicable of signals which do not satisfy Dirichlet Criteria. Of course ROC for these
two transform are very essential part to know when signals analysis can be done.

NikB Nikesh Bajaj