抄録
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.
