11.01.2015 Views

Introduction to Digital Signal and System Analysis - Tutorsindia

Introduction to Digital Signal and System Analysis - Tutorsindia

Introduction to Digital Signal and System Analysis - Tutorsindia

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

<strong>Introduction</strong> <strong>to</strong> <strong>Digital</strong> <strong>Signal</strong> <strong>and</strong> <strong>System</strong> <strong>Analysis</strong><br />

Time-domain <strong>Analysis</strong><br />

or<br />

y[<br />

n]<br />

− y[<br />

n −1]<br />

+ ay[<br />

n]<br />

= bx[<br />

n]<br />

T<br />

( 1+<br />

Ta ) y[<br />

n]<br />

= y[<br />

n −1]<br />

+ Tbx[<br />

n]<br />

yielding a st<strong>and</strong>ard form difference equation:<br />

y [ n]<br />

= a1 y[<br />

n −1]<br />

+ b1<br />

x[<br />

n]<br />

(3.4)<br />

where<br />

1<br />

a = <strong>and</strong><br />

1<br />

1 + Ta<br />

b<br />

Tb<br />

= 1+ Ta<br />

1<br />

are constants.<br />

For input’s derivative, we have similar digital form as<br />

dx ( t)<br />

x[<br />

n]<br />

− x[<br />

n −1]<br />

= .<br />

dt T .<br />

Further, the second order derivative in a differential equation contains can be discretised as<br />

y[<br />

n]<br />

− y[<br />

n −1]<br />

y[<br />

n −1]<br />

− y[<br />

n − 2]<br />

2<br />

−<br />

d y(<br />

t)<br />

1<br />

=<br />

T<br />

T<br />

= y[<br />

n]<br />

− 2y[<br />

n −1]<br />

+ y[<br />

n<br />

2<br />

dt<br />

T<br />

T<br />

( 2] )<br />

2<br />

−<br />

. (3.5)<br />

When the output can be expressed only by the input <strong>and</strong> shifted input, the difference equation is called non-recursive<br />

equation, such as<br />

y[ n]<br />

= b1 x[<br />

n]<br />

+ b2<br />

x[<br />

n −1]<br />

+ b3<br />

x[<br />

n −<br />

2]<br />

(3.6)<br />

On the other h<strong>and</strong>, if the output is expressed by the shifted output, the difference equation is a recursive equation, such as<br />

y[ n]<br />

= a1 y[<br />

n −1]<br />

+ a2<br />

y[<br />

n − 2] + a3<br />

y[<br />

n −<br />

3]<br />

(3.7)<br />

where the output y [n]<br />

is expressed by it shifted signals y [ n −1]<br />

, y [ n − 2]<br />

, etc. In general, an LTI processor can be<br />

represented as<br />

y[ n]<br />

= a1 y[<br />

n −1]<br />

+ a2<br />

y[<br />

n − 2] + ... + b1<br />

x[<br />

n −1]<br />

+ b2<br />

x[<br />

n − 2] + ...<br />

or a short form<br />

N<br />

M<br />

y[<br />

n]<br />

= ∑ ak<br />

y[<br />

n − k]<br />

+ ∑ bk<br />

x[<br />

n − k]<br />

k = 1<br />

k = 0<br />

(3.8)<br />

27<br />

Download free ebooks at bookboon.com

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!