CN1901276B - Method for generating scan mark and method for scanning antenna device - Google Patents

Abstract

The invention discloses a method for generating a scan identifier, which comprises the following steps: generating a UID and a bit mask according to a node value; obtaining the modulo Pi obtained by dividing i by the maximum byte length of the UID and dividing i by the maximum byte length of the UID For the value Qi of the integer part in the final result, the value of the Qi-th bit in the Pi-th byte of the UID after conversion is the same value as the value of the i-th bit in the generated UID, and the value of the i-th bit in the converted bit mask Pi-th byte is taken The value of the Qi bit is 1, and i is all natural numbers less than the effective bit length of the generated UID; the values of the remaining bits in the converted UID and the converted bit mask are all 0; the converted UID and the converted bit mask are used as scans logo. The invention also discloses a method for scanning the antenna device. The method disclosed by the invention can solve the problem that the scanning speed is very slow when the UIDs of two antenna devices under a port have more bytes of the same value.

Description

Method for generating scan mark and method for scanning antenna device

technical field

The invention relates to a scanning technology, in particular to a method for generating a scanning mark and a method for scanning an antenna device.

Background technique

The Antenna Interface Standards Group (AISG, Antenna Interface Standards Group) protocol stipulates that any antenna device (ALD, Antenna line device) requires a globally unique unique identifier (UID, Unique ID). The UID needs to be obtained by scanning. The scanning process is briefly described as follows: the master station, that is, the antenna controller, broadcasts a message with a bit mask (BIT MASK) and UID to all slave stations ALD on the bus, and ALD receives this message. After receiving the message, if the value obtained after the AND operation of its own UID and BIT MASK is consistent with the UID in the received message, it will return a scan response with its own UID to the master station. When two or more devices send back successful responses at the same time, the master station can sometimes receive all correct responses, and sometimes receive wrong data. If the master station receives wrong data, it will consider a conflict and continue scanning . A UID usually includes a valid bit and an invalid bit, the value of the valid bit can be 1 or 0, and the value of the invalid bit is 0. For example: UID=00000101, and the effective bit length of the UID is 4; UID=00000001, and the effective bit length of the UID is 2, etc. Currently, the protocol stipulates that the maximum length of the UID is 19 bytes and 152 bits in total. In practical applications, if the protocol allows, the maximum length of the UID can also be other numbers. The maximum UID length or UID maximum byte length described herein is determined according to the protocol, for example, 19 bytes.

How to ensure that the scanning message is generated completely without consuming a long scanning time depends on the scanning algorithm used. The AISG protocol recommends using the binary tree algorithm.

The process of scanning the antenna device using the binary tree algorithm is shown in Figure 1, and the process includes the following steps:

Step 101: The master traverses to a node of the binary tree.

In step 101, the master station may use the root-first traversal method of the binary tree to traverse to a node.

The binary tree may be as shown in FIG. 1A, in which the values of each node are marked. The node value of described binary tree is generated in advance, such as: the value of left node 11a of layer one, right node 11b is respectively 00000001 and 00000000; Its value of four nodes of layer two is respectively binary from left to right: node 12aa is 00000011, 00000001 for node 12ab, 00000010 for node 12ba, 00000000 for node 12bb; and so on.

In practical applications, the value of 0 and 1 of the effective bit of each node value of a certain layer of the binary tree can be reversed. At this time, the values of 0 and 1 of all sibling nodes of the same layer and all child nodes below this layer The value is also negated. For example, the values of the two nodes in layer 1 are 00000000 and 00000001 from left to right, and the values of the four nodes in layer 2 are binary 00000000, 00000010, 00000001, 00000011, etc. from left to right. The effective bits of the node value are determined according to the layer number of the node. Specifically, if the layer number of the node is the nth layer, the 0th to n-1th bits in the node value are effective bits. For example, the valid bits of the two nodes in layer one are bit 0, and the effective bits of the two nodes in layer two are bit 0, bit 1, and so on.

Step 102: Generate a UID and a bit mask according to the traversed node values, and use the generated UID and bit mask as a scan identifier.

Step 102 includes a method for generating a scan ID in the prior art, specifically: generating a UID and a bit mask according to the traversed binary tree node values, and directly using the generated UID and the generated bit mask as a scan ID.

The method for generating the UID is: making the generated UID the same as the traversed node value. For example, when traversing to a node in layer 1 of the binary tree, and its node value is 00000001, the generated UID is 00000001.

The method for generating the bit mask is as follows: make the length of the generated bit mask the same as the length of the UID generated, the median value of the bit mask generated is lower than the value of the bit traversed to the number of layers of nodes is 1, and the remaining bits The values are all taken as 0. For example: when traversing to a node in the binary tree layer, the length of the generated bit mask is the same as the length of the generated UID, which is 1 byte. Since the natural number smaller than the number of layers 1 is only 0, the value of the 0th bit in the generated bit mask Take 1, the values of the first to seventh bits are all 0, that is, the generated bit mask is 00000001; the length of the bit mask corresponding to the second and fourth nodes of the binary tree layer is 1 byte. There are two natural numbers, which are 0 and 1, so the values of the 0th and 1st bits in the generated bitmask are all 1, and the values of the 2nd to 7th bits are all 0, that is, the generated bitmask is 00000011; etc.

