A method, system and electronic device for quickly sorting radio frequency tags

Abstract

The present invention belongs to the field of radio frequency identification technology and discloses a method, system and electronic device for quickly sorting radio frequency tags. The method comprises: a reader obtains a set of identified unsorted tags S k Calculate the three-segment hash value for each tag and construct a first array B and a second array D based on the hash value. The reader broadcasts the first array B and the second array D to all tags, allowing each tag to extract a codeword from them, modify its own state, and calculate the sorting result through offset calculation. The system and electronic device are constructed based on the method. The present invention uses the fewest possible bits to complete communication between the reader and the tag, thereby reducing communication costs and improving communication efficiency.

Description

Technical Field

[0001] The present invention relates to the technical field of radio frequency identification, and in particular to a rapid sorting method, system and electronic equipment for radio frequency tags. Background Art

[0002] The radio frequency identification system consists of a server, reader and tags that work together. It is widely used in the field of the Internet of Things due to its advantages of long-distance identification, simultaneous identification of multiple tags, high information security and large storage capacity.

[0003] Multiple tags are a hallmark of RFID systems in the IoT. Specifically, each tag is a microchip with an antenna. In IoT applications, each tag is attached to a specific item, identifying itself, the item, and specific information about the item through a unique identifier. Effective tag management is crucial for effective management of each item. Effective tag sorting is a prerequisite and crucial measure for effective tag management.

[0004] The tag sorting process requires the following: first, each identified tag must be assigned a unique integer and sorted; second, unidentified tags must be prevented from receiving these integers. Furthermore, effective tag management requires high communication efficiency. Since there are no protocols specifically designed to address this type of tag sorting, Bloom filters combined with Aloha-like protocols are often used in practice. While these methods can meet the requirements for identifying identified tags and assigning unique serial numbers, the high communication costs of Bloom filters and Aloha-like protocols often lead to long communication delays when sorting multiple tags, making them inefficient and difficult to effectively apply in practice. Summary of the Invention

[0005] The present invention aims to provide a method, system and electronic device for quickly sorting radio frequency tags, so as to improve the technical problem of high communication cost in the existing multi-tag sorting.

[0006] To achieve the above objectives, the present invention proposes the following technical solutions:

[0007] A rapid sorting method for radio frequency tags, comprising:

[0008] The reader obtains the identified unsorted tag set S k , and obtain the information of all tags; where k represents the kth round of communication between the reader and the tag, S k The CCP includes n k tags;

[0009] Calculate S by hash function kThree hash values for each tag in, and Continuous and disjoint, t represents any label; where, is a decimal number; It is a decimal number to resolve hash conflicts between tags; is a binary number, which serves as the fingerprint of the tag;

[0010] Based on each tag Map it to the cells of the first array B Wherein, i represents the i-th cell of the first array B, and each cell of the first array B includes a 3-bit string, which is M1, M2 and M3 in sequence;

[0011] Fill the M1 bit of the cells in the first array B that are not mapped by a label with 0, and leave the M2 and M3 bits empty; fill the M1 bit of the cells in the first array B that are mapped by only one label with 1, fill the M2 bit with 0, and leave the M3 bit empty; fill the M1 bit of the cells in the first array B that are simultaneously mapped by multiple hash conflicting labels with 1, fill the M2 bit with 1, and fill the M3 bit with 0; fill the M1 bit of the cells in the first array B that are not in the above three situations with 1, fill the M2 bit with 1, and fill the M3 bit with 1;

[0012] based on Map the label t in the cell string of the first array B, where M1 is 1, M2 is 0, and M3 is empty, to the cell of the second array D Where, i' represents the i'th cell in the second array D, is the total number of such strings that appear before the cell where the label t is located in the first array B; based on Map the string of the cell in the first array B to the label t with M1 bit 1, M2 bit 1, and M3 bit 0 to the cell of the second array D Where, N 10 is the total number of cells in the first array B that have strings with bit M1 set to 1, bit M2 set to 0, and bit M3 left blank. The total number of character strings with M1 bit 1, M2 bit 1, and M3 bit 0 appearing before the cell where the label t is located in the first array B; and the fingerprint of the corresponding label is stored in the character string corresponding to any cell in the second array D

