0% found this document useful (0 votes)
110 views4 pages

Fourier series (FS) : ∞ k jkω t k T −jkω t

This document provides an overview of different types of signal transforms including the Fourier series, Fourier transform, discrete-time Fourier transform, and discrete Fourier transform. For each transform, it lists properties of signals in the time domain and how they are represented in the transform domain, such as how time shifting, scaling, and differentiation affect the signal.

Uploaded by

arashix
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
110 views4 pages

Fourier series (FS) : ∞ k jkω t k T −jkω t

This document provides an overview of different types of signal transforms including the Fourier series, Fourier transform, discrete-time Fourier transform, and discrete Fourier transform. For each transform, it lists properties of signals in the time domain and how they are represented in the transform domain, such as how time shifting, scaling, and differentiation affect the signal.

Uploaded by

arashix
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Introduction to Signal Processing 361-1-3321 Transform tables

Fourier series (FS)



X Z
jkω0 t 1
x(t) = ak e ak = x(t)e−jkω0 t dt
T T
k=−∞

Property/signal Time domain Transform domain


Linearity Ax(t) + By(t) Aak + Bbk
Time shifting x(t − τ ) e−jkω0 τ ak
Time reversal x(−t) a−k
T
Time scaling x(at), a > 0 (periodic a) ak

Conjugation x (t) a∗−k
Symmetry x(t) real ak = a∗−k
d
Differentiation x(t) jkω0 ak
Rdtt ak
Integration −∞
x(t)dt, a0 = 0 jkω0
R
Convolution T
x(τ ) y(t − τ )dτ T ak bk
P∞
Multiplication x(t)y(t) m=−∞ am bk−m
Cosine 2A cos(ω0 t + B) a1 = AejB , a−1 = Ae−jB
1
R 2
P∞ 2
Parseval T T |x(t)| dt = k=−∞ |ak |

Fourier transform (FT)


Z ∞ Z ∞
1 jωt
x(t) = X(jω)e dω X(jω) = x(t)e−jωt dt
2π −∞ −∞

Property/signal Time domain Transform domain


Linearity ax(t) + by(t) aX(jω) + bY (jω)
Time shifting x(t − τ ) e−jωτ X(jω)
1
Time scaling x(at) |a| X(jω/a)
Conjugation x∗ (t) ∗
X (−jω)
Symmetry x(t) real X(jω) = X ∗ (−jω)
d
Differentiation x(t) jωX(jω)
Rdtt 1
Integration x(τ )dτ jω X(jω) + πX(0)δ(ω)
R−∞∞
Convolution −∞
x(τ )y(t − τ )dτ X(jω)Y (jω)
1
R∞
Multiplication x(t)y(t) 2π −∞ X(ju)Y (jω − ju)du
Delta δ(t) 1
One 1 2πδ(ω)
jω0 t
Exponent e 2πδ(ω − ω0 )
Cosine cos(w0 t) π[δ(ω − ω0 ) + δ(ω + ω0 )]
π
Sine sin(w0 t) j [δ(ω − ω0 ) − δ(ω + ω0 )]
1
Unit step u(t) jω + πδ(ω)
1
Decaying step u(t)e−at , a > 0 a+jω
t 2 sin(ωT )
Rectangular pulse Π( 2T ) ω
sin(W t) ω
Sinc (normalized) Π( 2W )
R ∞πt 1
R ∞
Parseval −∞
|x(t)|2 dt = 2π −∞ |X(jω)| dω
2

25 March 2007 1
Introduction to Signal Processing 361-1-3321 Transform tables

Discrete-time Fourier transform (DTFT)


Z ∞
X
1
x[n] = X(ejω )ejωn dω X(ejω ) = x[n]e−jωn
2π 2π n=−∞

Property/signal Time domain Transform domain


