The FLS-QR algorithm for adaptive filtering: The case of multichannel signals
The Fast Least Squares (FLS) algorithms based on the QR triangular decomposition of the input signal matrix and developed for the case of one-dimensional signals can be extended to handle the case of multidimensional (MD) or multichannel signals. The FLS-QR algorithms for multidimensional signals are conceptually more complicated than those for one-dimensional signals. However, they can be implemented using a simplified approach which is just a repetition of the 1-D algorithm for a K times run, for K-dimensional signals. In that case, the computational complexity is just multiplied by the number of input signals and the basic properties of the 1-D case should be kept, particularly the robustness to wordlength limitations.
- Multichannel fast QRD-RLS adaptive filtering: block-channel and sequential-channel algorithms based on updating backward prediction errors
- Efficient adaptive algorithms for multichannel least squares filtering using a channel decomposition technique
- Fast adaptive algorithms for multichannel filtering and system identification
- scientific article; zbMATH DE number 125137
- Fast, recursive-least-squares transversal filters for adaptive filtering
- Efficient adaptive algorithms for multichannel least squares filtering using a channel decomposition technique
- A New Multichannel Recursive Least Squares Algorithm for Very Robust and Efficient Adaptive Filtering
- A Step-by-Step Quasi-Newton Algorithm in the Frequency Domain and Its Application to Adaptive Channel Equalization
- Multichannel fast QRD-RLS adaptive filtering: block-channel and sequential-channel algorithms based on updating backward prediction errors
This page was built for publication: The FLS-QR algorithm for adaptive filtering: The case of multichannel signals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809049)