Professional Documents
Culture Documents
f m
b
aliasing
u n
r t
a
Sm
Anti-alias
analog Filter Hold Quantizer
analog every T
v i a
A/D Converter
e d
ar
S
Output h D/A Digital
is
analog Signal
analog filter Converter
Processor
if le
s
Runs desired
i
Acts as a signal
h
DSP
post-conditioner
T
Algorithms
Functional Diagram for a simple DSP System
Types of Signals
o m
.c
Amplitude
r
Analog: Continuos time/ Continuous amplitude
r
b lu
time
u n
r t
a
Sm
Amplitude
a
Sampled Analog: Discrete time/ Continuous
v i amplitude
Ts
e
time
d
ar
S h
is
Amplitude
if le
Sampled data: similar to sampled analog,
except the samples have non-zero width
h i sτ Ts time
T
MOHAMMED EL-TANANY, PROFESSOR
SYSTEMS & COMPUTER ENGINEERING, CARLETON UNIVERSITY, OTTAWA, ONTARIO 2 / 23
We provide unlocked studymaterials from popular websites at affordable price, email enquiries to rishabhk28@live.com
D i g i t a l S i g n a l P r o c e s s i n g S Y S C 5 6 0 2 _ D T _ s i g n a l s & s e q u e n c e s _ 2 0 0 9 . f m
Amplitude o m
r
Digital: Discrete time/ Discrete amplitude
r .c
b lu
n
Ts time
r t u
a
Amplitude
Sm
DAC output: Continuous time/ Discrete
amplitude
Ts time
v i a
e d
ar
h
every T A/D Converter
S
Anti-alias
Hold Quantizer
s
analog Filter
analog
i
if le
Sampled data digital
sampled analog
h i s DSP
T
analog Output D/A
analog filter Converter
Sequences
A sampled sequence is obtained by sampling an analog signal, x(t), every T second
interval.
o m
T is known as the sampling period
r r .c
1
b lu
--- is known as the sampling frequency.
T
u n
r t
The resulting sampled sequence is of the form:
a
S m
x ( nT ) = {– – – – – – x ( – 2T ), x ( – T ), x ( 0 ), x ( T ), x ( 2T ), x ( 3T ), – – – – – , }
v i a
For convenience, the sampling period may be dropped; in this case
d
x ( n ) = {– – – – – – x ( – 2 ), x ( – 1 ), x ( 0 ), x ( 1 ), x ( 2 ), x ( 3 ), – – – – – , }
e
a r
S h
is
x(t) x(n)
if le
i s
Th t (continuous) 0 1 2 3 .......... n (integer)
Basic Sequences
Unit Impulse Sequence
o m
δ(n)
r r .c
b lu
n
⎧
δ(n) = ⎨ 1 n equal 0
⎩ 0 otherwise
r t u
or a
δ ( n ) = {– – – , 0, 0, 0, 1, 0, 0, 0, 0, – – – } -3 -2
Sm
-1 0 1 2 3 n
v i a
Unit Step Sequence
e d
ar u(n)
⎧
u(n) = ⎨ 1 (n ≥ 0)
S h
⎩ 0
is
otherwise
or
if le
h i s
u ( n ) = {– – – , 0, 0, 0, 1, 1, 1, 1, 1, – – – } -3 -2 -1 0 1 2 3 n
T
MOHAMMED EL-TANANY, PROFESSOR
SYSTEMS & COMPUTER ENGINEERING, CARLETON UNIVERSITY, OTTAWA, ONTARIO 5 / 23
We provide unlocked studymaterials from popular websites at affordable price, email enquiries to rishabhk28@live.com
D i g i t a l S i g n a l P r o c e s s i n g S Y S C 5 6 0 2 _ D T _ s i g n a l s & s e q u e n c e s _ 2 0 0 9 . f m
Constant sequence
x(n)
o m
x(n) = A for ( –∞ ≤ n ≤ ∞ )
r r .c
b lu
u n
r t
-3 -2 -1 0
a 1 2 3 n
Linear Sequence Sm
v i a
d
x(n)
r e
x ( n ) = An for ( –∞ ≤ n ≤ ∞ )
h a
s S
i
if le
h i s
T -3 -2 -1 0 1 2 3 n
u(n-n0)
o m
⎧ 1
r r .c
lu
( n ≥ n0 )
u ( n – n0 ) = ⎨
⎩ 0 otherwise
n b
r t u
a
Sm
n0 n0+2 n0+4 n
is
if le
h i s n0 n
T
MOHAMMED EL-TANANY, PROFESSOR
SYSTEMS & COMPUTER ENGINEERING, CARLETON UNIVERSITY, OTTAWA, ONTARIO 7 / 23
We provide unlocked studymaterials from popular websites at affordable price, email enquiries to rishabhk28@live.com
D i g i t a l S i g n a l P r o c e s s i n g S Y S C 5 6 0 2 _ D T _ s i g n a l s & s e q u e n c e s _ 2 0 0 9 . f m
x(m ) • δ(n – m)
r r .c
m = –∞
b lu
u n
For example the sequence:
r t
a
x ( n ) = { – – – – – – – – , 0 , 0 , 2 , 1 , 2 , 0 , 0, 0, 0, – – – – – – – , }
Sm
x(n)
v i a
e d
ar
S h
is
if le
-1 +1 n
h i s
can be written as
T x ( n ) = 2δ ( n + 1 ) + δ ( n ) + 2δ ( n – 1 )
2δ(n+1)
o m
r r .c
lu
n
-1
δ(n)
n b
r t u
a
Sm
n
0
2δ(n-1)
v i a
ed+1
n
ar
h
x(n)
s S
i
if le
s
-3 -2 -1 0 1 2 3 n
h i
T
MOHAMMED EL-TANANY, PROFESSOR
SYSTEMS & COMPUTER ENGINEERING, CARLETON UNIVERSITY, OTTAWA, ONTARIO 9 / 23
We provide unlocked studymaterials from popular websites at affordable price, email enquiries to rishabhk28@live.com
D i g i t a l S i g n a l P r o c e s s i n g S Y S C 5 6 0 2 _ D T _ s i g n a l s & s e q u e n c e s _ 2 0 0 9 . f m
x(n) = a
n
o m
where a is a real constant and –∞ ≤ n ≤ ∞ .
r r .c
b lu
n
stem plot of a causal exponential sequence,a = 0.9 stem plot of a causal exponential sequence,a = -0.9
u
1.2
t
1
1
0.8
0.5
a r
Sm
0.6 0
i a
0.4 -0.5
0.2
v -1
ed
0
0 5 10 15 0 5 10 15
ar
h
stem plot of a causal exponential sequence,a = 1.1 stem plot of a causal exponential sequence,a = -1.1
5 6
s S 4
i
4
if le
3
0
2
i s
-2
h
1
-4
T 0
0 5 10 15
-6
0 5 10 15
The appearance of x(n) vs n depends on the absolute value (and sign) of a. For
example, consider the sequence y ( n ) = a n u ( n ) . This sequence is causal. It is depicted
above for various conditions on a
o m
Complex Unit Exponential Sequence
r r .c
p ( n ) = exp ⎛ ------------⎞
j2πn
b lu
⎝ N ⎠
u n
r t
p(n) =
j2πn 2
⎝ N ⎠
j2πn 2
⎝ N ⎠ a
cos ⎛ ------------⎞ + sin ⎛ ------------⎞ = 1
Sm
a
The phase angle of p(n) is given by:
v i
d
2πn
φ = angle [ p ( n ) ] = ----------
e N
r in a complex plane, as a unit vector, which
a
rotates around the origin by h
p(n) can be represented graphically
S 2π
an angle radian every sample period.
------
l e
origin every N isample
p(n), viewed as a vector
f period.
i s
Th
p(n) is periodic with period N.
Imaginary
o m
.c
n=2,10
r r
lu
n=3,11 n=1,9
n b
n=4,12
r t
n=0,8 u
a Real
Sm
v i a n=7,15
n=5,13
e d
Radius = 1
ar n=6,14
S h
Graphical representation for p ( n ) = exp ⎛ ------------⎞
j2πn
⎝ 8 ⎠
i s
if le
p(n) may also be represented using its real and imaginary components as depicted
i s
next for a case of N = 8.
h
T
MOHAMMED EL-TANANY, PROFESSOR
SYSTEMS & COMPUTER ENGINEERING, CARLETON UNIVERSITY, OTTAWA, ONTARIO 12 / 23
We provide unlocked studymaterials from popular websites at affordable price, email enquiries to rishabhk28@live.com
D i g i t a l S i g n a l P r o c e s s i n g S Y S C 5 6 0 2 _ D T _ s i g n a l s & s e q u e n c e s _ 2 0 0 9 . f m
o m
.c
1
r r
lu
0.5
n b
-0.5
r t u
a
Sm
-1
0 5 10 15
1
i a
stem plot of the imaginary part of a unit complex exp, N=8
v
e d
r
0.5
h a
s S
i
-0.5
if le
-1
0 5 10 15
h i s
T
MOHAMMED EL-TANANY, PROFESSOR
SYSTEMS & COMPUTER ENGINEERING, CARLETON UNIVERSITY, OTTAWA, ONTARIO 13 / 23
We provide unlocked studymaterials from popular websites at affordable price, email enquiries to rishabhk28@live.com
D i g i t a l S i g n a l P r o c e s s i n g S Y S C 5 6 0 2 _ D T _ s i g n a l s & s e q u e n c e s _ 2 0 0 9 . f m
Periodicity
A sequence x(n) is periodic with a period N, where N is a positive integer, if the
following condition is satisfied:
o m
x(n) = x(n + N)
r rfor – ∞ ≤ n ≤ ∞ .c
If x(n) is periodic with period N, it must also be periodic with periodlu
n b 2N, 3N, ....... In
u
other words:
r t
x ( n ) = x ( n + mN )
for
a m = 0, 1 , 2 , 3 , – – – – – – – –
Sm
The smallest period of x(n) is its fundamental period.
v i a
Example
e d
x(n) is obtained by sampling ar
h
1
p ( t ) = cos ( 2πf 0 t )
every seconds interval. T = ---
S
fs
i
Is x(n) periodic? under swhat conditions?
if lex(n) can be obtained from x(t) by substituting t=nT.
An expression for
i s
Th
⎛ f 0⎞
p ( n ) = cos ( 2πf 0 nT ) = cos ⎜ 2πn ----⎟ = cos ( αn )
⎝ fs⎠
f0
where α = 2π ----
fs
p ( n ) = cos ( αn )
o m
.c
Assume is periodic with period N. Therefore
p ( n ) = p ( n + N ) ......i.e.
r r
cos ( αn ) = cos [ α ( n + N ) ] = cos ( αn + αN )
b lu
u n
Therefore
r t
a
Sm
f0
αN = 2πk = 2π ---- k
fs
h
N
S
f0 must be a rational multiple of the sampling frequency.
s
i
if le
h i s
T
MOHAMMED EL-TANANY, PROFESSOR
SYSTEMS & COMPUTER ENGINEERING, CARLETON UNIVERSITY, OTTAWA, ONTARIO 15 / 23
We provide unlocked studymaterials from popular websites at affordable price, email enquiries to rishabhk28@live.com
D i g i t a l S i g n a l P r o c e s s i n g S Y S C 5 6 0 2 _ D T _ s i g n a l s & s e q u e n c e s _ 2 0 0 9 . f m
Sm
120 60
0.8
0.6
a
150 30
i
0.4
Graphical representation of a
v 0.2
S h 210 330
is 240 300
if le
270
h i s
Such a sequence may be used to generate a decaying exponential sequence. For
T
example:
n 2πn
y ( n ) = real [ p ( n ) ] = A • a • cos ---------- + Φ
N
o m
r r .c
b lu
u n
r t
a
Sm
v i a
e d
ar
S h
is
if le
h i s
T
MOHAMMED EL-TANANY, PROFESSOR
SYSTEMS & COMPUTER ENGINEERING, CARLETON UNIVERSITY, OTTAWA, ONTARIO 17 / 23
We provide unlocked studymaterials from popular websites at affordable price, email enquiries to rishabhk28@live.com
D i g i t a l S i g n a l P r o c e s s i n g S Y S C 5 6 0 2 _ D T _ s i g n a l s & s e q u e n c e s _ 2 0 0 9 . f m
m
32
by taking the real part of x(n), which gives
b lu
1
u n
r t
a
0.5
Sm
0
-0.5
0 5 10 15
v i
20a 25 30 35 40
r ed
imaginary
a
1
0.5
S h
0
i s
if le
-0.5
i s
0 5 10 15 20 25 30 35 40
T h
Decaying sinusoidal sequences obtained from the complex sequence:x ( n ) = ( 0.95 ) • exp ⎛ ------------⎞
n j2πn
⎝ 32 ⎠
v i a
e d
2π
ar
S h N
is
if le
Now consider the sequence:
h i s p l ( n ) = exp ⎛ ------------⎞
j2πn
⎝ N ⎠
T
MOHAMMED EL-TANANY, PROFESSOR
SYSTEMS & COMPUTER ENGINEERING, CARLETON UNIVERSITY, OTTAWA, ONTARIO 19 / 23
We provide unlocked studymaterials from popular websites at affordable price, email enquiries to rishabhk28@live.com
D i g i t a l S i g n a l P r o c e s s i n g S Y S C 5 6 0 2 _ D T _ s i g n a l s & s e q u e n c e s _ 2 0 0 9 . f m
p 1 ( n ) = exp ⎛ ------------⎞ b l u
n
j2πn
rate of change of . Therefore, P (n) is the lth harmonic
⎝ N ⎠
of p (n).
u
l 1
e d
a r
S h
is
if le
i s
Th
MOHAMMED EL-TANANY, PROFESSOR
SYSTEMS & COMPUTER ENGINEERING, CARLETON UNIVERSITY, OTTAWA, ONTARIO 20 / 23
We provide unlocked studymaterials from popular websites at affordable price, email enquiries to rishabhk28@live.com
D i g i t a l S i g n a l P r o c e s s i n g S Y S C 5 6 0 2 _ D T _ s i g n a l s & s e q u e n c e s _ 2 0 0 9 . f m
o m
.c
6 6
r r
x(n)
5
4
lu
x(n)
b
4
n
2
u
3
2
0
r t
a
n
Sm
1
-2
i a
n -4
v
-1
d
-6
-6 -4 -2 0 2 4 6
e
-2
-6 -4 -2 0 2 4 6
h a
A sequence x(n) is even-symmetric
x ( n ) = x ( –n )
s S –∞ ≤ n ≤ ∞
i
for for x ( n ) = –x ( –n ) –∞ ≤ n ≤ ∞
i s
Th as follows:
An arbitrary sequence x(n) can be represented in terms of an even and an odd
sequence
x ( n ) = xe ( n ) + xo ( n )
1
x e ( n ) = --- [ x ( n ) + x ( – n ) ]
2
1
x o ( n ) = --- [ x ( n ) – x ( – n ) ]
o m
.c
2
r r
b lu
n
5 4
u
x(n)
t
x (n)
4 e
r
3
a
Sm
2
2
a
1
i
1
v
d
0 0
-4 -3 -2 -1 0 1 2 3 4 -4 -3 -2 -1 0 1 2 3 4
r e
5
h a 2
S
x (n)
o
4
x(-n)
s
1
i
3
if le
0
2
i s
-1
1
T h 0
-4 -3 -2 -1 0 1 2 3 4
-2
-4 -3 -2 -1 0 1 2 3 4
Operations
m
Scaling Delay
.c o
x(n) K Kx(n)
r rx(n-n )
lu
x(n) delay nd
b
d
x(n) Kx(n)
u n
r t
K a
Sm
x(n) z –nd x(n-nd)
x(n) K Kx(n)
v i a
e d
Multiplication
ar Add/ subtract
S h
is
if le x (n)x (n)
x (n)1 x1(n)
i s 1 2 x1(n)+x2(n)
Txh(n)2
x2(n)