Thesis (Ph. D.)--University of Missouri--Rolla, 2007. / Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed November 29, 2007) Includes bibliographical references (p. 66-67).

Thesis (Ph. D.)--Carleton University, 2002. / Includes bibliographical references (p. 166-177). Also available in electronic format on the Internet.

Thesis (M.App.Sc.) - Carleton University, 2007. / Includes bibliographical references (p. 126-129). Also available in electronic format on the Internet.

Thesis (M.S.)--University of Missouri-Columbia, 2004. / Typescript. Includes bibliographical references (leaves 116-117). Also available on the Internet.

Thesis (M.Phil.) - University of Queensland, 2006. / Includes bibliography.

Thesis (M.S.)--University of Missouri-Columbia, 2004. / Typescript. Includes bibliographical references (leaves 116-117). Also available on the Internet.

This thesis demonstrates how a Fast Gradient approximation to a Lattice Filter can be used as an Adaptive Line Enhancer for sampled data consisting of multiple switching tones in correlated noise. A tradeoff analysis is performed with four methods of digital filtering including a conventional Digital Fourier Transform (DFT) algorithm, a Least Mean Squares (LMS) adaptive algorithm, a Fast Recursive Least Squares (Fast RLS) adaptive algorithm, and the Fast Gradient adaptive algorithm. The DFT algorithm is incapable of removing correlations from the incoming noise, and the LMS and Fast RLS algorithms become unstable when a dynamic switching environment is being filtered. The Fast Gradient adaptive algorithm simulated on a computer is robust and capable of converging to an optimal set of FIR filter weights with minimum Mean Squared Error. Parameters for the Fast Gradient algorithm are optimized to provide good filter performance with a minimum number of computations. / Master of Science

The main goal of this work was to develop adaptive filter algorithms and test their performance in active combustion control. Several algorithms were incorporated, which are divided into gradient descent algorithms and pattern searches. The algorithms were tested on three separate platforms. The first was an analog electronic simulator, which uses a second order acoustics model and a first order low pass filter to simulate the flame dynamics of an unstable tube combustor. The second was a flat flame, methane-air Rijke tube. The third can be considered a quasi-LDI liquid fuel combustor with a thermal output of approximately 30 kW. Actuation included the use of an acoustic actuator for the Rijke tube and a proportional throttling valve for the liquid fuel rig. Proportional actuation, pulsed actuation, and subharmonic control were all investigated throughout this work. The proportional actuation tests on the Rijke tube combustor have shown that, in general, the gradient descent algorithms outperformed the pattern search algorithms. Although, the pattern search algorithms were able to suppress the pressure signal to levels comparable to the gradient descent algorithms, the convergence time was lower for the gradient descent algorithms. The gradient algorithms were also superior in the presence of actuator authority limitations. The pulsed actuation on the Rijke tube showed that the convergence time is decreased for this type of actuation. This is due to the fact that there is a fixed amplitude control signal and algorithms did not have to search for sufficient magnitude. It was shown that subharmonic control could be used in conjunction with the algorithms. Control was achieved at the second and third subharmonic, and control was maintained for much higher subharmonics. The cost surface of the liquid fuel rig was obtained as the mean squared error of the combustor pressure as a function of the magnitude and phase of the controller. The adaptive algorithms were able to achieve some suppression of the pressure oscillations but did not converge to the optimal phase as shown in the cost surface. Simulations using the data from this cost surface were also performed. With the addition of a probing function, the algorithms were able to converge to a near-optimal condition. / Master of Science

Fast Recursive Least-Squares Transversal Filters (FTF), an important class of algorithms for adaptive filtering, have the well known problem of numerical instability. Several recent papers have suggested methods to modify the algorithm presented by Cioffi [3] to improve the algorithm’s stability. This paper explores the relationship between precision and stability of the adaptive filter. The effect of changing the adaptive time constant and the filter order are also investigated. These effects are studied for a floating point implementation of the FTF filter that allows for limiting the number of bits used in the mantissa of the results of all additions and multiplications. / Master of Science

Call number: LD2668 .T4 1985 B72 / Master of Science