+ All Categories
Home > Documents > Chap2_(Introduction to Signals

Chap2_(Introduction to Signals

Date post: 16-Nov-2014
Category:
Upload: kimo77181424
View: 1,381 times
Download: 1 times
Share this document with a friend
80
CONTENTS § Definition and Classification of Signals § Mathematical Model of Ideal Signals § Linear Convolution § Discrete-time Signals § Discrete-time Convolution ECT 2036: CIRCUITS & SIGNALS Chapter 2: Introduction to Signals
Transcript
Page 1: Chap2_(Introduction to Signals

CONTENTS§ Definition and Classification of Signals§ Mathematical Model of Ideal Signals§ Linear Convolution§ Discrete-time Signals§ Discrete-time Convolution

ECT 2036: CIRCUITS & SIGNALS

ECT 2036: CIRCUITS & SIGNALS

Chapter 2: Introduction to Signals

Page 2: Chap2_(Introduction to Signals

1. DEFINITION & CLASSIFICATION OF SIGNALS

1. DEFINITION & CLASSIFICATION OF SIGNALS

§ SIGNAL: A function of one or more variables and it carries qualitative as well as quantitative information of a physical event.

§ Single variable function: most common is the time variable, t (continuous-time) or n (discrete-time) -> mathematically denoted by f(t) or f[n] respectively.

§ Classifications:a) Continuous & Discrete-Time Signalsb) Even & Odd Signalsc) Deterministic & Stochastic Signalsd) Energy & Power Signals

