Sequence generation method and apparatus

Abstract

A sequence generation method and apparatus. The method comprises: on the basis of a base size of a sequence, determining a first sequence pair, the first sequence pair comprising a first sequence and a second sequence; performing first processing on the first sequence in the first sequence pair, to determine a third sequence in a target sequence pair, and performing first processing on the second sequence in the first sequence pair, to determine a fourth sequence in the target sequence pair, an index of a position where the first processing is performed on the first sequence being the same as an index of a position where the first processing is performed on the second sequence, and a rule for performing the first processing on the first sequence being the same as a rule for performing the first processing on the second sequence, so that a sequence of any length can be generated, improving applicability.

Description

A sequence generation method and apparatus

[0001] This application claims priority to Chinese Patent Application No. 202410981007.X, filed on July 19, 2024, entitled "A Sequence Generation Method and Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of communication technology, and in particular to a sequence generation method and apparatus. Background Technology

[0003] Currently, several waveforms commonly used in communication systems include orthogonal frequency division multiplexing (OFDM), cyclic prefix-orthogonal frequency division multiplexing (CP-OFDM), and discrete fourier transform-spreading-orthogonal frequency division multiplexing (DFT-s-OFDM). Among these, DFT-s-OFDM signals have a lower peak-to-average power ratio (PAPR) compared to OFDM signals. This is because DFT-s-OFDM signals undergo Discrete Fourier Transform (DFT) processing compared to OFDM signals.

[0004] The demodulation reference signal (DMRS) is primarily used for channel estimation. For CP-OFDM, the DMRS is generated using a pseudo-random sequence, the gold sequence. This results in a high PAPR (PAR of the signal), making it difficult to match the data's PAPR. An excessively high PAPR can lead to several problems. For instance, if the peak power of the signal is not set correctly, the signal may enter the non-linear operating region of the power amplifier (PA), causing signal and spectral spread or spectral regeneration. Spectral regeneration can cause inter-carrier interference, increasing the bit error rate. To avoid or mitigate these problems, in practical applications, PA input power back-off or output power back-off is typically implemented. However, PA input power back-off or PA output power back-off reduces cell coverage. For DFT-s-OFDM, the DMRS is generated using a (Zadoff-Chu, zc) sequence or a gold sequence. Because the gold sequence has poor frequency flatness, it can degrade channel estimation.

[0005] To address the issues of high PAPR, poor frequency domain flatness, and poor channel estimation performance, DMRS uses a golay sequence for generation. However, the length of the sequence generated by the golay sequence is a power of 2. Therefore, how to generate sequences of arbitrary length and improve applicability is a technical problem that those skilled in the art are currently solving. Summary of the Invention

[0006] This application proposes a sequence generation method and apparatus that can generate sequences of arbitrary length, thereby improving applicability.

[0007] In a first aspect, embodiments of this application provide a sequence generation method. This method can be applied to a terminal device, including execution by the terminal device, execution by components in the terminal device (e.g., processor, chip, circuit, or chip system), or execution by a logic module or software capable of implementing all or part of the terminal device's functions. The method includes: determining a first sequence pair based on the base size of the sequence, the first sequence pair including a first sequence and a second sequence; performing a first processing on the first sequence in the first sequence pair to determine a third sequence in a target sequence pair; and performing a first processing on the second sequence in the first sequence pair to determine a fourth sequence in the target sequence pair, wherein the index of the position where the first processing is performed on the first sequence is the same as the index of the position where the first processing is performed on the second sequence, and the rules for performing the first processing on the first sequence are the same as the rules for performing the first processing on the second sequence.

[0008] In the above method, the lengths of the first and second sequences in the first sequence pair can be powers of 2. The third and fourth sequences are determined by performing a first process on the first and second sequences, which includes expansion or truncation. The lengths of the third and fourth sequences are arbitrary. Therefore, this method can generate sequences of arbitrary length, has higher applicability, and makes its application range wider.

[0009] In one possible implementation, the base size of the sequence is determined based on the size of the scheduled frequency domain resources and / or the density of the reference signal.

[0010] For example, the reference signal may include a demodulated reference signal, a probe reference signal, or a random access signal transmitted in a physical random access channel. The reference signal is associated with a first sequence pair used to generate the reference signal.

[0011] The above method enables the rational allocation of resources.

[0012] In another possible implementation, the method further includes receiving first indication information, which indicates the base size of the sequence. Optionally, the first indication information may be explicit or implicit.

[0013] In another possible implementation, the first processing of the first sequence in the first sequence pair to determine the third sequence in the target sequence pair and the first processing of the second sequence in the first sequence pair to determine the fourth sequence in the target sequence pair include: expanding the first sequence to determine the third sequence; expanding the second sequence to determine the fourth sequence; the first processing of the first sequence in the first sequence pair to determine the third sequence in the target sequence pair and the first processing of the second sequence in the first sequence pair to determine the fourth sequence in the target sequence pair includes: truncating the first sequence to determine the third sequence; truncating the second sequence to determine the fourth sequence.

[0014] In the above method, by expanding or truncating the first sequence pair to determine the target sequence pair, sequences of arbitrary length can be generated, which has higher adaptability and a wider range of applications.

[0015] In another possible implementation, the extension of the first sequence to determine the third sequence and the extension of the second sequence to determine the fourth sequence include: copying a first portion of the sequence from the first sequence to a first position in the first sequence to determine the third sequence, the position of the first portion of the sequence being determined by a first set of indices; copying a second portion of the sequence from the second sequence to a second position in the second sequence to determine the fourth sequence, the position of the second portion of the sequence being determined by a second set of indices; wherein the first set of indices includes the same indices as the second set of indices, and the first position and the second position are the same.

[0016] Optionally, the first index set may include consecutive or non-consecutive indices, and the second index set may include consecutive or non-consecutive indices.

[0017] In the above method, the length of the first sequence pair is relatively short. By expanding the first sequence pair to determine the target sequence pair, sequences of arbitrary length can be generated, which has higher adaptability and a wider range of applications.

[0018] In another possible implementation, the first position includes one or more of the following: the beginning of the first sequence, the end of the first sequence, the two sides of the first sequence, or other positions in the first sequence other than the beginning, the end, and the two sides; the second position includes one or more of the following: the beginning of the second sequence, the end of the second sequence, the two sides of the second sequence, or other positions in the second sequence other than the beginning, the end, and the two sides.

[0019] In another possible implementation, the truncating of the first sequence to determine the third sequence and the truncating of the second sequence to determine the fourth sequence includes: truncating a third portion of the first sequence to determine the third sequence, the position of which is determined by a third set of indices; truncating a fourth portion of the second sequence to determine the fourth sequence, the position of which is determined by a fourth set of indices; wherein the indices included in the third set of indices are the same as those included in the fourth set of indices.

[0020] Optionally, the third index set may include consecutive or non-consecutive indices, and the fourth index set may include consecutive or non-consecutive indices.

[0021] In the above method, the length of the first sequence pair is relatively long. By truncating the first sequence pair to determine the target sequence pair, sequences of arbitrary length can be generated, which has higher adaptability and a wider range of applications.

[0022] In another possible implementation, the position of the third part sequence includes one or more of the following: the beginning of the first sequence, the end of the first sequence, the two sides of the first sequence, or other positions in the first sequence other than the beginning, the end, and the two sides; the position of the fourth part sequence includes one or more of the following: the beginning of the second sequence, the end of the second sequence, the two sides of the second sequence, or other positions in the second sequence other than the beginning, the end, and the two sides.

[0023] In another possible implementation, the method further includes: if the length of the first part sequence is less than the length of the third part sequence, and / or the length of the second part sequence is less than the length of the fourth part sequence, determining to extend the first sequence to determine the third sequence and to extend the second sequence to determine the fourth sequence; if the length of the first part sequence is greater than the length of the third part sequence, and / or the length of the second part sequence is greater than the length of the fourth part sequence, determining to truncate the first sequence to determine the third sequence and to truncate the second sequence to determine the fourth sequence.

[0024] Optionally, if the length of the first part sequence is equal to the length of the third part sequence, and / or the length of the second part sequence is equal to the length of the fourth part sequence, determine to extend the first sequence to determine the third sequence and extend the second sequence to determine the fourth sequence, or determine to truncate the first sequence to determine the third sequence and truncate the second sequence to determine the fourth sequence.

[0025] The above process can be understood as follows: when the length of the extended sequence is less than the length of the truncated sequence, the extension method is selected to generate the target sequence pair; when the length of the extended sequence is greater than the length of the truncated sequence, the truncated method is selected to generate the target sequence pair; when the length of the extended sequence is equal to the length of the truncated sequence, either the extension or truncated method is selected to generate the target sequence pair.

[0026] In the above method, by selecting a shorter length for generating target sequence pairs through expansion or truncation, the variation in peak-to-average signal-to-noise ratio (PSNR) can be smaller, which is beneficial for matching the PNR of the reference signal and the data, resulting in better coverage performance.

[0027] In another possible implementation, the method further includes: defaulting to expanding the first sequence to determine the third sequence, and expanding the second sequence to determine the fourth sequence. In this way, generating shorter first sequence pairs is less complex than generating longer first sequence pairs.

[0028] In another possible implementation, the method further includes: receiving second indication information, the second indication information being used to indicate the length information of the first part sequence and / or the second part sequence, or the length information of the third part sequence and / or the fourth part sequence.

[0029] In the above method, the target sequence pair can be determined more quickly by expanding or truncating the first sequence pair based on the length information of the first part sequence and / or the second part sequence, or the length information of the third part sequence and / or the fourth part sequence, thereby reducing time consumption and latency.

[0030] In yet another possible implementation, this first processing occurs before or after the Fourier transform.

[0031] In the above method, when the first processing is performed after the Fourier transform, the frequency domain stationarity of the reference sequence mapping symbols is better.

[0032] In another possible implementation, the method further includes: the receiving terminal device receiving fifth indication information, the fifth indication information being used to indicate the type of the reference signal and the port number corresponding to the reference signal. For example, the type of the reference signal may include a demodulation reference signal, a probe reference signal, or a random access signal transmitted in a physical random access channel. For example, when the type of the reference signal is a demodulation reference signal, for example, the type of the reference signal includes a two-symbol demodulation reference signal of type 1 (Type 1) or a two-symbol demodulation reference signal of type 2 (Type 2).

[0033] In another possible implementation, the method further includes receiving third indication information for indicating a Gray sequence for determining the first sequence pair.

[0034] In the above method, determining the first sequence pair through the Gray sequence can ensure a low peak-to-average power ratio, improve the signal coverage area, and ensure frequency domain flatness.

[0035] In another possible implementation, the method further includes: receiving fourth indication information for indicating a first permutation combination, which is one of the permutation combinations corresponding to the base size of the sequence, the first permutation combination being used to determine the first sequence pair.

[0036] Optionally, the first permutation can be based on an absolute index value or a relative index value.

[0037] In the above method, the uniformity of the generated sequences on the transmitting and receiving sides can be guaranteed, that is, the first permutation and combination are selected to generate the first sequence pair. The further indication method is simple and has low overhead.

[0038] In another possible implementation, the fourth indication information is used to indicate index value information, which in turn indicates a first rule for determining the first permutation and combination.

[0039] In the above method, the uniformity of the generated sequences on the transmitting and receiving sides can be guaranteed, that is, the first permutation and combination are selected to generate the first sequence pair. The further indication method is simple and has low overhead.

[0040] In another possible implementation, the first rule includes one or more of the following: all ascending order, all descending order, pairwise summation fixed and ascending order, pairwise summation fixed and descending order, even numbers first then odd numbers, or odd numbers first then even numbers.

[0041] In another possible implementation, the fourth indication information is used to indicate the root value of the permutation, which is used to determine the first permutation combination.

[0042] In the above method, the uniformity of the generated sequences on the transmitting and receiving sides can be guaranteed, that is, the first permutation and combination are selected to generate the first sequence pair. The further indication method is simple and has low overhead.

[0043] Secondly, embodiments of this application provide a sequence generation method. This method can be applied to a network device, including execution by the network device itself, execution by components within the network device (e.g., processors, chips, circuits, or chip systems), or execution by a logic module or software capable of implementing all or part of the network device's functions. The method includes: determining a first sequence pair based on the base size of the sequence, the first sequence pair including a first sequence and a second sequence; performing a first processing on the first sequence in the first sequence pair to determine a third sequence in a target sequence pair; and performing a first processing on the second sequence in the first sequence pair to determine a fourth sequence in the target sequence pair, wherein the index of the position where the first processing is performed on the first sequence is the same as the index of the position where the first processing is performed on the second sequence, and the rules for performing the first processing on the first sequence are the same as the rules for performing the first processing on the second sequence.

[0044] In one possible implementation, the base size of the sequence is determined based on the size of the scheduled frequency domain resources and / or the density of the reference signal.

[0045] In another possible implementation, the method further includes sending a first indication message, which indicates the base size of the sequence.

[0046] In another possible implementation, the first processing of the first sequence in the first sequence pair to determine the third sequence in the target sequence pair and the first processing of the second sequence in the first sequence pair to determine the fourth sequence in the target sequence pair include: expanding the first sequence to determine the third sequence; expanding the second sequence to determine the fourth sequence; the first processing of the first sequence in the first sequence pair to determine the third sequence in the target sequence pair and the first processing of the second sequence in the first sequence pair to determine the fourth sequence in the target sequence pair includes: truncating the first sequence to determine the third sequence; truncating the second sequence to determine the fourth sequence.

[0047] In another possible implementation, the extension of the first sequence to determine the third sequence and the extension of the second sequence to determine the fourth sequence include: copying a first portion of the sequence from the first sequence to a first position in the first sequence to determine the third sequence, the position of the first portion of the sequence being determined by a first set of indices; copying a second portion of the sequence from the second sequence to a second position in the second sequence to determine the fourth sequence, the position of the second portion of the sequence being determined by a second set of indices; wherein the first set of indices includes the same indices as the second set of indices, and the first position and the second position are the same.

[0048] In another possible implementation, the first position includes one or more of the following: the beginning of the first sequence, the end of the first sequence, the two sides of the first sequence, or other positions in the first sequence other than the beginning, the end, and the two sides; the second position includes one or more of the following: the beginning of the second sequence, the end of the second sequence, the two sides of the second sequence, or other positions in the second sequence other than the beginning, the end, and the two sides.

[0049] In another possible implementation, the truncating of the first sequence to determine the third sequence and the truncating of the second sequence to determine the fourth sequence includes: truncating a third portion of the first sequence to determine the third sequence, the position of which is determined by a third set of indices; truncating a fourth portion of the second sequence to determine the fourth sequence, the position of which is determined by a fourth set of indices; wherein the indices included in the third set of indices are the same as those included in the fourth set of indices.

[0050] In another possible implementation, the method further includes: if the length of the first part sequence is less than the length of the third part sequence, and / or the length of the second part sequence is less than the length of the fourth part sequence, determining to extend the first sequence to determine the third sequence and to extend the second sequence to determine the fourth sequence; if the length of the first part sequence is greater than the length of the third part sequence, and / or the length of the second part sequence is greater than the length of the fourth part sequence, determining to truncate the first sequence to determine the third sequence and to truncate the second sequence to determine the fourth sequence.

[0051] In another possible implementation, the method further includes: sending second indication information, the second indication information being used to indicate the length information of the first part sequence and / or the second part sequence, or the length information of the third part sequence and / or the fourth part sequence.

[0052] In yet another possible implementation, this first processing occurs before or after the Fourier transform.

[0053] In another possible implementation, the method further includes sending a third indication message for indicating a Gray sequence for determining the first sequence pair.

[0054] In another possible implementation, the method further includes: sending fourth indication information for indicating a first permutation combination, which is one of the permutation combinations corresponding to the base size of the sequence, the first permutation combination being used to determine the first sequence pair.

[0055] In another possible implementation, the fourth indication information is used to indicate index value information, which in turn indicates a first rule for determining the first permutation and combination.

[0056] In another possible implementation, the first rule includes one or more of the following: all ascending order, all descending order, pairwise summation fixed and ascending order, pairwise summation fixed and descending order, even numbers first then odd numbers, or odd numbers first then even numbers.

[0057] In another possible implementation, the fourth indication information is used to indicate the root value of the permutation, which is used to determine the first permutation combination.

