Scribd
Upload
431 views2 pages

Convolution:: Formula Sheet

The document provides formulas and properties for convolution, Fourier series, Fourier transforms, and some basic transform pairs. Convolution defines continuous and discrete convolution. Fourier series expresses a function as the sum of sinusoidal functions. Fourier transforms define the continuous and discrete Fourier transforms and their properties. Parseval's relation links the energy of a signal to the energy of its Fourier transform. The document also lists properties that relate functions and their Fourier transforms under various operations.

Uploaded by

Mengistu Abera
Copyright
© © All Rights Reserved
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
431 views2 pages

Convolution:: Formula Sheet

The document provides formulas and properties for convolution, Fourier series, Fourier transforms, and some basic transform pairs. Convolution defines continuous and discrete convolution. Fourier series expresses a function as the sum of sinusoidal functions. Fourier transforms define the continuous and discrete Fourier transforms and their properties. Parseval's relation links the energy of a signal to the energy of its Fourier transform. The document also lists properties that relate functions and their Fourier transforms under various operations.

Uploaded by

Mengistu Abera
Copyright
© © All Rights Reserved
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/ 2

FORMULA SHEET

Convolution:
∞ ∞
y( t ) = x ( t ) ∗ h ( t ) = ∫ x ( τ ) h ( t − τ ) dτ y[n] = x[ n ] ∗ h[ n ] = ∑ x[k]h[n − k]  
−∞ k = −∞
x ( t ) ∗ δ( t − t 0 ) = x ( t − t 0 ) x[n] ∗ δ[ n − n 0 ] = x[ n − n 0 ]
 

Fourier Series:
∞
x( t) = ∑ a k e jkω t 0 x[n] = ∑ a k e jkω n 0

k = −∞ k =< N >

x ( t )e − jkω0 t dt
∫ ∑ x[n]e - jkω n
1 1
ak = ak = 0

T T N
n =< N >

Fourier Transform:
∞
jωt dω X(e jω )e jωn dω
∫ X(jω)e ∫
1 1
x( t) = x[n] =
2π 2π 2 π
−∞
∞ ∞
X( jω) = ∫ x ( t )e − jωt dt X(e jω ) = ∑ x[n]e − jωn
−∞ n = −∞

Parseval's Relation:
∞ 2
2
∑ ak ∑ x[n] 2 = ∑
2
∫
1 1
x ( t ) dt = ak
T T N
k = −∞ n =< N. n =< N >

Fourier Series Properties:


x( t − t 0 ) ⇔ a k e − jkω0 t 0 x[n - n 0 ] ⇔ a k e − jkω0 n 0
x(−t) ⇔ a-k x[-n] ⇔ a -k

x[n] - x[n - 1] ⇔ (1 - e - jkω0 )a k


dx
⇔ jkω0 a k
dt
x ( t ) / x[n ] real & even a k real & even
x(t)/x[n] real & odd a k purely imaginary & odd

Fourier Transform Properties:


x ( t − t 0 ) ⇔ e − jωt 0 X( jω) x[n - n 0 ] ⇔ e − jωn 0 X(e jω )

e jω0 t x ( t ) ⇔ X(j(ω − ω0 )) e jω0 n x[n ] ⇔ X(e j( ω− ω0 ) )


∞ ∞ ∞ ∞
∑ a k e jkω0 t ⇔ 2π ∑ a k δ( ω − kω0 ) ∑ a k e jkω0 n ⇔ 2π ∑ a k δ(ω − kω0 )
k = −∞ k = -∞ k =< N > k = -∞
x(−t ) ⇔ X(-jω) x[-n] ⇔ X(e -jω)
x(t) ∗ y(t) ⇔ X(jω)Y(jω) x[n] ∗ y[n] ⇔ X((e jω )Y (e jω )

x[n] - x[n - 1] ⇔ (1 - e - jω ) X (e jω )
d
x( t) ⇔ jωX(jω)
dt
[ x (e jω ) ∗ Y (e jω )]
1 1
x ( t ).y( t ) ⇔ [ X ( jω) ∗ Y ( jω)] x[n].y[n] ⇔
2π 2π
t 1
x ( t )dt ⇔ X ( jω) + πX (0)δ( ω)
∫ jω
−∞
x ( t ) / x[ n ] real & even X(jω)/X(e jω ) real & even
x ( t ) / x[ n ] real & odd X(jω)/X(e jω ) purely imaginary & odd

Some Basic Transform pairs:


e − at u(t)
1 1
⇔ a n u[ n ] ⇔
a + jω 1 - ae - jω
te − at u(t) ⇔
1 1
[n + 1] a n u[ n ] ⇔
(a + jω) 2 (1 - ae - jω ) 2
δ( t ) ⇔ 1 δ[n] ⇔ 1
1
t < T1 n < N1 sin ω( N 1 + )
1, 2 sin ωT1 1, 2
x(t) = ⇔ x([n] = ⇔
0, t > T1 ω 0, n > N1 ω
sin( )
2
Geometric Series:
∞
1 − a N +1
N N
∑ ∑ ∑ na n = (1 − a ) 2 ,
1 a
an = ; a ≠ 1; an = ; a < 1.; a ≠ 1.
1− a 1− a
0 0 0

You might also like