Measurement method and apparatus

Abstract

The present application relates to the technical field of communications, and in particular to a measurement method and apparatus. The present application can support IEEE protocols such as IEEE 802.11be / Wi-Fi 7 / EHT, IEEE 802.11bn / UHR / Wi-Fi 8, IEEE 802.15 / UWB, IEEE 802.11bf / sensing, integrated millimeter-wave (IMMW), or NearLink. In the method, after generating a measurement frame, a first node can send the measurement frame to a second node. Upon reception of the measurement frame, the second node can generate a channel symbol A on the basis of a measurement sequence, and determine a CIR on the basis of the channel symbol A generated by the second node and a channel symbol B received by the second node. The measurement sequence can be a sequence obtained after cyclic sampling and / or cyclic shifting of a preset sequence. Therefore, the probability of an illegitimate device obtaining a measurement sequence can be effectively reduced, and measurement security is improved.

Description

Measurement method and apparatus

[0001] The present application claims priority to the Chinese patent application No. 202410888155.7, filed on July 2, 2024, with the State Intellectual Property Office of China, and the Chinese patent application No. 202410888155.7 has the title of “Measurement method and apparatus”, the whole content of which is incorporated herein by reference. TECHNICAL FIELD

[0002] The present application relates to the field of communication technology, in particular to a measurement method and apparatus. BACKGROUND

[0003] Ultra wideband (UWB) technology is a wireless carrier communication technology, which transmits data by using nanosecond-level non-sine wave narrow pulses, so the frequency spectrum range occupied by it is very wide. Because the pulse is very narrow and the radiation spectrum density is very low, the UWB system has the advantages of strong multipath resolution capability, low power consumption, strong security, etc.

[0004] With the UWB technology entering the civil field in 2002, UWB wireless communication has become one of the popular physical layer technologies for short-distance, high-speed wireless networks. Many world-renowned large companies, research institutions and standardization organizations have actively participated in the research, development and standardization of UWB wireless communication technology. The institute of electrical and electronics engineers (IEEE) has included UWB technology in the IEEE 802 series of wireless standards, and has released the high-speed wireless personal area network (WPAN) standard IEEE 802.15.4a based on UWB technology, as well as its evolution version IEEE 802.15.4z, and the formulation of the next generation UWB WPAN standard 802.15.4ab has also been put on the agenda. At the same time, the spark link positioning (SLP) wireless standard also includes UWB technology. One of the key themes of SLP and 802.15.4ab is secure ranging, that is, an illegal receiving device cannot obtain the correct channel impulse response (CIR) of the UWB signal transmitted through the air interface, so as to infer the distance or speed information.

[0005] Therefore, how to further improve the security of measurement needs to be solved urgently. SUMMARY

[0006] The embodiments of the present application provide a measurement method and apparatus, which can further improve the security of measurement.

[0007] In a first aspect, embodiments of the present application provide a measurement method, which can be applied to a first node, which can be a WPAN device (including a Wi-Fi device, etc.), or a device involved in a Starlink alliance, or a chip, functional module, processing system or communication component, etc. disposed in the above-mentioned devices. The method comprises:

[0008] generating a measurement frame, the measurement frame comprising a measurement field, the measurement field comprising a measurement subsegment, the measurement subsegment comprising a channel symbol, the channel symbol being generated according to a measurement sequence, the measurement sequence being a sequence after cyclic shift of a preset sequence, or the measurement sequence being a sequence after cyclic sampling of the preset sequence, or the measurement sequence being a sequence after cyclic shift and cyclic sampling of the preset sequence; and transmitting the measurement frame.

[0009] Exemplarily, the measurement subsegment can comprise a plurality of channel symbols, and at least two channel symbols in the plurality of channel symbols can adopt different measurement sequences. The lengths of the measurement sequences adopted by the plurality of channel symbols in the same measurement subsegment can be the same.

[0010] Exemplarily, the measurement field can comprise a plurality of measurement subsegments, and the lengths of the measurement sequences adopted by the plurality of measurement subsegments can be the same, or at least two measurement subsegments adopt measurement sequences of different lengths.

[0011] The relationship between the measurement sequence and the preset sequence can also be that the measurement sequence can be generated according to the preset sequence, for example, the measurement sequence can be a sequence different from the preset sequence generated according to the preset sequence, or the measurement sequence can be the same as the preset sequence.

[0012] Exemplarily, the measurement sequence can be a sequence obtained by cyclic shift and / or cyclic sampling of the preset sequence, for example, a sequence obtained by cyclic shift and / or cyclic sampling of the preset sequence, and a sequence obtained by cyclic shift and / or cyclic sampling of the sequence can also be the measurement sequence.

[0013] In embodiments of the present application, the first node generates the channel symbol by using the measurement sequence, and since the measurement sequence is a sequence after cyclic shift of the preset sequence, or a sequence after cyclic sampling of the preset sequence, or a sequence after cyclic shift and cyclic sampling of the preset sequence, a legitimate receiving device (i.e. a second node) can obtain the number of cyclic shift bits or the sampling step length, and thus can obtain the CIR according to the channel symbol. However, a non-legitimate receiving device cannot obtain the number of cyclic shift bits or the sampling step length, and thus cannot obtain the CIR, thereby effectively improving the security of the measurement.

[0014] With reference to the first aspect, in a possible implementation manner, before the first node generates the measurement frame, the method further includes:

[0015] determining the number of cyclic shifts or the sampling step length of cyclic sampling.

[0016] In the embodiments of the present application, the first node can generate a random number according to the random number seed, and determine the number of bits or the sampling step length through the random number. Correspondingly, the second node can also generate a random number according to the random number seed, and determine the number of bits or the sampling step length through the random number. In this way, the non-legal receiving device cannot obtain the random number seed, and thus the security of the measurement can be effectively improved.

[0017] With reference to the first aspect, in a possible implementation manner, before the first node generates the measurement frame, the method further includes:

[0018] sending indication information, the indication information being used for indicating the random number seed; or receiving indication information, the indication information being used for indicating the random number seed.

[0019] In the embodiments of the present application, the random number seed can be determined by the first node, and the first node indicates the random number seed to the second node. Alternatively, the random number seed can be determined by the second node, and the second node indicates the random number seed to the first node. Alternatively, the random number seed can be determined by a management node, and the management node indicates the random number seed to the first node and the second node respectively. Thus, the first node and the second node generate random numbers using the same random number seed, and determine the same number of cyclic shifts or sampling step length according to the random number, so that the legal receiving device can obtain the CIR according to the measurement frame, and the non-legal receiving device cannot obtain the CIR, thereby improving the security of the measurement.

[0020] With reference to the first aspect, in a possible implementation manner, the channel symbol is generated according to the measurement sequence, including:

[0021] The channel symbol is generated according to the measurement symbol and the scrambling symbol, the measurement symbol being obtained after time domain spreading of the measurement sequence; or the channel symbol is generated after time domain spreading of a symbol generated according to the measurement sequence and the scrambling symbol.

[0022] The second aspect, the embodiments of the present application provide a measurement method, the method can be applied to the second node, the second node can be a WPAN device (including a Wi-Fi device and the like), or a device involved in the Starlink alliance, or a chip, a functional module, a processing system or a communication component arranged in the above-mentioned devices. The method includes:

[0023] receiving a measurement frame, the measurement frame comprising a measurement field, the measurement field comprising a measurement subfield, the measurement subfield comprising a first channel symbol; generating a second channel symbol according to a measurement sequence, the measurement sequence being a sequence after cyclic shift of a preset sequence, or the measurement sequence being a sequence after cyclic sampling of the preset sequence, or the measurement sequence being a sequence after cyclic shift and cyclic sampling of the preset sequence; determining a CIR according to the first channel symbol and the second channel symbol.

[0024] The first channel symbol can be a channel symbol generated by the first node and obtained by the second node after channel transmission. The second channel symbol can be a channel symbol generated by the second node locally. The second node can correlate the second channel symbol generated by itself with the first channel symbol received by the second node, so as to obtain the CIR. An illegal receiving device cannot effectively obtain the measurement sequence, and therefore, even if the illegal receiving device correlates the channel symbol generated by itself with the channel symbol received by the illegal receiving device, the illegal receiving device cannot obtain the CIR. Or, the CIR peak position when the illegal receiving device correlates is different from the CIR peak position when the legal device correlates.

[0025] With reference to the second aspect, in a possible implementation manner, before the second node generates the second channel symbol according to the measurement sequence, the method further comprises: determining a number of cyclic shifts or a sampling step length of cyclic sampling.

[0026] With reference to the second aspect, in a possible implementation manner, before the second node generates the second channel symbol according to the measurement sequence, the method further comprises: sending indication information, the indication information being used for indicating a random number seed; or receiving indication information, the indication information being used for indicating the random number seed.

[0027] With reference to the second aspect, in a possible implementation manner, generating the second channel symbol according to the measurement sequence comprises:

[0028] performing time domain spreading on the measurement sequence to obtain a measurement symbol, and generating the second channel symbol according to the measurement symbol and a scrambling symbol; or performing time domain spreading on a symbol generated according to the measurement sequence and the scrambling symbol to obtain the second channel symbol.

[0029] The description of the second aspect can refer to the first aspect, and will not be described in detail here.

[0030] With reference to the first aspect or the second aspect, in a possible implementation manner, the length of the measurement sequence is 31, and the measurement sequence is a sequence after cyclic shift and cyclic sampling of a preset sequence, and the number of cyclic shifts is any one of the following: 1, 2, 3, 4, 5, 7, 9, 15, 17.

[0031] The preset sequence is 0 0 0 -1 0 0 1 0 1 1 0 0 1 1 -1 1 -1 0 0 0 1 1 0 1 -1 -1 0 1 0 -1 0; or

[0032] The preset sequence is 1 1 0 0 0 0 -1 -1 1 0 0 -1 1 0 1 1 -1 1 1 0 1 0 0 1 0 0 -1 0 -1 0.

[0033] With reference to the first aspect or the second aspect, in a possible implementation, the length of the measurement sequence is 63, the measurement sequence is a preset sequence cyclic shift, and in the case of the sequence after the cyclic sampling, the number of bits of the cyclic shift is any one of the following: 0, 1, 3, 5, 7, 9, 11, 13, 15, 21, 23, 27, 31.

[0034] The preset sequence is 1 1 1 1 1 1 -1 1 -1 1 -1 1 1 -1 -1 1 1 -1 1 1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1.

[0035] With reference to the first aspect or the second aspect, in a possible implementation, the length of the measurement sequence is 91, the measurement sequence is a preset sequence cyclic shift, and in the case of the sequence after the cyclic sampling, the number of bits of the cyclic shift is any one of the following: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19, 33, 35, 38, 47, 80.

[0036] The preset sequence is 1 0 1 1 1 -1 -1 -1 1 -1 -1 0 1 -1 0 1 -1 1 1 -1 1 1 1 -1 1 0 0 1 1 -1 0 -1 0 1 1 1 1 -1 1 1 -1 1 -1 -1 1 -1 1 -1 -1 1 1 1 0 1 -1 -1 -1 -1 -1 1 0 1 -1 1 -1 -1 -1 1 1 0 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 1 1 1; or

[0037] The preset sequence is -1 1 1 -1 1 -1 1 -1 0 1 1 -1 -1 -1 0 1 -1 -1 -1 1 1 -1 0 -1 0 -1 1 -1 1 0 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 1 1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 0 -1 1 1 1 1 1 1 -1 -1 -1 -1 -1 1 1 -1 1 1 0 0 1 1 0 -1 -1 1 1 -1 1 -1 -1 0 -1 1.

[0038] In a possible implementation of the first aspect or the second aspect, the length of the measurement sequence is 127, the measurement sequence is a preset sequence cyclically shifted, and the number of bits of the cyclic shift in the case of the sequence after the cyclic sampling is any one of: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19, 22, 23, 24, 26, 27, 28, 30, 32, 34, 35, 36, 37, 38, 39, 42, 43, 46, 48, 54, 55, 58, 59, 63.

[0039] The preset sequence is any one of:

[0040] -1 0 1 0 0 -1 0 0 -1 0 1 0 0 -1 -1 1 1 0 0 -1 0 0 0 -1 1 0 -1 0 -1 0 0 0 0 1 1 1 1 1 1 1 0 1 -1 1 0 1 1 0 -1 1 -1 -1 0 1 0 0 0 1 0 1 -1 0 0 -1 0 1 1 -1 1 -1 0 0 0 1 0 0 0 0 0 0 -1 1 0 0 -1 1 0 -1 1 0 0 0 1 -1 -1 0 0 1 1 1 0 -1 0 1 -1 -1 0 0 0 0 -1 0 0 1 1 0 0 0 0 0 -1 0 -1 0 1 0 1.

[0041] 0 -1 0 1 0 1 1 0 1 1 1 0 0 1 0 0 0 0 -1 0 0 0 1 0 0 -1 0 0 -1 -1 1 1 0 1 0 1 0 0 0 0 0 -1 0 -1 1 1 1 0 0 -1 -1 1 0 -1 1 -1 -1 1 -1 -1 0 -1 1 0 0 -1 0 1 -1 0 0 0 -1 -1 0 0 1 1 0 -1 1 0 1 0 0 0 1 -1 1 -1 1 0 0 0 0 1 1 1 0 0 0 -1 0 1 0 0 -1 1 0 0 0 0 0 0 1 1 0 -1 0 1 -1 -1 0 1 0 0 -1；

[0042] 0 1 0 0 -1 0 0 1 -1 1 1 0 -1 0 1 0 0 0 0 0 -1 0 -1 1 -1 1 0 0 -1 -1 -1 0 -1 -1 -1 -1 1 1 1 0 1 -1 0 0 1 0 -1 1 0 0 0 -1 1 0 0 1 -1 0 1 1 0 1 0 0 0 1 -1 -1 1 -1 0 0 0 0 1 1 -1 0 0 0 1 0 1 0 0 1 1 0 0 0 0 0 0 1 1 0 -1 0 -1 -1 1 0 -1 0 0 1 0 -1 0 1 0 1 1 0 1 -1 -1 0 0 1 0 0 0 0 1 0 0；

[0043] 1 1 0 -1 -1 1 0 -1 1 -1 1 0 0 0 0 -1 0 0 1 0 0 0 0 0 0 -1 0 1 -1 1 -1 -1 0 0 -1 0 0 0 0 -1 1 1 -1 0 0 0 -1 1 0 0 1 0 0 1 1 1 0 1 0 0 0 1 1 0 0 0 -1 0 -1 1 1 1 0 0 1 0 1 0 0 -1 -1 0 -1 -1 1 1 0 1 -1 1 1 0 -1 0 1 1 0 0 0 1 0 0 0 0 -1 -1 0 -1 0 0 1 -1 0 -1 0 1 0 1 0 0 0 1 0 -1 -1 1 0；

[0044] -1 1 0 0 0 -1 0 1 0 0 0 -1 -1 0 0 0 0 -1 0 0 0 0 0 1 1 1 -1 1 1 -1 0 1 0 1 0 -1 0 0 -1 1 0 0 1 1 1 0 -1 -1 1 0 1 0 0 -1 0 1 1 0 0 0 1 1 0 1 1 1 -1 0 -1 -1 0 -1 0 1 1 0 -1 1 0 0 -1 0 0 -1 0 0 0 1 -1 1 0 0 0 0 -1 0 1 1 -1 1 1 0 0 1 0 1 0 1 -1 -1 0 0 1 -1 0 -1 0 0 0 -1 0 0 -1 1.

[0045] With reference to the first aspect or the second aspect, in a possible implementation, the length of the measurement sequence is 133, the measurement sequence is a preset sequence cyclic shift, and in the case of the sequence after the cyclic sampling, the number of bits of the cyclic shift is any one of the following: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 16, 17, 18, 19, 20, 21, 24, 25, 28, 29, 30, 31, 35, 36, 37, 41, 46, 47, 48, 49, 57, 58, 59, 60, 61, 68, 69, 70, 71, 72, 81, 82.

[0046] The preset sequence is -1 0 -1 -1 1 1 1 1 1 1 1 0 -1 1 1 -1 -1 -1 0 -1 -1 1 -1 -1 -1 1 -1 -1 -1 0 1 -1 -1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 0 -1 1 1 1 0 0 1 0 -1 1 1 1 1 1 -1 1 -1 -1 1 0 1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 1 -1 -1 1 1 1 1 -1 -1 -1 1 0 -1 1 1 -1 1 1 -1 1 1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 -1 0 -1 -1 1 0 1 1 -1 1 -1 -1 -1.

[0047] With reference to the first aspect or the second aspect, in a possible implementation, a greatest common divisor between the length of the measurement sequence and the sampling step length of the cyclic sampling is 1.

