Fast square-root RLS adaptive filtering algorithms
From MaRDI portal
Recommendations
Cited in
(20)- Efficient fast recursive least-squares adaptive complex filtering using real valued arithmetic
- A fast algorithm for adaptive polynomial filtering
- An extended inverse QR adaptive filtering algorithm
- Fast QR algorithms based on backward prediction errors: A new implementation and its finite precision performance
- A fast sliding window QRD-RLS algorithm.
- Using a fast RLS adaptive algorithm for efficient speech processing
- Square-root algorithms of RLS Wiener filter and fixed-point smoother in linear discrete stochastic systems
- On extended RLS lattice adaptive variants: error-feedback, normalized, and array-based recursions
- A numerically stable fast RLS algorithm for adaptive filtering and prediction based on the UD factorization
- A delta least squares lattice algorithm for fast sampling
- A fast RLS transversal filter for adaptive linear phase filtering
- Fast, recursive-least-squares transversal filters for adaptive filtering
- scientific article; zbMATH DE number 4066776 (Why is no real title available?)
- scientific article; zbMATH DE number 17427 (Why is no real title available?)
- Rotation-based RLS algorithms: unified derivations, numerical properties, and parallel implementations
- scientific article; zbMATH DE number 125137 (Why is no real title available?)
- scientific article; zbMATH DE number 1844636 (Why is no real title available?)
- Analysis of the direct and indirect a posteriori RLSL algorithm
- scientific article; zbMATH DE number 800794 (Why is no real title available?)
- scientific article; zbMATH DE number 922644 (Why is no real title available?)
This page was built for publication: Fast square-root RLS adaptive filtering algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1391682)