Sciweavers

54 search results - page 1 / 11
» Detection of sparse signals under finite-alphabet constraint...
Sort
View
ICASSP
2009
IEEE
13 years 9 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
ICASSP
2010
IEEE
13 years 5 months ago
Sparsity maximization under a quadratic constraint with applications in filter design
This paper considers two problems in sparse filter design, the first involving a least-squares constraint on the frequency response, and the second a constraint on signal-to-noi...
Dennis Wei, Alan V. Oppenheim
TWC
2010
12 years 11 months ago
Maximum-likelihood noncoherent OSTBC detection with polynomial complexity
Abstract--We prove that maximum-likelihood (ML) noncoherent sequence detection of orthogonal space-time block coded signals can always be performed in polynomial time with respect ...
Dimitris S. Papailiopoulos, George N. Karystinos
JDCTA
2010
188views more  JDCTA 2010»
12 years 12 months ago
Compressive Sensing Signal Detection Algorithm Based on Location Information of Sparse Coefficients
Without reconstructing the signal themselves, signal detection could be solved by detection algorithm, which directly processes sampling value obtained from compressive sensing si...
Bing Liu, Ping Fu, Shengwei Meng, Lunping Guo
ICASSP
2011
IEEE
12 years 8 months ago
Efficient image reconstruction under sparsity constraints with application to MRI and bioluminescence tomography
Most bioimaging modalities rely on indirect measurements of the quantity under investigation. The image is obtained as the result of an optimization problem involving a physical m...
Matthieu Guerquin-Kern, Jean-Charles Baritaux, Mic...