Method for the efficient reading of a population of radio frequency identification tags with unique identification numbers over a noisy air channel

• US 7,068,148 B2
• Filed: 10/20/2003
• Issued: 06/27/2006
• Est. Priority Date: 10/18/2002
• Status: Active Grant

• Current Assignee: Symbol Technologies, LLC (Zebra Technologies Corporation)
• Original Assignee: Symbol Technologies, Inc. (Zebra Technologies Corporation)
• Inventors: Shanks, Wayne, Arnold, Jens
• Primary Examiner(s): Zimmerman, Brian
• Assistant Examiner(s): YANG, CLARA I
• Application Number:
  US10/687,690
• Publication Number:
  US 20040135674A1
• Time in Patent Office: 981 Days
• Field of Search: 340/10.1, 340/10.2, 340/10.31, 340/10.4, 340/10.42, 340/10.5
• US Class Current: 340/10.1
• CPC Class Codes: G06K 7/0008 General problems related to the reading of electronic memory record carriers, independent of its reading method, e.g. power transfer
• CPC Class Codes: G06K 7/10049 binary tree

Abstract

A method for reading and tracking radio frequency identification (RFID) tags in the presence of a noisy air channel is provided. In accordance with the method, a binary tree data structure is used to characterize a plurality of RFID tags, each of which is associated with a unique identification (ID) number. During communication between a tag reader and one or more RFID tags, the tag reader traverses the binary tree, eliminating tags from communication until one tag with a unique ID number is isolated and verified. As the binary tree is traversed, counters associated with each node in the tree are incremented based on tag matches, such that, over time, counters associated with nodes in tag-populated branches will tend to have a high value and counters associated with nodes in unpopulated tree branches will tend to have low values. Where the read process is subject to noise and the tag reader is forced make a decision at a branching node, the tag reader makes a branch prediction based on the current value of the node counters associated with each of the possible alternative branches.

Claims

1. A method for communicating with a plurality of radio frequency identification (RFID) tags, comprising:

(a) receiving at least one symbol from the plurality of RFID tags for a first node in a binary tree having a plurality of nodes wherein each node in said binary tree is associated with a counter;

(b) incrementing the counter associated with the first node in said binary tree when the at least one symbol received from said plurality of RFID tags matches a logical value associated with the counter;

(c) decrementing the counter associated with the first node in said binary tree when the at least one symbol received from said plurality of RFID tags does not match the logical value associated with the counter; and

(d) selecting a second node in said binary tree based on a value of the counter associated with the first node in said binary tree.

2. A method in a radio frequency identification (RFID) reader for interrogating a population of tags using binary tree traversal protocol, comprising the steps of:

(a) entering a logical node in a binary tree;

(b) transmitting a symbol to the population of tags;

(c) determining if at least one symbol is received from the population of tags;

(d) if it is determined in step (c) that at least one symbol has been received, determining whether one symbol received from the population of tags corresponds to a first logical value;

(e) if it is determined in step (d) that one symbol received corresponds to a first logical value, incrementing a node counter value associated with the first logical value;

(f) if it is determined in step (d) that one symbol received does not correspond to a first logical value, decrementing the node counter value associated with the first logical value;

(g) if it is determined in step (c) that at least one symbol has been received, determining whether one symbol received from the population of tags corresponds to a second logical value;

(h) if it is determined in step (g) that one symbol received corresponds to a second logical value, incrementing a node counter value associated with the second logical value;

(i) if it is determined in step (g) that one symbol received does not correspond to a first logical value, decrementing the node counter value associated with the second logical value;

(j) selecting which logical value to store as a bit of a tag bit pattern;

(k) storing the selected logical value as the bit of the tag bit pattern;

(l) determining whether the bit pattern is complete; and

(m) if the bit pattern is not complete;

proceeding to step (a).

3. The method of claim 2 wherein step (j) includes the steps of:

determining whether one symbol received from the population of tags corresponds to a first logical value and a second symbol received from the population of tags corresponds to a second logical value;

determining whether either symbol was likely caused by noise; and

if it is determined it is likely that one received symbol was caused by noise, selecting the logical value associated with the other received symbol as the bit of the tag bit pattern.

4. The method of claim 3 wherein the step of determining the likelihood that either received symbol was caused by noise comprises:

evaluating the counter value associated with the first logical value and the counter value associated with the second logical value.

5. The method of claim 4 further comprising the step of:

if it is determined in step (c) that at least one symbol has been received from the population of tags, incrementing a node activity register value.

6. The method of claim 5 wherein the step of determining the likelihood that either received symbol was caused by noise further comprises:

retrieving the activity register; and

evaluating the value of the activity register.

7. The method of claim 2 wherein step (j) includes the steps of:

determining whether one symbol received from the population of tags corresponds to a first logical value and a second symbol received from the population of tags corresponds to a second logical value;

determining whether either received symbol was likely generated by a weak tag; and

if it is likely that one received symbol was generated by a weak tag, selecting the logical value associated with the one received symbol as the bit of the tag bit pattern.

