Loading [a11y]/accessibility-menu.js
Sparse adaptive filtering by iterative hard thresholding | IEEE Conference Publication | IEEE Xplore

Sparse adaptive filtering by iterative hard thresholding


Abstract:

In this paper, we present a new algorithm for sparse adaptive filtering, drawing from the ideas of a greedy compressed sensing recovery technique called the iterative har...Show More

Abstract:

In this paper, we present a new algorithm for sparse adaptive filtering, drawing from the ideas of a greedy compressed sensing recovery technique called the iterative hard thresholding (IHT) and the concepts of affine projection. While usage of affine projection makes it robust against colored input, the use of IHT provides a remarkable improvement in convergence speed over the existing sparse adaptive algorithms. Further, the gains in performance are achieved with very little increase in computational complexity.
Date of Conference: 29 October 2013 - 01 November 2013
Date Added to IEEE Xplore: 02 January 2014
Electronic ISBN:978-986-90006-0-4
Conference Location: Kaohsiung, Taiwan

References

References is not available for this document.