Fast RFID tag identifying method

Abstract

A fast RFID tag identifying method includes an encoding step for encoding a pair of bits to be expressed by an RFID tag into a silence code to be used in a transmitting step for the RFID tag. The silence code is arranged such that the superposition of a plurality of silence codes from a plurality of RFID tags is decoded into a set of pairs of bits to be expressed by the RFID tags.

Claims

1. A fast RFID tag identifying method, comprising: an encoding step for encoding a bit pair to be expressed by an RFID tag into a silent code to be used in a transmitting step for the RFID tag, wherein the silent code is arranged such that the superposition of a plurality of silent codes from a plurality of RFID tags is decoded into a set of bit pairs to be expressed by the RFID tags, wherein the encoding step is performed by the RFID tag itself; a signal form of the silent code is based on a Manchester code; types of the silent code include , 0 and 1, in which is representative of no signal, 0 is representative of a low-to-high signal, and 1 is representative of a high-to-low signal; and different bit pairs correspond to different silent codes, and each of the different silent codes has two symbols with one symbol being .

2. The fast RFID tag identifying method as claimed in claim 1, wherein bit pairs 00, 01, 10 and 11 correspond to silent codes 0, 0, 1 and 1, respectively.

3. The fast RFID tag identifying method as claimed in claim 1, wherein types of the superposition of silent codes include , 0, 1 and X, in which is representative of no signal, 0 is representative of a low-to-high signal, 1 is representative of a high-to-low signal, and X is representative of a signal collision.

4. The fast RFID tag identifying method as claimed in claim 3, wherein the superposition of silent codes , 0, 0, 1, 1, 00, 10, X, X, 01, 11, X0, 0X, 1X, X1 and XX correspond to sets of bit pairs { }, {00}, {01}, {10}, {11}, {00, 01}, {00, 10}, {00, 11}, {01, 10}, {01, 11}, {10, 11}, {00, 01, 10}, {00, 01, 11}, {00, 10, 11}, {01, 10, 11} and {00, 01, 10, 11}, respectively.

5. The fast RFID tag identifying method as claimed in claim 1, further comprising: the transmitting step for transmitting the silent code by the RFID tag, wherein, during transmission, the silent code is superposed with another silent code transmitted from another RFID tag and turns into a superposed silent code; a receiving step for receiving the superposed silent code by a reader; and a decoding step for decoding the superposed silent code into a set of bit pairs.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

(1) FIG. 1 is a block diagram showing the transmitting process for a tag and the receiving process for a reader according to the present invention;

(2) FIG. 2 is a flowchart showing a fast RFID tag identifying method according to the present invention;

(3) FIG. 3 shows signal forms of Manchester codes; and

(4) FIG. 4 shows signals received by a reader when there are two tags responding at the same time.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

(5) The present invention provides a fast RFID tag identifying method. The aforementioned method is mainly based on silence codes according to the present invention.

(6) FIG. 1 shows a block diagram showing the transmitting process of a tag and the receiving process of a reader according to the present invention.

(7) As shown in FIG. 1, in a transmitting terminal, if a bit pair A is to be expressed by a tag P, the bit pair A must be encoded into a silence code C to be transmitted. During transmission, the silence code C may be superposed with another silence code D from another tag Q, and a signal pair E is then formed. In a receiving terminal, a reader receives the signal pair E, and it further decodes the signal pair E into a set of bit pairs (including exactly the bit pair A and the bit pair B).

(8) FIG. 2 is a flowchart showing a fast RFID tag identifying method according to the present invention.

(9) As shown in FIG. 2, step S1 is an encoding step, which is provided for a tag to encode a bit pair to be expressed by the tag into a silence code to be used in a transmitting step. It is noted that, the silence code according to the present invention is arranged such that the superposition of silence codes of tags is decoded into a set of bit pairs to be expressed by the tags. The arrangement of the silence codes, that is, the encoding and decoding of the silence codes, will be discussed hereinafter.

