1988
DOI: 10.1109/29.1531
|View full text |Cite
|
Sign up to set email alerts
|

A fast ARMA transversal RLS filter algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

1992
1992
2013
2013

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(4 citation statements)
references
References 11 publications
0
4
0
Order By: Relevance
“…The procedure starts from the last row of , moves upwards, and guarantees the upper triangular structure and the positivedefiniteness of the resulting factor. It is now straightforward that inversion of (53) and (56) leads to (15) and (16).…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…The procedure starts from the last row of , moves upwards, and guarantees the upper triangular structure and the positivedefiniteness of the resulting factor. It is now straightforward that inversion of (53) and (56) leads to (15) and (16).…”
Section: Discussionmentioning
confidence: 99%
“…where is the Cholesky factor of It is clear from (14) that the time update of requires the time update of The latter is achieved by employing (for a proof see Appendix A) (15) and (16), shown at the bottom of the page, where and are quantities related to the backward and forward problems, respectively (Appendix A). According to (56) of Appendix A, the orthogonal matrix satisfies the equation (17) Matrix can be split up into blocks as…”
Section: Block Multichannel Fast Qrd Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The computational complexity of a fast RLS transversal ARMA filter can also be expressed in order of p k and q k [50]. When the fast Fourier transform (FFT) is utilized in implementing the Periodogram method, the required number of operations, which is the total number of real additions(subtractions) and multiplications(divisions) is C FFT (N) = 4N log 2 N, where N is the number of signal samples and is a power of 2 [51].…”
Section: Computational Complexitymentioning
confidence: 99%