[0058] For the technical effects of the second aspect or possible implementation, please refer to the introduction of the technical effects of the first aspect or corresponding implementation.

[0059] Thirdly, embodiments of this application provide a sequence generation device, which can be a terminal device, a component in the terminal device (e.g., a processor, chip, circuit, or chip system), or a logic module or software that can implement all or part of the functions of the terminal device.

[0060] In one possible implementation, the sequence generation apparatus may include modules, units, or means that correspond one-to-one with the methods / operations / steps / actions described in the first aspect. These modules, units, or means may be hardware circuits, software, or a combination of hardware circuits and software.

[0061] In one possible implementation, the sequence generation apparatus includes a processing unit and a transceiver unit. The processing unit is configured to determine a first sequence pair based on the base size of the sequence, the first sequence pair including a first sequence and a second sequence. The processing unit is further configured to perform a first processing on the first sequence in the first sequence pair to determine a third sequence in a target sequence pair, and to perform a first processing on the second sequence in the first sequence pair to determine a fourth sequence in the target sequence pair, wherein the index of the position where the first processing is performed on the first sequence is the same as the index of the position where the first processing is performed on the second sequence, and the rule for performing the first processing on the first sequence is the same as the rule for performing the first processing on the second sequence.

[0062] In one possible implementation, the base size of the sequence is determined based on the size of the scheduled frequency domain resources and / or the density of the reference signal.

[0063] In another possible implementation, the transceiver unit is configured to receive first indication information, which indicates the base size of the sequence.

[0064] In another possible implementation, the processing unit is configured to extend the first sequence to determine the third sequence; the processing unit is configured to extend the second sequence to determine the fourth sequence; the processing unit is configured to truncate the first sequence to determine the third sequence; and the processing unit is configured to truncate the second sequence to determine the fourth sequence.

[0065] In another possible implementation, the processing unit is configured to copy a first portion of the sequence in the first sequence to a first position in the first sequence to determine the third sequence, the position of which is determined by a first set of indices; the processing unit is configured to copy a second portion of the sequence in the second sequence to a second position in the second sequence to determine the fourth sequence, the position of which is determined by a second set of indices; wherein the first set of indices includes the same indices as the second set of indices, and the first position and the second position are the same.

[0066] In another possible implementation, the first position includes one or more of the following: the beginning of the first sequence, the end of the first sequence, the two sides of the first sequence, or other positions in the first sequence other than the beginning, the end, and the two sides; the second position includes one or more of the following: the beginning of the second sequence, the end of the second sequence, the two sides of the second sequence, or other positions in the second sequence other than the beginning, the end, and the two sides.

[0067] In another possible implementation, the processing unit is configured to extract a third portion of the sequence from the first sequence to determine the third sequence, the position of which is determined by a third set of indices; the processing unit is configured to extract a fourth portion of the sequence from the second sequence to determine the fourth sequence, the position of which is determined by a fourth set of indices; wherein the indices included in the third set of indices are the same as those included in the fourth set of indices.

[0068] In another possible implementation, the processing unit is further configured to determine, when the length of the first part sequence is less than the length of the third part sequence and / or the length of the second part sequence is less than the length of the fourth part sequence, to expand the first sequence to determine the third sequence and expand the second sequence to determine the fourth sequence; the processing unit is further configured to determine, when the length of the first part sequence is greater than the length of the third part sequence and / or the length of the second part sequence is greater than the length of the fourth part sequence, to determine to truncate the first sequence to determine the third sequence and truncate the second sequence to determine the fourth sequence.

[0069] In another possible implementation, the transceiver unit is further configured to receive second indication information, which indicates the length information of the first part sequence and / or the second part sequence, or the length information of the third part sequence and / or the fourth part sequence.

[0070] In yet another possible implementation, this first processing occurs before or after the Fourier transform.

[0071] In another possible implementation, the transceiver unit is also configured to receive third indication information, which indicates a Gray sequence used to determine the first sequence pair.

[0072] In another possible implementation, the transceiver unit is further configured to receive fourth indication information, which indicates a first permutation combination, which is one of the full permutation combinations corresponding to the base size of the sequence, and the first permutation combination is used to determine the first sequence pair.

[0073] In another possible implementation, the fourth indication information is used to indicate index value information, which in turn indicates a first rule for determining the first permutation and combination.

[0074] In another possible implementation, the first rule includes one or more of the following: all ascending order, all descending order, pairwise summation fixed and ascending order, pairwise summation fixed and descending order, even numbers first then odd numbers, or odd numbers first then even numbers.

[0075] In another possible implementation, the fourth indication information is used to indicate the root value of the permutation, which is used to determine the first permutation combination.

[0076] For information on the technical effects of the third aspect or possible implementation, please refer to the description of the technical effects of the first aspect or corresponding implementation.

[0077] Fourthly, embodiments of this application provide a sequence generation apparatus, which can be a network device, a component in the network device (e.g., a processor, chip, circuit, or chip system), or a logic module or software capable of implementing all or part of the functions of the network device.

[0078] In one possible implementation, the communication device may include modules, units, or means that correspond one-to-one with the methods / operations / steps / actions described in the second aspect. These modules, units, or means may be hardware circuits, software, or a combination of hardware circuits and software.

[0079] In one possible implementation, the sequence generation apparatus includes a processing unit and a transceiver unit. The processing unit is configured to determine a first sequence pair based on the base size of the sequence, the first sequence pair including a first sequence and a second sequence. The processing unit is configured to perform a first processing on the first sequence in the first sequence pair to determine a third sequence in a target sequence pair, and to perform a first processing on the second sequence in the first sequence pair to determine a fourth sequence in the target sequence pair, wherein the index of the position where the first processing is performed on the first sequence is the same as the index of the position where the first processing is performed on the second sequence, and the rule for performing the first processing on the first sequence is the same as the rule for performing the first processing on the second sequence.

[0080] In one possible implementation, the base size of the sequence is determined based on the size of the scheduled frequency domain resources and / or the density of the reference signal.

[0081] In another possible implementation, the transceiver unit is configured to send first indication information, which indicates the base size of the sequence.

[0082] In another possible implementation, the processing unit is configured to extend the first sequence to determine the third sequence; extend the second sequence to determine the fourth sequence; and truncate the first sequence to determine the third sequence and truncate the second sequence to determine the fourth sequence.

[0083] In another possible implementation, the processing unit is configured to copy a first portion of the sequence in the first sequence to a first position in the first sequence to determine the third sequence, the position of which is determined by a first set of indices; the processing unit is configured to copy a second portion of the sequence in the second sequence to a second position in the second sequence to determine the fourth sequence, the position of which is determined by a second set of indices; wherein the first set of indices includes the same indices as the second set of indices, and the first position and the second position are the same.

[0084] In another possible implementation, the first position includes one or more of the following: the beginning of the first sequence, the end of the first sequence, the two sides of the first sequence, or other positions in the first sequence other than the beginning, the end, and the two sides; the second position includes one or more of the following: the beginning of the second sequence, the end of the second sequence, the two sides of the second sequence, or other positions in the second sequence other than the beginning, the end, and the two sides.

[0085] In another possible implementation, the processing unit is configured to extract a third portion of the sequence from the first sequence to determine the third sequence, the position of which is determined by a third set of indices; the processing unit is configured to extract a fourth portion of the sequence from the second sequence to determine the fourth sequence, the position of which is determined by a fourth set of indices; wherein the indices included in the third set of indices are the same as those included in the fourth set of indices.

[0086] In another possible implementation, the processing unit is further configured to determine, when the length of the first part sequence is less than the length of the third part sequence and / or the length of the second part sequence is less than the length of the fourth part sequence, to determine to extend the first sequence to determine the third sequence and to extend the second sequence to determine the fourth sequence; the processing unit is further configured to determine to truncate the first sequence to determine the third sequence and to truncate the second sequence to determine the fourth sequence when the length of the first part sequence is greater than the length of the third part sequence and / or the length of the second part sequence is greater than the length of the fourth part sequence.

[0087] In another possible implementation, the transceiver unit is further configured to transmit second indication information, which indicates the length information of the first part sequence and / or the second part sequence, or the length information of the third part sequence and / or the fourth part sequence.

[0088] In yet another possible implementation, this first processing occurs before or after the Fourier transform.

[0089] In another possible implementation, the transceiver unit is also configured to send a third indication message, which indicates a Gray sequence used to determine the first sequence pair.

[0090] In another possible implementation, the transceiver unit is further configured to send a fourth indication information, which indicates a first permutation combination, which is one of the full permutation combinations corresponding to the base size of the sequence, and the first permutation combination is used to determine the first sequence pair.

[0091] In another possible implementation, the fourth indication information is used to indicate index value information, which in turn indicates a first rule for determining the first permutation and combination.

[0092] In another possible implementation, the first rule includes one or more of the following: all ascending order, all descending order, pairwise summation fixed and ascending order, pairwise summation fixed and descending order, even numbers first then odd numbers, or odd numbers first then even numbers.

[0093] In another possible implementation, the fourth indication information is used to indicate the root value of the permutation, which is used to determine the first permutation combination.

[0094] For the technical effects of the fourth aspect or possible implementation, please refer to the introduction of the technical effects of the second aspect or corresponding implementation.

[0095] Fifthly, embodiments of this application provide a sequence generation apparatus, which includes at least one processor and a communication interface. The at least one processor invokes a computer program or instructions stored in a memory to execute the method described in the first aspect or a possible implementation thereof.

[0096] In one possible implementation, the sequence generation apparatus further includes the memory. Optionally, the memory and processor are integrated together.

[0097] In one possible implementation, the memory is located outside the sequence generation device.

[0098] In a sixth aspect, embodiments of this application provide a sequence generation apparatus, which includes at least one processor and a communication interface. The at least one processor invokes a computer program or instructions stored in a memory to execute the method described in the second aspect or a possible implementation thereof.

[0099] In one possible implementation, the sequence generation apparatus further includes the memory. Optionally, the memory and processor are integrated together.

[0100] In one possible implementation, the memory is located outside the sequence generation device.

[0101] In a seventh aspect, embodiments of this application provide a chip device including at least one processor, the at least one processor being configured to execute computer programs or instructions to implement any of the above aspects or possible implementations of any of the above aspects.

[0102] In one possible implementation, the input of the chip device corresponds to the receiving operation in any of the above-mentioned aspects or possible implementations, and the output of the chip device corresponds to the transmitting operation in any of the above-mentioned aspects or possible implementations.

[0103] Optionally, the processor is coupled to the memory via an interface.

[0104] Optionally, the chip device may also include a memory storing computer program instructions.

[0105] Eighthly, embodiments of this application provide a computer-readable storage medium storing a computer program or instructions that, when executed on a processor, implement the methods described above.

[0106] Ninthly, embodiments of this application provide a computer program product that includes a computer program or instructions that, when executed on a processor, implement the method described in any of the above aspects.

[0107] In a tenth aspect, embodiments of this application provide a communication system, which includes: the apparatus as described in the fifth aspect and the apparatus as described in the sixth aspect. Attached Figure Description

[0108] Figure 1 is a schematic diagram of the architecture of a communication system provided in an embodiment of this application;

[0109] Figure 2 is a schematic diagram of an OFDM system implementation;

[0110] Figure 3 is a schematic diagram of PAPR for single-carrier and multi-carrier signals;

[0111] Figure 4 is a schematic diagram of the coverage range of a single-carrier waveform under different modulations;

[0112] Figure 5 is a schematic diagram of the generation process of a filter SC-QAM transmitter;

[0113] Figure 6 is a schematic diagram of a shaped filter;

[0114] Figure 7 is a schematic diagram of a DMRS Type 1 format;

[0115] Figure 8 is a schematic diagram of a DMRS Type 2 format;

[0116] Figure 9 is a schematic diagram of DMRS performance;

[0117] Figure 10 is a schematic diagram of a golay sequence pair DMRS;

[0118] Figure 11 is a schematic diagram of a sequence generation method provided in an embodiment of this application;

[0119] Figure 12 is a schematic diagram of a time-domain resource provided in an embodiment of this application;

[0120] Figures 13-15 are schematic diagrams illustrating the determination of a third sequence by extending a first sequence and the determination of a fourth sequence by extending a second sequence, according to embodiments of this application.

[0121] Figures 16-18 are schematic diagrams illustrating how to determine a third sequence by truncating a first sequence and a fourth sequence by truncating a second sequence, according to embodiments of this application.

[0122] Figure 19 is a schematic diagram of a sequence generation device provided in an embodiment of this application;

[0123] Figure 20 is a schematic diagram of another sequence generation device provided in an embodiment of this application. Detailed Implementation

[0124] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of this application, and not all of them. All other embodiments obtained by those skilled in the art based on the embodiments of this application without creative effort are within the scope of protection of this application.

[0125] References to "one embodiment" or "some embodiments" as described in this application mean that one or more embodiments of this application include a specific feature, structure, or characteristic described in connection with that embodiment. Therefore, the phrases "in one embodiment," "in some embodiments," "in other embodiments," "in still other embodiments," etc., appearing in different parts of this specification do not necessarily refer to the same embodiment, but rather mean "one or more, but not all, embodiments," unless otherwise specifically emphasized. The terms "comprising," "including," "having," and variations thereof mean "including but not limited to," unless otherwise specifically emphasized.

[0126] In the description of this application, unless otherwise stated, " / " means "or". For example, A / B can mean A or B. "And / or" in this document is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, and B alone. Furthermore, "at least one" means one or more, and "multiple" means two or more. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or multiple items. For example, at least one of a, b, or c can represent: a, b, c; a and b; a and c; b and c; or a and b and c. Where a, b, and c can be single or multiple.

[0127] It is understood that in this application, "instruction" can include direct instruction, indirect instruction, explicit instruction, and implicit instruction. When describing a certain instruction information to indicate A, it can be understood that the instruction information carries A, directly indicates A, or indirectly indicates A.

[0128] In this application, the information indicated by the instruction information is called the information to be instructed. In specific implementations, there are many ways to instruct the information to be instructed, such as, but not limited to, directly instructing the information to be instructed, such as the information to be instructed itself or its index; indirectly instructing the information to be instructed by instructing other information, where there is a relationship between the other information and the information to be instructed; or instructing only a part of the information to be instructed, while the other parts are known or pre-agreed upon. For example, the instruction of specific information can be achieved by using a pre-agreed (e.g., protocol-defined) arrangement of various pieces of information, thereby reducing instruction overhead to some extent.

[0129] The information to be instructed can be sent as a whole or divided into multiple sub-information messages, and the sending period and / or timing of these sub-information messages can be the same or different. This application does not limit the specific sending method. The sending period and / or timing of these sub-information messages can be predefined, for example, according to a protocol, or configured by the transmitting device by sending configuration information to the receiving device.

[0130] It is understood that "send" and "receive" in this application refer to the direction of signal transmission. For example, "send information to XX" can be understood as the destination of the information being XX, which can include direct transmission via the air interface or indirect transmission via the air interface from other units or modules. "Receive information from YY" can be understood as the source of the information being YY, which can include direct reception from YY via the air interface or indirect reception from YY via the air interface from other units or modules. "Send" can also be understood as the "output" of the chip interface, and "receive" can also be understood as the "input" of the chip interface.

[0131] In other words, sending and receiving can occur between devices, such as between network devices and terminal devices, or within a device, such as between components, modules, chips, software modules, or hardware modules within the device via buses, wiring, or interfaces.

[0132] It is understandable that information may undergo necessary processing, such as encoding and modulation, between the source and destination, but the destination can understand the valid information from the source. Similar statements in this application can be interpreted in a similar way and will not be elaborated further.

[0133] The communication method provided in this application can be applied to cellular communication systems related to the 3rd Generation Partnership Project (3GPP), such as 4th generation (4G) communication systems, such as Long Term Evolution (LTE) communication systems, and also to 5th generation (5G) communication systems, such as 5G New Radio (NR) communication systems, or to various future communication systems and future communication networks. The method provided in this application can also be applied to Bluetooth systems, Wireless Fidelity (WiFi) systems, LoRa systems, or vehicle-to-everything (V2X) systems, communication systems supporting the integration of multiple wireless technologies, and device-to-device (D2D) systems. The method provided in this application can also be applied to satellite communication systems, wherein the satellite communication system can be integrated with the above-mentioned communication systems. The wireless communication systems involved in this application also include, but are not limited to: narrowband Internet of Things (NB-IoT), Global System for Mobile Communications (GSM), Enhanced Data Rate for GSM Evolution (EDGE), Wideband Code Division Multiple Access (WCDMA), Code Division Multiple Access 2000 (CDMA2000), or Time Division-Synchronization Code Division Multiple Access (TD-SCDMA).

