IEEE International Conference on Acoustics Speech and Signal Processing · 1993 · 13 citations · 8 references
ComputingComputer EngineeringComputer ScienceAlgorithmsData StructuresTime Series AnalysisDigital Signal ProcessingFourier AnalysisFrequency-domain AnalysisMatrix ComputationSignal ProcessingTime-frequency AnalysisAdaptive FilteringCholesky DecompositionFast Fourier TransformFilter DesignFourier TransformSliding Window Algorithms
An algorithm for fast adaptive filtering is proposed. The algorithm applies a FFT (fast Fourier transform)-based iterative method and uses sliding data windows involving block updating and downdating computations. The method is stable and robust, and computes the tap weight filter vector in O(L log N) operations, where the sliding window Toeplitz data matrix X is L-by-N. The complexity thus generally lies between those of the family of unstable but fast, O(N), methods and the stable but slow O(N/sup 2/) Cholesky factor updating methods.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
8
Steven C. Rogers · Control Engineering Practice · 1996 · 9.3K citations
A Proposal for Toeplitz Matrix Calculations
Gilbert Strang · Studies in Applied Mathematics · 1986 · 429 citations