Académique Documents
Professionnel Documents
Culture Documents
Causal ⇔ N1 ≥ 0
.........................................................................
A discrete-time linear time-invariant system function H(z) is causal when,
and only when the ROC of H(z) is the exterior of a circle and includes
z=∞
.........................................................................
4. Structure of a Digital System
4.1. Symbols for Digital Operations
y(n)
y(n)
x(n)
4.2. Example - Cumulative Averaging System
x(n) y(n)
1
n+1
z−1
n 1
y(n) = y(n − 1) + x(n)
n+1 n+1
5. DT LTI systems described by LCCDE’s
N
X M
X
ak y(n − k) = bk x(n − k)
k=0 k=0
Using the time-shift property:
N
X M
X
ak z −k Y (z) = bk z −k X(z)
k=0 k=0
⇓
Y (z) = H(z)X(z)
PM −k
k=0 bk z
H(z) = PN
−k
k=0 ak z
3.5
2.5
|X(z)|
1.5
0.5
−1 −1
0 0
1 1
Re
Im
7.1. Time-domain behavior - Single real-pole causal signal
0 1 0 1
0 1 0 1
0 1 0 1
7.2. Time-domain behavior - Complex-conjugate poles
z−plane x(n)
ω
0 1
z−plane x(n)
ω
0 1
z−plane x(n)
ω
0 1
8. Stability
• LTI is stable when ∞
P
n=−∞ | h(t) |< ∞. ROC of H(z) includes
the unit circle | z |= 1. The frequency response exists.
• A causal LTI system with rational system function is stable when
all poles are inside the unit circle, i.e. have a magnitude < 1
Geometric Evaluation of a Rational z-Transform
Example #1:
Example #2:
Example #3:
All same as
in s-plane
Geometric Evaluation of DT Frequency Responses
First-Order System
— one real pole
Second-Order System
Two poles that are a complex conjugate pair (z1= rejθ =z2*)
Definition: ∞
X
X(z) = x(n)z −n
n=0
Characteristics:
1. No information about x(n) for n < 0.
2. Unique only for causal signals.
3. Identical to the two-sided z-transform of the signal x(n)u(n).
9.2. Properties
All properties are like for the two-sided Z-transform except for:
• Shifting property:
" k
#
z
X
x(n − k) ↔ z −k X(z) + x(−n)z n , k>0
n=1
" k−1
#
z
X
x(n + k) ↔ z −k X(z) − x(n)z n , k>0
n=0
Example
The well known Fibonacci sequence of integer numbers is obtained by com-
puting each term as a sum of the two previous ones. The first few terms of
the sequence are:
1, 1, 2, 3, 5, 8, . . .
Determine a closed-form expression for the nth term of the Fibonacci se-
quence.
Example taken from ”Digital Signal Processing, Principles, Algorithms and Applications” by Proakis
and Manolakis