[0048] In the embodiments of the present application, the sequence is exemplified by the elements 1, 0, -1, and in the specific implementation, the "-1" in the sequence can also have other representations, such as "-1" can be replaced by "-"; the "1" in the sequence can also have other representations, such as "1" can be replaced by "+".

[0049] In a third aspect, the embodiments of the present application provide a measurement method, which can be applied to a first node, which can be a WPAN device (including a Wi-Fi device, etc.), or a device involved in the StarFlash Alliance, or a chip, functional module, processing system or communication component, etc. disposed in the above device. The method comprises:

[0050] generating a measurement frame, the measurement frame comprising a measurement field, the measurement field comprising a measurement subfield, the measurement subfield comprising a channel symbol, the channel symbol being generated according to a measurement sequence, the measurement sequence being used to determine a CIR; and transmitting the measurement frame.

[0051] In the embodiments of the present application, the specific content of the measurement sequence can be referred to below. The channel symbol is generated by the measurement sequence, which can make it impossible for a non-legal receiving device to obtain the measurement sequence, and the legal receiving device (i.e. the second node) can know the measurement sequence, thereby effectively improving the security of the measurement.

[0052] In a fourth aspect, the embodiments of the present application provide a measurement method, which can be applied to a second node, which can be a WPAN device (including a Wi-Fi device, etc.), or a device involved in the StarFlash Alliance, or a chip, functional module, processing system or communication component, etc. disposed in the above device. The method comprises:

[0053] receiving a measurement frame, the measurement frame comprising a measurement field, the measurement field comprising a measurement subfield, the measurement subfield comprising a first channel symbol; generating a second channel symbol according to a measurement sequence; and determining a pulse impulse response CIR according to the first channel symbol and the second channel symbol.

[0054] The description of the fourth aspect can be referred to the description of the first aspect to the third aspect, which will not be described in detail here.

[0055] In combination with the third aspect or the fourth aspect, in a possible implementation manner, the length of the measurement sequence is 31, and the measurement sequence is one of N1 sequences, N1 being greater than 8.

[0056] The number of elements in the measurement sequence can be 31. When generating the second channel symbol, the second node can determine a measurement sequence from more than 8 sequences. That is, N1>8. For example, N1=32, or N1=16, etc. By increasing the number of measurement sequences, the probability of a non-legitimate receiving device successfully generating the second channel symbol is reduced, and the probability of the non-legitimate receiving device obtaining a correlation peak position related to the correlation peak position is reduced, and the probability of the non-legitimate receiving device obtaining a correct CIR is reduced, thereby effectively improving the security of the measurement.

[0057] In a possible implementation manner, in combination with the third aspect or the fourth aspect, the length of the measurement sequence is 63, and the measurement sequence is one of N2 sequences, and N2 is greater than 10.

[0058] In a possible implementation manner, in combination with the third aspect or the fourth aspect, the length of the measurement sequence is 91, and the measurement sequence is one of N3 sequences, and N3 is greater than 8.

[0059] In a possible implementation manner, in combination with the third aspect or the fourth aspect, the length of the measurement sequence is 127, and the measurement sequence is one of N4 sequences, and N4 is greater than or equal to 16.

[0060] In a possible implementation manner, in combination with the third aspect or the fourth aspect, the length of the measurement sequence is 133, and the measurement sequence is one of N5 sequences, and N5 is greater than or equal to 16.

[0061] In the embodiments of the present application, the number of measurement sequences with a length of 31 is greater than 8, the number of measurement sequences with a length of 63 is greater than 10, the number of measurement sequences with a length of 91 is greater than 8, the number of measurement sequences with a length of 127 is greater than or equal to 16, and the number of measurement sequences with a length of 133 is greater than or equal to 16. For example, N2=16, or N2=32, etc. N3=16, or N3=32, etc. N4=16, or N4=32, etc. N5=16, or N5=32, etc. Each of N1 to N5 can be the same or different.

[0062] By increasing the number of measurement sequences, the probability of a non-legitimate receiving device successfully analyzing the channel symbol is reduced, thereby effectively improving the security of the measurement.

[0063] In a possible implementation manner, in combination with the third aspect or the fourth aspect, the method further includes:

[0064] sending indication information, the indication information being used to indicate a random number seed, and the random number seed being used to determine the index of the measurement sequence; or

[0065] receiving indication information, the indication information being used to indicate a random number seed, and the random number seed being used to determine the index of the measurement sequence.

[0066] In the embodiments of the present application, the first node and the second node can obtain the random number seed, and the non-legitimate receiving device cannot obtain the random number seed, so that the non-legitimate receiving device cannot obtain the measurement sequence used by each channel symbol, and the security of the measurement can be improved.

[0067] In a fifth aspect, the embodiments of the present application provide a communication apparatus, which is configured to execute the method in any one of the first aspect to the fourth aspect or any possible implementation manner.

[0068] In a sixth aspect, the embodiments of the present application provide a communication apparatus, which includes a processor configured to execute the method in any one of the first aspect to the fourth aspect or any possible implementation manner.

[0069] In a possible implementation manner, the memory is located outside the communication apparatus.

[0070] In a possible implementation manner, the memory is located inside the communication apparatus.

[0071] In the embodiments of the present application, the processor and the memory can also be integrated into one device, that is, the processor and the memory can also be integrated together. For example, the communication apparatus can be a chip.

[0072] In a possible implementation manner, the communication apparatus further includes a transceiver configured to receive or send information.

[0073] In a seventh aspect, the embodiments of the present application provide a communication apparatus, which includes a logic circuit and an interface, the logic circuit and the interface are coupled; the interface is configured to input and / or output information, and the logic circuit is configured to execute the method in any one of the first aspect to the fourth aspect or any possible implementation manner.

[0074] In an eighth aspect, the embodiments of the present application provide a computer readable storage medium, which is configured to store a computer program, when the computer program is executed on a computer, the method in any one of the first aspect to the fourth aspect or any possible implementation manner is executed.

[0075] In a ninth aspect, the embodiments of the present application provide a computer program product, when the computer program product is executed on a computer, the method in any one of the first aspect to the fourth aspect or any possible implementation manner is executed.

[0076] In a tenth aspect, an embodiment of the present application provides a communication system, comprising a first node configured to perform the method of the first aspect or any possible implementation of the first aspect, and a second node configured to perform the method of the second aspect or any possible implementation of the second aspect.

[0077] In an eleventh aspect, an embodiment of the present application provides a communication system, comprising a first node configured to perform the method of the third aspect or any possible implementation of the third aspect, and a second node configured to perform the method of the fourth aspect or any possible implementation of the fourth aspect. BRIEF DESCRIPTION OF DRAWINGS

[0078] FIG. 1a and FIG. 1b are schematic diagrams of an architecture of a communication system according to an embodiment of the present application;

[0079] FIG. 2 is a schematic diagram of a sequence cumulative average cross-correlation according to an embodiment of the present application;

[0080] FIG. 3 is a schematic diagram of a flow of a measurement method according to an embodiment of the present application;

[0081] FIG. 4a is a schematic diagram of a format of a measurement field according to an embodiment of the present application;

[0082] FIG. 4b is a schematic diagram of another format of a measurement field according to an embodiment of the present application;

[0083] FIG. 5 is a schematic diagram of a format of a synchronization field according to an embodiment of the present application;

[0084] FIG. 6 is a schematic diagram of a format of a measurement frame according to an embodiment of the present application;

[0085] FIG. 7 is a schematic diagram of a scenario of a measurement method according to an embodiment of the present application;

[0086] FIG. 8a is a schematic diagram of a result of a cumulative average cross-correlation of a legitimate receiving device according to an embodiment of the present application;

[0087] FIG. 8b is a schematic diagram of a result of a cumulative average cross-correlation of an illegitimate receiving device according to an embodiment of the present application;

[0088] FIG. 9a is a schematic diagram of a result of a cumulative average cross-correlation of a legitimate receiving device when a frequency offset of a legitimate receiving device and a legitimate transmitting device is 0.1 ppm according to an embodiment of the present application;

[0089] FIG. 9b is a schematic diagram of a result of a cumulative average cross-correlation of an illegitimate receiving device when a frequency offset of an illegitimate receiving device and an illegitimate transmitting device is 10 ppm according to an embodiment of the present application;

[0090] FIG. 10a is a diagram illustrating a result of cumulative average cross-correlation of a legal receiving device according to an embodiment of the present application;

[0091] FIG. 10b is a diagram illustrating a result of cumulative average cross-correlation of an illegal receiving device according to an embodiment of the present application;

[0092] FIG. 11a is a diagram illustrating a result of cumulative average cross-correlation of a legal receiving device when frequency offset of both the legal receiving device and the legal transmitting device is 0.1 ppm according to an embodiment of the present application;

[0093] FIG. 11b is a diagram illustrating a result of cumulative average cross-correlation of an illegal receiving device when frequency offset of both the illegal receiving device and the legal transmitting device is 10 ppm according to an embodiment of the present application;

[0094] FIG. 12a is a diagram illustrating a result of cumulative average cross-correlation of a legal receiving device according to an embodiment of the present application;

[0095] FIG. 12b is a diagram illustrating a result of cumulative average cross-correlation of an illegal receiving device according to an embodiment of the present application;

[0096] FIG. 13a is a diagram illustrating a result of cumulative average cross-correlation of a legal receiving device when frequency offset of both the legal receiving device and the legal transmitting device is 0.1 ppm according to an embodiment of the present application;

[0097] FIG. 13b is a diagram illustrating a result of cumulative average cross-correlation of an illegal receiving device when frequency offset of both the illegal receiving device and the legal transmitting device is 10 ppm according to an embodiment of the present application;

[0098] FIG. 14 is a diagram illustrating a structure of a communication apparatus according to an embodiment of the present application;

[0099] FIG. 15 is a diagram illustrating another structure of a communication apparatus according to an embodiment of the present application;

[0100] FIG. 16 is a diagram illustrating still another structure of a communication apparatus according to an embodiment of the present application. DETAILED DESCRIPTION

[0101] In order to make the technical solution of the present application more comprehensible, the present application will be further described below with reference to the accompanying drawings.

[0102] The terms "first" and "second" and the like in the description, claims, and drawings of the present application merely mean to distinguish different objects, and are not intended to describe particular order. Furthermore, the terms "comprise" and "have" and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus, and the like that includes a series of steps or units is not limited to the listed steps or units, but optionally further includes steps or units not listed, and the like, or optionally further includes other steps or units inherent to the process, method, product, or apparatus, and the like.

[0103] Reference herein to an "embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are they necessarily mutually exclusive of one another. Those skilled in the art will appreciate from the present description that embodiments described herein can be combined with other embodiments in various ways.

[0104] In the present application, "at least one" means one or more, "multiple" means two or more, "at least two" means two or three and more, and "and / or" is used to describe the association relationship of the associated objects, which means that there can be three relationships, for example, "A and / or B" can mean: only A, only B, and A and B exist at the same time, where A and B can be singular or plural. "Or" means that there can be two relationships, such as only A, only B; when A and B are not mutually exclusive, it can also mean that there are three relationships, such as only A, only B, and A and B exist at the same time. The character " / " generally represents an "or" relationship between the associated objects before and after it. "At least one of the following" or similar expressions means any combination of these items. For example, at least one of a, b, or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c".

[0105] In the present application, "indication" can include direct indication, indirect indication, display indication, and implicit indication. When describing that certain indication information is used to indicate A, it can be understood that the indication information carries A, directly indicates A, or indirectly indicates A.

[0106] In the present application, "sending" and "receiving" represent the direction of signal transmission. For example, "sending information to XX" can be understood as that the destination of the information is XX, which can include direct sending through the air interface, or indirect sending through the air interface by other units or modules. "Receiving information from YY" can be understood as that the source of the information is YY, which can include direct receiving from YY through the air interface, or indirect receiving from YY through the air interface by other units or modules. "Sending" can also be understood as "output" of a chip interface, and "receiving" can also be understood as "input" of a chip interface. In other words, sending and receiving can be carried out between devices, such as between network devices and terminal devices, or can be carried out within a device, such as between components, modules, chips, software modules or hardware modules within a device through a bus, wire or interface.

[0107] The embodiments of the present application provide a measurement method and device, which can effectively improve the security of measurement.

[0108] The following introduces a system related to the embodiments of the present application.

[0109] The technical solutions provided in the embodiments of the present application can be applied to a wireless local area network (WLAN) system (including a wireless personal area network (WPAN)) based on a UWB technology, such as a spark link or nearlink or Wi-Fi, and the like. The technical solutions provided in the embodiments of the present application can also be applied to a spark link standard protocol, such as a spark link low energy (SLE) system, and the like. For example, the technical solutions provided in the embodiments of the present application can be applied to an institute of electrical and electronics engineers (IEEE) 802.11 series protocol (or referred to as a standard), such as an 802.11be protocol, an 802.11bn protocol (or referred to as Wi-Fi 8, and also referred to as ultra high reliability (UHR) or ultra high reliability and throughput (UHRT), and the like), or a next generation protocol of the 802.11bn protocol or an ambient power (AMP) supported protocol, and the like, which are not listed one by one. The technical solutions provided in the embodiments of the present application can also be applied to a wireless personal area network (WPAN) based on a millimeter wave (MMW) technology, such as an integrated MMW (IMMW) or an ultra wideband (UWB) technology, and the like. The technical solutions provided in the embodiments of the present application can be applied to an IEEE 802.15 series protocol, such as an 802.15.4a protocol, an 802.15.4z protocol or an 802.15.4ab protocol, or a future generation UWB WPAN protocol, and the like, which are not listed one by one.The technical solutions provided by the embodiments of the present application can also be applied to the following communication systems, for example, can be an internet of things (internet of things, IoT) system, vehicle-to-everything (vehicle-to-everything, V2X, X can represent any thing), device-to-device (device-to-device, D2D), narrowband internet of things (narrow band internet of things, NB-IoT) system, long term evolution (long term evolution, LTE) system, 5th-generation (5th-generation, 5G) communication system, and new communication systems that appear in future communication development, etc. For example, the V2X can include: vehicle-to-vehicle (vehicle to vehicle, V2V), vehicle-to-infrastructure (vehicle to infrastructure, V2I), vehicle-to-pedestrian (vehicle to pedestrian, V2P) or vehicle-to-network (vehicle to network, V2N) communication, etc.

[0110] The node involved in the present application is a device with communication capability, which can include but is not limited to at least one of user equipment, network equipment, industrial equipment, etc., or it can be a chip or functional module supporting the above-mentioned equipment, etc. For example, user equipment includes at least one of the following: handheld terminal, wearable terminal, vehicle, vehicle-mounted device, sensing device, smart home device, or leisure and entertainment device. Among them, the handheld terminal includes but is not limited to mobile phone, tablet, notebook computer, etc.; wearable device includes but is not limited to earphone, smart bracelet, smart watch, or smart glasses, etc.; vehicle includes but is not limited to vehicle, ship, aircraft, rail transit (such as subway, high-speed rail, etc.), or logistics robot (such as automated guided vehicle (AGV)), etc.; vehicle-mounted device includes but is not limited to domain controller (DC), screen, microphone, sound, electronic key, keyless entry, starting system controller, battery management system (BMS), battery pack, or battery cell, etc.; sensing device includes but is not limited to camera, radar, laser radar, light sensor, temperature sensor, or humidity sensor, etc.; smart home device includes but is not limited to projector, smart TV, smart refrigerator, smart home gateway, or security device, etc.; leisure and entertainment device includes but is not limited to virtual reality (VR) device, mixed reality (MR) device, massage chair, home theater, game control device or 4D cinema cabin, etc. Network equipment includes but is not limited to router, switch, or base station, etc. Industrial equipment includes but is not limited to industrial robot, or mechanical arm, etc. Of course, in addition to the above-mentioned various forms of equipment, the node can also be a chip or functional module or processing system that can be arranged in the above-mentioned equipment.

[0111] The node involved in the present application can also be a device involved in a UWB communication system. For example, the device can include but is not limited to communication server, router, switch, bridge, computer, mobile phone, smart home, tag, etc. For another example, the device can include a central control point, such as personal area network (PAN) or PAN coordinator, etc.

[0112] The nodes can be applied in various scenarios such as intelligent vehicles, intelligent homes, intelligent terminals, intelligent manufacturing, intelligent showrooms, mobile Internet (MI), industrial control, self-driving, transportation safety, or Internet of Things (IoT), and the like. In some application scenarios or some network types, devices with communication capabilities can not be referred to as nodes, but for the convenience of description, devices with communication capabilities are collectively referred to as nodes in the embodiments of the present application.

