Please use this identifier to cite or link to this item: https://doi.org/10.1016/S0165-1684(01)00065-2
Title: High-performance conversions between continuous- and discrete-time systems
Authors: Wang, Q.-G. 
Bi, Q.
Yang, X.-P.
Keywords: Discrete systems
Discretization
Modelling
Optimization
Sampling rate
Issue Date: Sep-2001
Source: Wang, Q.-G.,Bi, Q.,Yang, X.-P. (2001-09). High-performance conversions between continuous- and discrete-time systems. Signal Processing 81 (9) : 1865-1877. ScholarBank@NUS Repository. https://doi.org/10.1016/S0165-1684(01)00065-2
Abstract: In this paper, a new algorithm for converting an S-domain model to a Z-domain model is proposed. The resultant Z-domain model is much closer to the original S-domain model than that obtained from conventional conversion schemes such as Tustin approximation with or without frequency pre-warping, zero-pole mapping equivalent, and Triangle hold equivalent. The proposed algorithm adopts the standard recursive least squares approach, and it has the following advantages. First, the computation is trivial and can be easily implemented online. Second, it can handle both parametric and non-parametric models, while conventional conversion methods can only handle parametric models. Third, it is very flexible and applicable to Z- to S-domain model conversion, sampling rate selection, re-sampling, time delay system conversion, and model order selection. The superior performance of the method is demonstrated with several simulation examples in this paper. © 2001 Elsevier Science B.V. All rights reserved.
Source Title: Signal Processing
URI: http://scholarbank.nus.edu.sg/handle/10635/56202
ISSN: 01651684
DOI: 10.1016/S0165-1684(01)00065-2
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

4
checked on Dec 13, 2017

WEB OF SCIENCETM
Citations

2
checked on Nov 3, 2017

Page view(s)

23
checked on Dec 16, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.