Optimalq-Markov COVER for finite wordlength implementation Academic Article uri icon

abstract

  • The existing q-Markov COVER realization theory does not take into account the problems of arithmetic errors due to both the quantization of states and coefficients of the reduced-order model. All q-Markov COVERs allow some freedom in the choice of parameters. In this paper we exploit this freedom in the existing theory to optimize the models with respect to these finite wordlength effects. 1989 Springer-Verlag New York Inc.

published proceedings

  • Theory of Computing Systems

author list (cited authors)

  • Williamson, D., & Skelton, R. E.

citation count

  • 3

complete list of authors

  • Williamson, Darrell||Skelton, Robert E

publication date

  • December 1989