Search

In this paper, two arctangent-based normalized subband adaptive filter (Arc-NSAF) algorithms are proposed, which are derived from two different forms of arctangent cost function and their difference is the order of the arctangent computation and the summation operation of the normalized subband error signal. Benefiting from the excellent property of the arctangent function for suppressing impulsive interferences, the proposed Arc-NSAF algorithms not only possess good robustness against impulsive interferences, but also obtain faster convergence rate for the colored input signals. To further improve the convergence performance of the Arc-NSAFs when identifying sparse system, the proportionate versions of the Arc-NSAF algorithms are also proposed. Simulation results have demonstrated the superiority of the proposed algorithms in impulsive interferences environments as compared to their respective competitors. [ABSTRACT FROM AUTHOR]

Variable step size norm-constrained adaptive filtering algorithms are proposed in the paper. A variable step size is derived by minimizing the variance of the noise-free a posterior error. Thus, the update equation can obtain a reasonable step size at each iteration. Due to the introduction of variable step size, the proposed algorithms based on the constrained conditions of $$L_{1}$$ and $$L_{0}$$ norm have a significant advantage that the convergence rate is faster than some well-known algorithms in the sparse system. The simulation results illustrate the good performance of the proposed algorithms. [ABSTRACT FROM AUTHOR]

This paper presents a new proportionate normalized subband adaptive filter (PNSAF) algorithm, called the IAF-PNSAF, which assigns an individual activation factor for each filter coefficient instead of a common one for all filter coefficients as in the standard PNSAF algorithm. This algorithm achieves an improved performance in terms of the convergence rate and tracking capability for identifying a highly sparse system. Moreover, to overcome the trade-off of the fixed-step-size IAF-PNSAF algorithm between the fast convergence rate and small steady-state misalignment, its adaptive combination version is proposed. Simulation results for identifying the impulse response with high sparseness have demonstrated that the proposed algorithms outperform their counterparts. [ABSTRACT FROM AUTHOR]

In this paper an $$\ell _1$$ -regularized recursive total least squares (RTLS) algorithm is considered for the sparse system identification. Although recursive least squares (RLS) has been successfully applied in sparse system identification, the estimation performance in RLS based algorithms becomes worse, when both input and output are contaminated by noise (the error-in-variables problem). We proposed an algorithm to handle the error-in-variables problem. The proposed $$\ell _1$$ -RTLS algorithm is an RLS like iteration using the $$\ell _1$$ regularization. The proposed algorithm not only gives excellent performance but also reduces the required complexity through the effective inversion matrix handling. Simulations demonstrate the superiority of the proposed $$\ell _1$$ -regularized RTLS for the sparse system identification setting. [ABSTRACT FROM AUTHOR]