A high-performance RFID reading and writing method supporting multiple protocols

Abstract

This invention provides a high-performance RFID read / write method supporting multiple protocols, selecting a predictor based on the predicted rate from historical protocols. The predictor includes a tag type-based predictor and a tag communication protocol-based predictor. If a tag type-based predictor is selected, a static or dynamic predictor is chosen based on whether pre-stored information is available. If a tag communication protocol-based predictor is selected, a dynamic predictor using a single-mode or dual-mode tag communication protocol is chosen based on whether priority communication protocols are available. Communication is established with the RFID chip based on the predictor's prediction results. The advantages are the introduction of multiple prediction mechanisms, including static, single-mode, and dual-mode predictions, comprehensively utilizing information such as the usage ratio of electronic tags, the communication protocols supported by electronic tags, and historical successful tag reading protocols to accurately predict the communication protocol currently supported by the tag, shortening the electronic tag chip reading time, and thus greatly improving read / write efficiency and production line efficiency.

Description

Technical Field

[0001] This invention relates to the field of RFID chip reading and writing, and in particular to a high-performance RFID reading and writing method that supports multiple protocols. Background Technology

[0002] Currently, RFID anti-counterfeiting systems for product anti-counterfeiting require the writing of information such as TID and UID during the production process. When multiple models and types of RFID tag chips are used for different products within the same category, the communication protocols supported by each chip differ (supporting one protocol or multiple protocols simultaneously), and these chips are randomly distributed on the production line, making chip classification impossible. When using a reader to read or write to a specific RFID tag chip on a product, the randomness of the tag model makes it impossible to know in advance which communication protocol it supports. Multiple queries must be performed on the chip using a single polling and single protocol switching operation until a compatible communication protocol is found before a normal communication mechanism can be established for subsequent read / write operations. This method significantly increases processing time and greatly impacts production efficiency.

[0003] Therefore, how to provide a query method that can obtain the communication protocols supported by the current chip through a single query action has become an urgent problem to be solved. Summary of the Invention

[0004] This invention provides a high-performance RFID read / write method that supports multiple protocols, thereby solving the problems of cumbersome steps and high time consumption in the existing RFID read / write chip process.

[0005] To achieve the above objectives, the present invention provides a high-performance RFID read / write method supporting multiple protocols. The method includes: selecting a predictor type based on historical protocol prediction rates. A predictor with a historical protocol prediction rate higher than a threshold is selected as the current predictor. These predictors include predictors based on RFID tag type and predictors based on tag communication protocols. If the predictor based on RFID tag type is selected, the predictor type is further selected based on whether pre-stored information exists. If so, a static predictor based on RFID tag type is selected; otherwise, a dynamic predictor based on RFID tag type is selected. If the predictor based on tag communication protocol is selected, a priority communication protocol is obtained. If no priority communication protocol is obtained, a dynamic predictor using a single-mode tag communication protocol is selected; otherwise, a dynamic predictor using a dual-mode tag communication protocol is selected. After the predictor selection is complete, communication is established with the RFID chip using the corresponding communication protocol based on the predictor's prediction result to perform read / write operations.

[0006] As a preferred embodiment of the above technical solution, the static predictor based on the type of electronic tag includes: calculating the communication probability of each communication protocol type according to the pre-stored information containing the electronic tag ratio information and supported protocol type information; sorting the communication protocols in the supported protocol types according to the communication probability; and establishing communication with the RFID chip sequentially using different communication protocols according to the sorting result.

[0007] As a preferred embodiment of the above technical solution, the dynamic predictor based on the type of electronic tag includes: retrieving historical information, calculating and sorting the support probability of each communication protocol, and sequentially using the corresponding communication protocol to establish communication with the RFID chip in descending order of the support probability of each communication protocol.

[0008] As a preferred embodiment of the above technical solution, preferably, communication is established with the RFID chip by sequentially using the corresponding communication protocols in descending order of their support probability, and further includes: recording the types of communication protocols that have been successfully established, recalculating the support probability of this communication protocol, and updating the historical information.

[0009] As a preferred embodiment of the above technical solution, the dynamic predictor of the single-modal tag communication protocol obtains the communication protocol that was successfully established in the previous communication, uses the communication protocol to predict the current communication establishment operation and thus establish communication, and if the establishment fails, retrieves the remaining communication protocols to predict the current communication operation and changes the state of the communication protocol that was successfully established in the previous communication.

[0010] As a preferred embodiment of the above technical solution, preferably, in the dynamic predictor of the dual-modal tag communication protocol, each communication protocol has a strong state and a weak state, and there is a weak state of any adjacent communication protocol between the strong states of two adjacent different communication protocols.

