Robust and Computationally Efficient Digital IIR Filter Synthesis and Stability Analysis Under Finite Precision Implementations

In this paper, an analytical synthesis method for obtaining an optimal infinite impulse response (IIR) state-space realization, say minimal pole-zero and pole-<inline-formula><tex-math notation="LaTeX">$L_2$</tex-math></inline-formula> sensitivity realizations, based on minimizing zero/<inline-formula><tex-math notation="LaTeX">$L_2$</tex-math></inline-formula> sensitivity measures subject to sparse normal-form state transition matrix is proposed. The proposed <inline-formula><tex-math notation="LaTeX">$n$</tex-math></inline-formula>th order realization possesses strong robustness and at most only <inline-formula><tex-math notation="LaTeX">$4n+1$</tex-math></inline-formula> multiplications per output sample to prevent instability and output distortion, as well as to keep computational efficiency under finite word-length (FWL) effects. This is important for the IIR filter implemented in fixed-point and portable digital devices. In this paper, the proposed pole-<inline-formula><tex-math notation="LaTeX">$L_2$</tex-math></inline-formula> sensitivity minimization method, an alternative approach of pole-zero sensitivity minimization, may solve the issue of zero multiplicity. A normal-form realization has been proven that it can achieve a global minimum of un-weighted pole sensitivity measure as well as zero-input limit-cycle free property. The sparse normal-form realization can be synthesized from an arbitrary initial realization with distinct poles by using an analytical similarity transformation. Based on the derived fixed-point arithmetic model in state-space realizations, the Bellman-Gronwall Lemma, and normal-form transformation, a new word-length estimation to guarantee stability is derived. Finally, numerical simulations are performed to verify the correctness and the effectiveness of the theoretical results.