A sequential optimization-based batch write method for commercial RFID system information

Abstract

The application discloses a kind of based on sequential optimization's commercial RFID system information batch write-in method, the data structure of label binding vector is proposed, and using the data structure is assigned to each label in commercial RFID system with an efficient compact pseudo-ID, compared with the existing method based on label original ID, the use quantity of write-in related instruction is significantly reduced, and the time overhead of information write-in is reduced;Using label binding vector, a kind of based on sequential optimization's information batch write-in scheme is proposed, the scheme is in selecting locking target label, excluding non-target label interference, and combining using the optimal one write-in sequence strategy between the former two, so as to further greatly reduce the time overhead of information batch write-in.Compared with the existing commercial RFID system information write-in method, the application at least reduces 25% of time overhead, shows greater performance improvement under various parameter environments, and has good robustness and expansibility.

Description

Technical Field

[0001] This invention relates to the field of wireless sensing algorithms for the Internet of Things, and more specifically, to a batch writing method for information in a commercial RFID system based on sequence optimization. Background Technology

[0002] Radio Frequency Identification (RFID), as a core technology of the IoT sensing layer, provides multimodal sensing data to facilitate intelligent decision-making. It is a key technology supporting the large-scale application of the IoT and realizing the vision of "intelligent connectivity of everything," and is widely used in transportation, manufacturing, logistics, retail, security, defense, and many other fields. A typical RFID communication system consists of three main parts: 1) Tags: Each tag has a unique ID (electronic code). Passive tags can capture energy from the radio frequency signals emitted by the reader and communicate with it, but passive tags cannot communicate with each other; 2) Readers: Readers can write data to tags via radio frequency signals and read information about stored items and sensing-related data from tags; 3) Back-end servers: These connect to the readers via high-speed transmission and provide powerful computing and storage capabilities for the system. RFID technology identifies target objects and performs wireless sensing tasks by attaching (embedding) tags to them, thereby achieving real-time monitoring of the target object's status. RFID has the technical characteristics of non-line-of-sight communication and long communication distance, which overcomes the shortcomings of traditional barcode technology. Moreover, it is low in cost and easy to deploy.

[0003] Information writing is one of the most fundamental and crucial tasks in commercial RFID systems. As the current standard for commercial RFID systems, the C1G2 protocol specifies that an information writing cycle consists of three steps: Select, Inventory, and Access. Select chooses a subset of tags to participate in the subsequent Inventory and Access steps; Inventory verifies and identifies the tags selected; and Access writes the information to the tags selected and verified by Inventory. Optimizing batch writing hinges on reducing the time overhead of the Select step, which is due to three reasons: First, the clever design of Select fully utilizes the potential of batch processing, thereby minimizing the number of writing cycles and reducing writing time overhead; second, the Select step accounts for 60% of the total writing cycle time, while the other two steps account for only 40%; and finally, Select is modifiable, while Inventory and Access are not.

[0004] The Select command is primarily implemented by five parameters: Action, Pointer, MemBank, Length, and Mask. MemBank specifies the storage location of the content to be compared with the Mask. The content in each tag's MemBank is called the tag's pseudo-ID. Pointer and Length specify the starting position for comparison with the Mask and the length of the comparison, respectively, within the tag's pseudo-ID. Mask specifies the mask to be applied to Pointer and Length. Using these four parameters, the reader can classify tags into two categories: tags with pseudo-IDs matching the specified Mask are called target tags, otherwise they are called non-target tags. Target tags are the set of tags that the reader needs to write information to. The reader can use Action to set the flag of target tags to A or B, and set the flag of non-target tags to the opposite value. Tags with only flags A or B (i.e., target tags) are selected for subsequent Inventory and Access operations, while non-target tags with the opposite flag value are excluded from this write cycle.

[0005] exist Figure 1 To further clarify the Select instruction, an RFID system is given, where t1 to t6 are six tags in the system. To select tags t3 and t4 for the Inventory and Access steps, the reader can send the instruction Select{000, 5, 3, 111}, where Action=000, Pointer=5, Length=3, and Mask=111. Upon receiving the Select instruction, each tag compares a substring of length 3 starting from the 5th bit of its pseudo-ID with Mask=111. Tags with a substring matching the Mask are target tags, otherwise they are non-target tags. As shown in Table 1, based on Action=000, target tags t3 and t4 will set their flag bits to A, while non-target tags will set their flag bits to B. Therefore, the reader can select t3 and t4 by only allowing tags with tag A to participate in the current write cycle. Similarly, Select can also indirectly select target tags by using different functions of Action to exclude non-target tags.