[0011] During prediction, the communication protocol currently in a strong state is selected for prediction. If successful, the current state of all communication protocols is maintained. Otherwise, the current communication protocol is adjusted to a weak state and a second attempt is made. If successful, the communication protocol is restored to a strong state. Otherwise, the weak state is maintained and other communication protocols are used for prediction.

[0012] As a preferred embodiment of the above technical solution, it is preferable to use other communication protocols for prediction, including: if another communication protocol is successfully read / written, it is adjusted to a weak state, and this communication protocol is used preferentially for prediction in the next prediction; if this communication protocol successfully establishes communication with RFID again, the state of this communication protocol is a strong state; otherwise, other communication protocols are used for prediction.

[0013] This invention provides a high-performance RFID read / write method supporting multiple protocols, selecting the predictor type based on historical protocol prediction rates. Predictors with historical protocol prediction rates exceeding a threshold are selected as the current predictor. These predictors include those based on RFID tag type and those based on tag communication protocols. If an RFID tag type-based predictor is selected, the predictor type is further selected based on whether pre-stored information exists. If so, a static predictor based on RFID tag type is selected; otherwise, a dynamic predictor based on RFID tag type is selected. If a tag communication protocol-based predictor is selected, a priority communication protocol is obtained. If no priority communication protocol is obtained, a dynamic predictor using a single-mode tag communication protocol is selected; otherwise, a dynamic predictor using a dual-mode tag communication protocol is selected. After the predictor selection is complete, communication is established with the RFID chip using the corresponding communication protocol based on the predictor's prediction results to perform read / write operations.

[0014] The advantage of this invention is that the information acquisition method proposed in this invention supports multiple protocols. This method introduces multiple prediction mechanisms such as static, single-modal, and dual-modal, and comprehensively utilizes information such as the usage ratio of electronic tags, the communication protocols supported by electronic tags, and the successful reading protocols of electronic tags in history. This enables the system to accurately predict the communication protocols supported by the current tag, shorten the electronic tag chip reading time, and thus greatly improve the reading and writing efficiency and production line efficiency. Attached Figure Description

[0015] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0016] Figure 1 This is a flowchart of the present invention.

[0017] Figure 2 This is a schematic diagram of a dynamic predictor for a single-modal tag communication protocol when two communication protocols are available, as provided in an embodiment of the present invention.

[0018] Figure 3 This is a schematic diagram of a dynamic predictor for a single-modal tag communication protocol when three communication protocols are available, as provided in an embodiment of the present invention.

[0019] Figure 4 This is a schematic diagram of a dynamic predictor for a dual-modal tag communication protocol when two communication protocols are available, as provided in an embodiment of the present invention.

[0020] Figure 5This is a schematic diagram of a dynamic predictor for a dual-modal tag communication protocol when three communication protocols are available, as provided in an embodiment of the present invention.

[0021] Figure 6 This is a schematic diagram of the RFID chip polling structure in a specific embodiment of the present invention. Detailed Implementation

[0022] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0023] The process of this invention will now be described, and a brief overview is as follows: Figure 1 As shown:

[0024] Step 101: Select the predictor type based on the historical protocol prediction rate.

[0025] Specifically, select the predictor whose historical protocol prediction rate is higher than the threshold as the current predictor. If the predictor is selected based on the electronic tag type, proceed to step 102; otherwise, select the predictor based on the tag communication protocol and proceed to step 103.

[0026] Step 102: Determine if there is pre-stored information. If so, proceed to step 104; otherwise, proceed to step 105.

[0027] Specifically, if the electronic tag type predictor is selected, the predictor type is further selected based on whether there is pre-stored information. If so, step 104 is executed to select a static predictor based on electronic tag type; otherwise, step 105 is executed to select a dynamic predictor based on electronic tag type.

[0028] For step 104: Based on the electronic tag ratio information and supported protocol type information contained in the pre-stored information, this predictor calculates the communication probability of each communication protocol type according to the pre-stored information, sorts the communication probabilities (from high to low), obtains the order of protocol types (from high to low), and uses different communication protocols to establish communication with the RFID chip in sequence according to the order from high to low.

[0029] For step 105: retrieve historical information (historical communication establishment information), calculate and sort the support probability of each communication protocol, and establish communication with the RFID chip in descending order of support probability. Furthermore, after successful establishment, record the types of communication protocols that have been successfully established, recalculate the support probability of this communication protocol, and update the historical information for future use.

[0030] Step 103: Determine if there is a priority communication protocol. If so, proceed to step 106; otherwise, proceed to step 107.

[0031] Step 106: Use a dynamic predictor based on a single-modal tag communication protocol for prediction.

[0032] The dynamic predictor of the single-modal tag communication protocol obtains the communication protocol of the previous successfully established communication, uses the communication protocol to predict the current communication establishment operation and thus establish communication. If the establishment fails, it retrieves the remaining communication protocols to predict the current communication operation and changes the state of the communication protocol of the previous successfully established communication.