[0134] Please refer to Figure 1, which is a schematic diagram of the architecture of a communication system 100 provided in an embodiment of this application. The application scenario of this application will be described using the communication system 100 architecture shown in Figure 1 as an example. The communication system 100 includes a network device 101 and a terminal device 102. It should be understood that the communication system 100 to which the methods of the embodiments of this application can be applied may include more or fewer network devices or terminal devices. The network devices and terminal devices can be hardware, functionally divided software, or a combination of both. The network devices and terminal devices can communicate with each other through other devices or network elements. In this system, the network device 101 can transmit data with multiple terminal devices; that is, the network device 101 sends downlink data to the terminal device 102, and the terminal device 102 can also send uplink data to the network device 101. The apparatus provided in the embodiments of this application can be applied to the network device 101 or to the terminal device 102. The network device 101 can be any of the network devices described below, and the terminal device 102 can be any of the terminal devices described below. It is understood that Figure 1 only illustrates one possible communication system architecture that can be applied to the embodiments of this application. In other possible scenarios, the communication system architecture may also include other devices. It should be noted that the methods described in the embodiments of this application can be applied to the communication system shown in Figure 1.

[0135] (1) Terminal equipment, also known as user equipment (UE), mobile station (MS), mobile terminal (MT), etc., is a device that provides voice or data connectivity to a user. Specifically, it includes devices that provide voice connectivity to a user, devices that provide data connectivity to a user, or devices that provide both voice and data connectivity to a user. For example, it may include handheld devices with wireless connectivity or processing devices connected to a wireless modem. This terminal equipment can communicate with the core network via a radio access network (RAN), exchanging voice or data with the RAN, or interacting with the RAN to exchange voice and data. Currently, terminal devices can include: mobile phones, tablets, laptops, PDAs, mobile internet devices (MIDs), wearable devices (such as smartwatches, smart bracelets, pedometers, etc.), in-vehicle devices (such as cars, bicycles, electric vehicles, airplanes, ships, trains, high-speed trains, etc.), virtual reality (VR) devices, augmented reality (AR) devices, wireless terminals in industrial control, smart home devices (such as refrigerators, televisions, air conditioners, electricity meters, etc.), intelligent robots, workshop equipment, wireless terminals in autonomous driving, wireless terminals in remote surgery, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, or wireless terminals in smart homes, and flying equipment (such as intelligent robots, hot air balloons, drones, airplanes), etc. Terminal devices can also be other devices with terminal functions; for example, a terminal device can also be a device that performs terminal functions in D2D communication.Terminal devices can also include vehicle-to-everything (V2X) terminal devices, machine-to-machine / machine-type communications (M2M / MTC) terminal devices, internet of things (IoT) terminal devices, light UEs, reduced capability UEs (REDCAP UEs), subscriber units, subscriber stations, mobile stations, remote stations, access points (APs), remote terminals, access terminals, user terminals, user agents, or user devices, and drone equipment. For example, this can include mobile phones (or "cellular" phones), computers with mobile terminal devices, portable, pocket-sized, handheld, and computer-embedded mobile devices, etc. Examples include personal communication service (PCS) telephones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, and personal digital assistants (PDAs). It also includes limited devices, such as devices with low power consumption, limited storage capacity, or limited computing power. Examples include information sensing devices such as barcode scanners, radio frequency identification (RFID), sensors, global positioning systems (GPS), and laser scanners. In this application, terminal devices with wireless transceiver capabilities and chips that can be installed in the aforementioned terminal devices are collectively referred to as terminal devices.

[0136] It should be noted that the terminal device may be a device or apparatus with a chip, or a device or apparatus with integrated circuitry, or a chip, module or control unit in the device or apparatus shown above. This application does not limit the specific device.

[0137] (2) A network device is a device deployed in a radio access network to provide wireless communication functions for terminal devices. A network device may also be called an access network (RAN) entity, access node, network node, or communication device, etc.

[0138] Specifically, the network equipment can be access network equipment for cellular systems related to the 3rd Generation Partnership Project (3GPP). For example, fourth-generation (4G) mobile communication systems or 5G mobile communication systems. The network equipment can also be access network equipment in open RAN (O-RAN or ORAN) or cloud radio access network (CRAN). Alternatively, the network equipment can also be access network equipment in a communication system formed by the integration of two or more of the above communication systems.

[0139] Network equipment includes, but is not limited to: evolved Node B (eNB), radio network controller (RNC), Node B (NB), base station controller (BSC), base transceiver station (BTS), home base station (e.g., home evolved NodeB, or home Node B, HNB), baseband unit (BBU), access point (AP) in wireless fidelity (WIFI) systems, macro base station, micro base station, wireless relay node, donor node, radio controller in CRAN scenarios, wireless backhaul node, transmission point (TP), or transmission and receiving point (TRP). Network equipment can also be access network equipment in 5G mobile communication systems. For example, next-generation Node B (gNB), TRP, TP in new radio (NR) systems, or one or more antenna panels (including multiple antenna panels) of a base station in a 5G mobile communication system. Alternatively, network devices can also be network nodes constituting a gNB or transmission point. Examples include centralized units (CUs), distributed units (DUs), CU-control plane (CPs), CU-user plane (UPs), or radio units (RUs). CUs and DUs can be separate entities or included in the same network element, such as a BBU. RUs can be included in radio equipment or radio units, such as remote radio units (RRUs), active antenna units (AAUs), or remote radio heads (RRHs). Alternatively, network devices can also be servers, wearable devices, vehicles, or in-vehicle equipment. For example, in V2X technology, network devices can be roadside units (RSUs).

[0140] It should be noted that CU (or CU-CP and CU-UP), DU, or RU may have different names in different systems, but those skilled in the art will understand their meaning. For example, in an ORAN system, CU can also be called an open centralized unit (O-CU) or an open CU, DU can also be called an open distributed unit (O-DU), centralized unit control plane (CU-CP) can also be called an open centralized unit control plane (O-CU-CP) or an open CU-CP, centralized unit user plane (CU-UP) can also be called an open centralized unit user plane (O-CU-UP) or an open CU-UP, and RU can also be called an open radio unit (O-RU). This application does not impose any specific limitations. Any of the units CU, CU-CP, CU-UP, DU, and RU in this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules.

[0141] In some deployments, the CU and DU implement some of the functions of the gNB. For example, the CU implements the functions of the radio resource control (RRC) and packet data convergence protocol (PDCP) layers, while the DU implements the functions of the radio link control (RLC), media access control (MAC), and physical (PHY) layers. Since RRC layer information ultimately becomes PHY layer information, or is transformed from PHY layer information, in this architecture, higher-layer signaling, such as RRC layer signaling or PDCP layer signaling, can also be considered to be sent by the DU, or by the DU+RU. It is understood that network devices can be CU nodes, DU nodes, or devices including both CU and DU nodes. Furthermore, the CU can be classified as a network device in the access network (RAN) or a network device in the core network (CN); no restrictions are placed here.

[0142] Optionally, network equipment can also be core network equipment. Core network equipment is responsible for access control, registration management, service management, mobility management, etc., of terminal equipment accessing the network. For example, core network equipment may be an authentication management function (AMF) network element, a user plane function (UPF) network element, a session management function (SMF) network element, or a policy control function (PCF) network element.

[0143] It should be noted that the network device can be the device or apparatus shown above, or a component (e.g., a chip), module, or unit in the device or apparatus shown above; this application does not limit the specifics.

[0144] To better understand the solutions provided in the embodiments of this application, some terms, concepts or processes involved in the embodiments of this application will be introduced below.

[0145] I. Orthogonal Frequency Division Multiplexing (OFDM) Technology