[0113] In the embodiments of the present application, the nodes can include first nodes and second nodes, and the above description about the nodes or the description of FIG. 1a and FIG. 1b below also applies to the first nodes and the second nodes.

[0114] FIG. 1a and FIG. 1b are schematic diagrams of architectures of communication systems provided by the embodiments of the present application. FIG. 1a is a star topology provided by the embodiments of the present application, and FIG. 1b is a peer-to-peer topology provided by the embodiments of the present application. As shown in FIG. 1a, in the star topology, a central control node (such as the PAN coordinator shown in FIG. 1a) can perform sensing, ranging, or data communication between one or more other devices. As shown in FIG. 1b, in the peer-to-peer topology, different devices can perform sensing, ranging, or data communication. In FIG. 1a and FIG. 1b, full function devices and reduced function devices can be referred to as nodes. Among them, the full function devices and the reduced function devices are relative, for example, the reduced function devices cannot be PAN coordinators. For another example, compared with the full function devices, the reduced function devices can have no coordination capability or a relatively low communication rate. The PAN coordinator shown in FIG. 1b is only an example, and the other three full function devices shown in FIG. 1b can also be PAN coordinators, which are not shown one by one here.

[0115] The following introduces the terms related to the embodiments of the present application.

[0116] 1. Sequence correlation

[0117] The correlation of two sequences can be as follows:

[0118] wherein, R a,b (τ) represents the correlation result of the two sequences, ai represents the i-th element in a sequence (e.g., a local sequence), b i+τ represents the i+τ-th element in another sequence (e.g., a received sequence), N represents the sequence length, and τ represents the relative shift number or sliding window step.

[0119] Generally, a receiving end can determine whether it is a legal receiving end by calculating the accumulated correlation between a received sequence and a local sequence. The received sequence can represent a sequence received by the receiving end, and the local sequence can represent a sequence generated by the receiving end or a sequence stored by the receiving end.

[0120] 2. Accumulated average cross-correlation

[0121] FIG. 2 is a schematic diagram of accumulated average cross-correlation of sequences according to an embodiment of the present application. In FIG. 2, S1-SN represent sequences, and CP represents a cyclic prefix. The accumulated average cross-correlation of the foregoing sequences is calculated as follows: Nseg

[0122] Each sequence s i (1≤i≤N) is calculated by sliding window to calculate the inner product of s i (1≤i≤N) and s seg (CP+s i ), and the sliding window step is 1 (or referred to as the shift number is 1) each time. The operation result of summing and averaging N seg inner products is the accumulated average cross-correlation.

[0123] For example, the sequence shown in the first row in FIG. 2 can be a local sequence, and the sequence shown in the second row can be a received sequence.

[0124] The method related to an embodiment of the present application is described below.

[0125] One of the key topics that SLP and 802.15.4ab focus on is secure ranging, that is, an illegal receiving device cannot obtain a correct CIR through an air interface transmitted UWB signal, so as to infer the distance or speed of a sending device and the like. The secure ranging mode usually has the following several modes:

[0126] (1) Time encryption, that is, the sending time of a plurality of segmented UWB signals is agreed by a legal transmitting-receiving party, so that an illegal receiving device cannot know the receiving time of the useful signal.

[0127] (2) Sequence encryption, that is, the sequence used by the plurality of segmented UWB signals is agreed by the legal transmitting-receiving party. Because the illegal receiving device does not have sequence-related information, it cannot generate a correct CIR through correlation accumulation (such as accumulated average cross-correlation).

[0128] As a possible implementation manner, an embodiment of the present application provides a measurement method, in which the different length sequences used by the transmitting-receiving party can be as follows:

[0129] Table 1 exemplarily shows sequences with length of 31.

[0130] The elements in the sequence can include "0", "+", and "-". The element "+" in the sequence shown in Tables 1-5 can also be represented by "1", and the element "-" can also be represented by "-1".

[0131] The relationship between the sequence indexes and the sequences in Tables 1-5 is only exemplary, and the sequence corresponding to each sequence index is not limited in the embodiments of the present application. For example, the sequence corresponding to the sequence index 0 in Table 1 can be 000-00+0++00++-+-000++0+--0+0-0 (as shown in Table 1), or can be +0000-0++0-0+000+-+0++++-00-00-, or can be -0+0--+0++000-+-++00++0+00-0000, or can be ++0000--+00-+0++-++0+000+00-0-0, or can be +0+000-++0-+---00+00++0000+0+-0, or can be 0000+0-0+++0+-000+-+++00-+0-00-, or can be 00-00-0+-00+++-+000-+0+++0-0+00, or can be -0-00+000+0++-++0+-00+--0000++0. The sequences corresponding to other sequence indexes are not listed here. The description of the indexes and the sequences is also applicable to the tables below.

[0132] The sequence indexes shown in Tables 1-5 are taken as an example with the starting index being 0, and the starting index can also be 1, and the like, which are not listed here. The starting index of each length of the sequence shown in Tables 1-5 is 0, and in the specific implementation, the starting index can also be sequentially arranged, for example, the sequence indexes shown in Table 1 are 0-7, the sequence indexes shown in Table 2 can be 8-17, and the like. The sequence indexes in the tables below can also be referred to as sequence numbers, and the like. The description of Tables 1-5 is also applicable to the tables below.

[0133] Table 1

[0134] Table 2 exemplarily shows sequences with length of 63.

[0135] Table 2

[0136] Table 3 exemplarily shows sequences with length of 91.

[0137] Table 3

[0138] Table 4 exemplarily shows sequences with a length of 127.

[0139] Table 4

[0140] Table 5 exemplarily shows sequences with a length of 133.

[0141] Table 5

[0142] Each sequence shown in Tables 1-5 can be a periodic perfect sequence. That is, the periodic autocorrelation sidelobes of each sequence are less than or equal to a threshold value. For example, the threshold value can be 0.

[0143] In the above implementation, the number of sequences with a length of 31, 91 is 8, and the number of sequences with a length of 127, 133 is 16. The smaller number results in insignificant security enhancement by channel symbols.

[0144] In view of this, another measurement method is further provided in the embodiments of the present application, in which the number of sequences is increased, and the security of measurement is effectively improved.

[0145] FIG. 3 is a flowchart of a measurement method provided by the embodiments of the present application. The description of the first node and the second node in the method can refer to the above, and will not be described in detail here. As shown in FIG. 3, the method includes the following steps.

[0146] In a possible implementation, the method shown in FIG. 3 can include step 301.

[0147] 301. The first node generates a measurement frame, the measurement frame including a measurement field, the measurement field including a measurement subsegment, the measurement subsegment including a channel symbol, the channel symbol being generated according to a measurement sequence.

[0148] The measurement frame can be used for ranging measurement between the first node and the second node, or the measurement frame can be used for perception measurement between the first node and the second node. The measurement frame can be used to determine a CIR. The CIR can be used to carry at least one of the following: distance information of the first node and the second node, distance information of a target, speed information of the target, or angle information of the target, etc. Since the measurement frame includes the channel symbol, which is generated according to the measurement sequence, it can be understood that the measurement frame is used to determine the CIR, or the measurement sequence is used to determine the CIR, or the measurement field is used to determine the CIR. The measurement frame can also be referred to as a UWB measurement frame, or an ultra-wideband signal measurement frame, etc. The specific name of the measurement frame is not limited in the embodiments of the present application.

[0149] The measurement field can include a plurality of measurement subsegments, and there can be a certain time interval between adjacent measurement subsegments.

[0150] As an example, the time interval between adjacent measurement subsegments can be the same, thereby reducing complexity.

[0151] As another example, the time interval between adjacent measurement subsegments can be different, thereby further improving the security of measurement. For example, the time interval is denoted as Tgap, which can be determined according to a basic time interval Tbase and an offset Toffset. For example, Tgap = Tbase – Toffset. Tbase can be configured by high layer signaling. Toffset can be determined by a security algorithm, for example, a random number can be generated by the security algorithm, and Toffset is configured by the random number. The security algorithm can include, but is not limited to, advanced encryption standard (AES) or national encryption (i.e., a domestic encryption algorithm approved by the National Cryptographic Administration). The description of Tgap herein also applies to FIG. 4a or FIG. 4b, and the following will not be repeated.

[0152] One measurement subsegment can include a plurality of channel symbols. For example, the lengths of the measurement sequences used by the plurality of channel symbols in the same measurement subsegment can be the same. For example, the lengths of the measurement sequences used by the plurality of channel symbols in the same measurement subsegment are 31, or 63, or 91, or 127, or 133.

[0153] As an example, the lengths of the measurement sequences used by different measurement subsegments can be the same, thereby reducing implementation complexity.

[0154] As another example, the lengths of the measurement sequences used by different measurement subsegments can be different, thereby further improving the security of measurement.

[0155] FIG. 4a is a schematic diagram of one format of a measurement field provided by an embodiment of the present application. As shown in FIG. 4a, the measurement field can include Mseg measurement subsegments, and the time interval between two adjacent measurement subsegments is Tgap. Each measurement subsegment can include Nseg channel symbols, such as CTS(0) ~ CTS(Nseg-1), CTS(Nseg) ~ CTS(2Nseg-1), and the like, which will not be listed one by one herein. The total number of channel symbols in the measurement field can be Ncts = Nseg * Mseg. Mseg and Nseg are both positive integers. FIG. 4a is illustrated by taking the lengths of the measurement sequences used by each measurement subsegment as an example.

[0156] Exemplarily, the Mseg can be configured by high layer signaling, and the Nseg can also be configured by high layer signaling. The configuration by high layer signaling shown in the embodiments of the present application can include being defined by a standard, or being negotiated by the transceiving parties, or being configured by a management node, etc.

[0157] FIG. 4a illustrates the format of one channel symbol taking CTS(i) as an example. One channel symbol can include K*L+Lcp+Lzero chips. The first node can generate K*L chips according to the measurement sequence, the last Lcp chips in the K*L chips can be used as a cyclic prefix, and Lzero zero chips can be included after the K*L chips. The Lcp and Lzero can be configured by high layer signaling.

[0158] In FIG. 4a, the length of the measurement sequence is K, C(0) represents the first element in the measurement sequence, C(1) represents the second element in the measurement sequence, and so on, and C(K-1) represents the last element in the measurement sequence. S represents a scrambling symbol. Exemplarily, the scrambling symbol can be the zth element in a binary pseudo-random sequence generated (+1, -1) by a security algorithm. Z is a positive integer. The same scrambling symbol can be used in the same channel symbol.

[0159] The transmission duration of one channel symbol can be x microseconds. For example, x=1. The transmission duration of one chip can be y nanoseconds. For example, y=2. Taking x=1 microsecond and y=2 nanoseconds as an example, the number of 0s inserted in one channel symbol can be (1 microsecond-2 nanoseconds*K) / 2 nanoseconds.

[0160] The embodiments of the present application also provide two ways of generating channel symbols.

[0161] Method 1: The channel symbol is generated according to a measurement symbol and a scrambling symbol, and the measurement symbol is obtained by time domain spreading of a measurement sequence.

[0162] The first node can perform zero-padding time domain extension on the measurement sequence to obtain a measurement symbol, generate a channel symbol according to the product of the measurement symbol and a scrambling symbol, and add a cyclic prefix and a zero-padding postfix.

[0163] Method 2: The channel symbol is generated by time domain spreading of a symbol generated according to a measurement sequence and a scrambling symbol.

[0164] The first node can generate a symbol #1 according to the product of a measurement sequence and a scrambling symbol, and then perform zero-padding time domain extension on the symbol #1 to obtain a channel symbol. For method 2, the measurement symbol is the measurement sequence.

[0165] The embodiments of the present application do not limit the specific generation method of the channel symbol.

[0166] Figure 4b is another format of the measurement field according to an embodiment of the present application. The description of the channel symbol in Figure 4b can refer to Figure 4a, which will not be repeated here. In Figure 4b, the channel symbol = the measurement symbol * the scrambling symbol, where the measurement symbol can be generated after zero-padding time-domain extension of the measurement sequence. For example, the measurement sequence is -1 -1 0 -1 1 0 0 -1 1 1 0 0 0 0 1 -1 0 1 0 1 0 0 1 0 0 0 1 0 1 1 -1. The measurement symbol generated after zero-padding time-domain extension of the measurement sequence can be -1 0…0 -1 0…0 00…0 -1 0…0 1 0…0 0 0…0 0 0…0 -1 0…0 1 0…0 1 0…0 0 0…0 0 0…0 0 0…0 0 0…0 1 0…0 -1 0…0 0 0…0 1 0…0 0 0…0 1 0…0 0 0…0 0 0…0 1 0…0 0 0…0 0 0…0 0 0…0 1 0…0 0 0…0 1 0…0 1 0…0 -1 0…0. In the above example, 0…0 after each element of the measurement sequence can be the inserted 0, and the omitted 0s are omitted. The number of 0s is not limited in the embodiments of the present application.

[0167] Figure 4b is another format of the measurement field according to an embodiment of the present application. The description of the channel symbol in Figure 4b can refer to Figure 4a, which will not be repeated here. In Figure 4b, the channel symbol = the measurement symbol * the scrambling symbol, where the measurement symbol can be generated after zero-padding time-domain extension of the measurement sequence. For example, the measurement sequence is -1 -1 0 -1 1 0 0 -1 1 1 0 0 0 0 1 -1 0 1 0 1 0 0 1 0 0 0 1 0 1 1 -1. The measurement symbol generated after zero-padding time-domain extension of the measurement sequence can be -1 0…0 -1 0…0 00…0 -1 0…0 1 0…0 0 0…0 0 0…0 -1 0…0 1 0…0 1 0…0 0 0…0 0 0…0 0 0…0 0 0…0 1 0…0 -1 0…0 0 0…0 1 0…0 0 0…0 1 0…0 0 0…0 0 0…0 1 0…0 0 0…0 0 0…0 0 0…0 1 0…0 0 0…0 1 0…0 1 0…0 -1 0…0. In the above example, 0…0 after each element of the measurement sequence can be the inserted 0, and the omitted 0s are omitted. The number of 0s is not limited in the embodiments of the present application.

[0168] In a possible implementation, the measurement frame can further include a synchronization field, which includes a synchronization symbol, where the synchronization symbol can be generated according to a measurement sequence. The synchronization symbol can be generated after zero-padding time-domain extension of the measurement sequence. The synchronization field can be used for synchronization between the transceiver and correction of frequency offset of the transceiver.

[0169] Figure 5 is a format of the synchronization field according to an embodiment of the present application. Figure 5 shows N synchronization symbols, such as S(0) to S(N-1). C(0) represents the first element of the measurement sequence, C(1) represents the second element of the measurement sequence, and so on, and C(K-1) represents the last element of the measurement sequence. The length of the measurement sequence is K. K = 31, or K = 63, or K = 91, or K = 127, or K = 133. The description of Figure 5 can refer to Figure 4a or Figure 4b, which will not be repeated here.

[0170] FIG. 6 is a schematic diagram of a format of a measurement frame according to an embodiment of the present application. The measurement frame can include a synchronization field and a measurement field. There can also be a time interval between the synchronization field and the measurement field, such as the interval Tgap between the synchronization symbol and the measurement subsegment (0) shown in FIG. 6. Optionally, the measurement frame can also include a preamble, etc. The present application does not limit the order of the preamble, the synchronization field and the measurement field, as shown in FIG. 6 by way of example.

[0171] The names of the measurement sequence, the measurement symbol, the channel symbol, the scrambling symbol and the synchronization symbol shown above are merely examples. In a specific implementation, any symbol (or other name) that conforms to the relationship between the measurement sequence, the measurement symbol, the channel symbol and the scrambling symbol shown in the embodiments of the present application, or that conforms to the relationship between the measurement sequence and the synchronization symbol, falls within the protection scope of the embodiments of the present application.

[0172] The description of the measurement sequence can be referred to below, and the method shown in FIG. 3 is not described in detail.

[0173] 302. The first node transmits a measurement frame, and correspondingly, the second node receives the measurement frame.

[0174] The description of the measurement frame can be referred to step 301, which is not described in detail here.

[0175] After the channel symbol is transmitted through the channel between the first node and the second node, the second node can receive the channel symbol. In order to distinguish the channel symbol received by the second node from the channel symbol generated by the second node itself, the present application refers to the channel symbol received by the second node as a first channel symbol, and refers to the channel symbol generated by the second node itself as a second channel symbol.

[0176] 303. The second node generates a second channel symbol according to the measurement sequence, and the second node determines the CIR according to the first channel symbol and the second channel symbol.

