DocumentCode :
1517344
Title :
Generalizations and new proof of the discrete-time positive real lemma and bounded real lemma
Author :
Xiao, Chengshan ; Hill, David J.
Author_Institution :
Wireless Networks, Nortel, Nepean, Ont., Canada
Volume :
46
Issue :
6
fYear :
1999
fDate :
6/1/1999 12:00:00 AM
Firstpage :
740
Lastpage :
743
Abstract :
There are three different restatements claimed to be equivalent to the definition of discrete-time positive realness (DTPR) in the literature. These restatements were obtained by assuming that they are similar to the results of continuous-time positive realness when the transfer function has poles on the stability boundary. In this paper it is shown that only one of them is equivalent to the DTPR lemma and others are disproved by counter-examples. Furthermore, the DTPR lemma is specialized for minimal systems which have all poles on the unit cycle, the DTPR lemma is also generalized for nonminimal systems, the discrete-time bounded real (DTBR) lemma is proven by a simple method, and then the DTBR lemma is extended to the nonminimal case. Continuous-time results are also briefly considered in the Appendix
Keywords :
discrete time systems; poles and zeros; stability; transfer functions; discrete-time bounded real lemma; discrete-time positive real lemma; minimal systems; poles; stability boundary; transfer function; unit cycle; Filters; Network synthesis; Optimal control; Signal design; Signal synthesis; Stability analysis; Sufficient conditions; Symmetric matrices; Transfer functions; Two dimensional displays;
fLanguage :
English
Journal_Title :
Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
Publisher :
ieee
ISSN :
1057-7122
Type :
jour
DOI :
10.1109/81.768830
Filename :
768830
Link To Document :
بازگشت