[0033] Step 107: Use a dynamic predictor based on a dual-modal tag communication protocol for prediction.

[0034] In the dynamic predictor of the dual-modal tag communication protocol, each communication protocol has a strong state and a weak state. Between any two adjacent strong states of different communication protocols, there is a weak state of any adjacent communication protocol. During prediction, the currently strong communication protocol is first selected for prediction. If successful, the current strong / weak state of all communication protocols is maintained. Otherwise, the current communication protocol is adjusted to a weak state, and a second attempt is made. If successful, this communication protocol is restored to a strong state; otherwise, it remains weak, and another communication protocol is used for prediction. If communication is successfully established using another communication protocol, it is adjusted to a weak state. In the next prediction, this communication protocol is given priority. If this communication protocol successfully establishes communication with the RFID chip again, its state is adjusted to a strong state; otherwise, another communication protocol is used for prediction.

[0035] Step 106: After successfully establishing communication, perform read and write operations.

[0036] Specifically, based on the prediction results of the predictor, the corresponding communication protocol is used to establish communication with the RFID chip to perform read and write operations.

[0037] The principles of the four predictors provided by this invention will now be further explained:

[0038] For static predictors based on electronic tag type:

[0039] During a complete polling process, this static predictor statically determines the order in which communication protocols are used, thereby attempting different communication protocols. The predictor contains pre-entered data on the proportions of various electronic tags used by the RFID chips awaiting reading and writing, as well as the types of communication protocols supported by these tags. Based on the entered proportions and the corresponding supported communication protocols, the predictor calculates the communication probability for each protocol and, during polling, prioritizes the communication protocol with the highest probability for communication attempts.

[0040] Specifically, the RFID anti-counterfeiting system uses N types of electronic tags, numbered 1, 2, ..., N, and supporting communication protocols proto1, proto2, ..., protoN, with usage ratios of p1, p2, ..., pN. A total of k communication protocols are identified: Pro1, Pro2, ..., Prok. For the first communication protocol, Pro1, the corresponding electronic tag is Tag1[i1], where i1 is the set of all electronic tags supporting Pro1. For the second communication protocol, Pro2, the corresponding electronic tag is Tag2[i2], where i2 is the set of all electronic tags supporting Pro2. For the kth communication protocol, Prok, the corresponding electronic tag is Tagk[ik], where ik is the set of all electronic tags supporting Prok.

[0041] Therefore, for any given label,

[0042] The probability that it supports the first communication protocol is: P(Pro1)=∑p(Tag1[i1]).

[0043] The probability that it supports the second communication protocol is: P(Pro2)=∑p(Tag2[i2]).

[0044] The probability that it supports the k-th communication protocol is P(Prok) = ∑p(Tagk[ik]).

[0045] Based on the values ​​of P(Pro1), P(Pro2), ..., P(Prok), the order in which communication protocols are tried during the polling process is determined, arranged in order of probability, with the protocol with the highest probability being tried first. If unsuccessful, the second-ranked communication protocol is tried until successful, and the communication protocol that successfully establishes communication is recorded. The next protocol polling order is obtained by repeating the above attempts.

[0046] For dynamic predictors based on electronic tag type:

[0047] During a complete polling cycle, this dynamic predictor dynamically determines the order in which communication protocols will be used in the next complete polling cycle, thus mitigating the attempts of different communication protocols. Unlike static predictors based on RFID tag type, this predictor can utilize historical information for dynamic prediction.

[0048] The predictor requires the reader / writer to save the proportion of various electronic tag types and the corresponding supported communication protocols used in several successful entries before the current tag entry. The predictor will calculate the support probability based on the entry proportion and the corresponding electronic tag's supported communication protocol, and in the polling process, it will prioritize using the communication protocol with the higher support probability to attempt communication.

[0049] Specifically, in the RFID anti-counterfeiting system, the previous 'a' successfully entered electronic tags have corresponding numbers 1, 2, ..., a, and their supported communication protocols are proto1, proto2, ..., protoa, respectively. Their usage ratios are p1, p2, ..., pa, and there are a total of k communication protocols, namely Pro1, Pro2, ..., Prok.

[0050] For the first communication protocol Pro1, the corresponding electronic tag is Tag1[i1], and i1 belongs to the set of all electronic tags that support the communication protocol Pro1.

[0051] For the second communication protocol Pro2, the corresponding electronic tag is Tag2[i2], and i2 belongs to the set of all electronic tags that support the communication protocol Pro2.

[0052] For the k-th communication protocol Prok, its corresponding electronic tag is Tagk[ik], where ik belongs to the set of all electronic tags that support the communication protocol Prok.

