Sciweavers

943 search results - page 112 / 189
» Compressed channel sensing
Sort
View
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 9 months ago
"Real" Slepian-Wolf Codes
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac...
Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg
ICIP
2010
IEEE
13 years 7 months ago
Gradient projection for linearly constrained convex optimization in sparse signal recovery
The 2- 1 compressed sensing minimization problem can be solved efficiently by gradient projection. In imaging applications, the signal of interest corresponds to nonnegative pixel...
Zachary T. Harmany, Daniel Thompson, Rebecca Wille...
ICASSP
2011
IEEE
13 years 21 days ago
Look ahead orthogonal matching pursuit
For compressive sensing, we endeavor to improve the recovery performance of the existing orthogonal matching pursuit (OMP) algorithm. To achieve a better estimate of the underlyin...
Saikat Chatterjee, Dennis Sundman, Mikael Skoglund
ICASSP
2011
IEEE
13 years 21 days ago
An ALPS view of sparse recovery
We provide two compressive sensing (CS) recovery algorithms based on iterative hard-thresholding. The algorithms, collectively dubbed as algebraic pursuits (ALPS), exploit the res...
Volkan Cevher
ICASSP
2011
IEEE
13 years 21 days ago
Group testing meets traitor tracing
This paper links two a priori different topics, group testing and traitor tracing. Group testing, as an instantiation of a compressed sensing problem over binary data, is indeed e...
Peter Meerwald, Teddy Furon