(10) Step S2 is a transmitting step, which is provided for a tag to transmit the silence code. The present invention is for passive tags. A passive tag can only transmit a response wave passively after it receives an inquiry wave transmitted from a reader. During transmission, the silence code may remain unchanged, or may be superposed with another silence code transmitted from another tag and form a superposed silence code. The superposed silence code comes from the superposition of the electromagnetic signals of the silence codes. Step S3 is a receiving step, which is provided for a reader to receive the superposed or un-superposed silence code. Step S4 is a decoding step, which is provided for a reader to decode the superposed silence code into a set of bit pairs.

(11) FIG. 3 shows signal forms of Manchester codes.

(12) As shown in FIG. 3, signals in a form of a Manchester code are distinguished by voltage variations in a clock cycle. For a Manchester code according to G. E. Thomas convention, a signal with a voltage varying from low to high is defined as signal 0, and a signal with a voltage varying from high to low is defined as signal 1, while, for a Manchester code according to IEEE 802.3 convention, a signal with a voltage varying from high to low is defined as signal 1, and a signal with a voltage varying from low to high is defined as signal 0. However, both definitions can be used as a basis of the signal folios of the silence codes according to the present invention.

(13) FIG. 4 shows signals received by a reader when there are two tags, the tag P and the tag Q, responding at the same time.

(14) When signals from the two tags collide and turn into a signal X, in the prior art, the reader is unable to decode the signal X because there is no transition in the corresponding clock cycle, and further processes are needed to re-identify the two tags one after another, resulting in a process delay. In contrast, by encoding the signals into the silence codes according to the present invention, the reader is able to decode the signal X, so that the tag identifying process can be accelerated.

(15) The encoding table of the silence codes according to the present invention is shown in TABLE 1.

(16) TABLE-US-00001 TABLE 1 Bit pairs Silence codes 00 0 01 0 10 1 11 1

(17) In TABLE 1, the symbols 0 and 1 of the bit pairs are referred to as logic 0 and logic 1, respectively. While, the symbols , 0 and 1 of the silence codes are referred to as no signal, a low-to-high signal and a high-to-low signal, respectively.

(18) As shown in TABLE 1, different bit pairs 00, 01, 10 and 11 correspond to different silence codes 0, 0, 1 and 1, respectively, and each of the silence codes has two symbols. It is noted that each of the silence codes has one symbol , which stands for no signal.

(19) The encoding step can be achieved by looking up TABLE 1 and mapping a bit pair into a silence code.

(20) The decoding table of the silence codes according to the present invention is shown in TABLE 2.

(21) TABLE-US-00002 TABLE 2 Signal pairs Sets of bit pairs { } 0 {00} 0 {01} 1 {10} 1 {11} 00 {00, 01} 10 {00, 10} X {00, 11} X {01, 10} 01 {01, 11} 11 {10, 11} X0 {00, 01, 10} 0X {00, 01, 11} 1X {00, 10, 11} X1 {01, 10, 11} XX {00, 01, 10, 11}

(22) In TABLE 2, the symbols , 0, 1 and X of the signal pairs are referred to no signal, a low-to-high signal, a high-to-low signal and a signal collision, respectively. It is noted that TABLE 2 is derived on the basis of the superposition of the silence codes. As previously described with reference to FIG. 1, the silence code C may remain unchanged or may be superposed with another silence code D, and turn into the signal pair E. Accordingly, possible cases of signal pairs coming from unchanged silence codes or superposed silence codes are listed in TABLE 2. The rules for the superposition of silence codes are explained as follows: superposition of and turns into , superposition of and 0 turns into 0, superposition of and 1 turns into 1, and superposition of 0 and 1 turns into X. Furthermore, the commutative property is valid for the aforementioned rules.

