2006
DOI: 10.1016/j.sigpro.2005.09.012
|View full text |Cite
|
Sign up to set email alerts
|

Improvement of the convergence speed and the tracking ability of the fast Newton type adaptive filtering (FNTF) algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
13
0

Year Published

2009
2009
2019
2019

Publication Types

Select...
4
1

Relationship

4
1

Authors

Journals

citations
Cited by 15 publications
(13 citation statements)
references
References 13 publications
0
13
0
Order By: Relevance
“…The choice of s1 and s1 is found by simulations. In addition, the choice s1 = 0 and s2 = 0 corresponds to the original numerical stabilization method proposed in [20], which was adapted to the monochannel FNTF algorithm in [16]. In practice, the variables v1 N ,t and v2 N ,t are never zero on account of the machine precision.…”
Section: Numerical Stabilization Of the 2cfntf Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The choice of s1 and s1 is found by simulations. In addition, the choice s1 = 0 and s2 = 0 corresponds to the original numerical stabilization method proposed in [20], which was adapted to the monochannel FNTF algorithm in [16]. In practice, the variables v1 N ,t and v2 N ,t are never zero on account of the machine precision.…”
Section: Numerical Stabilization Of the 2cfntf Algorithmmentioning
confidence: 99%
“…In this contribution, we propose a new stereophonic version of the fast Newton transversal filter algorithm [16,17] that has a good performance in the SAEC applications. This new algorithm works to cancel the issue echo from the propagation of two input signals in the same room as shown in Figure 1.…”
Section: Introductionmentioning
confidence: 99%
“…[18][19][20] The most important advantage of the NLMS algorithm is its simplicity and ease of implementation, but it has the drawback of slow convergence speed with correlated signals as in AEC systems. [30][31][32] A major problem of these fast algorithms is the numerical instability that constraints the good behavior of these algorithms. [20][21][22][23] The recursive least square algorithms family and their fast versions have improved the NLMS with correlated signals.…”
Section: Introductionmentioning
confidence: 99%
“…24,25 The most popular fast versions of the recursive least square algorithm are the fast transversal filter [26][27][28][29] and the fast newton transversal filter algorithms. [30][31][32] A major problem of these fast algorithms is the numerical instability that constraints the good behavior of these algorithms. 33,34 Another algorithmic family is the affine projection (AP) algorithm, which can be considered as a generalization of the NLMS family.…”
Section: Introductionmentioning
confidence: 99%
“…More advanced techniques are then proposed recently in [21,22]. Furthermore, several algorithms have been proposed, in combination with single, two-and multichannel techniques for NR and SE applications, are recently proposed as a new countermeasure for the presented problem [23][24][25][26]. Recently, a particular consideration has been made for the two forward and backward blind source separation structures to be applied to enhance corrupted speech signals and cancel the acoustic noise components.…”
Section: Introductionmentioning
confidence: 99%