A general framework is proposed to derive proportionate adaptive algorithms for sparse system identification. The proposed algorithmic framework employs the convex optimization and covers many traditional proportionate algorithms. Meanwhile, based on this framework, some novel proportionate algorithms could be derived too. In the simulations, we compare the new derived proportionate algorithm with the traditional ones, and demonstrate that it could provide faster convergence rate and tracking performance for both white and colored input in sparse system identification. * Index Terms — proportionate adaptive algorithm, echo cancellation, convex optimizatio
Many problems in signal processing and statistical inference are based on finding a sparse solution ...
The past decade has witnessed the emergence of compressed sensing as a way of acquiring sparsely rep...
Sparse system identification has received a great deal of attention due to its broad applicability. ...
Proportionate adaptive filters can improve the convergence speed for the identification of sparse sy...
Abstract—We consider adaptive system identification problems with convex constraints and propose a f...
A novel block wise convex combination algorithm with adjusting blocks is proposed for block-sparse s...
Abstract – The approximate memory improved proportionate affine projection algorithm has been propos...
A sparse system identification algorithm for network echo cancellation is presented. This new approa...
In pattern recognition and machine learning, a classification problem refers to finding an algorithm...
In pattern recognition and machine learning, a classification problem refers to finding an algorithm...
A general zero attraction (GZA) proportionate normalized maximum correntropy criterion (GZA-PNMCC) a...
In this paper, we develop the adaptive algorithm for system identification where the model is sparse...
Sparse system identification has attracted much attention in the field of adaptive algorithms, and t...
Recently, a family of block-sparse proportionate adaptive filtering has been introduced for the bloc...
Abstract—In this letter, we show that the normalized least-mean-square (NLMS) algorithm and the affi...
Many problems in signal processing and statistical inference are based on finding a sparse solution ...
The past decade has witnessed the emergence of compressed sensing as a way of acquiring sparsely rep...
Sparse system identification has received a great deal of attention due to its broad applicability. ...
Proportionate adaptive filters can improve the convergence speed for the identification of sparse sy...
Abstract—We consider adaptive system identification problems with convex constraints and propose a f...
A novel block wise convex combination algorithm with adjusting blocks is proposed for block-sparse s...
Abstract – The approximate memory improved proportionate affine projection algorithm has been propos...
A sparse system identification algorithm for network echo cancellation is presented. This new approa...
In pattern recognition and machine learning, a classification problem refers to finding an algorithm...
In pattern recognition and machine learning, a classification problem refers to finding an algorithm...
A general zero attraction (GZA) proportionate normalized maximum correntropy criterion (GZA-PNMCC) a...
In this paper, we develop the adaptive algorithm for system identification where the model is sparse...
Sparse system identification has attracted much attention in the field of adaptive algorithms, and t...
Recently, a family of block-sparse proportionate adaptive filtering has been introduced for the bloc...
Abstract—In this letter, we show that the normalized least-mean-square (NLMS) algorithm and the affi...
Many problems in signal processing and statistical inference are based on finding a sparse solution ...
The past decade has witnessed the emergence of compressed sensing as a way of acquiring sparsely rep...
Sparse system identification has received a great deal of attention due to its broad applicability. ...