Sciweavers

2 search results - page 1 / 1
» How frequently is a system of 2-linear Boolean equations sol...
Sort
View
ICASSP
2009
IEEE
13 years 8 months ago
Detection of sparse signals under finite-alphabet constraints
In this paper, we solve the problem of detecting the entries of a sparse finite-alphabet signal from a limited amount of data, for instance obtained by compressive sampling. While...
Zhi Tian, Geert Leus, Vincenzo Lottici