In step 102, when the generated UID and the generated bit mask are used as the scan identifier, the scan identifier also includes an effective byte length, and the effective byte length is equal to the byte length of the generated UID and the generated bit mask. For example, if the generated bitmask is 00000011 and the generated UID is 00000010, then the valid byte length contained in the scan identifier is 1 byte.

The valid byte length contained in the scan ID is used to notify ALD of the UID byte length to be read. For example, if the effective byte length in the scan ID is 2, ALD will only read the lowest two bytes of its own UID to perform AND calculation with the bit mask in the scan ID, and compare it with the UID in the scan ID.

Step 103: The master station broadcasts the scan message containing the scan identifier to all ALDs on the bus, and detects the responses of the ALDs. If the detection result is that there is no conflict, then perform step 104. If the detection result is that there is a conflict, then perform step 104. 105.

The scan message in step 103 includes other content besides the scan ID, and the other content can be referred to in the protocol generation, which will not be described in detail here.

The non-occurrence of conflict may be: the detection result is that no conflict occurs and one or more correct responses are received, or the detection result is that no response is received.

If the detection result receives one or more correct responses from the master station, it indicates that the scanning of the current node, that is, the currently traversed node, is completed. At this time, the scanning result can be saved for further processing after the scanning is completed.

Step 104: Intercept all branches below the current node in the binary tree.

Step 105: Judging whether the entire binary tree has been traversed, if yes, then end the processing flow, otherwise return to step 101.

In step 103 shown in Figure 1, if the response situation detected by the main station is that the main station receives one or more correct responses, or the detection result is that no response is received, then step 104 is executed to intercept the current node in the binary tree. all branches. At this time, when returning to step 101 after step 105, the subordinate branches of the node will not be traversed, that is, if the root-first traversal method is used to traverse in step 101 at this time, the next traversed node is: if the current node has a right sibling node, the next traversed node is its right sibling node; if the current node does not have a right sibling node, the next traversed node is the right sibling node of its parent node, if its parent node still has no right sibling node, the next One traverses to the right sibling of the node that is its parent's parent, and so on. If the entire tree has been traversed, that is, the traverse ends, after step 105, the scanning process ends.

In step 103 shown in Figure 1, if the detection result of the master station is that the antenna equipment responds to a conflict, then directly execute step 105, and return to step 101 after step 105, and perform steps 101 to 105 in a loop, the current node can All child nodes of . For example: the current node has two child nodes: left child node X and right child node X', when using the root-first traversal method to traverse in step 101, you can traverse to node X first, and after performing steps 101 to 105 in a loop, You can then traverse to node X'. Here, if a conflict still occurs after traversing to node X, all child nodes of node X will be further scanned.

The process of scanning the antenna device in FIG. 1 can be represented by the scanning tree including the scanning process shown in FIG. 2 . Corresponding scan marks are shown on each scan node of the scan tree shown in Figure 2, such as: the scan mark of layer one left node 21a in the scan tree is BIT MASK=0...01, UID=00000001, effective byte length (Length )=1 byte; the scan ID of the layer 2 node 22aa is BITMASK=0...011, UID=00000011, effective byte length (Length)=1 byte, and so on.

With reference to FIG. 1 , FIG. 1A and FIG. 2 , the scanning process in the prior art can be described with an example. For example, when scanning according to the root-first traversal method:

In step 101, the master station traverses to a node of the binary tree, such as the left node 11a of layer one in FIG. 1A.

In step 102, the UID and the bit mask generated according to the traversed node value are: UID=00000001, BIT MASK=0...01, and the generated UID and the bit mask are directly used as the scan identification, at this time, the scan identification Also includes information with an effective byte length (Length) of 1, as shown in the scanning node 21a in FIG. 2 .

In step 103, after broadcasting the scan message containing the scan identifier shown in the scan node 21a in Figure 2 to all ALDs on the bus, if the detection result is that there is no conflict, then perform step 104 to intercept the following node 11a in the binary tree All branches, at this time, when step 105 is executed and then step 101 is returned, the traversed node is the layer-right node 11b shown in Figure 1A, and the scan mark generated by step 102 is as shown in the scan node 21b in Figure 2 , is: UID=00000000, BITMASK=00000001, effective byte length (Length)=1. Immediately after step 103, after the scan message including the scan identifier shown in the node 21b shown in FIG. 2 is broadcast to all ALDs on the bus, if the detection result is that there is no conflict, the scan ends.

That is to say: when scanning according to the root-first traversal method, if there is no conflict, the scanning identifiers can be shown in turn as the scanning nodes 21a and 21b in FIG. 2 , and then the scanning ends.

In step 103, after broadcasting the scan message containing the scan identifier shown in node 21a in FIG. The node is layer 2 node 12aa shown in Fig. 1A, and the scan identification generated by step 102 is as shown in the scan node 22aa in Fig. 2, which is: UID=00000011, BITMASK=00000011, effective byte length (Length)=1 . Immediately after step 103, after broadcasting the scan message containing the scan identifier shown in node 22aa in Figure 2 to all ALDs on the bus, if the detection result is no conflict, then execute step 104 to intercept the node shown in Figure 1A For all branches below 12aa, at this time, when step 105 is executed and then step 101 is returned, the traversed node is layer 2 node 12ab shown in Figure 1A, and the scan identifier generated by step 102 is in the scan node 22ab as shown in Figure 2 Shown, be: UID=00000001, BIT MASK=00000011, effective byte length (Length)=1, here, there is no conflict after scanning node 22ab, then turn to scan node 21b in the next step; Node 22aa among Fig. 2 will be included After the scan message of the scan identifier shown in is broadcasted to all ALDs on the bus, if the detection result is a conflict, then directly execute step 105 and return to step 101, and the traversed node is the right node of layer 3 shown in Figure 1A 13aaa, and the scan identifier generated by step 102 is shown in the scan node 23aaa in FIG.

