Transform: of Technique For For Which - For Which That of
Transform: of Technique For For Which - For Which That of
Z- Complex variable
-Set of Z values for which the summation converges is
called the region of convergence (ROC) for the transform.
Converges for
Equivalent to , ROC
Values of z for which X(z)=0 are called zeros of X(z).
Values of z for which X(z)= are called poles of X(z).
Poles are indicated with X and zeros with o.
Let n=-m
This is by adding the m=0 term and subtracting it from total.
Using geometric progression formula
Z Transform of a finite Length sequence
Since sum involves finite number of terms the sum is
Finite everywhere except possibly z=0 and z= ,
Provided is finite.
For N˃M≥0 the ROC is entire z plane excluding the
origin z=0. For M<0 and N˃0 the ROC is entire
z -plane excluding the z=0 and z= .
Firs summation is
Second summation is
Thus Y(z) is their sum with ROC equal to intersection of the reg
of convergence.
x(n)= u(n)
ROC:⃓
Z⃓˃ ⃓a^T⃓
RIGHT SIDED SEQUENCE
A right-sided sequence is one for which x(n) = 0 for n < n0,
where n0 is positive or negative but finite. The Z-transform of
such a sequence is
Z Transform is
.
˃
Two discrete time systems with impulse responses
ℎ1[𝑛] = 𝛿[𝑛 − 1] and ℎ2[𝑛] = 𝛿[𝑛 − 2] are connected in
cascade. The overall impulse response of the cascaded
system is
With m=-n
Proof −
x(n)= x1(n)*x2(n)
k
ROC:ROC1⋂ROC2
x1 (Z)=
x2(Z)= n
x1 (Z) x2 (Z)=
6z-4 + 4z-6
Inverse z-transform
4
Taking IZT ,we get
(-(2+j)) (- )
Repeated Poles
mth order pole at z=a, will have residue as
2
2
2
Cauchy’s Integration (Residue) Method
We have
This is the DTFT of the signal x(n) r–n. Hence the Inverse
Discrete-Time Fourier Transform (IDTFT ) of
must be Therefore, we can write
We have