Linearity ax[n] + by[n] aX(ejω ) + bY (ejω )
Time shifting x[n − n0 ] e−jωn0 X(ejω )
Time reversal x[−n] X(e−jω )
Conjugation x∗ [n] X ∗ (e−jω )
Symmetry x[n] real X(ejω ) = X ∗ (e−jω )
P∞
Convolution m=−∞ x[m]y[n − m] X(ejω )Y (ejω )
1
R jθ j(ω−θ)
Multiplication x[n]y[n] 2π 2π X(e )Y (e )dθ
Delta δ[n] 1
P∞
One 1 2π m=−∞ δ(ω − 2πm)
jω0 n
P∞
Exponent e 2π m=−∞ δ(ω − ω0 − 2πm)
P∞
Cosine cos[w0 n] π m=−∞ [δ(ω − ω0 − 2πm) + δ(ω + ω0 − 2πm)]
π
P∞
Sine sin[w0 t] j m=−∞ [δ(ω − ω0 − 2πm) − δ(ω + ω0 − 2πm)]
1
Decaying step u[n]an , |a| < 1 1−ae−jω
sin[ω(N + 12 )]
Rectangular pulse ΠN [n] sin(ω/2)
sin[W n] P∞ ω−2πm
Sinc (normalized) m=−∞ Π( 2W )
Pπn∞ 1
R
Parseval n=−∞ |x[n]|2 = 2π 2π |X(e )|
jω 2

Discrete Fourier transform (DFT)


N −1 N −1
1 X 2π
X 2π
x[n] = X(k)ej N nk X(k) = x[n]e−j N nk
N n=0
k=0

Property/signal Time domain Transform domain


Linearity ax[n] + by[n] aX(k) + bY (k)
e−j ( N n0 k) X(k)

Time shifting x[n − n0 ]modN
Time reversal x∗ [−n]modN X ∗ (k)
Conjugation x∗ [n] X ∗ (−k)modN
Symmetry x[n] real X(k) = X ∗ (−k)modN
PN −1
Convolution m=0 x[m]modN y[n − m]modN X(k)Y (k)
1
PN −1
Multiplication x[n]y[n] N l=0 X(l)modN Y (k − l)modN
PN −1 2 1
PN −1 2
Parseval n=0 |x[n]| = N k=0 |X(k)|

25 March 2007 2
Introduction to Signal Processing 361-1-3321 Transform tables

Laplace transform
Z σ+j∞ Z ∞
1
x(t) = X(s)est ds X(s) = x(t)e−st dt
2πj σ−j∞ −∞

Property/signal Time domain Transform domain


Linearity ax(t) + by(t) aX(s) + bY (s)
Time shifting x(t − τ ) e−sτ X(s)
1
time scaling x(at) |a| X(s/a)
Conjugation x∗ (t) ∗ ∗
X (s )
d
Differentiation x(t) sX(s)
Rdtt 1
Integration x(τ )dτ s X(s)
R−∞∞
Convolution −∞
x(τ )y(t − τ )dτ X(s)Y (s)
Delta δ(t) 1
1
Unit step u(t) s (Re{s} > 0)
−at 1
Decaying step e u(t) s+a (Re{s} > −a)
−at 1
Decaying step −e u(−t) s+a (Re{s} < −a)
s
Causal Cosine cos(w0 t)u(t) s2 +ω02
(Re{s} > 0)
ω0
Causal Sine sin(w0 t)u(t) s2 +ω02
(Re{s} > 0)

Z transform
I ∞
X
1
x[n] = X(z)z n−1 dz X(z) = x[n]z −n
2πj n=−∞

Property/signal Time domain Transform domain


Linearity ax[n] + by[n] aX(z) + bY (z)
Time shifting x[n − n0 ] z −n0 X(z)
time reversal x[−n] X(z −1 )
Conjugation x∗ [n] X ∗ (z ∗ )
P∞
Convolution m=−∞ x[m]y[n − m] X(z)Y (z)
Delta δ[n] 1
1
Unit step u[n] 1−z −1 (|z| > 1)
n 1
Decaying step a u[n] 1−az −1 (|z| > a)
n 1
Decaying step −a u[−n − 1] 1−az −1 (|z| < a)

25 March 2007 3
Introduction to Signal Processing 361-1-3321 Transform tables

General
Description Equation

 |x| < 12
 1

1
Rectangular pulse in continuous-time Π(x) = |x| = 12


2
 0 elsewhere
(
1 |n| ≤ N
Rectangular pulse in discrete-time ΠN [n] =
 0 elsewhere

 1
 x>0
Unit step in continuous-time u(x) = 1
x=0


2
 0 elsewhere
(
1 n≥0
Unit step in discrete-time u[n] =
0 elsewhere
sin(πx)
Sinc in continuous-time sinc(x) = πx
Sine-sine product sin(a) sin(b) = 12 cos(a − b) − 12 cos(a + b)
Cosine-cosine product cos(a) cos(b) = 12 cos(a − b) + 12 cos(a + b)
Cosine-sine product cos(a) sin(b) = 12 sin(a + b) − 12 sin(a − b)

25 March 2007 4

You might also like