[0177] The second channel symbol generated by the second node can not include a cyclic prefix. The measurement sequence used by the second node to generate the second channel symbol is the same as the measurement sequence used by the first node to generate the first channel symbol. The method for the second node to generate the second channel symbol according to the measurement sequence can be referred to step 301. The format of the second channel symbol can be referred to FIG. 4a and FIG. 4b, and the generation method of the second channel symbol can be referred to method 1 and method 2. This is not described here.

[0178] The second node can correlate the first channel symbol and the second channel symbol, and determine the CIR according to the correlation result. The description of the correlation of the second node can also be referred to FIG. 2.

[0179] FIG. 7 is a schematic diagram of a scenario of a measurement method according to an embodiment of the present application. The first measurement frame in FIG. 7 can be a measurement frame sent by a first node, and the second measurement frame can be a measurement frame sent by a second node. FIG. 7 also exemplarily shows time illustrations of different signals, etc. As exemplarily shown in FIG. 7, the starting time and period of initial synchronization, the offset value between the ending time of initial synchronization and the starting time of a measurement frame, the time offset value between two measurement frames, the interaction period of measurement frames, etc.

[0180] The format of the first measurement frame and the second measurement frame, etc. can refer to FIG. 4a-6, which will not be described in detail here. FIG. 7 is exemplarily shown by taking two messages as an example. In a specific implementation, one of the first node or the second node can also not send a measurement frame. FIG. 7 is exemplarily shown by taking the number of measurement frame interactions as 3, which is not limited in the present application.

[0181] In the initial synchronization process, the first node and the second node can be determined by a management node; or, which is the first node and which is the second node can be negotiated by the first node and the second node. The management node can be used to manage the first node and the second node. For example, the first node and the second node can both be terminal (T) nodes, and the management node can have a communication capability and a management capability. Exemplarily, in the initial synchronization process, the management node, the first node or the second node can interact through a narrowband signal.

[0182] After the initial synchronization, the first node can send a first measurement frame, and the second node can send a second measurement frame. After the measurement is completed, the first node and the second node can respectively report a measurement result, which can include but is not limited to a CIR.

[0183] As a possible implementation, the management node can send indication information to the first node and the second node respectively, which can be used to indicate a random number seed, and the random number seed can be used to determine at least one of the following: a sequence index of a measurement sequence, a sequence index of a preset sequence corresponding to the measurement sequence, a cyclic shift bit number, or a sampling step. Exemplarily, the first node and the second node can both generate the same random number according to the same random number seed, and determine the same sequence index, the same cyclic shift bit number and the same sampling step by using the same random number and operation rules.

[0184] As another possible implementation, the first node and the second node can interact indication information. For example, the first node can send indication information to the second node; or, the second node can send indication information to the first node. The description of the indication information can refer to the above implementation, which will not be described in detail here.

[0185] In the embodiments of the present application, since the non-legitimate device cannot obtain the measurement sequence, even if the non-legitimate device receives the channel symbol, the non-legitimate device cannot obtain the correct CIR, thereby improving the security of the measurement.

[0186] The measurement sequence related by the embodiments of the present application is introduced as follows.

[0187] Each of the measurement sequences shown below can be a periodic perfect sequence. That is, the periodic autocorrelation sidelobe of each sequence is less than or equal to a threshold. For example, the threshold can be 0.

[0188] As a possible implementation, the measurement sequence can be defined by a standard, and the first node and the second node can both store the measurement sequence. For a node without sequence generation capability, the measurement sequence can be stored, thereby reducing the implementation complexity.

[0189] Tables 6-10 exemplarily show 32 sequences under each length. The measurement sequence can be any one of the sequences shown in Tables 6-10, or the measurement sequence can also be one of some of the sequences in Tables 6-10, for example, the total number of the measurement sequences under each length can be 16, etc. In this way, the memory structure of the node can be better matched. It can be understood that other measurement sequences can also be generated according to the method of generating the measurement sequence shown below, and the embodiments of the present application will not be shown one by one.

[0190] As an example, the embodiments of the present application provide a measurement sequence with a length of 31, and the measurement sequence can be one of N1 sequences, where N1 is greater than 8. For example, Table 6 shows that N1=32.

[0191] Table 6 exemplarily shows the measurement sequences with a length of 31. The measurement sequence corresponding to one channel symbol can be one of the 32 sequences shown in Table 6. Table 6 also exemplarily shows the sequence indexes of the sequences.

[0192] For Tables 6-10, the element "-1" in the sequence can also be represented by "-", and the element "1" can also be represented by "+". The relationship between the sequence index and the sequence is only an example, and for the sequence corresponding to each sequence index, the embodiments of the present application are not limited. That is, the index corresponding to the sequence shown in Tables 6-10 is only an example, for example, the index of the first sequence shown in Table 6 can be 1 (as shown in Table 6), or the index of the first sequence can also be one of indexes 2-32. Table 6 is exemplarily shown with the starting index being 0, and in the specific implementation, the starting index can also be 1, or other ways are adopted, etc., and the embodiments of the present application are not limited.

[0193] For a same channel symbol, the first node and the second node can generate a same random number according to a same random number seed, and then can determine a same sequence index according to the same random number. For example, the sequence index of the measurement sequence corresponding to the channel symbol can be determined by the operation result of the random number and the total number of measurement sequences with a length. For example, a measurement sub-segment can include channel symbol #1, channel symbol #2, …, channel symbol #K. The sequence length K can be configured by high layer signaling. The random numbers generated according to the random number seed are R#1, R#2, …, R#K. For example, the sequence index of the measurement sequence corresponding to channel symbol #1 can be R#1 mod N. The index of the measurement sequence corresponding to channel symbol #2 can be R#2 mod N, and so on. The above N represents the total number of measurement sequences, N=N1, or N=N2, or N=N3, or N=N4, or N=N5. The method of determining the index of the measurement sequence shown herein is applicable to the first node and also applicable to the second node. The method of determining the index of the measurement sequence shown herein is only an example, and in specific implementation, there can be other determination methods, which are not limited by the embodiments of the application. The description herein about determining the sequence index is also applicable to Tables 7-10, which will not be described in detail below.

[0194] The above-mentioned method of determining the sequence index of the measurement sequence is only an example. In the following, an example is illustrated in which a table is separately corresponding to a sequence with different lengths. In specific implementation, sequences with different lengths can also be combined into one table, and at this time, the index of the measurement sequence can be determined by the operation result of the random number and the total number of measurement sequences with different lengths. Herein, it will not be listed one by one.

[0195] Table 6

[0196] As another example, the embodiments of the application provide a measurement sequence with a length of 63, which can be one of N2 sequences, N2>10. Taking Table 7 as an example, N2=32.

[0197] Table 7 exemplarily shows the measurement sequence with a length of 63. The measurement sequence corresponding to a channel symbol can be one of the 32 sequences shown in Table 7. Table 7 also exemplarily shows the sequence index of each sequence. For other descriptions of Table 7, please refer to Table 6, which will not be described in detail herein.

[0198] Table 7

[0199] As another example, the embodiments of the application provide a measurement sequence with a length of 91, which can be one of N3 sequences, N3>8. Taking Table 8 as an example, N3=32.

[0200] Table 8 exemplarily shows the measurement sequences with length of 91. The measurement sequence corresponding to one channel symbol can be one of the 32 sequences shown in Table 8. Table 8 also exemplarily shows the sequence indexes of the sequences. For other descriptions of Table 8, refer to Table 6, which will not be described in detail herein.

[0201] Table 8

[0202] As yet another example, the embodiments of the present application provide the measurement sequences with length of 127, which can be one of N4 sequences, N4>16. Take Table 9 as an example, N4=32.

[0203] Table 9 exemplarily shows the measurement sequences with length of 127. The measurement sequence corresponding to one channel symbol can be one of the 32 sequences shown in Table 9. Table 9 also exemplarily shows the sequence indexes of the sequences. For other descriptions of Table 9, refer to Table 6, which will not be described in detail herein.

[0204] Table 9

[0205] As yet another example, the embodiments of the present application provide the measurement sequences with length of 133, which can be one of N5 sequences, N5>16. Take Table 10 as an example, N5=32.

[0206] Table 10 exemplarily shows the measurement sequences with length of 133. The measurement sequence corresponding to one channel symbol can be one of the 32 sequences shown in Table 10. Table 10 also exemplarily shows the sequence indexes of the sequences. For other descriptions of Table 10, refer to Table 6, which will not be described in detail herein.

[0207] Table 10

[0208] In the embodiments of the present application, by expanding the number of sequences under each length, the probability of generating correct channel symbols by non-legitimate receiving devices can be effectively reduced, and the security of measurement can be improved.

[0209] As another possible implementation, the first node and the second node can both generate the measurement sequence based on a preset sequence. For example, the generation of the measurement sequence can be defined by a standard, and the first node and the second node can generate the measurement sequence and generate the channel symbol according to the measurement sequence. The embodiments of the present application provide three methods, and the measurement sequence generated according to the three methods can meet the requirement of the periodic perfect sequence and can also expand the sequence number of the measurement sequence.

[0210] Method one, the measurement sequence is a sequence after the preset sequence is cyclically shifted.

[0211] The legal transceiving parties (i.e., the first node and the second node) can both obtain the measurement sequence according to the preset sequence being cyclically shifted. For a sequence with a length of K, the cyclic shift number can be any one of 0 to (K-1). When the cyclic shift number is 0, the measurement sequence is the same as the preset sequence.

[0212] Since the cyclic shift of x bits to the right is equivalent to the cyclic shift of (K-x) bits to the left, the embodiments of the present application are not limited to the cyclic shift to the right or the cyclic shift to the left.

[0213] Different channel symbols can use randomly selected sequences. For the same channel symbol, the legal transceiving parties can both generate the same random number according to the same random number seed, determine the same cyclic shift number and the same sequence index according to the same random number. For example, the legal transceiving parties can generate the same random number by using the same random number seed through AES or a national secret algorithm. The embodiments of the present application are not limited to the method of generating the random number. The method of generating the random number will not be described herein.

[0214] For example, the operation result of the random number R1 and the total number of sequences M can be used to determine the cyclic shift number, and the operation result of the random number R2 and the sequence length K can be used to determine the sequence index of the preset sequence. The above M represents the total number of preset sequences used to determine the measurement sequence. For example, for a preset sequence with a length of 31 or 91, M=8; for a preset sequence with a length of 63, M=10; and for a preset sequence with a length of 127 or 133, M=16. The above R1 and R2 can be the same or different.

[0215] For example, for a channel symbol, the sequence index corresponding to the channel symbol can be R1 mod M, and the cyclic shift number can be R2 mod K. For example, the result of R1 mod M is 2, and the cyclic shift number is 3, and then the measurement sequence can be a sequence after the preset sequence with a sequence index of 2 is cyclically shifted by 3 bits.

[0216] FIG. 8a is a diagram illustrating a result of the accumulated average cross-correlation of a legitimate receiving device according to an embodiment of the present application. The accumulated average cross-correlation is described above and will not be described again here. FIG. 8a illustrates a result in which the cyclic shift bit numbers of the first node and the second node are aligned for a same channel symbol.

[0217] FIG. 8b is a diagram illustrating a result of the accumulated average cross-correlation of an illegitimate receiving device according to an embodiment of the present application. FIG. 8b illustrates a result in which the cyclic shift bit numbers of the measurement sequence used by the sending device and the measurement sequence used by the illegitimate receiving device are not aligned. For each channel symbol, the cyclic shift bit number used by the sending device and the cyclic shift bit number used by the receiving device are not aligned.

[0218] FIG. 9a is a diagram illustrating a result of the accumulated average cross-correlation of a legitimate receiving device when the frequency offset of the legitimate receiving device and the sending device is 0.1 ppm according to an embodiment of the present application.

[0219] FIG. 9b is a diagram illustrating a result of the accumulated average cross-correlation of an illegitimate receiving device when the frequency offset of the illegitimate receiving device and the sending device is 10 ppm according to an embodiment of the present application.

[0220] In FIGS. 8a-9b, the horizontal axis represents the shift number (τ as shown above), and the vertical axis represents the peak value (R(τ) as shown above). a,b The simulation result is an example with the following parameters: Nseg = 16, K = 91, and the length of the CP is 16. The manner of setting the CP is described above.

[0221] FIGS. 8a-9b also illustrate the peak side lobe ratio (PSLR) corresponding to the peak value. FIG. 8b and FIG. 9b respectively illustrate a result in which the cyclic shift bit numbers of the sending device and the receiving device are not aligned for a same channel symbol using a same preset sequence, and a result in which the cyclic shift bit numbers of the sending device and the receiving device are not aligned for a same channel symbol using different preset sequences. The preset sequence can also be referred to as a base sequence, a known sequence, or an original sequence, and FIG. 8b and FIG. 9b are examples in which the base sequence is used.

[0222] As can be seen from FIG. 8a and FIG. 8b, or FIG. 9a and FIG. 9b, the CIR peak position measured by the illegitimate receiving device is different from the CIR peak position measured by the legitimate receiving device, and the PSLR is significantly reduced.

[0223] Method two: The measurement sequence is a sequence obtained by cyclically sampling a preset sequence. The length of the sequence obtained by cyclically sampling the preset sequence is the same as the length of the preset sequence.

[0224] The legitimate transceiver pair can obtain the measurement sequence according to the preset sequence and the cyclic sampling (or referred to as d sampling). The relationship between the sequence length K and the sampling step length d (or referred to as sampling interval) of the cyclic sampling can satisfy the following relationship: gcd (d, K) = 1. That is, the greatest common divisor of K and d is 1. d can be any value satisfying gcd (d, K) = 1. When d = 1, the measurement sequence is the same as the preset sequence.

[0225] The cyclic sampling can be understood as follows: the preset sequence is copied, the element after the last element of the nth preset sequence can be the first element in the (n+1)th preset sequence, and K elements are sequentially sampled at intervals of the sampling step length d. For example, the preset sequence is 1 0 0 0 0 -1 0 1 1 0 -1 0 1 0 0 0 1 -1 1 0 1 1 1 1 -1 0 0 -1 0 0 -1, and the sampling step length d = 2. Then, the sequence can be sequentially sampled as follows: 1 0 0 0 0 -1 0 1 1 0 -1 0 1 0 0 0 1 -1 1 0 1 1 1 1 -1 0 0 -1 0 0 -1 1 0 0 0 0 -1 0 1 1 0 -1 0 1 0 0 0 1 -1 1 0 1 1 1 1 -1 0 0 -1 0 0 -1. As the measurement sequence can include the following elements in the above sequence: the 1st element, the 1+dth element, the 1+2dth element, and so on. The obtained measurement sequence is 1 0 0 0 1 -1 1 0 1 1 1 1 -1 0 0 -1 0 0 -1 1 0 0 0 0 -1 0 1 1 0 -1 0.

[0226] Different channel symbols can use randomly selected sequences. For the same channel symbol, the legitimate transceiver pair can generate the same random number according to the same random number seed, determine the same sampling step length and the same sequence index according to the same random number.

[0227] For example, the operation result of the random number R and the total number of sequences M can be used to determine the sequence index of the preset sequence, and the operation result of the random number R2 and the total number of sampling step lengths |D| can be used to determine the sampling step length. For the preset sequence of the same length, the set of the sampling step lengths corresponding to the preset sequence can be {d1, d2, …, d D}. D

[0228] For example, for a channel symbol, the sequence index corresponding to the channel symbol can be R1 mod M, and the sampling step length can be ​If the modulo operation result of R2 and |D| is 2, the sampling step is d2 in the set D.

[0229] FIG. 10a is a diagram illustrating a result of the cumulative average cross-correlation of the legal receiving device according to an embodiment of the present application. The description of the cumulative average cross-correlation can refer to the above, and will not be repeated here. FIG. 10a shows the result of the sampling steps of the first node and the second node corresponding to the same channel symbol being aligned.

[0230] FIG. 10b is a diagram illustrating a result of the cumulative average cross-correlation of the illegal receiving device according to an embodiment of the present application. FIG. 10b shows the result of the sampling steps of the measurement sequence used by the sending device and the measurement sequence used by the illegal receiving device not being aligned.

[0231] FIG. 11a is a diagram illustrating a result of the cumulative average cross-correlation of the legal receiving device when the frequency offset of the legal receiving device and the sending device is 0.1 ppm according to an embodiment of the present application.

[0232] FIG. 11b is a diagram illustrating a result of the cumulative average cross-correlation of the illegal receiving device when the frequency offset of the illegal receiving device and the sending device is 10 ppm according to an embodiment of the present application.

[0233] The other descriptions of FIGS. 10a-11b can refer to FIGS. 8a-9b, and will not be repeated here.

[0234] As can be seen from FIGS. 10a and 10b, or FIGS. 11a and 11b, the CIR peak position measured by the illegal receiving device is different from the CIR peak position measured by the legal receiving device, and the PSLR is significantly reduced.

