Professional Documents
Culture Documents
Lecture 1: Introduction,
Discrete-time signals and systems
Zheng-Hua Tan
Department of Electronic Systems
Aalborg University, Denmark
zt@kom.aau.dk
Part I: Introduction
General information
Course website
http://kom.aau.dk/~zt/cources/DSP/
Textbook:
Readings:
General information
Duration
Prerequisites:
Course type:
Lecturer:
Course at a glance
MM1
Discrete-time
signals and systems
MM2
Fourier-domain
representation
Sampling and
reconstruction
System
System
structures
System
analysis
MM6
MM5
Filter
MM4
z-transform
MM3
5
DFT/FFT
Filter structures
MM9,MM10
MM7
Filter design
MM8
What is a signal ?
A flow of information.
(mathematically represented as) a function of
independent variables such as time (e.g.
speech signal), position (e.g. image), etc.
A common convention is to refer to the
independent variable as time, although may
in fact not.
Example signals
Types of signals
10
Continuous-time signals
Discrete-time signals are defined at discrete times and
represented as sequences of numbers
Types of signals
From http://www.ece.rochester.edu/courses/ECE446
11
12
Basic sequences
Unit sample sequence (discrete-time impulse,
impulse)
0,
1,
[ n] =
n 0,
n = 0,
x[n] = a 3 [n + 3] + a 2 [n + 3] + ... + a5 [n 5]
More generally
x[k ] [n k ]
x[n] =
k =
21
Defined as
1,
u[n] =
0,
n 0,
n < 0,
Conversely,
k =
k =0
u[k ] [n k ] = [n k ]
11
Sinusoidal sequences
x[n] = A cos( 0 n + ),
for all n
If =| | e j0 and A =| A | e j , then
x[n] = A n =| A | e j | |n e j0 n
=| A || |n e j (0 n + )
=| A || |n cos( 0 n + ) + j | A || |n sin( 0 n + )
25
26
13
Consider a frequency ( 0 + 2 )
x[n] = Ae j (0 + 2 ) n = Ae j0 n e j 2n = Ae j0 n
x[n] = Ae j (0 + 2r ) n = Ae j0 n e j 2rn = Ae j0 n
< 0 or 0 0 < 2
27
x[n] = x[n + N ],
for all n
A cos( 0 n + ) = A cos(0 n + 0 N + )
14
Consider
with a period of N = 8
with a period of N = 16
x[n] = A cos(0 n + ),
as 0 increases from 0 towards , x[n] oscillates more and more rapidly
as 0 increases from towards 2 , the oscillations become slower.
30
15
Basic sequences
Unit sample sequence (discrete-time impulse,
impulse)
0,
1,
[ n] =
n 0,
n = 0,
x[n] = a 3 [n + 3] + a 2 [n + 3] + ... + a5 [n 5]
More generally
x[k ] [n k ]
x[n] =
k =
21
Defined as
1,
u[n] =
0,
n 0,
n < 0,
Conversely,
k =
k =0
u[k ] [n k ] = [n k ]
11
Discrete-time systems
A transformation or operator that maps input into
output
y[n] = T {x[n]}
x[n]
y[n]
T{.}
Examples:
y[n] = x[n nd ],
A memoryless system
y[n] = ( x[n]) 2 ,
33
< n <
< n <
Linear systems
A system is linear if and only if
additivity property
scaling property
34
17
Sinusoidal sequences
x[n] = A cos( 0 n + ),
for all n
If =| | e j0 and A =| A | e j , then
x[n] = A n =| A | e j | |n e j0 n
=| A || |n e j (0 n + )
=| A || |n cos( 0 n + ) + j | A || |n sin( 0 n + )
25
26
13
Consider a frequency ( 0 + 2 )
x[n] = Ae j (0 + 2 ) n = Ae j0 n e j 2n = Ae j0 n
x[n] = Ae j (0 + 2r ) n = Ae j0 n e j 2rn = Ae j0 n
< 0 or 0 0 < 2
27
x[n] = x[n + N ],
for all n
A cos( 0 n + ) = A cos(0 n + 0 N + )
14
Consider
with a period of N = 8
with a period of N = 16
x[n] = A cos(0 n + ),
as 0 increases from 0 towards , x[n] oscillates more and more rapidly
as 0 increases from towards 2 , the oscillations become slower.
30
15
Frequency
31
32
Introduction
Discrete-time signals
Discrete-time systems
Linear time-invariant systems
16
Discrete-time systems
A transformation or operator that maps input into
output
y[n] = T {x[n]}
x[n]
y[n]
T{.}
Examples:
y[n] = x[n nd ],
A memoryless system
y[n] = ( x[n]) 2 ,
33
< n <
< n <
Linear systems
A system is linear if and only if
additivity property
scaling property
34
17
Time-invariant systems
35
Causality
Example
36
y[n] = x[n nd ],
< n <
18
Stability
Example
y[n] = ( x[n]) 2 ,
< n <
stable
37
38
Course overview
Discrete-time signals
Discrete-time systems
Linear time-invariant systems
19
x[k ]T { [n k ]} =
k =
x[k ]h [n]
k =
x[k ]h[n k ]
k =
= x[n] * h[n]
39
Convolution sum
40
20
x[k ]h[n k ]
k =
41
0,
n < 0,
1 a n +1
,
0 n N 1,
y[n] =
1 a
N
a n N +1 (1 a ), N 1 < n.
1 a
42
21
Commutative
Linear
Stable
S=
| h[k ] |<
k =
Causality
h[n] = 0,
44
n<0
22
MATLAB
45
Summary
46
Course overview
Discrete-time signals
Discrete-time systems
Linear time-invariant systems
Matlab functions for the exercises in this
lecture are available at
http://kom.aau.dk/~zt/cources/DSP_E/MM1/
Thanks Borge Lindberg for providing the
functions.
Digital Signal Processing, I, Zheng-Hua Tan, 2006
23