Approximate message passing under finite alphabet constraints
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...
| Main Authors: | , , |
|---|---|
| Format: | Conference item |
| Published: |
2012
|
Similar Items
Dynamic graph message passing networks for visual recognition
by: Zhang, L, et al.
Published: (2022)
by: Zhang, L, et al.
Published: (2022)