[0146] Please refer to Figure 2, which is a schematic diagram of an OFDM system implementation. The transmitting end can convert M consecutive data symbols into an M-dimensional data block S through serial-to-parallel (S-to-P) conversion. k =[S k [0],S k [1],…,S k [M-1] T The subscript k is the symbol number for orthogonal frequency division multiplexing (OFDM), and the superscript T indicates matrix transpose. Then, subcarrier mapping is performed, specifically referring to S... k The M data carried are modulated on M subcarriers out of N subcarriers, or in other words, S is carried on M subcarriers out of N subcarriers. k The data carries M data vectors, and the remaining (NM) subcarriers can be understood as being modulated by 0. N-dimensional data vector x k A set of N complex time-domain sampling points x is obtained by performing an N-point inverse discrete fourier transform (IDFT). k =[x k [0],x k [1],…,x k [N-1] TThen, a parallel-to-serial (P-to-S) conversion is performed, followed by the addition of a cyclic prefix (CP). Adding a CP at the beginning of each OFDM symbol creates a guard domain, thereby eliminating inter-symbol interference (ISI) caused by multipath propagation. The specific implementation of adding a CP involves copying x... k The last G sampled values ​​and appended to x k At the beginning, the time-domain OFDM signal is obtained. Therefore, an OFDM symbol contains valid data x k And a cyclic prefix (redundant data). Finally, the OFDM signal is converted by a digital-to-analog converter (DAC) and an RF module before being transmitted through the antenna. Correspondingly, demodulation is performed at the receiving end through inverse processing, which will not be described in detail here.

[0147] OFDM waveforms are multi-carrier waveforms. OFDM waveforms can convert high-speed data streams into multiple parallel low-speed data streams through serial-to-parallel conversion, and then distribute them to sub-channels on several subcarriers of different frequencies for transmission, thus greatly improving spectral efficiency. However, they have a high peak-to-average power ratio (PAPR). The output of a multi-carrier system is the superposition of multiple sub-channel signals. Therefore, if the multiple signals are in phase, the instantaneous power of the resulting superimposed signal will be much higher than the average power of the signals, leading to a large PAPR. This places high demands on the linearity of the amplifiers within the transmitter, which may cause signal distortion, altering the signal spectrum and disrupting the orthogonality between the sub-channels, generating interference and degrading system performance.

[0148] II. Orthogonal Frequency Division Multiplexing of Discrete Fourier Transform Spread Spectrum

[0149] Discrete Fourier transform-spreading-orthogonal frequency division multiplexing (DFT-s-OFDM) defines the data blocks s transmitted in the time domain. k Before the OFDM processing, there is an additional Discrete Fourier Transform (DFT) process, which is performed on each data block s containing M data points. kPerform an M-point DFT operation. This operation gives the DFT-s-OFDM signal the characteristics of a single carrier, resulting in a significantly lower PAPR (Power Amplitude Reduction) than multi-carrier signals such as OFDM. Refer to Figure 3, which illustrates the PAPR of single-carrier and multi-carrier signals. As shown in the figure, with the same power amplifier, DFT-s-OFDM can provide greater output power and higher power amplifier efficiency, thereby improving coverage and reducing power consumption. The coverage and power consumption advantages of DFT-s-OFDM are particularly evident on the terminal equipment side, where it can be applied to uplink transmission.

[0150] The coverage and power consumption advantages of single-carrier waveforms are particularly evident on the terminal device side, and they are mainly used for uplink transmission. For single-carrier signals, as the modulation order increases, the corresponding PAPR also increases, and the coverage range decreases accordingly, as shown in Figure 4. Figure 4 is a schematic diagram of the coverage range of a single-carrier waveform under different modulations. Therefore, for edge coverage scenarios, low-order modulation signals are generally used.

[0151] III. Cyclic Prefix Orthogonal Frequency Division Multiplexing

[0152] DFT-s-OFDM is a variant of cyclic prefix-orthogonal frequency division multiplexing (CP-OFDM). CP-OFDM maps the modulated symbols onto frequency-domain subcarriers, then performs an inverse Fourier transform to convert the frequency-domain signal into a time-domain signal, and finally adds a cyclic prefix to obtain the transmitted signal. DFT-s-OFDM performs a discrete Fourier transform on a certain number of modulated symbols, converts them to the frequency domain, then filters or maps the frequency-domain signal directly onto frequency-domain subcarriers, performs an inverse discrete Fourier transform to convert the frequency-domain signal into a time-domain signal, and finally adds a cyclic prefix to obtain the transmitted signal.

[0153] IV. Filtered Single-Carrier Quadrature Amplitude Modulation

[0154] Filtered Single Carrier Quadrature Amplitude Modulation (filter SC-QAM) is compatible with existing single-carrier receivers. Besides its advantages of generating large-bandwidth signals with low complexity, its PAPR is also lower than that of ordinary single-carrier waveforms, making it promising for applications in extreme coverage scenarios. Please refer to Figure 5, which is a schematic diagram of the generation process of a filter SC-QAM transmitter.

[0155] Channel coding (such as polar or LDPC) outputs 0 and 1 information bits. These bits serve as input to the complex modulation symbols. After passing through the modulator, modulation symbols are generated. To maximize coverage gains in large bandwidth applications, pi / 2-binary phase shift keying (BPSK) modulation is generally used.

[0156] Intra-symbol CP addition: This refers to adding several modulation symbols before each equivalent OFDM symbol. Similar to the CP properties of traditional OFDM signals, the signal with added CP can effectively protect against inter-symbol ISI after passing through a multipath delay-spreading channel. The CP length added to the time-domain generated signal, after upsampling and possible downsampling, is the same as the CP length of the signal generated based on the Fast Fourier Transform (FFT), facilitating uniform CP removal at the receiver. The required CP length needs to be calculated based on the upsampling and downsampling rates.

[0157] Upsampling and downsampling: Upsampling involves inserting zeros directly between two original signals. Downsampling is the opposite of upsampling, specifically involving decimating the signal at equal intervals. OFDM time-domain signals are essentially synthesized signals with a sampling rate related to the number of FFT points. The single-carrier signal generated in the time domain must match the OFDM sampling rate to achieve unified reception at the receiving end. Furthermore, since the main purpose of downsampling is to reduce the symbol rate of the signal to the same level as OFDM (based on FFT), downsampling is an optional step. When the symbol rate of the upsampled signal after convolutional filtering equals the symbol rate of the FFT sampling, downsampling is unnecessary, or the downsampling rate can be considered equal to 1.

[0158] Pulse shaping filtering: Pulse shaping filtering uses a root-square raise cosine (RRC) filter with a certain spread factor (or roll-off factor, roll-off coefficient). The choice of spread factor is related to the actual amount of data to be transmitted and the allocated frequency domain bandwidth. Please refer to Figure 6, which is a schematic diagram of shaping filtering. If the amount of data transmitted (number of modulation symbols) is N, and the frequency domain resources with increased power after shaping are M (number of OFDM subcarriers or resource elements), then the roll-off factor can be calculated as: β = (NM) / M;

[0159] Besides the RRC filter, other filter functions can be used to achieve the same processing. Using different filters will affect (improve or worsen) PAPR, out-of-band power, error vector magnitude (EVM), block error ratio (BLER), and other performance characteristics. For the receiver, the filter response can be considered part of the channel response. As long as the pilot signal and data signal undergo the same processing, the receiver can eliminate the filter's influence during channel estimation and equalization. Utilizing the characteristics of Fourier transform and pi / 2-BPSK modulation, the filter's roll-off factor can be set to 1 to obtain the optimal PAPR gain, while simultaneously achieving perfect signal recovery at the receiver.

[0160] Table 1 shows a schematic diagram of the parameters of filter SC-QAM under different upsampling rates K and downsampling rates L.

[0161] Table 1

[0162] V. Demodulation Reference Signal

[0163] The demodulation reference signal (DMRS) is a reference signal used by the receiver for equivalent channel estimation. It is used to estimate the data channel. Taking the above as an example, it is generally divided into Physical Uplink Shared Channel (PUSCH) DMRS and Physical Uplink Control Channel (PUCCH) DMRS. The protocol specifies two main formats for DMRS: Type 1 DMRS and Type 2 DMRS. Type 1 DMRS has a frequency density of 1 / 2, with single-symbol Type 1 DMRS antenna port numbers from port 0 to port 3, and double-symbol Type 1 DMRS antenna port numbers from port 0 to port 7. Type 2 DMRS has a frequency density of 1 / 3, with single-symbol Type 2 DMRS antenna port numbers from port 0 to port 5, and double-symbol Type 2 DMRS antenna port numbers from port 0 to port 11.

[0164] For a single-symbol Type 1 DMRS, a maximum of 4 ports are supported, with antenna port numbers from port0 to port3, as shown in Figure 7(a). The 4 DMRS ports are divided into 2 code division multiplexing groups (CDM groups), where CDM group 0 contains port 0 and port 1; CDM group 1 contains port 2 and port 3. CDM group 0 and CDM group 1 are frequency division multiplexed (mapped to different frequency domain resources). The DMRS ports contained within a CDM group are mapped to the same time-frequency resources. The reference signals corresponding to the DMRS ports contained within a CDM group are distinguished by orthogonal cover codes (OCC), thereby ensuring the orthogonality of the DMRS ports within the CDM group and suppressing interference between DMRS transmitted on different antenna ports. Specifically, port 0 and port 1 are located within the same resource particles (REs) and are mapped in the frequency domain in a comb-like manner, that is, the adjacent frequency domain resources occupied by port 0 and port 1 are separated by a subcarrier. For a DMRS port, the two adjacent resource elements (REs) occupied correspond to a single OCC codeword sequence of length 2. For example, for subcarrier 0 and subcarrier 2, port 0 and port 1 use a set of OCC codeword sequences of length 2 (+1+1 and +1-1). Similarly, port 2 and port 3 lie within the same resource element (RE) and are mapped in the frequency domain in a comb-like manner onto the unoccupied REs of port 0 and port 1. For subcarrier 1 and subcarrier 3, port 2 and port 3 use a set of OCC codeword sequences of length 2 (+1+1 and +1-1).

[0165] For dual-symbol Type 1 DMRS, a maximum of 8 ports are supported, with antenna port numbers from port 0 to port 7, as shown in Figure 7(b). The 8 DMRS ports are divided into two code division multiplexing (CDM) groups: CDM group 0 includes ports 0, 1, 4, and 5; CDM group 1 includes ports 2, 3, 6, and 7. CDM group 0 and CDM group 1 are frequency division multiplexing groups. The reference signals corresponding to the DMRS ports within a CDM group are distinguished by OCC (Optical Code Classification). Specifically, ports 0, 1, 4, and 5 are located within the same resource element (RE), and resource mapping in the frequency domain is performed in a comb-like manner, meaning that adjacent frequency domain resources occupied by ports 0, 1, 4, and 5 are separated by a subcarrier. For a single DMRS port, the two adjacent subcarriers and two OFDM symbols occupying the port correspond to an OCC codeword sequence of length 4. For example, for subcarriers 0 and 2 corresponding to OFDM symbols 1 and 2, ports 0, 1, 4, and 5 use a set of OCC codes of length 4 (+1+1+1+1 / +1+1-1-1 / +1-1+1-1 / +1-1-1+1). Similarly, ports 2, 3, 6, and 7 are located within the same resource particles (REs) and are mapped in the frequency domain in a comb-like manner onto the unoccupied subcarriers of ports 0, 1, 4, and 5. For subcarriers 1 and 3 corresponding to OFDM symbols 1 and 2, ports 2, 3, 6, and 7 use a set of OCC codes of length 4 (+1+1+1+1 / +1+1-1-1 / +1-1+1-1 / +1-1-1+1).

[0166] For a single-symbol Type 2 DMRS, a maximum of 6 ports are supported, with antenna port numbers from port0 to port5, as shown in Figure 8(a). The 6 DMRS ports are divided into 3 code division multiplexing groups (CDM groups). Frequency division multiplexing is used between CDM groups, and the reference signals corresponding to the DMRS ports contained within a CDM are guaranteed to be orthogonal through OCC. CDM group 0 contains port 0 and port 1; CDM group 1 contains port 2 and port 3; and CDM group 2 contains port 4 and port 5. Frequency division multiplexing is used between CDM groups (mapped to different frequency domain resources). The reference signals corresponding to the DMRS ports contained within a CDM group are mapped to the same time-frequency resources. The reference signals corresponding to the DMRS ports contained within a CDM group are distinguished by OCC. For a DMRS port, its corresponding DMRS reference signal is mapped in the frequency domain into multiple resource sub-blocks containing two consecutive subcarriers, with adjacent resource sub-blocks spaced 4 subcarriers apart in the frequency domain. Specifically, port 0 and port 1 are located within the same resource particle (RE) and are mapped in a comb-like manner. Taking a frequency domain resource granularity of 1 RB as an example, port 0 and port 1 occupy subcarriers 0, 1, 6, and 7. Port 2 and port 3 occupy subcarriers 2, 3, 8, and 9. Port 4 and port 5 occupy subcarriers 4, 5, 10, and 11. For two DMRS ports contained within a CDM group, there are corresponding OCC codeword sequences of length 2 (+1+1 and +1-1) within two adjacent subcarriers.

[0167] For dual-symbol Type 2 DMRS, a maximum of 12 ports are supported, with antenna port numbers ranging from port0 to port11, as shown in Figure 8(b). The 12 DMRS ports are divided into three CDM groups. Frequency division multiplexing is used between CDM groups, and the reference signals corresponding to the DMRS ports within a CDM group are ensured orthogonality through OCC. Specifically, CDM group 0 includes ports 0, 1, 6, and 7; CDM group 1 includes ports 2, 3, 8, and 9; and CDM group 2 includes ports 4, 5, 10, and 11. Frequency division multiplexing is used between CDM groups (mapped to different frequency domain resources). The reference signals corresponding to the DMRS ports within a CDM group are mapped to the same time-frequency resources. The reference signals corresponding to the DMRS ports within a CDM group are distinguished through OCC. For a DMRS port, its corresponding DMRS reference signal is mapped in the frequency domain into multiple resource sub-blocks containing two consecutive subcarriers, with adjacent resource sub-blocks spaced four subcarriers apart in the frequency domain. Specifically, ports within a CDM group are located within the same resource particles (REs) and are mapped in the frequency domain in a comb-like manner. Taking a frequency domain resource granularity of 1 RB as an example, ports 0, 1, 6, and 7 occupy subcarriers 0, 1, 6, and 7 corresponding to OFDM symbols 1 and 2. Ports 2, 3, 8, and 9 occupy subcarriers 2, 3, 8, and 9 corresponding to OFDM symbols 1 and 2. Ports 4, 5, 10, and 11 occupy subcarriers 4, 5, 10, and 11 corresponding to OFDM symbols 1 and 2. For a CDM group containing 4 DMRS ports, there is an OCC codeword sequence of length 4 in the two adjacent subcarriers corresponding to the 2 OFDM symbols (+1+1+1+1 / +1+1-1-1 / +1-1+1-1 / +1-1-1+1).

[0168] In addition to DMRS type, the protocol also specifies the DMRS sequence type used under different waveforms.

[0169] For CP-OFDM waveforms, DMRS is generated using a pseudo-random sequence—the gold sequence. The nth element in the reference signal sequence can be generated using the following formula:

[0170] Wherein, the pseudo-random sequence c(n) can be a gold sequence of length 31, for an output length of M PN The sequence c(n), n = 0, 1, ..., M PN -1 can be defined as: c(n)=(x1(n+N) c )+x2(n+N c ))mod 2; x1(n+31)=(x1(n+3)+x1(n))mod 2;

[0171] Where, N C =1600. The first m-sequence x1(n) can be initialized as x1(0) = 1, x1(n) = 0, n = 1, 2, ..., 30. The second m-sequence x2(n) is determined by the parameter c. init Initialization. init It can be defined as:

[0172] Here, l represents the OFDM symbol index contained within a time slot. This represents a slot index within a system frame. It can be configured via higher-level signaling. It is related to the cell ID (identification) and can usually be equal to the cell ID. This is an initialization parameter; its value can be 0 or 1.

[0173] For DFT-s-OFDM waveforms, DMRS uses two types of sequences.

[0174] Category 1: When using non-pi / 2BPSK modulation, DMRS is generated using the zc sequence, and its generation method is as follows: r u,v (n)=s q (n mod N ZC ), n=0,1,…,M ZC -1;

[0175] Among them, M ZC N is the sequence length. ZC It is no more than M ZC The largest prime number, q, is determined by the group number u and the sequence number v.

[0176] The second type: When using pi / 2BPSK modulation, the DMRS is generated using a gold sequence. Similar to CP-OFDM, a gold sequence c(n) consisting of 0 and 1 bits is generated, which is then mapped to a pi / 2BPSK modulated DMRS sequence, as shown in the following formula:

[0177] For CP-OFDM, the DMRS is generated using a pseudo-random sequence, the gold sequence. This results in a high PAPR (Power Amplitude Reduction), making it difficult to match the data's PAPR (Proportional Amplitude Reduction). See Figure 9(a), which illustrates the PAPR of a DMRS. An excessively high PAPR can cause numerous problems. For instance, if the peak power of the signal is not set correctly, the signal may enter the nonlinear operating region of the power amplifier (PA), leading to signal and spectral spread or spectral regeneration. Spectral regeneration can cause inter-carrier interference, increasing the bit error rate. To avoid or mitigate these problems, in practical applications, PA input power backoff or output power backoff is typically implemented. However, PA input power backoff or PA output power backoff reduces cell coverage. For DFT-s-OFDM, the DMRS is generated using a gold sequence. Since the gold sequence has poor frequency domain flatness, it can degrade channel estimation. See Figure 9(b), which illustrates the frequency domain response of a DMRS.

[0178] To address the issues of high PAPR, poor frequency domain flatness, and poor channel estimation performance, DMRS uses golay sequences for generation. See Figure 10, which illustrates a golay sequence pair DMRS. Golay sequences are complementary sequence pairs with low PAPR, transmitted using two symbols in DMRS. Because the sequence pairs are complementary, the frequency domain is completely flat. However, the sequence length generated by golay sequences is a power of 2. Therefore, how to generate sequences of arbitrary length while ensuring low PAPR and frequency domain flatness is a technical problem currently being solved by those skilled in the art.

[0179] Please refer to Figure 11, which is a schematic diagram of a sequence generation method provided in an embodiment of this application. The method includes, but is not limited to, the following steps:

[0180] Step S1101: The terminal device determines the first sequence pair based on the base size of the sequence.

[0181] The first sequence pair includes a first sequence and a second sequence. The lengths of the first sequence and the second sequence are equal. For example, the basis size of the sequences is m, and the lengths of the first and second sequences in the first sequence pair are N = 2m.

[0182] The base size of the sequence is determined based on the size of the scheduled frequency domain resources and / or the density of the reference signal. This allows for reasonable resource allocation. In one possible implementation, the terminal device receives first indication information indicating the base size of the sequence. This first indication information can be an explicit or implicit indication. Optionally, the terminal device receiving the first indication information may include receiving first indication information from a network device.

[0183] The size of the scheduled frequency domain resources can be determined by the resources indicated in the downlink control information (DCI) or system information block 1 (SIB1), or by the resources configured through static signaling, such as those configured through higher-layer signaling. For example, higher-layer signaling may include RRC signaling or a medium access control (MAC) control element (CE). The size of the scheduled frequency domain resources can refer to the number of resource blocks (RBs) or resource elements (REs).

[0184] The reference signal may include a demodulation reference signal (DMRS), a sounding reference signal (SRS), or a random access signal transmitted in a physical random access channel (PRACH). For example, when the reference signal is a DMRS, such as a two-symbol Type 1 DMRS, the density of the reference signal can be 1 / 2; for example, when it is a two-symbol Type 2 DMRS, the density of the reference signal can be 1 / 3. This reference signal is associated with a first sequence pair, which, for example, is used to generate the reference signal.

[0185] In one example, the basis size of the sequence is determined based on the size of the scheduled frequency domain resources and the density of the reference signal; for example, the size of the scheduled frequency domain resources is n. PRB n PRB The number of RBs is indicated, the reference signal is a double-symbol Type 1 DMRS, the density of the reference signal can be 1 / 2, and in one possible implementation, the basis size of the sequence is... in This indicates rounding down; in another possible implementation, the base size of the sequence. in This indicates rounding up to the nearest integer.

[0186] In one possible implementation, the method further includes: the terminal device receiving third instruction information.

[0187] In this process, the terminal device receives third instruction information from the network device.

[0188] The third indication information is used to indicate a Gray sequence, which is used to determine the first sequence pair. The sequence type of the reference signal corresponding to the first sequence pair can also be associated with the waveform and / or modulation scheme. For example, when the reference signal is DMRS, the sequence type of DMRS can also be related to the waveform and / or modulation scheme. In one example, when the network device indicates the use of filter SC-QAM waveform and / or modulation scheme pi / 2BPSK, the terminal device determines the first sequence pair based on the Gray sequence by default. It should be noted that this application uses pi / 2BPSK modulation scheme as an example for illustration, but 4-pulse amplitude modulation (PAM), 8PAM, 16PAM, and 32PAM modulation schemes can also be used, and the embodiments of this application are not limited to this.

[0189] In the above method, determining the first sequence pair through the Gray sequence can ensure a low peak-to-average power ratio and frequency domain flatness.

[0190] In another possible implementation, the method further includes: the terminal device receiving fifth indication information, which is used to indicate the type of the reference signal and the port number corresponding to the reference signal.

[0191] The reference signal type can include DMRS, SRS, or random access signals transmitted in PRACH. When the reference signal is DMRS, the reference signal type can also include Type 1 double-symbol DMRS or Type 2 double-symbol DMRS. Specifically, the port number corresponding to Type 1 double-symbol DMRS is any one of port 0 to port 7, and the port number corresponding to Type 2 double-symbol DMRS is any one of port 0 to port 11.

[0192] The following example illustrates how to generate a first sequence x and a second sequence y of length N = 2m based on the basis size of the sequences. The first sequence x and the second sequence y are Gray sequences.

[0193] Step 1: Input sequence length N, generate N integers 0, 1, 2, ..., N-1, convert all N integers into m-bit binary numbers, denoted as S[0], S[1], ..., S[N-1], and record each bit in S[0], S[1], ..., S[N-1] as s1, s2, s3, ..., s m .

[0194] In one example, m = 3, N = 8, generate 8 integers 0, 1, 2, 3, 4, 5, 6, 7, convert these 8 integers into 3-bit binary numbers S[0], S[1], S[2], S[3], S[4], S[5], S[6], S[7], where S[0] = 000, S[1] = 001, S[2] = 010, S[3] = 011, S[4] = 400, S[5] = 101, S[6] = 110, S[7] = 111, and record each bit of S[0], S[1], ..., S[7] as s1, s2, s3.

[0195] Step 2: Generate all permutations of the sequence {1,2,…,m}, denoted as {a0,a1,…,a...}. m-1 There are m! possible permutations and combinations.

[0196] In one example, m = 3, the permutations of the sequence {1,2,3} are 3! = 6, namely {1,2,3}, {1,3,2}, {2,1,3}, {2,3,1}, {3,1,2}, and {3,2,1}.

[0197] Step 3: Select one permutation from m! possible combinations. This permutation can be called the first permutation. Calculate the first sequence x and the second sequence y using the following formula:

[0198] in It is the m-bit data after converting decimal n into binary S[n]. b(i,j) represents the generalized Boolean sum function of numbers i and j. For binary input, we have b(0,0)=0, b(0,1)=b(1,0)=1, b(1,1)=1; (x)mod2 represents the remainder of x by 2.

[0199] In one example, m = 3, and the permutations of the sequence {1,2,3} include {1,2,3}, {1,3,2}, {2,1,3}, {2,3,1}, {3,1,2}, and {3,2,1}. We select {1,2,3} to calculate the first sequence x and the second sequence y, as follows:

[0200] Since S[0]=000, the permutation and combination is {1,2,3}, then So,

[0201] Since S[1]=001, the permutation and combination is {1,2,3}, then So,

[0202] Since S[2]=010, the permutation and combination is {1,2,3}, then So,

[0203] x is determined sequentially using the methods described above. n ,y n Finally, the first sequence x = {x0, x1, x2, ..., x} was determined. n The second sequence y = {y0, y1, y2, ..., y} n}

[0204] In one possible implementation, the method further includes: the terminal device receiving fourth indication information.

[0205] The terminal device receives a fourth indication information from the network device. This fourth indication information is used to indicate a first permutation combination, which is one of the full permutation combinations corresponding to the base size of the sequence. This first permutation combination is used to determine the first sequence pair.

