Lecture-5 (ABSP) - Recursive and Non-Recursive Digital Filters
Lecture-5 (ABSP) - Recursive and Non-Recursive Digital Filters
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]
• 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]
𝑧 −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]