0% found this document useful (0 votes)
213 views

Lecture-5 (ABSP) - Recursive and Non-Recursive Digital Filters

The document discusses recursive and non-recursive digital filters. It defines FIR filters as non-recursive filters where the output is calculated solely based on current and previous input values. IIR filters are recursive filters where the output is calculated based on both current and previous input and output values. The transfer function of a digital filter represents the relationship between its input and output.

Uploaded by

Adnan Rafique
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
0% found this document useful (0 votes)
213 views

Lecture-5 (ABSP) - Recursive and Non-Recursive Digital Filters

The document discusses recursive and non-recursive digital filters. It defines FIR filters as non-recursive filters where the output is calculated solely based on current and previous input values. IIR filters are recursive filters where the output is calculated based on both current and previous input and output values. The transfer function of a digital filter represents the relationship between its input and output.

Uploaded by

Adnan Rafique
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/ 24

• Recursive and non recursive Filters

Agenda • Transfer Function of Digital Filters


• Block Diagram Representation of Filters
Recursive and
non-recursive Filters
FIR- Finite Impulse Response (Non-Recursive)
• For all the examples of digital filters discussed so
far, the current output (𝑦[𝑛]) is calculated solely
from the current and previous input values (𝑥[𝑛],
𝑥[𝑛 − 1], 𝑥[𝑛 − 2] ...). This type of filter is said to
be non-recursive.

Recursive and IIR- Infinite Impulse Response (Recursive)


non recursive • A recursive filter is one which in addition to input
values also uses previous output values (𝑦[𝑛 − 1],
Filters 𝑦[𝑛 − 2],…)

The word recursive literally means "running back"


and refers to the fact that previously-calculated
output values go back into the calculation of the
latest output.
FIR Filters / non –recursive IIR Filters / Recursive
• In fact, the reverse is usually the case:
In this example, each output is determined simply by adding two numbers together. For instance, to
calculate the output at time 𝑛 = 10, the recursive filter uses the expression

To achieve the same effect with a non-recursive filter (i.e. without using previous output values
stored in memory) would entail using the expression
𝑦 𝑛 = 𝑥 𝑛 + 𝑦[𝑛 − 1]

Note: a recursive (IIR) filter must, by definition, be of at least first


order; a zero-order recursive filter is impossible. (Why?)
• Order = 1

• Order = 3

• Order = 2
Coefficients of
Recursive (IIR)
Filters
Note the convention that the coefficients of the inputs (the x's) are denoted by a's, while the
coefficients of the outputs (the y's) are denoted by b's.
• 𝑎0 = 2, 𝑎1 = −1, 𝑏0 = 1, 𝑏1 = −1

• 𝑎0 = 0, 𝑎1 = 1, 𝑎2 = 0, 𝑎3 = −1, 𝑏0 = 1, 𝑏1 = 2, 𝑏2 = 0, 𝑏3 = 0

• 𝑎0 = 1, 𝑎1 = −2, 𝑎2 = 1, 𝑏0 = 1, 𝑏1 = 2, 𝑏2 = −1
Transfer Function
of Digital Filters
• Transfer Function
𝑏0 𝑦 𝑛 + 𝑏1 𝑦 𝑛 − 1 + 𝑏2 𝑦 𝑛 − 2 = 𝑎0 𝑥 𝑛 + 𝑎1 𝑥 𝑛 − 1 + 𝑎2 𝑥 𝑛 − 2

𝑏0 𝑦 𝑛 + 𝑏1 𝑧 −1 𝑦 𝑛 + 𝑏2 𝑧 −2 𝑦 𝑛 = 𝑎0 𝑥 𝑛 + 𝑎1 𝑧 −1 𝑥 𝑛 + 𝑎2 𝑧 −2 𝑥 𝑛

𝑏0 + 𝑏1 𝑧 −1 + 𝑏2 𝑧 −2 𝑦[𝑛] = 𝑎0 + 𝑎1 𝑧 −1 + 𝑎2 𝑧 −2 𝑥 𝑛

𝑦𝑛 𝑎0 + 𝑎1 𝑧 −1 + 𝑎2 𝑧 −2
=
𝑥[𝑛] 𝑏0 + 𝑏1 𝑧 −1 + 𝑏2 𝑧 −2
𝑦𝑛 𝑎0 + 𝑎1 𝑧 −1 + 𝑎2 𝑧 −2
=
𝑥[𝑛] 𝑏0 + 𝑏1 𝑧 −1 + 𝑏2 𝑧 −2
𝑦𝑛
= 𝑎0 + 𝑎1 𝑧 −1 + 𝑎2 𝑧 −2
𝑥[𝑛]
Example: Find the Transfer Function of the three-term
averaging filter
Block Diagram
Representation
of Filters
𝑦[𝑛] = 𝑎0 𝑥[𝑛] + 𝑎1 𝑥[𝑛 − 1] + 𝑎2 𝑥[𝑛 − 2]

𝑦[𝑛] = 𝑎0 𝑥[𝑛] + 𝑎1 𝑧 −1 𝑥[𝑛] + 𝑎2 𝑧 −2 𝑥[𝑛]


𝑎0
𝑥[𝑛] 𝑦[𝑛]

𝑧 −1
𝑎1
𝑥[𝑛 − 1]

𝑧 −1

𝑎2
𝑥[𝑛 − 2]
𝑦 𝑛 = 𝑎0 𝑥 𝑛 + 𝑎1 𝑥 𝑛 − 1 + 𝑎2 𝑥 𝑛 − 2 + 𝑏1 𝑦 𝑛 − 1 + 𝑏2 𝑦 𝑛 − 2

𝑦 𝑛 = 𝑎0 𝑥 𝑛 + 𝑎1 𝑧 −1 𝑥 𝑛 + 𝑎2 𝑧 −2 𝑥 𝑛 + 𝑏1 𝑧 −1 𝑦 𝑛 + 𝑏2 𝑧 −2 𝑦 𝑛
𝑎0
𝑥[𝑛] 𝑦[𝑛]

𝑧 −1 𝑧 −1
𝑎1 𝑏1

𝑥[𝑛 − 1] 𝑦[𝑛 − 1]

𝑧 −1 𝑧 −1

𝑎2 𝑏2

𝑥[𝑛 − 2] 𝑦[𝑛 − 2]

You might also like