[0006] Table 1: Action parameters in the Select command

[0007]

[0008] Currently, only EW, WB, and GWB RFID batch write algorithms are compatible with the C1G2 protocol. The EW algorithm performs batch writing by writing information to target tags one by one. This method can be deployed in commercial tags, but it is very time-consuming. To improve time efficiency, the WB algorithm bundles multiple tags together for batch processing, thereby reducing the number of Select commands used, but it does not support applications with a large number of tags. To further improve efficiency, the GWB algorithm enables large-scale RFID system deployment by grouping tags. Summary of the Invention

[0009] This invention provides a batch writing method for information in a commercial RFID system based on sequence optimization, which further improves the efficiency of batch writing of information in large-scale commercial RFID systems.

[0010] To solve the above-mentioned technical problems, the technical solution of the present invention is as follows:

[0011] A batch writing method for information in a commercial RFID system based on sequence optimization includes the following steps:

[0012] S1: Construct the tag binding vector, which serves as the tag's pseudo ID;

[0013] S2: Utilizing the different functions defined by the Action parameters of the C1G2 protocol, based on the design of the binding vector, the optimal decision is made among selecting target tags, excluding non-target tags, and combining the two to obtain the batch writing Select instruction sequence, minimizing the number of Select instructions used.

[0014] S3: The reader writes information into all target tags in the RFID system according to the Select instruction sequence of the batch writing.

[0015] Furthermore, the bundling vector BV mentioned in step S1 includes BID, continuous tag bundling code CBC, and discrete tag bundling code DBC, where BID represents the tag group, the continuous tag bundling code CBC is used to bundle consecutive tags together for selection or exclusion by the Select instruction, and the discrete tag bundling code DBC is used to bundle discrete tags together for selection or exclusion by the Select instruction.

[0016] Furthermore, the BID is a A binary string of length 1 bit, in which all of the bits are... N The tags are divided into B groups of equal size, and the number of tags in each group includes... n A tag, n=N / B.

[0017] Furthermore, the continuous tag bundle encoding (CBC) is an n-bit binary sequence, and the first bit of each group... i Tag t i Continuous tag bundle encoding CBC The value of one bit is set to "1", while the values ​​of the other bits are set to "0".

[0018] Furthermore, the discrete label bundled encoding DBC is a A binary string of length 1 bit, including a character composed of... q The length of the "01" combination is 2 q The first tag of each group of bits. t The discrete label bundle encoding of DBC uses bits 1 through 2. q The bit is set as the substring, the _ bit is set as the _ _ bit _ i Tag t i The substring position of discrete label bundle encoding DBC is determined by the first... i -1 tag t i-1 The substring position is obtained by cyclically shifting one position to the right.

[0019] Furthermore, step S2 specifically includes the following steps:

[0020] S2.1: Construct a guide vector IV, which indicates which bits in the binding vector BV can be used to select a target label or exclude a non-target label;

[0021] S2.2: Utilizing the different functions defined by the Action parameters of the C1G2 protocol, make the optimal decision among selecting target tags, excluding non-target tags, and combining the two to obtain the Select instruction sequence for batch writing.

[0022] Furthermore, the guiding vector IV mentioned in step S2.1 is specifically as follows:

[0023] A guide vector IV corresponds to a set of tags. The guide vector IV is constructed based on the continuous tag binding code (CBC) and discrete tag binding code (DBC) of the tags. The bit length of the guide vector IV is the sum of the bit lengths of the continuous tag binding code (CBC) and the discrete tag binding code (DBC). Each bit in the guide vector IV corresponds one-to-one with a bit in the continuous tag binding code (CBC) and the discrete tag binding code (DBC). For a certain bit in the guide vector IV, if only the target tag has a bit value of "1" in the corresponding continuous tag binding code (CBC) and the discrete tag binding code (DBC) of this bit, this bit is called a T bit; if only the non-target tag has a bit value of "1" in the corresponding continuous tag binding code (CBC) and the discrete tag binding code (DBC) of this bit, this bit is called an N bit; other bits are called H bits. In the guide vector IV, all N bits are set to "0", and the other bits are set to "1".