Page 3: Chap2_(Introduction to Signals

CONTINUOUS & DISCRETECONTINUOUS & DISCRETE

Continuous-time Signal-Signal is defined for all time instants-Occurs naturally in any physical process -We use a round bracket ( ) to denote the function: f( )-Commonly used: f(t) or f(τ) for single variable-f(t) = t, f(t) = t2, f(t) = sin(t), etc.-Example: voice signal

Page 4: Chap2_(Introduction to Signals

CONTINUOUS & DISCRETECONTINUOUS & DISCRETE

Discrete-time Signal-Signal is defined only at discrete values of time variable-We use a square bracket [ ] to denote the function: f[ ]-Commonly used: f[n] or f[k] for single variable-f[n] = δ[n], f[n] = u[n], f[n] = 2n, etc.-Example: sampled voice signal

Page 5: Chap2_(Introduction to Signals

Continuous-time signal f(t) Sampling at T=1

Discrete-time signal f[n]

§ Some discrete-time signals can be obtained from continuous-time signals by sampling operation mathematical given by:

f[n] = f(nT) , n = 0, ± 1, ± 2, ± 3, … where T is the sampling period. :

For instance, let T = 1Then:

n = -1; f[-1] = f(-1)n = 0; f[0] = f(0)n = 1; f[1] = f(1)n = 2; f[2] = f(2)n = 3; f[3] = f(3)

:

Page 6: Chap2_(Introduction to Signals

EVEN & ODD SIGNALSEVEN & ODD SIGNALS§ EVEN signals: signals which are symmetric with respect to

the vertical axis. Mathematically described by: f(t) = f(-t)§ ODD signals: signals which are anti-symmetric with respect

to the origin. Mathematically described by: f(t) = - f(-t)

Even (symmetric) signalf (t ) = f (-t ) for all t

Odd (anti-symmetric) signalf (t ) = - f (-t ) for all t

Page 7: Chap2_(Introduction to Signals

EVEN & ODD SIGNALSEVEN & ODD SIGNALS

• Any arbitrary signal, f(t) can be expressed as a sum of even and odd components:

[ ]

[ ])()(21

)(

)()(21

)(

)()()(

tftftf

tftftfwhere

tftftf

o

e

oe

−−=

−+=

+=

Page 8: Chap2_(Introduction to Signals

Example 1.1: Even & Odd

Example 1.1: Even & Odd

§ Find the odd and even components of continuous-time signal,

Solution:

532 64)( ttttf ++=

[ ] ( )

[ ] ( ) 53532532

2532532

64646421

)()(21

)(

646421

)()(21

)(

tttttttttftftf

ttttttttftftf

o

e

+=++−++=−−=

=−−+++=−+=

Page 9: Chap2_(Introduction to Signals

§ Find the odd and even components of the signal f(t).

½[(f(t)+f(-t)]

½[(f(t)-f(-t)]

Example 1.2: Even & Odd

Example 1.2: Even & Odd

3 3, 2 2

( ) 2 40,

t tf t

elsewhere

+ − ≤ ≤=

=1.5

=(3/4) t

Page 10: Chap2_(Introduction to Signals

Example 1.3: Even & Odd

Example 1.3: Even & Odd

§ Find the even and odd components of the following signal:

1

0 3t

f(t)

0.5

-3 0 3t

fo(t)0.5

-3 0 3t

fe(t)

1, 0 3( )

0,t

f telsewhere

< <=

-3

Page 11: Chap2_(Introduction to Signals

EVEN & ODD SIGNALSEVEN & ODD SIGNALS

§ Bear in mind that any arbitrary signals can be expressed as sum of odd and even components. Look at Examples 1.1 to 1.3, the main signal f(t) itself is neither even nor odd but when decomposed, has odd fo(t) and even fe(t) parts.

§ If the signal f(t) itself is already an even signal, then its even part is exactly the same as itself, f(t)=fe(t), the odd part being zero.

§ If the signal f(t) itself is already an odd signal, f(t)=fo(t), then its odd part is exactly the same as itself, the even part being zero.

§ Thus, a signal can be purely even, purely odd or neither even nor odd.

Page 12: Chap2_(Introduction to Signals

Example 1.4: Even & Odd

Example 1.4: Even & Odd

§ a) Is sin(ωt) an odd or even signal?Let f(t) = sin(ωt)

sin(ωt) = - sin(-ωt) for all tf(t) = - f(-t)

∴ It is an odd signal. § b) Is cos(ωt) an odd or even signal?

Let f(t) = cos(ωt) cos(ωt) = cos(-ωt) for all t

f(t) = f(-t)∴ It is an even signal.

Page 13: Chap2_(Introduction to Signals

§ c) Is sin(ωt+(π/6)) an odd or even signal?sin(ωt+(π/6)) = sin(π/6)cos(ωt) + cos(π/6)sin(ωt)

= 0.5cos(ωt) + 0.866sin(ωt) ∴ sin(ωt+(π/6)) is neither an even nor an odd signal.

ωt

sin(ωt+(π/6))

-π/6 5π/6 11π/6

0.51

-1

ωt

0.5cos(ωt)

0

0.5

-0.5

ωt

0.866sin(ωt)

0.866

-0.866

= +

0

Even

Odd

Original signal is neither even nor odd

π

π

Page 14: Chap2_(Introduction to Signals

DETERMINISTIC & STOCHASTICDETERMINISTIC & STOCHASTIC§ DETERMINISTIC SIGNALS:

The signals whose characteristics are well known and completely specified for all instants of time.e.g.: sine wave f(t)=sin(t), linear function f(t)=mt+c

§ STOCHASTIC SIGNALS:The signals whose characteristics are not fully known before itsoccurrence (random signals).e.g.: throwing of die, noise generated in an electronic circuit, unwanted disturbances in the atmosphere, etc.

sin t

t

Deterministic

t

# on a die thrown

T1 T2 T3

2

43

Value at T4? Value=Randombetween 1 to 6

Stochastic

T4T1 T2 T3 T4

All values at t are well defined

Page 15: Chap2_(Introduction to Signals

§ Deterministic

§ Stochastic (Random Signal)

Totally predictable

Page 16: Chap2_(Introduction to Signals

ENERGY & POWERENERGY & POWER

§ Energy Signal if: 0 < E < ∞ (finite positive value )§ Power Signal if: 0 < P < ∞ (finite positive value )

Average Power, P

Total Energy, E

f[n]f(t)Signal

Discrete-TimeContinuous-Time

2lim ( )T

TT

E f t dt→∞

= ∫2lim [ ]

N

Nn N

E f n→∞

=−

= ∑

21lim ( )

2

T

TT

P f t dtT→∞

= ∫ ∑−=

∞→=

N

NnN

nfN

P ][21

lim 2

Page 17: Chap2_(Introduction to Signals

Example 1.5: Energy & PowerExample 1.5:

Energy & Power§ A signal f(t) is defined as .

Determine whether f(t) is an energy or power signal.

E=∞ (the value is indefinite). ∴ f(t) is not an energy signal.

( ) sin( ) ; f t t tω= −∞< < ∞

2 2lim ( ) lim sin ( )T T

T TT T

E f t dt t dtω→∞ →∞

− −

= =∫ ∫1 1 sin(2 )

lim [1 cos(2 )] lim2 2 2

TT

T TTT

tt dt t

ωω

ω→∞ →∞−−

= − = − ∫1 2sin(2 )

lim 22 2T

TT

ωω→∞

= − = ∞

Page 18: Chap2_(Introduction to Signals

P=1/2 (the value is definite and positive). ∴ f(t) is a power signal.

2 21 1lim ( ) lim sin ( )

2 2

T T

T TT T

P f t dt t dtT T

ω→∞ →∞

− −

= =∫ ∫

21

8)2sin(2

21

lim

2)2sin(2

241

lim

)]2cos(1[21

21

lim

=

−=

−=

−=

∞→

∞→

−∞→ ∫

TT

TT

T

dttT

T

T

T

TT

ωω

ωω

ω

Page 19: Chap2_(Introduction to Signals

Example 1.6: Energy & PowerExample 1.6: Energy & Power§ Determine whether f(t) is an energy signal or a power

signal or neither.

≥<

=000

)(tforetfor

tf tα

Energy, E:

If α is negative, E = -1/2αà f(t) is an energy signal.If α is positive, E = ∞ à f(t) is not an energy signal.

2 2

0

lim ( ) limT T

t

T TT

E f t dt e dtα

→∞ →∞−

= =∫ ∫2 2

0

1 1lim lim 1

2 2

Tt T

T Te eα α

α α→∞ →∞ = = −

Page 20: Chap2_(Introduction to Signals

Power, P:

If α is negative, P = 0à f(t) is not a power signal.If α is positive, P = ∞ à f(t) is not a power signal.

2 2

0

1 1lim ( ) lim

2 2

T Tt

T TT

P f t dt e dtT T

α

→∞ →∞−

= =∫ ∫2 2

0

1 1 1lim lim 1

2 2 4

Tt T

T Te e

T Tα α

α α→∞ →∞

= = −

t

Negative αà Energy signal

tPositive αà Neither energy signal nor power signal

)()( tuetf tα=

Page 21: Chap2_(Introduction to Signals

ENERGY & POWERENERGY & POWER

§ Observations:– Bounded periodic signals are power signals (Example

1.5).– Bounded decreasing signals are energy signals

(Example 1.6).– Unbounded growing signals are neither energy nor

power signals (Example 1.6).– Energy signal: E is finite and nonzero, P is zero.– Power signal: E is infinite, P is finite and nonzero.– Neither energy nor power signal: E and P infinite.

Bounded: the amplitude of the signals has definite upper and lower limits. If one limit is indefinite, it is unbounded.

Page 22: Chap2_(Introduction to Signals

2. MATHEMATICAL MODEL OF IDEAL SIGNALS

2. MATHEMATICAL MODEL OF IDEAL SIGNALS

§ We will discuss mathematical model of the following signals:a) Sinusoidal Signalb) Exponential Signalc) Unit Step Functiond) Unit Pulse Functione) Unit Impulse Functionf) Approximation of signals by Impulse Functions

Page 23: Chap2_(Introduction to Signals

SINUSOIDAL SIGNALSINUSOIDAL SIGNAL

( )( )θω

θπ

θπ

+=+=

+=

tAftA

Tt

Atf

sin2sin

2sin)(

angle phaseperiod

amplitude signal

===

θTA

where

f1(t)

f2(t)

f(t) = 5 sin (ωt) f1(t) = 5 sin (ωt + π/2)f2(t) = 5 sin (ωt - π/2)

Page 24: Chap2_(Introduction to Signals

EXPONENTIAL SIGNALEXPONENTIAL SIGNAL

Decaying Exponential Signal Growing Exponential Signal

τ/)( tAetf −= ( )τ/1)( teAtf −−=

Arbitrary Exponential Signal:

τ/)()( tfinalinitialfinal eVVVtf −−+=

A V initial=A

V initial=0V final=0

V final=A

Page 25: Chap2_(Introduction to Signals

Example 2.1:Exponential Signal

Example 2.1:Exponential Signal

§ Draw the exponential signals described by:i) 5exp(-t/τ) and ii) 5[1-exp(-t/τ)]

t

5exp(-t/τ)

0

5

Approaches 0

t

5[1-exp(-t/τ)](i)

Decaying

(ii)

Growing

Approaches 5

0

5

t=τ

1.84

t=τ

3.16

Page 26: Chap2_(Introduction to Signals

UNIT STEP FUNCTIONUNIT STEP FUNCTION

Unit Step Delayed Unit Step

<≥

=0001

)(tt

tu 1( )

0t T

u t Tt T≥

− = <

Page 27: Chap2_(Introduction to Signals

Example 2.2: Unit Step

Example 2.2: Unit Step

§ Sketch the waveform of

)2()()( −+= tututf

Page 28: Chap2_(Introduction to Signals

§ Draw the exponential signals described by:i) 5exp(-t/τ)u(t) and ii) 5[1-exp(-t/τ)]u(t)

§ Unit step function can be used in converting an arbitrary function into a right-sided function.

Example 2.3: Unit StepExample 2.3: Unit Step

t

5exp(-t/τ)u(t)

0

5

Approaches 0

t

5[1-exp(-t/τ)]u(t)(i) (ii)

Approaches 5

0

5

Note that the functions are now zero for t < 0.

t=τ

1.84

t=τ

3.16

Page 29: Chap2_(Introduction to Signals

UNIT PULSE FUNCTIONUNIT PULSE FUNCTION

Unit Pulse Delayed Unit Pulse

∆>∆≤≤∆−

∆−<=∆

2/02/2/1

2/0)(

tt

ttP

∆+>∆+≤≤∆−

∆−<=−∆

)2/(0)2/()2/(1

)2/(0)(

TtTtT

TtTtP

Page 30: Chap2_(Introduction to Signals

UNIT PULSE FROM UNIT STEPSUNIT PULSE FROM UNIT STEPS

Construction of unit pulse from step signals

)2/()2/()( ∆−−∆+=∆ tututP

Page 31: Chap2_(Introduction to Signals

UNIT IMPULSE FUNCTIONUNIT IMPULSE FUNCTION

Unit Impulse

( ) 0 0

( ) 1

t t

Area t dt

δ

δ∞

−∞

= ≠

= =∫

)()(

lim0

ttP

δ=∆

→∆

Area = ∆×1/∆ =1

let ∆approach 0

Page 32: Chap2_(Introduction to Signals

Property 1: Property 4:

Property 2: Property 5:

Property 3:

( ) ( ) (0)f t t dt fδ∞

−∞

=∫

)()()( TfdtTttf =−∫∞

∞−

δ

)()( tt δδ =−

)(1

)( tt δβ

βδ =

)()()()( TtTfTttf −=− δδ

Properties of Unit Impulse Function

Page 33: Chap2_(Introduction to Signals

Unit Impulse Function: Properties 1 & 2Unit Impulse Function: Properties 1 & 2

t t

f(t) δ(t-T)

XT0

δ(t-T)=0, t≠T

=t

f(t)δ(t-T)f(T)

T

f(t)δ(t-T)=f(T)δ(t-T)

t t

f(t) δ(t)

X00

δ(t)=0, t≠0

=t

f(t)δ(t)

0

f(0)

f(t)δ(t)=f(0)δ(t)When T=0

Page 34: Chap2_(Introduction to Signals

§ Property 2

§ Property 3

Unit Impulse Function:Properties 2 & 3

Unit Impulse Function:Properties 2 & 3

1

( ) ( ) (0) ( ) (0) ( ) (0)f t t dt f t dt f t dt fδ δ δ∞ ∞ ∞

−∞ −∞ −∞

= = =∫ ∫ ∫14243

1

( ) ( ) ( ) ( ) ( ) ( )

( )

f t t T dt f T t T dt f T t T dt

f T

δ δ δ∞ ∞ ∞

−∞ −∞ −∞

− = − = −

=

∫ ∫ ∫14243

Property 1

Page 35: Chap2_(Introduction to Signals

Example 2.4: Unit ImpulseExample 2.4: Unit ImpulseEvaluate the following integrals:a) b)

c) d) cos(2 ) (2 1)t t dtπ δ∞

−∞

−∫

sin(2 ) ( 50)t t dtπ δ∞

−∞

−∫( )2 (2 )t t dtδ

−∞

+∫

( )53 ( 3)t t dtδ

−∞

+ +∫

Solution:a)

b)

( )

( )

5

5

3 ( 3) ( ) ( 3)

( 3) 3 3 0

t t dt f t t dt

f

δ δ∞ ∞

−∞ −∞

+ + = +

= − = − + =

∫ ∫

sin(2 ) ( 50) ( ) ( 50)

(50) sin(2 50) 0

t t dt f t t dt

f

π δ δ

π

∞ ∞

−∞ −∞

− = −

= = × =

∫ ∫

Property 3

Property 3

Page 36: Chap2_(Introduction to Signals

c)

d)

( ) ( )

( )

12 (2 ) 2 ( )

2

1 ( ) ( ) (0) 0 2 1

2

t t dt t t dt

f t t dt f

δ δ

δ

∞ ∞

−∞ −∞

−∞

+ = +

= = = + =

∫ ∫

Property 5

cos(2 ) (2 1) cos(2 ) [2( 1/ 2)]

1 cos(2 ) ( 1/ 2)

2

( ) ( 1/ 2)

t t dt t t dt

t t dt

f t t dt

π δ π δ

π δ

δ

∞ ∞

−∞ −∞

−∞

−∞

− = −

= −

= −

∫ ∫

∫1 1

(1/ 2) cos(2 1/ 2)2 2

f π= = × = −

Property 2

Property 5

Property 3

Page 37: Chap2_(Introduction to Signals

APPROXIMATION OF SIGNALS BY IMPULSE FUNCTIONS

APPROXIMATION OF SIGNALS BY IMPULSE FUNCTIONS

∑∞

−∞=

−≅k

kTtkTTftf )()()( δ

This equation is the impulse approximation of the signal f (t).

Valid iff the pulse width is very small à sampling frequency is very high (higher than frequency of signal f (t))

Page 38: Chap2_(Introduction to Signals

Signal Approximation by ImpulseSignal Approximation by Impulse

-T

f(-T)PT(t+T)

0

f(0)PT(t)

T

f(T)PT(t-T)

2T

f(2T)PT(t-2T)

-2T

f(-2T)PT(t+2T)

+ + + +… …

( ) ( ) ( )Tk

f t f kT P t kT∞

=−∞

≅ −∑

f(t)

-2T –T 0 T 2T

… …

Page 39: Chap2_(Introduction to Signals

Signal Approximation by ImpulseSignal Approximation by Impulse

[ ]( ) ( ) ( ) ( ) ( )/ ( ) ( )T Tk k k

f t f kT P t kT f kT T P t kT T Tf kT t kTδ∞ ∞ ∞

=−∞ =−∞ =−∞

≅ − = − ≅ −∑ ∑ ∑

f(t)

-2T –T 0 T 2T

T

f(t)

T→very small

( )( )T

k k

P t kTt kT

∞ ∞

=−∞ =−∞

−≅ −∑ ∑

Let the pulse width be very small so the unit pulse becomes unit impulse

Page 40: Chap2_(Introduction to Signals

3. LINEAR CONVOLUTION3. LINEAR CONVOLUTION

Input-output model of a linear time invariant continuous-time system

Transform operatorInput Output

Page 41: Chap2_(Introduction to Signals

•If input x(t)=δ(t), then output y(t)=h(t) is called the impulse response.

y(t)=G[x(t)]=G[δ(t)]=h(t)

3. LINEAR CONVOLUTION3. LINEAR CONVOLUTION

Single Impulse

Impulse response

Page 42: Chap2_(Introduction to Signals

3. LINEAR CONVOLUTION3. LINEAR CONVOLUTION

[ ]

( ) [ ( )]

( ) ( )

( ) ( ) Linearity Property

( ) ( ) Time invariant Property

k

k

k

y t G x t

G Tx kT t kT

Tx kT G t kT

Tx kT h t kT

δ

δ

=−∞

=−∞

=−∞

=

≅ −

= − →

= − →

Linearity Property: G[kx(t)]=kG[x(t)]; k=constant

Time invariant Property:

If G[δ(t)]=h(t);

then G[δ(t-τ)]=h(t-τ); τ=constant

•Let x(t) be signal approximated using impulses:

( ) ( ) ( )k

x t Tx kT t kTδ∞

=−∞

≅ −∑

Page 43: Chap2_(Introduction to Signals

3. LINEAR CONVOLUTION3. LINEAR CONVOLUTION

( ) ( ) ( )k

y t Tx kT h t kT∞

=−∞

= −∑

Let τ=kT, as Tà 0, τà 0, Σà ∫, Tà dτ

( ) ( ) ( )

( ) ( )* ( )

y t x h t d

y t x t h t

τ τ τ∞

−∞

= −

=

Convolution Integral

Approximation by Impulses

Output response

Page 44: Chap2_(Introduction to Signals

Properties of Linear Convolution

( )* ( ) ( ) ( )

( )* ( ) ( ) ( )

x t h t x h t d

h t x t h x t d

τ τ τ

τ τ τ

−∞

−∞

= −

= −

Page 45: Chap2_(Introduction to Signals

EVALUATION OF CONVOLUTION INTEGRAL

EVALUATION OF CONVOLUTION INTEGRAL

§ There are two widely known procedures for evaluation of convolution integral:

1) Graphical EvaluationThis method is very useful when mathematical models of the signals are not available.

2) Numerical EvaluationPerformed by approximation of both the functions by finite-width pulse trains.

Page 46: Chap2_(Introduction to Signals

GRAPHICAL EVALUATIONGRAPHICAL EVALUATION

§ Steps involved in the graphical evaluation of two signals à y(t) = h(t)*x(t)

1. Plot h(τ) and x(τ).2. Obtain x(-τ).3. Shift x(-τ) by t to get x(t-τ)= x(-(τ - t)).4. Multiply h(τ) and x(t-τ). Area under h(τ)x(t-τ) is

equal to convolution of two signals, y(t).5. Repeat steps 3 - 4 for various values of t = t1, t2,

t3, ….6. Plot y(t), the convolution.

( ) ( ) ( )

( )* ( )

y t h x t d

h t x t

τ τ τ∞

−∞

= −

=

Page 47: Chap2_(Introduction to Signals

1.

2.

3.

same as flip or mirror at the y-axis

shift forward if t is positive, backward if negative

multiply both signals, then compute the area

Page 48: Chap2_(Introduction to Signals

4.

5. Repeat

6.

Page 49: Chap2_(Introduction to Signals

§ Evaluate the convolution of f1(t) and f2(t) at t = 0 and t = 1.

Example 3.1: Graphical Linear Convolution

Example 3.1: Graphical Linear Convolution

Page 50: Chap2_(Introduction to Signals

At t = 0 At t = 1

1 2

1 2

( ) ( )* ( )

( ) ( )

y t f t f t

f f t dτ τ τ∞

−∞

=

= −∫

× ×

(0) 0y =Area f1(τ). f2(-τ)=0 (1) 1/ 2y =Area f1(τ). f2(1-τ)=1/2

f1(τ) f2(-τ) f1(τ) f2(1-τ)

ττ

ττ

Page 51: Chap2_(Introduction to Signals

NUMERICAL EVALUATIONNUMERICAL EVALUATION

§ Let’s approximate both functions by finite-width impulse trains:

§ At t = nT, T = sampling period, n = positive integer

1 200

( ) lim ( ) ( )n

Tk

y t T f kT f t kT→

=

= −∑

1 200

( ) lim ( ) ( )n

Tk

y nT T f kT f nT kT→

=

= −∑

Numerical evaluation form of convolution

Page 52: Chap2_(Introduction to Signals

§ Perform numerical convolution of the following functions with sampling time T = 0.1 for three consecutive sampling instants, n = 0, 1, 2.

§ At n = 0,

)()()()(

2

21

tutftuttf

==

0

1 20

1 2

(0) 0.1 (0.1 ) ( 0.1 )

0.1{ (0) (0)} 0k

y f k f k

f f=

= −

= =

Example 3.2: Numerical Linear Convolution

Example 3.2: Numerical Linear Convolution

1 200

1 20

( ) lim ( ) ( )

(0.1 ) 0.1 (0.1 ) (0.1 0.1 )

n

Tk

n

k

y nT T f kT f nT kT

y n f k f n k

→=

=

= −

= −

0 1

Page 53: Chap2_(Introduction to Signals

At n = 1,

At n = 2,

{ }{ }

1

1 20

1 2 1 2

(0.1) 0.1 (0.1 ) (0.1 0.1 )

0.1 (0) (0.1) (0.1) (0)

0.1 0 0.01

0.001

k

y f k f k

f f f f=

= −

= +

= +

=

{ }{ }

2

1 20

1 2 1 2 1 2

(0.2) 0.1 (0.1 ) (0.2 0.1 )

0.1 (0) (0.2) (0.1) (0.1) (0.2) (0)

0.1 0 0.01 0.04

0.005

k

y f k f k

f f f f f f=

= −

= + +

= + +

=

0 1 0.01 1

0 10.01 1 0.04 1

Page 54: Chap2_(Introduction to Signals

Interpretation of Numerical Evaluation of Convolution Graphically using Example 3.2

Interpretation of Numerical Evaluation of Convolution Graphically using Example 3.2

§ From Example 3.2f1(τ)= τ 2u(τ)

τ

f2(τ)=u(τ)

τT=0.1

1

0 0.1 0.2 0.3

0.010.04

0 0.1 0.2 0.3

Page 55: Chap2_(Introduction to Signals

Interpretation of Numerical Evaluation of Convolution Graphically using Example 3.2

Interpretation of Numerical Evaluation of Convolution Graphically using Example 3.2

f1(τ)= τ 2u(τ)

τ

y(0)= f1(τ)f2(-τ)

=0

f2(-τ)=u(-τ)

τ

f2(0.1-τ)= u(0.1-τ)

τ

y(0.1)=f1(τ)f2(0.1-τ)

=0.01x0.1

=0.001

1

1

0 0.1 0.2 0.3

0.010.04

0

0.1

X =

f1(τ)= τ 2u(τ)

τ0 0.1 0.2 0.3

0.010.04 X

=

Page 56: Chap2_(Introduction to Signals

Interpretation of Numerical Evaluation of Convolution Graphically using Example 3.2

Interpretation of Numerical Evaluation of Convolution Graphically using Example 3.2

§ The Numerical Evaluation of Convolution performs by approximation of both the functions by finite-width pulse trains at T=0.1.

f1(τ)= τ 2u(τ)

τ

f2(0.2-τ)= u(0.2-τ)

τ

1y(0.2)=f1(τ)f2(0.2-τ)

=0.01x1+0.04x1

=0.0050 0.1 0.2 0.3

0.010.04

0.2

X =

Page 57: Chap2_(Introduction to Signals

4. DISCRETE-TIME SIGNALS4. DISCRETE-TIME SIGNALS

§ Some basic sequences– Unit step: u[n]={…0 1 1 1 1 1 1 1 1 1 1…}

or

The arrow indicates the origin, n = 0

1, 0[ ]

0, 0n

u nn

≥= <

Page 58: Chap2_(Introduction to Signals

4. DISCRETE-TIME SIGNALS4. DISCRETE-TIME SIGNALS

– Unit sample/impulse: δ[n]={…0 1 0…}

or

The arrow indicates the origin, n = 0

1, 0[ ]

0, 0n

nn

δ=

= ≠

Page 59: Chap2_(Introduction to Signals

4. DISCRETE-TIME SIGNALS4. DISCRETE-TIME SIGNALS

§ Both discrete-time functions can also be used without arrows to indicate the origin:– Unit step: u[n]={…0 1 1 1 1 1 1 1 1 1 1…}– Unit sample/impulse: δ[n]={…0 1 0…}

§ In such a case, the first nonzero value at the left hand side of the sequence denotes the position of the origin.

Page 60: Chap2_(Introduction to Signals

Manipulating Sequences

q Shifted unit step

1, 1[ 1]

0, 1n

u nn

≥− = <

q Shifted unit sample/impulse

1, 1[ 1]

0, 1n

nn

δ=

− = ≠

1, 2[ 2]

0, 2n

nn

δ=

− = ≠

Page 61: Chap2_(Introduction to Signals

1, 0[ ]

0, 0n

u nn

≥= <

[ ] [ ] [ 1]n u n u nδ = − −

q Unit sample/impulse using unit step

1, 1[ 1]

0, 1n

u nn

≥− = <

Page 62: Chap2_(Introduction to Signals

q Unit step as sum of unit sample/impulse

q Sample/impulse of arbitrary amplitude

x0

x1

x2

x-1

∑∞

=

−=+−+−+−+=0

][...]3[]2[]1[][][i

innnnnnu δδδδδ

∑∞

−∞=− −=+−+−++++=

ii inxnxnxnxnxnx ][...]2[]1[][]1[...][ 2101 δδδδδ

Page 63: Chap2_(Introduction to Signals

§ Express the following signals graphically:(i)

(ii) x[n]={…0 5 0…}

(iii) x[n]={…0 0 5 0…}

(iv)

Example 4.1: Discrete Sequences

Example 4.1: Discrete Sequences

]5[][][ −−= nununx

]3[]2[2][][ −−−+= nnnnx δδδ

Page 64: Chap2_(Introduction to Signals

§ Solution:(i)

(ii) x[n]={…0 5 0…}

(iii) x[n]={…0 0 5 0…}

]5[][][ −−= nununx

=-

Page 65: Chap2_(Introduction to Signals

(iv) ]3[]2[2][][ −−−+= nnnnx δδδ

=

+

+

Page 66: Chap2_(Introduction to Signals

5. DISCRETE-TIME CONVOLUTION

5. DISCRETE-TIME CONVOLUTION

§ For a LTI discrete-time system, the discrete-time convolution is given mathematically by:

§ If the LTI system is causal, then:

§ By causal system, we mean that the input and output signals of the system start from t≥0.

[ ] [ ] [ ]k

y n x k h n k∞

=−∞

= −∑

[ ] [ ] [ ]0

n

k

y n x k h n k=

= −∑

Page 67: Chap2_(Introduction to Signals

§ Perform convolution mathematically for the following sequences at n = 3.

§ For n = 3

[ ] [ ]

[ ] [ ]

1

2

13

n

f n nu n

f n u n

=

=

[ ] [ ] [ ]1 20

n

k

y n f k f n k=

= −∑

[ ] [ ] [ ]

[ ] [ ] [ ] [ ] [ ] [ ] [ ] [ ]

3

1 20

1 2 1 2 1 2 1 2

2

3 3

0 3 1 2 2 1 3 0

1 10 2 3

3 33.777

k

y f k f k

f f f f f f f f=

= −

= + + +

= + + +

=

Example 5.1: Discrete-Time Convolution

Example 5.1: Discrete-Time Convolution

0

(1/3)3

1 (1/3)2 2 (1/3)1

3 (1/3)0

Causal signals

Page 68: Chap2_(Introduction to Signals

5. DISCRETE-TIME CONVOLUTION

5. DISCRETE-TIME CONVOLUTION

§ All the properties for continuous-time convolution still hold for discrete-time convolution.§ Graphical method can be performed on discrete-

time signals to obtain discrete-time convolution. Same procedures as in continuous-time case.

Page 69: Chap2_(Introduction to Signals

GRAPHICAL EVALUATIONGRAPHICAL EVALUATION

§ Steps involved in the graphical evaluation of two signals à y[n] = h[n]*x[n]

1. Plot h[k] and x[k].2. Obtain x[-k].3. Shift x[-k] by n to get x[n-k]= x[-(k - n)].4. Multiply h[k] and x[n-k]. Area under h[k]x[n-k] is

equal to convolution of two signals, y[n].5. Repeat steps 3 - 4 for various values of n = n1,

n2, n3, ….6. Plot y[n], the convolution.

[ ] [ ] [ ]

[ ]* [ ]k

y n h k x n k

h n x n

=−∞

= −

=

Page 70: Chap2_(Introduction to Signals

§ Repeat Example 5.1, now using graphical convolution.

§ At n= 3

=x

Example 5.2: Discrete-Time Convolution

Example 5.2: Discrete-Time Convolution

Page 71: Chap2_(Introduction to Signals

§ Find mathematically, the discrete time convolution of the two signals below.

Example 5.3: Discrete-Time Convolution

Example 5.3: Discrete-Time Convolution

[0] 6; [1] 13; [2] 10;[3] 10; [4] 11; [5] 2

6 [ ] 0

y y yy y yn y n

= = == = − =

≥ ⇒ =

[ ] [ ] [ ]0

n

k

y n f k h n k=

= −∑Causal signals

f[k] h[k]

Page 72: Chap2_(Introduction to Signals

§ Repeat Example 5.3, now using graphical convolution

Example 5.4: Discrete-Time ConvolutionExample 5.4: Discrete-Time Convolution

k

h[-k]

3

5

-2n=0: y[0]=2x3=6

k

h[1-k]

3

5

-2n=1: c[1]=2x5+1x3=13

k

h[2-k]

3

5

-2n=2: y[2]=2x(-2)+1x5+3x3=10

f[k] f[k] f[k]

Page 73: Chap2_(Introduction to Signals

k

h[3-k]

3

5

-2

n=3: y[3]=1x(-2)+3x5+(-1)x3=10

k

3

5

-2

n=4: y[4]=3x(-2)+(-1)x5=-11

h[4-k]

k

h[5-k]

3

5

-2

n=5: y[5]=(-1)x(-2)=2

f[k] f[k] f[k]

Page 74: Chap2_(Introduction to Signals

§ For the two discrete signals defined below:

(i) Sketch the two sequences.(ii) Compute the convolution graphically.

Example 5.5: Discrete-Time Convolution

Example 5.5: Discrete-Time Convolution

]6[][][ −−= nununx

]5[]2[][ −−−= nununh

Page 75: Chap2_(Introduction to Signals

(i)

(ii) y[n] = x[n]*h[n]

1

654-3 -2 -1 0 321

1

654-3 -2 -1 0 321

0 11

3

10981 2 3 4 765

]6[][][ −−= nununx

]5[]2[][ −−−= nununh

1

2

Page 76: Chap2_(Introduction to Signals

CONVOLUTION TABLECONVOLUTION TABLE

Index 0 + 0 = 0

Start of convolutionsequence, y[0]

y[0]

y[1]

y[2]

y[3]

y[4]

Σ

Σ

Σ

Σ Σ

Page 77: Chap2_(Introduction to Signals

CONVOLUTION TABLECONVOLUTION TABLE

§ Note that the top entry and left entry does not necessary start with h[0] or f[0].§ The rule is that, we start the entries using

the first nonzero value of h[n] or f[n].§ For instance: if we start with h[1] and f[0],

then y[1+0] = y[1] is the first nonzero value of the convolution. If h[1] and f[1], then it isy[1+1] = y[2].

Page 78: Chap2_(Introduction to Signals

§ Repeat Example 5.1 using convolution table.

Index 0 + 1 = 1

Start of convolutionsequence, y[1]For n = 3, compute y[3]

y[3]Σ(3, 2/3, 1/9) = 34/9 = 3.777

Example 5.6: Convolution Table

Example 5.6: Convolution Table

Page 79: Chap2_(Introduction to Signals

§ Repeat Example 5.3 using convolution table.

y[0]=6 y[3]=-3+15+(-2)=10y[1]=3+10=13 y[4]=-5+(-6)=-11y[2]=9+5+(-4)=10 y[5]=2

ΣIndex(0,0) = 0

Start of convolutionsequence, y[0]

Example 5.7:Convolution Table

Example 5.7:Convolution Table

f[3]h[2]=2f[3]h[1]=-5f[3]h[0]=-3f[3]=-1f[2]h[2]=-6f[2]h[1]=15f[2]h[0]=9f[2]=3f[1]h[2]=-2f[1]h[1]=5f[1]h[0]=3f[1]=1f[0]h[2]=-4f[0]h[1]=10f[0]h[0]=6f[0]=2h[2]=-2h[1]=5h[0]=3

Page 80: Chap2_(Introduction to Signals

SummarySummary

§ At the end of this chapter, you should understand:– Concept of signals and its common classifications

• Able to define, draw, compare, compute and give examples– Mathematical model of ideal signals (continuous) and discrete-time

signals• Able to formulate signal functions as well as graphically drawn the

signals, perform signal operations mathematically and graphically, able to differentiate continuous- and discrete-time signals

– Linear convolution (continuous) and discrete-time convolution• Able to perform convolution operations mathematically and graphically,

able to differentiate continuous- and discrete-time convolutions

§ Next Chapter: Application of Fourier Series


Recommended