[0053] Therefore, based on historical information, for any given label:

[0054] The probability that it supports the first communication protocol is P(Pro1)=∑p(Tag1[i1]).

[0055] The probability that it supports the second communication protocol is P(Pro2)=∑p(Tag2[i2]).

[0056] The probability that it supports the k-th communication protocol is P(Prok) = ∑p(Tagk[ik]).

[0057] Based on the values ​​of P(Pro1), P(Pro2), ..., P(Prok), the order of communication protocols to be tried during the polling process is determined. P(Pro1), P(Pro2), ..., P(Prok) are arranged in order of size, and those with higher probabilities are tried first, thus obtaining the protocol polling order for the next time.

[0058] For a dynamic predictor of a single-modal tag communication protocol: This predictor predicts the highest priority communication protocol for the next read / write operation based on the protocol used in the previous successful connection establishment. For example, if there are two protocol types in the anti-counterfeiting system, the dynamic predictor for the single-modal tag communication protocol is a two-state machine. If the protocol used to establish the connection in the previous successful read / write operation was A, then the highest priority protocol for the current read / write operation is predicted to be A; if the protocol used to establish the connection in the previous successful read / write operation was B, then the highest priority protocol for the current read / write operation is predicted to be B. For example... Figure 2 As shown in the diagram, the circles represent the status of the protocol that the current reader prioritizes, and the quantities in the horizontal lines represent the conditions for switching, that is, the protocol used to establish the connection in the previous read / write process. With each read / write operation, the switching conditions (the protocol used) are constantly changing, which in turn affects the status (the preferred protocol).

[0059] The states on the left of the diagram represent the highest priority of protocol A, and the states on the right represent the highest priority of protocol B. There is a direct transition between protocol A (highest priority) and protocol B (highest priority). A successful read / write operation is required to reverse the priority from highest to highest.

[0060] state Agreement A Agreement B status bit 0 1

[0061] When in state 0, protocol A is predicted to have the highest priority. Reading and writing using protocol A: if successful, protocol A remains in state 0; if it fails, protocol A is adjusted to state 1. When in state B1, protocol B is predicted to have the highest priority. Reading and writing using protocol B: if successful, protocol B remains in state 1; if it fails, protocol B is adjusted to state 0.

[0062] If the anti-counterfeiting system has 3 protocol types, such as Figure 3 As shown: At this point, the dynamic predictor of the single-mode tag communication protocol is a three-state machine. If the protocol that established the connection in the previous successful read / write was A, then the protocol with the highest priority for the current read / write is predicted to be A; if the protocol that established the connection in the previous successful read / write was B, then the protocol with the highest priority for the current read / write is predicted to be B; if the protocol that established the connection in the previous successful read / write was C, then the protocol with the highest priority for the current read / write is predicted to be C. The determination of the secondary priority is based on the static method described above.

[0063] In the diagram, the circle indicates the protocol state that the reader currently prioritizes, and the quantity in the horizontal line indicates the transition condition, that is, the communication protocol that successfully established a connection in the previous read / write process. As the transition condition changes, the state will change, and the change pattern is shown below.

[0064] The states on the left of the diagram represent protocol A with the highest priority, the states on the right represent protocol B with the highest priority, and the states at the bottom represent protocol C with the highest priority. A direct conversion from highest priority protocol A to highest priority protocol B or protocol C is possible. A reversal from highest priority protocol A to highest priority protocol B or protocol C requires a successful read / write operation.

[0065] To simplify the description, the status bits are defined as follows, which can also serve as an implementation example.

[0066] state Agreement A Agreement B Protocol C status bit 00 01 10

[0067] When in state 00, it means that protocol A was predicted to have the highest priority in the last read / write operation, and protocol A will be used first for read / write. If protocol A is successfully read / written, the three-state machine is still in state 00. If protocol A fails, protocol B and protocol C will be used for read / write. If protocol B is successfully read / written, the three-state machine will be adjusted to state 01. If protocol C is successfully read / written, the three-state machine will be adjusted to state 10.

[0068] When in state 01, it means that protocol B was predicted to have the highest priority in the last read / write operation, and protocol B will be used first for read / write. If protocol B is successfully read / written, the three-state machine is still in state 01. If protocol B fails, protocol A and protocol C will be used for read / write. If protocol A is successfully read / written, the three-state machine will be adjusted to state 00. If protocol C is successfully read / written, the three-state machine will be adjusted to state 10.

[0069] When in state 10, it means that the prediction protocol C had the highest priority in the last read / write operation, and protocol C is used first for read / write. If protocol C is successfully read / written, the three-state machine is still in state 10. If protocol A is successfully read / written, the three-state machine is adjusted to state 00. If protocol B is successfully read / written, the three-state machine is adjusted to state 01. Overall, the prediction accuracy of the single-mode predictor can reach more than 60%.

