Yasser F. O. Mohammad REMINDER 1:Linear Systems Linear = - - PowerPoint PPT Presentation

yasser f o mohammad reminder 1 linear systems
SMART_READER_LITE
LIVE PREVIEW

Yasser F. O. Mohammad REMINDER 1:Linear Systems Linear = - - PowerPoint PPT Presentation

Yasser F. O. Mohammad REMINDER 1:Linear Systems Linear = Homogeneous+Additive Homogeneity If X[n] Y[n] then k X[n] k Y[n] Additive If X1[n] Y1[n] and X2[n] Y2[n] then X1[n]+X2[n]


slide-1
SLIDE 1

Yasser F. O. Mohammad

slide-2
SLIDE 2

REMINDER 1:Linear Systems

 Linear = Homogeneous+Additive  Homogeneity

 If X[n]Y[n]

then k X[n]  k Y[n]

 Additive

 If X1[n]  Y1[n] and X2[n]Y2[n]

then X1[n]+X2[n]  Y1[n]+Y2[n]

 Most DSP linear systems are also shift invariant (LTI)

slide-3
SLIDE 3

REMINDER 2: Sinusoidal Fidelity

 Linear system  sinusoidal output for sinusoidal input  Sinusoidal Fidelity Linear System

 (e.g. phase Lock Loop)

 This is why we can work with AC circuits using only two

numbers (amplitude and phase)

 This is why Fourier Analysis is important  This is partially why Linear Systems are important  This is why you cannot see DSP without sin

slide-4
SLIDE 4

REMINDER 3: Fundamental Concept of DSP

slide-5
SLIDE 5

REMINDER 4: Impulse and Step Decompositions

slide-6
SLIDE 6

What is convolution?

 A mathematical operation that takes two signals and

produces a third one.

 X[n]*Y[n]=Z[n]

 For us:

 A way to get the output signal given the input signal and a

representation of system function

From now one we will deal only with discrete signals if not

  • therwise specified
slide-7
SLIDE 7

Delta function

 Delta function=Unit impulse = δ[n]

 

1 n n

  • therwise

     

slide-8
SLIDE 8

Impulse Response

 Describes a SYSTEM not a signal

 We use h[n] for it

 Gives the output signal if the input to the system was a

unit impulse

slide-9
SLIDE 9

Other names of impulse response

 Filters

 Filter Kernel  Kernel  Convolution Kernel

 Image processing

 Point Spread Function

slide-10
SLIDE 10

Why impulse response is important?

 It COMPLETELY describes systems FUNCTION

 Any input can be decomposed into an impulse train  Linearity  Superposition  Any input  [Usually] Shift invariance  Any time

slide-11
SLIDE 11

How to calculate the output

 Input length = N  Impulse Response length = M  Output length = N+M-1  For example a 81 points input convolved with a 31 points impulse

response gives 111 points output

slide-12
SLIDE 12

Examples

slide-13
SLIDE 13

More Examples

slide-14
SLIDE 14

Two ways to understand it

 Input Signal Viewpoint (Input Side Algorithm)

 How each input impulse contributes to the output signal.  Good for your understanding

 Output Signal Viewpoint (Output Side Algorithm)

 How each output impulse is calculated from input signal.  Good for your calculator

slide-15
SLIDE 15

Input Side Algorithm

 Each sample is considered a scaled impulse  Each scaled impulse results in a scaled impulse

response

 Add all scaled impulse responses together

slide-16
SLIDE 16

Example Input Side Algorithm

n=4 n=2

slide-17
SLIDE 17

The nine responses=Total Response

+

slide-18
SLIDE 18

X[n]*h[n]=h[n]*X[n]

slide-19
SLIDE 19

Input Side Algorithm

slide-20
SLIDE 20

Calculating a single output point

Output 6 is affected by the response to the following inputs (blue): x[3]×h[3], x[4]×h[2], x[5]×h[1], x[6]×h[0] This is true for ANY point Output sample j is calculated As:

1

[ ] [ ] [ ]

M i

y j x j i h i

 

 

slide-21
SLIDE 21

General Output Side Flowchart

 Flip the second signal (h[n])  Move it over the first signal (x[n])  Each time calculate:  Continue

until first signal is finished

1

[ ] [ ] [ ]

M i

y j x j i h i

 

 

slide-22
SLIDE 22

Example Output Side Algorithm

slide-23
SLIDE 23

Boundary Effect

 At the first and last M-1 points the impulse response is

not fully immersed into the signal

 These points are unreliable

slide-24
SLIDE 24

Output Side Algorithm