2010
DOI: 10.1007/s11265-010-0494-5
|View full text |Cite
|
Sign up to set email alerts
|

On the Performance Analysis of a Class of Transform-domain NLMS Algorithms with Gaussian Inputs and Mixture Gaussian Additive Noise Environment

Abstract: This paper studies the convergence performance of the transform domain normalized least mean square (TDNLMS) algorithm with general nonlinearity and the transform domain normalized least mean M-estimate (TDNLMM) algorithm in Gaussian inputs and additive Gaussian and impulsive noise environment. The TDNLMM algorithm, which is derived from robust M-estimation, has the advantage of improved performance over the conventional TDNLMS algorithm in combating impulsive noises. Using Price's theorem and its extension, t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
4
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 26 publications
0
4
0
Order By: Relevance
“…), we have segmented each matrix line into small stationary intervals. To represent each of these intervals by a Gaussian stationary noise (Rice, ; Hida & Hitsuda, ; Chan & Zhou, ; Chang & Liu, ; Nakamori, ) as described above, we have computed the Gaussian parameters the mean mfalse^in and the variance italicσfalse^in2 for each resulting interval using the following expressions, respectively:truem^in=1Lk=lLl1xinfalse(kfalse)trueσ^in2=1Lk=lLl1false(xin(k)truem^infalse)2where x i ( l − L ),…, x i ( l − 1) are the values of the n th ( n = 1,2… N ) interval of the i th ( i = 1,2… I ) image matrix line, L is the interval length and l = n . L .…”
Section: Resultsmentioning
confidence: 99%
“…), we have segmented each matrix line into small stationary intervals. To represent each of these intervals by a Gaussian stationary noise (Rice, ; Hida & Hitsuda, ; Chan & Zhou, ; Chang & Liu, ; Nakamori, ) as described above, we have computed the Gaussian parameters the mean mfalse^in and the variance italicσfalse^in2 for each resulting interval using the following expressions, respectively:truem^in=1Lk=lLl1xinfalse(kfalse)trueσ^in2=1Lk=lLl1false(xin(k)truem^infalse)2where x i ( l − L ),…, x i ( l − 1) are the values of the n th ( n = 1,2… N ) interval of the i th ( i = 1,2… I ) image matrix line, L is the interval length and l = n . L .…”
Section: Resultsmentioning
confidence: 99%
“…As mentioned earlier the signal Eigenvalue can be minimized by converting the signal to Wavelet domain and the Krylov method can be used to address the sparsity [9][10].The materials and methods are illustrated in Fig. 1.through following phases.…”
Section: Methodsmentioning
confidence: 99%
“…In [8] Krylov subspace is used to reduce the rank of large scale state space models by taking fusion machine as an example. In [9] This latest research is related to our proposed research because it customs the Krylov matrix to mollify their issues [5][6][7][8], whereas it caters convergence issue [9].…”
mentioning
confidence: 99%
“…1 -Segment the signal (or each matrix line of the image) into small enough stationary segments 2 -Compute the parameters (means and variances) of each of these normal segments using equations ( 3) and (4) below to represent each of them by a corresponding GWN model [20,21].…”
mentioning
confidence: 99%