Return to search

The effects of precision on the fast, recursive least-squares transversal filters for adaptive filtering

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

Identiferoai:union.ndltd.org:VTETD/oai:vtechworks.lib.vt.edu:10919/41753
Date24 March 2009
CreatorsDaniel, Timothy Seth
ContributorsElectrical Engineering, Ricci, Fred J., Knight, Joseph A., Kettig, Robert L.
PublisherVirginia Tech
Source SetsVirginia Tech Theses and Dissertation
LanguageEnglish
Detected LanguageEnglish
TypeThesis, Text
Formativ, 152 leaves, BTD, application/pdf, application/pdf
RightsIn Copyright, http://rightsstatements.org/vocab/InC/1.0/
RelationOCLC# 22391993, LD5655.V855_1990.D365.pdf

Page generated in 0.0022 seconds