[0024] Furthermore, in step S2.2, an optimal decision is made among selecting the target label, excluding non-target labels, and combining the two. The strategy for selecting the target label is specifically as follows:

[0025] At the beginning, all tags in the group are marked as unselected;

[0026] In each iteration, the reader identifies a 1-run that can cover the maximum number of unselected target tags and constructs a Select instruction containing the Mask corresponding to that 1-run. Then, it uses this instruction to select these tags. The 1-run is a sequence of consecutive "1"s, and the shortest 1-run is a single 1.

[0027] Repeat the above iterations until all target labels in the group are selected.

[0028] Furthermore, in step S2.2, an optimal decision is made among selecting the target label, excluding non-target labels, and combining the two. The strategy for excluding non-target labels is as follows:

[0029] Use BID to exclude tags that are not in the group, and then use the 0-run corresponding to N bits to exclude non-target tags in the group. The 0-run is a sequence of consecutive "0"s, and the shortest 0-run is a single 0.

[0030] By employing a greedy strategy, non-target labels are excluded using the minimum number of Select commands.

[0031] Furthermore, in step S2.2, an optimal decision is made among selecting target labels, excluding non-target labels, and combining the two. One strategy that combines selecting target labels and excluding non-target labels is:

[0032] Greedily select one or more 0-run or 1-run in the constructed guide vector IV to form one or more Select instructions, and select a set of tags that can completely cover the target tag;

[0033] The reader uses 0-run to exclude non-target tags from the set selected in step 1;

[0034] Another strategy is:

[0035] Exclude a tag set that completely covers non-target tags, select target tags not covered by that tag set, and then select target tags from that tag set.

[0036] Compared with the prior art, the beneficial effects of the technical solution of the present invention are:

[0037] This invention provides a batch writing method for commercial RFID systems based on sequence optimization. This method utilizes a novel tag-binding vector data structure and a sequence writing optimization strategy to address the batch information writing problem in large-scale commercial RFID systems. It offers a highly efficient (lightweight) strategy and provides a reference for future inventions and designs in this field. Compared to existing commercial RFID system information writing methods, this lightweight method reduces time overhead by at least 25% and demonstrates good robustness in experimental simulation environments. Attached Figure Description

[0038] Figure 1 This is a schematic diagram illustrating the principle of the Select instruction in this invention.

[0039] Figure 2 This is a schematic diagram of the method flow of the present invention.

[0040] Figure 3 A schematic diagram of the structural design of the binding vector provided in an embodiment of the present invention.

[0041] Figure 4 This is a schematic diagram illustrating the functions of each structure of the binding vector provided in an embodiment of the present invention.

[0042] Figure 5 The illustrations provided in this embodiment of the invention illustrate a strategy based on selecting target labels and a strategy based on excluding non-target labels.

[0043] Figure 6 This is a schematic diagram illustrating a strategy that combines selecting target labels and excluding non-target labels in an example of the present invention.

[0044] Figure 7 Parameters in the embodiments of the present invention A diagram illustrating the impact on the performance of the CTB algorithm.

[0045] Figure 8 The confidence interval parameter in the embodiments of the present invention Number of Select instructions required for each algorithm Schematic diagram of the impact.

[0046] Figure 9 The significance level parameter in the embodiments of the present invention Number of Select instructions required for each algorithm Schematic diagram of the impact.

[0047] Figure 10 The tag loss ratio in this embodiment of the invention Total execution time of each algorithm Schematic diagram of the impact. Detailed Implementation

[0048] The accompanying drawings are for illustrative purposes only and should not be construed as limiting the invention.

[0049] To better illustrate this embodiment, some parts in the accompanying drawings may be omitted, enlarged, or reduced, and do not represent the actual product dimensions;

[0050] It will be understood by those skilled in the art that certain well-known structures and their descriptions may be omitted in the accompanying drawings.

[0051] The technical solution of the present invention will be further described below with reference to the accompanying drawings and embodiments.

[0052] Example 1

