Ito, Yoshimichi (Osaka Univ.), Shirahama, Hiroshi (Osaka Univ.), Babaguchi, Noboru (Osaka Univ.)

On Sensitivity Reduction Problems of Sampled-Data Systems--Performance Limitations and the Properties of Aliasing Factors

Scheduled for presentation during the Regular Session "Sampled-data control II" (ThA09), Thursday, July 27, 2006, 11:40−12:05, Room J

17th International Symposium on Mathematical Theory of Networks and Systems, July 24-28, 2006, Kyoto, Japan

This information is tentative and subject to change. Compiled on May 19, 2024

Abstract

In this paper, we consider the performance limitations of sampled-data systems and discrete-time systems for the sensitivity reduction problem and complementary sensitivity reduction problem. First, we derive some basic properties of aliasing factors appearing in the sensitivity reduction problems of sampled-data systems. The aliasing factors are naturally obtained when we consider the relationships between the sensitivity reduction problems of sampled-data systems and those of pure discrete-time systems, and they can be regarded as the ones which represent the influence of the aliasing ignored in pure discrete-time settings. Next, we consider the relationship between the best achievable performance of discrete-time systems for the sensitivity reduction problem and that for the complementary sensitivity reduction problem. The relationship between the lower bounds of the best achievable performance obtained by Sung and Hara is also studied. Finally, we show performance limitations of sampled-data systems for simple case.