[0070] Dynamic Predictor for Dual-Modal Tag Communication Protocol: Compared to the dynamic predictor for single-modal tag communication protocols, this predictor utilizes more information and has higher prediction accuracy. It predicts the next communication protocol based on the communication protocols of the two previous successful communication connections. This predictor sets the preferred communication protocol used during the reader's current polling process to a strong state. If reading or writing the current electronic tag cannot be successfully achieved under this protocol, other communication protocols will be used in the polling process. The confirmation of the secondary priority communication protocol can be done using the static predictor described earlier. Unlike the previous single-modal predictor, each communication protocol has two modes: a strong state and a weak state. Each new successful read / write process influences the state progression based on the communication protocol.

[0071] Specifically, if the anti-counterfeiting system uses two types of protocols:

[0072] At this point, the dynamic predictor of the dual-modal tag communication protocol is a four-state machine. The four states correspond to two protocols: Protocol A and Protocol B. Each choice has two states to distinguish between strong and weak protocols: a strong state and a weak state. These are, respectively, Protocol A strong state, Protocol A weak state, Protocol B strong state, and Protocol B weak state.

[0073] The working principle diagram of the state machine is as follows: Figure 4 As shown: the two states on the left represent protocol A, and the two on the right represent protocol B. There are two transition states between the strong state of protocol A and the strong state of protocol B, requiring two consecutive successful read / write operations. For simplicity, the state bits are defined as follows, which can also serve as an implementation example.

[0074] state Protocol A strong state Protocol A weak state Protocol B strong state Protocol B weak state status bit 00 01 10 11

[0075] When in state 00, the prediction protocol A has the highest priority, and read / write operations are performed using protocol A first. If the read / write operation is successful, the four-state machine remains in state 00; if it fails, the four-state machine adjusts to state 01. When the four-state machine is in state 01, the prediction protocol A has the highest priority, and read / write operations are performed using protocol A first. If the read / write operation is successful, the four-state machine remains in state 00; if it fails, the four-state machine adjusts to state 10. When the four-state machine is in state 10, the prediction protocol B has the highest priority, and read / write operations are performed using protocol B first. If the read / write operation is successful, the four-state machine adjusts to state 11; if it fails, the four-state machine adjusts back to state 01. When the four-state machine is in state 11, the prediction protocol B has the highest priority, and read / write operations are performed using protocol B first. If the read / write operation is successful, the four-state machine remains in state 11; if it fails, the four-state machine reverts to state 10.

[0076] This predictor determines whether the currently used read / write protocol has changed based on whether the high-order bits of the status bit change. When the high-order bits of the status bit change from 0 to 1, a strong state flip occurs, and the next prediction changes from protocol A (highest priority) to protocol B (highest priority), and vice versa. This bimodal predictor achieves a prediction accuracy of over 90%.

[0077] Furthermore, if the anti-counterfeiting system uses three different protocols:

[0078] At this point, the dynamic predictor of the dual-modal tag communication protocol is a six-state machine. The six states correspond to three protocols: protocol A, protocol B, and protocol C. Each choice has two states to distinguish between strong and weak states: a strong state and a weak state. These are, respectively, protocol A strong state, protocol A weak state, protocol B strong state, protocol B weak state, protocol C strong state, and protocol C weak state.

[0079] The working principle of a state machine is as follows: Figure 5 As shown:

[0080] The two states on the left of the diagram represent protocol A, the two on the right represent protocol B, and the two at the bottom represent protocol C. There are two transition states between the strong state of protocol A and the highest priority state of protocol B or the highest priority state of protocol C (protocol B), requiring two consecutive successful read / write operations. For simplicity, the state bits are defined as follows, which can also serve as an implementation example.

[0081]

[0082] When the six-state machine is in state 001, it predicts that protocol A has the highest priority and will be used for reading and writing first. If protocol A reads or writes successfully, the six-state machine remains in state 001. If protocol A reads or writes fails, the six-state machine adjusts to state 000. When in state 000, it predicts that protocol A has the highest priority and will be used for reading and writing first. If protocol A reads or writes successfully, the six-state machine adjusts to state 001. If protocol A reads or writes fails, but protocol B reads or writes successfully, the six-state machine adjusts to state 010. If protocol A reads or writes fails, but protocol C reads or writes successfully, the six-state machine adjusts to state 100.

[0083] When the six-state machine is in state 011, protocol B is predicted to have the highest priority, and read / write operations are performed using protocol B first. If protocol B read / write is successful, the six-state machine remains in state 011. If protocol B read / write fails, the six-state machine adjusts to state 010. When the six-state machine is in state 010, protocol B is predicted to have the highest priority, and read / write operations are performed using protocol B first. If protocol B read / write is successful, the six-state machine adjusts to state 011. If protocol B read / write fails, but protocol A read / write succeeds, the six-state machine adjusts to state 000. If protocol B read / write fails, but protocol C read / write succeeds, the six-state machine adjusts to state 100.

[0084] When the six-state machine is in state 101, protocol C is predicted to have the highest priority, and read / write operations are performed using protocol C first. If protocol C read / write is successful, the six-state machine remains in state 101. If protocol C read / write fails, the six-state machine adjusts to state 100. When the six-state machine is in state 100, protocol C is predicted to have the highest priority, and read / write operations are performed using protocol C first. If protocol C read / write is successful, the six-state machine adjusts to state 101. If protocol C read / write fails, but protocol A read / write succeeds, the six-state machine adjusts to state 000. If protocol C read / write fails, but protocol B read / write succeeds, the six-state machine adjusts to state 010.

[0085] The change in the currently used read / write protocol can be determined by whether the two most significant bits of the status bit change. When the values ​​of the two most significant bits of the status bit are "00", "01", and "10", the corresponding states are protocol A (highest priority), protocol B (highest priority), and protocol C (highest priority), respectively. When the status bit changes from "00" to "01", a strong state flip occurs, and the next prediction changes from protocol A (highest priority) to protocol B (highest priority), and vice versa.

[0086] Let's further illustrate this with a specific example: In an RFID anti-counterfeiting system using multiple types of RFID tags, suppose there are three types of RFID tags used in the product. For instance, in a certain RFID anti-counterfeiting system, the three types of RFID tags used in the product have the following usage ratios and supported communication protocols:

[0087] The Type 1 chip has a usage rate of 25% and supports one communication protocol: ISO15693.

[0088] The Type 2 chip has a usage rate of 25% and supports one communication protocol: ISO14443A.

[0089] The Model 3 chip has a usage rate of 50% and supports two communication protocols: ISO 18000-6C and ISO14443A.

[0090] Three communication protocols are involved: ISO15693, ISO14443A, and ISO 18000-6C, as shown in Table 1.

[0091] Table 1

[0092] Communication Protocol Chip types that support this protocol Probability of supporting the protocol ISO15693 Type 1 25％ ISO14443A Type 2 and Type 3 75％ ISO18000-6C Type 3 50％

[0093] Table 2 shows the sequence of chip models produced on the production line near a certain moment during a particular production practice.

[0094] Table 2

[0095]

[0096]

[0097] Without using any predictor, cyclically reading all communication protocols ISO15693, ISO14443A, and ISO18000-6C would result in 24 read / write operations.

[0098] The first possibility is that the predictor with the highest prediction rate in the current historical protocol is the electronic tag type predictor, and there is pre-stored information in the background. In this case, the static predictor based on electronic tag type is used for prediction: According to the data in Table 1 and Table 2, the order of communication protocol attempts during the polling process is determined to be: first priority ISO14443A, second priority ISO 18000-6C, and third priority ISO15693.

[0099] The results of reading and writing in the above order are shown in Table 3:

[0100] Table 3

[0101]

[0102]

[0103] In this sequence, a total of 12 read / write operations are required for successful reads and writes, effectively reducing the number of reads.

[0104] The second possibility is that, based on the assessment, the predictor with the highest historical protocol prediction rate is a tag type-based predictor. However, if there is no pre-stored information in the background but historical information is found, a dynamic predictor based on tag type is used for prediction. During prediction, the reader saves the proportion of various tag types and their corresponding supported communication protocols from the eight successful entries before the current tag entry. The predictor calculates the polling order of communication protocols based on the entry proportion and the communication protocols supported by the corresponding tag, according to the aforementioned principle of this predictor:

[0105] The Type 1 chip has an occurrence rate of 12.5% ​​and supports one communication protocol: ISO15693.

[0106] The Type 2 chip has an occurrence rate of 12.5% ​​and supports one communication protocol: ISO14443A.

[0107] Model 3 chips, accounting for 75% of all occurrences, support two communication protocols: ISO 18000-6C and ISO14443A. Details are shown in Table 4 below.

[0108] Table 4

[0109] Communication Protocol Chip types that support this protocol Probability of supporting the protocol ISO15693 Type 1 12.5％ ISO14443A Type 2 and Type 3 87.5％ ISO18000-6C Type 3 75％

[0110] Based on the data in Table 4, the order in which communication protocols are attempted during the polling process is determined to be: first priority ISO14443A, second priority ISO 18000-6C, and third priority ISO15693.

[0111] Table 5

[0112]

[0113]

[0114] In this sequence, a total of 12 read / write operations are required for successful reads and writes, which is consistent with the read / write operations of a type-1 predictor, effectively reducing the number of reads.