That is to say: when scanning according to the root-first traversal method, if only one conflict occurs, the scan identification can be shown in turn as the scanning nodes 21a, 22aa, 21b in Figure 2, and then the scan ends; if continuous conflicts occur, the scan identification The sequence can be shown as scanning nodes 21a, 22aa, 23aaa, . . . in FIG. 2 .

For the case of continuous conflicts, refer to the scanning tree shown in Figure 2, and the specific scanning conditions can be shown in Table 1:

scan order Length UID bitmask illustrate first step 1 00000001 00000001 Scan node 21a. Scan whether the value of bit 0 of UID is 1 The second step 1 00000011 00000011 Scan node 22aa. Since there is a conflict when the value of bit 0 of UID is 1 in the first step, further scan whether the value of bit 1 of UID is 1 in the second step third step 1 00000111 00000111 Scan node 23aaa. Since conflicts continue to occur when the value of the first bit of the UID is 1 in the second step, further scan whether the second bit of the UID is 1 in the third step ... ... ... ... ...

Table I

In the prior art, the scanning process of a UID can be summarized as:

Step 1: Scan UID bit 0. Here, the value of the 0th bit can be 1 or 0. Usually, it will first scan whether the value of the 0th bit of the UID is 1. If there is a conflict, execute the second step. If there is no conflict or execute the second step After the first step until there is no conflict, it will scan whether the value of bit 0 of the UID is 0. In Table 1, a conflict occurs when the value of bit 0 of the scanned UID is 1 as an example.

Step 2: Since a conflict occurs when bit 0 of the UID is 1 in the first step, bit 1 of the UID is further scanned in the second step. Here, the value of the first bit can be 1 or 0. Usually, it will first scan whether the value of the first bit of the UID is 1. If the conflict continues, execute the third step. If there is no conflict or execute the first After three steps until there is no conflict, it will scan whether the value of the first bit of the UID is 0. In Table 1, the case where conflicts continue to occur when the value of the first bit of the scanned UID is 1 is described as an example.

Step 3: Since conflicts continue to occur when the value of the first bit of the UID is 1 in the second step, the second bit of the UID is further scanned in the third step. Here, the value of the second bit can be 1 or 0. Usually, it will first scan whether the second bit of the UID is 1. If the conflict continues, continue to scan the next bit. If there is no conflict or continue After scanning the next bit until there is no conflict, it will scan whether the value of the second bit of the UID is 0. In Table 1, the example of scanning whether the value of the second bit of the UID is 1 is used for illustration.

It can be seen that when scanning the ALD in the prior art, if there is a conflict when scanning the 0th to i-th bits of the UID, the next step is to scan the 0th to the i+1th bits of the UID, that is, to further scan The i+1th bit of the UID, so the scanning method in the prior art can be called a bit-increasing scanning method, i is a natural number, and usually i is less than or equal to the maximum bit length of the UID, such as 0≤i≤151, etc. .

The disadvantages of the prior art are:

In the prior art, the UID and the bit mask are generated according to the node values of the binary tree, and the generated UID and the bit mask are directly used as the scanning identification. When scanning according to the scanning identification in the prior art, the ALD is scanned bit by bit. Scanning, if one or more bytes of two UIDs are the same, there will be many conflicts. For example, if the first 10 bytes of two UIDs are the same, 10×8=80 conflicts may occur. When there are many identical characters in the UIDs of two ALDs under one port, the scanning speed is very slow. For example, if the first 80 digits of the UIDs of the two ALDs are the same, the master station may need to send 81 scanning messages to obtain one. The UID of the ALD.

Contents of the invention

In view of this, the main purpose of the present invention is to provide a method for generating scan identifiers, which can generate cross-byte scan identifiers.

Another object of the present invention is to provide a method for scanning antenna devices, which can increase the scanning speed when the UIDs of two ALDs under one port have more bytes in common.

Technical scheme of the present invention is realized like this:

A method of generating a scan ID, the method comprising the steps of:

A. Generate a unique identification UID and a bit mask according to the node value;

B. Determine the byte length of the UID after conversion and the bit mask after conversion; obtain the modulus Pi after dividing i by the maximum byte length of UID, obtain the value Qi of the integer part in the result after dividing i by the maximum byte length of UID, and obtain After the conversion, the value of the Qi-th bit in the Pi-th byte of the UID is the same as the value of the i-th bit in the generated UID, and the value of the Qi-th bit in the Pi-th byte of the converted bit mask is 1, and i is less than All natural numbers of the effective bit length of the generated UID, Pi and Qi are natural numbers; the values of the remaining bits in the converted UID and the converted bit mask are all 0;

C. Use the converted UID and the converted bit mask as the scanning identifier.

The method for generating the UID described in step A is: making the generated UID the same as the node value.

