2015
Sparse symbol detection by a greedy tree search
ICASSP 2015accepted
In this paper, we consider a detection problem of the underdetermined system when the input vector is sparse and its elements are chosen from a set of finite alphabets. We propose a greedy sparse recovery algorithm dubbed as the sparse detection matching pursuit (SDMP) that is effective in recoverin…