[0053] This embodiment provides a batch writing method for information in a commercial RFID system based on sequence optimization, such as... Figure 2 As shown, it includes the following steps:

[0054] S1: Construct the tag binding vector, which serves as the tag's pseudo-ID;

[0055] S2: Utilizing the different functions defined by the Action parameters of the C1G2 protocol, based on the design of the binding vector, the optimal decision is made among selecting target tags, excluding non-target tags, and combining the two to obtain the batch writing Select instruction sequence, minimizing the number of Select instructions used.

[0056] S3: The reader writes information into all target tags in the RFID system according to the Select instruction sequence of the batch writing.

[0057] Example 2

[0058] This embodiment, based on Embodiment 1, continues to disclose the following content:

[0059] The binding vector BV mentioned in step S1 is as follows: Figure 2 As shown, it includes BID, Continuous Tag Bundling Code (CBC), and Discrete Tag Bundling Code (DBC), where BID represents the tag group, the Continuous Tag Bundling Code (CBC) is used to bundle consecutive tags together for selection or exclusion by the Select command, and the Discrete Tag Bundling Code (DBC) is used to bundle discrete tags together for selection or exclusion by the Select command.

[0060] The BID is one A binary string of length 1 bit, in which all of the bits are... N The tags are divided into B groups of equal size, and the number of tags in each group includes... n A tag, n=N / B. In a specific embodiment, such as Figure 4 As shown in the box in the BID area, the reader can broadcast the command Select{000, 1, 3, 001} to select the tag with group number "001".

[0061] The continuous tag bundle encoding (CBC) is an n-bit binary sequence, and the first bit of each group... i Tag t i Continuous tag bundle encoding CBC The value of one bit is set to "1", while the values ​​of other bits are set to "0". In a specific embodiment, such as... Figure 4 As shown in the box within the CBC area, the reader can broadcast the command Select{010, 7, 3,000} to select tags t3, t4, and t5. Since only tags t3, t4, and t5 do not match the Mask in this Select, their flag bits will be set to B according to Action=010 (as shown in Table 1), while the flag bits of the other tags remain unchanged. Therefore, the reader can select only the tags with flag bits set to B (t3, t4, and t5) to participate in the current write cycle, while the other tags are excluded from this write cycle.

[0062] The discrete label bundling code DBC is a A binary string of length 1 bit, including a character composed of... q The length of the "01" combination is 2 q The first tag of each group of bits. t The discrete label bundle encoding of DBC uses bits 1 through 2. q The bit is set as the substring, the _ bit is set as the _ _ bit _ i Tag t i The substring position of discrete label bundle encoding DBC is determined by the first... i-1 tag t i-1 The substring position is obtained by cyclically shifting one bit to the right. In a specific embodiment, the basic principle of DBC design is to utilize the alternating distribution of bit values ​​"0" and "1" in each column, enabling the reader to select or exclude discrete tags. For example... Figure 4 As shown in the box for the 16th bit, the reader can use the value "1" on this bit to form the instruction Select{000,16, 1, 1} to select tags t2, t4, and t8. Another example is... Figure 4 As shown in the box for the 19th bit, the reader can use the instruction Select{010, 19, 1, 1} to select t1, t2, t4, t6, and t8.

[0063] In this embodiment, k The optimal value is: , q The optimal value is or .

[0064] Example 3

[0065] Based on Examples 1 and 2, this embodiment continues to disclose the following content:

[0066] Based on the BV design, this method can further optimize the batch write sequence by utilizing the different functions specified by Action in Table 1. It makes the optimal decision between selecting target tags, excluding non-target tags, and combining the two, minimizing the number of Select commands used, thereby significantly reducing time overhead. The reader executes batch write tasks group by group according to the BID group number. For any group of tags (assumed to be group "001"), the specific execution process in this stage is as follows:

[0067] S2.1: Construct a guide vector IV, which indicates which bits in the binding vector BV can be used to select a target label or exclude a non-target label;

[0068] S2.2: Utilizing the different functions defined by the Action parameters of the C1G2 protocol, make the optimal decision among selecting target tags, excluding non-target tags, and combining the two to obtain the Select instruction sequence for batch writing.

[0069] The guiding vector IV mentioned in step S2.1 is specifically as follows:

