Universal parameter construction method and system for multi-label parallel communication

Abstract

The application provides a general parameter construction method and system for multi-tag parallel communication, and belongs to the technical field of passive Internet of Things and backscattering communication. The application effectively solves the interference problem of multi-tag parallel reflection communication in a sensor network. Since the problem is essentially NP-hard, the traditional search traversal method is difficult to complete in polynomial time. Through a phased processing mechanism, the application can give reliable interference-free parameter configuration results within an acceptable time. The method has good universality and expandability, and provides an efficient and reliable solution for multi-tag parallel communication in a sensor network.

Description

Technical Field

[0001] This invention relates to the fields of passive Internet of Things (IoT) and backscatter communication technology, specifically to a general parameter construction method and system for multi-tag parallel communication. Background Technology

[0002] Backscattering technology, with its inherent low power consumption and low cost, has become an important research direction and development trend in the field of wireless communication, especially in passive Internet of Things (IoT) and sensor network applications. In a typical backscattering system, the reader transmits a carrier signal, and the tag transmits data by modulating and reflecting this carrier signal. However, since the power of the reflected signal is much lower than that of the transmitted carrier signal, the system often faces severe in-band interference, meaning that the reader has difficulty accurately extracting the weak reflected signal from the strong carrier, which greatly limits communication performance and range.

[0003] To alleviate this problem, frequency shifting technology has been introduced into backscatter communication. The core idea is to shift the spectrum of the tag's reflected signal to a frequency band different from the original carrier, thereby avoiding direct interference from the reader carrier and improving link quality. However, traditional frequency shifting methods often generate harmonic components in practice. These harmonics can not only disperse the energy of the useful signal and reduce the signal power within the target frequency band, but also interfere with adjacent channels. Especially in scenarios where multiple tags are deployed for parallel communication, new interference may arise between different tag signals (including their fundamental frequency and harmonics), complicating spectrum planning and resource allocation for multi-user access.

[0004] Existing technologies often face challenges in addressing interference issues in multi-tag parallel communication, especially after considering the harmonic effects introduced by frequency shifting. These challenges include high computational complexity (e.g., NP-hard problems), making it difficult to find the optimal interference-free parameter configuration within polynomial time. Therefore, this invention aims to overcome these technical shortcomings by proposing a method for efficiently constructing a general set of selectable channels in multi-user frequency-shift access scenarios. This method effectively solves the interference problem in multi-tag parallel reflection communication in sensor networks and provides a highly efficient, reliable, and versatile solution for practical applications. Summary of the Invention

[0005] The purpose of this invention is to provide a general parameter construction method and system for multi-tag parallel communication, so as to realize the parallel communication of multiple tags in sensor networks and solve at least one of the technical problems existing in the background art.

[0006] To achieve the above objectives, the present invention adopts the following technical solution:

[0007] In a first aspect, the present invention provides a general parameter construction method for multi-tag parallel communication, comprising:

[0008] Configure different parameters for each tag to gradually shift the fundamental frequency of each frequency-shifted signal, and calculate the range of each frequency-shifted signal in the frequency band;

[0009] Determine if the maximum input Miller subcarrier parameter is less than a preset threshold; if so, construct an adjacency matrix based on the current Miller subcarrier parameter set, and solve for the set of non-interfering Miller subcarrier parameters that the tag can use during backscatter communication by traversing backtracking search; if not, take the set of Miller subcarrier parameters whose maximum value is the threshold, construct an adjacency matrix, and solve for the maximum set list of tags that can be formed by the current Miller subcarrier parameter set without interference during tag reflection communication by traversing backtracking search.

[0010] The adjacency matrix is ​​reconstructed using the input Miller subcarrier parameter set. Based on this adjacency matrix and the list of maximum sets, the maximum set of tags that can be formed by the Miller subcarrier parameter set without interference during tag reflection communication is solved by backtracking search traversal.

[0011] As a further limitation of the first aspect of the present invention, the parameter configuration includes the following key parameters: data rate r b Miller subcarrier parameter set M; sampling frequency offset sfo; odd harmonic order set H = {1, 3, 5}; for the i-th tag, the bandwidth range [L] is calculated and allocated to it. i ,R i ], avoiding the bandwidth range of the j-th label [L j ,R j ];