[0206] In one possible implementation, the first permutation is based on an absolute index value, for example, {a0, a1, ..., a...} m-1}, where ai is a random value from 0 to m-1, and these m sequences are all distinct. In one example, the first permutation is {1,2,3}. Alternatively, the first permutation is based on relative index values, such as {a0,Δ1,…,Δ}. m-1}, where Δ i Add the index value of the previous index to obtain the index value of the i-th index, or, Δ i Add the index value of the first position to the index value of the second position to obtain the index value of the i-th position, without any restrictions.

[0207] In the above method, the uniformity of the generated sequences on the transmitting and receiving sides can be guaranteed, that is, the first permutation and combination is selected to generate the first sequence pair. The further indication method is simple and has low overhead.

[0208] In another possible implementation, the fourth indication information is used to indicate the index value information, which in turn indicates the first rule. The first rule indicates the first permutation and combination, which can be understood as determining the first permutation and combination according to the first rule. The first rule includes one or more of the following: all ascending order, all reversing order, a fixed summation order for each pair and ascending order, a fixed summation order for each pair and reversing order, even numbers first then odd numbers, or odd numbers first then even numbers. For example, the first rule and index value information are shown in Table 2. Taking m=8 as an example, optionally, the first permutation and combination is all ascending or all reversing, corresponding to index value information 0 or 1 in Table 2; optionally, all permutations are performed according to fixed pairings for summation, for example, if the summation value is m-1, the first permutation and combination is determined according to ascending or descending order, corresponding to index value information 2 or 3 in Table 2. Specifically, when m is odd, the middle permutation sequence is a. (m - 1) / 2=(m-1) / 2; Optionally, the index value information in Table 2 corresponding to the first permutation and combination is 4 or 5, determined by either even numbers first and then odd numbers or odd numbers first and then even numbers.

[0209] Table 2

[0210] In the above method, the uniformity of the generated sequences on the transmitting and receiving sides can be guaranteed, that is, the first permutation and combination are selected to generate the first sequence pair. The further indication method is simple and has low overhead.

[0211] In another possible implementation, the fourth indication information is used to indicate the root value of the permutation, which is used to determine the first permutation combination. The root value of the permutation can also be agreed upon by a protocol or predefined. In one example, the root value of the permutation is c. init Satisfy the following formula, Accordingly, the terminal device determines the first permutation combination through full permutation embedding.

[0212] In the above method, the uniformity of the generated sequences on the transmitting and receiving sides can be guaranteed, that is, the first permutation and combination are selected to generate the first sequence pair. The further indication method is simple and has low overhead.

[0213] In one possible implementation, each permutation of the base size of the sequence can be used for a different antenna port, i.e., each permutation is bound to a Gray sequence pair. As one implementation, each user's permutation can be periodically switched, and the network device can send indication information including a period used for switching permutations, for example, switching at the slot / frame / millisecond (ms) level.

[0214] In this way, it can be ensured that the sequence of the reference signal is not completely fixed when the channel changes, thereby ensuring the reliability of the channel estimation performance.

[0215] In one possible implementation, the method further includes: the network device sending configuration information of a first signal to the terminal device, the configuration information including one or more of the following: time domain resources, frequency domain resources, stream number, or waveform.

[0216] The first signal is the signal carried in the PUSCH. This configuration information can also be described as resource information.

[0217] The time-domain resources include one or more of the following: system frame number, transmission time slot, OFDM symbol start position, or number of time-domain OFDM symbols; for example, the number of time-domain OFDM symbols may include the number of symbols in the DMRS. Optionally, the network device indicates the time-domain resources through the start and length indicator value (SLIV) field in the DCI. Please refer to Figure 12, which is a schematic diagram of a time-domain resource provided in an embodiment of this application, which includes a transmission time slot and an OFDM symbol start position.

[0218] The frequency domain information includes one or more of the following: the number of physical resource blocks (PRBs), bandwidth part (BWP), frequency band, serving cell ID, center frequency, and sub-carrier spacing (SCS). The serving cell ID may include a cell index. Optionally, the frequency domain information may be carried in RRC signaling, DCI, or MAC CE signaling.

[0219] The waveform can include one of the following: CP-OFDM, DFT-s-OFDM, or filter SC-QAM. When the waveform is filter SC-QAM, the network device can also configure corresponding parameter information, which includes one or more of the following: configuration index, number of data symbols (system bandwidth), roll-off factor, number of FFT points, CP length, upsampling rate, or downsampling rate. The CP length can refer to the time-domain CP length superimposed on an OFDM symbol, or it can refer to the CP length within a symbol. The upsampling rate can also be called the upsampling factor, and the downsampling rate can also be called the downsampling factor.

[0220] The flow rate can be waveform-dependent. For example, when the waveform is CP-OFDM, the flow rate can be greater than or equal to 1; when the waveform is DFT-s-OFDM or filter SC-QAM, the flow rate is equal to 1.

[0221] Step S1102: The terminal device performs a first processing on the first sequence in the first sequence pair to determine the third sequence in the target sequence pair, and performs a first processing on the second sequence in the first sequence pair to determine the fourth sequence in the target sequence pair.

[0222] In this sequence, the third and fourth sequences have equal lengths, which can be determined based on the size of the scheduled frequency domain resources and / or the density of the reference signal. A description of the size of the scheduled frequency domain resources and the density of the reference signal can be found above. In one example, the lengths of the third and fourth sequences are determined based on the size of the scheduled frequency domain resources and the density of the reference signal; for example, the size of the scheduled frequency domain resources is n. PRB n PRB The number of RBs is indicated. The reference signal is a double-symbol Type 1 DMRS. The density of the reference signal can be 1 / 2. The lengths of the third and fourth sequences are N1 = 12n. PRB / 2.

[0223] In this case, the index of the position where the terminal device performs the first processing on the first sequence is the same as the index of the position where the terminal device performs the first processing on the second sequence, and the rule for performing the first processing on the first sequence is the same as the rule for performing the first processing on the second sequence.

[0224] The following will describe two methods for determining the target sequence pair by performing a first processing step on the first sequence pair: Method 1: The terminal device expands the first sequence pair to determine the target sequence pair; Method 2: The terminal device truncates the first sequence pair to determine the target sequence pair. Details are as follows:

[0225] Method 1: The terminal device performs a first processing on the first sequence in the first sequence pair to determine the third sequence in the target sequence pair, and performs a first processing on the second sequence in the first sequence pair to determine the fourth sequence in the target sequence pair, including: expanding the first sequence to determine the third sequence; expanding the second sequence to determine the fourth sequence.

[0226] Specifically, extending the first sequence to determine the third sequence and extending the second sequence to determine the fourth sequence includes: copying a first portion of the sequence from the first sequence to a first position in the first sequence to determine the third sequence, where the position of the first portion of the sequence is determined by a first index set; and copying a second portion of the sequence from the second sequence to a second position in the second sequence to determine the fourth sequence, where the position of the second portion of the sequence is determined by a second index set. It should be noted that "extend" in this application can also be replaced by "enlarge," "expand," etc., and "copy" in this application can also be replaced by "copy," "transcribe," etc., and the embodiments of this application do not limit this.

[0227] The first part of the sequence can be any part of the first sequence, and the second part of the sequence can be any part of the second sequence. The position of the first part of the sequence within the first sequence is the same as the position of the second part of the sequence within the second sequence; in other words, the positions of the first and second parts of the sequence are identical. The position of the first part of the sequence is determined by the first index set, which can be understood as the indexes included in the first index set being the indices of the positions of the first part of the sequence. Similarly, the position of the second part of the sequence is determined by the second index set, which can be understood as the indexes included in the second index set being the indices of the positions of the second part of the sequence. The indices included in the first index set are the same as the indices included in the second index set. The indices included in the first index set may or may not be consecutive. The indices included in the second index set may or may not be consecutive.

[0228] Wherein, the first position and the second position are the same. The first position includes one or more of the following: the beginning of the first sequence, the end of the first sequence, both sides of the first sequence, or other positions in the first sequence other than the beginning, end, and both sides. The second position includes one or more of the following: the beginning of the second sequence, the end of the second sequence, both sides of the second sequence, or other positions in the second sequence other than the beginning, end, and both sides. For example, the first position and the second position being the same can mean that the first position is the beginning of the first sequence and the second position is the beginning of the second sequence; or, it can mean that the first position is the end of the first sequence and the second position is the end of the second sequence; or, it can mean that the first position is both sides of the first sequence and the second position is both sides of the second sequence. For example, the first position and the second position can be predefined or agreed upon by an agreement, and this embodiment of the application does not limit them.

[0229] In one possible implementation, copying a first portion of the sequence from the first sequence to a first position in the first sequence to determine the third sequence, and copying a second portion of the sequence from the second sequence to a second position in the second sequence to determine the fourth sequence, may include: copying a first portion of the sequence from the first sequence to the beginning of the first sequence to determine the third sequence, and copying a second portion of the sequence from the second sequence to the beginning of the second sequence to determine the fourth sequence. The position of the first portion of the sequence is determined by a first set of indices, and the position of the second portion of the sequence is determined by a second set of indices. For example, please refer to Figure 13. Figure 13 is a schematic diagram of extending the first sequence to determine the third sequence and extending the second sequence to determine the fourth sequence according to an embodiment of this application. As shown in Figure 13(a), the lengths of the first and second sequences are N = 2m. in This means rounding down, copying the first part of the first sequence to the beginning of the first sequence to determine the third sequence, and copying the second part of the second sequence to the beginning of the second sequence to determine the fourth sequence. The lengths of the third and fourth sequences are N1 = 12n. PRB / 2, the lengths of the first and second part sequences are (N1-N).

[0230] For example, see Figure 13(b), with n PRB =3, in This indicates rounding down, where This indicates rounding down. The lengths of the first and second sequences are N = 2⁴ = 16. The indices of the corresponding positions in the first and second sequences are 0-15. Optionally, the indices of the corresponding positions in the first and second sequences can be the indices of the frequency domain subcarriers within the scheduling bandwidth (corresponding to the first processing occurring after the Discrete Fourier Transform, i.e., the Discrete Fourier Transform is performed first, followed by the first processing). Optionally, the indices of the corresponding positions in the first and second sequences can be the indices of the modulation symbols (corresponding to the first processing occurring before the Discrete Fourier Transform, i.e., the first processing is performed first, followed by the Discrete Fourier Transform). The lengths of the third and fourth sequences are N1 = (12*3) / 2 = 18, and the lengths of the first and second part sequences are (N1-N) = 2. The third sequence is determined by copying the first part of the first sequence to the beginning of the first sequence, and the fourth sequence is determined by copying the second part of the second sequence to the beginning of the second sequence. The first part sequence is determined by the first index set, for example, the first index set includes indices {0,1}, which means the index of the position corresponding to the first part sequence is {0,1}. The second part sequence is determined by the second index set, and the indices included in the first index set and the indices included in the second index set are the same, for example, the second index set includes indices {0,1}, which means the index of the position corresponding to the second part sequence is {0,1}. The indices included in the first index set and the second index set are consecutive.

[0231] For example, see (c) in Figure 13, where n PRB =3, in This indicates rounding down, where This indicates rounding down. The lengths of the first and second sequences are N = 2. 4=16, the indices of the corresponding positions in the first sequence and the second sequence are 0-15. Optionally, the indices of the corresponding positions in the first sequence and the second sequence can be the indices of the frequency domain subcarriers within the scheduling bandwidth (corresponding to the first processing being performed after the Discrete Fourier Transform, i.e., the Discrete Fourier Transform is performed first, and then the first processing is performed). Optionally, the indices of the corresponding positions in the first sequence and the second sequence can be the indices of the modulation symbols (corresponding to the first processing being performed before the Discrete Fourier Transform, i.e., the first processing is performed first, and then the Discrete Fourier Transform is performed). The lengths of the third and fourth sequences are N1 = (12*3) / 2 = 18, and the lengths of the first and second part sequences are (N1-N) = 2. The third sequence is determined by copying the first part of the first sequence to the beginning of the first sequence, and the fourth sequence is determined by copying the second part of the second sequence to the beginning of the second sequence. The first part sequence is determined by the first index set, for example, the first index set includes indices {0,2}, which means the index of the position corresponding to the first part sequence is {0,2}. The second part sequence is determined by the second index set, and the indices included in the first index set and the indices included in the second index set are the same, for example, the second index set includes indices {0,2}, which means the index of the position corresponding to the second part sequence is {0,2}. The indices included in the first and second index sets are not consecutive.

[0232] In another possible implementation, copying the first portion of the first sequence to the first position of the first sequence to determine the third sequence, and copying the second portion of the second sequence to the second position of the second sequence to determine the fourth sequence, may further include: copying the first portion of the first sequence to the end of the first sequence to determine the third sequence, and copying the second portion of the second sequence to the end of the second sequence to determine the fourth sequence. The position of the first portion of the sequence is determined by a first index set, and the position of the second portion of the sequence is determined by a second index set. For example, please refer to Figure 14. Figure 14 is a schematic diagram of another method for determining the third sequence by extending the first sequence and determining the fourth sequence by extending the second sequence according to an embodiment of this application. As shown in the figure, the lengths of the first sequence and the second sequence are N = 2m. in This means rounding down, copying the first part of the first sequence to the end of the first sequence to determine the third sequence, and copying the second part of the second sequence to the end of the second sequence to determine the fourth sequence. The lengths of the third and fourth sequences are N1 = 12n. PRB / 2, the lengths of the first and second part sequences are (N1-N). For detailed examples, please refer to "Copying the first part of the first sequence to the beginning of the first sequence to determine the third sequence" and "Copying the second part of the second sequence to the beginning of the second sequence to determine the fourth sequence", which will not be explained in detail here.

[0233] In another possible implementation, copying the first part of the first sequence to the first position of the first sequence to determine the third sequence, and copying the second part of the second sequence to the second position of the second sequence to determine the fourth sequence, may further include: copying the first part of the first sequence to both sides of the first sequence to determine the third sequence, and copying the second part of the second sequence to both sides of the second sequence to determine the fourth sequence. The position of the first part of the sequence is determined by a first index set, and the position of the second part of the sequence is determined by a second index set. For example, please refer to Figure 15. Figure 15 is a schematic diagram of another method for determining the third sequence by extending the first sequence and determining the fourth sequence by extending the second sequence according to an embodiment of this application. As shown in Figure 15(a), the lengths of the first and second sequences are N = 2m. in This means rounding down, copying the first part of the first sequence to both sides of the first sequence to determine the third sequence, and copying the second part of the second sequence to both sides of the second sequence to determine the fourth sequence. The lengths of the third and fourth sequences are N1 = 12n. PRB / 2, the length of the first part sequence and the second part sequence is (N1-N), and the length of the extensions on both sides is (N1-N) / 2. Optionally, the network device can send indication information to indicate the length of the first part sequence and the second part sequence, or the indication information can also be used to indicate the length of the extensions on both sides.

[0234] For example, see Figure 15(b), with n PRB =2, in This indicates rounding down, where This indicates rounding down. The lengths of the first and second sequences are N = 2. 3=8, the indices of the corresponding positions in the first and second sequences are 0-7. Optionally, the indices of the corresponding positions in the first and second sequences can be the indices of the frequency domain subcarriers within the scheduling bandwidth (corresponding to the first processing after the Discrete Fourier Transform, i.e., the Discrete Fourier Transform is performed first, and then the first processing is performed). Optionally, the indices of the corresponding positions in the first and second sequences can be the indices of the modulation symbols (corresponding to the first processing before the Discrete Fourier Transform, i.e., the first processing is performed first, and then the Discrete Fourier Transform is performed). The lengths of the third and fourth sequences are N1 = (12*2) / 2 = 12. The first part of the sequence is determined by the first index set. For example, the first index set includes indices {0,1,6,7}, i.e., the indices of the corresponding positions in the first part of the sequence are {0,1,6,7}. In one possible implementation, the third sequence is determined by copying the first part of the first sequence to both sides of the first sequence. This can be understood as copying the sequence corresponding to the position at index {0,1} in the first index set to the beginning of the first sequence, and copying the sequence corresponding to the position at index {6,7} in the first index set to the end of the first sequence. The first part of the sequence includes the sequences corresponding to the positions at index {0,1} and {6,7} in the first index set. The second part of the sequence is determined by the second index set, which includes the same indices as the first index set. For example, if the second index set includes indices {0,1,6,7}, then the indices of the positions corresponding to the second part of the sequence are {0,1,6,7}. In one possible implementation, the fourth sequence is determined by copying the second part of the second sequence to both sides of the second sequence. This can be understood as copying the sequence corresponding to the position at index {0,1} in the second index set to the beginning of the second sequence, and copying the sequence corresponding to the position at index {6,7} in the second index set to the end of the second sequence. The second part of the sequence includes the sequences corresponding to the positions at index {0,1} and {6,7} in the second index set. The indices {0,1} and {6,7} in the first and second index sets are consecutive.

