Parametric synthesis of first-order stationary polynomial filters
Recursive digital constant-parameter filters (CPF) are also known as polynomial \(a\)-\(b\)-\(c\) filters. When the polynomial is of first degree, the corresponding filter has two parameters, \(a\) and \(b\), and is called an \(a\)-\(b\) filter. In this paper, several methods of parametric synthesis of \(a\)-\(b\) filters are compared. The parameters are shown to be related by the equality \(b=\rho a\), where \(\rho\) is a constant coefficient, in the range where the effective filter memory is large compared with discretization period. Moreover, a method is proposed for optimal choice of the coefficient \(\rho\) and the parameters \(a\) and \(b\) for the important practical case of an estimated function with a piecewise smooth second derivative, allowing for the transients in the \(a\)-\(b\) filter.
- Finite-memory digital filters based on polynomial approximation
- A generalized algorithm for the recursive implementation of polynomial filters
- scientific article; zbMATH DE number 651978
- Design of discrete stationary recursive polynomial filters with a higher order of lag
- Application of parametric transfer functions for synthesis of discrete- time control laws. I: Optimal discrete filtering of continuous dynamic processes by the average variance criterion
This page was built for publication: Parametric synthesis of first-order stationary polynomial filters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1319787)
