Sciweavers

Share
CORR
2008
Springer

Sequential adaptive compressed sampling via Huffman codes

8 years 2 months ago
Sequential adaptive compressed sampling via Huffman codes
In this paper we introduce an information theoretic approach and use techniques from the theory of Huffman codes to construct a sequence of binary sampling vectors to determine a sparse signal. Unlike other approaches, ours is adaptive in the sense that each sampling vector depends on the previous sample results. The expected total cost (number of measurements and reconstruction combined) we need for an s-sparse vector in Rn is no more than s log n + 2s.
Akram Aldroubi, Haichao Wang, Kourosh Zarringhalam
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Akram Aldroubi, Haichao Wang, Kourosh Zarringhalam
Comments (0)
books