The FLS-QR algorithm for adaptive filtering: The case of multichannel signals (Q809049)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The FLS-QR algorithm for adaptive filtering: The case of multichannel signals |
scientific article; zbMATH DE number 4210031
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The FLS-QR algorithm for adaptive filtering: The case of multichannel signals |
scientific article; zbMATH DE number 4210031 |
Statements
The FLS-QR algorithm for adaptive filtering: The case of multichannel signals (English)
0 references
1991
0 references
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.
0 references
adaptive filtering
0 references
fast least squares algorithms
0 references
multichannel signals
0 references
multidimensional signals
0 references