[0235] Method three, the measurement sequence is the sequence after the preset sequence is cyclically shifted and cyclically sampled.

[0236] Since the sequence after the preset sequence is cyclically shifted and cyclically sampled is the same as the sequence after the preset sequence is cyclically sampled and then cyclically shifted, the present embodiment does not limit the order of the cyclic shift and the cyclic sampling.

[0237] For the same channel symbol, the legal receiving device and the sending device can each generate at least one random number according to the random number seed. The operation result of the random number and the total number M of the preset sequences can be used to determine the sequence index of the preset sequence, the operation result of the random number and the total number |S| of the cyclic shift bits can be used to determine the cyclic shift bits, and the operation result of the random number and the total number |D| of the sampling steps can be used to determine the sampling step. Hereinafter, S represents the cyclic shift bit set, and D represents the sampling step set. The other descriptions of the cyclic shift and the other descriptions of the cyclic sampling can refer to the above method 1 and method 2, and will not be repeated here.

[0238] The sampling step and the number of cyclic shifts for preset sequences of different lengths are described below.

[0239] (1) For a preset sequence of length 31:

[0240] Let S = {0, 1, …, 30} and D = {d: d e {1, 2, 3, …, 30}, gcd(d, 31) = 1}, i.e., D = {1, 2, …, 30}.

[0241] |S x D| = 31 x 30 = 930. According to the properties of cyclic shift and cyclic sampling, there can be a large number of repeated sequences in the 930 sequences. Therefore, in order to save resources, embodiments of the present application select part of the 930 sequences as measurement sequences. Or, embodiments of the present application determine part of the 8 sequences of length 31 as preset sequences. The sequences obtained by cyclic shift and cyclic sampling according to the part of the sequences can reduce the proportion of repeated sequences as much as possible. The description of repeated sequences here also applies to the following, which will not be described in detail.

[0242] As an example, the preset sequence is 0 0 0 -1 0 0 1 0 1 1 0 0 1 1 -1 1 -1 0 0 0 1 1 0 1 -1 -1 0 1 0 -1 0. Taking Table 1 as an example, the sequence index of the preset sequence is 0. The number of cyclic shifts of the preset sequence S = {1, 2, 4, 5, 7, 9, 15}, and the sampling step of the preset sequence D = {1, 2, …, 30}. |S x D| = 7 x 30 = 210. From the 210 sequences, 186 non-repeated sequences can be obtained.

[0243] As another example, the preset sequence is 1 1 0 0 0 0 -1 -1 1 0 0 -1 1 0 1 1 -1 1 1 0 1 0 0 0 1 0 0 -1 0 -1 0. Taking Table 1 as an example, the sequence index of the preset sequence is 3. S = {1, 2, 3, 4, 5, 7, 17}, and D = {1, 2, …, 30}. |S x D| = 7 x 30 = 210. From the 210 sequences, 186 non-repeated sequences can be obtained.

[0244] In combination with the two preset sequences, for the preset sequence with length of 31, S={1, 2, 3, 4, 5, 7, 9, 15, 17}. That is, the legitimate transceiver can determine the measurement sequence according to the two preset sequences, the cyclic shift number S={1, 2, 3, 4, 5, 7, 9, 15, 17}, and the sampling step D={1, 2, …, 30}. According to the two preset sequences, S and D can determine 372 non-repeated sequences, which can be used as the measurement sequence.

[0245] For the preset sequence with length of 31, M=2, |S|=9, |D|=30. The method for the legitimate transceiver to determine the same measurement sequence can be as follows: if the operation result of R1 mod 2 is 0, the sequence index of the preset sequence can be 0, and if the operation result of R1 mod 2 is 1, the sequence index of the preset sequence can be 3. The cyclic shift number can be R2 mod 9, and the sampling step can be R3 mod 30.

[0246] FIG. 12a is a schematic diagram of the result of the cumulative average cross-correlation of the legitimate receiving device according to an embodiment of the present application. The description of the cumulative average cross-correlation can refer to the above, and will not be described in detail here. FIG. 12a shows the result of the first node and the second node aligning the sampling step corresponding to the same channel symbol and aligning the cyclic shift number corresponding to the same channel symbol.

[0247] FIG. 12b is a schematic diagram of the result of the cumulative average cross-correlation of the non-legitimate receiving device according to an embodiment of the present application. FIG. 10b shows the result of the measurement sequence used by the sending device and the measurement sequence used by the non-legitimate receiving device, the sampling steps corresponding to the two sequences are not aligned, and the cyclic shift numbers corresponding to the two sequences are not aligned.

[0248] FIG. 13a is a schematic diagram of the result of the cumulative average cross-correlation of the legitimate receiving device when the frequency offset of the legitimate transceiver is 0.1 ppm according to an embodiment of the present application.

[0249] FIG. 13b is a schematic diagram of the result of the cumulative average cross-correlation of the non-legitimate receiving device when the frequency offset of the non-legitimate receiving device and the sending device is 10 ppm according to an embodiment of the present application.

[0250] As can be seen from FIG. 12a and FIG. 12b, or FIG. 13a and FIG. 13b, the CIR peak position measured by the non-legitimate receiving device is different from the CIR peak position measured by the legitimate receiving device, and the PSLR is significantly reduced.

[0251] The following Tables 11-15 exemplarily show the sequences generated according to the three generation methods described above. The sequences under different lengths can be part or all of the sequences shown in Tables 11-15.

[0252] Table 11 exemplarily shows the measurement sequences with length of 31. The sequences with sequence indexes of 0-7 in Table 11 can be the 8 sequences shown in Table 1. The sequences with sequence indexes of 8-31 in Table 11 can be the measurement sequences obtained based on the preset sequences. In order to distinguish from which preset sequence a measurement sequence is cyclically shifted and / or cyclically sampled, Table 11 also shows the numbers of the sequences, and the sequences with same number are obtained based on the same preset sequence. The numbers shown in Table 11 are only examples and do not limit the present application. Table 11 also shows the sampling step of the cyclic sampling, and “\” can represent that the measurement sequence is the preset sequence, or the sampling step is 1.

[0253] The table shown in Table 11 is only an example, and in the specific implementation, the table for representing the sequences can include the first column, the third column and the fourth column, or the table can include the first column to the fourth column, and the like, which will not be enumerated one by one here. The other descriptions about the table can refer to Tables 1-10, which will not be enumerated one by one here.

[0254] Table 11

[0255] (2) For the preset sequences with length of 63:

[0256] Let S={0, 1, …, 62}, D={d: d∈{1, 2, 3, …, 62}, gcd(d, 63)=1}, |D|=36. |S×D|=2268. The embodiment of the present application determines part of the sequences from the 10 sequences with length of 63 as the preset sequences.

[0257] Exemplarily, the preset sequence is 1 1 1 1 1 1 -1 1 -1 1 -1 1 1 -1 -1 1 1 -1 1 1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1. Taking Table 2 as an example, the sequence index of the preset sequence is 0. S={0, 1, 3, 5, 7, 9, 11, 13, 15, 21, 23, 27, 31}, |S|=13. |S×D|=13×36=468, and 378 non-repeated sequences can be obtained from the 468 sequences.

[0258] For the preset sequence with length 63, M = 1, |S| = 13, |D| = 36. The method for determining the same measurement sequence by the legitimate transceiver can be as follows: the sequence index of the preset sequence can be 0, the cyclic shift bit number can be R1 mod 13, and the sampling step length can be R2 mod 36. Since M = 1, the legitimate transceiver can generate two random numbers, i.e., R1 and R2.

[0259] Table 12 exemplarily shows the measurement sequence with length 63. The description about Table 12 can refer to Table 11, or Tables 1-10, which will not be described in detail here.

[0260] Table 12

[0261] (3) For the preset sequence with length 91:

[0262] Let S = {0, 1,..., 90}, D = {d: d e {1, 2, 3,..., 90}, gcd(d, 91) = 1}, |D| = 72. |S x D| = 91 x 72 = 6552. The embodiment of the application determines part of the sequences from the 8 sequences with length 91 as the preset sequence.

[0263] As an example, the preset sequence is 1 0 1 1 1 -1 -1 -1 1 -1 -1 0 1 -1 0 1 -1 1 1 -1 1 1 1 -1 1 0 0 1 1 -1 0 -1 0 1 1 1 1 -1 1 1 -1 1 -1 -1 1 -1 1 -1 -1 1 1 1 0 1 -1 -1 -1 -1 -1 1 0 1 -1 1 -1 -1 -1 1 1 0 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 1 1 1. Taking Table 3 as an example, the sequence index of the preset sequence is 0. S = {1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 16, 19, 33, 38, 47}.

[0264] As another example, the preset sequence is -1 1 1 -1 1 -1 1 -1 0 1 1 -1 -1 -1 0 1 -1 -1 -1 1 1 -1 0 -1 0 -1 1 -1 1 0 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 1 1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 0 -1 1 1 1 1 1 1 -1 -1 -1 -1 -1 1 1 -1 1 1 0 0 1 1 0 -1 -1 1 1 -1 1 -1 -1 0 -1 1. Taking Table 3 as an example, the sequence index of the preset sequence is 3. S = {1, 2, 3, 4, 5, 7, 8, 9, 10, 12, 13, 16, 17, 18, 19, 35, 38, 80}.

[0265] In combination with the above two preset sequences, for the preset sequence with a length of 91, S = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19, 33, 35, 38, 47, 80}. According to S and D, 2184 non-repeated measurement sequences can be generated.

[0266] For the preset sequence with a length of 91, M = 2, |S| = 23, |D| = 72. The method for determining the same measurement sequence by the legal transceiver can be as follows: if the operation result of R1 mod 2 is 0, the sequence index of the preset sequence can be 0, and if the operation result of R1 mod 2 is 1, the sequence index of the preset sequence can be 3. The cyclic shift number can be R2 mod 23, and the sampling step length can be R3 mod 72.

[0267] Table 13 exemplarily shows the measurement sequence with a length of 91. The description about Table 13 can refer to Table 11, or Tables 1-10, which will not be described in detail herein.

[0268] Table 13

[0269] (4) For the preset sequence with a length of 127:

[0270] Let S = {0, 1, …, 126}, D = {1, 2, …, 126}, |D| = 126, |S x D| = 16002. The embodiments of the present application determine part of the sequences from 16 sequences with a length of 127 as the preset sequences.

[0271] As one example, the preset sequence is -1 0 1 0 0 -1 0 0 -1 0 1 0 0 -1 -1 1 1 0 0 -1 0 0 0 -1 1 0 -1 0 -1 0 0 0 0 1 1 1 1 1 1 1 0 1 -1 1 0 1 1 0 -1 1 -1 -1 0 1 0 0 0 1 0 1 -1 0 0 -1 0 1 1 -1 1 -1 0 0 0 1 0 0 0 0 0 0 -1 1 0 0 -1 1 0 -1 1 0 0 1 -1 -1 0 0 1 1 1 0 -1 0 1 -1 -1 0 0 0 0 -1 0 0 1 1 0 0 0 0 0 -1 0 -1 0 1 0 1. In the example of Table 4, the sequence index of this preset sequence is 0. S = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 16, 34, 35, 39, 43, 55}.

[0272] As another example, the preset sequence is 0 -1 0 1 0 1 1 0 1 1 1 0 0 1 0 0 0 0 -1 0 0 0 1 0 0 -1 0 0 -1 -1 1 1 0 1 0 1 0 0 0 0 0 -1 0 -1 1 1 1 0 0 -1 -1 1 0 -1 1 -1 -1 1 -1 -1 0 -1 1 0 0 -1 0 1 -1 0 0 0 -1 -1 0 0 1 1 0 -1 1 0 1 0 0 0 1 -1 1 -1 1 0 0 0 0 1 1 1 0 0 0 -1 0 1 0 0 -1 1 0 0 0 0 0 0 1 1 0 -1 0 1 -1 -1 0 1 0 0 -1. In the example of Table 4, the sequence index of this preset sequence is 1. S = {1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 16, 18, 19, 22, 26, 27, 28, 58, 59}.

[0273] As yet another example, the preset sequence is 0 1 0 0 -1 0 0 1 -1 1 1 0 -1 0 1 0 0 0 0 0 -1 0 -1 1 -1 1 0 0 -1 -1 -1 0 -1 -1 -1 -1 1 1 1 0 1 -1 0 0 1 0 -1 1 0 0 0 -1 1 0 0 1 -1 0 1 1 0 1 0 0 0 1 -1 -1 1 -1 0 0 0 0 1 1 -1 0 0 0 1 0 1 0 0 1 1 0 0 0 0 0 0 1 1 0 -1 0 -1 -1 1 0 -1 0 0 1 0 -1 0 1 0 1 1 0 1 -1 -1 0 0 1 0 0 0 0 1 0 0. The sequence index of this preset sequence is 2, using Table 4 as an example. S = {1, 2, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 37, 38, 42, 46, 58}.

[0274] As yet another example, the preset sequence is 1 1 0 -1 -1 1 0 -1 1 -1 1 0 0 0 0 -1 0 0 1 0 0 0 0 0 0 -1 0 1 -1 1 -1 -1 0 0 -1 0 0 0 0 -1 1 1 -1 0 0 0 -1 1 0 0 1 0 0 1 1 1 0 1 0 0 0 1 1 0 0 0 -1 0 -1 1 1 1 0 0 1 0 1 0 0 -1 -1 0 -1 -1 1 1 0 1 -1 1 1 0 -1 0 1 1 0 0 0 1 0 0 0 0 -1 -1 0 -1 0 0 1 -1 0 -1 0 1 0 1 0 0 0 1 0 -1 -1 1 0. The sequence index of this preset sequence is 3, using Table 4 as an example. S = {1, 2, 3, 4, 5, 6, 7, 8, 12, 14, 15, 18, 22, 23, 24, 26, 54, 55, 63}.

[0275] -1 1 0 0 0 -1 0 1 0 0 0 -1 -1 0 0 0 0 -1 0 0 0 0 0 1 1 1 -1 1 1 -1 0 1 0 1 0 -1 0 0 -1 1 0 0 1 1 1 0 -1 -1 1 0 1 0 0 -1 0 1 1 0 0 0 1 1 0 1 1 1 -1 0 -1 -1 0 -1 0 1 1 0 -1 1 0 0 -1 0 0 -1 0 0 0 1 -1 1 0 0 0 0 -1 0 1 1 -1 1 1 0 0 1 0 1 0 1 -1 -1 0 0 1 -1 0 -1 0 0 0 -1 0 0 -1 1. The sequence index of the preset sequence is 4, taking Table 4 as an example. S = {1, 2, 3, 4, 5, 6, 7, 9, 11, 12, 13, 27, 28, 30, 32, 36, 38, 46, 48}.

[0276] 2286 non-repeated sequences can be obtained according to each of the preset sequences described above.

[0277] In combination with the above 5 preset sequences, for the preset sequence with a length of 127, S = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19, 22, 23, 24, 26, 27, 28, 30, 32, 34, 35, 36, 37, 38, 39, 42, 43, 46, 48, 54, 55, 58, 59, 63}. |S| = 41. 11430 (2286*5) non-repeated sequences can be generated according to S and D.

[0278] For the preset sequence with a length of 127, M = 5, |S| = 41, |D| = 126. The method for determining the same measurement sequence by the legal transceiver can be as follows: the operation result of R1 mod 5 is 0, the sequence index of the preset sequence can be 0, the operation result of R1 mod 5 is 1, the sequence index of the preset sequence can be 1, the operation result of R1 mod 5 is 2, the sequence index of the preset sequence can be 2, the operation result of R1 mod 5 is 3, the sequence index of the preset sequence can be 3, the operation result of R1 mod 5 is 4, the sequence index of the preset sequence can be 4. The cyclic shift number can be R2 mod 41, and the sampling step length is R3 mod 126.

[0279] Table 14 exemplarily shows the measurement sequence with a length of 127. The description about Table 14 can refer to Table 11, or Tables 1-10, which will not be described in detail herein.

[0280] Table 14

[0281] (5) For the preset sequence with length of 133:

[0282] Let S = {0, 1, …, 132}, D = {d: d e {1, 2, 3, …, 133}, gcd(d, 133) = 1}, |D| = 108. |S x D| = 14364. Embodiments of the present application determine part of the 16 sequences with length of 133 as the preset sequence.