[0070] A guide vector IV corresponds to a set of tags. The guide vector IV is constructed based on the continuous tag binding code (CBC) and discrete tag binding code (DBC) of the tags. The bit length of the guide vector IV is the sum of the bit lengths of the continuous tag binding code (CBC) and the discrete tag binding code (DBC). Each bit in the guide vector IV corresponds one-to-one with a bit in the continuous tag binding code (CBC) and the discrete tag binding code (DBC). For a given bit in the guide vector IV, if only the target tag has a bit value of "1" in its corresponding continuous tag binding code (CBC) and discrete tag binding code (DBC), this bit is called a T bit; if only non-target tags have a bit value of "1" in its corresponding continuous tag binding code (CBC) and discrete tag binding code (DBC), this bit is called an N bit; other bits are called H bits. In the guide vector IV, all N bits are set to "0", and the other bits are set to "1". In a specific embodiment, such as... Figure 5 As shown in (a), given target tags t1, t3, t6, and t7 in the system, the reader can create an IV as follows: Figure 5 As shown in (b), the bits with indices 5, 6, 9, 11, and 15 are T bits, the bits with indices 4, 7, 8, 10, and 16 are N bits, and the remaining bits are H bits.

[0071] In step S2.2, an optimal decision is made among selecting the target label, excluding non-target labels, and combining the two. The strategy for selecting the target label is as follows:

[0072] At the beginning, all tags in the group are marked as unselected;

[0073] In each iteration, the reader identifies a 1-run that can cover the maximum number of unselected target tags and constructs a Select instruction containing the Mask corresponding to that 1-run. Then, it uses this instruction to select these tags. The 1-run is a sequence of consecutive "1"s, and the shortest 1-run is a single 1.

[0074] Repeat the above iterations until all target labels in the group are selected.

[0075] In a specific embodiment, by specifying 1-run, the reader can use the 1-run in the IV to select the target tag. Figure 5 In (b), the two bits at indices 5 and 6 in the IV (corresponding to target tags t6 and t7 in group "001") are both 1, thus forming a 1-run of size 2. Therefore, the reader can use this 1-run to generate the instruction Select{000, 5, 2, 11} to select target tags t6 and t7.

[0076] like Figure 5 In the example shown in (b), in the first iteration, the reader recognizes that the 1-run of size 1 corresponding to bit T at index 15 in the IV covers the largest portion of target tags t1, t3, t6, and t7 within the "001" group, namely t1, t3, and t7. Therefore, the reader uses Select{000, 15, 1,1} to select them. In the second iteration, since only target tag t6 is not selected, the reader uses the 1-run of size 1 corresponding to bit T at index 6 to select it using the instruction Select{000,6, 1,1}. Finally, the reader uses Select{010, 1, 3, 001} to exclude tags not within the "001" group.

[0077] In step S2.2, an optimal decision is made among selecting target labels, excluding non-target labels, and combining the two. The strategy for excluding non-target labels is as follows:

[0078] Use BID to exclude tags that are not in the group, and then use the 0-run corresponding to N bits to exclude non-target tags in the group. The 0-run is a sequence of consecutive "0"s, and the shortest 0-run is a single 0.

[0079] By employing a greedy strategy, non-target labels are excluded using the minimum number of Select commands.

[0080] like Figure 5 As shown in (c), given that t2, t4, t6, t7, and t8 are target tags in group "001" and t1, t3, and t5 are non-target tags, the reader first excludes all tags in other groups using the instruction Select{100, 1, 3, 001}. Since the 1-run of size 1 corresponding to the Nth bit at index 17 in the IV covers all non-target tags in group "001", the reader then excludes non-target tags t1, t3, and t5 using the instruction Select{110, 17, 1, 0}, leaving only target tags t2, t4, t6, t7, and t8 selected.

[0081] In step S2.2, an optimal decision is made among selecting target labels, excluding non-target labels, and combining the two. The strategy of combining target label selection and non-target label exclusion is as follows: Figure 6 As shown, this strategy combines the above-mentioned strategies for selecting target labels and excluding non-target labels. One of these strategies is as follows:

[0082] Greedily select one or more 0-run or 1-run in the constructed guide vector IV to form one or more Select instructions, and select a set of tags that can completely cover the target tag;

