Abstract
In this paper, we present a novel development of randomized algorithms for quadratic stability analysis of sampled-data systems with memoryless quantizers. The specific randomized algorithm employed generates a quadratic Lyapunov function and leads to realistic bounds on the performance of such systems. A key feature of this method is that the characteristics of quantizers are exploited to make the algorithm computationally efficient.
Original language | English (US) |
---|---|
Pages (from-to) | 839-846 |
Number of pages | 8 |
Journal | Automatica |
Volume | 40 |
Issue number | 5 |
DOIs | |
State | Published - May 2004 |
Keywords
- Quadratic stability
- Quantizers
- Randomized algorithms
- Sampled-data systems
ASJC Scopus subject areas
- Control and Systems Engineering
- Electrical and Electronic Engineering