TY - JOUR
T1 - Optimizing FIR approximation for discrete-time IIR filters
AU - Yamamoto, Yutaka
AU - Anderson, Brian D.O.
AU - Nagahara, Masaaki
AU - Koyanagi, Yoko
PY - 2003/9
Y1 - 2003/9
N2 - Finite-impulse response (FIR) filters are often preferred to infinite-impulse response (IIR) filters because of their various advantages in respect of stability, phase characteristic, implementation, etc. This letter proposes a new method to approximate an IIR filter by an FIR filter, which directly yields an optimal approximation with respect to the H∞ error norm. We show that this design problem can be reduced to a linear matrix inequality. We will also make a comparison via a numerical example with an existing method, known as the Nehari shuffle.
AB - Finite-impulse response (FIR) filters are often preferred to infinite-impulse response (IIR) filters because of their various advantages in respect of stability, phase characteristic, implementation, etc. This letter proposes a new method to approximate an IIR filter by an FIR filter, which directly yields an optimal approximation with respect to the H∞ error norm. We show that this design problem can be reduced to a linear matrix inequality. We will also make a comparison via a numerical example with an existing method, known as the Nehari shuffle.
KW - Finite-impulse response (FIR) filter approximation
KW - H optimization
KW - Linear matrix inequality
UR - http://www.scopus.com/inward/record.url?scp=0041878609&partnerID=8YFLogxK
U2 - 10.1109/LSP.2003.815615
DO - 10.1109/LSP.2003.815615
M3 - Letter
SN - 1070-9908
VL - 10
SP - 273
EP - 276
JO - IEEE Signal Processing Letters
JF - IEEE Signal Processing Letters
IS - 9
ER -