The method for generating the bit mask described in step A is: make the length of the generated bit mask the same as the UID length generated, and the median value of the generated bit mask lower than the number of layers of the node is 1, The values of the remaining bits are all 0.

The method for determining the byte length of the converted UID and the converted bit mask described in step B is: determining the byte length of the converted UID and the converted bit mask to be the maximum byte length of the UID.

The method for determining the byte length of the UID after conversion and the bit mask after conversion described in step B is: whether the UID effective bit length of judging generation is less than the UID maximum byte length, if so, UID after conversion and bit mask after conversion The byte length of the UID is equal to the effective bit length of the generated UID, otherwise the byte length of the converted UID and the converted bit mask is equal to the maximum byte length of the UID.

The effective bit length of the generated UID is the same as the length of all bits whose bit value is 1 in the generated bit mask.

The scan identifier in step C includes a valid byte length;

The effective byte length is equal to the byte length of the converted UID and the converted bit mask.

The node value is a node value on the binary tree.

The method includes the following steps:

A1. The master station traverses to a node of the binary tree;

B1. Generate UID and bitmask according to the traversed node value; determine the byte length of UID after conversion and bitmask after conversion; obtain the modulus Pi after i is divided by the maximum byte length of UID, and obtain the maximum value of i divided by UID The value Qi of the integer part in the result after the byte length; take the value of the Qi-th bit in the Pi-th byte of the converted UID to be the same as the value of the i-th bit in the generated UID, and take the Pi-th bit of the converted bit mask The value of the Qi bit in the section is 1, i is all natural numbers less than the effective bit length of the generated UID, Pi and Qi are natural numbers; the values of the converted UID and the remaining bits in the converted bit mask are all 0; the converted UID and converted bitmask as scan identification;

C1. The master station broadcasts the scan message containing the scan identifier to all antenna devices on the bus, and detects the response of the antenna devices. If the detection result is that there is no conflict, then execute step D1. If the detection result is that there is a conflict, execute Step E1;

D1. Intercept all branches below the current node in the binary tree;

E1. Determine whether the entire binary tree has been traversed, if yes, end the processing flow, otherwise return to step A1.

The traversal is performed using the root-first traversal method of the binary tree.

The method for generating the UID described in step B1 is: make the generated UID the same as the traversed node value.

The method for generating the bit mask described in step B1 is: make the length of the generated bit mask the same as the UID length generated, and the median value of the generated bit mask lower than the number of layers of the node is 1, The values of the remaining bits are all 0.

The method for determining the byte length of the converted UID and the converted bit mask described in step B1 is: determining that the converted UID and the converted byte length of the converted bit mask are the maximum byte length of the UID.

The method for determining the byte length of the UID after conversion and the bit mask after conversion described in step B1 is: whether the effective bit length of the UID that judges generation is less than the UID maximum byte length, if so, UID after conversion and bit mask after conversion The byte length of the UID is equal to the effective bit length of the generated UID, otherwise the byte length of the converted UID and the converted bit mask is equal to the maximum byte length of the UID.

The effective bit length of the generated UID is the same as the length of all bits whose bit value is 1 in the generated bit mask.

The non-occurrence of conflict in step C1 means: the detection result is that there is no conflict and one or more correct responses are received, or the detection result is that no response is received.

In the present invention, after generating UID and bitmask according to the node value, the generated UID and bitmask are converted, and the specific conversion method is: determine the byte length of UID after conversion and bitmask after conversion; obtain i and divide by Modulo Pi after the maximum byte length of the UID, obtain the value Qi of the integer part of the result after dividing i by the maximum byte length of the UID; take the value of the Qi-th bit in the Pi-th byte of the UID after conversion and the value of the i-th bit in the generated UID The value of the bit is the same value, the value of the Qi-th bit in the Pi-th byte of the bit mask after conversion is 1, i is all natural numbers less than the effective bit length of the generated UID, and Pi and Qi are natural numbers; UID and conversion after conversion The values of the remaining bits in the post-bit mask are all 0; the post-conversion UID and post-conversion bit mask are used as the scan identifier. In the present invention, the scanning identification generated by the above method is used to scan the antenna device.

The present invention has following beneficial effect:

1) By using the method for generating scan marks in the present invention, it is possible to generate cross-byte scan marks.

2) In the present invention, the UID and the bit mask are generated according to the node value for conversion, and the converted UID and the bit mask are used as the scan identifier. When scanning conflicts, it is not a bit-by-bit incremental scan, but a byte-by-byte incremental scan. For the situation that the UIDs of two or more ALDs under one port have more identical bytes, the scanning speed can be effectively improved.

3) Considering that the ALDUID of the same manufacturer may be relatively similar, once a conflict occurs, it is likely that this byte is exactly the same, as in many cases, the first two bytes of the UID of the same manufacturer's equipment are completely the same, at this time, the present invention is used, usually Scanning speed can be increased. For example, the 0th byte and the 1st byte of two equipment UIDs are identical, and the first bit of the 2nd byte is different. At this time, it is necessary to scan 8×2+1=17 times using the prior art. Need to scan 3 times, it can be seen that the present invention significantly improves the scanning speed in this case.

4) The antenna device may include a tower mount amplifier, usually a tower mount amplifier contains two UIDs, and the two UIDs are usually only different in the 0th bit of the last byte, in this case, the present invention can significantly Increase scanning speed. For example, the effective bytes of the two UIDs are both 6, and the 0th to 5th bytes are exactly the same, and the 0th bit of the 6th byte is different. At this time, it is necessary to scan 8×6+1=49 times using the existing technology , using the present invention only needs to scan 7 times, it can be seen that the present invention significantly improves the scanning speed in this case.

