Bilinear transformation method

Bilinear transformation method
 Bilinear Transformation
Bilinear Transformation
• This mapping is the best
This mapping is the best transformation method.
transformation method.

2 1  z 1 1  sT / 2
s 1
z
T 1 z 1  sT / 2
T T
sz  s  z  1  0 Linear fractional transformation
f l f
2 2

The complex plane mapping is shown in Figure 8.15

P. Mahalakshmi 2
Complex‐plane mapping in bilinear 
transformation
f

P. Mahalakshmi 3
 Observations
• Sigma < 0 |z| < 1, Sigma = 0 |z| = 1, Sigma > 0 |z| > 1
g || , g || , g ||
• The entire left half‐plane maps into the inside of the 
UC. This is a stable transformation.
• The imaginary axis maps onto the UC in a one‐to‐one 
fashion. Hence there is no aliasing in the frequency 
domain.
• Relation of ω to Ω is nonlinear
ω= 2tan‐1(ΩT/2)↔ Ω=2tan(ω/2)/T;

Function [b,a] = bilinear(c,d,Fs)
P. Mahalakshmi 4
 Given the digital filter specifications wp,ws,Rp and As, we want to 
determine H(z) The design steps in this procedure are the following
determine H(z). The design steps in this procedure are the following:

1. Choose a value for T. this is arbitrary, and we may set T = 1.

2. Prewarp the cutoff freq.s wp and ws; that is calculate Ωp and Ωs using (8.28) :
Ωp=2/T*tan(wp/2),
p ( p ), Ωs=2/T*tan(ws/2)
( )
3. Design an analog filter Ha(s) to meet the specifications.
4. Finally set

And simplify to obtain H(z) as a rational function in z-1

 2 1  z 1 
H ( z )  H a  
1 
 T 1 z 

Ex 8.17
P. Mahalakshmi 5
 Advantage of the bilinear 
Transformation
f
• It
It is a stable design
is a stable design
• There is no aliasing 
• There is no restriction on the type of filter that 
h i i i h f fil h
can be transformed.

P. Mahalakshmi 6