DocumentCode
1456348
Title
Boolean Compressed Sensing and Noisy Group Testing
Author
Atia, George K. ; Saligrama, Venkatesh
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA
Volume
58
Issue
3
fYear
2012
fDate
3/1/2012 12:00:00 AM
Firstpage
1880
Lastpage
1901
Abstract
The fundamental task of group testing is to recover a small distinguished subset of items from a large population while efficiently reducing the total number of tests (measurements). The key contribution of this paper is in adopting a new information-theoretic perspective on group testing problems. We formulate the group testing problem as a channel coding/decoding problem and derive a single-letter characterization for the total number of tests used to identify the defective set. Although the focus of this paper is primarily on group testing, our main result is generally applicable to other compressive sensing models.
Keywords
Boolean functions; channel coding; computational complexity; decoding; error statistics; maximum likelihood detection; signal denoising; Boolean compressed sensing; Fano inequality; additive Bernoulli noise model; approximate reconstruction; arbitrarily small average error probability; bounded distortion; channel coding-decoding problem; deterministic noise-free case; information-theoretic perspective; maximum likelihood detector; noiseless group testing; noisy group testing; random coding; single-letter characterization; worst-case error criterion; Blood; Decoding; Error probability; Indexes; Noise measurement; Testing; Vectors; Compressed sensing (CS); ML decoding; group testing; sparse models;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2011.2178156
Filename
6157065
Link To Document