Chapter 2 Discrete-time signals and systems - PowerPoint PPT Presentation

About This Presentation
Title:

Chapter 2 Discrete-time signals and systems

Description:

Chapter 2 Discrete-time signals and systems 2.1 Discrete-time signals:sequences 2.2 Discrete-time system 2.3 Frequency-domain representation of – PowerPoint PPT presentation

Number of Views:267
Avg rating:3.0/5.0
Slides: 73
Provided by: acer
Category:

less

Transcript and Presenter's Notes

Title: Chapter 2 Discrete-time signals and systems


1
Chapter 2 Discrete-time signals
and systems
2.1 Discrete-time signalssequences
2.2 Discrete-time system
2.3 Frequency-domain representation
of discrete-time signal and system
2
2.1 Discrete-time signalssequences
2.1.1 Definition
2.1.2 Classification of sequence
2.1.3 Basic sequences
2.1.4 Period of sequence
2.1.5 Symmetry of sequence
2.1.6 Energy of sequence
2.1.7 The basic operations of sequences
3
2.1.1 Definition
EXAMPLE
4
(No Transcript)
5
Generate and plot the sequence in MATLAB
n-15
x1,2,1.2,0,-1,-2,-2.5
stem(n,x, '.')
n09
y0.9.n.cos(0.2pinpi/2)
stem(n,y,'.')
6
(No Transcript)
7
Display the wav speech signal in ULTRAEDIT
8
Display the wav speech signal in COOLEDIT
The whole waveform
Display the wav speech signal in
9
2.1.2 Classification of sequence
Right-side
Left-side
Two-side
Finite-length
Causal
Noncausal
10
2.1.3 Basic sequences
1. Unit sample sequence
2.The unit step sequence
3.The rectangular sequence
11
 4.  Exponential sequence
