HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

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.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 5:39:58 PM
Last modification on : Friday, February 4, 2022 - 3:16:06 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:17:14 PM


  • HAL Id : inria-00071471, version 1



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⟩



Record views


Files downloads