[0012] Among them, L i =[M i ×(1-sfo)-1]×r b ,R i =[M i ×(1+sfo)+1]×r b M i ∈M;

[0013] L j =[M j ×h b ×(1-sfo)-1]×r b ,R j =[M j ×h j ×(1+sfo)+1]×r b M j ∈M, any hb ∈H.

[0014] As a further limitation of the first aspect of this invention, since when sfo≠0, the complexity of solving for the set of mutually non-interfering Miller subcarrier parameters increases exponentially with the increase of the cardinality of M, requiring high computing power and resulting in a long solution time. It is recommended to choose a threshold of 128, i.e., a cardinality of M of 64 and a maximum Miller subcarrier parameter of 128. Selecting an appropriate threshold can significantly shorten the solution time. The threshold is set before the access process begins and is not automatically adjusted during each access process.

[0015] As a further limitation of the first aspect of the present invention, the adjacency matrix construction method is as follows: Construct an n-order adjacency matrix A, where n is the cardinality of the Miller subcarrier parameter set, and the i-th row represents the M values ​​in the Miller subcarrier parameter set. i ; Iterate through each harmonic pair combination h in the set of odd harmonic orders H = {1, 3, 5} a ,h b , where h a ,h b ∈H; Calculate the i-th label in h a The bandwidth range of the first harmonic [L] i ,R i ] and the j-th label in h b The bandwidth range of the first harmonic [L] j ,R j If the interval Let A[i,j] = 1, which means that the M selected for the i-th label is... i M selected with the j-th label j Interference exists when two tags communicate via backscatter; otherwise, setting A[i,j] = 0 indicates that the i-th tag uses M. i M selected with the j-th label j There is no interference when the two tags communicate via backscatter.