Description of drawings

Fig. 1 is a schematic diagram of the process of scanning the ALD using a binary tree algorithm in the prior art;

FIG. 1A is a schematic structural diagram of a binary tree;

FIG. 2 is a schematic diagram of a scanning tree for scanning ALD in the prior art;

3 is a schematic diagram of the process of scanning ALD in an embodiment of the present invention;

Fig. 4 is a schematic diagram of the process of generating a scan mark in an embodiment of the present invention;

FIG. 5 is a schematic diagram of a scanning tree for scanning ALD in an embodiment of the present invention.

Detailed ways

The method that produces scanning mark among the present invention is:

Generate UID and bitmask based on node value;

Convert the generated UID and bitmask to obtain the converted UID and bitmask. The specific conversion method is: determine the byte length of the converted UID and the converted bitmask; obtain i divided by the maximum byte length of the UID After modulo Pi, obtain the value Qi of the integer part of the result after i is divided by the maximum byte length of the UID; take the value of the Qi-th bit in the Pi-th byte of the converted UID to be the same as the value of the i-th bit in the generated UID Value, take the value of the Qi-th bit in the Pi-th byte of the converted bit mask as 1, i is all natural numbers less than the effective bit length of the generated UID, and Pi and Qi are natural numbers; the converted UID and the converted bit mask The values of the remaining bits are all 0;

Use the converted UID and the converted bit mask as the scan identifier.

The method for scanning the antenna device in the present invention is:

A. The master traverses to a node of the binary tree;

B. Generate UID and bit mask according to the traversed node value, and convert the generated UID and bit mask to obtain the converted UID and bit mask. The specific conversion method is: determine the converted UID and converted bit The byte length of the mask; obtain the modulo Pi after dividing i by the maximum byte length of UID, and obtain the value Qi of the integer part of the result after dividing i by the maximum byte length of UID; obtain the value Qi after dividing i by the maximum byte length of UID Modulo Pi, obtain the value Qi of the integer part of the result after i is divided by the maximum byte length of the UID; take the value of the Qi-th bit in the Pi-th byte of the converted UID to be the same as the value of the i-th bit in the generated UID, Take the value of the Qi-th bit in the Pi-th byte of the converted bit mask as 1, i is all natural numbers less than the effective bit length of the generated UID, and Pi and Qi are natural numbers; the remaining bits in the converted UID and the converted bit mask The values of all take 0; the converted UID and the converted bit mask are used as the scan identifier;

C. The master station broadcasts the scanning message containing the scanning identification to all ALDs on the bus, and detects the response of the ALD. If the detection result is that there is no conflict, then perform step D. If the detection result is that there is a conflict, then perform step E ;

D. Intercept all branches below the current node in the binary tree;

E. Determine whether the entire binary tree has been traversed, if yes, end the processing flow, otherwise return to step A.

The present invention will be described in further detail below with reference to the accompanying drawings and examples.

In the embodiment of the present invention, the process of scanning the antenna device is shown in Figure 3, including the following steps:

Step 301 is the same as step 101 shown in FIG. 1 , specifically: the master station traverses to a node of the binary tree.

Step 302: Generate a UID and a bit mask according to the traversed node values, and convert the generated UID and the generated bit mask to generate a scan identifier.

Steps 303 to 305 are the same as steps 103 to 105 shown in Figure 1, specifically:

Step 303: The master station broadcasts the scan message containing the scan identifier to all ALDs on the bus, and detects the responses of the ALDs. If the detection result is that there is no conflict, then perform step 304. If the detection result is that there is a conflict, then perform step 304. 305.

Step 304: Intercept all branches below the current node in the binary tree.

Step 305: Judging whether the entire binary tree has been traversed, if yes, then end the processing flow, otherwise return to step 301.

In step 302 shown in FIG. 3, the process of generating the scan mark is shown in FIG. 4, and the process includes the following steps:

Step 401: Generate UID and bitmask according to node value.

In step 401, the method of generating UID and bitmask according to the node value is the same as that in the prior art.

Step 402: Determine the converted UID and the byte length of the converted bitmask.

The determination method in step 402 may be: determine the byte length of the converted UID and the converted bit mask as the maximum byte length of the UID.

The determined method described in step 402 can also be: whether the UID effective bit length that judges generation is less than UID maximum byte length, if so, the byte length of the UID after conversion and the converted bit mask is equal to the UID effective bit length that generates , otherwise the byte length of the converted UID and the converted bitmask is equal to the maximum byte length of the UID.

The UID effective bit length=generated bit mask of generation=the length of all bits with a bit value of 1, such as: the generated bit mask is 00000111, then the generated UID effective bit length is 3; the generated bit mask is 0000000111111111, the effective bit length of the generated UID is 9.

Step 403 and Step 406: Obtain the converted UID and converted bitmask values, specifically:

Step 403: Set the initial value of all bits of the converted UID and the converted bitmask to 0; set the initial value of i to 0, where i is a natural number.

