On the minimal partial realization of 2D discrete linear shift-invariant systems

The partial realization problem for 2D discrete linear shift-invariant systems is discussed. The authors attempt to establish a reasonable definition of minimality and propose a method for finding the degree and the system function of a minimal realization of a 2D linear system characterized by a given 2D impulse response array. The method used is based on the 2D Berlekamp-Massey algorithm which has a close connection with the 2D Hankel matrix derived from the 2D array. While it compares in efficiency with other methods for identification and approximation of 2D linear systems, it gives a novel approach to the problem in the sense that one does not need any knowledge or assumptions concerning the system degree.<
>