[0016] As a further limitation of the first aspect of the present invention, the specific process of the backtracking search traversal algorithm is as follows: Based on the list I of the maximum selectable set, the current Miller subcarrier parameter set M, and the currently constructed adjacency matrix A, select a set I from the list I of the maximum selectable set. k Let p = I k And generate a set of unselectable parameters F for each set in the list based on the adjacency matrix, and iterate through each m i ∈M\F, check m i Can I be added? k If possible, update I. k →I k∪{m i If I is updated, remove the set with cardinality p from I and proceed to step 1. If every set in the list I of the largest selectable sets has been traversed without any updates, output the list I of the largest selectable sets. new .

[0017] As a further limitation of the first aspect of the present invention, the initial maximum selectable set list I is empty, the cardinality p for constructing the current maximum set is 0, and the set of unselectable elements F is an empty set.

[0018] Secondly, the present invention provides a general parameter construction system for multi-tag parallel communication, comprising:

[0019] The configuration module is used to configure different parameters for each tag, so that the fundamental frequency of each frequency-shifted signal is gradually shifted, and the range of each frequency-shifted signal in the frequency band is calculated.

[0020] The judgment module is used to determine whether the maximum input Miller subcarrier parameter is less than a preset threshold. If so, it constructs an adjacency matrix based on the current Miller subcarrier parameter set and solves the set of non-interfering Miller subcarrier parameters that the tag can use during backscatter communication by traversing backtracking search. If not, it takes the set of Miller subcarrier parameters whose maximum value is the threshold, constructs an adjacency matrix, and solves the list of the maximum set of tags that can be formed by the current Miller subcarrier parameter set without interference during tag reflection communication by traversing backtracking search.

[0021] The solution module is used to reconstruct the adjacency matrix from the input Miller subcarrier parameter set, and then, based on the adjacency matrix and the list of maximum sets, solve for the maximum set of tags that can be formed by the Miller subcarrier parameter set without interference during tag reflection communication by backtracking search traversal.

[0022] Thirdly, the present invention provides a non-transitory computer-readable storage medium for storing computer instructions, which, when executed by a processor, implement the general parameter construction method for multi-tag parallel communication as described in the first aspect.

[0023] Fourthly, the present invention provides a computer device including a memory and a processor, wherein the processor and the memory communicate with each other, the memory stores program instructions executable by the processor, and the processor calls the program instructions to execute the general parameter construction method for multi-tag parallel communication as described in the first aspect.

[0024] Fifthly, the present invention provides an electronic device, comprising: a processor, a memory, and a computer program; wherein the processor is connected to the memory, the computer program is stored in the memory, and when the electronic device is running, the processor executes the computer program stored in the memory to cause the electronic device to execute instructions for implementing the general parameter construction method for multi-tag parallel communication as described in the first aspect.

[0025] The beneficial effects of this invention are as follows: By rationally configuring the Miller subcarrier parameters of the tags and fully considering the distribution of each frequency-shifting signal in the frequency band and its potential interference (including the influence of fundamental and harmonic waves) during the construction of the optional channel set, effective avoidance of inter-signal interference is achieved during the frequency shifting process, thereby ensuring the reliability of multi-user parallel transmission. This method provides a phased processing strategy for the NP-hard parameter selection problem, making it possible to obtain a reliable and universal interference-free parameter set within an acceptable timeframe without requiring complex hardware modifications. It is easy to implement in practice and provides an efficient and reliable solution for multi-user parallel access problems in RFID systems and environmental IoT (sensor network) scenarios.

[0026] The advantages of additional aspects of the invention will be set forth more clearly in the following description or will be learned by practice of the invention. Attached Figure Description

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

[0028] Figure 1 This is a flowchart of the general parameter construction method for multi-tag parallel communication according to an embodiment of the present invention.

[0029] Figure 2 This is a schematic diagram of the general set tree when the Miller subcarrier parameter is 64 in the general parameter construction method for multi-tag parallel communication based on backscatter communication described in this embodiment of the invention.

[0030] Figure 3 This is a schematic diagram of the general set extension tree when the Miller subcarrier parameter is 256, which is the general parameter construction method for multi-tag parallel communication based on backscatter communication described in the embodiment of the present invention. Detailed Implementation

[0031] Embodiments of the present invention are described in detail below, examples of which are shown in the accompanying drawings, wherein the same or similar reference numerals denote the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present invention, and should not be construed as limiting the present invention.

[0032] It will be understood by those skilled in the art that, unless otherwise defined, all terms used herein (including technical and scientific terms) have the same meaning as commonly understood by one of ordinary skill in the art to which this invention pertains.

[0033] It should also be understood that terms such as those defined in general dictionaries should be understood to have meanings consistent with their meanings in the context of the prior art, and should not be interpreted in an idealized or overly formal sense unless defined as here.

[0034] Those skilled in the art will understand that, unless specifically stated otherwise, the singular forms “a,” “an,” “the,” and “the” used herein may also include the plural forms. It should be further understood that the term “comprising” as used in this specification means the presence of the stated features, integers, steps, operations, elements, and / or components, but does not exclude the presence or addition of one or more other features, integers, steps, operations, elements, and / or groups thereof.

[0035] In the description of this specification, references to terms such as "one embodiment," "some embodiments," "example," "specific example," or "some examples," etc., indicate that a specific feature, structure, material, or characteristic described in connection with that embodiment or example is included in at least one embodiment or example of the present invention. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments or examples. Without contradiction, those skilled in the art can combine and integrate the different embodiments or examples described in this specification, as well as the features of those different embodiments or examples.

[0036] To facilitate understanding of the present invention, the present invention will be further explained and described below with reference to the accompanying drawings and specific embodiments, and the specific embodiments do not constitute a limitation on the embodiments of the present invention.

[0037] Those skilled in the art should understand that the accompanying drawings are merely schematic diagrams of embodiments, and the components in the drawings are not necessarily essential for implementing the present invention.

[0038] This invention effectively solves the interference problem in multi-tag parallel reflection communication in sensor networks. Given that this problem is inherently NP-hard, traditional search and traversal methods are difficult to complete in polynomial time. This invention, through a staged processing mechanism, can provide reliable, interference-free parameter configuration results within an acceptable timeframe. This method has good versatility and scalability, providing an efficient and reliable solution for multi-tag parallel communication in sensor networks.

[0039] Example 1

[0040] In this embodiment 1, a general parameter construction system for multi-tag parallel communication is first provided, including: a configuration module, used to configure different parameters for each tag, so that the fundamental wave of each frequency-shifting signal is gradually shifted, and to calculate the range of each frequency-shifting signal in the frequency band; a judgment module, used to judge whether the maximum input Miller subcarrier parameter is less than a preset threshold; if so, then based on the current Miller subcarrier parameter set, an adjacency matrix is ​​constructed, and a backtracking search is used to solve for the set of non-interfering Miller subcarrier parameters that the tag can use in backscatter communication; if not, then the set of Miller subcarrier parameters with the maximum value of the threshold is taken to construct an adjacency matrix, and a backtracking search is used to solve for the maximum set list of tags that can be formed by the current Miller subcarrier parameter set for non-interfering tag reflection communication; a solution module, used to reconstruct the adjacency matrix based on the input Miller subcarrier parameter set, and based on the adjacency matrix and the maximum set list, a backtracking search is used to solve for the maximum set of tags that can be formed by the Miller subcarrier parameter set for non-interfering tag reflection communication.

[0041] In this embodiment, a general parameter construction method for multi-tag parallel communication is implemented using the above-described system. This includes: configuring different parameters for each tag using a configuration module, gradually shifting the fundamental frequency of each frequency-shifting signal, and calculating the range of each frequency-shifting signal in the frequency band; determining whether the maximum input Miller subcarrier parameter is less than a preset threshold; if so, constructing an adjacency matrix based on the current Miller subcarrier parameter set, and solving for the set of non-interfering Miller subcarrier parameters that the tag can use in backscatter communication through a backtracking search; if not, taking the set of Miller subcarrier parameters whose maximum value is the threshold, constructing an adjacency matrix, and solving for the maximum set list of tags that can form non-interfering tag reflection communication using the current Miller subcarrier parameter set through a backtracking search; and reconstructing the adjacency matrix using the input Miller subcarrier parameter set, and solving for the maximum set of tags that can form non-interfering tag reflection communication using the Miller subcarrier parameter set through a backtracking search based on the adjacency matrix and the maximum set list.

[0042] The configuration module includes the following key parameters: data rate r b Miller subcarrier parameter set M; sampling frequency offset sfo; odd harmonic order set H = {1, 3, 5}; for the i-th tag, the bandwidth range [L] is calculated and allocated to it. i ,R i ], avoiding the bandwidth range of the j-th label [L j ,R j ];

