Model reduction and stability of two-dimensional recursive systems

Abstract

Many approaches can be found in the literature for the realization of two-dimensional recursive digital filters using both ordinary [12, 17, 18] and branched continued fraction expansions [3, 4]. In this paper we introduce a new type of branched continued fraction expansion which has specific advantages when considering the model reduction problem. The form of the new BCF is such that, when the expansion is constructed for the transfer function of a stable system, convergents of the BCF expansion automatically satisfy one part of the Huang stability theorem [6, 9]. In Section 1 we shall first briefly review the one-dimensional case, and in Section 2 we shall give the algorithm for the new BCF expansion and indicate how the simplification of the stability test for the “reduced” systems follows in a natural way. We conclude Section 2 with an example. 1. One-dimensional recursive systems. Consider a onedimensional linear shift-invariant (LSI) recursive system T satisfying a finite difference-equation of the form