(23) If a reader receives a signal pair , it can determine that no tag responds; in other words, the number of responding tags is 0. Obviously, no bit pair will be derived in this case, so the set of bit pairs is an empty set { }.

(24) If the reader receives a signal pair 0, 0, 1 or 1, it can determine that at least one tag responds. Since these four kinds of the signal pairs are exactly the typical silence codes as shown in TABLE 1, their corresponding sets of the bit pairs are {00}, {01}, {10} and {11}, respectively.

(25) If the reader receives a signal pair 00, 10, X, X, 01 or 11, it can determine that at least two tags respond, and that the signal pair must come from the superposition of the silence codes. For example, a bit pair 00 to be expressed by a tag P is encoded as the silence code 0 according to TABLE 1, and a bit pair 01 to be expressed by a tag Q is encoded as the silence code 0 according to TABLE 1. When the tag P and the tag Q respond at the same time, the silence code 0 and the silence code 0 are superposed and turn into a superposed signal pair 00. Therefore, if the reader receives the superposed signal pair 00, it can determine that the superposed signal pair 00 comes from the superposition of the silence code 0 and the silence code 0, and then derive the set of the bit pairs as {00, 01}.

(26) The aforementioned process is also applied to superposed signal pairs 10, X, X, 01 and 11 to obtain that their corresponding sets of the bit pairs are {00, 10}, {00, 11}, {01, 10}, {01, 11} and {10, 11}, respectively.

(27) If the reader receives a superposed signal pair X0, 0X, 1X or X1, it can determine that at least three tags respond, and that the signal pair must come from the superposition of the silence codes. For example, according to TABLE 1, a bit pair 00 to be expressed by a tag P is encoded as the silence code 0, a bit pair 01 to be expressed by a tag Q is encoded as the silence code 0, and a bit pair 10 to be expressed by a tag R is encoded as the silence code 1. When the tags P, Q, and R respond at the same time, the silence codes 0, 0, and 1 are superposed and turn into a superposed signal pair X0. Therefore, if the reader receives the superposed signal pair X0, it can determine that the superposed signal pair X0 comes from the superposition of the silence codes 0, 0 and 1, and then can derive the set of the bit pairs as {00, 01, 10}.

(28) The aforementioned process is also applied to superposed signal pairs 0X, 1X and X1 to obtain that their corresponding sets of the bit pairs are {00, 01, 11}, {00, 10, 11} and {01, 10, 11}, respectively. If the reader receives a superposed signal pair XX, it can determine that at least four tags respond. The superposed signal pair XX is the superposition of the silence codes 0, 0, 1 and 1, which correspond to the bit pairs 00, 01, 10 and 11, respectively, so the set of the bit pairs can be derived as {00, 01, 10, 11}.

(29) So far, the process to obtain the encoding table as shown in TABLE 1 and the decoding table as shown in TABLE 2 of the silence codes according to the present invention has been discussed. It is to be understood that, TABLE 1 and TABLE 2 are only an exemplary embodiment. Based on the spirit of the present invention, various embodiments are possible by, for example, adjusting correspondence between the bit pairs and the silence codes, or increasing the number of bits and the number of the symbols of the silence codes, or introducing other kinds of signal forms to be the basis of the silence codes. It should be emphasized that, the silence codes according to the present invention is encoded such that they can be decoded even if signal collision occurs during transmission.

(30) The decoding step can be achieved by looking up TABLE 2 and mapping a signal pair into a set of bit pairs.

(31) In conclusion, with the silence codes according to the present invention, even if a plurality of tags respond at the same time to result in signal collision, the reader can still decode the tag ID pairs at the same time without further processing, so that the tag identifying process can be significantly accelerated.

(32) Although the present invention has been explained in relation to its preferred embodiment, it is to be understood that combinations, modifications, or substitution or conversion can be made without departing from the spirit of the present invention. The scope of the present invention is not limited to the aforementioned embodiments, but is accorded to the claims hereafter.