[0043] Among them, L i =[M i ×(1-sfo)-1]×r b ,R i =[M i ×(1+sfo)+1]×r b M i ∈M;

[0044] L j =[M j ×h b ×(1-sfo)-1]×r b ,R j =[M j ×h j ×(1+sfo)+1]×r b M j ∈M, any h b ∈H.

[0045] Since sfo≠0, the complexity of solving for the set of non-interfering Miller subcarrier parameters increases exponentially with the increase of the cardinality of M, requiring high computing power and resulting in long solution times. It is recommended to choose a threshold of 128, i.e., a cardinality of M of 64 and a maximum of 128 Miller subcarrier parameters. Selecting an appropriate threshold can significantly shorten the solution time. The threshold is set before the access procedure begins and is not automatically adjusted during each access process.

[0046] The adjacency matrix is ​​constructed as follows: Construct an n-order adjacency matrix A, where n is the cardinality of the Miller subcarrier parameter set, and the i-th row represents the M values ​​in the Miller subcarrier parameter set. i ; Iterate through each harmonic pair combination h in the set of odd harmonic orders H = {1, 3, 5} a ,h b , where h a ,h b ∈H; Calculate the i-th label in h a The bandwidth range of the first harmonic [L] i ,R i] and the j-th label in h b The bandwidth range of the first harmonic [L] j ,R j If the interval Let A[i,j] = 1, which means that the M selected for the i-th label is... i M selected with the j-th label j Interference exists when two tags communicate via backscatter; otherwise, setting A[i,j] = 0 indicates that the i-th tag uses M. i M selected with the j-th label j There is no interference when the two tags communicate via backscatter.