[0083] The reader uses 0-run to exclude non-target tags from the set selected in step 1;

[0084] Symmetrically, another strategy is:

[0085] Exclude a tag set that can completely cover non-target tags, select target tags that are not covered by that tag set, and then select target tags from that tag set.

[0086] Because the C1G2 standard specifies that Inventory and Access operations are fixed and cannot be modified, the reader / writer cannot reduce the time overhead of these two operations. After locking and selecting the target tag of group "001", the reader / writer will perform the Inventory and Access operations to write the information into the target tag of that group.

[0087] Repeat the above steps for each group of tags until the information is written to all target tags in the RFID system.

[0088] The performance of the embodiments of the present invention will be demonstrated below.

[0089] The parameters are defined as follows: This indicates the total number of tags in the RFID system. Indicates the number of target tags. This indicates the size of the user's storage space for the tag. Indicates the selection of each algorithm The number of Select commands required for each label Indicates the selection of each algorithm Total execution time for each tag, parameters B and k The default values ​​are set to 5 and 20 respectively. In this embodiment, the method proposed in this invention is called the CTB algorithm.

[0090] like Figure 7 As shown in (a) and 7(b), in this implementation case, when As the CTB of the algorithm increases, the number of Select instructions and the time overhead exhibit a wave-like trend. When or At this time, the number of Select instructions and time overhead required by the algorithm CTB of this invention reach a minimum.

[0091] like Figure 8 As shown in (a) and 8(b), with As the number of selections required by the EW algorithm increases linearly, other methods show a trend of first increasing and then decreasing. The CTB algorithm consistently outperforms other algorithms and reduces time overhead by at least 34% compared to the current best algorithm, WB.

[0092] like Figure 9 As shown in (a) and 9(b), with As the number of Select instructions required by all algorithms increases, the CTB algorithm significantly outperforms other algorithms, reducing time overhead by at least 32.6% compared to the existing best algorithms WB and GWB. Furthermore, the CTB algorithm exhibits minimal performance fluctuations and demonstrates optimal stability.

[0093] like Figure 10 As shown in (a) and 10(b), with With continuous growth, the execution time of the EW algorithm increases linearly and significantly, while other algorithms increase slowly. The CTB algorithm consistently maintains the best performance, with a significantly smaller slope than other algorithms, further demonstrating its good scalability and robustness.

[0094] Overall, this implementation case demonstrates the following conclusions: 1) Parameters and The number of instructions required for each algorithm has a significant impact, while other parameters have a smaller impact; 2) The number of instructions required for the EW algorithm varies with... The increase is linear, while other algorithms first increase and then decrease. The maximum value is reached at the point; 3) The CTB algorithm is superior to other algorithms in terms of time overhead, scalability and stability, and shows a significant improvement in algorithm performance.

[0095] The same or similar labels correspond to the same or similar parts;

[0096] The terms used to describe positional relationships in the accompanying drawings are for illustrative purposes only and should not be construed as limiting the invention.

[0097] Obviously, the above embodiments of the present invention are merely examples for clearly illustrating the present invention, and are not intended to limit the implementation of the present invention. Those skilled in the art can make other variations or modifications based on the above description. It is neither necessary nor possible to exhaustively describe all embodiments here. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of the present invention should be included within the scope of protection of the claims of the present invention.

Claims

1. A batch information writing method for a commercial RFID system based on sequence optimization, characterized in that, Includes the following steps: S1: Construct the tag binding vector, which serves as the tag's pseudo ID; S2: Utilizing the different functions defined by the Action parameters of the C1G2 protocol, based on the design of the binding vector, the optimal decision is made among selecting target tags, excluding non-target tags, and combining the two to obtain the batch writing Select instruction sequence, minimizing the number of Select instructions used. S3: The reader writes information into all target tags in the RFID system according to the selected instruction sequence of the batch writing; Step S2 specifically includes the following steps: S2.1: Construct a guide vector IV, which indicates which bits in the binding vector BV can be used to select a target label or exclude a non-target label; S2.2: Utilize the different functions defined by the Action parameter of the C1G2 protocol to make the optimal decision among selecting target tags, excluding non-target tags, and combining the former two, and obtain the Select instruction sequence for batch writing; The guiding vector IV mentioned in step S2.1 is specifically as follows: A guide vector IV corresponds to a set of tags. The guide vector IV is constructed based on the continuous tag binding code (CBC) and discrete tag binding code (DBC) of the tags. The bit length of the guide vector IV is the sum of the bit lengths of the continuous tag binding code (CBC) and the discrete tag binding code (DBC). Each bit in the guide vector IV corresponds one-to-one with a bit in the continuous tag binding code (CBC) and the discrete tag binding code (DBC). For a certain bit in the guide vector IV, if only the target tag has a bit value of "1" in the corresponding continuous tag binding code (CBC) and the discrete tag binding code (DBC) of this bit, this bit is called a T bit. If only the non-target tag has a bit value of "1" in the corresponding continuous tag binding code (CBC) and the discrete tag binding code (DBC) of this bit, this bit is called an N bit. Other bits are called H bits. In the guide vector IV, all N bits are set to "0", and the other bits are set to "1".

