Identifying RFID categories
View Patent ↗The set T of all categories in a population of RFID tags is estimated within a specified error bound. For each of one or more frames, a reader broadcasts a probability p, a multiplicity d, a frame size M, and a seed value R to the present tags. A deterministic algorithm on each tag, and known to the reader, calculates (i) whether the tag will transmit in this frame, and, if so, (ii) in which slots the tag will transmit a single “1.” When the tags have responded, the reader calculates set T by initially assuming that all possible categories are in set T and then eliminating those categories that would have transmitted in those slots in which no tag transmitted. Alternatively, the reader initially assumes that set T is empty, and adds those categories that would have transmitted in those slots in which one or more tags did transmit.
1. A tag for an RFID system, the tag comprising:
a memory adapted to store a tag identification (ID) value for the tag, the tag ID value comprising (i) a category ID value shared with at least one other tag and selected from one of a plurality of predetermined values corresponding to different categories of RFID tags and (ii) an instance value;
an antenna adapted to receive a downlink signal from a reader and transmit an uplink signal to the reader; and
a processor adapted to process the downlink signal and generate the uplink signal, wherein:
the processor is adapted to select at least one slot in a multi-slot frame based on the stored category ID value, but independent of the stored instance value; and
the tag is adapted to transmit the uplink signal in the at least one selected slot in the multi-slot frame.
2. The invention of claim 1 , wherein:
the processor is adapted to select at least one slot in the multi-slot frame; and
the tag is adapted to transmit the uplink signal in each of the at least one selected slot in the multi-slot frame.
3. The invention of claim 2 , wherein:
the downlink signal comprises a multiplicity value indicating a number of slots; and
the processor is adapted to select the at least one slot based on the multiplicity value.
4. The invention of claim 1 , wherein:
the downlink signal comprises a probability value; and
the processor is adapted to determine whether or not to transmit the uplink signal in the multi-slot frame based on the probability value.
5. The invention of claim 1 , wherein the uplink signal corresponds to a single bit value.
6. The invention of claim 1 , wherein:
the processor is adapted to select at least one slot in the multi-slot frame;
the tag is adapted to transmit the uplink signal in each of the at least one selected slot in the multi-slot frame;
the downlink signal comprises a multiplicity value indicating a number of slots;
the processor is adapted to select the at least one slot based on the multiplicity value;
the downlink signal comprises a probability value;
the processor is adapted to determine whether or not to transmit the uplink signal in the multi-slot frame based on the probability value; and
the uplink signal corresponds to a single bit value.
7. A tag for an RFID system, the tag comprising:
a memory adapted to store a tag identification (ID) value for the tag, the tag ID value comprising (i) a category ID value shared with at least one other tag and selected from one of a plurality of predetermined values corresponding to different categories of RFID tags and (ii) an instance value;
an antenna adapted to receive a downlink signal from a reader and transmit an uplink signal to the reader; and
a processor adapted to process the downlink signal and generate the uplink signal, wherein:
the processor is adapted to select at least one slot in a multi-slot frame; and
the tag is adapted to transmit the uplink signal in each of the at least one selected slots in the multi-slot frame, wherein:
the downlink signal comprises a multiplicity value indicating a number of slots; and
the processor is adapted to select the at least one slot based on the multiplicity value.
8. The invention of claim 7 , wherein:
the downlink signal comprises a probability value; and
the processor is adapted to determine whether or not to transmit the uplink signal in the multi-slot frame based on the probability value.
9. The invention of claim 7 , wherein the uplink signal corresponds to a single bit value.
10. A tag for an RFID system, the tag comprising:
a memory adapted to store a tag identification (ID) value for the tag, the tag ID value comprising (i) a category ID value shared with at least one other tag and selected from one of a plurality of predetermined values corresponding to different categories of RFID tags and (ii) an instance value;
an antenna adapted to receive a downlink signal from a reader and transmit an uplink signal to the reader; and
a processor adapted to process the downlink signal and generate the uplink signal, wherein the uplink signal corresponds to a single bit value, wherein:
the downlink signal comprises a probability value; and
the processor is adapted to determine whether or not to transmit the uplink signal in a multi-slot frame based on the probability value.
11. A reader for an RFID system, the reader comprising:
a processor adapted to generate a downlink signal;
an antenna adapted to transmit the downlink signal to one or more tags and receive one or more uplink signals from the one or more tags, wherein:
one or more uplink signals comprises a tag ID value comprising (i) a category ID value shared by at least two tags and selected from one of a plurality of predetermined values corresponding to different categories of RFID tags and (ii) an instance value; and
the processor is further adapted to process the one or more uplink signals to estimate the one or more categories without identifying any of the one or more tags.
12. The invention of claim 11 , wherein each uplink signal corresponds to a single bit value.
13. The invention of claim 11 , wherein:
the processor has knowledge of an association between one or more category ID values and one or more respective slots receiving an uplink signal in a multi-slot frame, but independent of the tag's instance value; and
the processor is adapted to estimate the one or more categories based on knowledge of which slots in the multi-slot frame have at least one uplink signal and which slots in the multi-slot frame have no uplink signal.
14. The invention of claim 13 , wherein the processor estimates the one or more categories by implementing a category-elimination algorithm in which (1) for each multi-slot frame in an interrogation, the processor (a) initially assumes that the one or more tags correspond to all categories that can transmit in the multi-slot frame and (b) then eliminates categories corresponding to slots in the multi-slot frame having no uplink signal to generate a set of present categories for the multi-slot frame, and (2) if there are two or more multi-slot frames, then the processor performs a union of all the sets of present categories for each frame.
15. The invention of claim 13 , wherein the processor estimates the one or more categories by implementing a category-inclusion algorithm in which the processor (1) initially assumes that the one or more tags correspond to no categories and (2) then includes categories corresponding to slots in the multi-slot frame having at least one uplink signal.