摘要:
A binary tree method for avoiding collision of multiple tags, comprising: during inventorying tags, a reader sending a re-splitting instruction to the tags and entering a next time slot for reception if the reader does not receive any reply information from the tags in a specified time slot and one of the following conditions is satisfied: the reader received incorrect reply information from the tags in the former time slot, or a re-splitting instruction was sent in the former time slot; and when the tags receive the re-splitting instruction, for tags whose counter values are not 1, the counter values remaining unchanged, and tags whose counter values are 1 splitting into two subsets 0 and 1, and those counter-0 tags replying to the reader. With the present invention, the inventorying flow of Binary Tree is optimized, the inventorying efficiency is improved, and the whole flow becomes more reasonable.
摘要:
A query tree based tag identification method in RFID systems includes: (a) forming a temporary ID for each of the tags; (b) comparing an inquiry of the reader with a portion of the temporary ID in each tag when receiving the inquiry from the reader; (c) if the inquiry and the portion of the temporary ID are identical to each other, transmitting a remainder of the temporary ID in each tag to the reader; (d) if a collision occurs in the step (c), generating new inquiries for storing them in the reader; (e) if there is no collision in the step (c), transmitting an ACK signal to each tag whose temporary ID is identified to receive its real tag ID therefrom; and (f) repeating the steps (b) to (e) until there is no inquiry in the reader.
摘要:
Systems and methods for efficiently querying and identifying multiple items on a communication channel are disclosed. The invention is well suited to use with radio frequency identification with interrogation devices and systems that identify radio frequency identification transponders. A depth-first tree traversal protocol algorithm, including commands and symbols, is used to more efficiently interrogate a plurality of transponders in a short amount of time.
摘要:
There is provided an interrogator, transponder, and transponder identification method, which shorten processing time for identification. An interrogator that makes wireless communication with a transponder, comprising: a temporary number specify section that transmits a request for transmission of a unit bit string as a bit string having a predetermined length in a bit string expressing a temporary number owned by the transponder, receives a unit bit sting transmitted from the transponder in response to the request, and specifies the temporary number of the transponder, based on the unit bit string; and an identification information obtaining section that transmits, if a temporary number of a transponder is specified by the temporary number specify section, a request for transmission of identification information of the transponder to the transponder, and receives the identification information transmitted from the transponder, in response to the request.
摘要:
The invention concerns a method for reading a set of electronic labels, each comprising a distinct identification code of N bits and situated in the electromagnetic field of an interrogator device, characterized in that it comprises the following steps: a) for each given code of N bits, defining an elementary analysis block comprising m bits, where m is a sub-unit of N, b) analyzing the code of each label by scrolling through this code, block of m bits by block of m bits, c) and, for a given label, generating a serial number representing the number of labels identified before this label in such a way that the interrogator knows at any moment the number of labels present in the electromagnetic field, d) establishing a cross reference table between the serial numbers generated and the values of the identification codes of each label.
摘要:
A process is disclosed for communicating with individual tags in a population of tags having a binary tree organization, wherein each tag corresponds to a leaf node of the binary tree. The process includes singulating a predetermined leaf node and returning to a designated re-entry node associated with the predetermined leaf node after singulating.
摘要:
A radio frequency identification tag is disclosed that is configured to transmit a signal modulated with one of more than two different subcarrier modulation frequencies such that the signal represents more than one binary bit as a single symbol.
摘要:
Known methods for the selection of transponders require a large time duration, because in this context the data transmitted according to the half-duplex principle. With the new method, the transponders can be identified with a small time expenditure through the transmission of the time duration of a reference interval, because the data are transmitted in the full-duplex principle.
摘要:
In a method for selecting, by a base station, one or more transponders out of a plurality of transponders, selection steps are performed at least at two selection levels or stages. The base station controls all selection steps at the first and second level. The first selection level includes: each transponder generates a random transponder number, the base station generates numbered time slots, each transponder transmits a marker if and when its random transponder number coincides with a time slot number. When a single transponder random number coincides with a time slot number the respective transponder is selected by the base station. If more than one transponder random numbers coincide with a time slot number the second selection procedure is performed at a second selection level as a stochastic or a deterministic or a mixed stochastic-deterministic selection procedure.
摘要:
One or more transponders are selected by a base station out of a plurality of transponders. For this purpose an identification bit sequence (IB) that is or includes a random number bit sequence (ZB) is made available in the respective transponder and the base station transmits in a bit-by-bit fashion a selection bit sequence (AB) to the transponders. These sequences (IB or ZB) and (AB) are compared bit-by-bit in the respective transponder. The comparing is performed by way of a predeterminable comparing criterion to provide a comparing result in the form of a selection bit to which a bit value is assigned. The selection is then made depending on the bit value of the selection bit of the respective transponder.