[0047] The specific process of the backtracking search traversal algorithm is as follows: Based on the list I of the maximum selectable set, the current Miller subcarrier parameter set M, and the currently constructed adjacency matrix A, select a set I from the list I of the maximum selectable set. k Let p = I k And generate a set of unselectable parameters F for each set in the list based on the adjacency matrix, and iterate through each m i ∈M\F, check m i Can I be added? k If possible, update I. k →I k ∪{m i If I is updated, remove the set with cardinality p from I and proceed to step 1. If every set in the list I of the maximum selectable sets has been traversed without any updates, output the list I of the maximum selectable sets. new .

[0048] The maximum selectable set list I is initialized to be empty, the cardinality p = 0 for constructing the current maximum set, and the set of unselectable elements F = empty.

[0049] Example 2

[0050] In this embodiment 2, a method for constructing general parameters for multi-tag parallel communication based on backscatter communication is provided to realize parallel communication of multiple tags in a sensor network. For example... Figure 1 As shown, the method includes the following steps;

[0051] (1) Configure different parameters for each tag so that the fundamental frequency of each frequency shift signal is gradually shifted, and calculate the distribution of each frequency shift signal in the frequency band;

[0052] (2) Set a threshold. If the maximum input Miller subcarrier parameter is less than the threshold, jump to step (3); otherwise, jump to step (4).

[0053] (3) Based on the current Miller subcarrier parameter set, construct an adjacency matrix, and based on the adjacency matrix, traverse each Miller subcarrier parameter through backtracking search to form the largest set of tag reflection communication that does not interfere with each other.

[0054] (4) Take the set of Miller subcarrier parameters whose maximum values ​​are thresholds, construct an adjacency matrix, and use backtracking search to solve for the maximum set list I that can be formed by the current Miller subcarrier parameter set without mutual interference during tag reflection communication. Take the complete Miller subcarrier parameter set, reconstruct the adjacency matrix, and use the adjacency matrix and set list I to solve for the maximum set I that can be formed by the complete Miller subcarrier parameter set without mutual interference during tag reflection communication through backtracking search. new .

[0055] The parameter configuration in step (1) includes the following key parameters: data rate r b Miller subcarrier parameter set M; sampling frequency offset sfo; odd harmonic order set H = {1, 3, 5};

[0056] For the i-th label, the bandwidth range [L] is allocated to it by calculation. i ,R i ];

[0057] Where L i =[M i ×(1-sfo)-1]×r b ,R i =[M i ×(1+sfo)+1]×r b (where M) i ∈M);

[0058] Avoiding the bandwidth range of the j-th label [L] j ,R j ];

[0059] Where L j =[M j ×h b ×(1-sfo)-1]×r b ,R j =[M j ×h j ×(1+sfo)+1]×r b (where M) j ∈M), any h b ∈H.

[0060] The threshold selection method in step (2) is as follows:

[0061] The complexity varies depending on the computing power of the device. Since when sfo≠0, the complexity of solving for the set of mutually non-interfering Miller subcarrier parameters increases exponentially with the cardinality of M, placing high demands on the computing power of the device and resulting in a long solution time. It is recommended to choose a threshold of 128, i.e., a cardinality of M of 64 and a maximum of 128 Miller subcarrier parameters. Selecting an appropriate threshold can significantly shorten the solution time. The threshold is set before the access procedure begins and is not automatically adjusted during each access process.

[0062] The adjacency matrix construction methods in steps (3) and (4) are as follows:

[0063] (2.1) Construct an n-order adjacency matrix A, where n is the cardinality of the Miller subcarrier parameter set, and the i-th row represents the M values ​​in the Miller subcarrier parameter set. i ;

[0064] (2.2) Traversing the set of odd harmonic orders Each harmonic pair in the combination h a ,h b ,in

[0065] (2.3) Calculate the i-th label in h a The bandwidth range of the first harmonic [L] i ,R i ] and the j-th label in h b The bandwidth range of the first harmonic [L] j ,R j ];

[0066] (2.4) If the interval Let A[i,j] = 1, which means that the M selected for the i-th label is... i M selected with the j-th label j Interference exists during backscatter communication between the two tags. Otherwise, setting A[i,j] = 0 indicates that the i-th tag uses M. i M selected with the j-th label j There is no interference when the two tags communicate via backscatter.

[0067] The initialization steps (3) and (4) are as follows:

[0068] The initial list I of the maximum selectable set is empty, the cardinality p = 0 for constructing the maximum set, and the set of unselectable elements.

[0069] The specific process of the backtracking search traversal algorithm in steps (3) and (4) is as follows:

[0070] (a) Input: list I of the largest possible set, current Miller subcarrier parameter set M, and currently constructed adjacency matrix A.

