Pool size control for adaptive group testing via boolean compressed sensing with solution space reduction

Kawasaki, Ryo; Hayashi, Kazunori; Kaneko, Megumi

doi:10.1109/apsipa.2015.7415367

Cited by 4 publications

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the proposed method, the parameter p is selected so that the information obtained by a single observation is maximized, which can be achieved when the number of zeros in the binary observation, such as y B 1 and y B 2 , is the same as that of ones. Note that a similar approach has been originally proposed for the pool size control in adaptive group testing [7,8]. The probability that a single binary observation y B becomes zero can be approximated by the probability that all bits sent by L tags are zero, i.e.,…”

Section: Selection Of Pmentioning

confidence: 99%

An RFID tag identification protocol via Boolean compressed sensing

et al. 2016

Self Cite

View full text Add to dashboard Cite

This paper proposes a tag identification protocol built upon Boolean compressed sensing (CS) for radio frequency identification (RFID) systems. Unlike the conventional CS-based tag identification (CS-ID) protocol, the proposed protocol can cope with flat fading channels without explicit channel estimation. Simulation results show that the proposed scheme requires less amount of bits for successful identification than dynamic framed slotted ALOHA (DFSA) protocol, and that it even outperforms the conventional CS-ID protocol with perfect channel information.

show abstract

Section: Selection Of Pmentioning

confidence: 99%