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. |
Year | Venue | Keywords |
---|---|---|
2013 | Asia-Pacific Signal and Information Processing Association Annual Summit and Conference | Sparse Adaptive Filter,Compressed Sensing,Iterative Hard Thresholding,Affine Projection,PNLMS |
Field | DocType | ISSN |
Convergence (routing),Colored,Iterative method,Algorithm,Greedy algorithm,Theoretical computer science,Adaptive filter,Thresholding,Mathematics,Compressed sensing,Computational complexity theory | Conference | 2309-9402 |
Citations | PageRank | References |
1 | 0.36 | 14 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Rajib Lochan Das | 1 | 35 | 4.97 |
Mrityunjoy Chakraborty | 2 | 124 | 28.63 |