On the Efficient Implementation of an Implicit Discrete-Time Differentiator
New methodologies are designed to reduce the time complexity of an implicit discrete-time differentiator and the simulation time to implement it. They rely on Horner's method and the Shaw-Traub algorithm. The algorithms are compared for differentiators of orders 3, 7, and 10. The Half-Horner and Full-Horner methods showed the best performance and time complexity.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A Discrete-Time Matching Filtering Differentiator
This paper presents a time discretization of the robust exact filtering differentiator, a sliding mode differentiator coupled to filter, which provides a suitable approximation to the derivatives of some noisy signals. T…
Optimal Robust Exact Differentiation via Linear Adaptive Techniques
The problem of differentiating a function with bounded second derivative in the presence of bounded measurement noise is considered in both continuous-time and sampled-data settings. Fundamental performance limitations o…
AlgDiff: An open source toolbox for the design, analysis and discretisation of algebraic differentiators
Algebraic differentiators have attracted much interest in recent years. Their simple implementation as classical finite impulse response digital filters and systematic tuning guidelines may help to solve challenging prob…
Fault DiagnosisOptimal robust exact first-order differentiators with Lipschitz continuous output
The signal differentiation problem involves the development of algorithms that allow to recover a signal's derivatives from noisy measurements. This paper develops a first-order differentiator with the following combinat…
Robust exact differentiators with predefined convergence time
The problem of exactly differentiating a signal with bounded second derivative is considered. A class of differentiators is proposed, which converge to the derivative of such a signal within a fixed, i.e., a finite and u…