12
(No Transcript)
13
5. Sinusoidal sequence
14
For convenience, sinusoidal signals are usually
expressed by exponential sequences.
The relationship between ? and O
15
2.1.4 Period of sequence
16
Three kinds of period of sequence
17
2.1.5 Symmetry of sequence
Conjugate-symmetric sequence
Conjugate-antisymmetric sequence
18
(No Transcript)
19
EXAMPLE
n-55 x0,0,0,0,0,1,2,3,4,5,6 xe(xfliplr
(x))/2 xo(x-fliplr(x))/2 subplot(3,1,1) stem
(n,x) subplot(3,1,2) stem(n,xe) subplot(3,1,3) ste
m(n,xo)
Real sequences can be decomposed into two
symmetrical sequences.
20
EXAMPLE
Complex sequences can be decomposed into two
symmetrical sequences.
n-55 xzeros(1,11) x((ngt0)(nlt5))(1j).
05 xe(xconj(fliplr(x)))/2 xo(x-conj(fliplr
(x)))/2 subplot(3,2,1) stem(n,real(x)) subplot(3
,2,2) stem(n,imag(x)) subplot(3,2,3) stem(n,
real(xe)) subplot(3,2,4) stem(n,imag(xe)) subpl
ot(3,2,5) stem(n,real(xo)) subplot(3,2,6) st
em(n,imag(xo))
21
2.1.6 Energy of sequence
22
2.1.7 The basic operations of sequences
23
Basic operations of sequences
24
Original music sequence
Original speech sequences
sequences after scalar multiplication
sequences after vector addition
sequences after vector multiplication
echo
25
The matlab codes on the processions
xwavread('test1.wav',36000) ywavread('test2.wav
',36000) z(xy)/2.0 wavwrite(z,22050,'test3.wa
v') y1y0.5 wavwrite(y1,22050,'test4.wav') y2
zeros(36000,1) for i200036000
y2(i)y(i-20001) end y30.6y0.4y2 wavwrite(
y3,22050,'test5.wav') w01/360001-1/36000' y
4y.w wavwrite(y4,22050,'test6.wav')
Vector addition realizes composition.
scalar multiplication changes the volume.
Delay, scalar multiplication and vector addition
produce echo.
vector multiplication realizes fade-in.
26
The matlab codes on the addition of two sequences
EXAMPLE
27
n-42 x1,-2,4,6,-5,8,10
x1nxn2 n1n-2 x1x x2nxn-4 n2n
4 x2x yn mmin(min(n1),min(n2))
max(max(n1),max(n2)) y1zeros(1,length(m))
y2y1 y1((mgtmin(n1))(mltmax(n1)))x1y2((mgt
min(n2))(mltmax(n2)))x2 y3y1y2 stem(m,y)
Outputy 3 -6 12 18 -15 24 31 -2 4 6
-5 8 10
28
7.convolution sum
stepsturnover, shift, vector multiplication,
addition
29
EXAMPLE
nx010 x0.5.nx nh-14 hones(1,length(nh))
yconv(x,h) stem(min(nx)min(nh)max(nx)max(nh
),y)
30
8.crosscorrelation
aotocorrelation
31
(No Transcript)
32
examplecorrelation detection in digital audio
watermark
33
(No Transcript)
34
(No Transcript)
35
2.1 summary
  • 2.1.1 Definition
  • 2.1.2 Classification of sequence
  • 2.1.3 Basic sequences
  • 2.1.4 Period of sequence
  • 2.1.5 Symmetry of sequence
  • 2.1.6 Energy of sequence
  • 2.1.7 The basic operations of sequences

36
requirementsjudge the period of sequence
calculate convolution with graphical
and analytical
evaluation .
key convolution
37
2.2 Discrete-time system
2.2.1 Definitioninput-output description of
systems
2.2.2 Classification of discrete-time system
2.2.3 Linear time-invariant system(LTI)
2.2.4 Linear constant-coefficient difference
equation
2.2.5. Direct implementation of discrete-time
system
38
2.2.1 definitioninput-output description of
systems
the impulse response
39
EXAMPLE
40
2.2.2 classification of discrete-time system
1.Memoryless (static) system the output
depends only on the current input.
2.Linear system
3.Time-invariant system
4.Causal system the output does not depend
on the latter input.
5.Stable system
41
2.2.3 linear time-invariant system(LTI)
How to get hn from the input and output
42
the impulse response in LTI
EXAMPLE
43
Properties of LTI
Figure 2.12
44
classification of linear time-invariant system
IIR hns length is infinite
the latter input the former
input
FIR must be stable?
45
2.2.4 linear constant-coefficient difference
equation
1.relation with input-output description and
convolution
For IIR,the latter two are consistent.
EXAMPLE
input-output description
convolution description infinite
items,unrealizable
difference equation description Finite items,
realizable
46
EXAMPLE
For FIR,the followings are consistent
input-output description and difference equation
description (non-recursion)
Convolution description
Another difference equation description,recursion,
lower rank
For FIR and IIR,difference equations are not
exclusive.
47
2.Recursive computation of difference equations
For IIR, there needs N initial conditions , then
,the solution is unique. For FIR, there needs
no initial conditions. With initial-rest
conditions (linear, time invariant, and causal),
the solution is unique.
EXAMPLE
48
3.computation of difference equations with
homogeneous and particular solution
49
2.2.5. Direct implementation of discrete-time
system
EXAMPLE
50
EXAMPLE
51
EXAMPLE
The matlab codes on the direct realization of LTI
B1 A1,-1 n0100 xngt0
yfilter(B,A,x) stem(n,y) axis(0,20,0,20)
52
2.2 summary
2.2.1 Definitioninput-output description of
systems
2.2.2 Classification of discrete-time system
2.2.3 Linear time-invariant system(LTI)
2.2.4 Linear constant-coefficient difference
equation
2.2.5. Direct implementation of discrete-time
system
53
keys judge the type of a system(from the
relationship between the input and output, and
from hn for LTI). the physics meaning of
convolution representation for LTI the output
signals are the weighted combination of the input
signals, hn is the weight? the similarities
and differences between linear constant-coefficien
t difference equations and convolution
representation,recursive computation? the
difference between IIR and FIR FIR
IIR hn finite length
infinite length yn?xn??? finite items
infinite items
realization convolution or
difference difference , recursion
stability stable maybe
stable
54
2.3 frequency-domain representation of
discrete-time signal and system
2.3.1 definition of fourier transform
2.3.2 frequency response of system
2.3.3 properties of fourier transform
55
EXAMPLE
The intuitionistic meaning of frequency-domain
representation of signals
56
The intuitionistic meaning of frequency-domain
representation of systems
57
The effect of lowpass and highpass filters to
image signals
EXAMPLE
58
Frequency-domain analysis of de-noise process
through bandstop filter
59
Derivation of Fourier transform
60
2.3.1 definition of fourier transform
61
EXAMPLE
subplot(2,2,1) fplot('real(1/(1-0.2exp(-1jw)))
',-2pi,2pi) title('??') subplot(2,2,2) fplot
('imag(1/(1-0.2exp(-1jw)))',-2pi
,2pi) title('??') subplot(2,2,3) fplot('abs(1/
(1-0.2exp(-1jw)))',-2pi,2pi) title('??') s
ubplot(2,2,4) fplot('angle(1/(1-0.2exp(-1jw)))
',-2pi,2pi) title('??')
Matlab codes to draw the frequency chart of
signals
62
Fourier transforms of non-absolutely summable or
non-square summable signals
EXAMPLE

63
2.3.2 frequency response of system
64
Ideal filter in frequency and time domain
EXAMPLE
65
Matlab codes to draw the frequency response of a
system
EXAMPLE
h1,0,0,0,0,0,0,0,0,0.5 freqz(h,1)
66
Eigenfunction and steady-state response
67
causal FIR system acts on causal signal
Causal and stable IIR system acts on causal signal
Figure 2.20
68
example of steady-state response
Sin(0.1pin)
hn1,1,1,1,1,1,1,1,1,1/4
B1,0,1,0,1A1,0.81,0.81,0.81
69
2.3.3 properties of fourier transform
70
(No Transcript)
71
(No Transcript)
72
(No Transcript)
73
2.3 summary
2.3.1 definition of fourier transform
2.3.2 frequency response of system
2.3.3 properties of fourier transform
requirementscalculation of fourier
transforms steady-state response linearity
time shifting frequency shifting the
convolution theorem windowing theorem Parsevals
theorem symmetry properties
74
Keys and difficulties the convolution
theorem the frequency spectrum of a real
sequence is conjugate symmetric the frequency
spectrum of a conjugate symmetric sequence is a
real function.
exercises 2.35 2.45 2.57
Write a Comment
User Comments (0)
About PowerShow.com