[0115] The third possibility is that, based on the determination that the predictor with the highest prediction rate in the current historical protocol is a tag-based communication protocol predictor, and that it has a priority communication protocol, then dynamic prediction based on a single-mode tag communication protocol is adopted:

[0116] Combination Figure 3 The schematic diagram and principle description shown are combined with the actual situation of this embodiment. Figure 3 Protocol A is ISO 14443A, Protocol B is ISO 18000-6C, and Protocol C is ISO 15693. When the state machine is in state 00, Protocol A is predicted to have the highest priority, and read / write operations are performed using Protocol A first: if Protocol A read / write is successful, the state machine remains in state 00; if Protocol B read / write is successful, the state machine adjusts to state 01; if Protocol C read / write is successful, the state machine adjusts to state 10. When the state machine is in state 01, Protocol B is predicted to have the highest priority, and read / write operations are performed using Protocol B first: if Protocol B read / write is successful, the state machine remains in state 01; if Protocol A read / write is successful, the state machine adjusts to state 00; if Protocol C read / write is successful, the state machine adjusts to state 10. When the state machine is in state 10, Protocol C is predicted to have the highest priority, and read / write operations are performed using Protocol C first: if Protocol C read / write is successful, the state machine remains in state 10; if Protocol A read / write is successful, the state machine adjusts to state 00; if Protocol B read / write is successful, the state machine adjusts to state 01.

[0117] The dynamic predictor described above is used to determine the first priority of the communication protocol. The result of the static predictor will be used to determine the second priority. The order in which the communication protocols are tried is: first priority ISO14443A, second priority ISO 18000-6C, and third priority ISO15693.

[0118] The results of reading and writing in the above order are shown in Table 6 below.

[0119] Table 6

[0120]

[0121]

[0122] In this sequence, a total of 14 read / write operations are required for successful reads and writes, effectively reducing the number of reads.

[0123] The fourth possibility is that, based on the analysis, the predictor with the highest prediction rate in the current historical protocol is a tag-based communication protocol predictor, and there is no priority communication protocol. In this case, a dynamic predictor based on a dual-modal tag communication protocol is used for prediction:

[0124] Combination Figure 5 The schematic diagram and principle description shown are combined with the actual situation of this embodiment. Figure 5 Protocol A is ISO 14443A, Protocol B is ISO 18000-6C, and Protocol C is ISO 15693.

[0125] When the six-state machine is in state 001, it predicts that protocol A has the highest priority and will be used for reading and writing first. If protocol A reads or writes successfully, it remains in state 001. If protocol A reads or writes fails, it transitions to state 000. When in state 000, it predicts that protocol A has the highest priority and will be used for reading and writing first. If protocol A reads or writes successfully, it transitions to state 001. If protocol A reads or writes fails, but protocol B reads or writes successfully, it transitions to state 010. If protocol A reads or writes fails, but protocol C reads or writes successfully, it transitions to state 100.

[0126] When in state 011, protocol B is predicted to have the highest priority, and read / write operations are performed using protocol B first. If protocol B read / write succeeds, the state remains 011. If protocol B read / write fails, the state changes to 010. When in state 010, protocol B is predicted to have the highest priority, and read / write operations are performed using protocol B first. If protocol B read / write succeeds, the state changes to 011. If protocol B read / write fails, but protocol A read / write succeeds, the state changes to 000. If protocol B read / write fails, but protocol C read / write succeeds, the state changes to 100.

[0127] When in state 101, protocol C is predicted to have the highest priority, and read / write operations are performed using protocol C first. If protocol C read / write succeeds, the state remains in 101. If protocol C read / write fails, the state changes to 100. When in state 100, protocol C is predicted to have the highest priority, and read / write operations are performed using protocol C first. If protocol C read / write succeeds, the state changes to 101. If protocol C read / write fails, but protocol A read / write succeeds, the state changes to 000. If protocol C read / write fails, but protocol B read / write succeeds, the state changes to 010.

[0128] The dynamic predictor described above is used to determine the first priority of the communication protocol. The result of the static predictor will be used to determine the second priority. The order in which the communication protocols are tried is: first priority ISO14443A, second priority ISO 18000-6C, and third priority ISO15693.

[0129] The results of reading and writing in the above order are shown in Table 7 below.

[0130] Table 7

[0131]

[0132] In this sequence, a total of 12 read / write operations are required for successful reads and writes, effectively reducing the number of reads.

[0133] This invention's technical solution is applicable to the identification and reading / writing of various types of RFID electronic tags. In RFID systems, multiple tag chips are often used on the same type of goods, thus providing diversified RFID electronic tags. Chip types include, but are not limited to: high-frequency RFID chips, ultra-high-frequency RFID chips, and dual-frequency RFID chips. Commonly supported communication protocols in high-frequency, ultra-high-frequency, and dual-frequency RFID chips include: ISO14443A, ISO14443B, ISO15693, and ISO 18000-6C.