8. The method of claim 7 wherein the step of determining the likelihood that either received symbol was caused by noise comprises:

evaluating the counter value associated with the first logical value and the counter value associated with the second logical value.

9. The method of claim 8 further comprising the step of:

if it is determined in step (c) that at least one symbol has been received from the population of tags, incrementing a node activity register value.

10. The method of claim 9 wherein the step of determining the likelihood that either received symbol was caused by noise further comprises:

retrieving an activity register; and

evaluating the value of the activity register.

11. The method of claim 2 wherein the tag bit pattern contains a tag identification number.

12. The method of claim 11 further comprising:

if it is determined in step (1) that the tag bit pattern is complete, determining whether the stored bit pattern contains a valid tag identification number.

13. The method of claim 12 wherein each bit in the tag bit pattern corresponds to a logical node in the binary tree.

14. The method of claim 13 further comprising:

if the bit pattern does not contain a valid tag identification number, decrementing the node counters for the logical nodes corresponding to each bit in the tag bit pattern.

15. The method of claim 14 wherein the error detection code value is a cyclic redundancy code value.

16. The method of claim 2 further comprising:

if it is determined in step (c) that at least one symbol has not been received, decrementing the node counter corresponding to the last stored bit in the bit pattern.

17. The method of claim 2 wherein the first logical value is a data “

0” and

the second logical value is a data “

1.”

18. A method in a radio frequency identification (RFID) reader for interrogating a population of tags using binary tree traversal protocol, comprising the steps of:

(a) entering a logical node in a binary tree;

(b) transmitting a symbol to the population of tags;

(c) determining if at least one symbol is received from the population of tags;

(d) if it is determined in step (c) that at least one symbol has been received, adjusting traversal count information stored for the logical node based on the received at least one symbol;

(e) selecting which logical value to store as a bit of a tag bit pattern;

(f) storing the selected logical value as the bit of the tag bit pattern;

(g) determining whether the bit pattern is complete; and

(h) if the bit pattern is not complete;

proceeding to step (a).

19. A method in a radio frequency identification (RFIID) reader for interrogating a population of tags using binary tree traversal protocol. comprising the steps of:

(a) entering a logical node in a binary tree;

(b) transmitting a symbol to the population of tags;

(c) determining if at least one symbol is received from the population of tags;

(d) if it is determined in step (c) that at least one symbol has been received, adjusting information stored for the logical node , wherein step (d) comprises;

(i) it is determined in step (c) that at least one symbol has been received, determining whether the at least one symbol received from the population of tags corresponds to a first logical value;

(ii) if it is determined in step (d)(i) that the at least one symbol received corresponds to the first logical value, incrementing a node counter value associated with the first logical value;

(iii) if it is determined in step (d)(i) that the at least one symbol received does not correspond to the first logical value, decrementing the node counter value associated with the first logical value;

(iv) if it is determined in step (c) that at least one symbol has been received, determining whether the at least one symbol received from the population of tags corresponds to a second logical value;

(v) if it is determined in step (d)(iv) that the at least one symbol received corresponds to the second logical value, incrementing a node counter value associated with the second logical value; and

(vi) if it is determined in step (d)(v) that the at least one symbol received does not correspond to the second logical value, decrementing the node counter value associated with the second logical value

(e) selecting which logical value to store as a bit of a tag bit pattern;

(f) storing the selected logical value as the bit of the tag bit pattern;

(g) determining whether the bit pattern is complete; and

(h) if the bit pattern is not complete;

proceeding to step (a).

20. The method of claim 19 wherein step (d) further comprises the step of:

if it is determined in step (c) that at least one symbol has been received from the population of tags, incrementing a node activity register value.

21. A method in a radio frequency identification (RFID) reader for interrogating a population of tags using a binary tree traversal protocol, comprising the steps of:

reading a tag identification bit pattern as a result of a binary tree traversal interrogation of a tag in the population of tags;

receiving an error detection code from the tag;

identifying one or more bit positions in the read tag identification bit pattern potentially corrupted by noise;

identifying potential bit patterns having alternate bit values in one or more of the identified bit positions;

calculating an error detection code value for the accumulated tag identification bit pattern;

calculating an error detection code value for each identified potential bit pattern; and

determining whether any of the calculate error detection code values matches the received error detection code.

22. A method in a radio frequency identification (REID) reader for interrogating a population of tags using binary tree traversal protocol, comprising the steps of:

storing data related to the tag population, wherein the tag population data includes node weighting information for each populated node in a binary tree;

during binary tree traversal, determining a traversal path based on the tag population data.

23. The method of claim 22 where the node weighing information includes:

a first stored counter value associated with a first logical bit value, and

a second stored counter value associated with a second logical bit value;

where step (1) comprises storing the first stored counter value and the second stored counter value for each population node.

24. The method of claim 22 further comprising:

obtaining at least some of the tag population data from a device external to the reader.

25. The method of claim 24 wherein the at least some of the tag population data is obtained from a second reader.

26. The method of claim 25 wherein the at least some of the tag population data is obtained from a database.