Proper Implicit Discretization of Arbitrary-Order Robust Exact Differentiators
Richard Seeber
TL;DR
This work tackles the problem of differentiating signals from sampled, noisy measurements by refining Levant's robust exact differentiator to a proper implicit discretization. It introduces the implicit robust exact differentiator (IRED), where outputs are carefully designed linear combinations of state variables, avoiding prior discretization chattering and bias. The authors derive finite-time stability conditions, rigorous error bounds under measurement noise, and provide a numerical implementation with approximate schemes and root-finding guidance. Simulations demonstrate superior accuracy and robustness relative to existing implicit methods, confirming the approach's practical impact for high-order, noise-robust differentiation in digital control systems.
Abstract
This paper considers the implicit Euler discretization of Levant's arbitrary order robust exact differentiator in presence of sampled measurements. Existing implicit discretizations of that differentiator are shown to exhibit either unbounded bias errors or, surprisingly, discretization chattering despite the use of the implicit discretization. A new, proper implicit discretization that exhibits neither of these two detrimental effects is proposed by computing the differentiator's outputs as appropriately designed linear combinations of its state variables. A numerical differentiator implementation is discussed and closed-form stability conditions for arbitrary differentiation orders are given. The influence of bounded measurement noise and numerical approximation errors is formally analyzed. Numerical simulations confirm the obtained results.