Step 404: Obtain the modulo Pi after dividing i by the maximum byte length of UID, and obtain the value Qi of the integer part in the result after dividing i by the maximum byte length of UID; get the byte position in the UID after conversion as Pi, the first character at Pi The value of the Qi-th bit in the section is the same as the value of the i-th bit in the generated UID, and the byte position in the converted bit mask is Pi, and the value of the Qi-th bit in the Pi-th byte is 1.

In step 404, the byte position in the converted UID is Pi, and the value of the Qi bit in the Pi byte is the same value as the value of the i bit in the generated UID. For example: if the value of the i-th bit in the generated UID is 1, the byte position in the converted UID is Pi, and the value of the Qi-th bit in the Pi-th byte is 1; if the i-th bit in the generated UID is If the value is 0, the byte position in the converted UID is Pi, and the value of the Qi-th bit in the Pi-th byte is 0. In the specific implementation, it can be judged whether the value of the i-th bit in the generated UID is 1 or 0, and if so, the byte position in the converted UID is Pi, and the value of the Qi-th bit in the Pi-th byte is 1 or 0, otherwise, take the byte position Pi in the converted UID and the value of the Qi-th bit in the Pi-th byte to be 0 or 1.

In step 404, take the byte position in the bit mask after conversion as Pi, and the value of the Qi bit in the Pi byte is the same value as the value of the i bit in the generated bit mask, which can also be described as: Take the byte position in the converted bit mask as Pi, and the value of the Qi-th bit in the Pi-th byte is 1. Here, when i is any natural number smaller than the effective bit length of the generated UID, the value of bit i in the bit mask is actually 1.

Step 405: Judging whether i is smaller than the effective bit length of the UID after generation, if yes, go to step 407, otherwise go to step 406.

Step 406: increase the value of i by 1, and return to step 404.

The result achieved by cyclically executing steps 404 to 406 is: for all natural numbers whose i is less than the effective bit length of the generated UID, obtain the converted UID and the value of the Qi-th bit in the Pi-th byte in the converted bit mask. In practical applications, the same result can also be achieved by reasonably modifying the sequence and judgment content of steps 404, 405, and 406. For example, after step 404, first increase the value of i by 1, and then judge whether i is Equal to the UID effective bit length after generation, if yes, then execute step 407, otherwise return to step 404; or change the judgment in step 405 to: judge whether i is equal to (UID effective bit length-1 after generation); or: in step Between 403 and step 404, first judge whether i is less than the UID effective bit length after generation, if not, then execute step 407, otherwise execute step 404, after the value of i is increased by 1, then return to the judgment between step 403 and step 404 for i The step of whether it is shorter than the effective bit length of the generated UID, etc., will not be described in detail here.

In steps 402 to 406, first determine the byte length of the UID after conversion and the bit mask after conversion, and set the initial value of all bits of the UID and bit mask after conversion to 0, and then give i to be less than the generated UID When all natural numbers of the effective bit length are used, the value of bit Qi in the Pi-th byte is assigned. In practical applications, when i is all natural numbers less than the effective bit length of the generated UID, the value of the Qi-th bit in the corresponding Pi-th byte can also be obtained first, and then the converted UID and the remaining bits in the converted bit mask Values all get 0 and also can, and the step of the byte length of the UID after the UID after the conversion and the bit mask after the conversion described in step 402 this moment, can be after the step 401, the remaining bits in the UID after the conversion and the bit mask after the conversion The value is executed at any position before 0.

Here, after determining the converted UID and the byte length of the converted bit mask, the method of obtaining the converted UID can also be described as: the value of the i-th bit in the generated UID corresponds to, in the converted UID, the byte position It is the modulus after i is divided by the maximum byte length of UID, and the number of digits in this byte is the value of the bits in the integer part of the result after i is divided by the maximum byte length of UID. i is less than the effective bit length of UID after generation For all natural numbers of , the values of the remaining bits in the UID after conversion are all 0.

Similarly, after determining the converted UID and the byte length of the converted bit mask, the method of obtaining the converted bit mask can also be described as: corresponding to the value of the jth bit in the generated bit mask, the converted bit In the mask, the byte position is the modulus of j divided by the maximum byte length of the UID, and the number of digits in this byte is the value of the bits in the integer part of the result after j is divided by the maximum byte length of the UID. j is For all natural numbers that are less than the effective bit length of the UID after generation, the values of the remaining bits in the converted bit mask are all 0; or: for all natural numbers that are less than the effective bit length of the UID after generation, the byte position is j divided by the UID After the modulus after the maximum byte length, and the number of digits in this byte is j divided by the maximum byte length of UID, the value of the bit in the integer part of the result is 1, and the values of the remaining bits in the bit mask after conversion are taken as 0.

Step 407: Use the converted UID and the converted bit mask as the scanning identifier.

In step 407, when the converted UID and the converted bit mask are used as the scan identifier, the scan identifier includes effective byte length information, and the effective byte length is equal to the byte length of the converted UID and the converted bit mask. For example: if the byte length of the converted UID and the converted bitmask is 2 bytes, the valid byte length in the scan identifier is 2 bytes; if the byte length of the converted UID and the converted bitmask is 19 byte, the valid byte length in the scan ID is 19 bytes.

In the specific implementation, if the UID that has been generated before the conversion is represented by TreeUid, the generated bit mask is represented by TreeMask, the effective bit length of the generated UID is represented by TreeLen, and the converted UID is represented by MsgUid and the converted bit mask The code is represented by MsgMask, the UID after conversion and the byte length of the bit mask are represented by MsgLen, and the maximum byte length of the UID is 19, then the conversion described in Figure 4 can be exemplified as:

