Pipelined IIR Filter Architecture Using Pole-Radius Minimization

Author: Boston Nigel

Source: The Journal of VLSI Signal Processing, Volume 39, Number 3, March 2005 , pp. 323-331(9)

Publisher: Springer

Buy & download fulltext article:

Price: $47.00 plus tax (Refund Policy)

Abstract:

An extension of a polynomial consists of the polynomial plus higher power terms. Given a polynomial with real coefficients and an integer larger than its degree, a method is given that produces a finite list of extensions of degree this larger integer such that this list necessarily contains the extension whose largest root is as small as possible. This extension is called the pole radius minimizer. The pole radius minimizer is then found by the finite check of comparing the polynomials in the list. The method is applied to obtain filter transformations that are optimal as regards throughput, but also have considerable savings in hardware overhead compared with standard methods such as Scattered Lookahead and Minimum Order Augmentation. The table in Section 5 gives an explicit comparison for various kinds of filters.

Keywords: filter; architecture; pipelining; transfer function; stabilization

Document Type: Research article

DOI: http://dx.doi.org/10.1007/s11265-005-4848-3

Affiliations: 1: Departments of Mathematics and Electrical and Computer Engineering, University of Wisconsin, Madison, WI, 53706, USA, Email: boston@math.wisc.edu

Publication date: 2005-03-01