Cart (Loading....) | Create Account
Close category search window
 

An efficient implementation of the backward greedy algorithm for sparse signal reconstruction

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

1 Author(s)
Reeves, S.J. ; Dept. of Electr. Eng., Auburn Univ., AL, USA

Recent work in sparse signal reconstruction has shown that the backward greedy algorithm can select the optimal subset of unknowns if the perturbation of the data is sufficiently small. We propose an efficient implementation of the backward greedy algorithm that yields a significant improvement in computational efficiency over the standard implementation. Furthermore, we propose an efficient algorithm for the case in which the transform matrix is too large to be stored. We analyze the computational complexity and compare the algorithms, and we illustrate the improved efficiency with examples.

Published in:

Signal Processing Letters, IEEE  (Volume:6 ,  Issue: 10 )

Date of Publication:

Oct. 1999

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.