[0071] (b) Select a set I from the list of the largest possible sets in the input. k Let p = I k And generate a set of unselectable parameters F for each set in the list based on the adjacency matrix, and iterate through each m i ∈M\F, check m i Can I be added? k If possible, update I. k →I k ∪{m i Otherwise, leave it unchanged and move it to the next set.

[0072] (c) If I is updated, remove the set in I with cardinality equal to p, and proceed to step (b).

[0073] (d) Given a list I of the largest selectable sets, have each set traversed without any updates, output the list I of the largest selectable sets. new .

[0074] In this embodiment, we consider multi-tag parallel communication using Miller subcarrier coding, with a data rate r. b =5kbps, the signal relocation scheme maintains a constant data rate, sfo=10%, by adjusting the Miller subcarrier parameter M i This involves shifting the spectrum of the original signal onto a spectrogram. In M... i When the maximum value is 8, the corresponding Miller subcarrier parameter set is M = {2, 4, 6, 8}. Based on this scheme, the maximum Miller subcarrier parameter set that enables interference-free backscatter communication of the tag is determined through backtracking search.

[0075] Table 1 provides an example of a non-interfering Miller subcarrier parameter set for a general parameter construction method for multi-tag parallel communication based on backscatter communication.

[0076] Table 1

[0077] 4 4 8 4，8 16 4，8，16 32 4，8，16，32 64 4，8，16，32，64 128 4，8，16，32，64，128 256 4，8，16，32，64，128，256 512 4，8，16，32，64，128，256，334，512

[0078] Given the key parameters, an adjacency matrix can be constructed:

[0079] {{0,1,1,0},{1,0,0,1},{1,0,0,1},{0,1,1,0}};

[0080] The maximum parameter set {2, 8} and {4, 6} can be obtained by backtracking and traversing the path.

[0081] Combination Figure 2 , Figure 3 As shown in this embodiment, how to expand and construct a larger set: when a smaller M=64 is given beforehand, a tree can be obtained, such as... Figure 3 As shown, all branches on the tree, such as {4,8,16,30,64} and {4,8,16,32,64}, represent multiple general sets that can be constructed when M=64. Any one of these general sets can be chosen to achieve the desired result. All tags can communicate in reverse simultaneously. For example, if four tags are currently performing backscatter communication simultaneously, and the chosen Miller subcarrier parameter set is {4,8,16,32}, but another tag wants to join, then parameter 64 can be added. Furthermore, if five tags want to join the communication, a larger Miller parameter set can be provided, such as a maximum M. i For example, if the parameter is 512, then this patented method can be used to add some parameters to each branch on the basis of the M=128 tree, so that there is no interference between the parameters on each branch, such as {4,8,16,32,64,128,228,282,512}.

[0082] In summary, this embodiment proposes a method for constructing a general set of optional channels for multi-user frequency-shift access based on backscatter communication. This method effectively shifts the spectrum of reflected signals from each tag by configuring differentiated Miller subcarrier parameters for different devices (tags). Combined with adjacency matrices and backtracking search (and extension) algorithms, it systematically constructs a set of non-interfering parameters, effectively avoiding mutual interference caused by spectrum overlap during parallel reflection communication, thus ensuring the reliability of multi-user parallel communication.

[0083] This method effectively avoids the interference problem that exists in multi-tag parallel reflection communication in sensor networks. Especially when the Miller subcarrier parameter set is large and constitutes an NP-hard problem, it can provide a relatively reliable result with good versatility and scalability in a short time. Moreover, this method does not require major modifications to the hardware facilities, the scheme is relatively simple, and it is easy to implement in practice.

[0084] Example 3

[0085] This embodiment 3 provides a non-transitory computer-readable storage medium for storing computer instructions. When these computer instructions are executed by a processor, they implement the general parameter construction method for multi-tag parallel communication as described above. This method includes:

[0086] Configure different parameters for each tag to gradually shift the fundamental frequency of each frequency-shifted signal, and calculate the range of each frequency-shifted signal in the frequency band;

[0087] Determine if the maximum input Miller subcarrier parameter is less than a preset threshold; if so, construct an adjacency matrix based on the current Miller subcarrier parameter set, and solve for the set of non-interfering Miller subcarrier parameters that the tag can use during backscatter communication by traversing backtracking search; if not, take the set of Miller subcarrier parameters whose maximum value is the threshold, construct an adjacency matrix, and solve for the maximum set list of tags that can be formed by the current Miller subcarrier parameter set without interference during tag reflection communication by traversing backtracking search.

[0088] The adjacency matrix is ​​reconstructed using the input Miller subcarrier parameter set. Based on this adjacency matrix and the list of maximum sets, the maximum set of tags that can be formed by the Miller subcarrier parameter set without interference during tag reflection communication is solved by backtracking search traversal.

[0089] Example 4

[0090] This embodiment 4 provides a computer device, including a memory and a processor, wherein the processor and the memory communicate with each other, the memory stores program instructions executable by the processor, and the processor calls the program instructions to execute the general parameter construction method for multi-tag parallel communication as described above, the method including:

[0091] Configure different parameters for each tag to gradually shift the fundamental frequency of each frequency-shifted signal, and calculate the range of each frequency-shifted signal in the frequency band;

[0092] Determine if the maximum input Miller subcarrier parameter is less than a preset threshold; if so, construct an adjacency matrix based on the current Miller subcarrier parameter set, and solve for the set of non-interfering Miller subcarrier parameters that the tag can use during backscatter communication by traversing backtracking search; if not, take the set of Miller subcarrier parameters whose maximum value is the threshold, construct an adjacency matrix, and solve for the maximum set list of tags that can be formed by the current Miller subcarrier parameter set without interference during tag reflection communication by traversing backtracking search.

[0093] The adjacency matrix is ​​reconstructed using the input Miller subcarrier parameter set. Based on this adjacency matrix and the list of maximum sets, the maximum set of tags that can be formed by the Miller subcarrier parameter set without interference during tag reflection communication is solved by backtracking search traversal.

[0094] Example 5

[0095] This embodiment 5 provides an electronic device, including: a processor, a memory, and a computer program; wherein, the processor is connected to the memory, and the computer program is stored in the memory. When the electronic device is running, the processor executes the computer program stored in the memory to cause the electronic device to execute instructions for implementing the general parameter construction method for multi-tag parallel communication as described above, the method including:

[0096] Configure different parameters for each tag to gradually shift the fundamental frequency of each frequency-shifted signal, and calculate the range of each frequency-shifted signal in the frequency band;

[0097] Determine if the maximum input Miller subcarrier parameter is less than a preset threshold; if so, construct an adjacency matrix based on the current Miller subcarrier parameter set, and solve for the set of non-interfering Miller subcarrier parameters that the tag can use during backscatter communication by traversing backtracking search; if not, take the set of Miller subcarrier parameters whose maximum value is the threshold, construct an adjacency matrix, and solve for the maximum set list of tags that can be formed by the current Miller subcarrier parameter set without interference during tag reflection communication by traversing backtracking search.

[0098] The adjacency matrix is ​​reconstructed using the input Miller subcarrier parameter set. Based on this adjacency matrix and the list of maximum sets, the maximum set of tags that can be formed by the Miller subcarrier parameter set without interference during tag reflection communication is solved by backtracking search traversal.

[0099] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, systems, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0100] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1A device that provides the functions specified in one or more boxes.

