On minimal realization of 2-D systems

An algorithm to obtain possibly absolutely minimal realizations of a given 2-D transfer function is developed. It is algebraic in nature and requires only 1-D realization theory and basic knowledge of linear algebra. Hence, the algorithm is simple and easy to program. The algorithm is guaranteed to yield absolutely minimal realizations for 2-D transfer functions having separable numerators and may also be applicable to general 2-D systems satisfying a certain consistency condition. An example is used to illustrate the effectiveness of the algorithm.<
>