Files in this item
|(no description provided)|
|Title:||High-Performance Digital Filters|
|Doctoral Committee Chair(s):||Jones, Douglas L.|
|Department / Program:||Electrical Engineering|
|Degree Granting Institution:||University of Illinois at Urbana-Champaign|
|Subject(s):||Engineering, Electronics and Electrical|
|Abstract:||Digital filters, both finite impulse response (FIR) and infinite impulse response (IIR), are widely used in many applications. The motivation for this work lies in the importance of developing methods to reduce the complexity in implementing these types of filters.
The first issue addressed in this thesis is the reduction in computation for a FIR filter. We propose a method called shifted partial products to reduce the amount of computation for a FIR filter in the transpose form. A parallel implementation of this type of FIR filter is designed in very large scale integration (VLSI). Comparisons of this implementation to other conventional methods of implementation are made, primarily with respect to chip area. The VLSI implementation is strictly for an application-specific integrated circuit (ASIC) design, and the results obtained using shifted partial products compare favorably to those using a standard modified Booth's implementation.
The second issue addressed is the design of finite-wordlength linear-phase FIR filters. For a fixed-point implementation, it is known that truncating and/or rounding the infinite precision values does not, in general, result in optimal performance. We propose the log-cascade method for selecting the coefficients for a cascade structure. This method provides performance better than the current best method in many cases. By cascading subfilters to implement an overall filter and using a linearizing approximation to obtain an integer program, it is possible to improve quantized coefficient filter designs. Results are most impressive for filter designs requiring deep stopband suppression, a very common and important application.
We also introduce an extension of Kodek's method, the iterative Kodek method, which yields results slightly superior to the log-cascade method for most designs. However, this iterative method does contain limitations which are explained and discussed.
The last issue addressed in this thesis is the design of both constant and variable wordlength IIR filters. The log-cascade method is modified for the constant wordlength problem, but results are unsatisfactory. Subsequent investigation then focuses on the design of IIR filter coefficients with variable wordlengths. In this problem, the number of bits required to represent each coefficient in an IIR filter is varied, but the total number of bits is constant. Two different methods are presented for selecting these filter coefficients, each resulting in dramatic gains in performance. Both methods are motivated by the desire for a linear error trajectory and exploit the differing sensitivities of the filter coefficients.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1992.
|Date Available in IDEALS:||2014-12-16|
This item appears in the following Collection(s)
Dissertations and Theses - Electrical and Computer Engineering
Dissertations and Theses in Electrical and Computer Engineering
Graduate Dissertations and Theses at Illinois
Graduate Theses and Dissertations at Illinois