← Back to Patent Explorer
EP0702324A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

Multiple item radio frequency tag identification protocol

Assignee: International Business Machines Corp
•
Filing: 1995-08-11
•
Granted: —
•
Expires: 2015-08-11
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The present invention uses a novel adaptation of a tree splitting algorithm applied to Radio Frequency (RF) tagging technology to identify many tags in the RF field of a base station. The invention uses the tree splitting algorithm to identify a single tag in a field of a plurality of radio frequency tags. Once the single tag is identified, the identified tag is placed in a Data_Exchange state where the base station can access data from the tag memory by using information that identifies the tag.

Inventors

  • 👤 Shun Sing Chan
  • 👤 Harley Kent Heinrich
  • 👤 Dilip Dinkar Kandlur
  • 👤 Arvind Krishna

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-05 05:23
CPC Classifications
H; H04; H04W; H04W88/00; H04W88/02; G; G06; G06K; G06K7/00; G06K7/10; G06K7/10009; G06K7/10019; G06K7/10029; G06K7/10039; G06K17/00; G06K7/0008; H04B; H04B5/00; H04B5/40; H04B5/48

Claims Analysis

Total Claims: 15
Claim 1
Independent Claim 153 words
A radio frequency tag for communicating with a base station, comprising: a. an antenna and tag radio frequency circuit for sending and receiving radio frequency signals to and from the base station; b. a tag memory for storing tag data; c. a tag logic circuit connected to the tag radio frequency circuit and the tag memory, the tag logic circuit having a tag state register that indicates the tag is in a state that is one of the states including READY, ID, and Data Exchange, the tag logic further having a state counter and a random number generator; and d. a tag algorithm, run by the tag logic, that places the tag in the READY state by setting the state register to READY when the tag is powered and places the tag in the ID state by setting the state register to ID when the base station sends the tag an identification command.
Claim 2
Dependent Claim 33 words
A tag, as in claim 1, where the identification command is aGroup_select command and the tag transmits a command response back to the base station while the tag is in the ID state.
Claim 3
Dependent Claim 14 words
A tag, as in claim 2, where the command response is tag identification information.
Claim 4
Dependent Claim 104 words
A tag, as in claim 3, where the tag receives a Fail command from the base station that causes the tag algorithm to increase a state counter value in the state counter if: a. the state counter has a value not equal to a predetermined value, or b. the state counter has a value equal to the predetermined value and the random number generator has a given value, whereby the tag stops transmitting the tag identification information while the state counter value is not equal to the predetermined value and the tag algorithm causes the random number generator to generate a new random value.
Claim 5
Dependent Claim 28 words
A tag, as in claim 4, where the tag receives a Resend command from the base station that causes the tag algorithm to decrease the state counter value.
Claim 6
Dependent Claim 26 words
A tag, as in claim 5, where the tag starts sending the tag identification information when the state counter value is equal to a predetermined value.
Claim 7
Dependent Claim 54 words
A tag, as in claim 6, where the base station sends the tag a READ command and the tag algorithm places the tag in the Data_Exchange state whereby the base station can sent one or more application commands to the tag by identifying the tag with the identification information sent to the base station.
Claim 8
Dependent Claim 34 words
A tag, as in claim 5, where the Fail command causes the tag algorithm to decrease the state counter value and the Resend command causes the tag algorithm to increase the state counter value.
Claim 9
Dependent Claim 18 words
A tag, as in claim 5, where the predetermined value is zero and the given value is zero.
Claim 10
Dependent Claim 59 words
A tag, as in claim 5, where the algorithm increases the state counter by one for each Fail command sent and decrements the state counter by one for each Resend command sent whereby the base station has read the identification information from every tag in a field of tags when the number of Fail and Resend commands are equal.
Claim 11
Dependent Claim 32 words
A tag, as in claim 5, where the tag algorithm resets the value in the state counter to the predetermined value when the tag receives a Group_select command from the base station.
Claim 12
Dependent Claim 35 words
A tag, as in claim 1, where the tag algorithm places the tag in the READY state by resetting the state register to READY when the tag receives a Group_unselect command from the base station.
Claim 13
Dependent Claim 40 words
A tag, as in claim 1, where the tag is placed in the Data_Exchange state by setting the state register to Data_Exchange when the tag receives a READ command from the base station whereby the tag sends back an acknowledgement.
Claim 14
Independent Claim 387 words
A system for reading information from a plurality of radio frequency tags that are in the field of a radio frequency signal sent by a base station, comprising: i. a tag, further comprising: a. an antenna and tag radio frequency circuit for sending and receiving radio frequency signals to and from the base station; b. a tag memory for storing tag data; c. a tag logic circuit connected to the tag radio frequency circuit and the tag memory, the tag logic circuit having a tag state register that indicates the tag is in a state that is one of the states including READY, ID, and Data Exchange, the tag logic further having a state counter and a random number generator; and d. a tag algorithm, run by the tag logic; ii. a base station that is able to transmit information commands to the field of tags, the information commands including a Group_select, a Group_unselect, a Fail, and a Resend command, a. the Group_select command causing the tag algorithm to place one or more selected tags in the ID state by causing each selected tag algorithm to set its respective state register to ID and reset its respective state counter to a predetermined value, b. the Group_unselect command causing the tag algorithm to place one or more unselected tags in the ID state to the READY state; c. the Fail command being generated by the base station when more than one tag sends tag identification information to the base station simultaneously, the Fail command causing the algorithm of each selected tag to increment its respective state counter if: 1) the state counter has a value not equal to a predetermined value, or 2) the state counter has a value equal to the predetermined value and the random number generator has a given value, d. the Resend command sent by the base station when tag identification information is sent back to the base station in response to a READ command by a single tag in the field, the Resend command causing the state counter of all the tags in the field to decrement, whereby the base station can identify an individual tag in the field of tags, and cause the identified tag to go into a Data_Exchange state where the base station can access information from the tag memory.
Claim 15
Independent Claim 255 words
A method, for reading a radio frequency identification tag in a radio frequency field of a plurality of tags comprising the steps of: a. sending a group_select command from a base station that places one or more selected tags in the field in a ID state; b. sending identification information from all the selected tags to the base station; c. sending a fail command from the base station if more than one tag sends identification information simultaneously; d. increasing a state counter value in the state counter of one or more selected tags if: 1) the state counter has a value not equal to a predetermined value, or 2) the state counter has a value equal to the predetermined value and the random number generator has a given value, the tag stopping transmission of the tag identification information while the state counter value is not equal to the predetermined value and the tag algorithm causing the random number generator to generate a new random value; e. sending identification information a next time from all the selected tags to the base station, the selected tags having a state counter value equal to the predetermined value; f. repeating steps c - e until a sole tag is sending identification information to the base station; g. issuing a READ command to the sole tag using the identification information of the sole tag; and h. placing the sole tag in a Data_exchange state where the base station can access data from the sole tag memory by using application commands.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag