Professional Documents
Culture Documents
Chapter 2 Discrete-Time Signals and Systems: Signal Processing
Chapter 2 Discrete-Time Signals and Systems: Signal Processing
Chapter 2 Discrete-Time Signals and Systems: Signal Processing
1
Chapter 2 Discrete-Time Signals and Systems
2.0 Introduction
2.1 Discrete-Time Signals: Sequences
2.2 Discrete-Time Systems
2.3 Linear Time-Invariant (LTI) Systems
2.4 Properties of LTI Systems
2.5 Linear Constant-Coefficient
Difference Equations
2 08/13/20
Chapter 2 Discrete-Time Signals and Systems
3 08/13/20
2.0 Introduction
Signal: something conveys information
Signals are represented mathematically as
functions of one or more independent variables.
Continuous-time (analog) signals, discrete-
time signals, digital signals
Signal-processing systems are classified along the
same lines as signals: Continuous-time (analog)
systems, discrete-time systems, digital systems
Discrete-time signal
Sampling a continuous-time signal
Generated directly by some discrete-time process
4 08/13/20
2.1 Discrete-Time Signals: Sequences
5 08/13/20
Figure 2.1 Graphical representation
of a discrete-time signal
7 Figure 2.2
Basic Sequence Operations
Sum of two sequences
x[n] y[n]
Product of two sequences
x[n] y[n]
Multiplication of a sequence by a numberα
x[n]
Delay (shift) of a sequence
y[n] x[n n0 ] n0 : integer
8 08/13/20
Basic sequences
9 08/13/20
Basic sequences
10 08/13/20
Basic sequences
1 n 0
Unit step sequence u[n]
0 n 0
k
n
0, when n 0
k 1, when n 0 ,
u[n] k
k since k 0 k 0
1 k 0
u[n] [n] [n 1] [n 2] [n k ]
k 0
[n] u[n] u[n 1] First backward difference
11 08/13/20
Basic Sequences
Exponential sequences x[n] A n
12 08/13/20
EX. 2.1 Combining Basic sequences
If we want an exponential sequences that is zero for n <0, then
A n
n0
x[n] Cumbersome
0 n0
x[n] A u[n] n
simpler
13 08/13/20
Basic sequences
Sinusoidal sequence
14 08/13/20
Exponential Sequences
j
A Ae e jw0
j n n j w0 n
x[n] A A e e
n jw0 n
A e
A cos w0 n j A sin w0 n
n n
1 x[n] Ae jw0 n
is refered to
Complex Exponential Sequences
15 08/13/20
Frequency difference between
continuous-time and discrete-time
complex exponentials or sinusoids
j w0 2 n j 2n
x[n] Ae Ae jw0 n
e Ae jw0 n
16 08/13/20
Periodic Sequences
A cos w0 n A cos w0 n w0 N
w0 N 2 k , where k is integer
N 2 k / w0 , where k is integer
17 08/13/20
EX. 2.2 Examples of Periodic Sequences
x1[n] cos n / 4
Suppose it is periodic sequence with period N
x1[n] x1[n N ]
cos n / 4 cos n N / 4
n / 4 2 k n / 4 N / 4, k : integer
N 2 k / ( / 4) 8 k
k 1, N 8 2 / w0
18 08/13/20
EX. 2.2 Examples of Periodic Sequences
2
8
3
8
x1[n] cos 3 n / 8
Suppose it is periodic sequence with period N
x1[n] x1[n N ]
cos 3 n / 8 cos 3 n N / 8
3 n / 8 2 k 3 n / 8 3 N / 8, k : integer
N 2 k / w0 2 k / (3 / 8) k 3, N 16
N 2 3 / w0 2 / w0 ( for continuous signal)
19 08/13/20
EX. 2.2 Non-Periodic Sequences
x2 [n] cos n
Suppose it is periodic sequence with period N
x2 [ n ] x 2 [ n N ]
cos n cos(n N )
for n 2 k n N , k : integer,
there is no integer N
20 08/13/20
High and Low Frequencies in Discrete-time signal
x[n] A cos( w0 n)
(a) w0 = 0 or 2
(d) w0 =
21 08/13/20
2.2 Discrete-Time System
x[n] y[n]
T{‧}
Discrete-Time System
22 08/13/20
EX. 2.3 The Ideal Delay System
y[n] x[n nd ], n
If nd is a positive integer: the delay of the
system. Shift the input sequence to the
right by nd samples to form the output .
n-5
n m
24 08/13/20
Effect of a moving average filter. (Sample values are
connected by straight lines to enable easier viewing of stock
exchange trends)
25
Properties of Discrete-time systems
2.2.1 Memoryless (memory) system
Memoryless systems:
the output y[n] at every value of n depends
only on the input x[n] at the same value of n
y n x[n]
2
26 08/13/20
Properties of Discrete-time systems
2.2.2 Linear Systems
If x1 n T{‧} y1 n
x2 n T{‧} y2 n
and only If:
principle of superposition
1 1 1 1
2 2 2
counterexample
10 log10 1 log10 10 1
29 08/13/20
Properties of Discrete-time systems
2.2.3 Time-Invariant Systems
Shift-Invariant Systems
x1 n T{‧} y1 n
x2 n x1 n n0 T{‧} y2 n y1 n n0
30 08/13/20
Example of Time-Invariant System
Ex. 2.8 Accumulator system
n
y n x k
k
x1[n] x n n0
n n n n0
y1 n x k x k n x k y n n
1 0 1 0
k k k1
31 08/13/20
Properties of Discrete-time systems
2.2.4 Causality
32 08/13/20
Ex. 2.10 Example for Causal System
y n x n 1 x n
y n x n x n 1
33 08/13/20
Properties of Discrete-time systems
2.2.5 Stability
Bounded-Input Bounded-Output (BIBO)
Stability: every bounded input sequence
produces a bounded output sequence.
if x n Bx , for all n
34 08/13/20
Ex. 2.11 Test for Stability or Instability
y n x[n]
2
is stable
if x n Bx , for all n
then y n B y B ,
2
x for all n
35 08/13/20
Ex. 2.11 Test for Stability or Instability
n
Accumulator system y n x k
k
0 n 0
x n u n : bounded
1 n 0
n n
0 n0
y n x k x k : not bounded
k k n 1 n 0
principle of superposition
n T{‧} h n
n n0 h n n0
T{‧}
38 08/13/20
LTI Systems: Convolution
Representation of general sequence as a linear
combination of delayed impulse
x n x k n k
k
principle of superposition
y n T x k n k x k T n k
k k
x k h n k x n h n
k
h n k h k n
h k h k
reflecting h[k] about the origion to obtain h[-k]
Shifting the origin of the reflected sequence to
k=n
41 08/13/20
Ex. 2.12
42 08/13/20
Convolution can be realized by
–Reflecting h[k] about the origin to obtain h[-k].
–Shifting the origin of the reflected sequences to k=n.
–Computing the weighted moving average of x[k] by
using the weights given by h[n-k].
43
Ex. 2.13 Analytical Evaluation
of the Convolution
For system with impulse response
1 0 n N 1
h n u n u n N
0 otherwise
input x n a u n
n h(k)
0 otherwise
h(-k) h(k)
0 0
h(n-k) x(k)
0
y n 0 n 0
45
h(-k) h(k)
0 0
n 0, n N 1 0 0 n N 1
n 1
n n
1 a
y n x k h k n a k
k 0 k 0 1 a
46 08/13/20
h(-k) h(k)
0 0
n N 1 0 n N 1
n n
y n x k h k n a k
k n N 1 k n N 1
a n N 1
a n 1
n N 1 1 a
N
a
1 a 1 a
47 08/13/20
0, n0
n 1
1 a
y n , 0 n N 1
1 a
a n N 1 1 a
N
1 a , N 1 n
48 08/13/20
2.4 Properties of LTI Systems
Convolution is commutative
x n h n h n x n
x n h1 n h2 n x n h1 n x n h2 n
49 08/13/20
Cascade connection of systems
h n h1 n h2 n
50 08/13/20
Parallel connection of systems
h n h1 n h2 n
51 08/13/20
Stability of LTI Systems
LTI system is stable if the impulse response
is absolutely summable .
S h k
k
y n h k x n k h k x n k
k k
x n B x y n Bx h k
k
n
1, n 0
h n k u n
k 0, n 0
53 08/13/20
Impulse response of Moving
Average systems
M2
1
h n n k
M 1 M 2 1 k M1
1
, M1 n M 2
M1 M 2 1
0 , otherwise
54 08/13/20
Impulse response of Forward Difference
h n n 1 n
h n n n 1
55
Finite-duration impulse
response (FIR) systems
The impulse response of the system has
only a finite number of nonzero samples.
M2
1
such as: h n n k
M 1 M 2 1 k M1
1
, M1 n M 2
M1 M 2 1
0 , otherwise
The FIR systems always are stable.
S h n
n
56
Infinite-duration impulse
response (IIR)
The impulse response of the system is
infinite in duration.
n
1, n 0
h n k u n
k 0, n 0
a 1 S h n
n
57
Equivalent systems
h n n 1 n n 1
n 1 n 1 n n n 1
58
Inverse system
h n hi n hi n h n n
h n u n n n 1
u n u n 1 n
59
2.5 Linear Constant-Coefficient
Difference Equations
An important subclass of linear time-
invariant systems consist of those
system for which the input x[n] and
output y[n] satisfy an Nth-order linear
constant-coefficient difference equation.
N M
a y n k b x n m
k 0
k
m 0
m
60
Ex. 2.14 Difference Equation
Representation of the Accumulator
n n 1
y n x k , y n 1 x k
k k
n 1
y n x n x k x n y n 1
k
y n y n 1 x n
61
Block diagram of a recursive
difference equation representing an
accumulator
y n y n 1 x n
62
Difference Equation
Representation of the System
63
Solving the difference equation
a y n k b x n m
k 0
k
m 0
m
64
Solving the difference equation
N M
Output:
a y n k b x n m
y n y p n y h n
k m
k 0 m 0
ak y h n k 0
n
m m
m 1
k 0
N
where zm is the roots of k 0
a z
k 0
k
65
Example 2.16 Recursive Computation of
Difference Equation
y n ay n 1 x n , x n K n , y 1 c
y 0 ac K
y1 ay 0 0 a ac K a c aK 2
y 2 ay1 0 a a c aK a c a K
2 3 2
y 3 ay 2 0 a a c a K a c a K
3 2
4 3
y n a c a K
n 1 n
for n 0
66
Example 2.16 Recursive Computation of
Difference Equation
y n ay n 1 x n x n K n y 1 c
for n 1 y n 1 a 1 y n x n
y 2 a y 1 x 1 a c
1 1
y 3 a y 2 x 2 a a c a c
1 1 1 2
y 4 a y 3 x 3 a a c a c
1 1 2 3
y n a c n 1
for n 1
y n a c Ka u n
n 1 n
for all n
67
Periodic Frequency Response
The frequency response of discrete-time
LTI systems is always a periodic function of
the frequency variable w with period 2
h n e
j w 2 j w 2 n
H e
n
j w 2 jwn j 2 n jwn
e e e e
H e j w 2
He jw
68
H e j w 2 r
08/13/20
He ,
jw
for r an integer
Signal Processing - Dr. Arif Wahla
Periodic Frequency Response
We need only specify He
over
jw
0 w 2
or w
The “low frequencies” are frequencies
close to zero
The “high frequencies” are frequencies
close to
71
Frequency Response of Ideal
Band-stop Filter
72
Frequency Response of Ideal
Band-pass Filter
73
Example 2.20 Frequency Response of
the Moving-Average System
1
, M1 n M 2
h n M 1 M 2 1
0, otherwise
M2
1 jwn
He jw
e
M 1 M 2 1 n M
1
jwM1 jw M 2 1
1 e e
M1 M 2 1 jw
1 e
74
Impulse response and
Frequency response
The frequency response of a LTI system
is the Fourier transform of the impulse
response.
He jw
h n e jwn
n
h n
1
2
He e
jw jwn
dw
75
Chapter 2 HW
2.1, 2.4, 2.5, 2.7, 2.11,
2.12,2.15, 2.20
76