Engineering PapersSearch

Engineering topics

Hwang, Chyi

Publications and source records attributed to Hwang, Chyi.

Model reduction of nonsquare linear MIMO systems using multipoint matrix continued-fraction expansions

This paper deals with the multipoint Cauer matrix continued-fraction expansion (MCFE) for model reduction of linear multi-input multi-output (MIMO) systems with various numbers of inputs and outputs. A salient feature of the proposed MCFE approach to model reduction of MIMO systems with square transfer matrices is its equivalence to the matrix Pade approximation approach. The Cauer second form of the ordinary MCFE for a square transfer function matrix is generalized in this paper to a multipoint and nonsquare-matrix version. An interesting connection of the multipoint Cauer MCFE method to the multipoint matrix Pade approximation method is established. Also, algorithms for obtaining the reduced-degree matrix-fraction descriptions and reduced-dimensional state-space models from a transfer function matrix via the multipoint Cauer MCFE algorithm are presented. Practical advantages of using the multipoint Cauer MCFE are discussed and a numerical example is provided to illustrate the algorithms.

Guo, Tong-Yi

Order reduction of z-transfer functions via multipoint Jordan continued-fraction expansion

The order reduction problem of z-transfer functions is solved by using the multipoint Jordan continued-fraction expansion (MJCFE) technique. An efficient algorithm that does not require the use of complex algebra is presented for obtaining an MJCFE from a stable z-transfer function with expansion points selected from the unit circle and/or the positive real axis of the z-plane. The reduced-order models are exactly the multipoint Pade approximants of the original system and, therefore, they match the (weighted) time-moments of the impulse response and preserve the frequency responses of the system at some characteristic frequencies, such as gain crossover frequency, phase crossover frequency, bandwidth, etc.

Lee, Ying-Chin

Model reduction using new optimal Routh approximant technique

An optimal Routh approximant of a single-input single-output dynamic system is a reduced-order transfer function of which the denominator is obtained by the Routh approximation method while the numerator is determined by minimizing a time-response integral-squared-error (ISE) criterion. In this paper, a new elegant approach is presented for obtaining the optimal Routh approximants for linear time-invariant continuous-time systems. The approach is based on the Routh canonical expansion, which is a finite-term orthogonal series of rational basis functions, and minimization of the ISE criterion. A procedure for combining the above approach with the bilinear transformation is also presented in order to obtain the optimal bilinear Routh approximants of linear time-invariant discrete-time systems. The proposed technique is simple in formulation and is amenable to practical implementation.

Hwang, Chyi

A canonical state-space representation for SISO systems using multipoint Jordan CFE

A canonical state-space realization based on the multipoint Jordan continued-fraction expansion (CFE) is presented for single-input-single-output (SISO) systems. The similarity transformation matrix which relates the new canonical form to the phase-variable canonical form is also derived. The presented canonical state-space representation is particularly attractive for the application of SISO system theory in which a reduced-dimensional time-domain model is necessary.

Hwang, Chyi

Improved FFT-based numerical inversion of Laplace transforms via fast Hartley transform algorithm

The disadvantages of numerical inversion of the Laplace transform via the conventional fast Fourier transform (FFT) are identified and an improved method is presented to remedy them. The improved method is based on introducing a new integration step length Delta(omega) = pi/mT for trapezoidal-rule approximation of the Bromwich integral, in which a new parameter, m, is introduced for controlling the accuracy of the numerical integration. Naturally, this method leads to multiple sets of complex FFT computations. A new inversion formula is derived such that N equally spaced samples of the inverse Laplace transform function can be obtained by (m/2) + 1 sets of N-point complex FFT computations or by m sets of real fast Hartley transform (FHT) computations.

Hwang, Chyi