If, TreeUid=00000011, TreeMask=00000011, TreeLen=2

Then firstly, since TreeLen=2 is less than 19, therefore,

MsgLen=2 (1)

For i less than all natural numbers of TreeLen=2, promptly to the situation of i=0 and i=1, obtain Pi and Qi respectively, when wherein i=0, P0=0%19=0, Q0 is the result after 0/19 Integer value, namely Q0=0; when i=1, P1=1%19=1, Q1 is the integer value of the result after 0/19, namely Q1=0.

Because the 0th bit of TreeUid, that is, the value when i=0 is 1, the byte position in the UID after conversion is P0=0, and the value of the 0th byte median Q0=0 bit is 1; The first bit, that is, the value when i=1 is 1, so the byte position in the UID after conversion is P1=1, and the value of the median Q1=0 bit in the first byte is 1; the remaining bits in the UID after conversion The values of all take 0. So the converted MsgUid is:

MsgUid＝00000001 00000001 (2)

And in the MsgMask, the value of the Q0=0 bit of the P0=0 byte and the Q1=0 bit of the P1=1 byte are 1, and the values of the remaining bits are all 0, so the converted MsgMask is:

MsgMask＝00000001 00000001 (3)

Here, if MsgLen is not as shown in formula (1), but takes the maximum byte length of UID, that is, MsgLen=19, then the lower 2 bytes in MsgUid and MsgMask are as shown in formula (2) and formula (3) respectively , and the value of each bit in the upper 17 bytes of MsgUid and MsgMask is 0.

The process of scanning the antenna device in the embodiment of the present invention may also be represented by a scanning tree including a scanning process as shown in FIG. 5 . Corresponding scan marks are shown on each scan node of the scan tree shown in FIG. )=1 byte; the scanning identification of layer two leftmost node 52aa is BIT MASK=0...01 00000001, UID=00000001 00000001, effective byte length (Length)=2 bytes, etc.

According to the scanning tree shown in Figure 5, when continuous conflicts occur in the embodiment of the present invention, the scanning situation can be as shown in Table 2:

scan order Length UID MASK first step 1 00000001 00000001

scan order Length UID MASK The second step 2 00000001 00000001 00000001 00000001 ... ... ... ... Step nineteen 19 00000001...00000001 00000001...00000001 20th step 19 00000001...00000011 00000001...00000011 21st step 19 00000001...0000001100000011 00000001...0000001100000011 ... ... ... ...

Table II

In Table 2:

In the first step scan UID byte 0 bit 0. Here, the value of the 0th bit can be 1 or 0. Usually, it will first scan whether the value of the 0th bit of the UID is 1. If there is a conflict, execute the second step. If there is no conflict or execute the second step After step 1 until there is no conflict, it will scan whether the value of bit 0 of the UID is 0; in Table 2, the conflict occurs when the value of bit 0 of the scanned UID is 1.

Since a conflict occurs when the value of bit 0 of byte 0 of UID is 1 in the first step, bit 0 of byte 1 of UID is further scanned in the second step. Here, the value of bit 0 of the first byte can be 1 or 0. Usually, it will first scan whether the value of bit 0 of the first byte of the UID is 1. If the conflict continues, execute the third step , if there is no conflict or after the third step is executed until no conflict occurs, it will scan whether the value of bit 0 of the first byte of the UID is 0; in Table 2, the value of bit 0 of the first byte of the scanned UID is 1 Conflicts continue to occur when the

Since the conflict continues to occur when the value of bit 0 of byte 1 of UID is 1 in the second step, bit 0 of byte 2 of UID is further scanned in step 3. Here, the 0th bit value of the 2nd byte can be 1 or 0. Usually, it will first scan whether the 0th bit value of the 2nd byte of the UID is 1. If conflicts continue to occur, continue to scan the next If there is no conflict or continue to scan the next bit until there is no conflict, it will scan whether the value of the 0th bit of the second byte of the UID is 0; in Table 2, the value of the 0th bit of the second byte of the UID Take 1 as an example to illustrate;

...;

Since the conflict continues to occur when the value of the 0th bit of the 19th byte of the UID is 1 in step 19, the first bit of the 0th byte of the UID is further scanned in step 20, and the first bit of the 0th byte of the UID is scanned in Table 2 Whether the value is 1 or not is explained as an example;

Since the conflict continues to occur when the value of the first bit of the UID byte 0 in step 20 is 1, the first bit of the first byte of the UID is further scanned in step 21, and the first bit of the first byte of the UID is scanned in Table 2 Whether the value is 1 or not is explained as an example;

Since the first bit of UID byte 1 in step 21 is 1, conflicts continue to occur, so further scan the first bit of UID second byte in step 22, and scan the first bit of UID second byte in Table 2 Whether the value is 1 or not is explained as an example;

Table 2 is an example of the situation when continuous conflicts occur in FIG. 5 . Usually, a conflict occurs when the tth bit of the sth byte of the UID is currently scanned. If the sth byte is the last valid byte, further scan the t+1th bit of the 0th byte of the UID. If the word If the section is not the last valid byte, further scan the t-th bit of the s+1th byte of the UID. Here, if the s-th byte is the last valid byte and t=7, the scanning process usually ends.

