Reducing IIR Filter Computational Workload
This document describes a straightforward method to significantly reduce the number of necessary multiplies per input sample of traditional IIR lowpass and highpass digital filters.
Summary
Rick Lyons presents a practical technique to substantially reduce the number of multiplies per input sample in conventional IIR lowpass and highpass digital filters. The paper explains the structural modifications, implementation considerations, and trade-offs so readers can adopt the approach in real-time and resource-constrained systems.
Key Takeaways
- Apply a coefficient-sharing/structure-modification method to lower per-sample multiply counts for IIR lowpass and highpass filters.
- Quantify expected compute savings and trade-offs (CPU cycles, memory, and latency) for common filter orders and sampling rates.
- Preserve filter frequency response and stability while implementing the reduced-multiply structure, including guidance on coefficient scaling and fixed-point care.
- Benchmark and integrate the method into real-time DSP or embedded implementations and compare it to standard direct-form and biquad realizations.
Who Should Read This
DSP engineers and developers implementing IIR filters in real-time or resource-constrained systems who want to reduce multiply cost without sacrificing filter performance.
Still RelevantIntermediate
Related Documents
- A Quadrature Signals Tutorial: Complex, But Not Complicated TimelessIntermediate
- Lecture Notes on Elliptic Filter Design TimelessAdvanced
- Computing FFT Twiddle Factors TimelessAdvanced
- Digital Envelope Detection: The Good, the Bad, and the Ugly TimelessIntermediate
- The World's Most Interesting FIR Filter Equation: Why FIR Filters Can Be Line... TimelessAdvanced







