Modified Papoulis-Gerchberg algorithm for sparse signal recovery

Simple item page
dc.creatorKayvanrad, M. H.
dc.creatorZonoobi, D.
dc.creatorKassim, A. A.
dc.date2009-02-12
dc.date.accessioned2026-07-07T12:40:53Z
dc.date.available2026-07-07T12:40:53Z
dc.descriptionMotivated by the well-known Papoulis-Gerchberg algorithm, an iterative thresholding algorithm for recovery of sparse signals from few observations is proposed. The sequence of iterates turns out to be similar to that of the thresholded Landweber iterations, although not the same. The performance of the proposed algorithm is experimentally evaluated and compared to other state-of-the-art methods.
dc.description12 pages
dc.identifierhttps://arxiv.org/abs/0902.2036
dc.identifierhttp://arxiv.org/abs/0902.2036
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/219588
dc.subjectInformation Theory
dc.titleModified Papoulis-Gerchberg algorithm for sparse signal recovery
dc.typetext

Files

Collections

arXiv