Turbo Compressed Sensing with Partial DFT Sensing Matrix

In this letter, we propose a turbo compressed sensing algorithm with partial discrete Fourier transform (DFT) sensing matrices. Interestingly, the state evolution of the proposed algorithm is shown to be consistent with that derived using the replica method. Numerical results demonstrate that the pr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE signal processing letters Jg. 22; H. 2; S. 158 - 161
Hauptverfasser: Ma, Junjie, Yuan, Xiaojun, Ping, Li
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.02.2015
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Approximate message passing (AMP)
Approximation
Approximation algorithms
Compressed
Compressed sensing
Detection
Discrete Fourier transforms
Evolution
Fourier transforms
Mathematical models
Message passing
partial DFT matrix
replica method
Sensors
Signal processing algorithms
state evolution
ISSN:1070-9908, 1558-2361
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this letter, we propose a turbo compressed sensing algorithm with partial discrete Fourier transform (DFT) sensing matrices. Interestingly, the state evolution of the proposed algorithm is shown to be consistent with that derived using the replica method. Numerical results demonstrate that the proposed algorithm outperforms the well-known approximate message passing (AMP) algorithm when a partial DFT sensing matrix is involved.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2014.2351822