[0101] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0102] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment, whereby a series of operational steps are performed to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0103] While the specific embodiments of the present invention have been described above in conjunction with the accompanying drawings, this is not intended to limit the scope of protection of the present invention. Those skilled in the art should understand that, based on the technical solutions disclosed in the present invention, various modifications or variations that can be made by those skilled in the art without creative effort should be included within the scope of protection of the present invention.

Claims

1. A general parameter construction method for multi-tag parallel communication, characterized in that, include: Different parameters are configured for each tag to gradually shift the fundamental frequency of each frequency-shifted signal, and the range of each frequency-shifted signal in the frequency band is calculated. The parameter configuration includes the following parameters: data rate. Miller subcarrier parameter set Sampling frequency offset Set of odd harmonic orders For the i-th label, the bandwidth range allocated to it is calculated. Avoid the bandwidth range of the j-th label ;in, , , ; , , , any ; Determine if the maximum input Miller subcarrier parameter is less than a preset threshold: If so, then based on the current Miller subcarrier parameter set, construct an adjacency matrix, and solve for the set of non-interfering Miller subcarrier parameters that the tag can use during backscatter communication using a backtracking search traversal algorithm; the adjacency matrix construction method includes: constructing an n-order adjacency matrix A, where n is the cardinality of the Miller subcarrier parameter set, and the i-th row represents the values ​​of the Miller subcarrier parameters in the set. ; Traverse the set of odd harmonic orders Each harmonic pair combination ,in ; Calculate the i-th label in Bandwidth range of first harmonics and the j-th label in Bandwidth range of first harmonics If the interval Let A[i,j] = 1, which means that the i-th label is selected. The one selected with the j-th label Interference exists when two tags communicate via backscatter; otherwise, let A[i,j]=0, which means that the i-th tag is selected. The one selected with the j-th label There is no interference when the two tags communicate via backscattering; the specific process of the backtracking search traversal algorithm is as follows: (a) Obtain the list of the largest selectable set. Current Miller subcarrier parameter set (a) The currently constructed adjacency matrix A; (b) Select a set from the list of the largest possible sets. ,make And generate a set of unselectable parameters for each set in the list based on the adjacency matrix. traverse each ,examine Can I join? If possible, update. Otherwise, remain unchanged; and move to the next set; (c) if Updated, removed The central cardinal number equals (b) the set, and proceed to step (d) the list of the largest optional sets. Given that each set in the set has been traversed without being updated, output the list of the largest possible set. ; If not, then take the set of Miller subcarrier parameters whose maximum values ​​are thresholds, construct an adjacency matrix, and use a backtracking search traversal algorithm to solve for the maximum set list that can be formed by the current Miller subcarrier parameter set so that tag reflection communication does not interfere with each other; use the input Miller subcarrier parameter set to reconstruct the adjacency matrix, and use the adjacency matrix and the maximum set list to solve for the maximum set that can be formed by the Miller subcarrier parameter set so that tag reflection communication does not interfere with each other.