[0013] Broadcast the first array B and the second array D to the total tag set O to reset and sort the status of each tag; wherein, when the M1 of the corresponding cell of the first array B obtained by the tag is 0, and the M2 and M3 bits are empty, it enters the deactivated state; when the M1 bit of the corresponding cell of the first array B obtained by the tag is 1, the M2 bit is 0, and the M3 bit is empty, or the M1 bit is 1, the M2 bit is 1, and the M3 bit is 0, and it is confirmed that the fingerprint in the corresponding cell in the second array D is consistent with its own fingerprint, it enters the sorting state, and calculates the offset Δ(t) = D[i'] + G based on the second array D as the serial number of the corresponding tag, wherein G is the serial number of the last tag after the previous round of sorting; when the M1 bit of the corresponding cell of the first array B obtained by the tag is 1, the M2 bit is 1, and the M3 bit is 1, it enters the waiting state.

[0014] Further, The three combinations include c+f+1+k bits. is the scale of the hash function, is the total number of communication rounds, ε is the misjudgment rate; Including the first c positions in the position sequence; Including the c+1th position in the sequence; Including the last f+k bits in the bit sequence.

[0015] Furthermore, the broadcasting of the first array B and the second array D to the total tag set O to reset and sort the status of each tag further includes:

[0016] When the M1 bit of the cell corresponding to the first array B obtained by the tag is 1, the M2 bit is 1, and the M3 bit is 1, G'=G+N 10 +2N 110 Add a pre-number to the corresponding label, N 110 is the total number of cells in the first array B that have character strings with M1 bit being 1, M2 bit being 1, and M3 bit being 0.

[0017] Furthermore, when k is 1, S k =S', S' is the tag set including all identified tags.

[0018] Furthermore, there is one or more readers.

[0019] Furthermore, after the reader completes f rounds of communication with each tag, the total communication cost is: Among them, n1 is the total number of tags in S1 during the first round of communication.

[0020] A rapid sorting system for radio frequency tags, comprising:

[0021] Information acquisition module, used by the reader to obtain the identified unsorted tag set Sk , and obtain the information of all tags; where k represents the kth round of communication between the reader and the tag, S k The CCP includes n k tags;

[0022] Hash calculation module, used to calculate S through hash function k Three hash values for each tag in, and Continuous and disjoint, t represents any label; where, is a decimal number; It is a decimal number to resolve hash conflicts between tags; is a binary number, which serves as the fingerprint of the tag;

[0023] The first construction module is used to Map it to the cells of the first array B Wherein, i represents the i-th cell of the first array B, and each cell of the first array B includes a 3-bit string, which is M1, M2 and M3 in sequence;

[0024] The second construction module is used to fill the M1 bit of the cell in the first array B that is not mapped by the label with 0, and the M2 bit and the M3 bit are vacant; fill the M1 bit of the cell in the first array B that is mapped by only one label with 1, the M2 bit is filled with 0, and the M3 bit is vacant; fill the M1 bit of the cell in the first array B that is simultaneously mapped by multiple hash conflicting labels with 1, the M2 bit is filled with 1, and the M3 bit is filled with 0; fill the M1 bit of the cell in the first array B that is not in the above three situations with 1, the M2 bit is filled with 1, and the M3 bit is filled with 1;

[0025] The third construction module is used based on Map the label t in the cell string of the first array B, where M1 is 1, M2 is 0, and M3 is empty, to the cell of the second array D Where, i' represents the i'th cell in the second array D, is the total number of such strings that appear before the cell where the label t is located in the first array B; based on Map the string of the cell in the first array B to the label t with M1 bit 1, M2 bit 1, and M3 bit 0 to the cell of the second array D Where, N 10 is the total number of cells in the first array B that have strings with bit M1 set to 1, bit M2 set to 0, and bit M3 left blank. The total number of character strings with M1 bit 1, M2 bit 1, and M3 bit 0 appearing before the cell where the label t is located in the first array B; and the fingerprint of the corresponding label is stored in the character string corresponding to any cell in the second array D

[0026] The tag sorting module is used to broadcast the first array B and the second array D to the total tag set O to reset the state and sort each tag; wherein, when the M1 bit of the corresponding cell of the first array B obtained by the tag is 0, and the M2 bit and the M3 bit are vacant, it enters the deactivated state; when the M1 bit of the corresponding cell of the first array B obtained by the tag is 1, the M2 bit is 0, and the M3 bit is vacant, or the M1 bit is 1, the M2 bit is 1, and the M3 bit is 0, and it is confirmed that the fingerprint in the corresponding cell in the second array D is consistent with its own fingerprint, it enters the sorting state, and calculates the offset Δ(t)=D[i']+G based on the second array D as the serial number of the corresponding tag, wherein G is the serial number of the last tag after the previous round of sorting; when the M1 bit of the corresponding cell of the first array B obtained by the tag is 1, the M2 bit is 1, and the M3 bit is 1, it enters the waiting state.

[0027] Further, including:

[0028] The pre-sorting module is used to sort the cells of the first array B obtained by the tag by G'=G+N when the M1 bit, M2 bit and M3 bit of the cell are 1, 10 +2N 110 Add a pre-sequence number to the corresponding label.

[0029] An electronic device comprises a memory, a processor and a computer program stored in the memory and capable of running on the processor. When the processor runs the computer program, the method for quickly sorting radio frequency tags is implemented.

[0030] Beneficial effects:

[0031] It can be seen from the above technical solutions that the present invention provides a rapid sorting method for radio frequency tags to solve the technical problems of high communication cost and low communication efficiency in the existing radio frequency tag sorting process.

[0032] The method constructs a new encoding process for communication between a reader and multiple tags. First, the identified unsorted tag information is obtained, and then the three-segment hash value of each tag is calculated, where the hash value Indicates the mapping position of the label in the first array B, the hash value Resolves hash conflicts between tags, hash values The fingerprint of the tag is used to represent the tag. At this time, the first array B and the second array D can be created by the three hash values of the tag. Among them, the cell sequence of the first array B is the hash value carrying the tag information. The strings of the cells of the second array D are filled with hash values carrying label information The first array B cell string filling process uses the hash value The hash collision between tags is resolved, and an index rule is established between the first array B and the second array D. At this point, when the reader broadcasts information to multiple tags, it only needs to broadcast the first array B and the second array D created based on the hash function. Therefore, the communication cost at this stage is After that, the tag only needs to identify the cells and strings corresponding to itself in the first array B and the second array D, and obtain the assigned unique integer as the sorting sequence by calculating the offset. The communication cost of this stage is 96ε 1.61 At the same time, since the first array B is also filled with M1 to 0 through strings, the empty cells of M2 and M3 are marked with information corresponding to unrecognized tags, so the corresponding sorting instructions can be avoided from being received by them. At this time, the total communication cost is: The basic idea of the existing Aloha-like protocol is to randomly hash tags to different time slots of the communication frame and use a single time slot to assign different integers to each tag. The minimum communication cost required is 2.71n1. In order to prevent the assigned integers from being received by unidentified tags, it is necessary to deactivate unidentified tags in advance through the Bloom filter. The communication cost of this process is Therefore, the total communication cost of the existing technology is This demonstrates that the communication costs of this solution are significantly lower than those of existing technologies. This significantly reduces the communication costs associated with multi-tag sorting, avoids communication delays, and improves communication efficiency. This, in turn, allows for rapid management of goods based on tag sorting in real-world production.

[0033] It should be appreciated that all combinations of the foregoing concepts, as well as additional concepts described in greater detail below, to the extent such concepts are not mutually inconsistent, can be considered to be part of the inventive subject matter of this disclosure.

[0034] The foregoing and other aspects, embodiments, and features of the present invention will be more fully understood from the following description in conjunction with the accompanying drawings. Other additional aspects of the present invention, such as features and / or beneficial effects of the exemplary embodiments, will become apparent from the following description or through practice of specific embodiments according to the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] The accompanying drawings are not intended to be drawn to scale. In the drawings, each identical or nearly identical component shown in various figures may be represented by the same reference numeral. For the sake of clarity, not every component is labeled in every figure. Embodiments of various aspects of the present invention will now be described by way of example and with reference to the accompanying drawings, in which:

[0036] Figure 1 This is a flow chart of the rapid sorting method for radio frequency tags described in this embodiment. DETAILED DESCRIPTION

[0037] To further clarify the objectives, technical solutions, and advantages of the embodiments of the present invention, the technical solutions of the embodiments of the present invention will be clearly and completely described below in conjunction with the accompanying drawings. Obviously, the described embodiments are only a portion of the embodiments of the present invention, not all of them. Based on the described embodiments of the present invention, all other embodiments derived by persons of ordinary skill in the art without requiring creative effort are within the scope of protection of the present invention. Unless otherwise defined, technical or scientific terms used herein shall have the ordinary meanings understood by persons of ordinary skill in the field to which the present invention pertains.

[0038] The words "first", "second" and similar terms used in the patent application specification and claims of the present invention do not indicate any order, quantity or importance, but are only used to distinguish different components. Similarly, unless the context clearly indicates otherwise, the singular forms of "a", "an" or "the" and similar terms do not indicate a quantitative limitation, but rather indicate the presence of at least one. Words such as "include" or "comprise" mean that the elements or objects preceding "include" or "comprise" include the features, wholes, steps, operations, labels and / or components listed after "include" or "comprise", and do not exclude the existence or addition of one or more other features, wholes, steps, operations, labels, components and / or their collections. "Up", "down", "left", "right" and the like are only used to indicate relative positional relationships. When the absolute position of the described object changes, the relative positional relationship may also change accordingly.

[0039] Since the prior art does not have a communication rule for multi-tag sorting, the communication between the reader and the tag is achieved through the Aloha-like protocol. At the same time, in order to prevent the unique integer assigned as the sorting sequence number from being received by unidentified tags, it is also necessary to disable the unidentified tags through the Bloom filter before communicating based on the Aloha-like protocol. Since the communication cost of the Bloom filter and the Aloha-like protocol is relatively high, it often leads to communication delays in the process of multi-tag sorting, making it difficult to meet the demand for rapid management of goods in actual production. Therefore, this embodiment aims to provide a rapid sorting method, system and electronic equipment for radio frequency tags to solve the defect that the multi-tag sorting in the prior art is difficult to meet actual needs due to the high communication cost.

[0040] The following is a detailed introduction to a quick sorting method of radio frequency tags disclosed in this embodiment with reference to the accompanying drawings.

[0041] Combine Figure 1 As shown, the core of the method is to create a communication protocol specifically for the reader and the tag, which is named the Ranking protocol in this embodiment. The designed communication steps include:

[0042] Step S102: The reader obtains the identified unsorted tag set S k , and obtain S k Information about all tags in .

[0043] Where k represents the kth round of communication between the reader and the tag, S k The CCP includes n k tags.

[0044] In this embodiment, when k is 1, that is, in the first round of communication, S k =S', S' is the tag set including all identified tags.

[0045] Step S104: Calculate S by using a hash function k The three hash values of each tag in

[0046] In this embodiment, the three hash values are obtained through a hash function. and Continuous and disjoint, t represents any label. The three are arranged in sequence and include c+f+1+k bits in total. is the scale of the hash function, is the total number of communication rounds, and ε is the misjudgment rate. is a decimal number, including the first c digits in the position sequence; It is a decimal number including the c+1th bit in the order to resolve hash conflicts between tags; It is a binary number including the last f+k bits in the sequence, which serves as the fingerprint of the tag.

[0047] Specifically, it can be divided by the following formula:

[0048]

[0049] Step S106: Based on each tag Map it to the cells of the first array B Wherein, each cell of the first array B includes a 3-bit string, which is M1, M2 and M3 respectively.

[0050] Step S108: Fill the corresponding cell of each label in the first array B with a character string.

[0051] In this embodiment, the filling process includes: filling the M1 bit of the cell in the first array B that is not mapped by the label with 0, and leaving the M2 bit and the M3 bit vacant; filling the M1 bit of the cell in the first array B that is mapped by only one label with 1, filling the M2 bit with 0, and leaving the M3 bit vacant; filling the M1 bit of the cell in the first array B that is simultaneously mapped by multiple hash conflicting labels with 1, filling the M2 bit with 1, and filling the M3 bit with 0; filling the M1 bit of the cell in the first array B that is not in the above three situations with 1, filling the M2 bit with 1, and filling the M3 bit with 1.

[0052] Step S110 : Map the label to the corresponding cell of the second array D based on the character string information of the corresponding unit of the first array B; and fill the fingerprint of the corresponding label in the character string of the corresponding cell of the second array D.

[0053] In this embodiment, the mapping process from the first array B to the second array D in combination with the three hash values includes: Map the label t in the cell string of the first array B, where M1 is 1, M2 is 0, and M3 is empty, to the cell of the second array D Where, i' represents the i'th cell in the second array D, is the total number of such strings that appear before the cell where the label t is located in the first array B; based on Map the string of the cell in the first array B to the label t with M1 bit 1, M2 bit 1, and M3 bit 0 to the cell of the second array D Where, N 10 is the total number of cells in the first array B that have strings with bit M1 set to 1, bit M2 set to 0, and bit M3 left blank. The total number of character strings with M1 bit 1, M2 bit 1, and M3 bit 0 appearing before the cell where the label t is located in the first array B; and the fingerprint of the corresponding label is stored in the character string corresponding to any cell in the second array D

[0054] The first stage of the Ranking protocol is completed through steps S102 to S110, that is, the first array B and the second array D are constructed through the hash function to realize the encoding of the tag information by the reader.

[0055] Step S112: broadcast the first array B and the second array D to the total tag set O to reset and sort the status of each tag.

[0056] In this embodiment, the process of the tag decoding the first array B and the second array D to obtain corresponding information includes: when the M1 bit of the corresponding cell of the first array B obtained by the tag is 0, and the M2 bit and the M3 bit are empty, entering the deactivated state; when the M1 bit of the corresponding cell of the first array B obtained by the tag is 1, the M2 bit is 0, and the M3 bit is empty, or the M1 bit is 1, the M2 bit is 1, and the M3 bit is 0, and at the same time confirming that the fingerprint in the corresponding cell in the second array D is consistent with its own fingerprint, entering the sorting state, and calculating the offset Δ(t)=D[i']+G based on the second array D as the serial number of the corresponding tag, where G is the serial number of the last tag after the previous round of sorting; when the M1 bit of the corresponding cell of the first array B obtained by the tag is 1, the M2 bit is 1, and the M3 bit is 1, entering the waiting state.

[0057] In this embodiment, before the first round of communication, G is initialized to 0.

[0058] Specifically, when a tag enters the deactivated state, it does not respond to the broadcast information from the reader, thereby preventing the sorting information from being received by unidentified tags.

[0059] When a tag enters the waiting state, it indicates that the tag will participate in the sorting in the next round of communication. As a preferred embodiment, in order to reduce the communication cost in the next round of communication, the tag entering the waiting state will maintain a local variable G' as the pre-sequence number for the next cycle sorting. Specifically, it includes:

[0060] S112', when the M1 bit of the cell corresponding to the first array B obtained by the tag is 1, the M2 bit is 1, and the M3 bit is 1, through G'=G+N 10 +2N 110 Add a pre-sequence number to the corresponding label.

[0061] Through step S112 and step S112', the second stage of the Ranking protocol is completed, that is, the tag parses the first array B and the second array D to obtain ranking information. At this point, the entire Ranking protocol is completed.

[0062] The method or ranking protocol described in this embodiment is not only applicable to tag ranking applications of a single reader, but also to tag ranking applications of multiple readers.

[0063] In order to verify the effectiveness of this embodiment, the following proof is made:

[0064] Proof 1:

[0065] Due to objective limitations, both the existing technology and this embodiment have the probability of unidentified tags mistakenly being set to an unidentified state during communication. Therefore, it is necessary to demonstrate that the method described in this embodiment does not increase the probability of such misconfiguration compared to the existing technology, thereby ensuring that the ranking protocol meets the applicable prerequisites in terms of organization.

[0066] First, in the kth round of communication, there are n k The identified tags are in an unsorted state, and there are 2 c units, and record it as L=2 c The probability of filling each cell string in the first array B with B[i]=“0” (i.e. M1=0, M2 and M3 are empty), “10” (i.e. M1=1, M2=0, M3 is empty), “110” (i.e. M1=1, M2=1, M3=0), and “111” (i.e. M1=1, M2=1, M3=1) is recorded as p0, p1 respectively. 10 、p 110 、p 111 Since the three hash values are independent and uniformly distributed random variables, and considering the filling rules of the strings in the first array B, we can get:

[0067]

[0068]

[0069]

[0070]

[0071] Only when B[i] = "10", or "110", and Therefore, the probability that the unidentified tag receives B and D and enters the sorting state is Similarly, the probability of an unidentified tag entering the sorting state in the next round is: Here will Denoted as Y k ,Will Denoted as α, Denoted as X k Then we can get the probability P that the unidentified tag is missorted in the entire f rounds of communication. err for:

[0072]

[0073] In actual parameter settings, ε is generally very small, so the probability that the ranking protocol mistakenly identifies an unidentified tag as an identified tag for ranking is also very small, thus meeting the premise of actual application.

[0074] Proof 2:

[0075] The total communication cost of the Ranking protocol and the total communication cost of the prior art using an Aloha-like protocol combined with a Bloom filter are calculated to confirm the savings in communication cost achieved by this embodiment.

[0076] In the first round of communication, the label in S1 is n1, and the first array B includes units, Set L1 represents the first round of sorting Identified tags. At this time, in the second round of communication, the number of tags in S2 is Based on this, we can get that in the kth round of communication, S k The label inside is n k =γ k-1 n1, the number of tags sorted after the round is n k -n k+1 =γ k-1 n1-γ k n1=γ k-1 (1-γ)n1. From this, we can get the number of digits of the second array D in the kth round: γ k-1 (1-γ)n1*(fk). Based on the relevant conclusions of Proof 1, the number of digits in the first array B in round k is: From this we can get the total number of bits in the first array B and the second array D in round k is Then we get the communication cost generated by the first array B and the second array D after the fth round:

[0077]

[0078] When the reader broadcasts the first array B and the second array D to the tags, it only needs to merge the IDs of all tags to obtain the communication cost of this process:

[0079]

[0080] From this, the total communication cost of the Ranking protocol is:

[0081]

[0082] In the prior art, in the process of deactivating unidentified tags by Bloom filter, at least Bit encoding a group of n1 identified tags; in an Aloha-like protocol, the tags are randomly hashed to different time slots of the communication frame, and a different integer is assigned to each tag using a single time slot. The minimum communication cost required is 2.71n1. The total communication cost is

[0083] As can be seen from the above, the communication cost of this embodiment is much lower than that of the prior art.

[0084] In summary, this embodiment designs a Ranking protocol, which constructs a first array B and a second array D based on a hash function to reduce the communication cost compared to when using an Aloha-like protocol. At the same time, the first array B carries information about unidentified tags, and when the tag decodes the first array B and the second array D, it can automatically avoid the corresponding sorting sequence number from being received by the unidentified tag. This avoids the communication cost consumption of using Bloom filters for unidentified tags in the prior art. As a result, the purpose of improving communication efficiency is achieved overall. Furthermore, it can be obtained from calculations that the error rate of the Ranking protocol also meets the application requirements. Therefore, this embodiment can quickly sort multiple tags in actual use, thereby effectively managing multiple goods.

[0085] The above program can be executed in a processor or stored in a memory (or computer-readable storage medium). Computer-readable media include permanent and non-permanent, removable and non-removable media that can implement information storage by any method or technology. Information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, computer-readable media does not include temporary computer-readable media such as modulated data signals and carrier waves.

[0086] These computer programs can also be loaded onto a computer or other programmable data processing device so that a series of operational steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for executing on the computer or other programmable device to implement the process. Figure 1 a process or multiple processes and / or boxes Figure 1 The steps of the functions specified in one or more blocks can be implemented by different modules corresponding to different steps.

[0087] This embodiment also provides a rapid sorting system for radio frequency tags, the system comprising:

[0088] Information acquisition module, used by the reader to obtain the identified unsorted tag set S k , and obtain the information of all tags; where k represents the kth round of communication between the reader and the tag, S k The CCP includes n k tags.

[0089] Hash calculation module, used to calculate S through hash function k Three hash values for each tag in, and Continuous and disjoint, t represents any label; where, is a decimal number; It is a decimal number to resolve hash conflicts between tags; is a binary number that serves as the fingerprint of the tag.

[0090] The first construction module is used to Map it to the cells of the first array B Wherein, i represents the i-th cell of the first array B, and each cell of the first array B includes a 3-bit string, which is M1, M2 and M3 respectively.

[0091] The second construction module is used to fill the M1 bit of the cell in the first array B that is not mapped by the label with 0, and leave the M2 and M3 bits vacant; fill the M1 bit of the cell in the first array B that is mapped by only one label with 1, fill the M2 bit with 0, and leave the M3 bit vacant; fill the M1 bit of the cell in the first array B that is simultaneously mapped by multiple hash conflicting labels with 1, fill the M2 bit with 1, and fill the M3 bit with 0; fill the M1 bit of the cell in the first array B that is not in the above three situations with 1, fill the M2 bit with 1, and fill the M3 bit with 1.

[0092] The third construction module is used based on Map the label t in the cell string of the first array B, where M1 is 1, M2 is 0, and M3 is empty, to the cell of the second array D Where, i' represents the i'th cell in the second array D, is the total number of such strings that appear before the cell where the label t is located in the first array B; based on Map the string of the cell in the first array B to the label t with M1 bit 1, M2 bit 1, and M3 bit 0 to the cell of the second array D Where, N 10 is the total number of cells in the first array B that have strings with bit M1 set to 1, bit M2 set to 0, and bit M3 left blank. The total number of character strings with M1 bit 1, M2 bit 1, and M3 bit 0 appearing before the cell where the label t is located in the first array B; and the fingerprint of the corresponding label is stored in the character string corresponding to any cell in the second array D

[0093] The tag sorting module is used to broadcast the first array B and the second array D to the total tag set O to reset the state and sort each tag; wherein, when the M1 bit of the corresponding cell of the first array B obtained by the tag is 0, and the M2 bit and the M3 bit are vacant, it enters the deactivated state; when the M1 bit of the corresponding cell of the first array B obtained by the tag is 1, the M2 bit is 0, and the M3 bit is vacant, or the M1 bit is 1, the M2 bit is 1, and the M3 bit is 0, and it is confirmed that the fingerprint in the corresponding cell in the second array D is consistent with its own fingerprint, it enters the sorting state, and calculates the offset Δ(t)=D[i']+G based on the second array D as the serial number of the corresponding tag, wherein G is the serial number of the last tag after the previous round of sorting; when the M1 bit of the corresponding cell of the first array B obtained by the tag is 1, the M2 bit is 1, and the M3 bit is 1, it enters the waiting state.

[0094] As an optional implementation manner, the system further includes:

[0095] The pre-sorting module is used to sort the cells of the first array B obtained by the tag by G'=G+N when the M1 bit, M2 bit and M3 bit of the cell are 1, 10 +2N 110 Add a pre-sequence number to the corresponding label.

[0096] When multiple tags are sorted by the system, communication costs can be greatly reduced and communication efficiency can be improved; thereby meeting the need for rapid sorting of tags in actual use to ensure effective management of goods.

[0097] This embodiment also provides an electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the method for rapidly sorting radio frequency tags is implemented. Therefore, in practical applications, this method also has the advantage of improving communication efficiency.

[0098] While the present invention has been disclosed above with reference to preferred embodiments, this is not intended to limit the present invention. Persons skilled in the art will readily appreciate that various modifications and variations can be made without departing from the spirit and scope of the present invention. Therefore, the scope of protection of the present invention shall be determined by the claims.

Claims

1. A rapid sorting method for radio frequency tags, characterized in that: include: The reader obtains the identified unsorted tag set S k , and obtain the information of all tags; where k represents the kth round of communication between the reader and the tag, S k The CCP includes n k tags; Calculate S by hash function k Three hash values for each tag in, and Continuous and disjoint, t represents any label; where, is a decimal number; It is a decimal number to resolve hash conflicts between tags; is a binary number that serves as the fingerprint of the tag; Based on each tag Map it to the cells of the first array B Wherein, i represents the i-th cell of the first array B, and each cell of the first array B includes a 3-bit string, which is M1, M2 and M3 in sequence; Fill the M1 bit of the cells in the first array B that are not mapped by a label with 0, and leave the M2 and M3 bits empty; fill the M1 bit of the cells in the first array B that are mapped by only one label with 1, fill the M2 bit with 0, and leave the M3 bit empty; fill the M1 bit of the cells in the first array B that are simultaneously mapped by multiple hash conflicting labels with 1, fill the M2 bit with 1, and fill the M3 bit with 0; fill the M1 bit of the cells in the first array B that are not in the above three situations with 1, fill the M2 bit with 1, and fill the M3 bit with 1; based on Map the label t in the cell string of the first array B, where M1 is 1, M2 is 0, and M3 is empty, to the cell of the second array D Where, i' represents the i'th cell in the second array D, is the total number of such strings that appear before the cell where the label t is located in the first array B; based on Map the string of the cell in the first array B to the label t with M1 bit 1, M2 bit 1, and M3 bit 0 to the cell of the second array D Where, N 10 is the total number of cells in the first array B that have strings with bit M1 set to 1, bit M2 set to 0, and bit M3 left blank. The total number of character strings with M1 bit 1, M2 bit 1, and M3 bit 0 appearing before the cell where the label t is located in the first array B; and the fingerprint of the corresponding label is stored in the character string corresponding to any cell in the second array D Broadcast the first array B and the second array D to the total tag set O to reset and sort the status of each tag; wherein, when the M1 of the corresponding cell of the first array B obtained by the tag is 0, and the M2 and M3 bits are empty, it enters the deactivated state; when the M1 bit of the corresponding cell of the first array B obtained by the tag is 1, the M2 bit is 0, and the M3 bit is empty, or the M1 bit is 1, the M2 bit is 1, and the M3 bit is 0, and it is confirmed that the fingerprint in the corresponding cell in the second array D is consistent with its own fingerprint, it enters the sorting state, and calculates the offset Δ(t) = D[i'] + G based on the second array D as the serial number of the corresponding tag, wherein G is the serial number of the last tag after the previous round of sorting; when the M1 bit of the corresponding cell of the first array B obtained by the tag is 1, the M2 bit is 1, and the M3 bit is 1, it enters the waiting state.

2. The rapid sorting method of radio frequency tags according to claim 1, characterized in that: The three combinations include c+f+1+k bits. is the scale of the hash function, is the total number of communication rounds, ε is the misjudgment rate; Including the first c positions in the position sequence; Including the c+1th position in the sequence; Including the last f+k bits in the bit sequence.

3. The rapid sorting method of radio frequency tags according to claim 1, characterized in that: The broadcasting of the first array B and the second array D to the total tag set O to reset and sort the status of each tag further includes: When the M1 bit of the cell corresponding to the first array B obtained by the tag is 1, the M2 bit is 1, and the M3 bit is 1, G'=G+N 10 +2N 110 Add a pre-number to the corresponding label, N 110 is the total number of cells in the first array B that have character strings with M1 bit being 1, M2 bit being 1, and M3 bit being 0.

4. The rapid sorting method of radio frequency tags according to claim 1, characterized in that: When k is 1, S k =S', S' is the tag set including all identified tags.

5. The rapid sorting method of radio frequency tags according to claim 1, characterized in that: There may be one or more readers.

6. The rapid sorting method of radio frequency tags according to claim 1, characterized in that: After the reader completes f rounds of communication with each tag, the total communication cost is: Among them, n1 is the total number of tags in S1 during the first round of communication.

7. A rapid sorting system for radio frequency tags, characterized in that: include: Information acquisition module, used by the reader to obtain the identified unsorted tag set S k , and obtain the information of all tags; where k represents the kth round of communication between the reader and the tag, S k The CCP includes n k tags; Hash calculation module, used to calculate S through hash function k Three hash values for each tag in, and Continuous and disjoint, t represents any label; where, is a decimal number; It is a decimal number to resolve hash conflicts between tags; is a binary number, which serves as the fingerprint of the tag; The first construction module is used to Map it to the cells of the first array B Wherein, i represents the i-th cell of the first array B, and each cell of the first array B includes a 3-bit string, which is M1, M2 and M3 in sequence; The second construction module is used to fill the M1 bit of the cell in the first array B that is not mapped by the label with 0, and the M2 bit and the M3 bit are vacant; fill the M1 bit of the cell in the first array B that is mapped by only one label with 1, the M2 bit is filled with 0, and the M3 bit is vacant; fill the M1 bit of the cell in the first array B that is simultaneously mapped by multiple hash conflicting labels with 1, the M2 bit is filled with 1, and the M3 bit is filled with 0; fill the M1 bit of the cell in the first array B that is not in the above three situations with 1, the M2 bit is filled with 1, and the M3 bit is filled with 1; The third construction module is used based on Map the label t in the cell string of the first array B, where M1 is 1, M2 is 0, and M3 is empty, to the cell of the second array D Where, i' represents the i'th cell in the second array D, is the total number of such strings that appear before the cell where the label t is located in the first array B; based on Map the string of the cell in the first array B to the label t with M1 bit 1, M2 bit 1, and M3 bit 0 to the cell of the second array D Where, N 10 is the total number of cells in the first array B that have strings with bit M1 set to 1, bit M2 set to 0, and bit M3 left blank. The total number of character strings with M1 bit 1, M2 bit 1, and M3 bit 0 appearing before the cell where the label t is located in the first array B; and the fingerprint of the corresponding label is stored in the character string corresponding to any cell in the second array D The tag sorting module is used to broadcast the first array B and the second array D to the total tag set O to reset the state and sort each tag; wherein, when the M1 bit of the corresponding cell of the first array B obtained by the tag is 0, and the M2 bit and the M3 bit are vacant, it enters the deactivated state; when the M1 bit of the corresponding cell of the first array B obtained by the tag is 1, the M2 bit is 0, and the M3 bit is vacant, or the M1 bit is 1, the M2 bit is 1, and the M3 bit is 0, and it is confirmed that the fingerprint in the corresponding cell in the second array D is consistent with its own fingerprint, it enters the sorting state, and calculates the offset Δ(t)=D[i']+G based on the second array D as the serial number of the corresponding tag, wherein G is the serial number of the last tag after the previous round of sorting; when the M1 bit of the corresponding cell of the first array B obtained by the tag is 1, the M2 bit is 1, and the M3 bit is 1, it enters the waiting state.

8. The rapid sorting system of radio frequency tags according to claim 7, characterized in that: include: The pre-sorting module is used to sort the cells of the first array B obtained by the tag by G'=G+N when the M1 bit, M2 bit and M3 bit of the cell are 1, 10 +2N 110 Add a pre-sequence number to the corresponding label.

9. An electronic device, characterized in that: The method comprises a memory, a processor and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the method for quickly sorting radio frequency tags according to any one of claims 1 to 6 is implemented.

Images