Efficient recovery algorithm for discrete valued sparse signals using an ADMM approach
Motivated by applications in wireless communications, in this paper we propose a reconstruction algorithm for sparse signals whose values are taken from a discrete set, using a limited number of noisy observations. Unlike conventional compressed sensing algorithms, the proposed approach incorporates...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2017
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10071/14512 |
| País: | Portugal |
| Oai: | oai:repositorio.iscte-iul.pt:10071/14512 |
| Resumo: | Motivated by applications in wireless communications, in this paper we propose a reconstruction algorithm for sparse signals whose values are taken from a discrete set, using a limited number of noisy observations. Unlike conventional compressed sensing algorithms, the proposed approach incorporates knowledge of the discrete valued nature of the signal in the detection process. This is accomplished through the alternating direction method of the multipliers which is applied as a heuristic to decompose the associated maximum likelihood detection problem in order to find candidate solutions with a low computational complexity order. Numerical results in different scenarios show that the proposed algorithm is capable of achieving very competitive recovery error rates when compared with other existing suboptimal approaches. |
|---|