Skip to main content
Log in

Recursive partial realization for 2-D data arrays

  • Published:
Multidimensional Systems and Signal Processing Aims and scope Submit manuscript

Abstract

In this paper an attempt is made to provide a proper formalization to the partial realization problem for discrete linear causal shift invariant 2-D systems. The approach falls into the class of 2-D Padé approximations; the results, however, are new, since the rational representation matches all the samples of a 2-D partial sequence. The realization algorithm, though characterized by a high complexity, exhibits a recursive structure and allows for a good computational economy.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • B.L. Ho and R.E. Kalman, “Effective construction of linear state-variable models from input/output functions,”Regelungstechnik, 14, pp. 545–548, 1966.

    Google Scholar 

  • L. Silverman, “Realization of linear dynamical systems,”IEEE Trans. Automatic Control, AC-16, pp. 554–567, 1971.

    Article  Google Scholar 

  • A. Magnus, “Expansion of power series in P-fractions,”Math. Z., vol. 80, pp. 209–216, 1962.

    Article  Google Scholar 

  • R.E. Kalman, “On partial realizations, transfer functions, and canonical forms,”Acta Polytechnica Scandinavica, Helsinki, MA31, pp. 9–32, 1979.

    Google Scholar 

  • W.B. Gragg and A. Lindquist, “On the partial realization problem,”Linear Algebra and its Applications, special volume on linear systems and control, vol. 50, pp. 277–319, 1983.

    Google Scholar 

  • J. Rissanen, “Recursive identification of linear systems,”SIAM J. Control, vol. 9, pp. 430–440, 1971.

    Article  Google Scholar 

  • E.R. Berlekamp,Algebraic Coding Theory, New York: McGraw-Hill, 1968.

    Google Scholar 

  • J.L. Massey, “Shift register synthesis and BCH deconding,”IEEE Trans. Inform. Theory, IT-15, pp. 122–127, 1969.

    Article  Google Scholar 

  • E. Fornasini and G. Marchesini, “On the problem of constructing minimal realizations for two dimensional filters,”IEEE Trans. Pattern Anal. Mach. Intell., PAMI-2, pp. 172–176, 1980.

    Google Scholar 

  • N.K. Bose and S. Basu, “Two dimensional matrix Padé approximants: Existence, nonuniqueness, and recursive computation,”IEE Trans. Automatic Control, AC-25, pp. 509–514, 1980.

    Article  Google Scholar 

  • S. Sakata, “Finding a minimal set of linear recuring relations capable of generating a given finite two dimensional array,”Journal of Symbolic Computat., vol. 5, pp. 321–337, 1988.

    Google Scholar 

  • S. Sakata, “Partial realization of 2-D discrete linear systems and 2-D Padé approximation and reduction of 2-D transfer function,”Proc. IEEE, vol. 78, pp. 604–613, 1990.

    Article  Google Scholar 

  • S. Sakata, “On minimal partial realization of 2D discrete linear shift-invariant systems,”IEEE Trans. Automatic Control (forthcoming) 1991.

  • Y.S. Kao and C.T. Chen, “Two dimensional Hankel theory,”Int. J. Contr., vol. 31, pp. 271–284, 1980.

    Google Scholar 

  • M. Morf, B.C. Levy and S.Y. Kung, “New results in 2-D system theory, Part I: 2-D polynomial matrices, factorization, and coprimeness,”Proc. IEEE, vol. 65, pp. 861–872, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zampieri, S. Recursive partial realization for 2-D data arrays. Multidim Syst Sign Process 2, 101–126 (1991). https://doi.org/10.1007/BF01938220

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01938220

Keywords

Navigation