Parametric synthesis of first-order stationary polynomial filters (Q1319787)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parametric synthesis of first-order stationary polynomial filters |
scientific article; zbMATH DE number 553572
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parametric synthesis of first-order stationary polynomial filters |
scientific article; zbMATH DE number 553572 |
Statements
Parametric synthesis of first-order stationary polynomial filters (English)
0 references
8 May 1994
0 references
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.
0 references
recursive digital constant-parameter filters
0 references
0.737621545791626
0 references
0.7081688046455383
0 references
0.6997637748718262
0 references