[0235] For example, see (c) in Figure 15, where n PRB =2, in This indicates rounding down, where This indicates rounding down. The lengths of the first and second sequences are N = 2³ = 8. The indices of the corresponding positions in the first and second sequences are 0-7. Optionally, the indices of the corresponding positions in the first and second sequences can be the indices of the frequency domain subcarriers within the scheduling bandwidth (corresponding to the first processing occurring after the Discrete Fourier Transform, i.e., the Discrete Fourier Transform is performed first, followed by the first processing). Optionally, the indices of the corresponding positions in the first and second sequences can be the indices of the modulation symbols (corresponding to the first processing occurring before the Discrete Fourier Transform, i.e., the first processing is performed first, followed by the Discrete Fourier Transform). The lengths of the third and fourth sequences are N1 = (12*2) / 2 = 12. The first part of the sequence is determined by the first index set. For example, the first index set includes indices {0,2,5,7}, which means the indices of the positions corresponding to the first part of the sequence are {0,2,5,7}. In one possible implementation, the third sequence is determined by copying the first part of the sequence to both sides of the first sequence. This can be understood as copying the sequence corresponding to the position with index {0,2} in the first index set to the beginning of the first sequence, and copying the sequence corresponding to the position with index {5,7} in the first index set to the end of the first sequence. The first part of the sequence includes the sequence corresponding to the position with index {0,2} in the first index set and the sequence corresponding to the position with index {5,7} in the first index set. The second part of the sequence is determined by a second set of indices, which contains the same indices as the first set of indices. For example, if the second set of indices contains {0,2,5,7}, then the corresponding indices of the second part of the sequence are {0,2,5,7}. In one possible implementation, the fourth sequence is determined by copying the second part of the second sequence to both sides. This can be understood as copying the sequence corresponding to index {0,2} in the second set to the beginning of the second sequence, and copying the sequence corresponding to index {5,7} in the second set to the end of the second sequence. The second part of the sequence includes the sequences corresponding to index {0,2} and {5,7} in the second set. Note that the indices {0,2} and {5,7} in the first and second sets are not consecutive.

[0236] In the above method, the length of the first sequence pair generated is relatively short. By expanding the first sequence pair to determine the target sequence pair, sequences of arbitrary length can be generated, which has higher adaptability and a wider range of applications.

[0237] Method 2: The terminal device performs a first processing on the first sequence in the first sequence pair to determine the third sequence in the target sequence pair, and performs a first processing on the second sequence in the first sequence pair to determine the fourth sequence in the target sequence pair, including: truncating the first sequence to determine the third sequence; truncating the second sequence to determine the fourth sequence.

[0238] The process involves truncating the first sequence to determine the third sequence, and truncating the second sequence to determine the fourth sequence, including: truncating a third portion of the first sequence to determine the third sequence, the position of which is determined by a third index set; and truncating a fourth portion of the second sequence to determine the fourth sequence, the position of which is determined by a fourth index set. The third index set includes the same indices as the fourth index set. It should be noted that the term "truncated" in this application can also be replaced by "truncated," "selected," etc., and this application does not limit the scope of the terminology.

[0239] The third part of the sequence can be any part of the first sequence, and the fourth part of the sequence can be any part of the second sequence. The position of the third part in the first sequence is the same as the position of the fourth part in the second sequence; in other words, the positions of the third and fourth parts are identical. The position of the third part is determined by the third index set, which can be understood as the indexes included in the third index set being the indices of the third part's position. Similarly, the position of the fourth part is determined by the fourth index set, which can be understood as the indexes included in the fourth index set being the indices of the fourth part's position. The indices included in the third index set are the same as those included in the fourth index set. The indices included in the third index set can be consecutive or non-consecutive. The indices included in the fourth index set can also be consecutive or non-consecutive.

[0240] The third part of the sequence is located at one or more of the following positions: the beginning of the first sequence, the end of the first sequence, either side of the first sequence, or any other position in the first sequence other than the beginning, end, or sides. The fourth part of the sequence is located at one or more of the following positions: the beginning of the second sequence, the end of the second sequence, either side of the second sequence, or any other position in the second sequence other than the beginning, end, or sides. For example, the same position for the third and fourth parts of the sequence could mean that the third part of the sequence is at the beginning of the first sequence and the fourth part of the sequence is at the beginning of the second sequence; or, it could mean that the third part of the sequence is at the end of the first sequence and the fourth part of the sequence is at the end of the second sequence; or, it could mean that the third part of the sequence is at either side of the first sequence and the fourth part of the sequence is at either side of the second sequence. For example, the positions of the third and fourth parts of the sequence can be predefined or agreed upon by a protocol, and this embodiment of the application does not limit them.

[0241] In one example, taking the position of the third part of the sequence as the beginning of the first sequence and the position of the fourth part of the sequence as the beginning of the second sequence as an example, please refer to Figure 16. Figure 16 is a schematic diagram of determining the third sequence by truncating the first sequence and determining the fourth sequence by truncating the second sequence according to an embodiment of this application. As can be seen from Figure 16(a), the lengths of the first sequence and the second sequence are N = 2m. in This indicates rounding up. The lengths of the third and fourth sequences are N1 = 12n. PRB / 2, the lengths of the first and second part sequences are (N-N1).

[0242] For example, see Figure 16(b), with n PRB For example, =3, in This indicates rounding down, where This indicates rounding up. The lengths of the first and second sequences are N = 2. 5 =32, the indices of the corresponding positions in the first sequence and the second sequence are 0-31. Optionally, the indices of the corresponding positions in the first sequence and the second sequence can be the indices of the frequency domain subcarriers within the scheduling bandwidth (corresponding to the first processing being performed after the Discrete Fourier Transform, i.e., the Discrete Fourier Transform is performed first, and then the first processing is performed). Optionally, the indices of the corresponding positions in the first sequence and the second sequence can be the indices of the modulation symbols (corresponding to the first processing being performed before the Discrete Fourier Transform, i.e., the first processing is performed first, and then the Discrete Fourier Transform is performed). The lengths of the third and fourth sequences are N1 = (12 * 3) / 2 = 18, and the lengths of the first and second parts are (N - N1) = 14. The third sequence is determined by extracting the third part from the first sequence. The position of the third part is determined by the third index set. For example, if the third index set includes indices {18, 19, ..., 31}, the corresponding index of the third sequence is {0, 1, ..., 17}. The fourth sequence is determined by extracting the fourth part from the second sequence. The position of the fourth part is determined by the fourth index set, which includes the same indices as the third index set. For example, if the fourth index set includes indices {18, 19, ..., 31}, the corresponding index of the fourth sequence is {0, 1, ..., 17}. The indices in the first and second index sets are consecutive.

[0243] For example, see (c) in Figure 16, where n PRB For example, =3, in This indicates rounding down, where This indicates rounding up. The lengths of the first and second sequences are N = 2.5 =32, the indices of the corresponding positions in the first sequence and the second sequence are 0-31. Optionally, the indices of the corresponding positions in the first sequence and the second sequence can be the indices of the frequency domain subcarriers within the scheduling bandwidth (corresponding to the first processing being performed after the Discrete Fourier Transform, i.e., the Discrete Fourier Transform is performed first, and then the first processing is performed). Optionally, the indices of the corresponding positions in the first sequence and the second sequence can be the indices of the modulation symbols (corresponding to the first processing being performed before the Discrete Fourier Transform, i.e., the first processing is performed first, and then the Discrete Fourier Transform is performed). The lengths of the third and fourth sequences are N1 = (12*3) / 2 = 18, and the lengths of the first and second parts of the sequence are (N-N1) = 14. The third part of the sequence is extracted from the first sequence to determine the third sequence. The position of the third part of the sequence is determined by the third index set. For example, the third index set includes indices {5,7,9,11,13,15,17,19,21,23,25,27,29,31}, and the corresponding indices of the third sequence are {1,2,3,4,6,8,10,12,14,16,18,20,22,24,26,28,30}. The fourth sequence is determined by extracting the fourth part of the second sequence. The position of the fourth part is determined by the fourth index set. The indices included in the third index set are the same as those included in the fourth index set. For example, the indices included in the fourth index set are {5,7,9,11,13,15,17,19,21,23,25,27,29,31}. Correspondingly, the indices of the positions in the fourth sequence are {1,2,3,4,6,8,10,12,14,16,18,20,22,24,26,28,30}. The indices included in the first index set and the second index set are not consecutive.

[0244] In another example, taking the position of the third part of the sequence as the end of the first sequence and the position of the fourth part of the sequence as the end of the second sequence as an example, please refer to Figure 17. Figure 17 is a schematic diagram of determining the third sequence by truncating the first sequence and determining the fourth sequence by truncating the second sequence according to an embodiment of this application. As shown in the figure, the lengths of the first sequence and the second sequence are N = 2m. in This indicates rounding up. The lengths of the third and fourth sequences are N1 = 12n. PRB / 2, the lengths of the first and second part sequences are (N-N1). For a specific example, please refer to the example where the position of the third part sequence is the beginning of the first sequence and the position of the fourth part sequence is the beginning of the second sequence, which will not be repeated here.

[0245] In another example, taking the third part of the sequence as being positioned on both sides of the first sequence and the fourth part of the sequence as being positioned on both sides of the second sequence, please refer to Figure 18. Figure 18 is a schematic diagram of determining the third sequence by truncating the first sequence and determining the fourth sequence by truncating the second sequence according to an embodiment of this application. For example, please refer to Figure 18(a), where the lengths of the first and second sequences are N = 2m. in This indicates rounding up. The lengths of the third and fourth sequences are N1 = 12n. PRB The lengths of the first and second part sequences are (N-N1). The lengths of the truncated portions are (N-N1) / 2. Optionally, the network device may send indication information to indicate the lengths of the first and second part sequences, or the indication information may also indicate the lengths of the truncated portions.

[0246] For example, see Figure 18(b), with n PRB For example, =3, in This indicates rounding down, where This indicates rounding up. The lengths of the first and second sequences are N = 2. 5=32, the indices of the corresponding positions in the first sequence and the second sequence are 0-31. Optionally, the indices of the corresponding positions in the first sequence and the second sequence can be the indices of the frequency domain subcarriers within the scheduling bandwidth (corresponding to the first processing being performed after the Discrete Fourier Transform, i.e., the Discrete Fourier Transform is performed first, and then the first processing is performed). Optionally, the indices of the corresponding positions in the first sequence and the second sequence can be the indices of the modulation symbols (corresponding to the first processing being performed before the Discrete Fourier Transform, i.e., the first processing is performed first, and then the Discrete Fourier Transform is performed). The lengths of the third and fourth sequences are N1 = (12*3) / 2 = 18. The lengths of the first and second part sequences are (N-N1) = 14. The position of the third part sequence is determined by the third index set. For example, the third index set includes indices {0,1,2,3,4,5,6,25,26,27,28,29,30,31}, which means the index of the position of the third part sequence is {0,1,2,3,4,5,6,25,26,27,28,29,30,31}. Correspondingly, the index of the position of the third sequence is {7,8,9,10, ...,22,23,24}. In one possible implementation, determining the third sequence by extracting the third part of the first sequence can be understood as extracting the sequence corresponding to the position with index {0,1,2,3,4,5,6} in the third index set and the sequence corresponding to the position with index {25,26,27,28,29,30,31} in the third index set. The third part of the sequence includes the sequence corresponding to the position with index {0,1,2,3,4,5,6} in the third index set and the sequence corresponding to the position with index {25,26,27,28,29,30,31} in the third index set. The position of the fourth part of the sequence is determined by the fourth index set, which contains the same indices as the third set. For example, the fourth index set contains indices {0,1,2,3,4,5,6,25,26,27,28,29,30,31}, which means the index of the position of the fourth part of the sequence is {0,1,2,3,4,5,6,25,26,27,28,29,30,31}. In one possible implementation, determining the fourth sequence by extracting the fourth part of the second sequence can be understood as extracting the sequences corresponding to the positions {0,1,2,3,4,5,6} in the fourth index set and the sequences corresponding to the positions {25,26,27,28,29,30,31} in the fourth index set. The fourth part of the sequence includes the sequences corresponding to the positions {0,1,2,3,4,5,6} and {25,26,27,28,29,30,31} in the fourth index set.Among them, the third and fourth index sets include consecutive indices {0,1,2,3,4,5,6} and {25,26,27,28,29,30,31}.

[0247] For example, see (c) in Figure 18, where n PRB For example, =3, in This indicates rounding down, where This indicates rounding up. The lengths of the first and second sequences are N = 2. 5=32, the indices of the positions of the first sequence and the second sequence are 0-31. Optionally, the indices of the corresponding positions of the first sequence and the second sequence can be the indices of the frequency domain subcarriers within the scheduling bandwidth (corresponding to the first processing being performed after the Discrete Fourier Transform, i.e., the Discrete Fourier Transform is performed first, and then the first processing is performed). Optionally, the indices of the corresponding positions of the first sequence and the second sequence can be the indices of the modulation symbols (corresponding to the first processing being performed before the Discrete Fourier Transform, i.e., the first processing is performed first, and then the Discrete Fourier Transform is performed). The lengths of the third and fourth sequences are N1 = (12*3) / 2 = 18. The lengths of the first and second part sequences are (N-N1) = 14. The position of the third part sequence is determined by the third index set. For example, the third index set includes indices {0,2,4,6,8,10,12,19,21,23,25,27,29,31}, which means the index of the position of the third part sequence is {0,2,4,6,8,10,12,19,21,23,25,27,29,31}. In one possible implementation, determining the third sequence by extracting the third part of the first sequence can be understood as extracting the sequences corresponding to the positions with indices {0,2,4,6,8,10,12} in the third index set and the sequences corresponding to the positions with indices {19,21,23,25,27,29,31} in the third index set. The third part of the sequence includes the sequences corresponding to the positions with indices {0,1,2,3,4,5,6} in the third index set and the sequences corresponding to the positions with indices {25,26,27,28,29,30,31} in the third index set. Correspondingly, the indices of the positions in the third sequence are {1,3,5,7,9,11,13,14,15,16,17,18,20,22,24,26,28,30}. The position of the fourth part of the sequence is determined by the fourth index set, which contains the same indices as the third set. For example, the fourth index set contains indices {0,2,4,6,8,10,12,19,21,23,25,27,29,31}, which means the index of the position of the fourth part of the sequence is {0,2,4,6,8,10,12,19,21,23,25,27,29,31}.In one possible implementation, determining the fourth sequence by extracting the fourth part of the second sequence can be understood as extracting the sequences corresponding to the positions with indices {0,2,4,6,8,10,12} in the fourth index set and the sequences corresponding to the positions with indices {19,21,23,25,27,29,31} in the fourth index set. The fourth part of the sequence includes the sequences corresponding to the positions with indices {0,2,4,6,8,10,12} and {19,21,23,25,27,29,31} in the fourth index set. Correspondingly, the indices of the positions in the fourth sequence are {1,3,5,7,9,11,13,14,15,16,17,18,20,22,24,26,28,30}. Among them, the indices {0,2,4,6,8,10,12} and {19,21,23,25,27,29,31} included in the third and fourth index sets are non-contiguous.

[0248] It should be noted that "discontinuous" in the above embodiments can also be described as "dispersed".

[0249] In the above method, the length of the first sequence pair generated is relatively long. By truncating the first sequence pair to determine the target sequence pair, sequences of arbitrary length can be generated, which has higher adaptability and a wider range of applications.

