A new VLSI system for adaptive recursive filtering
From MaRDI portal
(Redirected from Publication:1123556)
The adaptive recursive filtering problem is investigated. The input to this problem is a \(n\times w\) matrix of weighting coefficients and a \(1\times w\) vector. The output is a \(1\times n\) vector. A bidirectional chain VLSI system consisting of w processors is presented. The working of this system is described formally by a systolic algorithm. The improvement over previous designs is demonstrated by comparing different performance measures.
Recommendations
- A robust, parallelizable, O(m), a posteriori recursive least squares algorithm for efficient adaptive filtering
- Efficient VLSI array processing structures for adaptive quadratic digital filters
- scientific article; zbMATH DE number 3959293
- A systematic methodology for the design of high performance recursive digital filters
- Fast adaptive algorithms for multichannel filtering and system identification
Cited in
(3)
This page was built for publication: A new VLSI system for adaptive recursive filtering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123556)