By Topic

Reconstruction of jointly sparse signals using iterative hard thresholding

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
$33 $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

2 Author(s)
Alireza Makhzani ; Department of Electrical and Computer Engineering, University of Toronto ; Shahrokh Valaee

There is a recent interest in developing algorithms for the reconstruction of jointly sparse signals, which arises in a large number of applications such as sensor networks. In many of these applications, we encounter extremely large problem sizes for which algorithms with low computational complexity are required. Recently, an algorithm called iterative hard thresholding has been proposed, which is faster than the ℓ1-minimization and greedy algorithms for compressed sensing. In this work, we extend the iterative hard thresholding algorithm to jointly sparse signals and will investigate the performance of our proposed algorithm analytically by giving conditions under which the exact reconstruction could happen. We will show that our algorithm is faster than the state of the art algorithms for jointly sparse signals while showing similar performance.

Published in:

2012 IEEE International Conference on Communications (ICC)

Date of Conference:

10-15 June 2012