[0250] In one possible implementation, the first processing occurs before or after the Fourier transform. This Fourier transform can be a discrete Fourier transform (DFT) or a fast Fourier transform (FFT). The first processing may include expansion / truncation processing, as described above. For example, for a single-carrier signal, such as DFT-s-OFDM, filter SC-QAM, frequency domain spectrum shaping (FDSS), etc., when the reference signal is a DMRS (Diffuse-to-Frequency-Domain), the DMRS is mapped in the frequency domain. In one possible implementation, the expansion / truncation processing occurs in the time domain, i.e., before the FFT, which is the processing step when the 'Transform Precoding' field is 'enable'; alternatively, the expansion / truncation processing occurs in the frequency domain, i.e., after the FFT.

[0251] For example, when the first processing is performed on the first sequence and the second sequence before the Fourier transform, that is, before the Fourier transform, the first processing can be performed before the first sequence and the second sequence are modulated; or the first processing can be performed after the first sequence and the second sequence are modulated. For example, the modulation can be pi / 2BPSK modulation.

[0252] For example, the first processing occurs after the Fourier transform, that is, when the first sequence and the second sequence are processed after the Fourier transform. At this time, the first sequence and the second sequence have already been modulated before the first processing. For example, the modulation can be pi / 2BPSK modulation.

[0253] In the above method, when the first processing is performed after the Fourier transform, the frequency domain stationarity of the reference sequence mapping symbols is better.

[0254] In another possible implementation, the method further includes: the terminal device receiving second instruction information.

[0255] For example, the second indication information is used to indicate the length information of the first part sequence and / or the second part sequence. Alternatively, it can be described as the second indication information indicating the ratio of the length of the first part sequence to the length of the first sequence, and / or the ratio of the length of the second part sequence to the length of the second sequence. This process can be understood as the second indication information indicating the length information of the extended sequence. The length information of the extended sequence can include the length of a unilaterally extended sequence or the length information of a bilaterally extended sequence. For example, bilateral extension includes simultaneous extension of the beginning and end of the sequence. When the length information of the extended sequence refers to the length information of a bilaterally extended sequence, it can also indicate the length information or ratio of the sequence extended on each side. For example, when bilateral extension includes simultaneous extension of the beginning and end of the sequence, it can further indicate the ratio information of the extension of the beginning and end of the sequence.

[0256] For example, the second indication information is used to indicate the length information of the third part sequence and / or the fourth part sequence. It can also be described as the second indication information indicating the ratio of the length of the third part sequence to the length of the first sequence, and / or the ratio of the length of the fourth part sequence to the length of the second sequence. This process can be understood as the second indication information indicating the length information of the truncated sequence. The length information of the truncated sequence can include the length of a unilaterally truncated sequence or the length information of a bilaterally truncated sequence. For example, bilateral truncating includes truncating both the beginning and end of the sequence simultaneously. When the length information of the truncated sequence refers to the length information of a bilaterally truncated sequence, it can also indicate the length information or ratio of each side of the truncated sequence. For example, when bilateral truncating includes truncating both the beginning and end of the sequence simultaneously, it can further indicate the ratio information of the beginning and end of the truncated sequence.

[0257] In the above method, the target sequence pair can be determined more quickly by expanding or truncating the first sequence pair based on the length information of the first part sequence and / or the second part sequence, or the length information of the third part sequence and / or the fourth part sequence, thereby reducing time consumption and latency.

[0258] In another possible implementation, the method further includes: defaulting to expanding the first sequence to determine the third sequence, and expanding the second sequence to determine the fourth sequence. In this way, generating shorter first sequence pairs is less complex than generating longer first sequence pairs.

[0259] In another possible implementation, the method further includes: if the length of the first part sequence is less than the length of the third part sequence, and / or the length of the second part sequence is less than the length of the fourth part sequence, determining to extend the first sequence to determine the third sequence, and extending the second sequence to determine the fourth sequence; if the length of the first part sequence is greater than the length of the third part sequence, and / or the length of the second part sequence is greater than the length of the fourth part sequence, determining to truncate the first sequence to determine the third sequence, and truncate the second sequence to determine the fourth sequence.

[0260] If the length of the first part of the sequence is equal to the length of the third part of the sequence, and / or the length of the second part of the sequence is equal to the length of the fourth part of the sequence, then it is determined that the first part of the sequence is extended to determine the third part of the sequence, and the second part of the sequence is extended to determine the fourth part of the sequence, or it is determined that the first part of the sequence is truncated to determine the third part of the sequence, and the second part of the sequence is truncated to determine the fourth part of the sequence.

[0261] The above process can be understood as follows: when the length of the extended sequence is less than the length of the truncated sequence, the extension method is selected to generate the target sequence pair; when the length of the extended sequence is greater than the length of the truncated sequence, the truncated method is selected to generate the target sequence pair; when the length of the extended sequence is equal to the length of the truncated sequence, either the extension or truncated method is selected to generate the target sequence pair.

[0262] It should be noted that the selection method of extending the first sequence to determine the third sequence, extending the second sequence to determine the fourth sequence, or truncating the first sequence to determine the third sequence and truncating the second sequence to determine the fourth sequence can also be determined by the protocol predefined or the network device indicated selection rules. In other words, the target sequence pair is generated by selecting the extension or truncation method by the protocol predefined or the network device indicated selection rules.

[0263] Optionally, the second instruction information and the first instruction information can be the same instruction information or different instruction information; this application embodiment does not limit this.

[0264] In the above method, by selecting a shorter length for generating target sequence pairs through expansion or truncation, the variation in PAPR can be smaller, which is beneficial for matching the PAPR of the reference signal and the data, resulting in better coverage performance.

[0265] In one possible implementation, the method further includes: the terminal device performing transport block size (TBS), low-density parity check (LDPC) encoding, modulation, reference signal generation, resource mapping, precoding, and mid-radio frequency processing based on the configuration information, fifth indication information, and third indication information of the first signal, generating the first signal, and transmitting it through an antenna (beamforming). Optionally, this first signal is mainly for the DMRS corresponding to the PUSCH; for coverage scenarios, the DMRS corresponding to the PUSCH can also be generated using the corresponding Gray sequence. Correspondingly, the network device receives the first signal. Optionally, the network device receives the first signal on a designated port based on the configuration information, fifth indication information, and third indication information of the first signal.

[0266] The process described above, in which the terminal device determines a first sequence pair based on the base size of the sequence, the first sequence pair including a first sequence and a second sequence; and performs a first processing on the first sequence in the first sequence pair to determine a third sequence in the target sequence pair, and performs a first processing on the second sequence in the first sequence pair to determine a fourth sequence in the target sequence pair, can be referred to the processing process of the terminal device, and will not be repeated here.

[0267] It should be noted that the embodiments of this application use the reference signal for generating a double symbol using a Gray sequence as an example for illustration. The reference signal for generating a single symbol using a Gray sequence can be referred to the reference signal for generating a double symbol using a Gray sequence, and will not be elaborated further.

[0268] In the method described in Figure 11, the lengths of the first and second sequences in the first sequence pair can be powers of 2. The third and fourth sequences are determined by performing a first process on the first and second sequences, which includes expansion or truncation. The lengths of the third and fourth sequences are arbitrary. Therefore, this method can generate sequences of arbitrary lengths, has higher applicability, and broadens the scope of applications.

[0269] The methods of the embodiments of this application have been described in detail above, and the apparatus of the embodiments of this application is provided below.

[0270] Please refer to Figure 19. Figure 19 is a schematic diagram of the structure of a sequence generation device 1900 provided in an embodiment of this application. The sequence generation device 1900 may include modules, units, or means that correspond one-to-one with the methods / operations / steps / actions performed by the terminal device or network device in the above method embodiments. The modules, units, or means may be hardware circuits, software, or a combination of hardware circuits and software.

[0271] In one possible implementation, the sequence generation device 1900 may include a processing unit 1901 and a transceiver unit 1902, the specific details of which are as follows:

[0272] The processing unit 1901 is used for data processing. The transceiver unit 1902 can implement corresponding communication functions. The transceiver unit 1902 can also be called a communication interface or a communication module.

[0273] Optionally, the sequence generation apparatus 1900 may further include a storage unit, which can be used to store instructions and / or data, and the processing unit 1901 can read the instructions and / or data in the storage module to implement the aforementioned method embodiments.

[0274] Optionally, the transceiver unit 1902 may include a sending unit and a receiving unit. The sending unit is used to perform the sending operation in the above method embodiments. The receiving unit is used to perform the receiving operation in the above method embodiments.

[0275] It should be noted that the sequence generation apparatus 1900 may include a transmitting unit but not a receiving unit. Alternatively, the sequence generation apparatus 1900 may include a receiving unit but not a transmitting unit. Specifically, it depends on whether the above-described scheme executed by the sequence generation apparatus 1900 includes both transmitting and receiving actions.

[0276] Optionally, the sequence generation device 1900 is used to perform the actions performed by the terminal device in the embodiment shown in FIG11 above. For details, please refer to the relevant description in the embodiment shown in FIG11 above; it will not be elaborated here. For example, the sequence generation device 1900 is used to perform the following scheme:

[0277] The processing unit 1901 is configured to determine a first sequence pair based on the basis size of the sequence, the first sequence pair including a first sequence and a second sequence; the processing unit 1901 is further configured to perform a first processing on the first sequence in the first sequence pair to determine a third sequence in the target sequence pair, and to perform a first processing on the second sequence in the first sequence pair to determine a fourth sequence in the target sequence pair, wherein the index of the position where the first processing is performed on the first sequence is the same as the index of the position where the first processing is performed on the second sequence, and the rule for performing the first processing on the first sequence is the same as the rule for performing the first processing on the second sequence.

[0278] In one possible implementation, the basis size of the sequence is determined based on the size of the scheduled frequency domain resources and / or the density of the reference signal.

[0279] In another possible implementation, the transceiver unit 1902 is configured to receive first indication information, the first indication information being used to indicate the base size of the sequence.

[0280] In another possible implementation, the processing unit 1901 is configured to extend the first sequence to determine the third sequence; the processing unit 1901 is configured to extend the second sequence to determine the fourth sequence; the processing unit 1901 is configured to truncate the first sequence to determine the third sequence; and the processing unit 1901 is configured to truncate the second sequence to determine the fourth sequence.

[0281] In another possible implementation, the processing unit 1901 is configured to copy a first portion of the sequence from the first sequence to a first position in the first sequence to determine the third sequence, wherein the position of the first portion of the sequence is determined by a first set of indices; the processing unit 1901 is configured to copy a second portion of the sequence from the second sequence to a second position in the second sequence to determine the fourth sequence, wherein the position of the second portion of the sequence is determined by a second set of indices; wherein the first set of indices includes the same indices as the second set of indices, and the first position and the second position are the same.

[0282] In another possible implementation, the first position includes one or more of the following: the beginning of the first sequence, the end of the first sequence, the two sides of the first sequence, or other positions in the first sequence other than the beginning, the end, and the two sides; the second position includes one or more of the following: the beginning of the second sequence, the end of the second sequence, the two sides of the second sequence, or other positions in the second sequence other than the beginning, the end, and the two sides.

[0283] In another possible implementation, the processing unit 1901 is configured to extract a third portion of the sequence from the first sequence to determine the third sequence, the position of which is determined by a third index set; the processing unit 1901 is also configured to extract a fourth portion of the sequence from the second sequence to determine the fourth sequence, the position of which is determined by a fourth index set; wherein the third index set includes the same indices as the fourth index set.

[0284] In another possible implementation, the processing unit 1901 is further configured to determine, when the length of the first partial sequence is less than the length of the third partial sequence and / or the length of the second partial sequence is less than the length of the fourth partial sequence, to extend the first sequence to determine the third sequence and extend the second sequence to determine the fourth sequence; the processing unit 1901 is further configured to determine, when the length of the first partial sequence is greater than the length of the third partial sequence and / or the length of the second partial sequence is greater than the length of the fourth partial sequence, to determine to truncate the first sequence to determine the third sequence and truncate the second sequence to determine the fourth sequence.

[0285] In another possible implementation, the transceiver unit 1902 is further configured to receive second indication information, the second indication information being used to indicate the length information of the first partial sequence and / or the second partial sequence, or the length information of the third partial sequence and / or the fourth partial sequence.

[0286] In yet another possible implementation, the first processing occurs before or after the Fourier transform.

[0287] In another possible implementation, the transceiver unit 1902 is further configured to receive third indication information, the third indication information being used to indicate a Gray sequence, the Gray sequence being used to determine the first sequence pair.

[0288] In another possible implementation, the transceiver unit 1902 is further configured to receive fourth indication information, which indicates a first permutation combination, wherein the first permutation combination is one of the full permutation combinations corresponding to the base size of the sequence, and the first permutation combination is used to determine the first sequence pair.

[0289] In another possible implementation, the fourth indication information is used to indicate index value information, which in turn indicates a first rule for determining the first permutation and combination.

[0290] In another possible implementation, the first rule includes one or more of the following: all ascending order, all descending order, pairwise summation fixed and ascending order, pairwise summation fixed and descending order, even numbers first then odd numbers, or odd numbers first then even numbers.

[0291] In another possible implementation, the fourth indication information is used to indicate the root value of the permutation, which is used to determine the first permutation combination.

[0292] It should be noted that the implementation and beneficial effects of each module can also be described in the corresponding description of the method embodiment shown in Figure 11.

[0293] Optionally, the sequence generation device 1900 is used to perform the actions performed by the network device in the embodiment shown in FIG11 above. For details, please refer to the relevant description in the embodiment shown in FIG11 above, which will not be elaborated here. For example, the sequence generation device 1900 is used to perform the following scheme: the processing unit 1901 is used to determine a first sequence pair based on the basis size of the sequence, the first sequence pair including a first sequence and a second sequence; the processing unit 1901 is used to perform a first processing on the first sequence in the first sequence pair to determine a third sequence in a target sequence pair, and to perform a first processing on the second sequence in the first sequence pair to determine a fourth sequence in the target sequence pair, wherein the index of the position where the first processing is performed on the first sequence is the same as the index of the position where the first processing is performed on the second sequence, and the rule for performing the first processing on the first sequence is the same as the rule for performing the first processing on the second sequence.

[0294] In one possible implementation, the basis size of the sequence is determined based on the size of the scheduled frequency domain resources and / or the density of the reference signal.

[0295] In another possible implementation, the transceiver unit 1902 is configured to transmit first indication information, the first indication information being used to indicate the base size of the sequence.

[0296] In another possible implementation, the processing unit 1901 is configured to expand the first sequence to determine the third sequence; expand the second sequence to determine the fourth sequence; and truncate the first sequence to determine the third sequence; and truncate the second sequence to determine the fourth sequence.

[0297] In another possible implementation, the processing unit 1901 is configured to copy a first portion of the sequence from the first sequence to a first position in the first sequence to determine the third sequence, wherein the position of the first portion of the sequence is determined by a first set of indices; the processing unit 1901 is configured to copy a second portion of the sequence from the second sequence to a second position in the second sequence to determine the fourth sequence, wherein the position of the second portion of the sequence is determined by a second set of indices; wherein the first set of indices includes the same indices as the second set of indices, and the first position and the second position are the same.

[0298] In another possible implementation, the first position includes one or more of the following: the beginning of the first sequence, the end of the first sequence, the two sides of the first sequence, or other positions in the first sequence other than the beginning, the end, and the two sides; the second position includes one or more of the following: the beginning of the second sequence, the end of the second sequence, the two sides of the second sequence, or other positions in the second sequence other than the beginning, the end, and the two sides.

[0299] In another possible implementation, the processing unit 1901 is configured to extract a third portion of the sequence from the first sequence to determine the third sequence, the position of which is determined by a third index set; the processing unit 1901 is also configured to extract a fourth portion of the sequence from the second sequence to determine the fourth sequence, the position of which is determined by a fourth index set; wherein the third index set includes the same indices as the fourth index set.

[0300] In another possible implementation, the processing unit 1901 is further configured to determine, when the length of the first partial sequence is less than the length of the third partial sequence and / or the length of the second partial sequence is less than the length of the fourth partial sequence, to extend the first sequence to determine the third sequence and extend the second sequence to determine the fourth sequence; the processing unit 1901 is further configured to determine, when the length of the first partial sequence is greater than the length of the third partial sequence and / or the length of the second partial sequence is greater than the length of the fourth partial sequence, to determine to truncate the first sequence to determine the third sequence and truncate the second sequence to determine the fourth sequence.

