Fig. 5
From: Exploiting joint sparsity in compressed sensing-based RFID
Support estimation (variable SNR). Plotted are the number of correct detections (CD) and false alarms (FA) in the estimated set of assigned signatures \(\widehat {\mathcal {T}}_{\text {A}}\) over variable SNR. K 0 is the assumed number of tags to initialize the BASSAMP algorithm with. Assuming a K 0 that is much larger or smaller than the original K affects the outcome of the support detection only marginally. With an increasing number of receive antennas N R , the support estimation becomes more robust. The light grey curves show the legacy approach used in [12–14] that assumes to know K; there, the indices of the K largest entries in the AMP recovery compose \(\widehat {\mathcal {T}}_{\mathrm {A}}\)