Reduced Look Ahead Orthogonal Matching Pursuit

Swamy, Prateek Basavapur and Ambat, Sooraj K and Chatterjee, Saikat and Hari, KVS (2014) Reduced Look Ahead Orthogonal Matching Pursuit. In: 2014 TWENTIETH NATIONAL CONFERENCE ON COMMUNICATIONS (NCC), FEB 28-MAR 02, 2014, Kanpur, INDIA.

PDF TNat_con_com_2014.pdf - Published Version Restricted to Registered users only Download (136kB) | Request a copy

Abstract

Compressed Sensing (CS) is an elegant technique to acquire signals and reconstruct them efficiently by solving a system of under-determined linear equations. The excitement in this field stems from the fact that we can sample at a rate way below the Nyquist rate and still reconstruct the signal provided some conditions are met. Some of the popular greedy reconstruction algorithms are the Orthogonal Matching Pursuit (OMP), the Subspace Pursuit (SP) and the Look Ahead Orthogonal Matching Pursuit (LAOMP). The LAOMP performs better than the OMP. However, when compared to the SP and the OMP, the computational complexity of LAOMP is higher. We introduce a modified version of the LAOMP termed as Reduced Look Ahead Orthogonal Matching Pursuit (Reduced LAOMP). Reduced LAOMP uses prior information from the results of the OMP and the SP in the quest to speedup the look ahead strategy in the LAOMP. Monte Carlo simulations of this algorithm deliver promising results.

Item Type:	Conference Proceedings
Series.:	National Conference on Communications NCC
Publisher:	IEEE
Additional Information:	Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Keywords:	Compressed Sensing; Greedy reconstruction; Matching Pursuit
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	19 Jul 2015 09:32
Last Modified:	19 Jul 2015 09:32
URI:	http://eprints.iisc.ac.in/id/eprint/51862

Actions (login required)

View Item