2009
DOI: 10.3844/jcssp.2009.347.354
|View full text |Cite
|
Sign up to set email alerts
|

Improvement of the Simplified Fast Transversal Filter Type Algorithm for Adaptive Filtering

Abstract: Problem statement: In this study, we proposed a new algorithm M-SMFTF for adaptive filtering with fast convergence and low complexity. Approach: It was the result of a simplified FTF type algorithm, where the adaptation gain was obtained only from the forward prediction variables and using a new recursive method to compute the likelihood variable. Results: The computational complexity was reduced from 7L-6L, where L is the finite impulse response filter length. Furthermore, this computatio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
3
0

Year Published

2012
2012
2014
2014

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 12 publications
1
3
0
Order By: Relevance
“…This Algorithm 2 is close to that proposed in [45][46][47], with the same differences as mentioned at the end of Algorithm 1 presentation. This Algorithm 2 is listed in Table V, and its computation complexity is given in Table VI.…”
Section: Lc1; T Lcnsupporting
confidence: 82%
See 1 more Smart Citation
“…This Algorithm 2 is close to that proposed in [45][46][47], with the same differences as mentioned at the end of Algorithm 1 presentation. This Algorithm 2 is listed in Table V, and its computation complexity is given in Table VI.…”
Section: Lc1; T Lcnsupporting
confidence: 82%
“…We recall here that in [45][46][47], the authors proposed a comparable version to our Algorithm 1 with the same complexity (only in terms of multiplications). The differences between theses algorithms are as follows: (i) the proposed recursive relation of the likelihood variable .new/ L; t and (ii) the proposed periodic regularization of .new/ L; t that we propose in this paper.…”
Section: The Proposed Algorithmmentioning
confidence: 99%
“…2) Algorithms: The choice of algorithm dictates the computational cost and accuracy of the adaptive filter. The most common algorithm employed in adaptive filtering is the least mean-square (LMS) algorithm with a computational complexity of O(L) (L is the filter length) [55] and which has a weight update equation [56]…”
Section: A Adaptive Filteringmentioning
confidence: 99%
“…Another family of algorithms commonly used in adaptive filtering is based on the recursive least square (RLS) algorithm. This is a computationally more complex algorithm with a computational complexity of O(L 2 ) [55] and an update equation [57]…”
Section: A Adaptive Filteringmentioning
confidence: 99%