Approximate Message Passing under Finite Alphabet Constraints

Details Approximate Message Passing under Finite Alphabet Constraints Approximate Message Passing under Finite Alphabet Constraints

2012-01-24

arxiv.org/abs/1201.4949v1

Computer Science

Information Theory

4 pages, 2 figures, to appear in IEEE International Conference on Acoustics, Speech, and Signal Processing ICASSP 2012

Scientific paper

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 demodulator, which enables compressive sampling of analogue signals. Our results show in both cases significant performance gains over a linear programming based approach to the considered BPDN problem. We also compare the proposed algorithm to a similar message passing based algorithm without prior knowledge and observe an even larger performance improvement.

Affiliated with

Also associated with

No associations

Rating

Approximate Message Passing under Finite Alphabet Constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximate Message Passing under Finite Alphabet Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate Message Passing under Finite Alphabet Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-106747