It can be seen that according to the scanning tree shown in Figure 5, when scanning the ALD, if a conflict occurs, usually the same bit of the next byte of the UID will be further scanned, so the scanning method in Figure 5 can be called a cross A scan method that increments bytes.

Using the scanning method in the embodiment of the present invention, if the first 80 bits of the UIDs of the two ALDs are the same and the 81st bits are different, the master station can obtain the UID of an ALD after sending 80÷8+1=11 scanning messages .

The above descriptions are only preferred embodiments of the present invention, and are not intended to limit the application scope of the present invention.

Claims (16)

1. A method for generating scan marks, characterized in that the method comprises the following steps: A. Generate a unique identification UID and a bit mask according to the node value; B. Determine the byte length of the UID after conversion and the bit mask after conversion; obtain the modulus Pi after dividing i by the maximum byte length of UID, obtain the value Qi of the integer part in the result after dividing i by the maximum byte length of UID, and obtain After the conversion, the value of the Qi-th bit in the Pi-th byte of the UID is the same as the value of the i-th bit in the generated UID, and the value of the Qi-th bit in the Pi-th byte of the converted bit mask is 1, and i is less than All natural numbers of the effective bit length of the generated UID, Pi and Qi are natural numbers; the values of the remaining bits in the converted UID and the converted bit mask are all 0; C. Use the converted UID and the converted bit mask as the scanning identifier. 2. The method according to claim 1, characterized in that the method for generating the UID in step A is: making the generated UID the same as the node value. 3. method according to claim 1, is characterized in that, the method for generating bitmask described in step A is: make the bitmask length of generation be identical with the UID length of generation, the bitmask median value of generation is low The values of the bits of the layers of the nodes are all 1, and the values of other bits are all 0. 4. method according to claim 1, is characterized in that, the method for determining the byte length of UID after conversion and bitmask after conversion described in step B is: determine the byte of UID after conversion and bitmask after conversion The length is the maximum byte length of the UID. 5. method according to claim 1, it is characterized in that, the method for determining the byte length of UID after conversion and bitmask after conversion described in step B is: whether the UID effective bit length that judges generation is less than UID maximum byte length, if yes, the byte length of the converted UID and converted bitmask is equal to the effective bit length of the generated UID, otherwise the byte length of the converted UID and converted bitmask is equal to the UID maximum byte length. 6. The method according to claim 5, wherein the effective bit length of the generated UID is the same as the length of all bits whose bit value is 1 in the generated bit mask. 7. The method according to claim 1, characterized in that the scan identifier in step C includes an effective byte length; The effective byte length is equal to the byte length of the converted UID and the converted bit mask. 8. The method according to any one of claims 1 to 7, wherein the node value is a node value on a binary tree. 9. A method for scanning an antenna device, characterized in that the method comprises the following steps: A1. The master station traverses to a node of the binary tree; B1. Generate UID and bitmask according to the traversed node value; determine the byte length of UID after conversion and bitmask after conversion; obtain the modulo Pi after i is divided by the maximum byte length of UID, and obtain the maximum value of i divided by UID The value Qi of the integer part in the result after the byte length; take the value of the Qi-th bit in the Pi-th byte of the converted UID to be the same as the value of the i-th bit in the generated UID, and take the Pi-th bit of the converted bit mask The value of the Qi bit in the section is 1, i is all natural numbers less than the effective bit length of the generated UID, and Pi and Qi are natural numbers; the values of the converted UID and the remaining bits in the converted bit mask are all 0; the converted UID and converted bitmask as scan identification; C1. The master station broadcasts the scan message containing the scan identifier to all antenna devices on the bus, and detects the response of the antenna devices. If the detection result is that there is no conflict, then execute step D1. If the detection result is that there is a conflict, execute Step E1; D1. Intercept all branches below the current node in the binary tree; E 1. Judging whether to traverse the entire binary tree, if yes, then end this processing flow, otherwise return to step A1. 10. The method according to claim 9, wherein the traversal is performed using a root-first traversal method of a binary tree. 11. The method according to claim 9, wherein the method for generating the UID in step B1 is: make the generated UID the same as the value of the traversed node. 12. The method according to claim 9, wherein the method for generating the bitmask described in step B1 is: make the length of the bitmask generated identical to the UID length generated, and the bitmask median generated is low The values of the bits of the layers of the nodes are all 1, and the values of other bits are all 0. 13. The method according to claim 9, characterized in that, the method for determining the byte length of the UID after conversion and the bit mask after conversion described in step B1 is: determining the byte of the UID after conversion and the bit mask after conversion The length is the maximum byte length of the UID. 14. method according to claim 9, it is characterized in that, the method for determining the byte length of UID after conversion and bitmask after conversion described in step B1 is: whether the UID effective bit length of judging generation is less than UID maximum byte length, if yes, the byte length of the converted UID and converted bitmask is equal to the effective bit length of the generated UID, otherwise the byte length of the converted UID and converted bitmask is equal to the UID maximum byte length. 15. The method according to claim 14, wherein the effective bit length of the generated UID is the same as the length of all bits whose bit value is 1 in the generated bit mask. 16. The method according to claim 9, wherein the absence of conflict in step C1 is: the detection result is that there is no conflict and one or more correct responses have been received, or the detection result is that no response has been received .

Images