[0283] For example, the preset sequence is -1 0 -1 -1 1 1 1 1 1 1 1 0 -1 1 1 -1 -1 -1 0 -1 -1 1 -1 -1 -1 1 -1 -1 -1 0 1 -1 -1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 0 -1 1 1 1 0 0 1 0 -1 1 1 1 1 1 -1 1 -1 -1 1 0 1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 1 -1 -1 1 1 1 1 -1 -1 -1 1 0 -1 1 1 -1 1 1 -1 1 1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 -1 0 -1 -1 1 0 1 1 -1 1 -1 -1 -1. The sequence index of the preset sequence is 0 in Table 5. S = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 16, 17, 18, 19, 20, 21, 24, 25, 28, 29, 30, 31, 35, 36, 37, 41, 46, 47, 48, 49, 57, 58, 59, 60, 61, 68, 69, 70, 71, 72, 81, 82}, |S| = 45. |S x D| = 45 x 108 = 4860, and 4788 non-repeated sequences can be obtained from the 4860 sequences.

[0284] For the preset sequence with length of 133, M = 1, |S| = 45, |D| = 108. The method for determining the same measurement sequence by the legal transceiver can be shown as follows: the sequence index of the preset sequence can be 0, the cyclic shift number can be R1 mod 45, and the sampling step length can be R2 mod 108. Since M = 1, the legal transceiver can generate two random numbers, i.e., R1 and R2.

[0285] Table 15 exemplarily shows a measurement sequence with length of 133. The description about Table 15 can refer to Table 11, or Tables 1-10, which will not be described in detail here.

[0286] Table 15

[0287] In the above, the places not described in detail in one implementation manner or one example or one table can refer to other implementation manners or other examples or other tables.

[0288] The communication apparatus provided by the embodiments of the present application will be described below.

[0289] The present application divides the function modules of the communication apparatus according to the above-mentioned method embodiments. For example, each function module can be divided according to each function, or two or more functions can be integrated in one processing module. The above-mentioned integrated module can be realized in the form of hardware or in the form of software function module. It should be noted that the division of the modules in the present application is illustrative, and is only a logical function division. In actual implementation, there can be another division manner. The communication apparatus of the embodiments of the present application will be described in detail below with reference to FIGS. 14-16.

[0290] FIG. 14 is a structure schematic diagram of the communication apparatus provided by the embodiments of the present application. As shown in FIG. 14, the communication apparatus includes a processing module 1401 and a transceiver module 1402. The transceiver module 1402 can realize corresponding communication function, and the processing module 1401 is used to realize corresponding processing function. The transceiver module 1402 can also be referred to as an interface, a communication interface or a communication module, etc.

[0291] In some embodiments of the present application, the communication apparatus can be used to execute the actions performed by the first node in the above-mentioned method embodiments. At this time, the first node can be the device itself or a chip or a function module configured in the device, etc. The transceiver module 1402 is used to execute the transceiving related operations of the first node in the above-mentioned method embodiments, and the processing module 1401 is used to execute the processing related operations of the first node in the above-mentioned method embodiments.

[0292] The processing module 1401 can be used to generate a measurement frame, and the transceiver module 1402 can be used to send or output the measurement frame. For example, the transceiver module 1402 can be used to send the measurement frame to the second node through an antenna module. For another example, the transceiver module 1402 can output the measurement frame generated by the processing module through an input / output module. The description about sending or outputting here is also applicable to the following, which will not be described in detail.

[0293] The transceiver module 1402 can also be configured to send or output the indication information. For example, the transceiver module 1402 can be configured to send the indication information to the second node via the antenna module. For another example, the transceiver module 1402 can also be configured to output the indication information generated by the processing module 1401 via the input / output module. The above description about sending or outputting is also applicable to the following description, and thus will not be repeated here.

[0294] The transceiver module 1402 can also be configured to receive or input the indication information.

[0295] In another embodiment of the present disclosure, the communication apparatus can be configured to perform the actions of the second node in the above method embodiments. In this case, the second node can be the device itself or a chip or a functional module configured in the device. The transceiver module 1402 can be configured to perform the operations related to the transceiving of the second node in the above method embodiments, and the processing module 1401 can be configured to perform the operations related to the processing of the second node in the above method embodiments.

[0296] The transceiver module 1402 can be configured to receive or input the measurement frame. The processing module 1401 can be configured to generate the channel symbol according to the measurement sequence, and determine the CIR according to the channel symbol received by the transceiver module 1402 and the channel symbol generated by the processing module 1401.

[0297] The transceiver module 1402 can also be configured to receive or input the indication information. Alternatively, the transceiver module 1402 can also be configured to send or output the indication information.

[0298] For example, the transceiver module 1402 can include a radio frequency module, an antenna module, etc. For example, the above-mentioned sending or receiving steps can be implemented by the radio frequency module and the antenna module. For example, the transceiver module 1402 can include an input / output module, etc. For example, the above-mentioned outputting or inputting steps can be implemented by the input / output module.

[0299] Optionally, in the above embodiments, the communication apparatus can further include a storage module, which can be configured to store instructions and / or data. The processing module 1401 can read the instructions and / or data in the storage module, so that the communication apparatus implements the above method embodiments.

[0300] In the above embodiments, the specific description of each term or name or step can refer to the description in the above method embodiments, and thus will not be repeated here.

[0301] The specific description of the transceiver module and the processing module in the above embodiments is only an example. For the specific functions or steps of the transceiver module and the processing module, please refer to the above method embodiments, and thus will not be repeated here.

[0302] It can be understood that the division of modules in the above apparatus is only a logical function division, each function can correspond to a function module, or two or more functions can be integrated in a function module. In actual implementation, all or part of the modules can be integrated into one physical entity, or distributed in different physical entities. In addition, the above function modules can be implemented in the form of hardware, or in the form of software, or in the form of hardware combined with software.

[0303] In one example, the functional units in any of the above apparatuses can be one or more integrated circuits configured to implement the above methods, such as one or more application specific integrated circuits (ASICs), or one or more central processing units (CPUs), one or more microcontroller units (MCUs), one or more digital signal processors (DSPs), or one or more field programmable gate arrays (FPGAs), or a combination of at least two of these integrated circuit forms.

[0304] The communication apparatus of the embodiments of the present application is introduced above, and possible product forms of the communication apparatus are introduced below. Any form of product that has the functions of the communication apparatus described in FIG. 14 above falls within the protection scope of the embodiments of the present application. The following introduction is only an example and does not limit the product form of the communication apparatus of the embodiments of the present application.

[0305] In a possible implementation, in the communication apparatus shown in FIG. 14, the processing module 1401 can be one or more processors, and the transceiver module 1402 can be a transceiver, or the transceiver module 1402 can also be a sending module and a receiving module, the sending module can be a transmitter, and the receiving module can be a receiver, and the sending module and the receiving module are integrated in one device, for example, a transceiver. In the embodiment of the present application, the processor and the transceiver can be coupled, and the connection manner between the processor and the transceiver is not limited in the embodiment of the present application. In the process of executing the above method, the process about sending information in the above method can be the process that the processor outputs the above information. When the above information is output, the processor outputs the above information to the transceiver, so as to be transmitted by the transceiver. After the above information is output by the processor, the above information can also need to be processed further, and then reaches the transceiver. Similarly, the process about receiving information in the above method can be the process that the processor receives the input above information. When the processor receives the input information, the transceiver receives the above information and inputs the processor. Further, after the transceiver receives the above information, the above information can need to be processed further, and then inputs the processor.

[0306] FIG. 15 is another structural schematic diagram of the communication apparatus provided by the embodiment of the present application. As shown in FIG. 15, the communication apparatus 150 includes one or more processors 1520 and a transceiver 1510.

[0307] In some embodiments of the present application, the communication apparatus can be used to execute the steps or methods or functions executed by the first node, for example, the processor 1520 can be used to execute the functions or steps implemented by the processing module 1401 shown in FIG. 14, and the transceiver 1510 can be used to execute the functions or steps implemented by the transceiver module 1402 shown in FIG. 14. The specific description of the processor 1520 and the transceiver 1510 can refer to the method embodiments shown in FIG. 14 or the above, and will not be described in detail here.

[0308] In some embodiments of the present application, the communication apparatus can be used to execute the steps or methods or functions executed by the first node, for example, the processor 1520 can be used to execute the functions or steps implemented by the processing module 1401 shown in FIG. 14, and the transceiver 1510 can be used to execute the functions or steps implemented by the transceiver module 1402 shown in FIG. 14. The specific description of the processor 1520 and the transceiver 1510 can refer to the method embodiments shown in FIG. 14 or the above, and will not be described in detail here.

[0309] In the various implementations of the communication apparatus shown in FIG. 15, the transceiver can include a receiver for performing the functions (or operations) of receiving and a transmitter for performing the functions (or operations) of transmitting. The transceiver is configured to communicate with other devices / apparatuses via a transmission medium.

[0310] Optionally, the communication apparatus 150 can further include one or more memories 1530 for storing program instructions and / or data. The memory 1530 is coupled to the processor 1520. The coupling between the communication apparatus, units or modules in the embodiments of the present application can be indirect coupling or communication connection between the communication apparatus, units or modules, which can be electrical, mechanical or other forms, for information interaction between the communication apparatus, units or modules. The processor 1520 can operate in cooperation with the memory 1530. The processor 1520 can execute the program instructions stored in the memory 1530. Optionally, at least one of the one or more memories can be included in the processor.

[0311] The specific connection medium between the transceiver 1510, the processor 1520 and the memory 1530 in the embodiments of the present application is not limited. In FIG. 15, the memory 1530, the processor 1520 and the transceiver 1510 are connected through the bus 1540, which is represented by a thick line in FIG. 15, and the connection mode between other components is only schematically illustrated and is not limited. The bus can be divided into an address bus, a data bus, a control bus, etc. For convenience of representation, only one thick line is used in FIG. 15, but it does not mean that there is only one bus or only one type of bus.

[0312] In the embodiments of the present application, the processor can be a general processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, etc., which can implement or execute the disclosed methods, steps and logic block diagrams in the embodiments of the present application. The general processor can be a microprocessor or any conventional processor, etc. The steps of the method disclosed in conjunction with the embodiments of the present application can be directly embodied as execution completed by a hardware processor, or executed by a combination of hardware and software modules in the processor, etc.

[0313] In the embodiments of the present application, the memory can include, but is not limited to, a non-volatile memory such as a hard disk drive (HDD) or a solid-state drive (SSD), a random access memory (RAM), an erasable programmable ROM (EPROM), a read-only memory (ROM), a compact disc read-only memory (CD-ROM), and the like. The memory is any storage medium that can be used to carry or store program codes in the form of instructions or data structures and can be read and / or written by a computer (such as the communication device shown in the present application and the like). The memory in the embodiments of the present application can also be a circuit or any other device capable of realizing a storage function, used for storing program instructions and / or data.

[0314] The processor 1520 is mainly used for processing communication protocols and communication data, controlling the whole communication device, executing software programs, and processing data of the software programs. The memory 1530 is mainly used for storing software programs and data. The transceiver 1510 can include a control circuit and an antenna, and the control circuit is mainly used for converting baseband signals and radio frequency signals and processing the radio frequency signals. The antenna is mainly used for receiving and transmitting radio frequency signals in the form of electromagnetic waves. The input and output devices, such as touch screens, display screens, keyboards, and the like, are mainly used for receiving user input data and outputting data to users.

[0315] When the communication device is powered on, the processor 1520 can read the software program in the memory 1530, interpret and execute the instructions of the software program, and process the data of the software program. When data needs to be transmitted wirelessly, the processor 1520 performs baseband processing on the data to be transmitted, and outputs the baseband signal to the radio frequency circuit. The radio frequency circuit converts the baseband signal into a radio frequency signal, and transmits the radio frequency signal through the antenna in the form of electromagnetic waves. When data is transmitted to the communication device, the radio frequency circuit receives the radio frequency signal through the antenna, converts the radio frequency signal into a baseband signal, and outputs the baseband signal to the processor 1520. The processor 1520 converts the baseband signal into data and processes the data.

[0316] In another implementation, the radio frequency circuit and the antenna can be arranged independently of the processor performing baseband processing, for example, in a distributed scenario, the radio frequency circuit and the antenna can be arranged remotely from the communication device.

[0317] The communication apparatus shown in the embodiments of the present application can also have more components than those shown in FIG. 15, and the embodiments of the present application do not limit this. The method performed by the processor and the transceiver shown above is only an example, and the steps specifically performed by the processor and the transceiver can refer to the method described above. The dashed part in FIG. 15 represents an option.

[0318] In another possible implementation, in the communication apparatus shown in FIG. 14, the processing module 1401 can be one or more logic circuits, and the transceiving module 1402 can be an input / output interface, also referred to as a communication interface, or an interface circuit, or an interface, etc. Alternatively, the transceiving module 1402 can also be a sending module and a receiving module, the sending module can be an output interface, and the receiving module can be an input interface, and the sending module and the receiving module are integrated into one module, for example, an input / output interface.

[0319] FIG. 16 is another structure of a communication apparatus provided by the embodiments of the present application. As shown in FIG. 16, the communication apparatus shown in FIG. 16 includes a logic circuit 1601 and an interface 1602. That is, the processing module 1401 can be implemented by the logic circuit 1601, and the transceiving module 1402 can be implemented by the interface 1602. The logic circuit 1601 can be a chip, a processing circuit, an integrated circuit, or a system on chip (SoC) chip, etc., and the interface 1602 can be a communication interface, an input / output interface, a pin, etc. For example, FIG. 16 is shown by taking the communication apparatus as a chip, and the chip includes the logic circuit 1601 and the interface 1602.

[0320] In the embodiments of the present application, the logic circuit and the interface can also be coupled to each other. The embodiments of the present application do not limit the specific connection mode of the logic circuit and the interface. For example, the logic circuit 1601 can be used to perform the functions or steps implemented by the processing module 1401 shown in FIG. 14, and the interface 1602 can be used to perform the functions or steps implemented by the transceiving module 1402 shown in FIG. 14. For specific description of the logic circuit 1601 and the interface 1602, refer to the method embodiments shown in FIG. 14 or the above description, which will not be described in detail here.

[0321] The communication apparatus shown in the embodiments of the present application can implement the method provided by the embodiments of the present application in the form of hardware, or implement the method provided by the embodiments of the present application in the form of software, etc., and the embodiments of the present application do not limit this.

[0322] In addition, the embodiments of the present application also provide a communication system, which includes a first node and a second node, and the first node and the second node can be used to perform the method in any of the preceding embodiments.

[0323] The application further provides a computer program for implementing the operations and / or processes performed by each station in the method provided by the application.

[0324] The application further provides a computer readable storage medium having computer code stored therein, which, when executed on a computer, causes the computer to perform the operations and / or processes performed by each communication device in the method provided by the application.

[0325] The application further provides a computer program product comprising computer code or a computer program, which, when executed on a computer, causes the operations and / or processes performed by each station in the method provided by the application to be performed.

[0326] In several embodiments provided by the application, it should be understood that the disclosed system, communication device and method can be implemented in other manners. For example, the embodiments of the communication device described above are merely schematic; for example, the division of the modules is merely a logical function division; an actual implementation can be another division manner, for example, multiple modules or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the displayed or discussed mutual couplings or direct couplings or communication connections between different modules can be indirect couplings or communication connections through some interfaces, communication devices or modules, and can be electrical, mechanical or other forms.

[0327] The modules illustrated as separate components can or can not be physically separate, and the components illustrated as modules can or can not be physical modules, i.e., can be located in one place, or can be distributed on multiple network modules. Part or all of the modules can be selected according to actual needs to achieve the technical effects of the scheme provided by the embodiments of the application.

[0328] In addition, each functional module in each embodiment of the application can be integrated into a processing module, or each module can exist physically, or two or more modules can be integrated into one module. The integrated module can be implemented in the form of hardware or in the form of a software functional module.