2. The batch writing method for commercial RFID system information based on sequence optimization according to claim 1, characterized in that, The bundling vector BV mentioned in step S1 includes BID, continuous tag bundling code CBC, and discrete tag bundling code DBC, where BID represents the tag group, the continuous tag bundling code CBC is used to bundle consecutive tags together for selection or exclusion by the Select instruction, and the discrete tag bundling code DBC is used to bundle discrete tags together for selection or exclusion by the Select instruction.

3. The batch writing method for commercial RFID systems based on sequence optimization according to claim 2, characterized in that, The BID is one A binary string of length 1 bit, in which all of the bits are... N The tags are divided into B groups of equal size, and the number of tags in each group includes... n A tag, n=N / B.

4. The batch writing method for commercial RFID systems based on sequence optimization according to claim 3, characterized in that, The continuous tag bundle encoding (CBC) is an n-bit binary sequence, and the first bit of each group... i Tag t i Continuous tag bundle encoding CBC The value of one bit is set to "1", while the values ​​of the other bits are set to "0".

5. The batch writing method for commercial RFID system information based on sequence optimization according to claim 4, characterized in that, The discrete label bundling code DBC is a A binary string of length 1 bit, including a character composed of... q The length of the "01" combination is 2 q The first tag of each group of bits. t The discrete label bundle encoding of DBC uses bits 1 through 2. q The bit is set as the substring, the _ bit is set as the _ _ bit _ i Tag t i The substring position of discrete label bundle encoding DBC is determined by the first... i -1 tag t i-1 The substring position is obtained by cyclically shifting one position to the right.

6. The batch writing method for commercial RFID systems based on sequence optimization according to claim 5, characterized in that, In step S2.2, an optimal decision is made among selecting the target label, excluding non-target labels, and combining the two. The strategy for selecting the target label is as follows: At the beginning, all tags in the group are marked as unselected; In each iteration, the reader identifies a 1-run that can cover the maximum number of unselected target tags and constructs a Select instruction containing the Mask corresponding to that 1-run. Then, it uses this instruction to select these tags. The 1-run is a sequence of consecutive "1"s, and the shortest 1-run is a single 1. Repeat the above iterations until all target labels in the group are selected.

7. The batch writing method for commercial RFID system information based on sequence optimization according to claim 5, characterized in that, In step S2.2, an optimal decision is made among selecting target labels, excluding non-target labels, and combining the two. The strategy for excluding non-target labels is as follows: Use BID to exclude tags that are not in the group, and then use the 0-run corresponding to N bits to exclude non-target tags in the group. The 0-run is a sequence of consecutive "0"s, and the shortest 0-run is a single 0. By employing a greedy strategy, non-target labels are excluded using the minimum number of Select commands.

8. The batch writing method for commercial RFID system information based on sequence optimization according to claim 6 or 7, characterized in that, In step S2.2, an optimal decision is made among selecting target labels, excluding non-target labels, and combining the two. One strategy that combines selecting target labels and excluding non-target labels is: Greedily select one or more 0-run or 1-run in the constructed guide vector IV to form one or more Select instructions, and select a set of tags that can completely cover the target tag; The reader uses 0-run to exclude non-target tags from the set selected in step 1; Another strategy is: Exclude a tag set that can completely cover non-target tags, select target tags that are not covered by that tag set, and then select target tags from that tag set.

Images