The FLS-QR algorithm for adaptive filtering: The case of multichannel signals
type: Item
instance of: scholarly article
title: The FLS-QR algorithm for adaptive filtering: The case of multichannel signals
zbMATH Open document ID: 0731.93085
DOI: 10.1016/0165-1684(91)90044-J
author: Maurice G. Bellanger
author: Phillip A. Regalia
published in: Signal Processing
publication date: 1991-01-01T00:00:00Z
review text: 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.
reviewed by: D. Cusmir
Mathematics Subject Classification ID: 93E11
Mathematics Subject Classification ID: 93C35
Mathematics Subject Classification ID: 60G35
zbMATH DE Number: 4210031
zbMATH Keywords: adaptive filtering
zbMATH Keywords: fast least squares algorithms
zbMATH Keywords: multichannel signals
zbMATH Keywords: multidimensional signals
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 4210031