A general zero attraction (GZA) proportionate normalized maximum correntropy criterion (GZA-PNMCC) algorithm is devised and presented on the basis of the proportionate-type adaptive filter techniques and zero attracting theory to highly improve the sparse system estimation behavior of the classical MCC algorithm within the framework of the sparse system identifications. The newly-developed GZA-PNMCC algorithm is carried out by introducing a parameter adjusting function into the cost function of the typical proportionate normalized maximum correntropy criterion (PNMCC) to create a zero attraction term. The developed optimization framework unifies the derivation of the zero attraction-based PNMCC algorithms. The developed GZA-PNMCC algorithm ...
This paper presents a novel adaptive algorithm based on RZA-LMS for sparse signal and system identif...
Sparse system identification has attracted much attention in the field of adaptive algorithms, and t...
In this thesis, low-complexity adaptive filtering algorithms that exploit the sparsity of signals an...
A general zero attraction (GZA) proportionate normalized maximum correntropy criterion (GZA-PNMCC) a...
A soft parameter function penalized normalized maximum correntropy criterion (SPF-NMCC) algorithm is...
To address the sparse system identification problem under noisy input and non-Gaussian output measur...
In this paper, we develop the adaptive algorithm for system identification where the model is sparse...
A group-constrained maximum correntropy criterion (GC-MCC) algorithm is proposed on the basis of the...
This paper proposes a new approach to identify time varying sparse systems. The proposed approach us...
Abstract An adaptive combination constrained proportionate normalized maximum correntropy criterion ...
The zero attraction affine projection algorithm (ZA-APA) achieves better performance in terms of con...
Sparse system identification has received a great deal of attention due to its broad applicability. ...
A general framework is proposed to derive proportionate adaptive algorithms for sparse system identi...
Abstract—Traditional stable adaptive filter was used normalized least-mean square (NLMS) algorithm. ...
Abstract—In order to improve the performance of Least Mean Square (LMS) based system identification ...
This paper presents a novel adaptive algorithm based on RZA-LMS for sparse signal and system identif...
Sparse system identification has attracted much attention in the field of adaptive algorithms, and t...
In this thesis, low-complexity adaptive filtering algorithms that exploit the sparsity of signals an...
A general zero attraction (GZA) proportionate normalized maximum correntropy criterion (GZA-PNMCC) a...
A soft parameter function penalized normalized maximum correntropy criterion (SPF-NMCC) algorithm is...
To address the sparse system identification problem under noisy input and non-Gaussian output measur...
In this paper, we develop the adaptive algorithm for system identification where the model is sparse...
A group-constrained maximum correntropy criterion (GC-MCC) algorithm is proposed on the basis of the...
This paper proposes a new approach to identify time varying sparse systems. The proposed approach us...
Abstract An adaptive combination constrained proportionate normalized maximum correntropy criterion ...
The zero attraction affine projection algorithm (ZA-APA) achieves better performance in terms of con...
Sparse system identification has received a great deal of attention due to its broad applicability. ...
A general framework is proposed to derive proportionate adaptive algorithms for sparse system identi...
Abstract—Traditional stable adaptive filter was used normalized least-mean square (NLMS) algorithm. ...
Abstract—In order to improve the performance of Least Mean Square (LMS) based system identification ...
This paper presents a novel adaptive algorithm based on RZA-LMS for sparse signal and system identif...
Sparse system identification has attracted much attention in the field of adaptive algorithms, and t...
In this thesis, low-complexity adaptive filtering algorithms that exploit the sparsity of signals an...