Representation

• Time Domain Representation

• Frequency Domain Representation
• Z Domain Representation
 Laplace Transform

• Converting/representing a time-varying function in the "integral domain”.

• Used to
 Analyse the continuous-time LTI systems.
 Solve the differential equations, where it reduces the differential equation
into an algebraic format
 Fourier Series & Transform

• Fourier series
 Technique of decomposing a periodic signal into a sum of sine and cosine
terms.
 can be applied to periodic signals only.
• Fourier Transform
 is a mathematical operation for converting a signal from time domain into its
frequency domain.
Applications of Fourier Transform
 Fourier vs Z- Transforms
• Fourier transforms are for converting/representing a time-varying function
into frequency domain.
• Similarity between Fourier Transform and Z-Transform
 Fourier Transform & Z-Transform convert discrete-time domain into
frequency domain.
• Z-transforms are very similar to Laplace but are discrete time-interval
conversions, closer for digital implementations.
• A significant advantage of the Z-Transform over DTFT is that 
 Z-Transform exists for many signals that do not have DTFT.
• Z-Transform is used to analyse discrete-time LTI (LSI-Linear Shift Invariant)
systems. 
 Z-Transform & used for?

• In mathematics and signal processing, Z-transform converts a discrete-time

signal, (i.e. sequence of real or complex numbers) into a complex frequency-
domain (z-domain or z-plane) representation.
• Z-Transform reduces to Fourier transform?
 once magnitude of the transform variable “z” is unity.
 Thus, z-Transform reduces to Fourier transform on the contour in the complex z-
plane corresponding to a circle with a radius of unity i.e. “r=1”
• Z-Transform allows us to analyze the frequency and phase of sinusoidal
components of a system to characterize a system's response.
• If Z-Transform of a system identifies exponentially increasing output, then
system exhibits instability for that value of x[n] and z^-n.
• Z-Transform makes the analysis of a discrete-time system easier by converting the
difference equations describing the system into simple linear algebraic equations.
• Convolution operation in time domain is converted into multiplication in z-domain.
 Why Z-Transform?

• A generalization of Fourier transform

• Why generalize it?
 Problem with FT, does not converge on all sequence
 Laplace Transform
 Laplace Transform
• Convolution relationship for continuous time LTI system
• Same as that of in discrete form except that summation sign replaced with
integral

s    j i.e. complex var iable

Changing variable with “t” we get:

• If same thing is extended to discrete time system

 Z-Transform

Proof ?
 Convolution Summation

 
 

Putting values of x[n] in above formula, we get

 
Z-Transform and DTFT
 What is meant by Convergence?
(Exponential weighting)

n
we * by r
FT does not
have any tool
like r  n which
makes it to
converge
 Z-Transform and DTFT
• Complex Z-plane
• Z-Transform reduces to DTFT for values of “Z” on unit circle
Summary
 Z-Transform

 

X ( e j )   x[n]e
n  
 j n

 | x[n] | 
 Basic Concepts


X ( z )  Z xk    xk z k
k 0
 Relationship to Fourier Transform
Expressing complex variable “z” in polar form reveals the relationship of Z-
transform to Fourier transform:


X (re i )  
n  
x (n )(re i ) n , or


X (re i )  
n  
x (n )r n e in , and if r  1,


X (e i )  X ( )   x(n )e in
n   i.e. Fourier transform of x(n).
 Transforms

The Laplace transform of a function f(t):


F (s ) 

0
f (t )e  st dt

The one-sided z-transform of a function x(n):


X (z)  
n 0
x (n )z  n

The two-sided z-transform of a function x(n):


X (z)  
n  
x ( n )z  n