Method and apparatus for a transmission sequence

Abstract

The present application provides a method and apparatus for transmitting a sequence. In this method, a first device may map P sub-sequences constituting a first sequence onto L symbols, with adjacent sub-sequences mapped onto different symbols, and at least two sub-sequences mapped onto the same symbol. The sub-carrier spacing between any two adjacent sequence elements constituting a sub-sequence is a first frequency-domain spacing, and in two adjacent sub-sequences, the sub-carrier spacing between the last sequence element of one sub-sequence and the first sequence element of the next sub-sequence is also the first frequency-domain spacing. The sub-carrier spacing between any two adjacent sequence elements constituting the first sequence is the first frequency-domain spacing. In this way, when a second device receives the first sequence, the correlation of the first sequence will not be destroyed, which is beneficial to improving the accuracy of the detection result of the first sequence.

Description

Technical Field

[0001] This application relates to the field of communications, and more particularly, to methods and apparatuses for transmitting sequences in the field of communications. Background Art

[0002] In a wireless communication system, reference signals are generally used to implement functions such as ranging and positioning. A first device generates a reference signal using a sequence with good correlation and sends it to a second device. After the second device obtains the received signal of the reference signal, it performs a correlation operation on the received signal using a locally generated sequence, and determines the transmission delay of the reference signal by searching for correlation peaks, thereby implementing functions such as ranging or positioning of the first device.

[0003] When there is interference from other sequences in the received signal of the reference signal received by the second device, some strong interference peaks may be generated during the above-mentioned correlation operation, affecting the detection result, and thus affecting the accuracy of ranging or positioning of the first device. Generally, the longer the sequence, the less interference during the correlation operation. Therefore, the first device can use a longer sequence to improve the anti-interference ability. In wireless communication systems such as Long Term Evolution (LTE) or New Radio (NR), the first device can split and map multiple sequence elements of a longer sequence onto multiple Orthogonal Frequency Division Multiplexing (OFDM) symbols for transmission. However, if the sequence elements are randomly mapped onto multiple OFDM symbols for transmission, the good correlation of the sequence may be destroyed, resulting in inaccurate detection results and affecting the accuracy of ranging or positioning of the second device for the first device. Summary of the Invention

[0004] Embodiments of this application provide a method and apparatus for transmitting a sequence, which can prevent the correlation of the sequence from being destroyed and improve the accuracy of the detection result. For example, it can improve the accuracy of ranging or positioning of the second device for the first device.

[0005] In a first aspect, a method for transmitting a sequence is provided, characterized in that the method includes:

[0006] Generating a first sequence X(k) of length N, where k = 0, 1,..., N - 1 and N is an integer greater than 1;

[0007] Transmit the first sequence over L symbols, where the first sequence includes P subsequences, each of the P subsequences includes one or more consecutive sequence elements, the sequence elements of the same subsequence among the P subsequences are mapped to the same symbol, and the i-th subsequence and the (i + 1)-th subsequence among the P subsequences are mapped to the l i -th symbol and the l i+1 -th symbol among the L symbols respectively, where l i is different from l i+1 , at least two of the P subsequences are mapped to the same symbol, and any two adjacent sequence elements of the i-th subsequence are mapped to the subcarriers included in the l i -th symbol at equal intervals according to a first frequency-domain interval. The interval between the subcarrier to which the last sequence element of the i-th subsequence is mapped and the subcarrier to which the first sequence element of the (i + 1)-th subsequence is mapped is the first frequency-domain interval. P is an integer greater than or equal to 3, i = 0, 1,..., P - 1, and the sum of the lengths of the P subsequences is N; where N is an integer greater than 1, L is a positive integer greater than 1, P is an integer greater than or equal to 3, and i = 0, 1,..., P - 1.

[0008] In the above solution, the method can be executed by a first device. The first device can map the P subsequences that make up the first sequence to L symbols, with adjacent subsequences mapped to different symbols, and at least two subsequences mapped to the same symbol. The subcarrier interval between any two adjacent sequence elements that make up a subsequence is the first frequency-domain interval, and between two adjacent subsequences, the subcarrier interval between the last sequence element of one subsequence and the first sequence element of the next subsequence is also the first frequency-domain interval. The subcarrier interval between any two adjacent sequence elements that make up the first sequence is the first frequency-domain interval. In this way, when a second device receives the first sequence, the correlation of the first sequence will not be destroyed, which is beneficial to improving the accuracy of the detection result of the first sequence. For example, when the second device needs to locate the first device, it can determine the transmission duration of the first sequence based on the received signal, and thus can determine the distance of the first device and also locate the first device.

[0009] Optionally, the method may be replaced by: generating a first sequence X(k) of length N, where k = 0, 1, …, N−1. Transmitting the first sequence on L symbols, the first sequence including N sequence elements, that is, mapping the first sequence on L symbols, and there is at least one symbol among the L symbols on which two or more sequence elements are mapped. The two or more sequence elements mapped on the existing symbol may be adjacent sequence elements or non-adjacent sequence elements. The subcarrier spacing of any two adjacent sequence elements constituting the first sequence is the same, and is the first frequency-domain spacing. N is a positive integer greater than 1, and L is a positive integer greater than 1.

[0010] In the above solution, the multiple sequence elements constituting the first sequence can be mapped on L symbols, and the subcarrier spacing of any two adjacent sequence elements is the first frequency-domain spacing. In this way, the correlation of the first sequence will not be destroyed, which is beneficial to improving the accuracy of the detection result of the first sequence. For example, when the second device needs to locate the first device, it can determine the transmission duration of the first sequence by using the received signal, so as to determine the distance of the first device and also locate the first device.

[0011] Optionally, the first sequence is a long sequence, for example, N is greater than a preset value.

[0012] Optionally, the first sequence is the sequence corresponding to the reference signal.

[0013] Optionally, the first sequence is the sequence corresponding to the cellular reference signal. For example, the first sequence may be the sequence corresponding to DMRS, or may be the sequence corresponding to PRS, or may also be the sequence corresponding to SRS.

[0014] Optionally, the first sequence is the sequence corresponding to the sidelink reference signal. For example, the first sequence is the sequence corresponding to SL DMRS, or the sequence corresponding to SL PRS, or may also be the sequence corresponding to SL SRS.

[0015] Optionally, the first device may generate the first sequence according to a preset manner.

[0016] Optionally, N is greater than L.

[0017] Optionally, the L symbols may be L OFDM symbols.

[0018] Optionally, the L symbols represent the symbols on which sequence elements are mapped. If there are no sequence elements mapped on a certain symbol, then this symbol is not included in the L symbols.

[0019] In some possible implementation manners, the lengths of each of the first P−1 subsequences among the P subsequences are equal, and are all h 1, the length of the last subsequence in the P subsequences is h 2 ,h 1 With h 2 Same or different, (P-1)·h 1 +h 2 =N,h 1 and h 2 is a positive integer greater than or equal to 1.

[0020] In the above solution, the sequence elements included in the subsequence mapped on each symbol are made equal as much as possible, that is, the sequence elements are mapped as evenly as possible, which can simplify the design and facilitate configuration.

[0021] In some possible implementations, P=N, and each subsequence in the P subsequences consists of one sequence element.

[0022] In some possible implementations, the symbol position of the X(k) mapping is l start +pattern L (k)

[0023] Among them, l start is the starting position of the time domain symbol, pattern L (k) is the sign of the sequence element X(k) mapped relative to l start The symbol offset of pattern L The value of (k) is 0, δ, 2δ, …, (L-1)·δ, where δ is the symbol interval between two adjacent symbols mapped with different sequence elements, and δ is a positive integer greater than or equal to 1.

[0024] In the above scheme, the time domain symbol position of each sequence element can be determined according to the pattern of each sequence element. L (k) Determine that the protocol may specify a pattern L The value of (k) is 0, δ, 2δ, …, (L-1)·δ. In this way, the N sequence elements constituting the first sequence can be sorted according to the pattern. L (k) Mapping in the time domain.

[0025] Optionally, the protocol may specify start .

[0026] Optionally, the protocol can specify a pattern L (k) and / or δ.

[0027] In some possible implementations, when k = 0, 1, 2, ..., L-1, pattern L(k) is the k-th element in the first permutation composed of 0, δ, 2δ, …, (L - 1)·δ; when k = L, L + 1, …, N - 1, the value of pattern L (k) is pattern L (k mod L).

[0028] In the above solution, when the value of k is less than L, each of the L sequence elements mapped on L symbols corresponds to a symbol offset. When the value of k is greater than or equal to L and less than N, the symbol offset corresponding to each sequence element can be obtained by taking the modulo operation based on the symbol offset when the value of k is less than L. Thus, if the second device configures pattern L (k) for the first device, it only needs to configure pattern L (k) when the value of k is less than L, without configuring pattern L (k) when k is greater than or equal to L, thereby saving signaling overhead. Or the protocol only needs to specify pattern L (k) when the value of k is less than L, without specifying pattern L (k) when k is greater than or equal to L, thereby simplifying the design.

[0029] Optionally, the first permutation can be a permutation composed of 0, δ, 2δ, …, (L - 1)·δ in a specific order.

[0030] In some possible implementation manners, when k = 0, 1, 2, …, L - 1, pattern L (k) = δ·k. That is, the first permutation is 0, δ, 2δ, …, (L - 1)·δ.

[0031] In some possible implementation manners, it is characterized in that when k = 0, 1, 2, …, L - 1, pattern L (k) = pattern L ((k + q) mod L)';

[0032] wherein, the value of q is a value among 0, 1, …, L - 1, and pattern L (k)' is the symbol offset of the symbol mapped by the sequence element X(k) relative to l start predefined symbol offset, and the value of pattern L (k)' is the k-th element in the second permutation composed of 0, δ, 2δ, …, (L - 1)·δ.

[0033] In the above solution, pattern L (k) can be based on pattern L(k) is generated by shift modulo, so that the pattern L the value of (k) is still an element in the second permutation composed of 0, δ, 2δ, …, (L - 1)·δ. That is to say, if predefined, the first device can generate a new pattern L (k) according to the predefined pattern L (k), thereby improving flexibility.

[0034] Optionally, the second permutation may be a permutation composed of 0, δ, 2δ, …, (L - 1)·δ in a specific order. The second permutation may be the same as or different from the first permutation.

[0035] In some possible implementation manners, the symbol position of the i-th subsequence is l′ start + pattern L (i),

[0036] where l′ start is the starting position of the time-domain symbol, and pattern L (i) is the symbol offset of the symbol mapped by the i-th subsequence relative to l′ start , and the value of pattern L (i) is a value in 0, δ', 2δ', …, (L - 1)·δ', where δ' is the symbol interval between two adjacent symbols mapped with different sequence elements, and δ' is a positive integer greater than or equal to 1.

[0037] In the above solution, the time-domain symbol position of each subsequence can be determined according to the pattern L (i) of each subsequence. The protocol can specify which specific value in 0, δ', 2δ', …, (L - 1)·δ' the value of pattern L (i) takes. In this way, the P subsequences constituting the first sequence can be mapped in the time domain according to pattern L (i).

[0038] Optionally, the protocol can specify l′ start .

[0039] Optionally, the protocol can specify pattern L (i) and / or δ'.

[0040] In some possible implementation manners, when i = 0, 1, 2, …, L - 1, the value of pattern L (i) is the i-th element in the third permutation composed of 0, δ', 2δ', …, (L - 1)·δ'; when i = L, L + 1, …, P - 1, pattern LThe value of (i) is pattern L (i mod L).

[0041] In the above solution, that is to say, when the value of i is less than L, each subsequence mapped on L symbols corresponds to a symbol offset. When the value of i is greater than or equal to L and less than P - 1, the symbol offset corresponding to each subsequence can be obtained by taking the modulo operation according to the symbol offset when the value of i is less than L. In this way, if the second device configures pattern L (i) for the first device, it only needs to configure pattern L (i) when the value of i is less than L, without configuring pattern L (i) when i is greater than or equal to L, thereby saving signaling overhead. Or the protocol only needs to specify pattern L (i) when the value of i is less than L, without specifying pattern L (i) when i is greater than or equal to L, thereby simplifying the design.

[0042] Optionally, the third permutation may be a permutation composed of 0, δ', 2δ', …, (L - 1)·δ' in a specific order.