[0134] Due to limitations such as time and cost in practical conditions, producers cannot guarantee that the types of electronic tags appearing on the production line are completely random. Often, electronic tags of the same type tend to appear consecutively. This method utilizes this characteristic in the multi-protocol reading and writing process, introducing four different types of prediction algorithms to predict the types of electronic tags and communication protocols, thereby achieving accurate prediction of the next round of supported protocols, confirming the polling order, and effectively reducing the waiting time for the reader to determine the communication protocol used by each tag.

[0135] The predictors provided in this invention are classified according to the prediction object: the predictor based on the type of electronic tag can predict the probability of encountering a certain type of electronic tag in the next read / write polling operation, and calculate the probability of each communication protocol based on the communication protocol it supports, and determine the next protocol polling order according to the probability; the predictor based on the tag communication protocol is more direct, and does not use the tag type as an intermediate analysis quantity, but directly predicts the probability of supporting a certain type of communication protocol in the next read / write polling operation, and determines the next protocol polling order according to the probability.

[0136] Predictors based on electronic tag types have the advantage of simple software implementation, but require the chip to store data containing chip type information, and are slow due to the use of a large number of floating-point operations. Predictors based on tag communication protocols have fast prediction speed and no specific data requirements, but their software implementation is relatively complex. This application combines the two prediction methods with dynamic and static prediction approaches to obtain four predictors, and combines them to fully utilize the characteristics of each predictor to achieve efficient prediction.

[0137] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some or all of the technical features; and these modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of the present invention.

Claims

1. A high performance RFID read / write method supporting multiple protocols, characterized by, The method comprises: selecting a predictor category according to a historical protocol prediction rate; selecting a predictor with a historical protocol prediction rate higher than a threshold as a current predictor, the predictor including an electronic tag category-based predictor and a tag communication protocol-based predictor; if the electronic tag category-based predictor is selected, further selecting a predictor category according to whether there is pre-stored information, if yes, selecting a static electronic tag category-based predictor, otherwise, selecting a dynamic electronic tag category-based predictor; wherein, according to electronic tag proportion information and support protocol type information contained in the pre-stored information, the static electronic tag category-based predictor calculates each communication probability of each communication protocol type according to the pre-stored information; the dynamic electronic tag category-based predictor retrieves historical information, calculates support probabilities of each communication protocol and sorts them; if the tag communication protocol-based predictor is selected, obtaining a priority communication protocol, if no priority communication protocol is obtained, selecting a dynamic single-mode tag communication protocol predictor, otherwise, selecting a dynamic dual-mode tag communication protocol predictor; wherein, the dynamic single-mode tag communication protocol predictor obtains a communication protocol successfully established communication last time, uses the communication protocol to predict this time's communication establishment operation to establish communication, if the establishment is unsuccessful, retrieves remaining communication protocols to predict this time's communication operation, and changes the state of the communication protocol successfully established communication last time; wherein, each communication protocol in the dynamic dual-mode tag communication protocol predictor has a strong state and a weak state, and between the strong states of two adjacent different communication protocols, there is a weak state of any adjacent communication protocol; when predicting, selecting a communication protocol currently in a strong state to predict, if successful, maintaining the states of all communication protocols, otherwise, adjusting the current communication protocol to a weak state, making a second attempt, if successful, restoring the communication protocol to a strong state, otherwise, maintaining the weak state, and using other communication protocols to predict; after the predictor is selected, using a corresponding communication protocol to establish communication with an RFID chip according to a prediction result of the predictor to perform read-write operation.

2. The method of claim 1, wherein, The static electronic tag category-based predictor comprises: sorting each communication protocol in the support protocol type according to a communication probability, and using different communication protocols to establish communication with the RFID chip in sequence according to a sorting result.

3. The method of claim 1, wherein, The dynamic electronic tag category-based predictor comprises: using corresponding communication protocols to establish communication with the RFID chip in sequence according to a support probability of each communication protocol from high to low.

4. The method of claim 3, wherein, The using corresponding communication protocols to establish communication with the RFID chip in sequence according to a support probability of each communication protocol from high to low further comprises: recording a communication protocol category currently successfully established communication, recalculating a support probability of the communication protocol, and updating the historical information.

5. The method of claim 1, wherein, The prediction by using other communication protocols includes: if the reading and writing by using other communication protocols is successful, the state of the other communication protocols is adjusted to be weak, and in the next prediction, the other communication protocols are used to predict preferentially; if the communication between the other communication protocols and the RFID is established again, the state of the other communication protocols is strong, otherwise, other communication protocols are used to predict.

Images