Balanced realization using an orthogonalization procedure and modular polynomial arithmetic

DOI10.1016/S0016-0032(96)00138-XMaRDI QIDQ5959148zbMATH OpenOpenAlexFDO

Authors Stephane Azou, P. Vilbe, L. C. Calvez

Publication date 23 June 2002

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0016-0032(96)00138-x

zbMATH Keywords

balanced realizationblock-factorized transfer function matrixmodular polynomial arithmeticorthogonalization processes of input mapsRouth-Aström tables

Mathematics Subject Classification ID

Realizations from input-output data (93B15) Minimal systems representations (93B20)

Review text

Starting from the approaches suggested in [\textit{B. S. Lee} and \textit{F. W. Fairman}, SIAM J. Control Optim. 25, 1-17 (1987; Zbl 0663.93017)] or [\textit{C. P. Therapos}, IEEE Trans. Autom. Control 30, 297-299 (1985; Zbl 0576.93015)], the authors derive, in a unified way, a balanced realization of a continuous-time or discrete-time block-factorized transfer function matrix (TFM) making use of orthogonalization processes of input maps along with the so-called Routh-Aström tables introduced in [\textit{L. C. Calvez}, \textit{P. Vilbé}, \textit{A. Derrien} and \textit{P. Brehonnet}, General orthogonal sequences via a Routh-type stability array, Electron. Lett. 30, 544-545 (1992)] and modular polynomial arithmetic. In this respect, preliminary results about Input/Output maps and the use of Routh-Aström tables are presented in Sections 2 and 3 respectively so that as a direct application of the previous results, a method is proposed in Section 4 to achieve a balanced realization of MIMO systems known by their TFM both for continuous or discrete time systems.NEWLINENEWLINENEWLINEFinally, a numerical example concerning the design of analog circuits whose elementary circuits yield high-order block-factorized transfer functions is given.

Recommendations

• Balanced realization of orthogonally symmetric transfer function matrices
• Balanced realizations via model operators
• Remarks on orthogonal polynomials and balanced realizations
• Balanced realization of non-minimal MIMO discrete-time systems
• A simple algorithm on minimal balanced realization for transfer function matrices

Cites work

• A simple algorithm on minimal balanced realization for transfer function matrices
• Balanced realization algorithm for scalar continuous-time systems having simple poles
• Balanced realization of orthogonally symmetric transfer function matrices
• Direct Minimal Balanced Realization from Impulse Response Matrices Using I/O Map Decomposition
• scientific article; zbMATH DE number 46484 (Why is no real title available?)
• Internally balanced minimal realization of discrete SISO systems
• Minimal balanced realization of transfer function matrices using Markov parameters
• Minimal realization of transfer function matrices via one orthogonal transformation
• On generalized balanced realizations
• Principal component analysis in linear systems: Controllability, observability, and model reduction
• Representation and realisation of stable systems using input maps
• Synthesis of minimum roundoff noise fixed point digital filters

Cited in

(4)

• Balanced realization of orthogonally symmetric transfer function matrices
• Balanced State Representations with Polynomial Algebra
• Balanced Modular Parameterizations
• Realization and canonical representation of linear systems through I/O maps

This page was built for publication: Balanced realization using an orthogonalization procedure and modular polynomial arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5959148)