Abstract
The discrete-time bounded-real lemma is further developed for nonminimal digital systems. Based on this lemma, rigorous necessary and sufficient conditions for the existence of positive definite solutions to the Lyapunov equation for n-dimensional (n-D) digital systems are proposed. These new conditions are improvements and extensions of earlier conditions and can be applied to n-D digital systems with characteristic polynomials involving 1-D factor polynomials. Further, the results in this paper show that the positive definite solutions to the n-D Lyapunov equation of a n-D system with characteristic polynomial involving 1-D factors can be obtained from the solutions of a k-D (o ≤ k ≤ n) subsystem and m (1 ≤ m ≤ n) 1-D subsystems. This could significantly simplify the complexity of solving the n-D Lyapunov equation for such cases.
| Original language | English |
|---|---|
| Title of host publication | IEEE International Symposium on Circuits and Systems |
| Publisher | IEEE, Institute of Electrical and Electronics Engineers |
| Pages | 781-784 |
| Number of pages | 4 |
| Volume | 2 |
| Publication status | Published - 1995 |
| Externally published | Yes |
| Event | IEEE International Symposium on Circuits and Systems 1995 - Seattle, United States of America Duration: 30 Apr 1995 → 3 May 1995 https://ieeexplore.ieee.org/xpl/conhome/3941/proceeding (Proceedings) |
Conference
| Conference | IEEE International Symposium on Circuits and Systems 1995 |
|---|---|
| Abbreviated title | ISCAS 1995 |
| Country/Territory | United States of America |
| City | Seattle |
| Period | 30/04/95 → 3/05/95 |
| Internet address |
|
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver