Professional Documents
Culture Documents
Signals Lect 1 - 20
Signals Lect 1 - 20
POPRAWIC pszyklady
1
Feb 2020
Lecture 1
2
Feb 2020
Lecture 1
Recommended textbook
- Hwei P. Hsu, Theory and Problems of Signals and Systems,
Schaum’s Outlines, McGraw-Hill, 1995.
- Monson H. Hayes, Theory and Problems of Digital Signal
Processing, Schaum’s Outlines, McGraw-Hill, 1999.
3
Feb 2020
Lecture 1
Lecture 1.
• Signal classification
• Complex numbers
• Description of continuous-time signals
• Description of discrete-time signals
4
Feb 2020
Lecture 1
5
Feb 2020
Lecture 1
6
Feb 2020
Lecture 1
System?
A system is an object with one or more input signals and one or more
outputs
System
x(t) y(t)
Insignaler Utsignaler
7
Feb 2020
Lecture 1
Signal examples
A signal carries an information
8
Feb 2020
Lecture 1
9
Feb 2020
Lecture 1
Signal classification
10
Feb 2020
Lecture 1
Determinstic signals
11
Feb 2020
Lecture 1
12
Feb 2020
Lecture 1
Signal Types
13
Feb 2020
Lecture 1
Signal-to-noise ratio
PS
SNR = 10 log
PN
– PS = signal power
– PN = noise power
14
Feb 2020
Lecture 1
Quantization
Amplitude quantization
15
Feb 2020
Lecture 1
Signal processing
16
Feb 2020
Lecture 1
17
Feb 2020
Lecture 1
-1
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
t/p
• Discrete-time signals (discrete time) 1
Time-discrete signal
-0.5
-1
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
t/p
Time- & amplitude-discrete signal
• Digital = discrete-time and discrete- 1
amplitude 0.5
-0.5
-1
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
t/p
18
Feb 2020
Lecture 1
Sampling
• Discretization of an analog signal is called sampling, and means that one reads the
signal amplitude at certain specified times.
• How is the information of the signal is sampled? Is there any information left after
sampling? (Answer later in this course)
Music signal
0.3
0.2
0.1
0
-0.1
-0.2
1 2 3 4 5 6 7 8 9 10 11
Time [ms]
Sampled music signal
0.4
0.3
0.2
0.1
0
-0.1
-0.2
-0.3
0 10 20 30 40 50 60 70 80 90 100
Samples
19
Feb 2020
Lecture 1
Sampling
Quantizing
Encoding
20
Feb 2020
Lecture 1
Periodic Sampling
• Sampling is, in general, not reversible
0.5
-0.5
-1
0 20 40 60 80 100
Fundamental issue:
• Under which conditions an analog signal can be sampled without loss so that it
can be reconstructed perfectly?
21
Feb 2020
Lecture 1
Discrete-Time Systems
y [ n ] = 1.97 y [ n − 1] − y [ n − 2 ]
22
Feb 2020
Lecture 1
Discrete-Time Systems
The equation
y [ n ] = 1.97 y [ n − 1] − y [ n − 2 ]
says in words
“The signal value at any time n is 1.97 times the signal value at the
previous time [n -1] minus the signal value at the time before that
[n - 2].”
If we know the signal value at any two times, we can compute its
value at all other (discrete) times. This is quite similar to a
second-order differential equation for which knowledge of two
independent initial conditions allows us to find the solution for all
time and the solution methods are very similar.
23
Feb 2020
Lecture 1
Discrete-Time Systems
y [ n ] = 1.97 y [ n − 1] − y [ n − 2 ]
We could solve this equation by iteration using a computer.
yn = 1 ; yn1 = 0 ; Initial Conditions
while 1,
yn2 = yn1 ; yn1 = yn ; yn = 1.97*yn1 - yn2 ;
end
24
Feb 2020
Lecture 1
Discrete-Time Systems
y [ n ] = 1.97 y [ n − 1] − y [ n − 2 ]
With the initial conditions y[1] = 1 and y[0] = 0 the response is
25
Feb 2020
Lecture 1
Feedback Systems
In a feedback system the response of the system is “fed back” and
combined with the excitation is such a way as to optimize
the response in some desired sense. Examples of feedback
systems are:
26
Feb 2020
Lecture 1
Feedback Systems
27
Feb 2020
Lecture 1
Feedback Systems
28
Feb 2020
Lecture 1
29
Feb 2020
Lecture 1
30
Feb 2020
Lecture 1
Complex numbers
31
Feb 2020
Lecture 1
Girolamo’s Problem
In The Great Art, published in 1545, Girolamo Cardano discusses the following problem.
No Intersection!
x + y = 10
xy = 40
12
10
x(10 - x) = 40
6
- x 2 + 10 x - 40 = 0 2
- 10 ± 10 2 - 4 × (-1) × (-40)
x=
-2
= 5 ± - 15
Due to the symmetry in the problem, x and y take on ± values.
32
Feb 2020
Lecture 1
Example:
Example:
33
Feb 2020
Lecture 1
Modulus
real axis
imaginary axis
34
Feb 2020
Lecture 1
Euler’s formula
Example:
The modulus of
35
Feb 2020
Lecture 1
real axis
phase angle
imaginary axis
36
Feb 2020
Lecture 1
Mathematical Description of
Continuous-Time Signals
37
Feb 2020
Lecture 1
38
Feb 2020
Lecture 1
39
Feb 2020
Lecture 1
Continuous-Time Sinusoids
() ( ) (
g t = Acos 2π t / T0 + θ = Acos 2π f0t + θ = Acos ω 0t + θ ) ( )
↑ ↑ ↑ ↑ ↑
Amplitude Period Phase Shift Cyclic Radian
(s) (radians) Frequency Frequency
(Hz) (radians/s)
40
Feb 2020
Lecture 1
Continuous-Time Exponentials
g ( t ) = Ae−t /τ
↑ ↑
Amplitude Time Constant (s)
41
Feb 2020
Lecture 1
Complex Sinusoids
42
Feb 2020
Lecture 1
Basic signals
sign
r (t ) = t.U (t )
• Ramp signal 1
t
u 1
43
Feb 2020
Lecture 1
⎧ 1 , t > 0⎫
⎪ ⎪
sgn ( t ) = ⎨ 0 , t = 0 ⎬
⎪−1 , t < 0 ⎪
⎩ ⎭
44
Feb 2020
Lecture 1
⎧1 , t > 0
⎪
u ( t ) = ⎨1 / 2 , t = 0
⎪0 , t < 0
⎩
45
Feb 2020
Lecture 1
⎧t , t > 0 ⎫ t
ramp ( t ) = ⎨ ⎬ = ∫ u (λ ) dλ = t u (t )
⎩ 0 , t ≤ 0 ⎭ −∞
46
Feb 2020
Lecture 1
⎧ 1 , t <1/ 2⎫
⎪ ⎪
rect ( t ) = ⎨1 / 2 , t = 1 / 2 ⎬ = u ( t + 1 / 2 ) − u ( t − 1 / 2 )
⎪ 0 , t > 1 / 2⎪
⎩ ⎭
47
Feb 2020
Lecture 1
48
Feb 2020
Lecture 1
49
Feb 2020
Lecture 1
∫ g (t )δ (t − t ) dt = g (t )
−∞
0 0
δ ( a ( t − t 0 )) =
1
δ (t − t0 )
a
This property illustrates that the impulse is different from
ordinary mathematical functions.
50
Feb 2020
Lecture 1
51
Feb 2020
Lecture 1
Combinations of Functions
52
Feb 2020
Lecture 1
53
Feb 2020
Lecture 1
54
Feb 2020
Lecture 1
∫ x ( t ) dt
2
Ex =
−∞
55
Feb 2020
Lecture 1
T T
where T is any period of the signal.
56
Feb 2020
Lecture 1
A signal with infinite signal energy and finite average signal power
is called a power signal.
57
Feb 2020
Lecture 1
Mathematical Description of
Discrete-Time Signals
58
Feb 2020
Lecture 1
( )
x ⎡⎣ n ⎤⎦ = x nTs where Ts is the time between samples
59
Feb 2020
Lecture 1
60
Feb 2020
Lecture 1
Sinusoids
Periodic Periodic
Periodic Aperiodic
61
Feb 2020
Lecture 1
Sinusoids
62
Feb 2020
Lecture 1
Exponentials
Real α Complex α
63
Feb 2020
Lecture 1
⎧1 , n = 0
δ [n] = ⎨
⎩0 , n ≠ 0
∑ Aδ [ n − n ] x [ n ] = A x [ n ]
0 0
n=−∞
64
Feb 2020
Lecture 1
⎧1 , n ≥ 0
u[n] = ⎨
⎩0 , n < 0
65
Feb 2020
Lecture 1
⎧1 , n > 0
⎪
sgn ⎡⎣ n ⎤⎦ = ⎨0 , n = 0
⎪−1 , n < 0
⎩
66
Feb 2020
Lecture 1
⎧n , n ≥ 0 ⎫ n
ramp [ n ] = ⎨ ⎬ = n u [ n ] = ∑ u [ m − 1]
⎩0 , n < 0 ⎭ m=−∞
67
Feb 2020
Lecture 1
∞
δ N [n] = ∑ δ [ n − mN ]
m=−∞
68
Feb 2020
Lecture 1
Differencing
69
Feb 2020
Lecture 1
Periodic Functions
70
Feb 2020
Lecture 1
∑ x[n]
2
Ex =
n=−∞
71
Feb 2020
Lecture 1
x [ n ] = 0 , n > 31
72
Feb 2020
Lecture 1
73
Feb 2020
Lecture 1
74
Feb 2020
Lecture 1
Matlab Homework
75
Feb 2020
Lecture 1
Matlab Homework
76
Feb 2020