Scribd
Upload
9 views7 pages

04-1 DT Systems and DTFT

Uploaded by

22100364
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views7 pages

04-1 DT Systems and DTFT

Uploaded by

22100364
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

1

Discrete-time systems

• The mathematical model of a causal LTI system is a constant coefficient


difference equation:

N
X M
X
ak y(n − k) = bl x(n − l) · · · · · · 1
k=0 l=0

[c.f.] The mathematical model of a linear CT system is the constant coefficient


differential equation:

N M
X dk X dk
ak k y(t) = bl k x(t)
k=0
dt l=0
dt

1 can be written as

M
X N
X
a0 y(n) = bl x(n − l) − ak y(n − k)
l=0 k=1

M
X N
X
y(n) = bl x(n − l) − ak y(n − k) · · · · · · 2
l=0 k=1

output input sequence output sequence


at the present time at the present and at the past times
past times
Classification of discrete-time causal LTI systems

■ FIR: Finite (duration) impulse response system (non-recursive, transversal,


tapped-delay-line)

• In other words, the output y(n) at the present time does not depend on
values of the output.
■ IIR: Infinite (duration) impulse response (recursive, feedback)

• In other words, the output y(n) does depend on the values of


the output.
1

Discrete time Fourier transform

 Definition
• Recall that for an aperiodic signal x(t),
Z ∞
X(ω) = x(t)e−jωt dt
Z −∞
∞
1
x(t) = X(ω)ejωt dω
2π −∞
• The Fourier transform of x(t) is in a form of between
x(t) and ejωt
• Similarly, the DT Fourier transform of x(n) is defined as

• Notice that ejω is a periodic function of ω with period =

As a result, X ejω is a periodic function of ω with period =



•

The inverse DTFT of X ejω is given by



•
 Duality between the CT Fourier series and DT Fourier transform

 ∞

1
Z
X ejω ejωn dω

x(n) =
X
xn ejnω0 t
 
 x(t) =
 
2π 2π
 

n=−∞ ∞
1
Z X
jω −jωn



 xn = x(t)e−jnω0 t dt


 X e = x(n)e
T
 
T n=−∞

Some properties of DTFT

• Linearity

• Time shifting

• Convolution property
a = 0.6
1

h(n)

0.5

0
0 1 2 3 4 5 6 7 8 9 10
n

2
|H(ej )|

0
-8 -6 -4 -2 0 2 4 6 8

a = -0.6
1

0.5
h(n)

-0.5

-1
0 1 2 3 4 5 6 7 8 9 10
n

2
|H(ej )|

0
-8 -6 -4 -2 0 2 4 6 8
Consider the following LTI system

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy