TWI228683B - Methods and apparatuses for identification - Google Patents

Abstract

An identification system includes a reader and one or more tags. The reader identifies tags such as radio frequency (RF) tags. The system divides a number space into n bins, wherein each bin is associated with m unique bits of the number space, and the number space contains the identification codes of the tags. A command is issued to test v bits of the number space. A response is received from a tag, wherein the response occurs when a first portion of an identification code of the tag matches the v bits of the number space, a timing of the response corresponds to a particular bin and m unique bits associated with the particular bin correspond to a second portion of the identification code.

Description

1228683 玖 发明, description of the invention (the description of the invention should state: the technical field, prior art, content, implementation, and drawings of the invention are briefly explained) Related applications Cross reference This application is filed on October 9, 2001 The co-pending U.S. provisional patent case number 06 / 328,360, entitled "Method and Apparatusses for Identification", has the benefit of filing an application that can claim 35 USC § 119 (e). FIELD OF THE INVENTION The present invention relates to the field of identification, and further to methods and devices for identifying labels. Background Art I hope to interrogate several wireless tags by transmitting codes through an interrogation transmitter and allowing the responding tags to transmit information. A common implementation is for the tag to listen to the interrogation message and respond with a unique serial number and / or other information. However, I hope to expand the range of wireless tags so that it is not necessary to get each tag close to the reader used for reading. When expanding the range of a reading system, two problems usually occur. One problem is that the power available to transmit from the wireless tag is limited, so if the range is very large, it is likely that multiple tags will fall within the range of the interrogation system, and the answer between each other will be Destroy each other. At present, the implementation of radio frequency (RF) tags require a lot of logic to solve the interface agreement and anti-collision problems. These problems will occur when several tags falling within the range of the reader are trying to answer the interrogation information. For example, the integrated circuits currently used in RF tags each require approximately 3,000 logic gates to handle interface protocols and anti-collision protocols. The large amount of space required by the integrated circuit will be 1228683 _ m Invention Description Continued This adds to the cost of the RF tag and thus makes this tag unsuitable for general use. U.S. Patent Nos. 5,266,925, 5,883,582, and 6,072,801 describe previous techniques for avoiding collisions when reading several RF tags. However, when reading several RF tags, these prior art methods provide inefficient collision avoidance solutions. SUMMARY OF THE INVENTION According to an aspect of the present invention, there is provided a method implemented by a reader to recognize a tag, wherein the tag has an identification code. The method includes transmitting data to the tag; and receiving at least one response to transmit the data, wherein the timing position of the response is consistent with the first part of the tag's identification code. The response includes the first part of the tag's identification code. In other perspectives, a method implemented by a tag is provided, which includes receiving a first piece of data from a reader; associating the first piece of data with the first part of the tag's identification code; and, if If the first data matches the first part of the identification code of the tag, a response is transmitted to the reader. The timing position associated with the transmission will coincide with the first part of the tag's identification code. The response transmitted to the reader includes the first part of the tag's identification code. Brief Description of the Drawings The present invention will be explained by way of example, but it is not limited to the accompanying drawings in which the same element symbols represent the same elements. The identification system shown in FIG. 1 includes a reader and a plurality of radio frequency (RF) tags. A specific embodiment of the RF tag used with the present invention shown in FIG. 2A is 1228683 _ Description of the Invention Continued Example. An associated circuit shown in FIG. 2B can be used in a specific embodiment of an RF tag according to the present invention. Fig. 3 is a flowchart showing an exemplary method of a reader according to the present invention. The system shown in FIG. 4 divides the response of a tag group into n bits. Figure 5 shows a basic command architecture. Figure 6 shows a scrolling answer of a tag (80 bits in total). The response cycle shown in Figure 7 is the response cycle of the reader. The reader modifies the response bit. The tag transmission response of the tag 3 (Table 5) shown in FIG. 8. The system shown in Figure 9 is represented by the first three least significant bits (LSBs) of the binary tree. The backscatter modulation shown in Fig. 10 during the response interval of the exemplary transmission (Query 1). The query tree shown in FIG. 11 is for two signaling commands. The backscatter modulation shown in Fig. 12 during the response interval of the exemplary transmission (Query 2). The reader-to-tag modulation shown in FIG. 13. The system shown in FIG. 14 has a basic cycle and a clock timing interval, and data "0" and data "1". The tag-to-reader bit-grid coding shown in Figure 15 and the 8-bit tag-to-reader transmission (inverted). The two labels shown in FIG. 16 are the same clock frequency (one bit difference) 1228683 _ μ, the contention of the continuation page of the invention description, and two labels with a clock frequency difference of 50% and a bit difference. Scramble. The collision-free anti-collision reader shown in FIG. 17. An anti-collision reader with a collision shown in FIG. 18. The silent interval shown in FIG. 19. A specific embodiment of the memory mapping of the tag memory shown in Figs. 20A and 20B. Detailed description of the preferred embodiments In the following detailed description of the specific embodiments of the present invention, reference will be made to the accompanying drawings (where the same element symbols represent the same elements). Examples to show. The description of these specific embodiments is quite detailed so that those skilled in the art can practice the invention. Therefore, the following detailed description does not make any limitation, and at the same time, the scope of the present invention is only defined by the scope of the accompanying patent application. An example of an identification system 10 shown in FIG. 1 includes a reader 12 and a plurality of tags 18, 19, and 20. This system is usually a reader-first conversational RF ID system that uses a passive or semi-passive active backscatter interrogator as a tag. To facilitate a longer read range, its extended feature is the incorporation of batteries and / or memory into the tag; however, the use of batteries must be exchanged at some price, such as huge costs, limited life, large Shape, weight gain, and disposal conditions at the end of life. As such, tags 18, 19, and 20 may have memory and / or batteries, or may not have any of these components. It can be found that different types of tags may be mixed in a system, where the reader may interrogate tags with batteries as 1228683 _ Description of Continuation Sheet and tags without batteries. There are at least four types of tags that can be used in the present invention: (1) a tag without power, which can only obtain power from the tag's antenna, and the tag includes a read-only memory with an identification code for the tag; (2) A tag without internal power, but when the reader is powered, it can write data into the tag's non-volatile memory. This type of tag also includes memory to store the identification code; (3 ) Tags with a small battery that can provide power to the circuits in the tag (such tags also include non-volatile memory and memory used to store the tag ’s identification code); and (4) can be used with other tags Or other component communication labels. A specific embodiment of the reader shown in FIG. 1. The reader 12 typically includes a receiver 14 and a transmitter 16, each of which is coupled to a 1/0 (input / output) controller 21. The receiver 14 may have its own antenna 14a, and the transmitter 16 may have its own antenna 16a. According to this disclosure, those skilled in the art will find that under the premise of having a receiving / transmitting switch, the transmitter 16 and the receiver 14 can share the same antenna. The switch controls the signals in the antenna and will The receiver and transmitter are isolated from each other. The receiver 14 and transmitter 16 may be the same as the conventional receiver and transmitter unit found in current readers. In one embodiment, the receiver and transmitter are typically capable of operating in a frequency range of approximately 900 megahertz (North American region). Both the receiver and the transmitter are coupled to the I / O controller 21, which can control data received by the receiver and data transmitted by the transmitter 16, such as commands. The I / O controller is coupled to a bus 22, which in turn is coupled to a micro 1228683 _ Description of the Invention Continued page Processor 23 and memory 24. The processing system represented by the elements 21, 22, 23, and 24 in the reader 12 can be implemented in various ways. One way to achieve this is that the microprocessor 23 is a programmable microcontroller, such as an 8051 microcontroller or other well-known microcontroller or microprocessor (such as a PowerPC microprocessor). In one implementation manner, the memory 24 includes a dynamic random access memory and a memory controller for controlling the operation of the memory. The memory 24 may also include non-volatile read-only memory for storing data and software programs. The memory 24 usually contains a program for controlling the operation of the microprocessor 23; and contains data used during tag processing and tag interrogation. In a specific embodiment described further below, the memory 24 generally includes a computer program that allows the microprocessor 23 to transmit search commands to the transmitter through the I / O controller 21, and through the receiver 14 and The I / O controller 21 receives a response from the tags. The memory 24 may further include a binary tree-like data structure (such as the binary tree shown in FIGS. 4, 9 and 11), in which the tree or a part thereof is generated due to a special search algorithm. . A special search algorithm will be further described later. The reader 12 may also include a network interface, such as an Ethernet interface, which allows the reader to communicate with other processing systems via the network. The network interface is typically coupled to the bus 22 so that it can receive data, such as a list of tags identified in the interrogation from the microprocessor 23 or from the memory 24. An example implementation of a tag used with the present invention is shown in FIG. 2A. The tag 30 includes an antenna 3 1 coupled to a transmission / reception (TR) switch 33. This switch is coupled to the receiver and the demodulator 35, and is coupled to the transmitter -11-1228683 Description of the Invention Continued (7) Transmitter 39. The correlator and controller unit 37 is also coupled to the receiver and demodulator 35 and to the transmitter 39. The specific example of the tag in FIG. 2A can be used in various specific embodiments, in which memory is retained in the tag so as to retain data between commands; and in which the association processing is performed bit by bit in the tag. This association process can respond to the command executed by the tag to perform the "match" operation described later. The receiver and demodulator 35 receive signals via the antenna 31 and the switcher 33, and demodulate the signals so as to provide the signals to the correlator and controller unit 37. The command received by the receiver 35 is delivered to the controller of the unit 37 to control the operation of the tag. The data received by the receiver 35 will be delivered to the controller unit 37, and in a specific embodiment described later, this data may be processed in association with the identification code of the tag. Under the control of the controller unit 37, the transmitter 39 transmits a response or other data to the reader via the switch 33 and the antenna 31. According to this disclosure, those skilled in the art may find that the transmitter may only be a switch or other element that modulates the reflection from an antenna (such as antenna 31). The system shown in FIG. 2B is a specific embodiment of an association system 50 that can be used in a tag (such as the tag shown in FIG. 2A). The association system will use a shift register to receive the tag memory; a register / down counter to receive the number of bits to be compared with the tag memory; and a register to capture the tag to be compared The bit value of. The tag then compares the bit value received by the reader with the bits in the tag's identification memory, one bit at a time (as it does from the reader). Such as -12-(8) 1228683 Continued description of the invention If all bits match, if not all bits match the reader. ’Then the tag will respond to the reader. If it is matched, then the label will not respond. Once back to FIG. 2B, the sequence ㈣52 is received from the reader. The library material 52 will be confirmed in the sequence data control block 54 by the ,,,, and Y commands. When the sequence data controls: # 码 成 each will send 1 command to the memory 5 = yuan ’then

Register 60. The memory controller 62 will access the number of bits specified in the temporary storage request number in the tag identification code ... For each memory access, the bit value received by the reader in the temporary memory device 60 and the bit value trivial from the memory will be calculated in Satoshi logic 63. Compare. The comparison output of X0R logic 63 is passed to J control logic 64. The matching control logic 64 confirms whether the v bits received by the reader in the VAL register 60 match the appropriate bits of the tag identification code stored in the dead tag identification memory 68. LEn is temporarily stored. ° / The LEN counter with a count of 58 will be continuously decremented, and the process will be ..... 'until all v bits have been measured in Formula 5, and the LEN counter will reach zero.

If all v bits match, the modulation control 70 will select a response bit according to the least significant bit (LSB) below the tag identification code. The modulation control 70 and the transmitting / receiving switch 33 (FIG. 2A) will modulate the z most significant J bits below (the two LSBs include the aforementioned m LSBs) and transmit them to the data 72 The reader. According to this disclosure, those who are familiar with this technology can find that the number of bits V sent by the reader is -13-1228683 _ / ΟΛ Description of the continuation page is general and may be the tag identification code At least part of it. Similarly, m and ζ represent the general number of bits. In the specific embodiments implemented in the following sections, m = 3 and z = 8, but the present invention is not limited to this. Similarly, as described in the following examples, the z bits may include m bits, but the present invention is not limited thereto. In another specific embodiment, the z bits that are modulated and transmitted to the reader may follow m bits that are used to select the response bit. In one embodiment of the present invention, the label can be manufactured through a process of jet self-assembly. For example, a plurality of other integrated circuits in a semiconductor wafer may be used to manufacture the integrated circuits. If necessary, in addition to the antenna 31 (FIG. 2A), the integrated circuit may include all necessary logic for a special RF tag. Therefore, all the logic in the tag 30 (Fig. 2A) may be contained in a single integrated circuit and manufactured using the same integrated circuit in a single semiconductor wafer. Each circuit can be programmed with a unique identification code, then the wafer is processed, and each integrated circuit is removed from the wafer to make a block suspended in a liquid. This liquid can then be dispersed in a substrate, such as a flexible substrate, and a separate RF tag can also be manufactured. The receiving area in the substrate will contain at least one integrated circuit, and then it can be connected to the antenna in the substrate to form an RF tag. An example of jet self-assembly is described in U.S. Patent No. 5,545,291. In other specific embodiments, after packaging into an RF tag, the identification code and other data can be programmed into the integrated circuit using RF energy or direct contact with the integrated circuit. An example of a method for operating a reader according to the present invention shown in FIG. 3 is 1228683 Description of the invention continued (10) Method 101 starts in operation 103, where the reading opportunity determines the availability of an open channel. In one specific embodiment, the reader monitors whether there is no tag backscatter modulation during a certain period of time. If there is no such backscatter modulation, the channel can be used. In another specific embodiment, the reader monitors whether there are no transmission signals from other readers to determine whether the channel is available. At this point, the reader may attempt to obtain any tags. For example, it may broadcast a signal to determine if any tags are present. If no tag is present, the reader will stand still and resume operation 103 at a later time. Conversely, if tags are present, then in operation 105, the reader performs an optional test to select which tags, if any, should be read. For example, the reader may broadcast a test code at different power levels. As a result of this test, a tag that fails to receive a complete and valid test code will not sound. In operation 107, the tag whose audible test code result is audible may be searched. Alternatively, other methods of confirming the integrity of the communication link between the reader and the tag may be used alone or in conjunction with the aforementioned test code method. For example, the reader may include error checking information when transmitting to the tag (or tags), such as parity bits or cyclic redundancy check (CRC) bits. In such cases, the tag evaluates the integrity of the error check information to facilitate subsequent responses. Therefore, tags that fail the error checking test will not break legitimate responses from other tags. Generally, a command (search command) can be received from the reader to search for the identity of the tag. When a match is generated, the reader can respond to these search commands in the way specified by the reader. . The order of the commands sent by the reader usually specifies a part of the tag memory to be compared to the data sent by the reader. In a typical embodiment of the present invention, usually only a data match in a tag can cause the tag to respond to a search command. When a data match is generated in the tag, the specific tag response is defined by the protocol and parameters sent to the tag in the order of the reader's command. Generally, the reader recognizes a unique tag through a series of reader commands and tag responses. When a special identification code is found in the tag, the reader can verify the identification code as appropriate. This verification operation involves performing a checksum of the identification code in the reader, and then transmitting the checksum to the tag, and having the tag perform the same check and operation, and verifying that it reaches the same checksum. When the tag does not reach the same checksum, an error signal is generated, keeping the tag itself silent and not responding, and allowing the reader to remove the tag's identification code from its list of recognized tags. Alternatively, other methods of verifying the code can be used. Operation 111 includes performing additional operations, such as reading other data from the tags or writing data to the tags. The identification system provided by the present invention can identify a single tag in the field of a reader. The anti-collision function is used to manage the reading of several tags in this reader field. The system manages errors due to RF interference and boundary tags. Compatibility can be maintained using a read / write system for each tag type. Communication layer Protocol overview System communication can follow a two-stage command answering mode, which is based on this 1228683 (12) Invention Description Continued The reader initiates a change (reader priority conversation, RTF). In the first phase, the reader uses continuous wave (CW) radio frequency (RF) energy to provide power to one or more passive or semi-passive tags. After the tag is opened, it will be in "Awake" state, ready to process commands. This reader uses the reader-to-tag encoding technology described below to transmit information to the field of the tag in an amplitude modulated manner. After the transmission is complete, the reader stops modulating and continues to transmit CW RF energy to provide power to the tags during the answer phase. During this period, the tag will cooperate with the bit-coding methods described below in Figures 15 and 16 through inductive coupling or backscatter modulation (depending on the frequency used by the transmitter in the reader). The reader communicates. Basic Command Format The Basic Command Format is adjustable and can be used with at least four of the aforementioned tags. In one embodiment, each low-value (VLC), single-chip tag has limited oscillator stability. In the basic command format, the reader provides a series of pulses to synchronize the tag's internal oscillator at the beginning of each transmission. After the answer from the tags is constructed, the reader can interpret the information transmitted by the tags as long as it is in the clock frequency that the tags can provide. During a change of at least eighty (80) bits, these readers are able to adapt to basic modulation rate differences and monotonic drift in the modulation rate. In one embodiment, the basic command may be designed to limit the amount of state information that the tags must store between transactions. The power available for passive tags is a complex function consisting of transmitted power, tag / reader antenna orientation, and area 1228683 Description of the Invention Continued (13) Environment and external interference sources. Therefore, the power of the tag in the boundary or edge of the RF electric field may be unstable, so that the reader cannot use the previous movement to memorize. Therefore, the basic command format can be configured to take advantage of "minimal" changes with these tags. That is, each command must contain enough information for the label to respond correctly without having to refer to previous changes.

These orders can be used to "read" the address or identifier of the tag. Addresses and identifiers can be used interchangeably with reference to unique labels, which means that the two can be replaced with each other without restriction. The number of bits in the tag address can be increased or decreased according to the implementation required by the present invention. The invention is not limited to the number of bits of the selected tag address. In one embodiment, the number of 64-bit addresses can be used. In another embodiment, it may be desirable to use a 96-bit address number. Therefore, the present invention is not limited. Basic commands

In one embodiment, the four basic commands briefly described here and detailed later can be used to read the address value of the tag. In a specific embodiment of the present invention, as described below, the address value is composed of 64 bits. Scrolling a tag that matches the data sent by the reader will answer the error by returning the full address (LSB first) plus sixteen (16) cyclic redundancy checks (CRC). News. The data transmitted by this reader may be of variable length. In alternative embodiments, the scroll command may include an additional command (e.g., a sleep command) appended thereto. This additional command can be executed after the completion of -18-1228683 Invention Description Continued (14) The scroll operation evoked by the scroll command is completed. After sleeping, a tag matching the data transmitted by the reader will enter a state where it does not respond to any commands from the reader. This "state" can be maintained as long as the tag maintains power. After the tag is opened, it will be in the default "wake" state in response to the reader. The data transmitted by this reader may be of variable length.

Destroying a tag that matches the entire 64-bit address, 16-bit CRC, and a special destruction code transmitted by the reader will be permanently closed without any further response to the reader's query. In one embodiment, the "destroy" command makes the tag inactive forever. In one of the specific embodiments, the destruction command may require the reader to provide a strong electric field strength, so it is a short-range operation (for example, the distance between the reader and the tag is 30 cm (cm)). Other embodiments may allow longer or shorter addresses, different CRC or other error checking codes, and a combination of different corrupted codes. The distance that the tamper code can operate will change with the required range. Send a message-This command is part of the multi-label anti-collision algorithm described in detail below. A tag matching the data transmitted by the reader will respond to one of the n time bits defined by the clock mark transmitted by the reader. The m least significant bits (LSBs) of the tag address starting from the position specified by the reader determine the response bit. In one embodiment, the response itself transmits eight bits of information among one of the n time bits. Other specific embodiments can be used to change the time bits. -19-1228683 INTRODUCTION TO THE CONTINUATION (15) The number of bits and / or the number or position of bits used to determine the time bits that the tag can respond to. In other specific embodiments, the number of bits of the tag identification code transmitted in the response may be changed. In explaining the example described in this article, the tag transmits eight bits of information in response, but it is not a limitation. The length of the clock marks generated by the reader to define the n time bits may be short or long, depending on the particular implementation of the present invention. In general, the clock length must be sufficient to accommodate the receiver's set time or the tag's oscillator drift. According to different implementation methods of the present invention, the signaling command can be flexibly used. Figure 4 shows the relationship between n time bits and m least significant bits of the tag address. Referring to FIG. 4, a binary tree 400 includes a column 402, which contains two bits 404 and 406. The value in bit 404 is m = 0, which represents the least significant bit (LSB) in response to a tag in a time bit equivalent to bit 404. Similarly, the value m = 1 represents the LSB of the tag in response to the time bit corresponding to bit 406. In the second column 410, there are four time bits 412, 414, 416, and 418, which include two LSBs that respond to tag addresses in time bits equivalent to 412, 414, 416, and 418, respectively. The third column 30 contains eight bits 432, 434, 436, 438, 440, 442, 444, and 446, which contain three LSBs corresponding to the tag address in the corresponding time bits, respectively. When the column number is increased to 450, 470, and 480, the number of bits will grow to n = 16, n = 32, and n = 64, respectively, and the maximum number of known LSBs in the tag address will also increase. As a result, as the column number η increases, there will be fewer -20-1228683 invention description continued pages (16). The number of tags responds to one bit. Stylized commands Following the basic command format are the commands used to program information into those labels at the time of manufacture. In one embodiment, there are four stylized commands described below that can be used to stylize the tags. The delete-delete command sets all bit values of the tag to "0". This command collectively deletes the entire memory array. Generally, the delete operation is performed before the program command used to initially clear the memory. The delete command has no effect on a label that has been locked (refer to the lock command). Programming-A programming command is accompanied by memory address information and data to be programmed into the tag. To save time, several bits (such as 16) are usually programmed simultaneously. Various memory architectures specify the length of data to be programmed for optimal efficiency. The programming cycle may be deleted before the cycle to ensure that all data can be programmed to the correct state. Only previously unlocked tags can be programmed. The verify-verify command can be used as part of the programming loop to check the contents of the memory, so that the programming element can verify that all tag memories have been programmed correctly. The verification command may be executed after programming or deleting the command. This command addresses all bits of the memory and transfers their contents to the programmer. The verify command has no effect on tags that are already locked. Lock-Once the lock command is executed, it can no longer be used after deletion . Executing the lock command makes all stylized commands inoperable. Number of basic command fields ------------ ___ Block description ~ ------------ [SPINUP] 20 Each basic command will be preceded by a logic of _ series and common label timing. The tag's synchronization circuit will use this part of the information to establish the timing in its circuit board in order to read / decode the information and provide the clock to answer the reader. [SOF] 1 Start box indicator. Logic 1. [CMD] An 8-bit nibble that specifies the order to be transmitted to these tags. (See the command data table below) 8 bits can provide up to 256 commands. Four of them are used by Lai I, while the rest of the site space is reserved for advanced labels of grade π and higher. [PJ 1 [(JMDj parity of odd parity data. [PTR] 7/1 Miscellaneous-Position indicator in the tag address. Its value starts from lsb and is calculated upwards. [PTR] is an attempt to compare with [VALUE The information specified in the] field generates the starting finger of the matching tag. [P2] 1 [PTR] Blocks the odd parity of the material. [LEN] 7 7 bits equal to the position to be blocked in [VALUE] The length of the data transmitted in the [P3] 1 [LEN] field is odd odd parity. [VALUE] Variable (1-96) For level 1 targets, there are 1 to 96 data bits When sending, scrolling, sleeping, or destroying an order, it is the data that the tag is trying to match with its address. (LSB first) [P4] 1 [VALUE] The odd number of data in the field is in the same position. [P5] [EOF] 1 Odd parity of all parity units. — --——-----A 1 4- 丄 一 »^. One ... __-~--_____ 1, 4 Do not pay. Logic 1. Table 1 Description of the basic command bar. -22- 1228683 (18) Description of the invention. Page reader command structure 1 (reader-to-tag communication) The basic command format from reader to tag is It consists of seven fields and five parity information. The basic command structure shown in Figure 5 is shown in Figure 5. Referring to Figure 5, the basic command bit of a specific embodiment has been listed and defined in Table 1 above. Other specific embodiments may change the length and encoding method of these fields, and / or the type of parity, in order to reach the size of the data or add additional commands. The basic command bits of a specific embodiment of the present invention The pattern has been listed in Table 2. The graph in Table 2 shows the response generated by the labels after responding to the basic commands. Basic Command [CMD] 8-bit pattern MSB < -LSB label response ( Please refer to the response interval below) Scroll 0000 0001 "Scroll answer" Sleep 0000 0010 Destroy 0000 0100 No message 0000 1000 "Message answer" The second half is reserved for stylized and level III-IV commands (4 (Units) 氺 氺 氺 氺 Table 2 Basic command bit pattern and label answer. Stylized command [CMD] 8-bit pattern MSB < -LSB Remarks Programming 0011 0001 Delete 0011 0010 Lock 0011 0100 Verify 0011 1000 Table 3 stylized command bit pattern. 1228683 (19) __ Description of the invention continued on 1 ------- --_____ Response interval (tag-to-reader communication) In one embodiment, only Uncover the basic commands that generate a tag response. Under this 2 = sending command is able to read the information transmitted by the reader in the [VALUE] position. ° P order, if you read the internal address of the tag starting at the specified position and " match the [PTR] block If the estimated result in the bit is correct, the label will enter all the parity bit (LSB) of the niche bit, and follow the bit meaning upwards7. The data will be responded in one of two ways: (1 ^ Compare. Matching tags can be 卷 ~ scrolled answer "or (2)" Send message. Success ". Unmatched tags are not entered Eight A] 5 weeks, Ling. Although scrolling and issuing order A, it is used to determine whether the tag is a horse, and the conditions of the response command are exactly the same. Not the same. The difference is simplified. Other specific embodiments can also be used to change the bit order that has been programmed into the two-patch memory, thereby changing the search from lSB to the maximum, sense bit (MSB) and search from MSB Sequence to LSB. There may be many ways of data representation in the teachings of the present invention. Scrolling Answer The tag responding to the scrolling command is by transmitting its full 64-bit address plus 16-bit crc (A total of eighty (80) bits) is provided to the reader for answering, and it uses the modulation method described below in conjunction with FIGS. I5 and 16. As shown in FIG. 6, in one of the specific embodiments 'Tags are modulated from LSB to MSB, where the bit is 502 phase At the LSB of the tag address, bit 504 is equivalent to the MSB of the tag address. According to the reader, the following three examples of tags can be used to illustrate the scroll command. If the reader issues the following Lean words: -24-1228683 Description of the invention continued (20) [CMD] 200000001 (Scrolling); [PTR] = 000011 1 (7); [LEN] = 0001001 ( 9); [VALUE] = 000101101. The tag will try to compare the nine bits in its address data starting from position seven with the data specified in the value field, starting from the LSB and comparing upwards in bit meaning .

In Table 4 below, tags 1 and 3 respond to the scroll command, while tag 2 does not respond. Tag ID code / bit position will respond to the MSB LSB bit position of the scroll command ... 32109876543210987654321-tag 1 ... 01000100000101101110101 respond to tag 2 ... 10011110000100101001001 no response (bit 10 does not match) tag 3 .. .10110101000101101111011 Respond to the table 4 scroll command example.

Transponder The transponder command is widely used in the anti-collision algorithm described below. The system that will be described in one of the specific embodiments is equivalent to the example of column 430 in FIG. 4, where n = 8 and m = 3. In this specific embodiment, the signaling command will require the tag to respond to the eighth defined by the reader's modulation (or "tag") by modulating the eight-bit data (encoded into a bit cell). Among the time bits, -25-1228683 invention description is one of the continuation pages (21). The bit used by the special tag to respond depends on the three LSBs of the tag address following the part of the tag address indicated by the [PTR], [LEN], and [VALUE] fields specified in the sending order. . A label with an LSB of "000" (702 in Figure 7) will respond in the first bit, and a label with an LSB of "001" will respond in the second bit, and so on, with an LSB of "111 "Label (716 in Figure 7) will respond to the eighth bit.

These eight time bits are shown by 702 to 716 in FIG. 7. The time sequence of bits 702 to 716 can be arranged in any order. The sequence shown in FIG. 7 is only one example of a specific embodiment according to the present invention. The invention is not limited to the order or number of bits arranged in the figure. Please also note that the number of bits in any two or more bits may differ. The following command bit values can be used to illustrate an example of a signaling command. If the reader issues a command with the following information: [CMD] = 00001000 (send); [PTR] = 0000111 (7);

[LEN] = 0001001 (9); [VALUE] = 000101101. The tag receiving this command will try to compare the nine bits in its address data starting at position seven with the data specified in the value field, starting from LSB to MSB. These matching tags will respond to one of the eight bits determined by the three LSBs following the address data that they have matched. In Table 5 below, there will be three tags in three different bits (determined by the three LSBs of the tag address) in response to the send command. In Table 5, the underlined bits are compared, while the italicized bits are transmitted. -26-1228683 (22) Description of the Invention Continued pages are given to the reader. Therefore, tag 1 responds to bit 5 (LSB 2 100) of 710 in FIG. 7: tag 3 responds to bit 6 (LSB = 101) of 712 in FIG. 7; and tag 4 responds to FIG. 7 Bit 1 of 702 (LSB 2000). Because bit 10 (0) in the tag address of tag 2 does not match the corresponding bit (1) in [VALUE], it will not respond to. The sequence shown in FIG. 8 is the transmission order from the tag, which is transmitted from the least significant bit to the most significant bit. Tag ID code / bit position will respond to the tag response bit of the sending command 8 bit response MSB LSB MSB LSB bit position ... 32109876543210987654321---Tag 1 ... 01000100000101101110101 Response bit 5 (100) 01000100 Tag 2 ••• 10011110000100101001001 does not respond (bit 10 does not match) Ba-tag 3 • •• 10110101000101101111011 responds to bit 6 (101) 10110101 tag 4 ... 10110000000101101111011 responds to bit 1 (000) 10110000 Instance. In an alternative embodiment, the tags may respond to the signaling command by modulating the tone signal instead of monotone modulation data. For example, each tag may have a unique tone. Therefore, in response to a signaling command, the tag may transmit its tone call to announce its presence. In other specific -27-1228683 invention description pages (23) In the embodiment, one tone may be used to indicate "1" and the other tone may be used to indicate "0". Therefore, a tag can respond to a signaling command with the correct bitbox by modulating two tones to indicate the next bit of its address. In other embodiments, the tag can encode the bits following its address using a number of tones. Because these tones are outside the channel used by the reader-to-tag communication, this method allows the reader to easily detect the response to these signaling commands. In one embodiment, the reader may include a digital signal processing (DSP) chip configured to detect the tone signals. Anti-collision algorithm In the specific embodiment discussed, the sending command stores the tag response in eight different time segments according to its address in order to divide a tag group into eight subgroups. The storage operation is used in an algorithm that investigates a numerical space or a binary address tree with a maximum of m bits at a time. By issuing several messaging commands to the reader's domain, analyzing its response, and finally issuing the correct scroll command, individual tags can be isolated from the many tag groups in the reader's domain. In one embodiment of the anti-collision algorithm, m = 2. Figure 9 shows the first three LSBs of the tag address space represented by the binary tree 900. The binary tree in the figure can be developed into a 64-bit tag identifier. However, only the first three layers are shown in the figure. Sending commands for [PTR] = 0, [LEN] = 0, and [VALUE] = 0 will investigate the first three bits from the top of the tree (when the structure is m = 3). A tag with an LSB of 000 will respond to bit 902, and a tag with an LSB of 001 will respond to -28-1228683 of the 904. (24) Description of the continuation page Bit 2, and so on, a tag with an LSB of 111 will In response to bit 8 of 916. Even if the collision makes it difficult to read the eight bits of data transmitted by the tags, the reader can still search for backscatter from the tags in each bit and know the tag group. However, if backscatter is present in a particular bit, it means that one or more tags match the query. The bit number tells the MSB of the three tag addresses below the reader.

Anti-collision example The following non-limiting example will explain how to use a signaling command to split two tag responses into different bits. The LSBs of the two tag addresses are 011 and 101 °. Inquiry 1 · [CMD] = 00001000 (send); [PTR] = 0000000; [LEN] = 0000000;

[VALUE] = 0. Referring to FIG. 10, during the answering period, backscatter modulation was found in bit 4 (1004 in FIG. 10) and bit 6 (1006 in FIG. 10). Because there are several tags in each of these bits to be modulated, competition will occur, but the reader knows that there are tags, and it knows that there are two different tag groups whose first three LSBs are 011 and 101 . With this information, the reader can issue a second signaling command (Interrogation 2) to explore the tag group in bit 4 while retaining the tags in bit 6 for later analysis. Enquiry 2: -29- 1228683 (25) Description of the invention continued [CMD] = 00001000 (send); [PTR] = 0000000; [LEN] = 000001 1 (3); [VALUE] = 011. The effect of this command is to go further from the 011 position shown in Figure 11 to the other three bits in the tree. Referring to FIG. 11, the highlighted branch contains a label matching query 2. These tags are the same as those that respond to the first query in bit 4. In the new inquiry, the tag change during the answer interval will occur in bit 2, bit 7, and bit 8 (bit days, 1107, and 1108 in Figure 12). The reader now knows the six address information bits of the tags and the three address information bits of the tags in the branches that are not being followed further in the speech. Read opportunities continue repeatedly, and use the signaling command to search the entire tag address space until the entire 64-bit address and 16-bit CRC of the tag are explored. The "divide by eight" feature of the sending order enables it to quickly reduce the number of tags for answering in bits. For 100 tag groups, it can be found that using random addresses on average requires less than four commands to separate each tag. If there is only a single tag that responds to a specific meta, the reader can decode the eight-bit message transmitted by the tag and issue a scroll command to the [PTR] [LEN] used to successfully remove the tag. And [VALUE] data. In one embodiment of the present invention, each item having a tag group is an independent operation. The order-response pair is a very subtle exploration of different types. Dai Qun is here. 1102 Reader 0Q1 The reading of each bit of the reading unit is subject to change, -30-1228683 Invention Description Continued ( 26) It does not need to know what happened to the tag in the past. The “memory-free” feature can greatly enhance the performance of passive tags in places with large noise or at critical RF power levels. The reader retains progress-related information through a binary tree representing the tag identifier. Branches with labeled signals but not immediately explored can be kept in memory and checked later to improve overall processing flow. Readers with different functions can use the same protocol. A precision reader capable of bit-for-bit detection can sort tag groups very quickly. Tags can be quickly separated using a series of signaling commands, which can then be read using scroll commands. Simple readers that do not have the ability to detect competition (for example, readers that only have analog filters to search for "class tag" modulations) can still sort and identify using only signaling commands. The previous command can identify the tag address in different situations. Examples of how to use these commands are described below. Case 1-Single Tag Case In this example, the characteristics of this application ensure that only a single tag will appear in the field of this reader. This is a common application and can be found in toll booths, slideways and conveyor belts at livestock farms. Anti-collision may not be a necessary function. The reader may simply issue the scrolling commands of [PTR] = 0, [LEN] = 0 and [VALUE] = 0 repeatedly, and let any tag in the area issue its address and CRC Just give the reader. This is a special scroll command situation that does not have to compare the bits of the tag passed to the [VAL] bit. As mentioned earlier, if the [LEN] field is not equal to zero, it is contained in the [VAL] field. 1228683 (27) I Inventory Note: The value must match the value of these tags in order for the tag to respond. 0 Command scrolling, [PTR] = 0, [LEN BU〇, [VALUE] = 〇 扎 1 · [64-bit tag id encoding] + [16-bit CRC] Love mud 2 ~ Multiple tags, random bits In this non-limiting example, the reader encounters four tags. ^ 1 in Table 6 is the tag ID number of these tags. Signaling commands can be used to separate Λ: ^ ^ scroll commands can be used to read and verify the address of these tags. The reader can issue the following commands: Command 1: Send a message, [PTRbuo, [[LEN] = 〇, [VALUE] = 0], each tag is prepared & the italic position in Table 6 The reader is shown in Table 7. These are the bids shown in Table 7. The bits used to transmit the response are shown in Table 7. In Table 7, the reader found the bit i Yanqi Fenqi Hongyi and the bit. There is a separate label in bit 6 and bit 4 is scattered. There are several labels in one bit. (Label 3 and label 4) To respond to the same bit label ID number / bit position Bit position -__ LSB label 1 '... 32109876543210987654321 Tag 2, ... 01000100000101101110101 Tag 3 — ^ ... 10011110000100101001000 Tag 4 "-~ s1011010100010010111101 1 ... 1011000001 1101 101 10101 1 Table 6 Tag address. -32-1228683 Description of the invention continued ( 28) Answer 1: Response bit 1 2 3 4 5 6 7 8-bit value 000 001 010 011 100 101 110 111 Is there a competition? No--Yes-No--Tag 1 responds 01110101 Tag 2 responds 01001000 Tag 3 Responses 01111011 Label 4 Responses 011 01011 Table 7 Tag signals read by this reader.

〒々 2 · Scroll, [PTR Bu 0, _L EN Bu 3, [VALUE] = 000. Hexun 2 · Tag 2 matching scroll bar

Full 1 + you -Μ ,. Tag 2 sends [64-bit tag ID code] + [16-bit π CRC] to the reader. The reader then issues a third command to scroll and call. ,:;, :: Answer 3: Label 丨 Matching scrolling conditions] =, [lianggang = 1〇 卜

Encoding] + [16-bit CRC] for 哕. Send a [64-bit tag ID to read the badge. The reader will then issue the Chu, ° 'Four four lives and eight orders 4 · · Send a message, [PTR 卜 〇, 比较' Better Department, the bottom line of the ^ 3_, [VALUE 卜 〇11. Bits are transmitted to the reader. To stand 70. When italicized as shown in Table 8 below, the reader can find the separation problem as shown in Table 9_, which is the same as that in bits 6 and 8 of $. '33, 1228683 Description of the invention continued (29) Tag ID coding / bit position MSB LSB bit position ... 32109876543210987654321 tag 1 ... 01000100000101 101 1 10101 tag 2 ... 1001 11 10000100101001000 tag 3 ... 101 1010100010010111101 1 Tag 4 ... 10110000011101101101011 Table 8 transmits the address data of tag 3 and tag 4. Answer 4: Answer bit 1 2 3 4 5 6 7 8-bit value 000 001 010 011 100 101 110 111 Whether there is competition----• No-No Tag 1 Response Tag 2 Response Tag 3 Response 00101111 Tag 4 Responses to 01101101 Table 9 The reader found the separated tags in # 6 and # 8. The reader will now smoke + X out the scroll command to complete the addressing of tags 3 and 4. Command 5: Scroll, [PTR] = 0, αΕΝ] = 6, Answer 5: Tag 4 matches the scroll condition. Standard code] + [16-bit CRC] gives command 6: scroll, [pTR]: = 〇, the reader [LHlsij = g Λ [VALUE] = 101011. Sign 4 and send [64-bit standard 〇 [VALUE] = 111011 0

Sign ID > 34-1228683 Description of Invention Continued (30) Answer Λ 6. Standard 3 matches scrolling conditions. Tag 3 sends [64-bit standard plant code] + [16-bit CRC] to the reader. This completes the anti-collision algorithm and identifies all tags. It should be noted that other specific embodiments can also be used to implement various applications, data processing and storage methods, tag stylization sequence, tag detection geometry, and the use of basic commands provided by the protocol taught by the present invention to achieve various readings. machine. Therefore, the present invention is not limited to this. RF transmission layer The present invention can be applied to various spectrums. In this section, one specific embodiment of the RF transmission layer will be described using the parameters specified by ultra high frequency (UHF) operation. However, those skilled in the art will find that the invention is not limited to the UHF spectrum. RF power management The reader's radio frequency (RF) power management should comply with local regulations. In the U.S. ’unlicensed ultra-high frequency (UHF) bands will require the reader ’s R; p emissions must comply with Federal Communications Commission (FCC) Section 15.247 and

Electromagnetic Exposure (ΕΜΕ). Under these specifications, the output power of the reader measured at the antenna input will not exceed 1 watt. At the same time, the gain of the reader ’s transmitting antenna does not exceed 6 decibels (dB), where the 0dB gain (dBi) of the free-space isotropic transmitter measured by the linear antenna is used as a reference value. The cardiac output power of the reader can be changed in a controlled manner to achieve the following objectives: 〇Change the reading range of the reader; 〇Improve the adaptability to various applications, facilities and conditions; -35-(31) 1228683 Description of the invention continued Page 〇 Save power consumption (pin + battery-powered system); 0 it ri θ / in several readers, reading management tags in the same RF power% space (channel control, audio frequency, etc.); and / Or 〇 If β, measure the fidelity of the downlink and uplink of the bucket, *, J 4 connected to one or more tags. Half-duplex operation In this embodiment, the tag-to-reader and reader-to-tag links are both defined as half-duplex. The reader does not need a data link from the tag to the reader unless the reader wants to pass rounds. However, during this keying, the reader will only provide power to the tag without transmitting f data. During the reader-to-tag link, the tag cannot transmit data. Frequency In one embodiment, the North American RF transmission layer is used, and its frequency band is 902-928 MHz (UHF). Other specific embodiments of the present invention may also use 13.56 MHz, 2450 MHz and other frequency bands. Different frequency bands and countries will be slightly different in terms of frequency band, power, modulation, and verification specifications. According to the present invention, those skilled in the art will find that it is not limited to the frequency used by the RF transmission layer. In one embodiment, the system performance is around 915 MHz (UHF band can be π to lower the system performance. In the United States, 64,000 bits per second (ie 64 kbps) high-speed reader to tag system data transmission In the range above i meters, if | r hit rate is high enough, it can provide a data rate of 128 kbps or faster tags to the reader system. Therefore, the "uplink" from the standard to the reader The "link" data transfer rate is faster than (approximately ^ times, even -36-1228683 Invention Description Continued (32) to 4 仵 t ^ ° 乂 in some cases) from the reader to the "downlink" "Data transmission rate. I hope to visit 〃 I hope to set the response rate (uplink data transmission rate) of this% standard hub. 4 and the downlink data transmission rate are non-simplified rates. Here we need to use small I tag and reader antennas. Because the requirements of the Q value are not high, we use the technology well-known in the art to make cheap, printed antennas. This phenomenon is acceptable in the United States. In the 915 MHz signal, the United States The frequency band is quite wide enough to perform meaningful frequency hopping operations. In the UHF band operating at 902 to 928 MHz in North America, there should be at least 50 frequency hopping virtual random methods to access the channel. 20 dB bandwidth kHz) 〇

In a specific embodiment, the reader system operates in the manner of an audio frequency system. Department. The peach frequency should be in accordance with FCC section 15.247. It should be 10 seconds. In each channel, the channel occupied by more than 400 milliseconds (ms) cannot exceed 50000 cycles per second (Ie 500

In other specific embodiments of UHF stunts outside North America, the reader can be modified to conform to the local regulatory environment to achieve the best performance. In a specific embodiment for the European market, it can be expected that these standard irons (not necessarily for the US 5 buying machine) will stay in the 868 MHz frequency band or other available frequency bands. Reader-to-Tag Modulation In one of the specific embodiments, the reader is in any of three available states: (1) off (no RF energy is emitted); (2) CW (in some ways without amplitude modulation) RF energy is transmitted at the power level); and (3) active (with tuning -37-1228683 invention description continued page (33)

RF energy is transmitted in an amplitude manner). In the active state, the reader transmits data to the tag group in AM. In one specific embodiment, the tag-to-reader link is 00K (On-Off Keying), and its minimum modulation depth is 90% (Figure 13). Modulation rise and fall times are usually limited to 300 nanoseconds (ns) by sideband emissions. The modulation rate is variable, and the data transmission rate depends on the local environment. Specific embodiments suitable for U.S. operation may use a nominal maximum modulation rate of 64 kHz. Therefore, in this specific embodiment, the tag must be tolerance-adjusted and responsive to the reader in a manner proportional to the modulation rate in the range from 16 kHz to 64 kHz. This specific embodiment will be described below with reference to FIGS. 13 to 16. Stone horse

During modulation, the active reader provides a nominal 62.5 kHz clock signal to neighboring tags. In Figure 13, the tags are synchronized with the active reader at the negative edge of the RF envelope 1302 (that is, the off period of the reader's transmission). As shown in FIG. 1432, each 62.5 kHz clock interval includes a basic sub-clock cycle, and its time length is substantially 16 microseconds (ps). The binary data transmitted from the reader to the tag, after encoding, will become the pulse width modulation of the low level pulse bounded between the 2 ps and 6 ps substantial limits. Preferably, for any command frame, the clock tolerance of the reader must be within 1%. Negative direction pulse width is the smallest. The smallest change is ± 1%. Therefore, it is 2 ps at 62.4 kHz and 1.972 ps at 63.36 kHz. European operation requires that the negative pulse width must be proportional to the modulation frequency. For a better system, all other "basic clock cycle" timings must be proportional to the value of ± 1% of the modulation clock frequency. -38- 1228683 (34) Description of the Invention Continued Modulation Timing Table 10 contains the nominal value of the negative pulse width modulation (RF interrupt period) used to transmit data to the tag. Modulation timing 2 ps ± 0.2 ps Reader logic 0 (rise and fall 300 ns) 4 ps ± l ps Tag discrimination point triggered in the modulation clock 6 ps ± 0.2 ps Reader logic 1 10 ps ± l ps start Reader logic-1 phase transition (up and down 500 ns) 12 ps soil 1 ps End reader logic-1 phase transition (up and down 500 ns) 2 ps ± l ps logic-1 phase transition pulse width 16 ps ± 0.2 ps The next modulation timing of the reader. Table 10 The modulation timing is shown in 1462 in Figure 14. For the clock timing of the reader to the tag, when the data = "0", the 62.5 kHz is used. The 2 ps "narrow" pulse width of the clock is encoded. In 1402 of FIG. 14, for the clock timing from the reader to the tag, when the data = "1", it is encoded with the 6 ps "wide" pulse width of the 62.5 kHz clock. Tag-to-Reader Modulation In the specific embodiment discussed below, as shown at 1500 in FIG. 15, the tag responds to the reader command with a backscatter modulation that conforms to 4-spaced bit-lattice coding technology. It can be seen from the figure that in bit field 1502, level 0 has two transitions; in 1504, level 1 has four transitions. The nominal data transfer rate from the tag to the reader is 128,000 bits per second (ie -39-1228683 (35) Description of the Invention Continued 128 kbps), but due to the possibility of oscillation drift in the tag, the entire 80 bits In the response window, the change may be as high as 25%. For target readers, the length of this bit time is approximately 8 ps. As shown in Figure 15, the difference from Manchester coding is that in this technique, a transition must occur in the middle of the bits, so 0 and 1 are determined during the time when the coding is reversed. Referring to FIG. 15, 1530 represents a -yuan tributary sequence 'and 1540 represents the 8-bit lean sequence. Race Detection In general, race detection is important for most anti-collision algorithms. When two tags have the same clock frequency and their back-modulated waveforms differ by only one bit, the reader must be able to easily detect the differences caused by these back-scattered modulated waveforms. This is shown in Figure 1600. In 1602 of Fig. 16, a bit difference can be identified, in which there are two consecutive bits in the logical state (i.e., 1). If the clock frequencies of the two tags are different, the re-tagging competition detection will be easier. The signal difference between the system tags shown in 1630 in FIG. 16 has a one-dimensional difference in the modulation waveforms of the two tags, and the clock frequency difference is 50%. The competition for tag responses will produce a waveform that is different from the combination of bit cells 1502 and 1504 (Figure 15). The reader-to-reader anti-collision method in a reader-intensive environment is compared with other closed systems. In the general chain supplier sales environment, it is more difficult to manage the interaction of a large number of readers and tags. The horses in the eighth place are all oppositely scattered enough to light the 16 out of this one, with more than two bits of modulation or zero shape. -40- 1228683 Description of the Invention Continued (36) There are multiple methods of interference sources, and there will only be 10% of the tags that are compatible with the standard 1706-style reader. Fig. 17 "Time" allows the output to have 1 ms to determine that the low-power backscatter modulation signal will be obscured by various environments in the environment (including the modulation signals of other readers). One of them reduces the reader-to-reader interference to a minimum. A specific embodiment is to implement cooperative time sharing in a local neighborhood. When the readers operate in the same real-time space, an "active" reader in the "neighborhood" can operate at full power and sign for two-way talks, as shown in Figures 1702a and 1704a. As shown in 1704, 1708, and 1710, other non-active mode readers in this real-time area are called "silent" readers, and may be "off" or operate with less power (usually less than the maximum allowable RF) Power continuous wave (CW) mode. All readings operating in silent mode detect communication activity between the full-power active reader and the antenna pattern that falls within its range. When in low-power silent mode, the reader is silent It can still maintain its frequency hopping pattern, but it will not modulate its output. When the active reader completes the communication cycle with the tags in its range, it will stop modulating for at least 20 ms (this time it will become a silent reader). The silent reader has ample time to become active mode. This is the 20 ms period shown in 1720. When the silent reader detects an open space in 1730, one of the readers will become active mode. Enter the maximum allowable power state and start communicating with neighboring tags. When no active reader is detected for transmission for at least the period, it is an open interval As mentioned earlier, after detecting the "Open Neighborhood Interval", all Greek 1228683 Invention Description Continued (37) silent readers that are expected to become active mode may have a virtual range between 0 and u ms. This action is made after a random delay period. Figure 17 shows the virtual random delay period at 174 of T. Refer to Figure 18, if there are two or more silent reading money in the same neighborhood (for example, Reader 18 0 8 and 1 810) at the same time changed to active mode, and if we all detect the condition of 1820, they will immediately return to silent mode Y. Then, we must stay in silent mode for another period of virtual random delay time ' Only then can it try to become an active fork. The virtual random delay time should be between 1-20 ms, and Rd2 in 1812 represents this time. After the delay 1812 starts, the reader 1810 must monitor whether there is another A reader is about to change to active mode. If detected in 1830, it should stop attempting to change to active mode. Reader 1810 should remain silent until the next channel. Until the headroom. Except for the 20 ms interval specified by 1720, these readers cannot switch to active mode. When these readers repeatedly execute this virtual random delay cycle, all other in their neighborhood The readers must remain silent and cannot change to active mode until the next neighborhood interval is detected. Outside of this open detection interval, the readers cannot change from silent mode to active mode. The sum of Rd2 of 1812, plus the open channel detection period, can't make the reader into active mode within the 20 Cong interval specified by 1720, the reader should be kept silent or turned off. Medium 'until the next open interval is detected. In any case, software can be used to construct periodic usage rules for the interval of each reader. However, in any case, the mute reader-42- (38) 1228683 Description of the Invention The continuation page must check the availability of the neighborhood interval. Activating the optional device. 0 At this time. 5 RF field signals emitted by the reader of the isophonic mode. If you do not observe the tag group in the reader field of Doppler, you do n’t need too much power. In this mode, 0 becomes the active mode in some cases. In order to transfer the power, the power level is 0. Before the transition to the active mode, the reader may also be equipped with a Doppler reader to be able to detect the Doppler signal caused by any movement in the low power static state. 'The reader can assume no change. Therefore, readers such as the tag group can continue to keep low power. Periodic rules can be used to keep silent readers in shape. 'Combined with Doppler activation and audio readers become active mode. Its net consumption and bandwidth usage rate are reduced to a minimum as shown in Figure 19. In a 4096 clock cycle interval with a frequency of 62.5_, all readers can operate at least 16 clock cycles with a frequency of 砭 (256㈣ Intermittently and simultaneously suspend AM modulation (turn off the carrier or perform RF). The starting point of the "Macro_Clock Cycle" can be from the "Master Reader" or other control unit (if any) To control, otherwise, the first clock cycle must be activated and controlled by the first reader in order to move in a "storage area" with a range of up to 300 meters. These silent periods may vary from 16 to 4096 Clock period (256 to 65 ms). The "silent period" rule takes precedence over any other period or activation rule. During the silent period, the reader cannot attempt to become active. The purpose of the "silent period" rule is Give other FCC components the opportunity to communicate, and promote the operation of equal 3, level 4 tags and other long-distance components. The "silent period" rule can also promote reader to reader and reader to master -43-1228683 INTRODUCTION TO THE CONTINUATION (39) The machine interacts and provides a better frequency hopping window. Before the reader becomes active mode for the first time, it must first listen for at least one complete giant clock cycle, and 62.5 kHz modulation detected in the master reader, other readers, or other control units within 300 meters. Each reader then synchronizes its 62.5 kHz modulation with this common reference time , And become active mode at the beginning of the next giant clock cycle. All reader frequency hopping must occur in the quiet interval of the giant clock cycle and keep at least 1 ps overlap with the start or end of the quiet period. Application layer As mentioned above, the label in this article contains an identification symbol, which can be referred to as an address or identification code. Terms such as address or encoding are used interchangeably, and there is no restriction on the use of the two in the context of the present invention. In a specific embodiment, the tag address length may be 64 bits, but in other specific embodiments, it may be shorter or longer. The encoding is then stored in the tag. Data in the Internet. You can also store the data on the Internet or the Internet, and use the code extracted from the tag to access the network or the Internet. You can access it in several ways. And interpret the data behind the code. For example, the code may be composed of one or more data fields, and the host system that interfaces with these readers can understand the clear meaning of the data fields. , The data compression technology can be used during programming to reduce the memory size required for the tag to a minimum. Algorithms resident in the reader, the host system or the network (including the Internet) can resolve the tag data -44-1228683 (40) Description of the invention The continuation page is compressed into a form that can be directly applied. Although implemented in a different way, the goal is to link information to physical objects. Tag Memory Structure The following will describe a specific embodiment of the memory configuration. Of course, other configurations are also implemented. Although tags can have different amounts of memory, if they are designed to promote the use of common identification techniques and search methods, at least a portion of their memory must be configured the same. 20A and 20B are specific examples of a 96-bit memory configuration. Tag memory may be read-only memory, non-volatile memory, or both. For example, the code can be written into the tag by the tag manufacturer. If the tag code is to be written by the user, the tag must have non-volatile memory (such as EEPROM) or one-time programmable memory (OPT ). The hybrid approach is to store the header, manufacturer, and product fields in read-only memory and the serial number in EEPROM. The memory required by the tag is sufficient to store the identification code. The foregoing specific embodiments are not intended to limit the present invention. Different labeling levels can be counted to suit different applications and cost conditions. In some embodiments, tags of different levels may work together. There may also be standardized line input / output (I / O) interfaces between tags and sensors, clocks, displays, and other components. Collection information and its use The labels described herein can be used in a wide variety of applications. For example, the label can be applied to product manufacturing for coding and verification. The physical storage needs to be set up. -45-1228683 Description of the invention continued page (41) The label can be entered into the electronic Tag library. Track work in progress in production equipment. Use labels to manage and control inventory, and also use labels to check. Tags can also be used in distribution and warehouse applications, including shipping, receiving, tracking, and delivery. It can also be used in transportation, such as monitoring passing vehicles. Since the standard contains a unique identification symbol, it can be used for anti-counterfeiting applications. Retail applications include receiving, inventory management, tracking items in stores, and preventing theft, such as thief detection at front and back doors and thief alert. Labels can also be closed (no effect) and left on standby (restartable labels). The tags can be destructively sequenced to protect customer privacy. Tags can be used in customer shopping carts, automated checkout counters, and to interact with customers on store displays. Its features include customer loyalty functions, product return, proof of ownership, and guarantees. Readers can also be used in homes (after the goods are sold) and can be built into appliances or furniture, such as microwave ovens, refrigerators, cooking tables, cabinets, washing machines, audiovisual equipment and computer equipment. Labels can also be used in waste disposal classification (after use), such as providing disposal information, recycling information, identification of hazardous materials, and disposal information. Tags and readers can be used in aircraft baggage handling, air tickets, customs clearance and permit control. It is conceivable that labels can be placed in a variety of different types of objects, such as products in a transaction stream, and these labels can be used in conjunction with any of the above-mentioned inventions. use. For example, unique labels can be placed in grocery or supermarket items (such as cereal boxes, soup cans, etc.). Generally, manufacturers (such as CAMBELL thick soup or KELLOGGS) place unique labels on the packaging of each product, and then use this to comply with David ’s warehouse, truck (or other transportation) or store (Grocery, supermarket, or clothing store). Furthermore, the label can be used in the "checkout" operation of the product in the store (the method is similar to the conventional product barcode, except that the barcode must be scanned at the checkout counter in the supermarket when making a purchase) . Regardless of the maintenance of inventory or the checkout of goods, the tag must be read by a reader to obtain the unique code of the tag. By comparing other information related to the code in the database, such as product name, product specifications, retail price, etc., the unique code can be used for product identification. Each product sample (for example, each can of FROSTED FLAKES oatmeal) has a unique identification code, or the label of the same product (for example, 16 ounces of FROSTED FLAKES oatmeal) has the same identification code. The tag can also be placed in home appliances, such as a toaster, coffee maker, TV, DVD player, etc. When the home appliance with the tag is brought home, the reader will interrogate the tag It can be configured to work with other appliances in your home, especially where you have a local area network (LAN) or a local operating network (LON). It is not necessary to communicate with the tag wirelessly (such as communication between the tag and the reader). The communication medium may be wireless or wired. For example, a wired connection can be replaced by a household power cord or bus -47-1228683 Invention Description Continued (43) Wireless communication.

Some of the above algorithms will divide the numerical space into two parts for label search. It is found that other numerical space segmentation methods may be more effective. Therefore, the algorithm of the present invention can not perform binary processing (divide by 2) on the numerical space (when the initial space is very large, for example, 264 possible tag identification codes, the space to be searched is still very large after the binary ), And divide the space into smaller parts (for example, 1/50 or 1/100 of the numerical space, and then search for these smaller parts).

According to this disclosure, it can be found that the methods described in the accompanying drawings can be realized by machine executable instructions (such as software). These instructions may be used to cause a general-purpose or special-purpose processor that has been programmed with these instructions to perform the described operations. Alternatively, it may be performed by specific hardware components containing hardware logic to perform these operations, or by any combination of programmed computer components and customer hardware components. This method can be provided as a computer program product, which may include a machine-readable medium on which instructions are stored for programming a computer (or other electronic component to perform these methods. To achieve this specification, " The term `` machine-readable medium '' should include any medium capable of storing or encoding a sequence of instructions to be executed by the machine and having the machine perform any of the methods of the present invention. Therefore, the term "machine-readable medium" It should include, but is not limited to, solid-state memory, optical and magnetic discs, and carrier signals. Furthermore, when you want to perform actions or produce results, this form of software is often mentioned in any form (such as (Program software, program software, process software, application software, module software, logic software). Such notations -48-1228683 Description of the Invention (continued on page 44) are only a brief expression used to describe the execution by the computer Software to allow the processor of the computer to perform an action or produce a result. Possible modifications in the "messaging" or "scrolling" tab responses The amount and type of data can be changed. For example, the "Send" tag may include a single bit, a group of 16 bits or more, or non-ID information (such as a virtual random security code, error correction code, stored Data, sensor data, etc.), and the 8-bit identifier information group described in one of the specific embodiments. Similarly, "scroll" may include 2 to hundreds of bits, and may include CRC error correction code information, security code, stored data, sensor data, etc. All parameters in this agreement can be changed to adapt to various applications. These changes include: number of bits, downloaded commands Type and length, backscattered data rate, and whether the reader wants to extract all or only a portion of the data from the tag response (most of which depend on the level of environmental noise interference). The backscattered data rate can range from a lower 16 kHz downlink rate in Europe to 64-80 kHz in the United States. In one embodiment it can reach 128 kHz, in some embodiments it can be Up to 256 kHz or higher. The backscattered data rate may be a non-integer multiple of the downlink data / clock rate. In one example, the downlink may be 80 kHz and the backscattered data rate may be 130. kHz. Certain embodiments may use a "fast scrolling" mode of operation, which uses more than two "bit clocks" (for example, it can be called "bit 0" and "bit 1 "). The operation method of the" bit 0 "clock is the same as the current bit. However, if the reader judges the last" message "-49-1228683 (45) Invention description The continuation page command is from a single If it is a tag, it will immediately provide the "bit 1" clock to the tag, so that the tag sending the last signaling order can immediately backscatter all the remaining ID and CRC information to enter the fast In some "scroll" modes. Other tags (except the tags that have just completed the "message" response) will ignore the "bit 1" clock transmitted by the reader. When the “Partial Scrolling” is completed, the reader will send “Bit 0” down, and let any tag in the next bit respond. In this way, at least one (up to 8 to 16) tags can be identified with a single reader command, greatly improving the tag identification search rate. Similarly, some specific embodiments may use shorter (generally It is 4 bits, but its range may be from 1 bit to 80 bits) "suffix" command, which will only operate on the tag that has just completed the scroll command and returned to the reader . Such commands may include sleep commands, or sleep commands that can be adjusted for code matching (eg, 16-bit CRC encoding) situations. Other post commands include read, write, etc. The main advantage of these post-commands is that they operate several times faster than the tag-specific commands that directly transmit the entire 131-bit tag down from the reader. So far, the novel identification method and device have been described. Although the present invention has been described with reference to specific embodiments, those skilled in the art can easily modify it. Therefore, all these changes and modifications must be regarded as covered by the scope of the present invention as defined in the scope of the accompanying patent application. Therefore, the description and drawings should only be regarded as an explanation, not as a limitation. -50-

Claims (1)

122 Continuation of Patent No. 123291 γ: Police Chinese Application for Patent Scope Replacement (April, 1993) ^ Pickup, Application for Patent Scope 1. A method for identifying multiple labels, each label has a storage in The identification code in the memory, the method comprising: broadcasting a command with the first data; and Receive a response to the command from the tag; where the response is related to a bit in a plurality of bits, which is equivalent to the value of the selected byte stored in the tag's information, the selected bit The tuple is a function of the first data. 2. For the method of claim 1 in the scope of patent application, wherein the response contains a value of another byte of the information. 3. The method of item 1 in the scope of patent application, wherein the response contains data from a second piece of information that is different from the information. 4. The method according to item 1 of the scope of patent application, wherein the information is the identification code of the label. 5. The method according to item 1 of the scope of patent application, wherein the information is the state of the memory of the tag. 6. The method according to item 1 of the scope of patent application, wherein the information is the input / output data of the selected tag. 7. The method according to item 1 of the scope of patent application, wherein the information is the input / output data of the selected tag. 8. The method of claim 1 in the patent application range, wherein each of the plurality of bits is related to a corresponding preset time delay of the response. 9. The method of claim 1 in the scope of patent application, wherein each of the plurality of bits is 1228683 The continuation of the patent application range. Each bit is related to the corresponding preset signal from the reader. In the case of each unit, the first message in the complex such as the second letter and the second tone should be given the information. 10. For the method of the first scope of the patent application, where the multiple bits and one bit are different from those The delay between the other bits in the plurality of bits is related. 11. In the method of applying for the item 1 of the patent scope, the plural numbers may be changed. 12. The method of claim 1 in which the response is received via a tone. 13. The method according to item 12 of the patent application, wherein the plurality of tones include a first tone representing a logical zero and a tone representing a logical one. 14. A method performed by one of a plurality of tags, each of the tags having an identification code stored in a memory of the tag, the method comprising: receiving first data from a reader; The first data is associated with the selected byte stored in the tag memory, the selected byte is a function of the lean material, and if the first data is related to the byte If so, it is transmitted back to the reader, and the response is related to one of the plurality of bits, and the bit of the response will correspond to the value of the selected byte. 15. The method of claim 14 in which the response includes the value of the other byte. 16. The method according to item 14 of the scope of patent application, wherein the information is 122868 of the label Patent Application Continued This identification code. 17. The method according to item 14 of the patent application, wherein the information is the memory status of the tag. 18. The method of claim 14 in which the information is the input / output data of the selected tag. 19. The method according to item 14 of the patent application, wherein each of the plurality of bits is related to a corresponding preset time delay of the response. 20. The method according to item 14 of the patent application, wherein each of the plurality of bits is related to a corresponding preset signal from the reader. 21. The method of claim 14 in which the response is transmitted through a plurality of tone signals. 22. The method of claim 21, wherein the plurality of tone signals include a first tone representing a logic zero and a second tone representing a logic one. 23. A method implemented by a reader to identify one of a plurality of tags, each of the plurality of tags having an identification code and a memory, the method comprising: Divided into n bits, each of which is related to a different value defined by m bits in the numerical space, and the numerical space will be related to the information stored in the memory of the plurality of tags, η is an integer greater than 2; issue a command to test a value defined by ν bits in the value space; and apply for a patent application continued on page 1228683 ^ 9a receive a response from one of the plurality of tags, where A response occurs only when the V bytes of the information stored in the tag match the V bits of the command, and the timing of the response will correspond to one of the n bits and the bit The associated m bit values will match the m bit values selected from the selected information. 24. The method of claim 23, wherein in addition to matching the v bits of the v bits in the order and the m bits related to the bit, the response further includes representing the Part of the information. 25. The method of claim 23, wherein the information includes the identification code of the tag. 26. The method of claim 23, wherein the timing of the response is related to the timing of the command. 27. The method of claim 23, when no response is received from the plurality of tags, further includes issuing a second order to one or more tags selected from the plurality of tags. 28. The method of claim 23, when no response is received from the plurality of tags, further includes issuing a second command to test another value defined by a set of bits in the value space. 29. The method of claim 23, further comprising: receiving a response from two or more tags responding in one bit; and issuing another order based on the responses. 30. A method performed by a reader, the method comprising: issuing a command to a tag; and receiving a patent application continuation page 1228683 receiving a response from the tag, wherein the response includes an identification code of the tag, and the receiving and the issuing The actions are not performed simultaneously. 31. A method for identifying one of a plurality of tags, each of the plurality of tags having an identification code and a memory, the method comprising: A command is received from the reader by one of the plurality of tags to test the v bits of the numerical space, which corresponds to the information stored in the tag; and if the received V bits The value of the element matches the value of the V corresponding bits of the information, and a response is sent to the reader, wherein the timing of the response is to the value of the m bits of the information that should be stored. 32. The method of claim 31, wherein in addition to matching the v bits of the v bits in the command and the m bits corresponding to the timing, the response further includes representing the information Part of the information. 33. The method of claim 31, wherein the information includes the identification code of the tag. 34. The method of claim 31, wherein the timing of the response is related to the timing of the command. 35. The method of claim 31, wherein the identification code of the tag matches the identification code of another tag among the plurality of tags. 36. The method according to item 31 of the patent application, wherein the response is transmitted through a plurality of tone signals. 37. The method of claim 36, wherein the plurality of tone signals include a first tone representing a logic 0 and a second tone representing a logic 1 1228683 Patent Application Continued 38. A method executed by a tag to identify one of a plurality of tags, each tag of the plurality of tags having an identification code, the method comprising: receiving a command from a reader, testing The value of v bits in a value space; and If the value of the v bits of the received command matches the value of the first part of the tag identification code, a response is sent to the reader, where the response includes the identification code. 39. A method executed by one of the plurality of readers to identify one of the plurality of tags, each of the plurality of tags having an identification code, the method comprising: Responding to the result that the first reader of the plurality of readers enters the active mode to perform a communication cycle and enters the silent mode, wherein after completing the communication cycle, the first reader enters the silent mode for a first time interval And when it is detected that no active reader is transmitting in the second time interval, it can enter the active mode after the first virtual random delay period. 40. The method according to item 39 of the patent application scope, further comprising: responding to the detection that another reader among the plurality of readers wants to enter the active mode at the same time and enters the silent mode; and when it is detected that Without an active reader during the first virtual random delay period, it can enter the active mode after the second virtual random delay period. 1228683 Continuation of the scope of patent application 41. For the method of applying scope 40 of the patent application, if the first time interval has elapsed, the active mode cannot be entered for the second time. 42. A machine-readable medium containing executable instructions that, when executed by a machine, allows the machine to perform the following operations: broadcast a command with first data; and Receive a response to the command from the tag; where the response is related to a bit in a plurality of bits, which is equivalent to the value of the selected byte stored in the tag's information, the selected bit The tuple is a function of the first data. 43. If the machine-readable medium of item 42 of the patent application scope, the response contains the value of another byte of the information. 44. If the machine-readable medium of item 42 of the patent application scope, the response contains data from a second piece of information different from that. 45. If the machine-readable medium of item 42 of the patent application scope, the information is the identification code of the tag. 46. If the machine-readable medium of item 42 of the patent application scope, the information is the memory status of the tag. 47. If the machine-readable medium of item 42 of the patent application scope, the information is the input / output data of the selected tag. 48. If the machine-readable medium of item 42 of the patent application scope, the information is obtained by the sensor of the tag. 49. If the machine-readable medium of item 42 of the patent application scope, wherein each of the plurality of bits is related to the corresponding preset time delay of the response. 1228683 Continuation of the scope of patent application 50. If the machine-readable medium of the scope of patent application No. 42 is used, each of the plurality of bits is related to the corresponding preset signal from the reader. 51. In the case of a machine-readable medium according to item 42 of the patent application, wherein each of the plurality of bits is related to a time delay different from the other bit of the plurality of bits. 52. If the machine-readable medium of item 42 of the patent application scope, the number of the plurality of bits can be changed. 53. A machine-readable medium containing executable instructions which, when executed by the machine, can perform the following operations: receiving a command broadcast by a reader, the command having a first piece of data; combining the first piece of data with The selected bytes stored in the information of the machine memory are processed in association, the selected bytes are a function of the first data, and if the first data is related to the byte, it is transmitted A response is sent to the reader, and the response is related to a bit in the plurality of bits, where the bit of the response corresponds to the value of the byte that should be selected. 54. If the machine-readable medium of item 53 of the patent application, the response contains a value of another byte of the information. 55. If the machine-readable medium of item 53 of the patent application scope, the information is the identification code of the machine. 56. If the machine-readable medium of item 53 of the patent application scope, the information is the memory status of the machine. 57. If the machine-readable media of item 53 of the scope of patent application, the information is 1228683 1 4. 2 9 The scope of patent application continued page is the input / output data of the selected machine. 58. If the machine-readable medium of the scope of application for item 53 of the patent application, each of the plurality of bits is related to a corresponding preset time delay of the response. 59. For example, the machine-readable medium of the 53rd patent application, wherein each of the plurality of bits is related to a corresponding preset signal from the reader. 60. A machine-readable medium containing executable instructions which, when executed by a machine, can perform the following operations: Issue a command to test a value defined by v bits in a value space, which has n Bits, where each bit is related to a different value defined by m bits in the value space, and the value space is related to the information stored in the memory of the plurality of tags, n is greater than 2 An integer; and receiving a response from one of the plurality of tags, wherein the response occurs only when the ν bytes of the information stored in the tag match the ν bit value of the command, which The timing of the response will correspond to one of the n bits, and the value of m bits associated with the bit will match the value of m bits selected from the selected information. 61. If the machine-readable medium of the scope of patent application number 60, in addition to the v bits matching the v bits in the command and the m bits related to the bit, the response It further includes information that represents part of the information. 62. The machine-readable medium of item 60 of the scope of patent application, wherein the information on the scope of patent application, continuation page 1228682 /-is the identification code of the tag. 63. If the machine-readable medium of item 60 of the patent application scope, the timing of the response is related to the timing of the command. 64. If the machine-readable medium of item 60 of the patent application scope further contains executable instructions, when executed by the machine, the machine can perform the following operations: When no response is received from the plurality of tags, a second command is issued to one or more tags selected from the plurality of tags. 65. If the machine-readable medium of item 60 of the patent application scope further includes executable instructions, the machine can perform the following operations when executed by the machine: When no response is received from the plurality of tags , A second command is issued to test another value defined by a set of bits in the value space. 66. If the machine-readable medium of item 60 of the patent application further includes executable instructions, when executed by the machine, the machine can perform the following operations: Two or more responses from one bit Receive responses in the tag and issue another order based on those responses. 67. If the machine-readable medium of item 66 of the patent application scope, these responses can be identified by observing two or more consecutive bits in a logical state or a logical state that is less than one bit wide. 68. — A machine-readable medium containing executable instructions, when executed by the machine-10- 1228683 〇 ;. When the patent application continues, the machine can perform the following operations: Issue a command to one of a plurality of tags A tag; and receiving a response from the tag, where the response includes the tag's identification code, and the receiving and sending actions do not occur simultaneously. 69. —A machine-readable medium containing executable instructions that, when executed by a machine, can perform the following operations: Receiving a command from a reader to test a numerical space that corresponds to the information stored by the machine; and if the value of the received v bits matches the value of v corresponding bits of the information If so, a response is sent to the reader, where the timing of the response will be the value of m bits of information that should be stored. 70. If the machine-readable medium of item 69 of the patent application scope, in addition to matching the v bits of the v bits in the command and the m bits corresponding to the timing, the response further Includes data that represents part of the information. 71. If the machine-readable medium of item 69 of the patent application, the information is the identification code of the tag. 72. If the machine-readable medium of item 69 of the patent application scope, the timing of the response is related to the timing of the command. 73. If the machine-readable medium of item 71 of the patent application scope, the identification code of the tag will match the identification code of another of the plurality of tags. 74. —A machine-readable medium containing executable instructions. When executed by the machine, the machine can perform the following operations: -11-1228683 'Mou, patent application continued pages receive commands from the reader to test a value The value of the V bits in the space; and if the value of the V bits of the received command matches the value of the first part of the tag identification code, a response is sent to the reader. 75. If the machine-readable medium of item 74 of the patent application, the response includes the identification code. 76. If the machine-readable medium of item 74 of the patent application, the response includes information from the sensor of the machine. 77. If the machine-readable medium of item 74 of the patent application scope, the response includes data from the memory of the machine. 78. If the machine-readable medium of item 74 of the patent application scope, the response includes input / output data from the machine. 79. — A machine-readable medium containing executable instructions which, when executed by a machine of one of the plurality of readers, can be performed by the machine: In response to the result that the first reader of the plurality of readers enters the active mode to perform a communication cycle, it enters a silent mode, wherein after the communication cycle is completed, the first reader enters the silent mode for a first time interval; And when it is detected that no active reader is transmitting in the second time interval, it can enter the active mode after the first virtual random delay period. 80. If the machine-readable medium of item 79 of the patent application scope further includes executable instructions, the machine can perform the following operations when executed by the machine: -12- 1228683 1 The patent application continues to respond to the detection that another reader among the plurality of readers wants to enter the active mode at the same time and enters the silent mode; and when it is detected that there is no active reading during the first virtual random delay period Machine to transmit, it can enter active mode after the second virtual random delay period. 81. If the machine-readable medium of item 80 of the patent application scope, the second entry into the active mode further includes the second entry into the active mode before the first time interval elapses. 82. A device for identifying a label, each label having an identification code, the device comprising: a processor for providing first data; A transmitter for transmitting the first data to the plurality of tags; and a receiver for receiving the first command response from the tag and providing it to the processor, the response transmitted by the tag, wherein the response Related to a bit in a plurality of bits, the bit is equivalent to a selected byte value stored in the information of the tag, and the selected byte is a function of the first data. 83. If the device of the scope of the patent application is No. 82, the response contains a value of another byte of the information. 84. In the case of a device under the scope of patent application No. 82, the response contains information from a second piece of information that is different from the information. 85. The device according to item 82 of the patent application, wherein each of the plurality of bits is related to a corresponding preset time delay of the response. 86. For the device in the scope of patent application No. 82, in which every -13 of the plurality of bits-patent application range continued I2286834,29 One bit is related to the corresponding preset signal from the reader. 87. The device of claim 82, wherein each of the plurality of bits is related to a time delay that is different from another bit of the plurality of bits. 88. A tag, comprising: a receiver for receiving first data from a reader; A control unit for associating the first data with a part of the information stored in the tag; and a transmitter for transmitting from the control unit if the first data matches the part of the information In response, to the reader, the response is related to a bit in a plurality of bits, which is equivalent to the value of the selected byte stored in the information of the tag. The selected The bytes are a function of the first data. 89. If the label in the scope of patent application No. 88, further includes: An antenna for receiving a signal from the reader, the signal including the first data from the reader; and a receiving / transmitting switch for selectively allowing the antenna to transmit or receive a signal. 90. In the case of applying for a label in the 88th area of the patent application, the response includes the identification code of the label. 91. For the label under the scope of patent application No. 88, the information is the identification code of the label. 92. For example, the label in the 88th area of the patent application, wherein each of the plurality of bits is related to a corresponding preset time delay of the response. -14- The scope of application for patents is continued on 1228683. < Total 4 93. — A device for identifying tags, each tag has an identification code, the device includes: a processor for transmitting at least one command, A numerical space is divided into n bits, where each bit is related to m bits of the numerical space, and the numerical space contains the identification code of the tag; a transmitter for transmitting at least one Command to test the v bits in the numerical space; and A response is received from the tag and the data from the response is provided to the receiver of the processor, wherein the response only occurs when the first part of the tag's identification code matches the value of the v bits. The timing will correspond to a special bit, and the special bit will be related to the special value of m bits in the second part of the identification code. 94. For the device under the scope of patent application No. 93, the timing of the response is related to the timing of the command. 95. If the device under the scope of patent application is No. 93, when no response is received from the plurality of tags, the device will send a second order to one or more tags selected from the plurality of tags . 96. If the device under the scope of patent application No. 93, wherein the device will receive a response of two or more tags in one bit, the device will send another order based on the responses. 97. For the device under the scope of application for patent No. 96, these responses can be identified by observing more than two consecutive bits in a logical state or a logical state that is less than one bit wide. 98. — A tag among a plurality of tags, each tag having an identification code -15-Patent Application Continued Page 122868 ", the tag includes: a receiver that receives a command from a reader, the command includes a V bits in the numerical space; a processor for comparing the V bits received with the first part of the tag identification code; and A transmitter, if the received V bits match the first part of the identification code, send a response from the processor to the reader, wherein the timing of the response corresponds to the second part of the identification code section. 99. In the case of applying for the label of item 98, the response further includes the third part of the identification code. 100. If the label of the scope of application for item 99 is applied, the second part is equal to at least one part of the third part. 101. The label of the scope of application for item 98, wherein the first part of the identification code starts from a specific bit position in the identification code. 102. If the label of the scope of patent application is No. 98, the timing of the response is related to the order. 103. The tag of claim 98, further comprising: an antenna for receiving a signal from the reader, the signal including the command from the reader; and a receiver coupled to the antenna and the receiver ΗA dedicated input switch, in response to the control result of the processor, the receiving / transmitting switch can selectively allow the receiver to receive the command and selectively transmit the response from the antenna. 104. If the label of the scope of patent application is 98, the response is from the reader -16-122860. ~-, --M:-Bu Beibei · S Application for the scope of patent continuation of the second order (see Including a set of bits in the numerical space). When the set of bits matches the corresponding part of the tag ID, the tag sends another response, where the other response includes the ID. 105. A reader for identifying one of a plurality of tags, each tag having an identification code stored in a memory, the reader comprising: a device for broadcasting a command having first data Building blocks; and A means for receiving a response to the command from a tag; wherein the response is related to a bit in a plurality of bits, the bit corresponding to a selected byte value stored in the tag's information, the The selected byte is a function of the first data. 106. If the reader of the scope of the patent application is No. 105, the response contains the value of another byte of the information. 107. If the reader of the scope of the patent application is No. 105, the response contains information from a second information different from the information. 108. For the reader of the scope of application for patent No. 105, the information is the identification code of the tag. 109. For example, the reader of the scope of application for patent No. 105, wherein each of the plurality of bits is related to a corresponding preset time delay of the response. 110. A tag among a plurality of tags, each tag having an identification code, the tag includes: a component for receiving the first data from the reader; and for storing the first data with the selected storage in The component of the machine memory's information for the associated processing of the bytes, the selected bits-17- Patent Application Continued Page '' P I2286fc;,; a function of the tributary material, and a Component, if the first data is related to the byte, the response can be transmitted to the reader, the response is related to one of the plurality of bits, where the bit of the response is to the bit that should be selected The value of the tuple. 111. If the label of the scope of patent application is 110, the response contains a value of another byte of the information. 112. If the label of the scope of patent application is No. 110, the information is the identification code of the label. 113. For example, the label in the scope of application patent 110, wherein each of the plurality of bits is related to a corresponding preset time delay of the response. 114. A reader for identifying one of a plurality of tags, each of the plurality of tags having an identification code, the reader comprising: A component for issuing a command to test a value defined by V bits in a value space, the value space having n bits, where each bit is different from a value defined by m bits in the value space Relevant, and the numerical space will be related to the information stored in the memory of the plurality of tags, n is an integer greater than 2; and a means for receiving a response from one of the plurality of tags, The response occurs only when the ν bytes of the information stored in the tag match the ν bits of the command, and the timing of the response will correspond to one of the n bits, and the The bit-related m bit values will match the m bit values selected from the selected information. -18- 1228683 Application for Patent Scope Continued · ^ ψ 115. For the reader of patent application No. 114, except for ν bits matching the ν bits in the order and the ν bits related to the bit Beyond m bits, the response further includes a portion of the information. 116. If the reader of the scope of application for patent No. 114, the information includes the identification code of the label. 117. If the reader of the scope of application for patent No. 114, the timing of the response is related to the timing of the command. 118. If the reader of the scope of application for patent No. 114, when no response is received from the plurality of tags, further includes issuing a second order to one or more tags selected from the plurality of tags. 119. If the reader of the scope of patent application No. 114, wherein: the means for receiving can further receive a response from two or more tags responding in one bit; and the means for issuing an order can According to these responses, another order is issued. 120. For example, the reader of patent application No. 119, in which the component for receiving can be observed by a logical state or two logical states whose width is less than one bit wide The above consecutive bits identify such responses. 121. If the reader of the scope of application for patent No. 114, the component for issuing a command may further issue a second command to a tag, and the component for receiving may further receive a response from the tag, where the response includes The identification code of the label, and the receiving and sending actions will not be performed at the same time 122.—A label among a plurality of labels, each of which has an identification code -19-1228683 Patent Application Continued Page '> w The tag includes: a component for receiving a command from a reader to test V bits in a numerical space, the numerical space corresponding to the information stored in the plurality of tags; and A component, if the value of the received V bits matches the value of the V corresponding bits of the information, a response can be sent to the reader, wherein the timing of the response is to the information that should be stored. The value of m bits. 123. If the label of the scope of patent application No. 122, in addition to matching the v bits of the v bits in the command and the m bits corresponding to the timing, the response further includes representing the information Part of the information. 124. In the case of applying for a label in the scope of patent application No. 122, the information includes the identification code of the label. 125. If the label of the scope of patent application is No. 122, the timing of the response is related to the timing of the order. 126. A tag among a plurality of tags, each tag having an identification code, the tag including: a component for receiving a command from a reader to test the value of v bits in a value space; and A component, if the value of the v bits of the received command matches the value of the first part of the tag identification code, a response can be sent to the reader, where the response includes the tag's identification code. 127. — A reader among a plurality of readers, for identifying one of the plurality of tags, each of the plurality of tags is -20-1228683 Patent Application Continued Page ψ has a An identification code, the reader includes: a component for responding to the result that the first reader of the plurality of readers enters an active mode and executes a communication cycle to enter a mute mode, wherein after the communication cycle is completed, The first reader enters the silent mode to maintain a first time interval; and a component, when it is detected that there is no active reader for transmission in the second time interval, it can enter the active mode after the first virtual random delay period 128. The reader of the scope of application for patent 127, further comprising: a component for entering the silent mode in response to detecting that another reader among the plurality of readers simultaneously wants to enter the active mode; And a component, when it is detected that no active reader is transmitting during the first virtual random delay period, it can enter the active mode after the second virtual random delay period. 129. The reader of claim 127, wherein the means for entering the active mode for a second time further comprises: when it is detected that no active reader is transmitting during the first virtual random delay period, Then, the active mode can be entered a second time after the second virtual random delay period elapses and before the first time interval elapses. -twenty one -