High-speed recursive digital filter realization (Q2265986)
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: High-speed recursive digital filter realization |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | High-speed recursive digital filter realization |
scientific article |
Statements
High-speed recursive digital filter realization (English)
0 references
1984
0 references
In the paper the way in which the pipeline techniques (PT) can be applied to recursive (infinite) impulse response is shown. These techniques rely on a particular realization of a logic module (a special way of combining multiplications, additions and delays). As it is known the PT allow to increase the clock rate (sampling rate). It is shown that starting from a given digital transfer function H(z), associated with a difference equation (DE), one can construct a new DE of higher order (the augmented DE) but leading to the same H(z). The augmentation of the initial DE is achieved in such a way that the block scheme can be built by use of PT. Mathematically speaking by this way H(z) is multiplied by the same polynomial at the numerator and at the denominator. The major result of the paper states that if H(z) is stable then there exists a minimally augmented H(z) which is also stable. Finally, an example of application is presented. We think the paper opens a new line in the digital signal processing.
0 references
pipeline techniques
0 references
recursive (infinite) impulse response
0 references
digital signal processing
0 references