Type of Document Dissertation Author Sankaran, Sundar G Author's Email Address firstname.lastname@example.org URN etd-122099-153321 Title On Ways to Improve Adaptive Filter Performance Degree PhD Department Electrical and Computer Engineering Advisory Committee
Advisor Name Title Beex, A. A. Louis Committee Chair Baumann, William T. Committee Member Borojevich, Dushan Committee Member Haskell, Peter E. Committee Member Jacobs, Ira Committee Member VanLandingham, Hugh F. Committee Member Keywords
- Unbiased Equation Error
- Algorithm Analysis
- Stereophonic Echo Cancellation
- Affine Projection Algorithm
- Filter Structures
- Adaptive Filtering
- Adaptive IIR Filtering
Date of Defense 1999-12-13 Availability unrestricted AbstractAdaptive filtering techniques are used in a wide range of applications, including echo cancellation, adaptive equalization, adaptive noise cancellation, and adaptive beamforming. The performance of an adaptive filtering algorithm is evaluated based on its convergence rate, misadjustment, computational requirements, and numerical robustness. We attempt to improve the performance by developing new adaptation algorithms and by using "unconventional" structures for adaptive filters.
Part I of this dissertation presents a new adaptation algorithm, which we have termed the Normalized LMS algorithm with Orthogonal Correction Factors (NLMS-OCF). The NLMS-OCF algorithm updates the adaptive filter coefficients (weights) on the basis of multiple input signal vectors, while NLMS updates the weights on the basis of a single input vector. The well-known Affine Projection Algorithm (APA) is a special case of our NLMS-OCF algorithm.
We derive convergence and tracking properties of NLMS-OCF using a simple model for the input vector. Our analysis shows that the convergence rate of NLMS-OCF (and also APA) is exponential and that it improves with an increase in the number of input signal vectors used for adaptation. While we show that, in theory, the misadjustment of the APA class is independent of the number of vectors used for adaptation, simulation results show a weak dependence. For white input the mean squared error drops by 20 dB in about 5N/(M+1) iterations, where N is the number of taps in the adaptive filter and (M+1) is the number of vectors used for adaptation. The dependence of the steady-state error and of the tracking properties on the three user-selectable parameters, namely step size, number of vectors used for adaptation (M+1), and input vector delay D used for adaptation, is discussed. While the lag error depends on all of the above parameters, the fluctuation error depends only on step size. Increasing D results in a linear increase in the lag error and hence the total steady-state mean-squared error. The optimum choices for step size and M are derived. Simulation results are provided to corroborate our analytical results.
We also derive a fast version of our NLMS-OCF algorithm that has a complexity of O(NM). The fast version of the algorithm performs orthogonalization using a forward-backward prediction lattice. We demonstrate the advantages of using NLMS-OCF in a practical application, namely stereophonic acoustic echo cancellation. We find that NLMS-OCF can provide faster convergence, as well as better echo rejection, than the widely used APA.
While the first part of this dissertation attempts to improve adaptive filter performance by refining the adaptation algorithm, the second part of this work looks at improving the convergence rate by using different structures. From an abstract viewpoint, the parameterization we decide to use has no special significance, other than serving as a vehicle to arrive at a good input-output description of the system. However, from a practical viewpoint, the parameterization decides how easy it is to numerically minimize the cost function that the adaptive filter is attempting to minimize.
A balanced realization is known to minimize the parameter sensitivity as well as the condition number for Grammians. Furthermore, a balanced realization is useful in model order reduction. These properties of the balanced realization make it an attractive candidate as a structure for adaptive filtering. We propose an adaptive filtering algorithm based on balanced realizations.
The third part of this dissertation proposes a unit-norm-constrained equation-error based adaptive IIR filtering algorithm. Minimizing the equation error subject to the unit-norm constraint yields an unbiased estimate for the parameters of a system, if the measurement noise is white. The proposed algorithm uses the hyper-spherical transformation to convert this constrained optimization problem into an unconstrained optimization problem. It is shown that the hyper-spherical transformation does not introduce any new minima in the equation error surface. Hence, simple gradient-based algorithms converge to the global minimum. Simulation results indicate that the proposed algorithm provides an unbiased estimate of the system parameters.
Filename Size Approximate Download Time (Hours:Minutes:Seconds)
28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access Abstract.pdf 7.88 Kb 00:00:02 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01 Acknowledgment.pdf 4.02 Kb 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01 Bibliography.pdf 13.78 Kb 00:00:03 00:00:01 00:00:01 < 00:00:01 < 00:00:01 Biography.pdf 6.09 Kb 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01 Chapter01.pdf 16.25 Kb 00:00:04 00:00:02 00:00:02 00:00:01 < 00:00:01 Chapter02.pdf 136.07 Kb 00:00:37 00:00:19 00:00:17 00:00:08 < 00:00:01 Chapter03.pdf 124.17 Kb 00:00:34 00:00:17 00:00:15 00:00:07 < 00:00:01 Chapter04.pdf 81.99 Kb 00:00:22 00:00:11 00:00:10 00:00:05 < 00:00:01 Chapter05.pdf 64.58 Kb 00:00:17 00:00:09 00:00:08 00:00:04 < 00:00:01 Chapter06.pdf 55.65 Kb 00:00:15 00:00:07 00:00:06 00:00:03 < 00:00:01 Chapter07.pdf 108.71 Kb 00:00:30 00:00:15 00:00:13 00:00:06 < 00:00:01 Chapter08.pdf 20.60 Kb 00:00:05 00:00:02 00:00:02 00:00:01 < 00:00:01 Chapter09.pdf 45.66 Kb 00:00:12 00:00:06 00:00:05 00:00:02 < 00:00:01 Chapter10.pdf 56.26 Kb 00:00:15 00:00:08 00:00:07 00:00:03 < 00:00:01 Chapter11.pdf 8.93 Kb 00:00:02 00:00:01 00:00:01 < 00:00:01 < 00:00:01 Coverpage.pdf 3.86 Kb 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01 ListOfFigures.pdf 6.74 Kb 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01 ListOfTables.pdf 3.22 Kb < 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01 TableOfContents.pdf 5.48 Kb 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01 < 00:00:01
If you have questions or technical problems, please Contact DLA.