the new family of adaptive filter algorithms for block-sparse system identification

Background and objectives: in order to improve the performance of normalized subband adaptive filter algorithm (nsaf) for identifying the block-sparse (bs) systems, this paper introduces the novel adaptive algorithm which is called bsnsaf. in the following, an improved multiband structured subband adaptive filter (imsaf) algorithms for bs system identification is also proposed. the bs imsaf has faster convergence speed than bs-nsaf. since the computational complexity of bs-imsaf is high, the selective regressor (sr) and dynamic selection (ds) approaches are utilized and bs-sr-imsaf and bs-ds-imsaf are introduced. furthermore, the theoretical steady-state performance analysis of the presented algorithms is studied. methods: all algorithms are established based on the 𝐿2,0-norm constraint to the proposed cost function and the method of lagrange multipliers is used to optimize the cost function. results: the good performance of the proposed algorithms is demonstrated through several simulation results in the system identification setup. the algorithms are justified and compared in various scenarios and optimum values of the parameters are obtained. also, the computational complexity of different algorithms is studied. in addition, the theoretical steady state values of mean square error (mse) values are compared with simulation values. conclusion: the bs-nsaf algorithm has better performance than nsaf for bs system identification. the bsimsaf algorithm has better convergence speed than bs-nsaf. to reduce the computational complexity, the bs-sr-imsaf and bs-dsrimsaf algorithms are developed. these algorithms have close performance to bs-imsaf.