Conference icon

Conference

Approximate message passing under finite alphabet constraints

Abstract:

In this paper we consider Basis Pursuit De-Noising (BPDN) problems in which the sparse original signal is drawn from a finite alphabet. To solve this problem we propose an iterative message passing algorithm, which capitalises not only on the sparsity but by means of a prior distribution also on the discrete nature of the original signal. In our numerical experiments we test this algorithm in combination with a Rademacher measurement matrix and a measurement matrix derived from the random dem...

Expand abstract

Actions


Access Document


Publisher copy:
10.1109/ICASSP.2012.6288590

Authors


Pages:
3177-3180
Publication date:
2012-01-01
DOI:
ISSN:
1520-6149
URN:
uuid:509235b1-f6b9-4271-b500-e260b27a7202
Source identifiers:
487755
Local pid:
pubs:487755
ISBN:
9781467300469

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP