Balanced realizations of discrete-time stable all-pass systems and the tangential Schur algorithm
The paper investigates the connections between two different approaches to the parametrization of stable all-pass linear systems in discrete time. The first approach is based on the tangential Schur algorithm which uses linear fractional transformations. The second approach is based in balanced canonical forms for state-space realizations. In the scalar case it is known that a canonical form exists and that it can also be parameterized by the Schur algorithm. By establishing the connections between the two approaches, the authors are able to generalize this result to the multidimensional case.
scientific article