[0043] In some possible implementation manners, when i = 0, 1, 2, …, L - 1, pattern L (i) = i·δ'. That is to say, the third permutation is 0, δ', 2δ', …, (L - 1)·δ'.

[0044] In some possible implementation manners, when i = 0, 1, 2, …, L - 1, pattern L (i) = pattern L ((i + q') mod L)';

[0045] wherein, the value of q' is a value among 0, 1, …, L - 1, and pattern L (i) is the symbol offset of the i-th subsequence relative to l′ start predefined, and pattern L (i)' takes the i-th element in the fourth permutation composed of 0, δ', 2δ', …, (L - 1)·δ'.

[0046] In the above solution, pattern L (i) can be generated by shifting and taking the modulo according to pattern L (i)', so that pattern L(i) still takes values from the elements of the second permutation consisting of 0, δ, 2δ, …, (L - 1)·δ. That is to say, if predefined, the first device can generate a new pattern L according to the predefined pattern L (i), thereby improving flexibility.

[0047] Optionally, the fourth permutation can be a permutation composed of 0, δ', 2δ', …, (L - 1)·δ' in a specific order. The fourth permutation can be the same as or different from the third permutation.

[0048] In some possible implementation manners, the method further includes: sending configuration information, where the configuration information is used to indicate at least one of a first frequency-domain interval, l start , l′ start , L, pattern L (k), pattern L (i), q, q', δ, δ', h 1 or N.

[0049] Optionally, when the configuration information configures at least two of a first frequency-domain interval, l start , l′ start , L, pattern L (k), pattern L (i), q, q′, δ, δ', h 1 or N, it can be configured by different configuration information or the same configuration information, which is not limited in the embodiments of the present application.

[0050] Optionally, the first device can be a network device, and the second device can be a terminal device. The network device can send the configuration information to the terminal device. When the first device is a network device and the second device is a terminal device, if the reference signal corresponding to the first sequence is PRS, the network device can send the configuration information to the terminal device through a positioning server.

[0051] Optionally, the first device can be a terminal device, and the second device can be a network device. The method further includes: receiving configuration information, where the configuration information is used to indicate at least one of a first frequency-domain interval, l start , l′ start , L, pattern L (k), pattern L (i), q, q′, δ, δ', h 1 or N.

[0052] In a second aspect, a method for transmitting a sequence is provided, characterized in that the method includes:

[0053] Obtain the received signal of the reference signal on L symbols, where the reference signal is generated according to a first sequence, the length of the first sequence is N, the first sequence includes P subsequences, and each of the P subsequences includes one or more consecutive sequence elements. The sequence elements in the same subsequence among the P subsequences are mapped to the same symbol, and the i-th subsequence and the (i + 1)-th subsequence among the P subsequences are respectively mapped to the l i -th symbol and the l i+1 -th symbol among the L symbols, where l i is different from l i+1 . At least two of the P subsequences are mapped to the same symbol. Any adjacent sequence elements of the i-th subsequence are mapped to the subcarriers included in the l i -th symbol at equal intervals according to a first frequency-domain interval. The interval between the subcarrier to which the last sequence element of the i-th subsequence is mapped and the subcarrier to which the first sequence element of the (i + 1)-th subsequence is mapped is the first frequency-domain interval. P is an integer greater than or equal to 3, i = 0, 1,..., P - 1, and the sum of the lengths of the P subsequences is N;

[0054] Process the received signal according to the first sequence;

[0055] Wherein, N is an integer greater than 1, L is a positive integer greater than 1, P is an integer greater than or equal to 3, and i = 0, 1,..., P - 1.

[0056] In the above solution, the method can be executed by a second device, and the second device can process the received signal of the reference signal mapped by the first sequence. The P subsequences that make up the first sequence are mapped to L symbols, and adjacent subsequences are mapped to different symbols. At least two subsequences are mapped to the same symbol. The subcarrier interval between any two adjacent sequence elements that make up a subsequence is the first frequency-domain interval. Among two adjacent subsequences, the subcarrier interval between the last sequence element of one subsequence and the first sequence element of the next subsequence is also the first frequency-domain interval. The subcarrier interval between any two adjacent sequence elements that make up the first sequence is the first frequency-domain interval. In this way, when the second device receives the first sequence, the correlation of the first sequence will not be destroyed, which is beneficial to improving the accuracy of the detection result of the first sequence. For example, when the second device needs to locate the first device, it can use the received signal to determine the transmission duration of the first sequence, thereby determining the distance of the first device and also being able to locate the first device.

[0057] In some possible implementation manners, the lengths of each of the first P - 1 subsequences among the P subsequences are equal, and each is h1 The length of the last subsequence among the P subsequences is h 2 , h 1 is the same as or different from h, and (P - 1)·h 2 +h 1 = N, and h 2 and h 1 are positive integers greater than or equal to 1. 2 In some possible implementation manners, P = N, and each of the P subsequences consists of one sequence element.

[0058] In some possible implementation manners, the symbol position mapped by X(k) is l

[0059] + pattern start (k), L where l

[0060] is the starting position of the time-domain symbol, and pattern start (k) is the symbol offset of the symbol mapped by the sequence element X(k) relative to l L , and the value of pattern start (k) is a value in 0, δ, 2δ, …, (L - 1)·δ, and δ is a positive integer greater than or equal to 1. L In some possible implementation manners, when k = 0, 1, 2, …, L - 1, the value of pattern

[0061] (k) is the k-th element in the first permutation composed of 0, δ, 2δ, …, (L - 1)·δ; when k = L, L + 1, …, N - 1, the value of pattern L (k) is the value of pattern L (k mod L). L In some possible implementation manners, when k = 0, 1, 2, …, L - 1, pattern

[0062] (k) = δ·k. L In some possible implementation manners, when k = 0, 1, 2, …, L - 1, pattern

[0063] (k) = pattern L ((k + q) mod L)'; L where the value of q is a value in 0, 1, …, L - 1, and pattern

[0064] (k)' is the symbol offset of the symbol mapped by the sequence element X(k) relative to l L predefined, and pattern start L ​(k) takes the k-th element in the second permutation composed of 0, δ, 2δ, …, (L - 1)·δ.

[0065] In some possible implementation manners, the symbol position of the i-th subsequence is l′ start +pattern L (i),

[0066] where l′ start is the starting position of the time-domain symbol, and pattern L (i) is the symbol offset of the symbol mapped by the i-th subsequence relative to l′ start , and the value of pattern L (i) is a value in 0, δ', 2δ', …, (L - 1)·δ', where δ' is a positive integer greater than or equal to 1.

[0067] In some possible implementation manners, when i = 0, 1, 2, …, L - 1, the value of pattern L (i) is the i-th element in the third permutation composed of 0, δ', 2δ', …, (L - 1)·δ'; when i = L, L + 1, …, P - 1, the value of pattern L (i) is the value of pattern L (imodL).

[0068] In some possible implementation manners, when i = 0, 1, 2, …, L - 1, pattern L (i) = i·δ'.

[0069] In some possible implementation manners, when i = 0, 1, 2, …, L - 1, pattern L (i) = pattern L ((i + q')modL)';

[0070] where the value of q' is a value in 0, 1, …, L - 1, and pattern L (i) is the symbol offset of the symbol of the i-th subsequence relative to l′ start which is a predefined symbol offset, and the value of pattern L (i)' is the i-th element in the fourth permutation composed of 0, δ', 2δ', …, (L - 1)·δ'.

[0071] In some possible implementation manners, the method further includes:

[0072] receiving configuration information, where the configuration information is used to indicate the first frequency-domain interval, l start , l′ start , L, patternL (k), pattern L (i), q, q′, δ, δ', h 1 or at least one of N.

[0073] Optionally, the first device may be a network device, and the second device may be a terminal device. The network device may send configuration information to the terminal device, and the terminal device may receive the configuration information. When the first device is a network device and the second device is a terminal device, if the reference signal corresponding to the first sequence is PRS, the terminal device may receive the configuration information sent by the network device through a positioning server.

[0074] Optionally, the first device may be a terminal device, and the second device may be a network device. The method further includes: sending configuration information, where the configuration information is used to indicate a first frequency domain interval, l start , l′ start , L, pattern L (k), pattern L (i), q, q′, δ, δ', h 1 or at least one of N.

[0075] Specifically, for the description of the second aspect, reference may be made to the description of the first aspect. To avoid repetition, it will not be described in detail.

[0076] In a third aspect, a communication device is provided. The communication device is used to execute the method in any possible implementation manner of the first aspect above. Specifically, the communication device may include a processing unit and a transceiver unit. The transceiver unit may communicate with the outside, and the processing unit is used for data processing. The transceiver unit may also be referred to as a communication interface or a communication unit.

[0077] The communication device may be used to execute the actions performed by the first device in any possible implementation manner of the first aspect. At this time, the communication device may be referred to as the first device. The transceiver unit is used to execute the operations related to transceiver on the first device side in any possible implementation manner of the first aspect, and the processing unit is used to execute the operations related to processing on the first device side in any possible implementation manner of the first aspect.

[0078] In a fourth aspect, a communication device is provided. The communication device is used to execute the method in any possible implementation manner of the second aspect above. Specifically, the communication device may include a processing unit and a transceiver unit. The transceiver unit may communicate with the outside, and the processing unit is used for data processing. The transceiver unit may also be referred to as a communication interface or a communication unit.

[0079] The communication device can be used to perform the actions executed by the second device in any possible implementation of the second aspect. In this case, the communication device can be referred to as the second device. The transceiver unit is used to perform the transceiver-related operations on the second device side in any possible implementation of the second aspect, and the processing unit is used to perform the processing-related operations on the second device side in any possible implementation of the second aspect.

[0080] In a fifth aspect, a communication device is provided. The communication device includes a processor and a memory. The processor is coupled to the memory. The memory is used to store computer programs or instructions, and the processor is used to execute the computer programs or instructions stored in the memory, so that the method in the first aspect or any possible implementation of the first aspect is executed.

[0081] For example, the processor is used to execute the computer programs or instructions stored in the memory, so that the communication device executes the method in the first aspect or any possible implementation of the first aspect.

[0082] Optionally, the communication device includes one or more processors.

[0083] Optionally, the communication device may further include a memory coupled to the processor.

[0084] Optionally, the memory included in the communication device can be one or more.

[0085] Optionally, the memory can be integrated with the processor or separately provided.

[0086] Optionally, the communication device may further include a transceiver.

[0087] In a sixth aspect, a communication device is provided. The communication device includes a processor and a memory. The processor is coupled to the memory. The memory is used to store computer programs or instructions, and the processor is used to execute the computer programs or instructions stored in the memory, so that the method in the second aspect or any possible implementation of the second aspect is executed.

[0088] For example, the processor is used to execute the computer programs or instructions stored in the memory, so that the communication device executes the method in the second aspect or any possible implementation of the second aspect.

[0089] Optionally, the communication device includes one or more processors.

[0090] Optionally, the communication device may further include a memory coupled to the processor.

[0091] Optionally, the memory included in the communication device can be one or more.

[0092] Optionally, the memory may be integrated with the processor or separately provided.

[0093] Optionally, the communication device may further include a transceiver.

[0094] In a seventh aspect, a communication system is provided. The communication system includes the communication device in the third aspect or any possible implementation manner of the third aspect and the communication device in the fourth aspect or any possible implementation manner of the fourth aspect; or, the communication system includes the communication device in the fifth aspect or any possible implementation manner of the fifth aspect and at least two communication devices in the sixth aspect or any possible implementation manner of the sixth aspect.

[0095] In an eighth aspect, a computer-readable storage medium is provided, on which a computer program (also referred to as an instruction or code) for implementing the method in the first aspect or any possible implementation manner of the first aspect is stored.

[0096] For example, when the computer program is executed by a computer, the computer can execute the method in the first aspect or any possible implementation manner of the first aspect. The computer may be a communication device.

[0097] In a ninth aspect, a computer-readable storage medium is provided, on which a computer program (also referred to as an instruction or code) for implementing the method in the second aspect or any possible implementation manner of the second aspect is stored.

[0098] For example, when the computer program is executed by a computer, the computer can execute the method in the second aspect or any possible implementation manner of the second aspect. The computer may be a communication device.

[0099] In a tenth aspect, the present application provides a chip including a processor. The processor is configured to read and execute a computer program stored in a memory to execute the method in the first aspect and any possible implementation manner thereof.

[0100] Optionally, the chip further includes a memory, and the memory is connected to the processor through a circuit or a wire.

[0101] Further optionally, the chip further includes a communication interface.

[0102] In an eleventh aspect, the present application provides a chip including a processor. The processor is configured to read and execute a computer program stored in a memory to execute the method in the second aspect and any possible implementation manner thereof.

[0103] Optionally, the chip further includes a memory, and the memory is connected to the processor through a circuit or a wire.

[0104] Further optionally, the chip further includes a communication interface.

[0105] In a twelfth aspect, the present application provides a computer program product, the computer program product includes a computer program (which may also be referred to as instructions or code), and when the computer program is executed by a computer, it causes the computer to implement the method in the first aspect or any possible implementation manner of the first aspect.

[0106] In a thirteenth aspect, the present application provides a computer program product, the computer program product includes a computer program (which may also be referred to as instructions or code), and when the computer program is executed by a computer, it causes the computer to implement the method in the second aspect or any possible implementation manner of the second aspect. Description of the Drawings

[0107] Figure 1 is a schematic diagram of a communication system provided by an embodiment of the present application.

[0108] Figure 2 is a schematic diagram of a method for transmitting a sequence provided by an embodiment of the present application.

[0109] Figure 3 is a schematic diagram of sequence mapping provided by an embodiment of the present application.

[0110] Figure 4 is a schematic diagram of another sequence mapping provided by an embodiment of the present application.

[0111] Figure 5 is a schematic diagram of yet another sequence mapping provided by an embodiment of the present application.

[0112] Figure 6 is a schematic diagram of yet another sequence mapping provided by an embodiment of the present application.

[0113] Figure 7 is a schematic diagram of yet another sequence mapping provided by an embodiment of the present application.

[0114] Figure 8 is a schematic block diagram of a device for transmitting a sequence provided by an embodiment of the present application.

[0115] Figure 9 is a schematic block diagram of another device for transmitting a sequence provided by an embodiment of the present application. Detailed Embodiments

[0116] Next, the technical solutions in the embodiments of the present application will be described with reference to the accompanying drawings in the embodiments of the present application.

[0117] The technical solutions of the embodiments of this application can be applied to various communication systems, such as: Global System for Mobile Communications (GSM) system, Code Division Multiple Access (CDMA) system, Wideband Code Division Multiple Access (WCDMA) system, General Packet Radio Service (GPRS), Long Term Evolution (LTE) system, LTE Frequency Division Duplex (FDD) system, LTE Time Division Duplex (TDD), Universal Mobile Telecommunication System (UMTS), Worldwide Interoperability for Microwave Access (WiMAX) communication system, future 5th generation (5G) system or New Radio (NR), etc.

[0118] It should be understood that the division of the manners, situations, categories, and embodiments in the embodiments of this application is only for convenience of description and should not constitute a special limitation. The features in various manners, categories, situations, and embodiments can be combined without conflict.

[0119] It should also be understood that the "first", "second", and "third" in the embodiments of this application are only for distinction and should not constitute any limitation to this application. It should also be understood that in various embodiments of this application, the magnitude of the sequence numbers of each process does not mean the order of execution. The execution order of each process should be determined by its function and internal logic and should not constitute any limitation to the implementation process of the embodiments of this application.

[0120] Figure 1 is a schematic diagram of an inter-device communication system. The wireless communication device may include one or more network devices, such as Figure 1 the network device 110 in Figure 1In this case, the network device 110 communicates with the terminal device 121. The link through which the terminal device 121 sends data to the network device 110 is called the uplink, while the link through which the terminal device 121 receives data sent by the network device 110 is called the downlink. As Figure 1 shown, the communication system may further include multiple terminal devices, such as Figure 1 the terminal device 121 and the terminal device 122 in

[0121] The new radio (NR) access technology is the current mainstream wireless communication technology. Aiming at the V2X service characteristics and new service requirements, it can support lower latency and higher reliability V2X communication. V2X is the foundation and key technology for realizing intelligent vehicles, autonomous driving, and intelligent transportation systems. V2X can include vehicle to network (V2N), vehicle to vehicle (V2V), vehicle to infrastructure (V2I), vehicle to pedestrian (V2P), etc. V2N communication is the most widely used form of vehicle networking currently. Its main function is to enable vehicles to connect to a cloud server through a mobile network and use application functions such as navigation, entertainment, and anti-theft provided by the cloud server. V2V communication can be used for information interaction and reminder between vehicles. The most typical application is for the anti-collision safety system between vehicles. Through V2I communication, vehicles can communicate with roads and even other infrastructure, such as traffic lights, roadblocks, etc., to obtain road management information such as traffic light signal timings. V2P communication can be used for safety warnings for pedestrians or non-motor vehicles on the road.

[0122] The terminal device 121 or the terminal device 122 can be in a fixed position or movable. Figure 1 This is just a schematic diagram. The communication system may further include other network devices, such as wireless relay devices and wireless backhaul devices. In Figure 1It is not drawn in the figure. The embodiments of the present application do not limit the types and quantities of network devices and terminal devices included in the communication system.

[0123] In the communication system, terminal device 121 or terminal device 122 accesses the network device in the communication system wirelessly. The network device 110 may be: a base station, an evolved node B (eNB), a home base station, an access point (AP) in a wireless fidelity (WIFI) system, a wireless relay node, a wireless backhaul node, a transmission point (TP), or a transmission and reception point (TRP), etc. It may also be a gNB in the NR system, or it may also be a component or part of a device that constitutes a base station, such as a central unit (CU), a distributed unit (DU), or a baseband unit (BBU), etc.

[0124] Terminal device 121 or terminal device 122 in the communication system may also be referred to as a terminal, a user equipment (UE), a mobile station (MS), a mobile terminal (MT), etc. The terminal device in the embodiments of the present application may be a mobile phone, a tablet computer (Pad), a computer with wireless transceiver function, and may also be a wireless terminal applied to scenarios such as virtual reality (VR), augmented reality (AR), industrial control, self-driving, remote medical, smart grid, transportation safety, smart city, and smart home. In the present application, the foregoing terminal device and the chip applicable to the foregoing terminal device are collectively referred to as the terminal device. It should be understood that the embodiments of the present application do not limit the specific technologies and specific device forms adopted by the terminal device.

[0125] It should be understood that Figure 1For ease of understanding only, the terminal devices 121 and 122 and the network device 110 are schematically shown, but this should not impose any limitation on the present application. There may be a greater number of network devices in this communication system, and there may also include a greater or smaller number of terminal devices, which is not limited in the present application.

[0126] In Figure 1 In the communication system, before the terminal device 121 sends data to the network device 110, the terminal device 121 may send a reference signal to the network device 110, and the network device 110 may receive the received signal of the reference signal. The network device 110 may estimate the channel between the terminal device 121 and the network device 110 through the received signal. At the same time, the network device 110 may also locate or range the terminal device 121. Similarly, before the network device 110 sends data to the terminal device 121, the network device 110 may send a reference signal to the terminal device 121, and the terminal device 121 may receive the received signal of the reference signal. The terminal device 121 may estimate the channel between the network device 110 and the terminal device 121 through the received signal. At the same time, the terminal device 121 may also locate or range the network device 110. Before the terminal device 122 sends data to the terminal device 121, the terminal device 122 may send a reference signal to the terminal device 121, and the terminal device 121 may receive the received signal of the reference signal. The terminal device 121 may estimate the channel between the terminal device 121 and the terminal device 122 through the received signal. At the same time, the terminal device 121 may also locate or range the terminal device 122, etc.

[0127] Hereinafter, for the convenience of description, the device that sends the reference signal is referred to as the first device, and the device that receives the received signal of the reference signal is referred to as the second device. In one embodiment, the terminal device 121 sends a reference signal to the network device 110, the first device is the terminal device 121, and the second device is the network device 110. In another embodiment, the network device 110 sends a reference signal to the terminal device 121, the first device is the network device 110, and the second device is the terminal device 121. In still another embodiment, the terminal device 122 sends a reference signal to the terminal device 121, the first device is the terminal device 122, and the second device is the terminal device 121.

[0128] After the second device receives the received signal of the reference signal, it may perform a correlation operation on the received signal by using the sequence of the reference signal locally generated by the second device. And determine the transmission delay of the reference signal by searching for the correlation peak, so as to realize functions such as ranging or positioning of the first device by using the transmission delay.

[0129] When there is interference from other sequences in the received signal of the reference signal at the second device, some strong interference peaks may be generated during the above-mentioned correlation operations, affecting the detection result, and thus affecting the accuracy of the ranging or positioning of the second device to the first device. The longer the length of the sequence for generating the reference signal by the first device, the better the anti-interference ability of the sequence. Therefore, the interference during the correlation operation by the second device is smaller. Therefore, the first device can use a longer sequence to improve the anti-interference ability. In wireless communication systems such as long term evolution (LTE) or new radio (NR), the first device can split and map multiple sequence elements of the longer sequence onto multiple orthogonal frequency division multiplexing (OFDM) symbols for transmission. However, if the multiple sequence elements of the generated sequence are randomly mapped onto multiple OFDM symbols for transmission, the good correlation of the sequence may be destroyed, resulting in inaccurate detection results and also affecting the accuracy of the ranging or positioning of the second device to the first device.

[0130] For example, taking the Zadoff-Chu (ZC) sequence as the sequence for generating the reference signal, the ZC sequence can be generated according to the following formula (1), X μ (k).

[0131]

[0132] where N is the length of the ZC sequence and μ is the root index. With the sequence length N fixed, different ZC sequences can be generated by using different root indices μ. The ZC sequence has good autocorrelation. After the first device transmits the ZC sequence X μ (k), the sequence that reaches the second device after the transmission time τ is X μ (k + τ). The second device can use the known sequence X μ (k) to perform a correlation operation on the received sequence X μ (k + τ) through formula (2), and a unique peak N can be found at the position n = τ. That is to say, n at which the correlation is the largest corresponds to the transmission duration τ.

[0133]

[0134] That is to say, the transmission duration τ of the sequence X μ (k) can be determined through the correlation operation of formula (2). Multiplying the speed of light by the transmission duration τ can determine the distance between the first device and the second device. The second device can locate the first device based on the distances between multiple pairs of transceiver devices, or the second device can measure the angle with the first device to achieve the positioning of the first device.

[0135] For sequences with good correlation performance, the longer the length of the sequence, the better the anti-interference performance. Taking the ZC sequence as an example, assume that while the first device is transmitting the sequence X μ (k), the third device is transmitting the sequence X ν (k), X ν (k) is a sequence with a root index of ν, and the lengths of both the sequence X μ (k) and the sequence X ν (k) are N. Then, the sequences X μ (k) and X ν (k) can perform correlation operations through formula (3).

[0136]

[0137] It can be known from formula (3) that the cross-correlation interference μ between the sequence X ν (k) and the sequence X relative to the peak value N of the autocorrelation is That is to say, when the sequence is longer, that is, N is larger, this ratio is smaller, which means the anti-interference ability is better. Therefore, in order to improve the anti-interference ability, it is necessary for the first device to map a long sequence on multiple OFDM symbols. If a long sequence is randomly mapped on multiple OFDM symbols, the correlation of the sequence may be destroyed. Therefore, how to map a long sequence on multiple OFDM symbols so that the anti-interference performance can be improved while also ranging or positioning the first device that transmits the sequence X μ (k) is an urgent problem to be solved.

[0138] Next, in combination with Figure 2 describe method 200 for transmitting a sequence provided by an embodiment of the present application. Method 200 includes:

[0139] S201, the first device generates a first sequence X(k) with a length of N, where k = 0, 1,..., N - 1.

[0140] S202, the first device sends the first sequence to the second device on L symbols, and the second device receives the received signal corresponding to the first sequence.

[0141] Optionally, the first device sending the first sequence to the second device on L symbols includes: the first device maps the first sequence on L symbols, performs an inverse fast Fourier transform (IFFT) on the mapped first sequence, modulates it to obtain a time-domain signal, and sends it to the second device.

[0142] Optionally, the first sequence may be a long sequence. For example, the length of the first sequence is greater than a preset value, which may be specified by the protocol.

[0143] Optionally, the length N of the first sequence may be configured by the configuration information of the network device. Optionally, if the first sequence is the sequence corresponding to the PRS, the first device is a terminal device, and the second device is a network device, the network device may send the configuration information for configuring the length N of the first sequence to the positioning server, and the positioning server sends the configuration information to the terminal device.

[0144] Wherein, the first sequence includes P sub-sequences, each of the P sub-sequences includes one or more consecutive sequence elements, the sequence elements of the same sub-sequence among the P sub-sequences are mapped to the same symbol, the i-th sub-sequence and the (i + 1)-th sub-sequence among the P sub-sequences are respectively mapped to the l i -th symbol and the l i+1 -th symbol among L symbols, and l i is different from l i+1 . At least two sub-sequences among the P sub-sequences are mapped to the same symbol. Any adjacent sequence elements of the i-th sub-sequence are equally spaced and mapped to the sub-carriers included in the l i -th symbol. The sub-carrier to which the last sequence element of the i-th sub-sequence is mapped and the sub-carrier to which the first sequence element of the (i + 1)-th sub-sequence is mapped are spaced by the first frequency domain interval. P is an integer greater than or equal to 3, i = 0,..., P - 1, and the sum of the lengths of the P sub-sequences is N.

[0145] That is to say, among the P sub-sequences, two adjacent sub-sequences need to be mapped to different symbols, but non-adjacent sub-sequences may be mapped to the same symbol. The elements of the same sub-sequence need to be mapped to one symbol. In other words, if one or a continuous plurality of sequence elements are mapped to one symbol, then this one or continuous plurality of sequence elements form a sub-sequence. If two consecutive sequence elements are mapped to different symbols, then these two sequence elements belong to different sub-sequences. Two non-consecutive sequence elements on the same symbol belong to different sub-sequences.

[0146] Optionally, the first frequency domain interval may be Δf. If X(k) is mapped to the s k -th sub-carrier, then X(k + 1) may be mapped to the ((s k + Δf) mod S)-th sub-carrier, where S is the total number of sub-carriers and mod is the modulo operation.

[0147] Optionally, the P sub-sequences may be mapped to L symbols according to a preset pattern, and the sequence elements included in each of the P sub-sequences are consecutive.

[0148] It can be understood that the L symbols represent the symbols for mapping the sequence elements. If no sequence element is mapped to a certain symbol, then that symbol is not included in the L symbols.

[0149] Optionally, the first symbol among the L symbols to which sequence elements are mapped and the last symbol to which sequence elements are mapped can be adjacent symbols for mapping sequence elements. For example, when L = 3, assuming the last symbol among the 3 symbols is the one to which a sequence element is mapped, then the next symbol of the sequence element adjacent to the last symbol can be the first symbol among the 3 symbols.

[0150] Optionally, the first frequency-domain interval can be configured by the configuration information of the network device. Optionally, if the first sequence is the sequence corresponding to the PRS, the first device is a terminal device, and the second device is a network device, then the network device can send the configuration information for configuring the first frequency-domain interval to the positioning server, and the positioning server sends the configuration information to the terminal device.

[0151] Optionally, the total bandwidth for mapping the first sequence can be preset or configured by the configuration information of the network device. Optionally, if the first sequence is the sequence corresponding to the PRS, the first device is a terminal device, and the second device is a network device, then the network device can send the configuration information for configuring the total bandwidth of the first sequence to the positioning server, and the positioning server sends the configuration information to the terminal device.

[0152] Optionally, the generation method of the first sequence can be preset. The first device generates the first sequence according to the preset method, and the second device can also generate the first sequence according to the preset method.

[0153] For example, as Figure 3 shown, P = 4, the first sequence consists of 4 sub-sequences, N = 6, X(0) is the 0th sub-sequence, X(1) is the 1st sub-sequence, X(2) is the 2nd sub-sequence, and X(3), X(4), X(5) form the 3rd sub-sequence. At this time, the frequency-domain interval between two adjacent sequence elements in the 3rd sub-sequence X(3), X(4), X(5) is 2 sub-carriers, the frequency-domain interval between X(0) and X(1) is 2 sub-carriers, the frequency-domain interval between X(1) and X(2) is 2 sub-carriers, and the frequency-domain interval between X(2) and X(3) is 2 sub-carriers. The 1st sub-sequence and the 3rd sub-sequence are both mapped on one symbol, and the first frequency-domain interval is 2 sub-carriers. Figure 2 In [example], L is equal to 2, that is, the first sequence is sent on 2 symbols. Another example, as Figure 4As shown, P = 6, the first sequence consists of 6 subsequences. If N = 6, X(0) is the 0th subsequence, X(1) is the 1st subsequence, X(2) is the 2nd subsequence, X(3) is the 3rd subsequence, X(4) is the 4th subsequence, and X(5) is the 5th subsequence. At this time, the frequency-domain interval between adjacent two subsequences is 2 subcarriers. The frequency-domain interval between X(0) and X(1) is 2 subcarriers, the frequency-domain interval between X(1) and X(2) is 2 subcarriers, the frequency-domain interval between X(2) and X(3) is 2 subcarriers, the frequency-domain interval between X(3) and X(4) is 2 subcarriers, and the frequency-domain interval between X(4) and X(5) is 2 subcarriers, that is, the first frequency-domain interval is 2 subcarriers. The 0th subsequence X(0), the 2nd subsequence X(2), and the 4th subsequence X(4) are mapped on the same symbol, and the 1st subsequence X(1), the 3rd subsequence X(3), and the 5th subsequence X(5) are mapped on the same symbol. Figure 4 In Figure 4 , L is equal to 2, that is, the first device sends the first sequence on 2 symbols.

[0154] Optionally, the lengths of each of the first P - 1 subsequences among the P subsequences are equal, all being h 1 , and the length of the last subsequence among the P subsequences is h 2 , h 1 is the same as or different from h, and (P - 1)·h 2 +h 1 = N. For example 2 or, or, as Figure 5 shown, the first sequence includes a total of 3 subsequences, P = 3, N = 5, X(0), X(1) are the 0th subsequence, X(2), X(3) are the 1st subsequence, X(4) is the 2nd subsequence, h 1 is 2, h 2 is 1, and the first frequency-domain interval is 2. That is to say, as much as possible, the subsequences mapped on each symbol include an equal number of sequence elements, that is, the sequence elements are mapped as evenly as possible. In this way, the design can be simplified, which is beneficial for the second device to configure the subsequences included in the first sequence.

[0155] Optionally, each subsequence among the P subsequences consists of one sequence element, that is to say, one subsequence is one sequence element and one sequence element is one subsequence. For example Figure 4 or Figure 6 shown, P = 6, the first sequence consists of 6 subsequences, and the first sequence also consists of 6 elements.

[0156] Optionally, when each subsequence consists of one sequence element, the first frequency-domain interval can be Δf. If X(k) is mapped on the sth kOn the subcarrier, X(k + 1) can be mapped on the ((s k + Δf) mod S) - th subcarrier. S is the total number of subcarriers, and mod is the modulo operation.

[0157] Optionally, the symbol position where X(k) is mapped is l start + pattern L (k), where l start is the starting position of the time - domain symbol, and pattern L (k) is the symbol offset of the symbol where the sequence element X(k) is mapped relative to l start . The value of pattern L (k) is a value in 0, δ, 2δ, …, (L - 1)·δ, where δ is the symbol interval between two adjacent symbols on which different sequence elements are mapped, and δ is a positive integer greater than or equal to 1. That is to say, pattern L (k) represents the offset of each sequence element relative to the starting position of the time - domain symbol. If the value of k is different, pattern L (k) can be the same or different. Optionally, δ = 1, then the value of pattern L (k) is a value in 0, 1, 2, …, (L - 1). As Figure 3 shown, N = 6, δ = 3, and the value of pattern L (k) is a value in 0, 3, 6, …, 3·(L - 1). If l start is Figure 3 the first symbol, pattern L (0) = 0, pattern L (1) = 3, pattern L (2) = 0, pattern L (3) = 3, pattern L (4) = 3, pattern L (5) = 3. As Figure 4 shown, N = 6, δ = 3, and the value of pattern L (k) is a value in 0, 3, 6, …, 3·(L - 1). If l start is Figure 4 the first symbol, pattern L (0) = 0, pattern L (1) = 3, pattern L (2) = 0, pattern L (3) = 3, pattern L (4) = 0, pattern L (5) = 3. AsFigure 5 As shown, δ = 4, pattern L (k) takes values from 0, 4, 8, …, 4·(L - 1). If l start is Figure 5 the first symbol of, pattern L (0) = 0, pattern L (1) = 0, pattern L (2) = 4, pattern L (3) = 4, pattern L (4) = 0. Figure 6 As shown, δ = 3, pattern L (k) takes values from 0, 3, 6, …, 3·(L - 1). If l start is Figure 6 the first symbol of, pattern L (0) = 0, pattern L (1) = 3, pattern L (2) = 6, pattern L (3) = 0, pattern L (4) = 3, pattern L (5) = 6.

[0158] Optionally, l start can be a preset value or configured by the configuration information of the network device. Optionally, l start can be a value specified by the protocol. Optionally, if the first sequence is the sequence corresponding to PRS, the first device is a terminal device, and the second device is a network device, then the network device can send the configuration information of l start to the positioning server, and the positioning server sends the configuration information to the terminal device.

[0159] Optionally, pattern L (k) can be a value from 0, δ, 2δ, …, (L - 1)·δ specified by the protocol. Optionally, pattern L (k) can also be configured by the configuration information of the network device. Optionally, if the first sequence is the sequence corresponding to PRS, the first device is a terminal device, and the second device is a network device, then the network device can send the configuration information of pattern L (k) to the positioning server, and the positioning server sends the configuration information to the terminal device.

[0160] Optionally, δ can be configured by the configuration information of the second device or be a value specified by the protocol. Optionally, if the first sequence is the sequence corresponding to the PRS, the first device is a terminal device, and the second device is a network device, the network device may send the configuration information for configuring δ to the positioning server, and the positioning server sends the configuration information to the terminal device.

[0161] Optionally, when k = 0, 1, 2, …, L - 1, pattern L (k) takes the k-th element in the first permutation composed of 0, δ, 2δ, …, (L - 1)·δ; when k = L, L + 1, …, N - 1, pattern L (k) takes the value of pattern L (k mod L). Optionally, N is greater than L. That is to say, when the value of k is less than L, each of the L sequence elements mapped on L symbols corresponds to a symbol offset. When the value of k is greater than or equal to L and less than N, the symbol offset corresponding to each sequence element can be obtained by taking the modulo operation according to the symbol offset when the value of k is less than L. In this way, if the second device configures pattern L (k) for the first device, only the pattern L (k) when the value of k is less than L needs to be configured, and the pattern L (k) when k is greater than or equal to L does not need to be configured, thereby saving signaling overhead. Or the protocol only needs to specify the pattern L (k) when the value of k is less than L, and does not specify the pattern L (k) when k is greater than or equal to L, thereby simplifying the design.

[0162] Optionally, the first permutation can be a preset permutation composed of 0, δ, 2δ, …, (L - 1)·δ in order. Among them, the pattern L (k) corresponding to different values of k can be the same element or different elements in the first permutation, as long as it is ensured that there are sequence elements mapped on L symbols, and the number of sequence elements mapped on each symbol is not limited. There can be fewer sequence elements mapped on some symbols and more sequence elements mapped on some symbols. For example, the first permutation can be (L - 1)·δ, (L - 2)·δ, …, 2δ, δ, 0.

[0163] Optionally, the first permutation can be 0, δ, 2δ, …, (L - 1)·δ. When k is less than L, pattern L (k) corresponds to the k-th element in the first permutation 0, δ, 2δ, …, (L - 1)·δ. That is to say, pattern L (k) = δ·k.

[0164] For example, δ = 2, L = 4, the first permutation can be 0, 2, 4, 6, N = 8, pattern L (0) = 0,

[0165] pattern L (1) = 2, pattern L (2) = 4, pattern L (3) = 6.

[0166] pattern L (4) = pattern L (4 mod 4) = pattern L (0) = 0,

[0167] pattern L (5) = pattern L (5 mod 4) = pattern L (1) = 2,

[0168] pattern L (6) = pattern L (6 mod 4) = pattern L (2) = 4,

[0169] pattern L (7) = pattern L (7 mod 4) = pattern L (3) = 6.

[0170] That is to say, X(0) and X(4) are mapped to the same symbol, X(1) and X(5) are mapped to the same symbol, X(2) and X(6) are mapped to the same symbol, and X(3) and X(7) are mapped to the same symbol.

[0171] It should be noted that pattern L (k) can be understood as the symbol pattern of the sequence element X(k) in the time domain. By means of the symbol pattern, the N sequence elements constituting the first sequence can be mapped to multiple symbols in the time domain.

[0172] Optionally, the above-mentioned pattern L (k) can be preset, or it can also be generated according to the preset. For example, pattern L (k) can be generated by pattern L (k)', where pattern L (k)' is a preset symbol pattern, or patternL (k)' is the symbol offset of the symbol mapped by the preset sequence element X(k) relative to l start . In this way, the first device can generate pattern L (k) according to pattern L (k)'. Optionally, the way for the first device to generate pattern L (k) according to pattern L (k)' can be preset or specified by the protocol.

[0173] Optionally, when k = 0, 1, 2, …, L - 1, pattern L (k) = pattern L ((k + q) mod L)'; where the value of q is a value in 0, 1, …, L - 1, and pattern L (k)' is the symbol offset of the symbol mapped by the sequence element X(k) relative to l start predefined symbol offset, and pattern L (k)' takes the k-th element in the second permutation composed of 0, δ, 2δ, …, (L - 1)·δ. That is to say, pattern L (k) can be generated by shifting and taking the modulus according to pattern L (k)'. This can make the value of pattern L (k) still be an element in the second permutation composed of 0, δ, 2δ, …, (L - 1)·δ, but pattern L (k) may not be equal to pattern L (k)'.

[0174] For example, δ = 2, L = 4, and the value of pattern L (k)' is an element in the second permutation 6, 4, 2, 0, pattern L (0)' = 6, pattern L (1)' = 4, pattern L (2)' = 2, pattern L (3)' = 0. q = 1,

[0175] pattern L (1) = pattern L ((1 + 1) mod 4)' = pattern L (2)' = 2,

[0176] pattern L (2) = pattern L((2 + 1) mod 4)' = pattern L (3)' = 0,

[0177] pattern L (3) = pattern L ((3 + 1) mod 4)' = pattern L (0)' = 6

[0178] pattern L (4) = pattern L ((4 + 1) mod 4)' = pattern L (1)' = 4。

[0179] Optionally, the second permutation can be 0, δ, 2δ, …, (L - 1)·δ. When k is less than L, pattern L (k)' corresponds to the k-th element in the first permutation 0, δ, 2δ, …, (L - 1)·δ, that is, pattern L (k)' = δ·k.

[0180] Optionally, the value of q can be a value in 0, 1, …, L - 1 configured by the configuration information, or a value in 0, 1, …, L - 1 specified by the protocol. Optionally, if the first sequence is the sequence corresponding to the PRS, the first device is a terminal device, and the second device is a network device, the network device can send the configuration information of configuring q to the positioning server, and the positioning server sends the configuration information to the terminal device.

[0181] Optionally, the first permutation can be the same as the second permutation. Optionally, the first permutation can be different from the second permutation.

[0182] The above is described in terms of sequence elements. Since a subsequence can be composed of one or more consecutive sequence elements, and the sequence elements constituting a subsequence are mapped to one symbol, therefore, the mapping method in the time domain can also be represented by subsequences. The mapping method in the time domain is described below in combination with subsequences.

[0183] Optionally, the symbol position of the i-th subsequence is l′ start +pattern L (i), where l′ start is the starting position of the time domain symbol, and pattern L (i) is the symbol offset of the symbol mapped by the i-th subsequence relative to, and pattern LThe value of (i) is a value among 0, δ', 2δ', …, (L - 1)·δ', where δ' is the symbol interval between two adjacent symbols that map different sequence elements, and δ' is a positive integer greater than or equal to 1. That is, pattern L (i) represents the offset of each subsequence relative to the starting position of the time-domain symbol. If the value of i is different, then pattern L (i) can be the same or different. Optionally, if δ = 1, then pattern L (i) takes values among 0, 1, 2, …, (L - 1). As Figure 3 shown, when δ = 3, pattern L (i) takes values among 0, 3, 6, …, 3·(L - 1). Assume that l′ start is Figure 3 's first symbol. Figure 3 There are a total of four subsequences. When i = 0, the 0th subsequence is X(0); when i = 1, the 1st subsequence is X(1); when i = 2, the 2nd subsequence is X(2); when i = 3, the 3rd subsequence is X(3), X(4), X(5). The pattern L corresponding to the 0th subsequence, (0) = 0; the pattern L corresponding to the 1st subsequence, (1) = 3; the pattern L corresponding to the 2nd subsequence, (2) = 0; the pattern L corresponding to the 3rd subsequence, (3) = 3. As Figure 4 shown, when δ = 3, pattern L (i) takes values among 0, 3, 6, …, 3·(L - 1). Assume that l′ start is Figure 4 's first symbol. Figure 4 The first sequence in consists of six subsequences. When i = 0, the 0th subsequence is X(0); when i = 1, the 1st subsequence is X(1); when i = 2, the 2nd subsequence is X(2); when i = 3, the 3rd subsequence is X(3); when i = 4, the 4th subsequence is X(4); when i = 5, the 5th subsequence is X(5). The pattern L corresponding to the 0th subsequence, (0) = 0; the pattern L corresponding to the 1st subsequence, (1) = 3; the pattern L corresponding to the 2nd subsequence, (2) = 0; the pattern L corresponding to the 3rd subsequence, (3) = 3; the pattern L corresponding to the 4th subsequence, (4) = 0; the pattern L corresponding to the 5th subsequence, (5) = 3. As Figure 5As shown, δ = 4, pattern L (i) takes values from 0, 4, 8, …, 4·(L - 1). Assume l′ start is Figure 5 the first symbol of, Figure 5 The first sequence in consists of 3 subsequences. When N = 5 and i = 0, the 0th subsequence is X(0), X(1); when i = 1, the 1st subsequence is X(2), X(3); when i = 2, the second subsequence is X(4). The pattern corresponding to the 0th subsequence L (0) = 0, the pattern corresponding to the 1st subsequence L (1) = 4, the pattern corresponding to the 2nd subsequence L (2) = 0. Figure 6 As shown, δ = 3, pattern L (i) takes values from 0, 3, 6, …, 3·(L - 1). Assume l′ start is Figure 6 the first symbol of, Figure 6 There are a total of 6 subsequences. When i = 0, the 0th subsequence is X(0); when i = 1, the 1st subsequence is X(1); when i = 2, the 2nd subsequence is X(2); when i = 3, the 3rd subsequence is X(3); when i = 4, the 4th subsequence is X(4); when i = 5, the 5th subsequence is X(5). The pattern corresponding to the 0th subsequence L (0) = 0, the pattern corresponding to the 1st subsequence L (1) = 3, the pattern corresponding to the 2nd subsequence L (2) = 6, the pattern corresponding to the 3rd subsequence L (3) = 0, the pattern corresponding to the 4th subsequence L (4) = 3, the pattern corresponding to the 5th subsequence L (5) = 6.

[0184] Optionally, l′ start can be a preset value or configured by the configuration information of the network device. Optionally, l′ start can be a value specified by the protocol. Optionally, if the first sequence is the sequence corresponding to PRS, the first device is a terminal device, and the second device is a network device, then the network device can send the configuration information of configuring l′ start to the positioning server, and the positioning server sends the configuration information to the terminal device.

[0185] Optionally, pattern L (i) can be a value among 0, δ, 2δ, …, (L - 1)·δ specified by the protocol. Optionally, patternL (i) may also be configured by the configuration information of the network device. Optionally, if the first sequence is the sequence corresponding to the PRS, the first device is a terminal device, and the second device is a network device, the network device may send the configuration information of the configuration pattern L (i) to the positioning server, and the positioning server sends the configuration information to the terminal device.

[0186] Optionally, when i = 0, 1, 2,..., L - 1, pattern L (i) takes the i-th element in the third permutation composed of 0, δ', 2δ',...,(L - 1)·δ'; when i = L, L + 1,..., P - 1, pattern L (i) takes the value of pattern L (imodL). Optionally, N is greater than L. That is, when the value of i is less than L, each subsequence mapped on L symbols corresponds to a symbol offset. When the value of i is greater than or equal to L and less than P - 1, the symbol offset corresponding to each subsequence can be obtained by taking the modulo operation according to the symbol offset when the value of i is less than L. In this way, if the second device configures pattern L (i) for the first device, only the pattern L (i) with the value of i less than L needs to be configured, and the pattern L (i) with i greater than or equal to L does not need to be configured, thereby saving signaling overhead. Or the protocol only needs to specify the pattern L (i) with the value of i less than L, and does not specify the pattern L (i) with i greater than or equal to L, thereby simplifying the design.

[0187] Optionally, the third permutation may be a preset permutation composed of 0, δ', 2δ',...,(L - 1)·δ' in order. Among them, the pattern L (i) corresponding to different values of i may be the same element or different elements in the third permutation, as long as it is ensured that subsequences are mapped on all L symbols, and the number of subsequences mapped on each symbol is not limited. The number of subsequences mapped on some symbols may be less, and the number of subsequences mapped on some symbols may be more. For example, the third permutation may be (L - 1)·δ', (L - 2)·δ',..., 2δ', δ', 0.

[0188] Optionally, the third permutation may be 0, δ', 2δ',...,(L - 1)·δ'. When i is less than L, pattern L(i) corresponds to the i-th element in the third permutation 0, δ', 2δ', …, (L - 1)·δ', that is, pattern L (i) = δ·i.

[0189] For example, δ' = 2, L = 4, the third permutation can be 0, 2, 4, 6, P = 8, pattern L (0) = 0,

[0190] pattern L (1) = 2, pattern L (2) = 4, pattern L (3) = 6. Therefore,

[0191] pattern L (4) = pattern L (4 mod 4) = pattern L (0) = 0,

[0192] pattern L (5) = pattern L (5 mod 4) = pattern L (1) = 2,

[0193] pattern L (6) = pattern L (6 mod 4) = pattern L (2) = 4,

[0194] pattern L (7) = pattern L (7 mod 4) = pattern L (3) = 6.

[0195] That is to say, the 0th subsequence and the 4th subsequence are mapped to the same symbol, the 1st subsequence and the 5th subsequence are mapped to the same symbol, the 2nd subsequence and the 6th subsequence are mapped to the same symbol, and the 3rd subsequence and the 7th subsequence are mapped to the same symbol.

[0196] It should be noted that pattern L (i) can be understood as the symbol pattern of the i-th subsequence in the time domain. In this way of symbol pattern, the P subsequences that make up the first sequence can be mapped to multiple symbols in the time domain.

[0197] Optionally, the above-mentioned pattern L (i) can be preset, or it can also be generated according to the preset. For example, pattern L(i) can be generated through pattern L (i)', where pattern L (i)' is a preset symbol pattern, or pattern L (i)' is the symbol offset of the symbol mapped by the preset i-th subsequence with respect to l′ start . In this way, the first device can generate pattern L (i) according to pattern L (i)'. Optionally, the manner in which the first device generates pattern L (i) according to pattern L (i)' can be preset or specified by the protocol.

[0198] Optionally, when i = 0, 1, 2, …, L - 1, pattern L (i) = pattern L ((i + q') mod L)'; where the value of q' is a value among 0, 1, 2, …, L - 1, and pattern L (i) is the symbol offset of the symbol of the i-th subsequence with respect to l′ start predefined, and the value of pattern L (i)' is the i-th element in the fourth permutation composed of 0, δ', 2δ', …, (L - 1)·δ'. That is to say, pattern L (i) can be generated by shifting and taking the modulus according to pattern L (i)'. This can ensure that the value of pattern L (i) is still an element in the fourth permutation composed of 0, δ, 2δ, …, (L - 1)·δ, but pattern L (i) may not be equal to pattern L (i)'.

[0199] For example, δ' = 2, L = 4, the value of pattern L (i)' is an element in the fourth permutation 6, 4, 2, 0, pattern L (0)' = 6, pattern L (1)' = 4, pattern L (2)' = 2, pattern L (3)' = 0. q' = 1,

[0200] pattern L (0) = pattern L ((0 + 1) mod 4)' = patternL (1)' = 4,

[0201] pattern L (1) = pattern L ((1 + 1) mod 4)' = pattern L (2)' = 2,

[0202] pattern L (2) = pattern L ((2 + 1) mod 4)' = pattern L (2)' = 0

[0203] pattern L (3) = pattern L ((3 + 1) mod 4)' = pattern L (0)' = 6。

[0204] Optionally, the fourth permutation can be 0, δ', 2δ', …, (L - 1)·δ'. When i is less than L, pattern L (k)' corresponds to the k-th element in the fourth permutation 0, δ', 2δ', …, (L - 1)·δ', that is, pattern L (k)' = δ·k.

[0205] Optionally, the value of q' can be a value in 0, 1, …, L - 1 configured by configuration information, or a value in 0, 1, …, L - 1 specified by a protocol. Optionally, if the first sequence is the sequence corresponding to the PRS, the first device is a terminal device, and the second device is a network device, the network device can send the configuration information for configuring q' to the positioning server, and the positioning server sends the configuration information to the terminal device.

[0206] Optionally, in S201, the first sequence can be the sequence corresponding to the reference signal, and the first sequence can also be referred to as the reference signal sequence. For example, the first sequence can be the sequence corresponding to the demodulation reference signal (DMRS). Another example is that the first sequence can be the sequence corresponding to the positioning reference signal (PRS). Another example is that the first sequence can be the sounding reference signal (SRS), and the first sequence can be the sequence corresponding to the sidelink (SL) DMRS or the SL PRS or the SL SRS.

[0207] The above Figures 2 - 6The mapping method shown may be the mapping method of DMRS. For example, as Figure 7 shown, the mapping method of PRS is shown. The first device may map the first sequence corresponding to the PRS with a length of 12 on 4 symbols. The first sequence is X(0), X(1), X(2), X(3), X(4), X(5), X(6), X(7), X(8), X(9), X(10), X(11). The frequency-domain interval between two adjacent sequence elements of the first sequence is one subcarrier. The third device may map the third sequence corresponding to the PRS with a length of 12 on 4 symbols. The third sequence is W(0), W(1), W(2), W(3), W(4), W(5), W(6), W(7), W(8), W(9), W(10), W(11). The frequency-domain interval between two adjacent sequence elements of the third sequence is one subcarrier. That is to say, for the corresponding PRS, a long-sequence mapping method can be provided. The PRS is a positioning reference signal. That is to say, while the PRS can be positioned, the long sequence can be used to reduce interference.

[0208] S203. The second device processes the received signal according to the first sequence.

[0209] Specifically, the first sequence is a known sequence that the second device can know. In other words, the second device knows what sequence the first device has sent, and the second device can process the received signal according to the sequence sent by the first device.

[0210] Optionally, in S203, the second device calculates the transmission duration of the received signal according to the first sequence.

[0211] Optionally, the second device may parse the received signal, and splice the parsed received signal to obtain a second sequence according to the mapping manner of the first sequence mapped to L symbols. Optionally, the second device may parse the received signal, and splice the parsed received signal to obtain a second sequence according to the mapping manner of the first sequence mapped to L symbols, which may include: the second device performs a fast Fourier transformation (FFT) on the received signal to obtain a frequency-domain signal, and splices the second sequence according to the frequency-domain signal. In other words, the second device can know the mapping manner of each sequence element of the first sequence mapped by the first device. The second device may sequentially obtain each sequence element from the parsed received information according to the mapping manner of the first device mapping the first sequence, so as to splice each sequence element into a second sequence. Or, the second device can know the mapping manner of each subsequence of the first sequence mapped by the first device. The second device may sequentially obtain each subsequence from the parsed received information according to the mapping manner of the first device mapping the first sequence, so as to splice the obtained subsequences into a second sequence. That is to say, the second sequence is the sequence received by the second device, and the first sequence is the sequence sent by the first device. The second device may determine the transmission duration of the received signal according to the second sequence and the first sequence.

[0212] The following describes in different cases how the second device determines the transmission duration of the received signal according to the second sequence and the first sequence.

[0213] Case 1: Determine the transmission duration of the reference signal according to formula (4):

[0214]

[0215] where X(k) is a sequence element in the first sequence, Y(k) is a sequence element in the second sequence corresponding to X(k), and the value of k is 0, 1, 2,..., N - 1; the lengths of the first sequence and the second sequence are both M, Δf is the first frequency-domain interval, S is the total number of subcarriers in the frequency domain, τ is the transmission duration of the received signal, is the first phase sequence factor related to the transmission duration τ of the received signal.

[0216] Since the time-domain shift of the sequence elements constituting the first sequence is equivalent to frequency-domain phase shift, X(k) after the transmission duration τ is equal to the phase shift in the frequency domain by Therefore, the relationship between X(k) and Y(k) can be as shown in Formula (4). In other words, the second device can determine the transmission duration of the received signal based on the second sequence spliced from the received signal and the first sequence sent by the first device. That is to say, in Formula (4), X(k) and Y(k) are known, S is known, and Δf is known. Therefore, only the transmission duration τ is unknown. Therefore, the transmission duration of the received signal can be determined according to the principle of Formula (4).

[0217] In Case 2, the second device determines the transmission duration of the received signal based on the second sequence and the first sequence, including: determining the transmission duration of the received signal based on the second sequence and the conjugate sequence of the first sequence. Since the second device can obtain the first sequence, it can also obtain the conjugate sequence of the first sequence.

[0218] Optionally, to determine the transmission duration of the received signal based on the second sequence and the conjugate sequence of the first sequence: determine the transmission duration of the received signal based on the second sequence, the conjugate sequence of the first sequence, and multiple known phase sequence factors. Optionally, the second device can perform a correlation operation based on multiple known phase sequence factors, the conjugate sequence of the first sequence, and the second sequence, and can determine the parameter corresponding to the phase sequence factor with a relatively high or the highest correlation degree after the correlation operation as the transmission duration of the received signal.

[0219] Among them, Case 2 is further divided into two cases a and b.

[0220] In Case a, optionally, to determine the transmission duration of the reference signal based on the second sequence, the conjugate sequence of the first sequence, and multiple known phase sequence factors, including: taking the d corresponding to the maximum value among G j as the transmission duration τ of the received signal. That is to say, one d j corresponds to one The different d j correspond to different ones. There are a total of G different d j , so there are G

[0221] Among them, is any one of the G known phase sequence factors, G is a positive integer, and the value of j is 1, 2,..., G; Δf is the first frequency domain interval, S is the total number of subcarriers in the frequency domain, Y(k) is the sequence element in the second sequence, X(k) is the sequence element in the first sequence corresponding to Y(k), X * (k) is the sequence element in the conjugate sequence of the first sequence corresponding to X(k), the value of k is 0, 1, 2,..., N - 1, and the lengths of the first sequence and the conjugate sequence of the second sequence are both N.

[0222] That is to say, among the G The maximum value in is also the one with the greatest correlation. In other words, the d corresponding to the maximum correlation j is the transmission duration of the received signal.

[0223] Optionally, d i is a positive integer less than or equal to S / Δf.

[0224] In case b, optionally, the second sequence and the conjugate sequence of the first sequence determine the transmission duration of the reference signal, including: padding zeros to the second sequence to obtain a third sequence, and padding zeros to the conjugate sequence of the first sequence to obtain a fourth sequence; performing the inverse Fourier transform IFFT of the RL points on the product of Y(k') and X * (k'), where k' takes values from 0, 1, 2,..., RL - 1; determining the transmission duration of the reference signal according to the position of the maximum peak after the IFFT transform.

[0225] Among them, Y(k') is the sequence element in the third sequence, and X * (k') is the sequence element in the fourth sequence corresponding to Y(k'). The lengths of the third sequence and the fourth sequence are both RL, and the value of k' is 0, 1, 2,..., RL - 1. When the value of k' is N, N + 1,..., RL - 1, both Y(k') in the third sequence and X * (k') in the fourth sequence are 0; N is the length of the first sequence and the second sequence, Δf is the first frequency domain interval, S is the total number of subcarriers in the frequency domain, and R is the smallest integer such that RL is greater than or equal to N.

[0226] Optionally, the total number of subcarriers S can be a value specified by the protocol.

[0227] Optionally, after determining the transmission duration of the received signal, the second device can determine the position of the first device according to the transmission duration of the received signal.

[0228] Optionally, after determining the transmission duration of the received signal, the second device can locate the first device according to the transmission duration. Optionally, the second device locates the first device according to the transmission duration, including: the second device determines the distance between the second device and the first device according to the transmission duration and the speed of light, and the second device locates the first device according to the distance between the second device and the first device.

[0229] It should be noted that in the embodiments of the present application, Figures 3 - 7 The mapping method of the first sequence in is only described by way of example and should not impose any limitation on the embodiments of the present application.

[0230] It also should be noted that in the embodiments of the present application, Figures 3 - 7The length of the first sequence in the above is only described by way of example. Since the first sequence is a long sequence, in order to avoid redundancy caused by using a long sequence for illustration, only a few sequence elements are used for illustration.

[0231] As described above, in combination with Figures 2 - 7 The method for transmitting a sequence provided by the embodiment of the present application is described in detail. Next, in combination with Figure 8 and Figure 9 The communication device for transmitting a sequence provided by the embodiment of the present application is described in detail.

[0232] Figure 8 is a schematic block diagram of the communication device for transmitting a sequence provided by the embodiment of the present application. As Figure 8 shown, the communication device 800 may include a transceiver unit 810 and a processing unit 820.

[0233] In a possible implementation manner, the communication device 800 may correspond to the first device in the above method embodiment. For example, it may be the first device or a chip configured in the first device. The communication device 800 is used to execute each step or process corresponding to the first device in the above method.

[0234] Among them, the processing unit 820 is used to generate a first sequence X(k) with a length of N, where k = 0, 1,..., N - 1;

[0235] The transceiver unit 810 is used to transmit the first sequence on L symbols. The first sequence includes P sub-sequences. Each sub-sequence in the P sub-sequences includes one or more consecutive sequence elements. The sequence elements in the same sub-sequence among the P sub-sequences are mapped to the same symbol. The i-th sub-sequence and the (i + 1)-th sub-sequence among the P sub-sequences are respectively mapped to the l i -th symbol and the l i+1 -th symbol among the L symbols. l i is different from l i+1 . At least two sub-sequences among the P sub-sequences are mapped to the same symbol. Any adjacent sequence elements of the i-th sub-sequence are equally spaced and mapped to the sub-carriers included in the l i -th symbol. The interval between the sub-carrier to which the last sequence element of the i-th sub-sequence is mapped and the sub-carrier to which the first sequence element of the (i + 1)-th sub-sequence is mapped is the first frequency domain interval. The total length of the P sub-sequences is N;

[0236] Among them, N is an integer greater than 1, L is a positive integer greater than 1, P is an integer greater than or equal to 3, and i = 0, 1,..., P - 1.

[0237] As an alternative embodiment, the lengths of each of the first P - 1 subsequences among the P subsequences are equal and are all h 1 , and the length of the last subsequence among the P subsequences is h 2 , h 1 is the same as or different from h 2 , (P - 1)·h 1 +h 2 =N, h 1 and h 2 are positive integers greater than or equal to 1.

[0238] As an alternative embodiment, P = N, and each of the P subsequences consists of one sequence element.

[0239] As an alternative embodiment, the symbol position mapped by X(k) is l start +pattern L (k),

[0240] where l start is the starting position of the time-domain symbol, and pattern L (k) is the symbol offset of the symbol mapped by the sequence element X(k) relative to l start , and the value of pattern L (k) is a value among 0, δ, 2δ, …, (L - 1)·δ, and δ is a positive integer greater than or equal to 1.

[0241] As an alternative embodiment, when k = 0, 1, 2, …, L - 1, the value of pattern L (k) is the k-th element in the first permutation composed of 0, δ, 2δ, …, (L - 1)·δ; when k = L, L + 1, …, N - 1, the value of pattern L (k) is pattern L (k mod L).

[0242] As an alternative embodiment, when k = 0, 1, 2, …, L - 1, pattern L (k)=δ·k.

[0243] As an alternative embodiment, the method further includes:

[0244] When k = 0, 1, 2, …, L - 1, pattern L (k)=pattern L ((k + q) mod L)';

[0245] where the value of q is a value among 0, 1, …, L - 1, and pattern L(k)' is the symbol mapped by the sequence element X(k) relative to l start a predefined symbol offset, pattern L (k)' takes the k-th element in the second permutation composed of 0, δ, 2δ, …, (L - 1)·δ.

[0246] As an alternative embodiment, the symbol position of the i-th subsequence is l′ start +pattern L (i),

[0247] where l′ start is the starting position of the time-domain symbol, pattern L (i) is the symbol offset of the symbol mapped by the i-th subsequence relative to l′ start and pattern L (i) takes values from 0, δ', 2δ', …, (L - 1)·δ', where δ' is a positive integer greater than or equal to 1.

[0248] As an alternative embodiment, when i = 0, 1, 2, …, L - 1, pattern L (i) takes the i-th element in the third permutation composed of 0, δ', 2δ', …, (L - 1)·δ'; when i = L, L + 1, …, P - 1, pattern L (i) takes the value of pattern L (imodL).

[0249] As an alternative embodiment, when i = 0, 1, 2, …, L - 1, pattern L (i) = i·δ'.

[0250] As an alternative embodiment, the method further includes:

[0251] When i = 0, 1, 2, …, L - 1, pattern L (i) = pattern L ((i + q')modL)';

[0252] where q' takes values from 0, 1, …, L - 1, and pattern L (i) is the symbol offset of the symbol of the i-th subsequence relative to l′ start a predefined symbol offset, and pattern L (i)' takes the i-th element in the fourth permutation composed of 0, δ', 2δ', …, (L - 1)·δ'.

[0253] As an alternative embodiment, the transceiver unit 810 is further configured to: send configuration information, where the configuration information is used to indicate at least one of a first frequency-domain interval, l start , l' start , L, pattern L (k), pattern L (i), q, q', δ, δ', h 1 or N.

[0254] In a possible implementation, the communication device 800 may correspond to the second device in the above method embodiment. For example, it may be the second device or a chip configured in the second device. The communication device 800 is configured to perform each step or process corresponding to the second device in the above method.

[0255] Wherein, the transceiver unit 810 is configured to obtain a received signal of a reference signal on L symbols. The reference signal is generated according to a first sequence, the length of the first sequence is N, the first sequence includes P subsequences, and each subsequence in the P subsequences includes one or more consecutive sequence elements. The sequence elements in the same subsequence among the P subsequences are mapped to the same symbol. The i-th subsequence and the (i + 1)-th subsequence among the P subsequences are respectively mapped to the l i -th symbol and the l i+1 -th symbol among the L symbols, l i is different from l i+1 , at least two subsequences among the P subsequences are mapped to the same symbol, any adjacent sequence elements of the i-th subsequence are mapped to the subcarriers included in the l i -th symbol at equal intervals according to a first frequency-domain interval, and the interval between the subcarrier to which the last sequence element of the i-th subsequence is mapped and the subcarrier to which the first sequence element of the (i + 1)-th subsequence is mapped is the first frequency-domain interval. P is an integer greater than or equal to 3, i = 0, 1,..., P - 1, and the total length of the P subsequences is N; the processing unit 820 is configured to process the received signal according to the first sequence;

[0256] Wherein, N is an integer greater than 1, L is a positive integer greater than 1, P is an integer greater than or equal to 3, and i = 0, 1,..., P - 1.

[0257] As an alternative embodiment, the lengths of each of the first P - 1 subsequences among the P subsequences are equal, all being h 1 , and the length of the last subsequence among the P subsequences is h 2 , h 1 is different from h 2Same or different, (P - 1)·h 1 +h 2 =N, h 1 and h 2 are positive integers greater than or equal to 1.

[0258] As an alternative embodiment, P = N, and each of the P subsequences consists of one sequence element.

[0259] As an alternative embodiment, the symbol position mapped by X(k) is l start +pattern L (k),

[0260] where l start is the starting position of the time-domain symbol, and pattern L (k) is the symbol offset of the symbol mapped by the sequence element X(k) relative to l start , and the value of pattern L (k) is a value among 0, δ, 2δ, …, (L - 1)·δ, where δ is a positive integer greater than or equal to 1.

[0261] As an alternative embodiment, when k = 0, 1, 2, …, L - 1, the value of pattern L (k) is the k-th element in the first permutation composed of 0, δ, 2δ, …, (L - 1)·δ; when k = L, L + 1, …, N - 1, the value of pattern L (k) is pattern L (k mod L).

[0262] As an alternative embodiment, when k = 0, 1, 2, …, L - 1, pattern L (k) = δ·k.

[0263] As an alternative embodiment, when k = 0, 1, 2, …, L - 1, pattern L (k) = pattern L ((k + q) mod L)';

[0264] where the value of q is a value among 0, 1, …, L - 1, and pattern L (k)' is the symbol offset of the symbol mapped by the sequence element X(k) relative to l start predefined, and the value of pattern L (k)' is the k-th element in the second permutation composed of 0, δ, 2δ, …, (L - 1)·δ.

[0265] As an alternative embodiment, the symbol position of the i-th subsequence is l′ start +pattern L (i),

[0266] where l′ start is the starting position of the time-domain symbol, and pattern L (i) is the symbol offset of the symbol mapped by the i-th subsequence relative to l′ start . The value of pattern L (i) is a value in 0, δ', 2δ', …, (L - 1)·δ', where δ' is a positive integer greater than or equal to 1.

[0267] As an alternative embodiment, when i = 0, 1, 2, …, L - 1, the value of pattern L (i) is the i-th element in the third permutation composed of 0, δ', 2δ', …, (L - 1)·δ'; when i = L, L + 1, …, P - 1, the value of pattern L (i) is the value of pattern L (imodL).

[0268] As an alternative embodiment, when i = 0, 1, 2, …, L - 1, pattern L (i) = i·δ'.

[0269] As an alternative embodiment, when i = 0, 1, 2, …, L - 1, pattern L (i) = pattern L ((i + q')modL)';

[0270] where the value of q' is a value in 0, 1, …, L - 1, and pattern L (i) is the symbol offset of the symbol of the i-th subsequence relative to l′ start which is a predefined symbol offset, and the value of pattern L (i)' is the i-th element in the fourth permutation composed of 0, δ', 2δ', …, (L - 1)·δ'.

[0271] As an alternative embodiment, the transceiver unit 810 is configured to: receive configuration information for indicating at least one of a first frequency-domain interval, l start , l′ start , L, pattern L (k), pattern L (i), q, q', δ, δ', h 1 or N.

[0272] It should be understood that the communication device 800 herein is embodied in the form of functional units. The term "unit" herein may refer to an application specific integrated circuit (ASIC), an electronic circuit, a processor (such as a shared processor, a proprietary processor, or a group of processors, etc.) for executing one or more software or firmware programs, and a memory, a combined logic circuit, and / or other suitable components that support the described functions. In an alternative example, those skilled in the art can understand that the communication device 800 may specifically be the first device in the above embodiments and can be used to execute each process and / or step corresponding to the first device in the above method embodiments; or, the communication device 800 may specifically be the second device in the above embodiments to be used to execute each process and / or step corresponding to the second device in the above method embodiments. To avoid repetition, details are not described herein again.

[0273] The communication device 800 in each of the above solutions has the function of implementing the corresponding steps executed by the first device in the above method, or the communication device 800 in each of the above solutions has the function of implementing the corresponding steps executed by the second device in the above method. The function can be implemented by hardware or by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above functions; for example, the communication unit can be replaced by a transceiver (for example, the sending unit in the communication unit can be replaced by a transmitter, and the receiving unit in the communication unit can be replaced by a receiver), and other units, such as the processing unit, etc., can be replaced by a processor to respectively execute the transceiver operations and related processing operations in each method embodiment.

[0274] In addition, the above communication unit may also be a transceiver circuit (for example, it may include a receiving circuit and a sending circuit), and the processing unit may be a processing circuit. In the embodiments of the present application, Figure 8 the communication device in may be the first device or the second device in the foregoing embodiments, or may be a chip or a chip system, for example: a system on chip (SoC). Among them, the communication unit may be an input / output circuit, a communication interface; the processing unit is a processor, a microprocessor, or an integrated circuit integrated on the chip. No limitation is made herein.

[0275] Figure 9 FIG. shows a communication device 900 provided by an embodiment of the present application. The communication device 900 includes a processor 910 and a transceiver 920. Among them, the processor 910 and the transceiver 920 communicate with each other through an internal connection path, and the processor 910 is used to execute instructions to control the transceiver 920 to send signals and / or receive signals.

[0276] Optionally, the communication device 900 may further include a memory 930, which communicates with the processor 910 and the transceiver 920 via an internal connection path. The memory 930 is used to store instructions, and the processor 910 can execute the instructions stored in the memory 930. In a possible implementation, the communication device 900 is used to implement each process and step corresponding to the first device in the above method embodiments. In a possible implementation, the communication device 900 is used to implement each process and step corresponding to the second device in the above method embodiments.

[0277] It should be understood that the communication device 900 may specifically be the first device or the second device in the above embodiments, or may be a chip or a chip system. Correspondingly, the transceiver 920 may be the transceiver circuit of the chip, which is not limited herein. Specifically, the communication device 900 may be used to execute each step and / or process corresponding to the first device or the second device in the above method embodiments. Optionally, the memory 930 may include a read-only memory and a random access memory, and provide instructions and data to the processor. A part of the memory may further include a non-volatile random access memory. For example, the memory may also store information about the device type. The processor 910 may be used to execute the instructions stored in the memory, and when the processor 910 executes the instructions stored in the memory, the processor 910 is used to execute each step and / or process of the above method embodiments corresponding to the first device or the second device.

[0278] In the implementation process, each step of the above method may be completed by the integrated logic circuit in the hardware of the processor or the instructions in the form of software. The steps of the method disclosed in combination with the embodiments of the present application may be directly embodied as being executed and completed by the hardware processor, or may be executed and completed by a combination of the hardware and software modules in the processor. The software module may be located in a mature storage medium in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, or an electrically erasable programmable memory, a register, etc. This storage medium is located in the memory, and the processor reads the information in the memory and combines its hardware to complete the steps of the above method. To avoid repetition, it will not be described in detail here.

[0279] It should be noted that the processor in the embodiments of the present application may be an integrated circuit chip with signal processing capabilities. In the implementation process, the steps of the above method embodiments may be completed by the integrated logic circuit in the hardware of the processor or instructions in the form of software. The above-mentioned processor may be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. It can implement or execute the various methods, steps, and logic block diagrams disclosed in the embodiments of the present application. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc. The steps of the method disclosed in combination with the embodiments of the present application may be directly embodied as being executed by a hardware decoding processor, or completed by a combination of hardware and software modules in the decoding processor. The software module may be located in a mature storage medium in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, or an electrically erasable programmable memory, a register, etc. This storage medium is located in the memory, and the processor reads the information in the memory and combines its hardware to complete the steps of the above method.

[0280] It can be understood that the memory in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an external cache. By way of example but not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct rambus random access memory (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to include but not be limited to these and any other suitable types of memory.

[0281] According to the method provided by the embodiments of the present application, the present application further provides a computer program product, which includes: computer program code. When the computer program code runs on a computer, it causes the computer to execute each step or process performed by the first device or the second device in the above method embodiments.

[0282] According to the method provided by the embodiments of the present application, the present application further provides a computer-readable storage medium, which stores program code. When the program code runs on a computer, it causes the computer to execute each step or process performed by the first device or the second device in the above method embodiments.

[0283] According to the method provided by the embodiments of the present application, the present application further provides a communication system, which includes the aforementioned first device and the second device.

[0284] Each of the above communication device embodiments corresponds exactly to the method embodiments, and the corresponding steps are executed by the corresponding modules or units. For example, the communication unit (transceiver) executes the steps of receiving or sending in the method embodiments, and other steps except for sending and receiving can be executed by the processing unit (processor). The functions of the specific units can be based on the corresponding method embodiments. Among them, the processor can be one or more.

[0285] In the embodiments of the present application, each term and English abbreviation are exemplary examples given for convenience of description, and should not constitute any limitation to the present application. The present application does not exclude the possibility of defining other terms that can achieve the same or similar functions in existing or future protocols.

[0286] It should be understood that "and / or" in this article describes the association relationship of associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist simultaneously, and B exists alone, where A and B can be singular or plural. The character " / " generally represents an "or" relationship between the associated objects before and after.

[0287] Those of ordinary skill in the art can realize that the various illustrative logical blocks and steps described in combination with the embodiments disclosed herein can be implemented by electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are executed in a hardware or software manner depends on the specific application and design constraints of the technical solution. Professional technicians can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the present application.

[0288] Those skilled in the art can clearly understand that for the convenience and brevity of description, the specific working processes of the systems, communication devices, and units described above can be based on the corresponding processes in the foregoing method embodiments and will not be elaborated herein.

[0289] In several embodiments provided in this application, it should be understood that the disclosed systems, communication devices, and methods can be implemented in other ways. For example, the communication device embodiments described above are merely illustrative. For example, the division of the units is only a logical function division, and there may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the displayed or discussed couplings or direct couplings or communication connections to each other can be through some interfaces. The indirect couplings or communication connections of the communication devices or units can be electrical, mechanical, or other forms.

[0290] The units described as separate components may or may not be physically separated. The components displayed as units may or may not be physical units, that is, they can be located in one place or distributed to multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0291] In addition, in each embodiment of this application, the functional units can be integrated in a processing unit, or each unit can exist physically alone, or two or more units can be integrated in one unit.

[0292] In the above embodiments, the functions of each functional unit can be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions (programs). When the computer program instructions (programs) are loaded and executed on a computer, the processes or functions described in the embodiments of the present application are generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable communication devices. The computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (such as coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (such as infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server or a data center that includes one or more integrated available media. The available medium can be a magnetic medium (such as a floppy disk, hard disk, magnetic tape), an optical medium (such as a DVD), or a semiconductor medium (such as a solid state disk (SSD)), etc.

[0293] If the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, in essence, or the part that contributes to the prior art, or a part of this technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present application. The foregoing storage medium includes: various media such as USB flash drives, mobile hard disks, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical discs that can store program codes.

[0294] The above is only the specific implementation manner of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art within the technical scope disclosed by the present application can easily think of changes or substitutions, which should all be covered by 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

1. A method for transmitting a sequence, characterized in that, the method includes: generating a first sequence X(k) of length N, where k = 0, 1, …, N - 1; Transmit the first sequence over L symbols, the first sequence including P subsequences, each of the P subsequences including one or more consecutive sequence elements, the sequence elements of the same subsequence among the P subsequences being mapped onto the same symbol, the i-th subsequence and the (i + 1)-th subsequence among the P subsequences being mapped onto the l i -th symbol and the l i+1 -th symbol among the L symbols respectively, where l i is different from l i+1 , at least two subsequences among the P subsequences being mapped onto the same symbol, any adjacent sequence elements of the i-th subsequence being mapped onto the subcarriers included in the l i -th symbol at equal intervals according to a first frequency-domain interval, the interval between the subcarrier onto which the last sequence element of the i-th subsequence is mapped and the subcarrier onto which the first sequence element of the (i + 1)-th subsequence is mapped being the first frequency-domain interval, the total length of the P subsequences being N; where N is an integer greater than 1, L is a positive integer greater than 1, P is an integer greater than or equal to 3, and i = 0, 1, ……, P - 1.

2. The method according to claim 1, characterized in that, The length of each subsequence in the first P-1 subsequences of the P subsequences is equal, and is h 1 , the length of the last subsequence in the P subsequences is h 2 ,h 1 With h 2 Same or different, (P-1)·h 1 +h 2 =N,h 1 and h 2 is a positive integer greater than or equal to 1.

3. The method according to claim 2, characterized in that, the method further includes: Send the configuration information for indicating h 1 .

4. The method according to claim 1, characterized in that, P = N, and each of the P subsequences consists of one sequence element.

5. The method according to any one of claims 1 to 4, characterized in that, The symbol position mapped by the sequence element X(k) is l start +pattern L (k), where l start is the starting position of the time-domain symbol, and pattern L (k) is the symbol offset of the symbol mapped by the sequence element X(k) relative to l start , and the value of pattern L (k) is a value in 0, δ, 2δ, …, (L-1)·δ, where δ is a positive integer greater than or equal to 1.

6. The method according to claim 5, characterized in that, When \(k = 0, 1, 2, \ldots, L - 1\), pattern L (k) takes the \(k\)-th element in the first permutation composed of \(0, \delta, 2\delta, \ldots, (L - 1)\cdot\delta\); when \(k = L, L + 1, \ldots, N - 1\), pattern L (k) takes the value of pattern L (k mod L).

7. The method according to claim 6, characterized in that, When k = 0, 1, 2, …, L - 1, pattern L (k) = δ·k.

8. The method according to claim 5, characterized in that, When k = 0, 1, 2, …, L - 1, pattern L (k) = pattern L ((k + q) mod L)'; where the value of q is a value in 0, 1, …, L-1, pattern L (k)' is the symbol mapped by the sequence element X(k) relative to l start a predefined symbol offset, pattern L (k)' takes the k-th element in the second permutation composed of 0, δ, 2δ, …, (L-1)·δ.

9. The method according to claim 8, characterized in that, the method further includes: Transmit configuration information for indicating at least one of the first frequency domain interval, l start , L, q, N, pattern L (k) or δ 10. The method according to any one of claims 1 to 4, characterized in that, The symbol position of the i-th subsequence is l s ' tart +pattern L (i), where l s ' tart is the starting position of the time-domain symbol, and pattern L (i) is the symbol offset of the symbol mapped by the i-th subsequence relative to l s ' tart , and the value of pattern L (i) is a value in 0, δ', 2δ', …, (L - 1)·δ', where δ' is a positive integer greater than or equal to 1.

11. The method according to claim 10, characterized in that, When \(i = 0, 1, 2, \ldots, L - 1\), pattern L (i) takes the \(i\)-th element in the third permutation composed of \(0, \delta', 2\delta', \ldots, (L - 1)\cdot\delta'\); when \(i = L, L + 1, \ldots, P - 1\), pattern L (i) takes the value of pattern L (i mod L).

12. The method according to claim 11, characterized in that, When i = 0, 1, 2, …, L - 1, pattern L (i) = i·δ'.

13. The method according to claim 10, characterized in that, When \(i = 0, 1, 2, \ldots, L - 1\), pattern L (i) = pattern L ((i + q') \(\bmod L\))'; where the value of q' is a value among 0, 1, …, L-1, and pattern L (i) is the symbol of the i-th subsequence relative to l s ' tart a predefined symbol offset, pattern L (i)' takes the i-th element in a fourth permutation composed of 0, δ', 2δ', …, (L-1)·δ'.

14. The method according to claim 13, characterized in that, the method further includes: Send for indicating l s ' tart 、pattern L (i), q', or at least one of the configuration information of δ'.

15. A method for transmitting a sequence, characterized in that, the method includes: Obtain a pattern on L symbols L (i) Obtain the received signal of the reference signal, where the reference signal is generated according to a first sequence with a length of N. The first sequence includes P sub-sequences, and each sub-sequence in the P sub-sequences includes one or more consecutive sequence elements. The sequence elements in the same sub-sequence among the P sub-sequences are mapped to the same symbol. The i-th sub-sequence and the (i + 1)-th sub-sequence among the P sub-sequences are respectively mapped to the l i -th symbol and the l i+1 -th symbol among the L symbols, where l i is different from l i+1 . At least two sub-sequences among the P sub-sequences are mapped to the same symbol. Any adjacent sequence elements of the i-th sub-sequence are mapped to the sub-carriers included in the l i -th symbol at equal intervals according to a first frequency-domain interval. The interval between the sub-carrier to which the last sequence element of the i-th sub-sequence is mapped and the sub-carrier to which the first sequence element of the (i + 1)-th sub-sequence is mapped is the first frequency-domain interval. P is an integer greater than or equal to 3, i = 0, 1, ……, P - 1, and the sum of the lengths of the P sub-sequences is N; processing the received signal according to the first sequence; where N is an integer greater than 1, L is a positive integer greater than 1, P is an integer greater than or equal to 3, and i = 0, 1, ……, P - 1.

16. The method according to claim 15, characterized in that, The lengths of each of the first P - 1 subsequences among the P subsequences are equal, all being h 1 , and the length of the last subsequence among the P subsequences is h 2 , h 1 is the same as or different from h 2 , (P - 1)·h 1 +h 2 =N, h 1 and h 2 are positive integers greater than or equal to 1 17. The method according to claim 16, characterized in that, the method further includes: Receive configuration information for indicating h 1 .

18. The method according to claim 15, characterized in that, P = N, and each of the P subsequences consists of one sequence element.

19. The method according to any one of claims 15 to 18, characterized in that, The symbol position mapped by the sequence element X(k) is l start +pattern L (k), where l start is the starting position of the time-domain symbol, and pattern L (k) is the symbol offset of the symbol mapped by the sequence element X(k) relative to l start , and the value of pattern L (k) is a value in 0, δ, 2δ, …, (L - 1)·δ, where δ is a positive integer greater than or equal to 1.

20. The method according to claim 19, characterized in that, When k = 0, 1, 2, …, L - 1, pattern L (k) takes the k-th element in the first permutation composed of 0, δ, 2δ, …, (L - 1)·δ; when k = L, L + 1, …, N - 1, pattern L (k) takes the value of pattern L (k mod L).

21. The method according to claim 20, characterized in that, When k = 0, 1, 2, …, L - 1, pattern L (k) = δ·k.

22. The method according to claim 19, characterized in that, When k = 0, 1, 2, …, L - 1, pattern L (k) = pattern L ((k + q) mod L)'; where the value of q is a value in 0, 1, …, L - 1, pattern L (k)' is the symbol mapped by the sequence element X(k) relative to l start a predefined symbol offset, pattern L (k)' takes the k-th element in the second permutation composed of 0, δ, 2δ, …, (L - 1)·δ.

23. The method according to claim 22, characterized in that, the method further includes: Receive configuration information for indicating at least one of the first frequency domain interval, l start , L, q, N, pattern L (k) or δ 24. The method according to any one of claims 15 to 18, characterized in that, The symbol position of the i-th subsequence is l s ' tart +pattern L (i), where l s ' tart is the starting position of the time-domain symbol, and pattern L (i) is the symbol offset of the symbol mapped by the i-th subsequence relative to l s ' tart , and the value of pattern L (i) is a value in 0, δ', 2δ', …, (L - 1)·δ', where δ' is a positive integer greater than or equal to 1.

25. The method according to claim 24, characterized in that, When \(i = 0, 1, 2, \ldots, L - 1\), pattern L (i) takes the \(i\)-th element in the third permutation composed of \(0, \delta', 2\delta', \ldots, (L - 1)\cdot\delta'\); when \(i = L, L + 1, \ldots, P - 1\), pattern L (i) takes the value of pattern L (i mod L).

26. The method according to claim 25, characterized in that, When i = 0, 1, 2, …, L - 1, pattern L (i) = i·δ'.

27. The method according to claim 24, characterized in that, When i = 0, 1, 2, …, L - 1, pattern L (i) = pattern L ((i + q') mod L)'; wherein, the value of q' is a value among 0, 1, …, L-1, and pattern L (i) is the symbol of the i-th subsequence relative to l s ' tart a predefined symbol offset, pattern L (i)' takes the i-th element in the fourth permutation composed of 0, δ', 2δ', …, (L-1)·δ'.

28. The method according to claim 27, characterized in that, the method further includes: Receive configuration information for indicating at least one of l s ' tart 、pattern L (i), q', or δ'.

29. A communication device, characterized in that, Comprising a processor and a memory, the processor is coupled to the memory, the memory is used to store computer programs or instructions, and the processor is used to execute the computer programs or instructions in the memory, so that the method according to any one of claims 1 to 28 is executed.

30. A computer-readable storage medium, characterized in that it stores a program or instruction for implementing the method according to any one of claims 1 to 28.

Images