[0301] In another possible implementation, the transceiver unit 1902 is further configured to transmit second indication information, which indicates the length information of the first partial sequence and / or the second partial sequence, or the length information of the third partial sequence and / or the fourth partial sequence.

[0302] In yet another possible implementation, the first processing occurs before or after the Fourier transform.

[0303] In another possible implementation, the transceiver unit 1902 is further configured to send third indication information, the third indication information being used to indicate a Gray sequence, the Gray sequence being used to determine the first sequence pair.

[0304] In another possible implementation, the transceiver unit 1902 is further configured to send fourth indication information, which indicates a first permutation combination, which is one of the full permutation combinations corresponding to the base size of the sequence, and the first permutation combination is used to determine the first sequence pair.

[0305] In another possible implementation, the fourth indication information is used to indicate index value information, which in turn indicates a first rule for determining the first permutation and combination.

[0306] In another possible implementation, the first rule includes one or more of the following: all ascending order, all descending order, pairwise summation fixed and ascending order, pairwise summation fixed and descending order, even numbers first then odd numbers, or odd numbers first then even numbers.

[0307] In another possible implementation, the fourth indication information is used to indicate the root value of the permutation, which is used to determine the first permutation combination.

[0308] It should be noted that the implementation and beneficial effects of each module can also be described in accordance with the corresponding description of the method embodiment shown in FIG11. The division of modules in this application embodiment is illustrative and is only a logical functional division. In actual implementation, there may be other division methods.

[0309] The processing unit 1901 in the above embodiments can be implemented by at least one processor or processor-related circuitry. The transceiver unit 1902 can be implemented by a transceiver or transceiver-related circuitry. The transceiver unit 1902 can also be referred to as a communication module or communication interface. The storage module can be implemented by at least one memory.

[0310] Please refer to Figure 20. Figure 20 is a structural schematic diagram of another sequence generation device 2000 provided in the embodiments of this application. The sequence generation device 2000 may include modules, units or means corresponding to the methods / operations / steps / actions performed by the terminal device or network device in the above method embodiments. The modules, units or means may be hardware circuits, software, or hardware circuits combined with software.

[0311] The sequence generation apparatus 2000 includes at least one processor 2001. Optionally, it also includes a communication interface 2003 and a memory 2002. The processor 2001, memory 2002, and communication interface 2003 are interconnected via a bus 2004. Optionally, the processor 2001 and memory 2002 can be integrated together.

[0312] The memory 2002 includes, but is not limited to, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), or compact disc read-only memory (CD-ROM), which is used for related computer programs and data. The communication interface 2003 is used for receiving and sending data.

[0313] Processor 2001 can be one or more central processing units (CPUs). When processor 2001 is a CPU, the CPU can be a single-core CPU or a multi-core CPU.

[0314] The processor 2001 in the sequence generation device 2000 is used to read computer programs or instructions stored in the memory 2002 to implement the functions of the processing unit. The communication interface 2003 in the sequence generation device 2000 is used to implement the functions of the transceiver unit.

[0315] This application also provides a chip device including at least one processor, which is used to call a computer program or instructions stored in a memory to cause the processor to execute the method provided in the above embodiments.

[0316] In one possible implementation, the input of the chip device corresponds to the receiving operation in any of the above embodiments, and the output of the chip device corresponds to the sending operation in any of the above embodiments.

[0317] Optionally, the processor is coupled to the memory via an interface.

[0318] Optionally, the chip device may also include a memory storing computer program instructions.

[0319] This application also provides a computer-readable storage medium storing a computer program or instructions that, when executed on a processor, implement the method performed by a terminal device or network device in the above method embodiments.

[0320] This application also provides a computer program product, which includes a computer program or instructions that, when run on a processor, implement the method executed by a terminal device or network device in the above method embodiments.

[0321] This application also provides a communication system, which includes the terminal device and the network device described in the above embodiments. The terminal device is used to perform some or all of the operations performed by the terminal device in the above method embodiments, and the network device is used to perform some or all of the operations performed by the network device in the above method embodiments.

[0322] It is understood that the processor in the embodiments of this application may be a Central Processing Unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. A general-purpose processor may be a microprocessor or any conventional processor.

[0323] The method steps in the embodiments of this application can be implemented in hardware or by a processor executing software instructions. The software instructions can consist of corresponding software modules, which can be stored in random access memory, flash memory, read-only memory, programmable read-only memory, erasable programmable read-only memory, electrically erasable programmable read-only memory, registers, hard disks, portable hard disks, CD-ROMs, or any other form of storage medium known in the art. An exemplary storage medium is coupled to a processor, enabling the processor to read information from and write information to the storage medium. Of course, the storage medium can also be a component of the processor. The processor and storage medium can reside in an ASIC. Alternatively, the ASIC can reside in a base station or terminal. Of course, the processor and storage medium can also exist as discrete components in the base station or terminal.

[0324] In the above embodiments, implementation can be achieved entirely or partially through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented entirely or partially in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in the embodiments of this application are performed entirely or partially. The computer can be a general-purpose computer, a special-purpose computer, a computer network, a network device, a user equipment, or other programmable device. The computer program or instructions can be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another. For example, the computer program or instructions can be transferred from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available medium can be a magnetic medium, such as a floppy disk, hard disk, or magnetic tape; it can also be an optical medium, such as a digital video optical disc; or it can be a semiconductor medium, such as a solid-state drive. The computer-readable storage medium may be a volatile or non-volatile storage medium, or may include both types of storage media.

[0325] In the various embodiments of this application, unless otherwise specified or in case of logical conflict, the terminology and / or descriptions of different embodiments are consistent and can be referenced by each other. The technical features of different embodiments can be combined to form new embodiments according to their inherent logical relationship.

[0326] In the description of this application, terms such as "first", "second", "S1101" or "S1102" are used only for the purpose of distinguishing descriptions and for the convenience of context. Different sequence numbers do not have specific technical meanings themselves and should not be construed as indicating or implying relative importance, nor should they be construed as indicating or implying the order of execution of operations. The order of execution of each process should be determined by its function and internal logic.

Claims

1. A sequence generation method, characterized by, The method comprises: determining a first sequence pair comprising a first sequence and a second sequence based on a sequence base size; determining a third sequence in a target sequence pair by performing first processing on the first sequence in the first sequence pair and determining a fourth sequence in the target sequence pair by performing first processing on the second sequence in the first sequence pair, wherein an index of a position where the first processing is performed on the first sequence and an index of a position where the first processing is performed on the second sequence are the same, and a rule of the first processing performed on the first sequence and a rule of the first processing performed on the second sequence are the same.

2. The method of claim 1, wherein, The sequence base size is determined based on a scheduled frequency domain resource size and / or a reference signal density.

3. The method of claim 1, wherein, The method further comprises: receiving first indication information used for indicating the sequence base size.

4. The method of any one of claims 1-3, wherein the determining the third sequence in the target sequence pair by performing first processing on the first sequence in the first sequence pair and the determining the fourth sequence in the target sequence pair by performing first processing on the second sequence in the first sequence pair comprises: extending the first sequence to determine the third sequence; and extending the second sequence to determine the fourth sequence. the determining the third sequence in the target sequence pair by performing first processing on the first sequence in the first sequence pair and the determining the fourth sequence in the target sequence pair by performing first processing on the second sequence in the first sequence pair comprises: truncating the first sequence to determine the third sequence; and truncating the second sequence to determine the fourth sequence.

5. The method of claim 4, wherein, the extending the first sequence to determine the third sequence and the extending the second sequence to determine the fourth sequence comprises: copying a first part of the first sequence to a first position of the first sequence to determine the third sequence, a position of the first part of the first sequence being determined by a first index set; and copying a second part of the second sequence to a second position of the second sequence to determine the fourth sequence, a position of the second part of the second sequence being determined by a second index set. The first index set comprises the same indexes as the second index set, and the first position is the same as the second position.

6. The method of claim 5, wherein the first position comprises one or more of a head end of the first sequence, a tail end of the first sequence, two sides of the first sequence, or other positions of the first sequence other than the head end, the tail end, and the two sides; and the second position comprises one or more of a head end of the second sequence, a tail end of the second sequence, two sides of the second sequence, or other positions of the second sequence other than the head end, the tail end, and the two sides.

7. The method of claim 4, wherein, the truncating the first sequence to determine the third sequence and the truncating the second sequence to determine the fourth sequence comprises: truncating a third part of the first sequence to determine the third sequence, a position of the third part of the first sequence being determined by a third index set; and truncating a third part of the second sequence to determine the fourth sequence, a position of the third part of the second sequence being determined by a third index set. intercepting a fourth partial sequence in the second sequence to determine the fourth sequence, a position of the fourth partial sequence being determined by a fourth set of indexes; wherein the third set of indexes includes the same indexes as included in the fourth set of indexes.

8. The method according to any one of claims 5-7, characterized in that, The method further includes: if a length of the first partial sequence is smaller than a length of the third partial sequence, and / or a length of the second partial sequence is smaller than a length of the fourth partial sequence, determining to extend the first sequence to determine the third sequence, and to extend the second sequence to determine the fourth sequence; if the length of the first partial sequence is greater than the length of the third partial sequence, and / or the length of the second partial sequence is greater than the length of the fourth partial sequence, determining to truncate the first sequence to determine the third sequence, and to truncate the second sequence to determine the fourth sequence.

9. The method according to any one of claims 5-8, characterized in that, The method further includes: receiving second indication information, the second indication information being used to indicate a length information of the first partial sequence and / or the second partial sequence, or a length information of the third partial sequence and / or the fourth partial sequence.

10. The method according to any one of claims 1-9, wherein the first processing is performed before or after a Fourier transform.

11. The method according to any one of claims 1 to 10, characterized in that, The method further includes: receiving third indication information, the third indication information being used to indicate a Gold sequence, the Gold sequence being used to determine the first sequence pair.

12. The method according to any one of claims 1 to 11, characterized in that, The method further includes: receiving fourth indication information, the fourth indication information being used to indicate a first permutation combination, the first permutation combination being one of full permutation combinations corresponding to a base size of the sequence, the first permutation combination being used to determine the first sequence pair.

13. The method of claim 12, wherein, The fourth indication information is used to indicate index value information, the index value information being used to indicate a first rule, the first rule being used to determine the first permutation combination.

14. The method of claim 13, wherein, The first rule includes one or more of the following: full ascending order, full descending order, order of pairwise summation being fixed and ascending, order of pairwise summation being fixed and descending, even numbers first and odd numbers second, or odd numbers first and even numbers second.

15. The method of claim 12, wherein, The fourth indication information is used to indicate a full permutation root value, the full permutation root value being used to determine the first permutation combination.

16. A sequence generation method, characterized by, The method includes: determining a first sequence pair based on a base size of a sequence, the first sequence pair including a first sequence and a second sequence; performing first processing on the first sequence in the first sequence pair to determine a third sequence in a target sequence pair, and performing first processing on the second sequence in the first sequence pair to determine a fourth sequence in the target sequence pair, wherein an index of a position at which the first processing is performed on the first sequence and an index of a position at which the first processing is performed on the second sequence are the same, and a rule of the first processing performed on the first sequence and a rule of the first processing performed on the second sequence are the same.

17. The method of claim 16, wherein, The base size of the sequence is determined based on a size of a scheduled frequency domain resource, and / or a density of a reference signal.

18. The method of claim 16 or 17, wherein, The method further includes: sending first indication information, the first indication information being used to indicate the base size of the sequence.

19. The method according to any one of claims 16-18, wherein The first processing of the first sequence in the first sequence pair to determine a third sequence in a target sequence pair and the first processing of the second sequence in the first sequence pair to determine a fourth sequence in the target sequence pair comprises: extending the first sequence to determine the third sequence; extending the second sequence to determine the fourth sequence. The first processing of the first sequence in the first sequence pair to determine a third sequence in a target sequence pair and the first processing of the second sequence in the first sequence pair to determine a fourth sequence in the target sequence pair comprises: truncating the first sequence to determine the third sequence; truncating the second sequence to determine the fourth sequence.

20. The method of claim 19, wherein, The extending the first sequence to determine the third sequence and the extending the second sequence to determine the fourth sequence comprises: copying a first partial sequence in the first sequence to a first position of the first sequence to determine the third sequence, a position of the first partial sequence being determined by a first index set; copying a second partial sequence in the second sequence to a second position of the second sequence to determine the fourth sequence, a position of the second partial sequence being determined by a second index set; wherein the first index set comprises same indexes as the second index set, and the first position is same as the second position.

21. The method of claim 20, wherein: the first position comprises one or more of a head end of the first sequence, a tail end of the first sequence, both sides of the first sequence, or other positions in the first sequence other than the head end, the tail end, or both sides of the first sequence; the second position comprises one or more of a head end of the second sequence, a tail end of the second sequence, both sides of the second sequence, or other positions in the second sequence other than the head end, the tail end, or both sides of the second sequence.

22. The method of claim 19, wherein, The truncating the first sequence to determine the third sequence and the truncating the second sequence to determine the fourth sequence comprises: truncating a third partial sequence in the first sequence to determine the third sequence, a position of the third partial sequence being determined by a third index set; truncating a fourth partial sequence in the second sequence to determine the fourth sequence, a position of the fourth partial sequence being determined by a fourth index set; wherein the third index set comprises same indexes as the fourth index set.

23. The method of any one of claims 20-22, wherein, The method further comprises: if a length of the first partial sequence is less than a length of the third partial sequence, and / or a length of the second partial sequence is less than a length of the fourth partial sequence, determining to extend the first sequence to determine the third sequence and to extend the second sequence to determine the fourth sequence; if the length of the first partial sequence is greater than the length of the third partial sequence, and / or the length of the second partial sequence is greater than the length of the fourth partial sequence, determining to truncate the first sequence to determine the third sequence and to truncate the second sequence to determine the fourth sequence.

24. The method of any one of claims 20-23, wherein, The method further comprises: sending second indication information, the second indication information being used for indicating length information of the first part sequence and / or the second part sequence, or length information of the third part sequence and / or the fourth part sequence.

25. The method of any of claims 16-24, wherein the first processing is before or after performing Fourier transform.

26. The method of any one of claims 16-25, wherein, The method further comprises: sending third indication information, the third indication information being used for indicating a Gold sequence, the Gold sequence being used for determining the first sequence pair.

27. The method of any one of claims 16-26, wherein, The method further comprises: sending fourth indication information, the fourth indication information being used for indicating a first permutation combination, the first permutation combination being one of full permutation combinations corresponding to a base size of the sequence, the first permutation combination being used for determining the first sequence pair.

28. The method of claim 27, wherein, The fourth indication information is used for indicating index value information, the index value information being used for indicating a first rule, the first rule being used for determining the first permutation combination.

29. The method of claim 28, wherein, The first rule comprises one or more of: full ascending order, full descending order, order of pairwise summation being fixed and ascending, order of pairwise summation being fixed and descending, even numbers first and odd numbers second, or odd numbers first and even numbers second.

30. The method of claim 27, wherein, The fourth indication information is used for indicating a full permutation root value, the full permutation root value being used for determining the first permutation combination.

31. A sequence generating apparatus, characterized by comprising: The apparatus comprises a transceiver unit and a processing unit, the processing unit being configured to perform processing operations in the method of any of claims 1-15, and the transceiver unit being configured to perform transceiving operations in the method of any of claims 1-15.

32. A sequence generating apparatus characterized by comprising: The apparatus comprises a transceiver unit and a processing unit, the processing unit being configured to perform processing operations in the method of any of claims 16-30, and the transceiver unit being configured to perform transceiving operations in the method of any of claims 16-30.

33. A sequence generating apparatus, comprising: The apparatus comprises at least one processor and a communication interface, the at least one processor being configured to invoke a computer program or instructions stored in a memory to perform the method of claims 1-15.

34. A sequence generating apparatus characterized by comprising: The apparatus comprises at least one processor and a communication interface, the at least one processor being configured to invoke a computer program or instructions stored in a memory to perform the method of claims 16-30.

35. A communication system, characterized by The communication system comprises: the apparatus of claim 33 and the apparatus of claim 34.

36. A computer-readable storage medium, characterized in that, The computer readable storage medium has stored therein computer programs or instructions which, when executed on a processor, implement the method of any of claims 1-30.

37. A computer program product, characterised in that, The computer program product comprises computer programs or instructions which, when executed on a computer, implement the method of any of claims 1-30.

Images