Analysis of Time and Frequency Domain Performance of MFIR Filters
Jean‐Jacques Vandenbussche, Peter Lee, Joan Peuteman · Lirias (KU Leuven) · 2008
This paper revisits the performance of a class of filters known as Multiplicative FIR (MFIR) filters and evaluates their performance when used to approximate IIR filters containing a real pol or two conjugate poles. Experimental results using Matlab and ISE indicate that accurate MFIR approximations are significantly more efficient than direct form FIR equivalents, requiring substantially less computational resources to achieve similar responses. The paper examines the performance of a range of MFIR structures and compares their performance with the IIR equivalents in both the frequency and the time domain and shows that, for a sufficiently high order, the responses are virtually indistinguishable from the original IIR. New to the domain of MFIR analysis is that the characteristics of the MFIR structures make them ideally suited for use in ASICs and FPGAs where limited arithmetic resources are available, but memory is abundantly present.