Discrete-Time Signals and Systems

Introduction
Discrete-Time Signals and Systems
The Taxonomy of Signals
Signal: A function that conveys information
Time
Amplitude
analog signals
continuous-time
signals
discrete-time
signals
digital signals
Continuous
Continuous
Discrete
Discrete
Signal Process Systems
Signal
Processing
System
signal
output
Facilitate the extraction
of desired information
e.g.,
Filters
Parameter estimation
Signal Process Systems
analog
system
signal output
continuous-time signal continuous-time signal
discrete-
time
system
signal output
discrete-time signal discrete-time signal
digital
system
signal output
digital signal digital signal
A important class of systems
Signal Process Systems
Linear Shift-Invariant Systems.
Linear Shift-Invariant Discrete-Time Systems.
In particular, well discuss
Discrete-Time Signals---
Sequences
Discrete-Time Signals and Systems
Representation by a Sequence
Discrete-time system theory
Concerned with processing signals that are
represented by sequences.
< < = n n x x )}, ( {
1 2
3 4 5 6 7
8 9 10 -1 -2 -3 -4 -5 -6 -7 -8
n
x(n)
Important Sequences
Unit-sample sequence o(n)

=
=
= o
0 0
0 1
) (
n
n
n
1 2 3 4 5 6 7 8 9 10 -1 -2 -3 -4 -5 -6 -7 -8
n
o(n)
Sometime call o(n)
a discrete-time impulse; or
an impulse
Important Sequences
Unit-step sequence u(n)

<
>
=
0 0
0 1
) (
n
n
n u
1 2 3 4 5 6 7 8 9 10 -1 -2 -3 -4 -5 -6 -7 -8
n
u(n)
Fact:
) 1 ( ) ( ) ( = o n u n u n
Important Sequences
Real exponential sequence
n
a n x = ) (
1 2 3 4 5 6 7 8 9 10 -1 -2 -3 -4 -5 -6 -7 -8
n
x(n)
. . .
. . .
Important Sequences
Sinusoidal sequence
) cos( ) (
0
| + e = n A n x
n
x(n)
Important Sequences
Complex exponential sequence
n j
e n x
) (
0
) (
e + o
=
Important Sequences
A sequence x(n) is defined to be periodic with
period N if
N N n x n x all for ) ( ) ( + =
Energy of a Sequence
Energy of a sequence is defined by
| ) ( |
2

=
=
=
n
n
n x E
Operations on Sequences
Sum
Product
Multiplication
Shift
)} ( ) ( { n y n x y x + = +
)} ( ) ( { n y n x y x =
)} ( { n x x o = o
) ( ) (
0
n n x n y =
Sequence Representation
Using delay unit

=
o =
k
k n k x n x ) ( ) ( ) (
1
2
3 4 5 6
7
8 9 10 -1 -2 -3 -4 -5 -6 -7 -8
n
x(n)
a
1
a
2 a
7
a
-3
) 7 ( ) 3 ( ) 1 ( ) 3 ( ) (
7 2 1 3
o + o + o + + o =

n a n a n a n a n x
Linear Shift-Invariant
Systems
Discrete-Time Signals and Systems
Systems
T [ ] x(n)
y(n)=T[x(n)]
Mathematically modeled as a unique
transformation or operator.
Linear Systems
T [ ] x(n)
y(n)=T[x(n)]
)] ( [ )] ( [ )] ( ) ( [
2 1 2 1
n x bT n x aT n bx n ax T + = +
22
1.1.3.2. Time-Invariant vs. Time-Variable Systems.
Definition
.
Definition. A relaxed system is time- or shift-invariant if
only if
implies that
for every input signal and every time shift k .
[.] H
( ) ( )
H
x n y n
( ) ( )
H
x n k y n k
( ) x n
| |
( ) ( ) y n H x n
| |
( ) ( ) y n k H x n k
Examples:
Ideal Delay System
) ( ) (
d
n n x n y =
Accumulator

=
=
n
k
k x n y ) ( ) (
Moving Average

=
=

+ +
=
M k
M k
k n x
M M
n y
1
) (
1
1
) (
2 1
T [ ] x(n)
y(n)=T[x(n)]
Examples:
Ideal Delay System
) ( ) (
d
n n x n y =
Accumulator

=
=
n
k
k x n y ) ( ) (
Moving Average

=
=

+ +
=
M k
M k
k n x
M M
n y
1
) (
1
1
) (
2 1
T [ ] x(n)
y(n)=T[x(n)]
Examples:
A Memoryless System
2
)] ( [ ) ( n x n y =
T [ ] x(n)
y(n)=T[x(n)]
T [ ] x(n)
y(n)=T[x(n)]
Linear Systems
) ( ) ( ) ( k n k x n x
k
o =

=
(

o =

=
) ( ) ( ) ( k n k x T n y
k
)] ( [ ) ( ) ( k n T k x n y
k
o =

=
) ( ) ( n h k x
k
k

=
=
Shift-Invariant Systems
x(n)
y(n)=T[x(n)]
T [ ]
x(n-k)
y(n-k)
x(n)
y(n)
x(n-1)
y(n-1)
x(n-2)
y(n-2)
Shift-Invariant Systems
x(n)
y(n)=T[x(n)]
T [ ]
x(n-k)
y(n-k)
x(n)
y(n)
x(n-1)
y(n-1)
x(n-2)
y(n-2)
Linear Shift-Invariant Systems
T [ ] x(n)
y(n)=T[x(n)]
) ( ) ( ) ( k n k x n x
k
o =

=
(

o =

=
) ( ) ( ) ( k n k x T n y
k
)] ( [ ) ( ) ( k n T k x n y
k
o =

=
) ( ) ( k n h k x
k
=

=
Linear Shift-Invariant Systems
T [ ] x(n)
y(n)=T[x(n)]
) ( ) ( ) ( k n k x n x
k
o =

=
(

o =

=
) ( ) ( ) ( k n k x T n y
k
)] ( [ ) ( ) ( k n T k x n y
k
o =

=
) ( ) ( k n h k x
k
=

=
Impulse Response
T [ ]
x(n)=o(n)
h(n)=T[o(n)]
0 0
0 0
Convolution Sum
T [ ]
o(n)
h(n)
x(n)
y(n)
) ( * ) ( ) ( ) ( ) ( n h n x k n h k x n y
k
= =

=
convolution
A linear shift-invariant system is completely
characterized by its impulse response.
Characterize a System
h(n)
x(n)
x(n)*h(n)
Properties of Convolution Math
) ( * ) ( ) ( ) ( ) ( n h n x k n h k x n y
k
= =

=
) ( * ) ( ) ( ) ( ) ( n x n h k n x k h n y
k
= =

=
) ( * ) ( ) ( * ) ( n x n h n h n x =
Properties of Convolution Math
h
1
(n)
x(n)
h
2
(n)
y(n)
h
2
(n)
x(n)
h
1
(n)
y(n)
h
1
(n)*h
2
(n)
x(n) y(n)
These systems are identical.
Properties of Convolution Math
h
1
(n)+h
2
(n)
x(n) y(n)
These two systems are identical.
h
1
(n)
x(n)
h
2
(n)
y(n)
+
Example
0 1 2 3 4 5 6
) ( ) ( ) ( N n u n u n x =

<
>
=
0 0
0
) (
n
n a
n h
n
y(n)=?
0 1 2 3 4 5 6
Example
) ( ) ( ) ( * ) ( ) ( k n h k x n h n x n y
k
= =

=
0 1 2 3 4 5 6
k
x(k)
0 1 2 3 4 5 6
k
h(k)
0 1 2 3 4 5 6
k
h(0k)
Example
) ( ) ( ) ( * ) ( ) ( k n h k x n h n x n y
k
= =

=
0 1 2 3 4 5 6
k
x(k)
0 1 2 3 4 5 6
k
h(0k)
0 1 2 3 4 5 6
k
h(1k)
compute y(0)
compute y(1)
How to computer y(n)?
Example
) ( ) ( ) ( * ) ( ) ( k n h k x n h n x n y
k
= =

=
0 1 2 3 4 5 6
k
x(k)
0 1 2 3 4 5 6
k
h(0k)
0 1 2 3 4 5 6
k
h(1k)
compute y(0)
compute y(1)
How to computer y(n)?
Two conditions have to be considered.
n<N and n>N.
Example
) ( ) ( ) ( * ) ( ) ( k n h k x n h n x n y
k
= =

=
1
1
1
) 1 (
0 0
1 1
1
) (

+
=

= = =

a
a a
a
a
a a a a n y
n n
n
n
k
k n
n
k
k n
n < N
n > N
1 1
1
0
1
0
1 1
1
) (

= = =

a
a a
a
a
a a a a n y
N n n N
n
N
k
k n
N
k
k n
Example
) ( ) ( ) ( * ) ( ) ( k n h k x n h n x n y
k
= =

=
1
1
1
) 1 (
0 0
1 1
1
) (

+
=

= = =

a
a a
a
a
a a a a n y
n n
n
n
k
k n
n
k
k n
n < N
n > N
1 1
1
0
1
0
1 1
1
) (

= = =

a
a a
a
a
a a a a n y
N n n N
n
N
k
k n
N
k
k n
0
1
2
3
4
5
0 5 10 15 20 25 30 35 40 45 50
Impulse Response of
the Ideal Delay System
Ideal Delay System
) ( ) (
d
n n x n y =
) ( ) (
d
n n n h o =
By letting x(n)=o(n) and y(n)=h(n),
o(n n
d
)
0 1 2 3 4 5 6
n
d