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.
|Title of host publication||IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2012|
|Publication status||Published - 2012|
Muller, A. C., Sejdinovic, D., & Piechocki, R. J. (2012). Approximate message passing under finite alphabet constraints. In IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2012