[0329] The integrated module, if implemented in the form of a software function module and sold or used as an independent product, can be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the present application essentially or say the part that contributes to the prior art, or the whole or part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a readable storage medium, including a plurality of instructions to make a computer device (which can be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the method described in various embodiments of the present application. The aforementioned readable storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and various media that can store program codes.

[0330] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art can easily think of changes or replacements within the technical scope disclosed in the present application, which should be covered within the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims

A measuring method characterized by, The method comprises: generating a measurement frame, the measurement frame comprising a measurement field, the measurement field comprising a measurement subsegment, the measurement subsegment comprising a channel symbol, the channel symbol being generated according to a measurement sequence, the measurement sequence being a sequence after cyclic shift of a preset sequence, or the measurement sequence being a sequence after cyclic sampling of the preset sequence, or the measurement sequence being a sequence after cyclic shift and cyclic sampling of the preset sequence; sending the measurement frame. The method of claim 1, wherein In the case that the length of the measurement sequence is 31 and the measurement sequence is a sequence after cyclic shift and cyclic sampling of the preset sequence, the number of bits of cyclic shift is any one of the following: 1, 2, 3, 4, 5, 7, 9, 15, 17. The preset sequence is 0 0 0 -1 0 0 1 0 1 1 0 0 1 1 -1 1 -1 0 0 0 1 1 0 1 -1 -1 0 1 0 -1 0. Or, The preset sequence is 1 1 0 0 0 0 -1 -1 1 0 0 -1 1 0 1 1 -1 1 1 0 1 0 0 1 0 0 -1 0 -1 0. The method of claim 1, wherein In the case that the length of the measurement sequence is 63 and the measurement sequence is a sequence after cyclic shift and cyclic sampling of the preset sequence, the number of bits of cyclic shift is any one of the following: 0, 1, 3, 5, 7, 9, 11, 13, 15, 21, 23, 27, 31. The preset sequence is 1 1 1 1 1 1 -1 1 -1 1 -1 1 1 -1 -1 1 1 -1 1 1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1. The method of claim 1, wherein In the case that the length of the measurement sequence is 91 and the measurement sequence is a sequence after cyclic shift and cyclic sampling of the preset sequence, the number of bits of cyclic shift is any one of the following: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19, 33, 35, 38, 47, 80. The preset sequence is 1 0 1 1 1 -1 -1 -1 1 -1 -1 0 1 -1 0 1 -1 1 1 -1 1 1 1 -1 1 0 0 1 1 -1 0 -1 0 1 1 1 1 -1 1 1 -1 1 -1 -1 1 -1 1 -1 -1 1 1 1 0 1 -1 -1 -1 -1 -1 1 0 1 -1 1 -1 -1 -1 1 1 0 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 1 1 1; or, The preset sequence is -1 1 1 -1 1 -1 1 -1 0 1 1 -1 -1 -1 0 1 -1 -1 -1 1 1 -1 0 -1 0 -1 1 -1 1 0 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 1 1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 0 -1 1 1 1 1 1 1 -1 -1 -1 -1 -1 1 1 -1 1 1 0 0 1 1 0 -1 -1 1 1 -1 1 -1 -1 0 -1 1. The method of claim 1, wherein The length of the measurement sequence is 127, the measurement sequence is a sequence after cyclic shift and cyclic sampling of the preset sequence, and the number of bits of the cyclic shift is any one of 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19, 22, 23, 24, 26, 27, 28, 30, 32, 34, 35, 36, 37, 38, 39, 42, 43, 46, 48, 54, 55, 58, 59, 63; The preset sequence is any one of the following: -1 0 1 0 0 -1 0 0 -1 0 1 0 0 -1 -1 1 1 0 0 -1 0 0 0 -1 1 0 -1 0 -1 0 0 0 0 1 1 1 1 1 1 1 0 1 -1 1 0 1 1 0 -1 1 -1 -1 0 1 0 0 0 1 0 1 -1 0 0 -1 0 1 1 -1 1 -1 0 0 0 1 0 0 0 0 0 0 -1 1 0 0 -1 1 0 -1 1 0 0 0 1 -1 -1 0 0 1 1 1 0 -1 0 1 -1 -1 0 0 0 0 -1 0 0 1 1 0 0 0 0 0 -1 0 -1 0 1 0 1； 0 -1 0 1 0 1 1 0 1 1 1 0 0 1 0 0 0 0 -1 0 0 0 1 0 0 -1 0 0 -1 -1 1 1 0 1 0 1 0 0 0 0 0 -1 0 -1 1 1 1 0 0 -1 -1 1 0 -1 1 -1 -1 1 -1 -1 0 -1 1 0 0 -1 0 1 -1 0 0 0 -1 -1 0 0 1 1 0 -1 1 0 1 0 0 0 1 -1 1 -1 1 0 0 0 0 1 1 1 0 0 0 -1 0 1 0 0 -1 1 0 0 0 0 0 0 1 1 0 -1 0 1 -1 -1 0 1 0 0 -1； 0 1 0 0 -1 0 0 1 -1 1 1 0 -1 0 1 0 0 0 0 0 -1 0 -1 1 -1 1 0 0 -1 -1 -1 0 -1 -1 -1 -1 1 1 1 0 1 -1 0 0 1 0 -1 1 0 0 0 -1 1 0 0 1 -1 0 1 1 0 1 0 0 0 1 -1 -1 1 -1 0 0 0 0 1 1 -1 0 0 0 1 0 1 0 0 1 1 0 0 0 0 0 0 1 1 0 -1 0 -1 -1 1 0 -1 0 0 1 0 -1 0 1 0 1 1 0 1 -1 -1 0 0 1 0 0 0 0 1 0 0； 1 1 0 -1 -1 1 0 -1 1 -1 1 0 0 0 0 -1 0 0 1 0 0 0 0 0 0 -1 0 1 -1 1 -1 -1 0 0 -1 0 0 0 0 -1 1 1 -1 0 0 0 -1 1 0 0 1 0 0 1 1 1 0 1 0 0 0 1 1 0 0 0 -1 0 -1 1 1 1 0 0 1 0 1 0 0 -1 -1 0 -1 -1 1 1 0 1 -1 1 1 0 -1 0 1 1 0 0 0 1 0 0 0 0 -1 -1 0 -1 0 0 1 -1 0 -1 0 1 0 1 0 0 0 1 0 -1 -1 1 0； -1 1 0 0 0 -1 0 1 0 0 0 0 -1 -1 0 0 0 0 0 -1 0 0 0 0 0 0 1 1 1 -1 1 1 -1 0 1 0 1 0 -1 0 0 -1 1 0 0 1 1 1 0 -1 -1 1 0 1 0 0 -1 0 1 1 0 0 0 1 1 0 1 1 1 -1 0 -1 -1 0 -1 0 1 1 0 -1 1 0 0 -1 0 0 -1 0 0 0 1 -1 1 0 0 0 0 -1 0 1 1 -1 1 1 0 0 1 0 1 0 1 -1 -1 0 0 1 -1 0 -1 0 0 0 -1 0 0 -1 1。 The method of claim 1, wherein The length of the measurement sequence is 133, the measurement sequence is a sequence after cyclic shift and cyclic sampling of the preset sequence, and the number of bits of the cyclic shift is any one of 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 16, 17, 18, 19, 20, 21, 24, 25, 28, 29, 30, 31, 35, 36, 37, 41, 46, 47, 48, 49, 57, 58, 59, 60, 61, 68, 69, 70, 71, 72, 81, 82; The preset sequence is -1 0 -1 -1 1 1 1 1 1 1 1 0 -1 1 1 -1 -1 -1 0 -1 -1 1 -1 -1 -1 1 -1 -1 -1 0 1 -1 -1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 0 -1 1 1 1 0 0 1 0 -1 1 1 1 1 1 -1 1 -1 -1 1 0 1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 1 -1 -1 1 1 1 1 -1 -1 -1 1 0 -1 1 1 -1 1 1 -1 1 1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 -1 0 -1 -1 1 0 1 1 -1 1 -1 -1 -1. The method according to any one of claims 1 to 6, characterized in that The greatest common divisor between the length of the measurement sequence and the sampling step length of the cyclic sampling is 1. The method according to any one of claims 1 to 7, characterized in that The channel symbol is generated according to the measurement sequence and comprises: The channel symbol is generated according to a measurement symbol and a scrambling symbol, the measurement symbol being obtained after time domain spreading of the measurement sequence; or The channel symbol is generated after time domain spreading of a symbol generated according to the measurement sequence and a scrambling symbol. A method of measuring, characterized in that The method comprises: receiving a measurement frame, the measurement frame comprising a measurement field, the measurement field comprising a measurement subsegment, the measurement subsegment comprising a first channel symbol; generating a second channel symbol according to a measurement sequence, the measurement sequence being a sequence obtained after cyclic shifting of a preset sequence, or the measurement sequence being a sequence obtained after cyclic sampling of the preset sequence, or the measurement sequence being a sequence obtained after cyclic shifting and cyclic sampling of the preset sequence; determining a channel impulse response (CIR) according to the first channel symbol and the second channel symbol. The method of claim 9, wherein In the case that the length of the measurement sequence is 31 and the measurement sequence is a sequence obtained after cyclic shifting and cyclic sampling of the preset sequence, the number of bits of the cyclic shifting is any one of the following: 1, 2, 3, 4, 5, 7, 9, 15, 17. The preset sequence is 0 0 0 -1 0 0 1 0 1 1 0 0 1 1 -1 1 -1 0 0 0 1 1 0 1 -1 -1 0 1 0 -1 0. Or, The preset sequence is 1 1 0 0 0 0 -1 -1 1 0 0 -1 1 0 1 1 -1 1 1 0 1 0 0 1 0 0 -1 0 -1 0. The method of claim 9, wherein In the case that the length of the measurement sequence is 63 and the measurement sequence is a sequence obtained after cyclic shifting and cyclic sampling of the preset sequence, the number of bits of the cyclic shifting is any one of the following: 0, 1, 3, 5, 7, 9, 11, 13, 15, 21, 23, 27, 31. The preset sequence is 1 1 1 1 1 1 -1 1 -1 1 -1 1 1 -1 -1 1 1 -1 1 1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1. The method of claim 9, wherein In the case that the length of the measurement sequence is 91 and the measurement sequence is a sequence obtained after cyclic shifting and cyclic sampling of the preset sequence, the number of bits of the cyclic shifting is any one of the following: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19, 33, 35, 38, 47, 80. the preset sequence is 1 0 1 1 1 -1 -1 -1 1 -1 -1 0 1 -1 0 1 -1 1 1 -1 1 1 1 -1 1 0 0 1 1 -1 0 -1 0 1 1 1 1 -1 1 1 -1 1 -1 -1 1 -1 1 -1 -1 1 1 0 1 -1 -1 -1 -1 -1 1 0 1 -1 1 -1 -1 -1 1 1 0 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 1 1 1; or the preset sequence is -1 1 1 -1 1 -1 1 -1 0 1 1 -1 -1 -1 0 1 -1 -1 -1 1 1 -1 0 -1 0 -1 1 -1 1 0 1 1 1 -1 1 1 1 1 1 1 1 -1 -1 1 1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 0 -1 1 1 1 1 1 1 -1 -1 -1 -1 -1 1 1 -1 1 1 0 0 1 1 0 -1 -1 1 1 -1 1 -1 -1 0 -1 1. The method of claim 9, wherein the length of the measurement sequence is 127, the measurement sequence is the preset sequence cyclically shifted, and the number of bits of the cyclic shift in the case of a sequence after cyclic sampling is any one of 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19, 22, 23, 24, 26, 27, 28, 30, 32, 34, 35, 36, 37, 38, 39, 42, 43, 46, 48, 54, 55, 58, 59, 63; the preset sequence is any one of -1 0 1 0 0 -1 0 0 -1 0 1 0 0 -1 -1 1 1 0 0 -1 0 0 0 -1 1 0 -1 0 -1 0 0 0 0 1 1 1 1 1 1 1 0 1 -1 1 0 1 1 0 -1 1 -1 -1 0 1 0 0 0 1 0 1 -1 0 0 -1 0 1 1 -1 1 -1 0 0 0 1 0 0 0 0 0 0 -1 1 0 0 -1 1 0 -1 1 0 0 0 1 -1 -1 0 0 1 1 1 0 -1 0 1 -1 -1 0 0 0 0 -1 0 0 1 1 0 0 0 0 0 -1 0 -1 0 1 0 1； 0 -1 0 1 0 1 1 0 1 1 1 0 0 1 0 0 0 0 -1 0 0 0 1 0 0 -1 0 0 -1 -1 1 1 0 1 0 1 0 0 0 0 0 -1 0 -1 1 1 1 0 0 -1 -1 1 0 -1 1 -1 -1 1 -1 -1 0 -1 1 0 0 -1 0 1 -1 0 0 0 -1 -1 0 0 1 1 0 -1 1 0 1 0 0 0 1 -1 1 -1 1 0 0 0 0 1 1 1 0 0 0 -1 0 1 0 0 -1 1 0 0 0 0 0 0 1 1 0 -1 0 1 -1 -1 0 1 0 0 -1； 0 1 0 0 -1 0 0 1 -1 1 1 0 -1 0 1 0 0 0 0 0 -1 0 -1 1 -1 1 0 0 -1 -1 -1 0 -1 -1 -1 -1 1 1 1 0 1 -1 0 0 1 0 -1 1 0 0 0 -1 1 0 0 1 -1 0 1 1 0 1 0 0 0 1 -1 -1 1 -1 0 0 0 0 1 1 -1 0 0 0 1 0 1 0 0 1 1 0 0 0 0 0 0 1 1 0 -1 0 -1 -1 1 0 -1 0 0 1 0 -1 0 1 0 1 1 0 1 -1 -1 0 0 1 0 0 0 0 1 0 0； 1 1 0 -1 -1 1 0 -1 1 -1 1 0 0 0 0 -1 0 0 1 0 0 0 0 0 0 -1 0 1 -1 1 -1 -1 0 0 -1 0 0 0 0 -1 1 1 -1 0 0 0 -1 1 0 0 1 0 0 1 1 1 0 1 0 0 0 1 1 0 0 0 -1 0 -1 1 1 1 0 0 1 0 1 0 0 -1 -1 0 -1 -1 1 1 0 1 -1 1 1 0 -1 0 1 1 0 0 0 1 0 0 0 0 -1 -1 0 -1 0 0 1 -1 0 -1 0 1 0 1 0 0 0 1 0 -1 -1 1 0； -1 1 0 0 0 -1 0 1 0 0 0 0 -1 -1 0 0 0 0 0 -1 0 0 0 0 0 0 1 1 1 -1 1 1 -1 0 1 0 1 0 -1 0 0 -1 1 0 0 1 1 1 0 -1 -1 1 0 1 0 0 -1 0 1 1 0 0 0 1 1 0 1 1 1 -1 0 -1 -1 0 -1 0 1 1 0 -1 1 0 0 -1 0 0 -1 0 0 0 1 -1 1 0 0 0 0 -1 0 1 1 -1 1 1 0 0 1 0 1 0 1 -1 -1 0 0 1 -1 0 -1 0 0 0 -1 0 0 -1 1。 The method of claim 9, wherein the length of the measurement sequence is 133, the measurement sequence is the preset sequence cyclically shifted, and the number of bits of the cyclic shift in the case of a sequence after cyclic sampling is any one of 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 16, 17, 18, 19, 20, 21, 24, 25, 28, 29, 30, 31, 35, 36, 37, 41, 46, 47, 48, 49, 57, 58, 59, 60, 61, 68, 69, 70, 71, 72, 81, 82; The preset sequence is -1 0 -1 -1 1 1 1 1 1 1 1 0 -1 1 1 -1 -1 -1 0 -1 -1 1 -1 -1 -1 1 -1 -1 -1 0 1 -1 -1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 0 -1 1 1 1 0 0 1 0 -1 1 1 1 1 1 -1 1 -1 -1 1 0 1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 1 -1 -1 1 1 1 1 -1 -1 -1 1 0 -1 1 1 -1 1 1 -1 1 1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 -1 0 -1 -1 1 0 1 1 -1 1 -1 -1 -1. The method according to any one of claims 9-14, characterized in that A greatest common divisor between a length of the measurement sequence and a sampling step of cyclic sampling is 1. The method according to any one of claims 9-15, characterized in that The method comprises: The method comprises: The method comprises: A measuring method characterized by, The method comprises: The method comprises: The method comprises: The method of claim 17, wherein The measurement sequence has a length of 31, and the measurement sequence is one of N1 sequences, where N1 is greater than 8. The method according to claim 17 or 18, characterized in that The measurement sequence is any one of the following: -1 -1 0 -1 1 0 0 -1 1 1 0 0 0 0 1 -1 0 1 0 1 0 0 1 0 0 0 1 0 1 1 -1； -1 -1 -1 1 1 0 1 0 0 0 1 0 0 1 0 1 0 -1 1 0 0 0 0 1 1 -1 0 0 1 -1 0； -1 0 0 -1 0 0 -1 1 1 1 1 0 1 -1 1 0 0 0 1 0 -1 0 1 1 0 -1 0 0 0 0 1； -1 -1 1 -1 0 1 1 -1 0 0 0 1 0 1 0 -1 1 0 1 0 0 0 0 1 1 0 0 1 0 0 -1。 The method of claim 17, wherein The measurement sequence has a length of 63, and the measurement sequence is one of N2 sequences, where N2 is greater than 10. The method according to claim 17 or 20, characterized in that The measurement sequence is any one of the following: 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 1 1 -1 1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 -1； 1 -1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 1 1 -1 1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1； 1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 1 1 -1 1 1 -1 -1 1 1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1； -1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 1 1 -1 1 -1 -1 1 1。 The method of claim 17, wherein The measurement sequence has a length of 91, and the measurement sequence is one of N3 sequences, where N3 is greater than 8. The method according to claim 17 or 22, characterized in that The measurement sequence is any one of the following: -1 -1 0 1 -1 1 -1 -1 -1 -1 0 -1 1 -1 1 -1 1 0 1 -1 -1 1 1 -1 1 -1 1 1 1 0 -1 0 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 1 1 1 1 -1 1 1 -1 1 0 0 1 -1 -1 1 0 -1 -1 1 0 1 1 1 1 1 -1 -1 1 1 1 -1 -1 0； -1 -1 -1 -1 1 0 1 1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 1 1 1 1 0 -1 0 -1 1 1 0 0 1 -1 1 1 1 -1 1 1 -1 1 0 -1 1 0 -1 -1 1 -1 -1 -1 1 1 1 0 1 1 1 1 1 1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 0 1 1 -1 -1 -1 1 -1 1 0 1 -1； -1 -1 -1 0 -1 1 -1 -1 1 0 0 1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 1 -1 0 1 -1 0 -1 0 1 1 -1 1 1 -1 -1 0 -1 -1 -1 0 1 1 1 1 -1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 1 1 1 -1 1 1 0 -1 1 -1 1 1 1 1 -1 1 -1 0 -1 1 1 -1 -1； -1 -1 1 1 1 -1 1 0 -1 -1 -1 -1 1 1 1 -1 1 1 1 1 1 -1 1 -1 1 0 -1 1 1 1 1 0 1 0 0 1 1 1 -1 -1 1 1 -1 1 0 -1 -1 -1 0 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 1 1 1 0 1 -1 -1 -1 0 -1 1 1 -1 1 -1 0 1 -1 -1 1 1 -1 1 1 -1 -1 -1 1 1 1。 The method of claim 17, wherein The measurement sequence has a length of 127, and the measurement sequence is one of N4 sequences, where N4 is greater than or equal to 16. The method according to claim 17 or 24, characterized in that The measurement sequence is any one of the following: -1 -1 -1 1 0 1 0 0 -1 0 0 1 0 -1 0 1 1 -1 0 -1 0 -1 0 1 0 0 -1 1 -1 0 0 0 1 -1 0 0 -1 0 1 1 0 0 1 -1 0 0 0 1 0 1 1 -1 1 0 -1 -1 -1 0 0 -1 0 0 0 1 0 0 0 0 -1 -1 0 1 0 -1 1 0 1 0 0 0 1 1 -1 -1 0 0 0 0 0 -1 0 0 1 1 0 1 -1 0 0 0 0 1 0 -1 0 0 0 0 0 0 1 1 1 0 1 1 0 1 1 -1 1 1 0 0 1 -1 1； -1 -1 -1 1 1 0 0 0 0 1 1 1 0 1 -1 -1 1 0 0 1 0 -1 1 0 0 1 0 0 1 0 0 0 0 0 0 1 0 0 0 1 0 0 1 -1 0 0 0 -1 0 -1 1 -1 0 -1 0 1 1 0 -1 1 0 0 0 0 0 -1 -1 0 0 -1 -1 0 1 0 -1 0 0 1 -1 1 0 0 1 1 1 -1 0 1 -1 0 1 0 0 0 0 1 0 1 0 -1 0 -1 -1 -1 -1 1 0 1 0 0 -1 0 -1 0 0 0 1 1 0 1 -1 1 0 0 0 1 1； -1 -1 -1 1 1 1 0 1 1 0 1 0 1 0 0 0 0 0 0 1 1 0 -1 -1 1 1 1 0 0 0 0 0 1 0 -1 1 0 0 0 0 1 0 0 0 0 1 -1 -1 0 -1 0 0 0 -1 1 0 0 0 -1 0 0 -1 1 1 0 0 -1 0 1 0 0 -1 1 0 -1 0 0 -1 0 1 -1 1 -1 0 -1 0 -1 -1 1 0 1 1 1 0 0 0 1 -1 1 1 0 0 1 -1 0 0 1 0 0 -1 0 0 0 1 0 -1 0 1 0 -1 1 0 1 -1 0 0 -1； -1 -1 0 -1 -1 0 0 -1 0 -1 -1 0 0 0 1 -1 0 0 1 -1 0 -1 1 0 1 0 0 0 1 1 -1 -1 -1 0 0 0 0 1 1 -1 0 0 0 -1 0 1 0 0 -1 1 0 0 0 0 0 0 1 1 0 1 0 -1 1 -1 0 -1 0 0 -1 0 1 0 1 0 1 1 0 1 -1 -1 0 0 1 0 0 0 0 -1 0 0 0 1 0 0 1 0 0 -1 1 1 1 0 -1 0 1 0 0 0 0 0 1 0 1 1 -1 1 0 0 1 1 -1 0 1 -1 1 1 1。 The method of claim 17, wherein The measurement sequence has a length of 133, and the measurement sequence is one of N5 sequences, where N5 is greater than or equal to 16. The method according to claim 17 or 26, characterized in that The measurement sequence is any one of the following: -1 -1 -1 -1 -1 -1 1 -1 0 -1 -1 -1 1 -1 1 1 1 0 -1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 1 1 1 -1 1 1 1 0 -1 1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 0 -1 1 1 1 -1 0 1 0 1 1 -1 1 -1 1 1 1 1 -1 -1 1 1 -1 -1 0 1 -1 0 -1 1 1 -1 1 1 0 1 -1 1 0 0 1 1 1 -1 1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 1 1 -1 0 1 1 -1 1； -1 -1 -1 -1 1 -1 0 1 -1 1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 1 1 1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 0 0 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 0 -1 1 -1 -1 0 1 -1 0 -1 1 1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 1 -1 -1 1 1 0 -1 0 -1 1 1 1 1 -1 0 -1 -1 -1 0 -1 -1 1 1 1 0 -1 -1 1 -1 1 1 1 -1 1 1 -1 0 1 1 -1 1 1 1 1； -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 0 -1 1 1 -1 -1 -1 1 1 1 -1 1 -1 1 1 -1 -1 1 0 -1 1 1 0 1 -1 -1 1 0 -1 -1 -1 -1 1 0 -1 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 -1 0 -1 1 1 1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 1 1 1 1 -1 1 -1 1 1 1 1 -1 0 1 1 1 -1 1 -1 1 -1 1 -1 -1 0 -1 -1 -1 1 -1 -1 1 1 -1 1 1 1 -1 0 1 0 0 1 1 1 1 -1 -1 0； -1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 0 1 -1 1 1 -1 -1 0 -1 -1 -1 1 -1 0 1 -1 1 -1 1 1 1 -1 -1 0 1 -1 1 -1 0 -1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 1 1 -1 1 -1 1 0 0 1 0 1 1 1 -1 -1 1 -1 -1 0 -1 -1 -1 -1 1 -1 -1 0 1 -1 1 1 -1 1 -1 1 1 1 1 -1 -1 0 1 -1 1 0 1 1 1 1 1 -1 1 -1 1 1 -1 -1 1 1 1 1 1 1 -1 1 -1。 The method according to any one of claims 17-27, characterized in that The method further comprises: The method further comprises: The method comprises: A measuring method characterized by, The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises: The method comprises determining a channel impulse response (CIR) based on the first channel symbol and the second channel symbol. The method of claim 29, wherein The measurement sequence has a length of 31, and the measurement sequence is one of N1 sequences, where N1 is greater than 8. The method according to claim 29 or 30, characterized in that The measurement sequence is any one of the following: -1 -1 0 -1 1 0 0 -1 1 1 0 0 0 0 1 -1 0 1 0 1 0 0 1 0 0 0 1 0 1 1 -1； -1 -1 -1 1 1 0 1 0 0 0 1 0 0 1 0 1 0 -1 1 0 0 0 0 1 1 -1 0 0 1 -1 0； -1 0 0 -1 0 0 -1 1 1 1 1 0 1 -1 1 0 0 0 1 0 -1 0 1 1 0 -1 0 0 0 0 1； -1 -1 1 -1 0 1 1 -1 0 0 0 1 0 1 0 -1 1 0 1 0 0 0 0 1 1 0 0 1 0 0 -1。 The method of claim 29, wherein The measurement sequence has a length of 63, and the measurement sequence is one of N2 sequences, where N2 is greater than 10. The method according to claim 29 or 32, characterized in that The measurement sequence is any one of the following: 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 1 1 -1 1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 -1； 1 -1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 1 1 -1 1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1； 1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 1 1 -1 1 1 -1 -1 1 1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1； -1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 1 1 -1 1 -1 -1 1 1。 The method of claim 29, wherein The measurement sequence has a length of 91, and the measurement sequence is one of N3 sequences, where N3 is greater than 8. The method according to claim 29 or 34, characterized in that The measurement sequence is any one of the following: -1 -1 0 1 -1 1 -1 -1 -1 -1 0 -1 1 -1 1 -1 1 0 1 -1 -1 1 1 -1 1 -1 1 1 1 0 -1 0 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 1 1 1 1 -1 1 1 -1 1 0 0 1 -1 -1 1 0 -1 -1 1 0 1 1 1 1 1 -1 -1 1 1 1 -1 -1 0； -1 -1 -1 -1 1 0 1 1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 1 1 1 1 0 -1 0 -1 1 1 0 0 1 -1 1 1 1 -1 1 1 -1 1 0 -1 1 0 -1 -1 1 -1 -1 -1 1 1 1 0 1 1 1 1 1 1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 0 1 1 -1 -1 -1 1 -1 1 0 1 -1； -1 -1 -1 0 -1 1 -1 -1 1 0 0 1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 1 -1 0 1 -1 0 -1 0 1 1 -1 1 1 -1 -1 0 -1 -1 -1 0 1 1 1 1 -1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 1 1 1 -1 1 1 0 -1 1 -1 1 1 1 1 -1 1 -1 0 -1 1 1 -1 -1； -1 -1 1 1 1 -1 1 0 -1 -1 -1 -1 1 1 1 -1 1 1 1 1 1 -1 1 -1 1 0 -1 1 1 1 1 0 1 0 0 1 1 1 -1 -1 1 1 -1 1 0 -1 -1 -1 0 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 1 1 1 0 1 -1 -1 -1 0 -1 1 1 -1 1 -1 0 1 -1 -1 1 1 -1 1 1 -1 -1 -1 1 1 1。 The method of claim 29, wherein The measurement sequence has a length of 127, and the measurement sequence is one of N4 sequences, where N4 is greater than or equal to 16. The method according to claim 29 or 36, characterized in that The measurement sequence is any one of the following: -1 -1 -1 1 0 1 0 0 -1 0 0 1 0 -1 0 1 1 -1 0 -1 0 -1 0 1 0 0 -1 1 -1 0 0 0 1 -1 0 0 -1 0 1 1 0 0 1 -1 0 0 0 1 0 1 1 -1 1 0 -1 -1 -1 0 0 -1 0 0 0 1 0 0 0 0 -1 -1 0 1 0 -1 1 0 1 0 0 0 1 1 -1 -1 0 0 0 0 0 -1 0 0 1 1 0 1 -1 0 0 0 0 1 0 -1 0 0 0 0 0 0 1 1 1 0 1 1 0 1 1 -1 1 1 0 0 1 -1 1； -1 -1 -1 1 1 0 0 0 0 1 1 1 0 1 -1 -1 1 0 0 1 0 -1 1 0 0 1 0 0 1 0 0 0 0 0 0 1 0 0 0 1 0 0 1 -1 0 0 0 -1 0 -1 1 -1 0 -1 0 1 1 0 -1 1 0 0 0 0 0 -1 -1 0 0 -1 -1 0 1 0 -1 0 0 1 -1 1 0 0 1 1 1 -1 0 1 -1 0 1 0 0 0 0 1 0 1 0 -1 0 -1 -1 -1 -1 1 0 1 0 0 -1 0 -1 0 0 0 1 1 0 1 -1 1 0 0 0 1 1； -1 -1 -1 1 1 1 0 1 1 0 1 0 1 0 0 0 0 0 0 1 1 0 -1 -1 1 1 1 0 0 0 0 0 1 0 -1 1 0 0 0 0 1 0 0 0 0 1 -1 -1 0 -1 0 0 0 -1 1 0 0 0 -1 0 0 -1 1 1 0 0 -1 0 1 0 0 -1 1 0 -1 0 0 -1 0 1 -1 1 -1 0 -1 0 -1 -1 1 0 1 1 1 0 0 0 1 -1 1 1 0 0 1 -1 0 0 1 0 0 -1 0 0 0 1 0 -1 0 1 0 -1 1 0 1 -1 0 0 -1； -1 -1 0 -1 -1 0 0 -1 0 -1 -1 0 0 0 1 -1 0 0 1 -1 0 -1 1 0 1 0 0 0 1 1 -1 -1 -1 0 0 0 0 1 1 -1 0 0 0 -1 0 1 0 0 -1 1 0 0 0 0 0 0 1 1 0 1 0 -1 1 -1 0 -1 0 0 -1 0 1 0 1 0 1 1 0 1 -1 -1 0 0 1 0 0 0 0 -1 0 0 0 1 0 0 1 0 0 -1 1 1 1 0 -1 0 1 0 0 0 0 0 1 0 1 1 -1 1 0 0 1 1 -1 0 1 -1 1 1 1。 The method of claim 29, wherein The measurement sequence has a length of 133, and the measurement sequence is one of N5 sequences, where N5 is greater than or equal to 16. The method according to claim 29 or 38, characterized in that The measurement sequence is any one of the following: -1 -1 -1 -1 -1 -1 1 -1 0 -1 -1 -1 1 -1 1 1 1 0 -1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 1 1 1 -1 1 1 1 0 -1 1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 0 -1 1 1 1 -1 0 1 0 1 1 -1 1 -1 1 1 1 1 -1 -1 1 1 -1 -1 0 1 -1 0 -1 1 1 -1 1 1 0 1 -1 1 0 0 1 1 1 -1 1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 1 1 -1 0 1 1 -1 1； -1 -1 -1 -1 1 -1 0 1 -1 1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 1 1 1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 0 0 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 0 -1 1 -1 -1 0 1 -1 0 -1 1 1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 1 -1 -1 1 1 0 -1 0 -1 1 1 1 1 -1 0 -1 -1 -1 0 -1 -1 1 1 1 0 -1 -1 1 -1 1 1 1 -1 1 1 -1 0 1 1 -1 1 1 1 1； -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 0 -1 1 1 -1 -1 -1 1 1 1 -1 1 -1 1 1 -1 -1 1 0 -1 1 1 0 1 -1 -1 1 0 -1 -1 -1 -1 1 0 -1 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 -1 0 -1 1 1 1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 1 1 1 1 -1 1 -1 1 1 1 1 -1 0 1 1 1 -1 1 -1 1 -1 1 -1 -1 0 -1 -1 -1 1 -1 -1 1 1 -1 1 1 1 -1 0 1 0 0 1 1 1 1 -1 -1 0； -1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 0 1 -1 1 1 -1 -1 0 -1 -1 -1 1 -1 0 1 -1 1 -1 1 1 1 -1 -1 0 1 -1 1 -1 0 -1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 1 1 -1 1 -1 1 0 0 1 0 1 1 1 -1 -1 1 -1 -1 0 -1 -1 -1 -1 1 -1 -1 0 1 -1 1 1 -1 1 -1 1 1 1 1 -1 -1 0 1 -1 1 0 1 1 1 1 1 -1 1 -1 1 1 -1 -1 1 1 1 1 1 1 -1 1 -1。 The method according to any one of claims 29-39, characterized in that The method further comprises: sending indication information, the indication information being used to indicate a random number seed, the random number seed being used to determine an index of the measurement sequence; or, receiving indication information, the indication information being used to indicate a random number seed, the random number seed being used to determine an index of the measurement sequence. A communication device, characterized by comprising a module for performing the method of any one of claims 1-40. A communication device, characterized by comprising a processor for performing the method of any one of claims 1-40. A communication device, characterized by comprising a logic circuit and an interface, the logic circuit and the interface being coupled; the interface being used to input and / or output information, the logic circuit being used to perform the method of any one of claims 1-40. A computer-readable storage medium, characterized by The computer readable storage medium is used to store a computer program, the computer program being executed to perform the method of any one of claims 1-40. A computer program product, characterized in that The computer program product is executed to perform the method of any one of claims 1-40. A communication system characterized by comprising a first node and a second node, the first node being used to perform the method of any one of claims 1-8, and the second node being used to perform the method of any one of claims 9-16; or, the first node being used to perform the method of any one of claims 17-28, and the second node being used to perform the method of any one of claims 29-40.

Images