By Topic

On an iterative method for basis pursuit with application to echo cancellation with sparse impulse responses

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shah, P. ; Dept. of Electr. & Comput. Eng., Missouri Univ. of Sci. & Technol., Rolla, MO, USA ; Grant, S.L. ; Benesty, J.

Basis pursuit has been shown to be an effective method of solving inverse problems with a small amount of data when the system to be determined has a sparse representation. Adaptive filters fall under this general category of problems. Here, we use the echo cancellation context to introduce a method of solving the basis pursuit problem with an iterative method based on the proportionate normalized affine projection algorithm (PAPA). Earlier, it has been shown that PAPA can be derived from a basis pursuit perspective. Here we refine the assumptions made in those derivations and show that an iterative form of PAPA yields the same results as basis pursuit without resorting to the simplex method. The resulting algorithm has extremely fast convergence for adaptive filters with very sparse impulse responses. Simulations using the new iterative approach are also presented.

Published in:

Acoustics, Speech and Signal Processing (ICASSP), 2012 IEEE International Conference on

Date of Conference:

25-30 March 2012