Massive Connectivity with Hard-decision Envelope Detection and Bloom Filter Based Coding

Massive connectivity demands cheap hardware and low computational complexity. We propose a scheme without need of channel state information (CSI) or multiple antennas, in which users transmit messages encoded by Bloom filter with On-Off Keying (OOK) modulation, and base station (BS) performs hard-decision envelope detection on received signals. For scenarios with inter-user synchronization (IUS), a Noisy-Combinatorial Orthogonal Matching Pursuit (NCOMP) decoding strategy is applied, and for scenarios without IUS, a sliding window strategy is proposed to modify the NCOMP decoding strategy. Based on a many-access model, we study the theoretical performance of our scheme for activity recognition and message transmission problems. Theoretical analysis guarantees that the error probability of our scheme vanishes asymptotically with the number of users, and this trend is verified by numerical experiments for finite number of users.