2. The general parameter construction method for multi-tag parallel communication according to claim 1, characterized in that, The maximum Miller subcarrier parameter is 128, and the threshold is 128. The threshold is set before the access process begins and is not automatically adjusted during each access process.

3. The general parameter construction method for multi-tag parallel communication according to claim 1, characterized in that, Initialize the maximum selectable set list Empty, the cardinality of the current largest set. A collection of unselectable elements .

4. A general parameter construction system for multi-tag parallel communication, the system being used to execute the methods as claimed in claims 1-3, characterized in that, include: The configuration module is used to configure different parameters for each tag, so that the fundamental frequency of each frequency-shifted signal is gradually shifted, and the range of each frequency-shifted signal in the frequency band is calculated. The judgment module is used to determine whether the maximum input Miller subcarrier parameter is less than a preset threshold. If yes, then construct an adjacency matrix based on the current Miller subcarrier parameter set, and use a backtracking search traversal algorithm to solve for the set of non-interfering Miller subcarrier parameters that the tag can use during backscatter communication; if no, then take the set of Miller subcarrier parameters whose maximum value is a threshold, construct an adjacency matrix, and use a backtracking search traversal algorithm to solve for the maximum set list of tags that can be formed by the current Miller subcarrier parameter set and are mutually non-interfering during tag reflection communication. The solution module is used to reconstruct the adjacency matrix from the input Miller subcarrier parameter set, and then, based on the adjacency matrix and the list of maximum sets, solve for the maximum set of tags that can be formed by the Miller subcarrier parameter set without interference during tag reflection communication by backtracking search traversal.

5. A non-transitory computer-readable storage medium, characterized in that, The non-transitory computer-readable storage medium is used to store computer instructions, which, when executed by a processor, implement the general parameter construction method for multi-tag parallel communication as described in any one of claims 1-3.

6. A computer device, characterized in that, The system includes a memory and a processor, which communicate with each other. The memory stores program instructions that can be executed by the processor, and the processor calls the program instructions to execute the general parameter construction method for multi-tag parallel communication as described in any one of claims 1-3.

7. An electronic device, characterized in that, include: The device includes a processor, a memory, and a computer program; wherein the processor is connected to the memory, the computer program is stored in the memory, and when the electronic device is running, the processor executes the computer program stored in the memory to cause the electronic device to execute instructions that implement the general parameter construction method for multi-tag parallel communication as described in any one of claims 1-3.

Images