File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1137/0917060
- Scopus: eid_2-s2.0-6044276065
- WOS: WOS:A1996UV64300009
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Fast recursive least squares adaptive filtering by fast Fourier transform-based conjugate gradient iterations
Title | Fast recursive least squares adaptive filtering by fast Fourier transform-based conjugate gradient iterations |
---|---|
Authors | |
Keywords | Recursive least squares Adaptive filter Circulant matrix Condition estimation Covariance matrix Fast Fourier transform Preconditioned conjugate gradient method Signal processing Sliding windows Toeplitz matrix |
Issue Date | 1996 |
Citation | SIAM Journal of Scientific Computing, 1996, v. 17, n. 4, p. 920-941 How to Cite? |
Abstract | Recursive least squares (RLS) estimations are used extensively in many signal processing and control applications. In this paper we consider RLS with sliding data windows involving multiple (rank k) updating and downdating computations. The least squares estimator can be found by solving a near-Toeplitz matrix system at each step. Our approach is to employ the preconditioned conjugate gradient method with circulant preconditioners to solve such systems. Here we iterate in the time domain (using Toeplitz matrix-vector multiplications) and precondition in the Fourier domain, so that the fast Fourier transform (FFT) is used throughout the computations. The circulant preconditioners are derived from the spectral properties of the given input stochastic process. When the input stochastic process is stationary, we prove that with probability 1. the spectrum of the preconditioned system is clustered around 1 and the method converges superlinearly provided that a sufficient number of data samples are taken, i.e., the length of the sliding window is sufficiently long. In the case of point-processing (k = 1), our method requires O(n log n) operations per adaptive filter input where n is the number of least squares estimators. In the case of block-processing (k ≥ n), our method requires only O(log n) operations per adaptive filter input. A simple method is given for tracking the spectral condition number of the data matrix at each step, and numerical experiments are reported in order to illustrate the effectiveness of our FFT-based method for fast RLS filtering. |
Persistent Identifier | http://hdl.handle.net/10722/276835 |
ISSN | 2023 Impact Factor: 3.0 2023 SCImago Journal Rankings: 1.803 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ng, Michael K. | - |
dc.contributor.author | Plemmons, Robert J. | - |
dc.date.accessioned | 2019-09-18T08:34:48Z | - |
dc.date.available | 2019-09-18T08:34:48Z | - |
dc.date.issued | 1996 | - |
dc.identifier.citation | SIAM Journal of Scientific Computing, 1996, v. 17, n. 4, p. 920-941 | - |
dc.identifier.issn | 1064-8275 | - |
dc.identifier.uri | http://hdl.handle.net/10722/276835 | - |
dc.description.abstract | Recursive least squares (RLS) estimations are used extensively in many signal processing and control applications. In this paper we consider RLS with sliding data windows involving multiple (rank k) updating and downdating computations. The least squares estimator can be found by solving a near-Toeplitz matrix system at each step. Our approach is to employ the preconditioned conjugate gradient method with circulant preconditioners to solve such systems. Here we iterate in the time domain (using Toeplitz matrix-vector multiplications) and precondition in the Fourier domain, so that the fast Fourier transform (FFT) is used throughout the computations. The circulant preconditioners are derived from the spectral properties of the given input stochastic process. When the input stochastic process is stationary, we prove that with probability 1. the spectrum of the preconditioned system is clustered around 1 and the method converges superlinearly provided that a sufficient number of data samples are taken, i.e., the length of the sliding window is sufficiently long. In the case of point-processing (k = 1), our method requires O(n log n) operations per adaptive filter input where n is the number of least squares estimators. In the case of block-processing (k ≥ n), our method requires only O(log n) operations per adaptive filter input. A simple method is given for tracking the spectral condition number of the data matrix at each step, and numerical experiments are reported in order to illustrate the effectiveness of our FFT-based method for fast RLS filtering. | - |
dc.language | eng | - |
dc.relation.ispartof | SIAM Journal of Scientific Computing | - |
dc.subject | Recursive least squares | - |
dc.subject | Adaptive filter | - |
dc.subject | Circulant matrix | - |
dc.subject | Condition estimation | - |
dc.subject | Covariance matrix | - |
dc.subject | Fast Fourier transform | - |
dc.subject | Preconditioned conjugate gradient method | - |
dc.subject | Signal processing | - |
dc.subject | Sliding windows | - |
dc.subject | Toeplitz matrix | - |
dc.title | Fast recursive least squares adaptive filtering by fast Fourier transform-based conjugate gradient iterations | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1137/0917060 | - |
dc.identifier.scopus | eid_2-s2.0-6044276065 | - |
dc.identifier.volume | 17 | - |
dc.identifier.issue | 4 | - |
dc.identifier.spage | 920 | - |
dc.identifier.epage | 941 | - |
dc.identifier.isi | WOS:A1996UV64300009 | - |
dc.identifier.issnl | 1064-8275 | - |