Balanced realizations of discrete-time stable all-pass systems and the tangential Schur algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2004

Balanced realizations of discrete-time stable all-pass systems and the tangential Schur algorithm

Abstract

In this report, the connections are investigated between two different approaches towards the parametrization of multivariable stable all-pass systems in discrete-time. The first approach involves the tangential Schur algorithm, which employs linear fractional transformations. It stems from the theory of reproducing kernel Hilbert spaces and enables the direct construction of overlapping local parametrizations using Schur parameters and interpolation points. The second approach proceeds in terms of state-space realizations. In the scalar case, a balanced canonical form exists that can also be parametrized by Schur parameters. This canonical form can be constructed recursively, using unitary matrix operations. Here, this procedure is generalized to the multivariable case by establishing the connections with the first approach. It gives rise to balanced realizations and overlapping canonical forms directly in terms of the parameters used in the tangential Schur algorithm.
Fichier principal
Vignette du fichier
RR-5111.pdf (375.39 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00071471 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071471 , version 1

Cite

Bernard Hanzon, Martine Olivi, Ralf L.M. Peeters. Balanced realizations of discrete-time stable all-pass systems and the tangential Schur algorithm. RR-5111, INRIA. 2004. ⟨inria-00071471⟩
71 View
94 Download

Share

Gmail Facebook Twitter LinkedIn More