Communication method and communication device

Abstract

The invention provides a communication method and a communication device. The method comprises the steps of generating a first sequence under the condition that a first condition is met, modulating the first sequence to obtain a first signal, and sending the first signal on a first resource. Wherein the first sequence comprises C subsequences, each subsequence comprises the first subsequence, the first subsequence is the sequence with the shortest length in the C subsequences, the C subsequences are all one part of the second sequence, the second sequence is a periodic sequence, and C is an integer greater than 1.

Description

Technical Field

[0001] The present application relates to the field of communications, and more specifically, to a communication method and a communication device. Background Art

[0002] The terminal device (also referred to as user equipment (UE)) can transmit uplink control information (UCI) on the physical uplink control channel (PUCCH) to transmit hybrid automatic repeat request (HARQ) response information to the network device (e.g., base station). The UCI transmission method includes: coherent transmission based on demodulation reference signal (DMRS) and non-coherent transmission based on DMRS-less.

[0003] In order to improve the coverage capability of the communication link, especially in the low signal-to-noise ratio area, the DMRS-less non-coherent transmission method can be adopted. In the DMRS-less non-coherent transmission method, no DMRS signal is sent, and the receiving side does not need to perform channel estimation. Instead, the sequence is directly used to carry the UCI information, and the UCI bit information is restored by correlation detection on the receiving side. Due to its good autocorrelation characteristics, different cyclic shift versions of the m sequence are used to carry different UCI information. The specific implementation methods include: determining the m sequence based on UCI, modulating the m sequence, mapping time-frequency resources, and sending signals.

[0004] However, as the number of UCI bits increases, or the length of the m-sequence increases, the complexity of signal detection of network devices will be greatly increased. Therefore, how to reduce the detection complexity of network devices is an urgent problem to be solved. Summary of the invention

[0005] In order to solve the above technical problems, the present application provides a communication method and a communication device to reduce the detection complexity.

[0006] In the first aspect, a communication method is provided. The method may be executed by a sending device, or may be executed by a chip or circuit used for the sending device, and the present application does not limit this. For ease of description, the following description is taken as an example of execution by a sending device. The sending device may be a terminal device, or a chip or circuit in a terminal device, or a functional module in a terminal device that can call and execute a program.

[0007] The method includes: generating a first sequence when a first condition is met, the first sequence includes C subsequences, any subsequence of the C subsequences includes the first subsequence, the first subsequence is the shortest sequence of the C subsequences, the C subsequences are all part of a second sequence, the second sequence is a periodic sequence, and C is an integer greater than 1. Modulating the first sequence to obtain a first signal; and sending the first signal on a first resource.

[0008] Illustratively, the number of the first subsequences may be one or more.

[0009] It should be noted that the length of a sequence can be understood as the number of elements included in the sequence, that is, the length of the first sequence is equal to the number of elements contained in the first sequence. For example, assuming that the first sequence is represented as [a, b, c, d], it means that the length of the first sequence is 4. In other words, the length of the first sequence can be replaced by the number of elements contained in the first sequence. For ease of description, this application takes the length of the first sequence as an example for illustration. Therefore, the first subsequence is the shortest sequence among the C subsequences, indicating that the number of elements contained in the first subsequence is less than the number of elements contained in any of the C subsequences.

[0010] It should be noted that the first sequence includes C subsequences, which can be understood as: the first sequence is formed by splicing C subsequences.

[0011] It should be understood that any subsequence of the C subsequences includes the first subsequence, which can be understood as: each subsequence includes the first subsequence, or, in other words, the other subsequences of the C subsequences except the first subsequence all include q consecutive elements, and the q consecutive elements are the same as all the elements included in the first subsequence.

[0012] It should also be understood that the C subsequences are all part of the second sequence, and it can be understood that: each subsequence in the C subsequences is obtained by truncating the second sequence. For example, assuming that C=3, the C subsequences also include the second subsequence and the third subsequence. If the second sequence is represented as [a, b, c, d, e, f, g], then by truncating the second subsequence: the first subsequence can be represented as [a, b, c], the second subsequence can be represented as [a, b, c, d], the third subsequence can be represented as [a, b, c, d, e, f], etc. For another example, assuming C=3, the C subsequences also include a second subsequence and a third subsequence. If the second sequence is expressed as [a, b, c, d, e, f, g], then by truncating the second subsequence, the first subsequence can be expressed as [c, d, e, t], the second subsequence can be expressed as [a, b, c, d, e, t], the third subsequence can be expressed as [b, c, d, e, f, g], etc., and the present application does not limit this.

[0013] It should be noted that any one of the C subsequences includes the first subsequence. Assuming that the lengths of the C subsequences are the same, the C subsequences are C repeated subsequences. Since any one of the C subsequences includes the first subsequence, and the first subsequence is the shortest subsequence among the C subsequences, the C subsequences may also be referred to as C repeated subsequences in the embodiment of the present application, the only difference being that the length of some subsequences is greater than the first subsequence, or that some subsequences contain other elements in addition to the elements in the first group of sequences. For example, the first sequence contains 5 subsequences, C=5, wherein the first subsequence is represented as [a, b, c], the second subsequence is represented as [a, b, c, d], the third subsequence is represented as [a, b, c, e], the fourth subsequence is represented as [f, a, b, c], and the fifth subsequence is represented as [a, b, c, d, e]. For ease of description, these 5 subsequences may be understood as 5 repeated subsequences.

[0014] Exemplarily, the second sequence is the longest linear feedback shift register sequence. For example, the second sequence is an m-sequence, or other periodic sequence. In an embodiment of the present application, the second sequence is a periodic sequence, which can be understood as: satisfying x(n)=x(n+p), where -∞<n<∞ and p is the smallest integer that satisfies the equation, and x(n) can be called a periodic sequence with p as a period. Among them, the period p is an integer, not a time unit, because the sampling interval is uncertain, and its magnitude is also uncertain, which can be units such as microseconds and nanoseconds, and the present application does not limit this.

[0015] For example, the second sequence is an m-sequence, and the order of the primitive polynomial of the m-sequence is k, then the period of the m-sequence is 2 k -1.

[0016] According to the solution provided by the present application, when the first condition is met, a first sequence including C subsequences is generated, wherein the C subsequences are all part of the second sequence, and each subsequence includes the first subsequence with the shortest length. By taking the length of the subsequence as the granularity, the second sequence is shortened according to the length of each subsequence to obtain each subsequence, and then the first sequence is obtained and sent, which can reduce the detection complexity of the network device.

[0017] Exemplarily, the first resource is a first time-frequency resource.

[0018] In combination with the first aspect, in some implementations of the first aspect, the length of the first sequence is N, and the first condition includes: N>L1, where L1 represents satisfying The minimum value of N when it is less than or equal to the second threshold, U represents the number of bits of uplink control information UCI, and N is a positive integer.

[0019] In a possible implementation manner, the second threshold is related to at least one of U or L1, or in other words, the value of the second threshold is determined by at least one of U or L1.

[0020] Exemplarily, the second threshold includes any one of the following: 1 / 8, or 1 / 16.

[0021] Based on this implementation, by generating a first sequence containing C subsequences when N>L1, the m sequence can be regarded as a system code. When N is large enough, the actual encoding rate is The block error rate (BLER) performance loss caused by repeated transmission of subsequences is negligible, that is, repeated transmission of subsequences will not reduce the BLER performance of UCI detection.

[0022] In conjunction with the first aspect, in some implementations of the first aspect, L1=12*n, where 12 is used to represent 12 resource elements (REs) included in one RB. For example, the value of n can be any one of 5, 6, 7, 8, 9, and 10, that is, L1 can be any one of 60, 72, 84, 96, 108, and 120.

[0023] In combination with the first aspect, in some implementations of the first aspect, the first condition further includes: L2 ≥ N, wherein L2 satisfies: L2 = 2 U -1.

[0024] Based on this implementation, by generating a first sequence containing C subsequences under the condition that L2≥N>L1, the m sequence can be regarded as a system code. When N is large enough, the actual encoding rate is The block error rate (BLER) performance loss caused by repeated transmission of subsequences is negligible, that is, repeated transmission of subsequences will not reduce the BLER performance of UCI detection.

[0025] In combination with the first aspect, in some implementations of the first aspect, the difference between the lengths of any two subsequences in the C subsequences is less than a first threshold, and the first threshold is a positive integer less than or equal to 5.

[0026] It should be understood that the difference between the lengths of any two subsequences in the C subsequences is less than the first threshold, which can be understood as the lengths of each subsequence in the C subsequences are close. Exemplarily, for example, C=3, where the first subsequence is represented as [a, b, c], the second subsequence is represented as [a, b, c, d], and the third subsequence can be represented as [a, b, c, d, e, t]. Then, the difference in length between the first subsequence and the second subsequence is 1, the difference in length between the second subsequence and the third subsequence is 2, and the difference in length between the first subsequence and the third subsequence is 3, that is, the first threshold can be 4 or 5.

[0027] Based on this implementation, the length of each of the C subsequences is close, so that after the network device performs coherent addition processing on the C subsequences, the power of the elements contained in each subsequence is similar, which can ensure the best cross-correlation detection performance.

[0028] In combination with the first aspect, in some implementations of the first aspect, the second sequence is determined according to first information of uplink control information UCI, where the first information includes the number of UCI bits and values ​​of the UCI bits.

[0029] It should be understood that the first information here includes the total number of UCI bits and the value of each UCI bit.

[0030] The second sequence is determined according to the first information of the UCI, which can be understood as: when the total number of bits of the UCI and the value of each UCI bit are determined, the second sequence can be correspondingly determined.

[0031] It should be noted that when generating the first sequence, the terminal device can directly generate each subsequence according to the first information of the UCI and the length of each subsequence, or it can first generate the second sequence according to the first information of the UCI, and then shorten the second sequence to the length of each subsequence to generate each subsequence, or it can directly generate the first sequence by other means, which is not limited in this application.

[0032] In combination with the first aspect, in some implementations of the first aspect, C satisfies any of the following:

[0033] or, or,

[0034] Among them, L1 means satisfying The minimum value of the length N of the first sequence when it is less than or equal to the second threshold, represents the ceiling function, It represents the floor function, and round() represents the rounding function.

[0035] In combination with the first aspect, in certain implementations of the first aspect, the lengths of the first N%C subsequences among the C subsequences are The length of the last CN%C subsequence in C subsequences is Where N is the length of the first sequence, represents the ceiling function, represents the floor function, % represents the remainder function, and N is a positive integer.

[0036] Based on this implementation, the lengths of the C subsequences are relatively close, so that after the network device performs coherent addition processing on the C subsequences, the power of the elements contained in each subsequence is similar, which can ensure the best cross-correlation detection performance.

[0037] In combination with the first aspect, in certain implementations of the first aspect, the method also includes: generating a third sequence when the second condition is met, the third sequence is determined based on the second sequence; modulating the third sequence to obtain a second signal; and sending the second signal on a second resource.

[0038] Exemplarily, the second resource is a second time-frequency resource.

[0039] Exemplarily, the third sequence is determined based on the second sequence, and may include: the third sequence is obtained by truncating the second sequence, or the third sequence is obtained by repeatedly splicing the second sequence, so it can also be understood that the third sequence is spliced ​​by repeated second sequences. Compared with sending multiple repeated subsequences, this implementation method can avoid the increase of detection complexity of network devices.

[0040] In combination with the first aspect, in some implementations of the first aspect, the second condition satisfies at least one of the following: N>L2, or N<L1, wherein L2 satisfies: L2=2 U -1, U represents the number of UCI bits, L1 represents the When the value is less than or equal to the minimum value of N, the length of the third sequence is N, where N is a positive integer.

[0041] In conjunction with the first aspect, in some implementations of the first aspect, the length of the second sequence is 2 k -1, k satisfies any of the following:

[0042] k = max(round(log2N), U); or k = k max , k max ≥11;

[0043] Among them, round() represents a round-to-round function, max() represents a maximum value function, N is the length of the first sequence, U represents the number of bits of uplink control information UCI, and N and k are positive integers.

[0044] In combination with the first aspect, in some implementations of the first aspect, k max It is independent of at least one of N or U. It should be noted that the value of k may be greater than or equal to the number of bits U of the UCI, and this application does not limit this.

[0045] In a second aspect, a communication method is provided. The method may be executed by a receiving device, or may be executed by a chip or circuit for a receiving device, and the present application does not limit this. For ease of description, the following is an example of execution by a receiving device. The receiving device may be a network device, or a chip or circuit in a network device, or a central unit (CU) or a distributed unit (DU) in a network device, or a functional module in a network device that can call and execute a program.

[0046] The method includes: receiving a first signal on a first resource; demodulating the first signal to determine a first sequence, wherein the first sequence includes C subsequences, any one of the C subsequences includes the first subsequence, the first subsequence is the shortest sequence among the C subsequences, the C subsequences are all part of a second sequence, the second sequence is a periodic sequence, and C is an integer greater than 1; performing a first processing on the first sequence to obtain first information of uplink control information UCI, wherein the first information includes bit values ​​of UCI.

[0047] Among them, demodulating the first signal and determining the first sequence includes: the network device obtains a sequence after demodulating the first signal, and then determines whether the sequence is the first sequence. Optionally, after receiving the first signal, or when the network device schedules uplink resources for the terminal device, the network device can determine whether the first condition is met by judging the relationship between the length N of the first sequence and L1 and L2, and then determine whether the currently received sequence is the first sequence containing C subsequences.

[0048] Exemplarily, when the network device configures uplink transmission resources for the terminal device through downlink control information (DCI), it determines whether the first condition is met by judging the size relationship between the length N of the first sequence and L1 and L2, and then determines whether the currently received sequence is the first sequence containing C subsequences.

[0049] According to the solution provided by the present application, when the first condition is met, a first sequence including C subsequences is generated, wherein the C subsequences are all part of the second sequence, and each subsequence includes the first subsequence with the shortest length. By segmenting the second sequence and repeatedly sending it based on the length of the subsequence as the granularity, the detection complexity of the network device can be reduced.

[0050] In combination with the second aspect, in some implementations of the second aspect, the first processing includes at least one of the following: coherent addition or correlation detection.

[0051] In combination with the second aspect, in some implementations of the second aspect, the difference between the lengths of any two subsequences in the C subsequences is less than a first threshold, and the first threshold is a positive integer less than or equal to 5.

[0052] In conjunction with the second aspect, in some implementations of the second aspect, C satisfies any of the following:

[0053] or, or,

[0054] Among them, L1 means satisfying The minimum value of the length N of the first sequence when it is less than or equal to the second threshold, represents the ceiling function, It represents the floor function, and round() represents the rounding function.

[0055] In combination with the second aspect, in some implementations of the second aspect, the second threshold is related to at least one of U or L1.

[0056] In combination with the second aspect, in some implementations of the second aspect, the second threshold includes any one of the following: 1 / 8, or 1 / 16.

[0057] In conjunction with the second aspect, in certain implementations of the second aspect, the lengths of the first N%C subsequences among the C subsequences are The length of the last CN%C subsequence in C subsequences is Where N is the length of the first sequence, represents the ceiling function, represents the floor function, % represents the remainder function, and N is a positive integer.

[0058] In combination with the second aspect, in certain implementations of the second aspect, the method also includes: receiving a second signal on a second resource; demodulating the second signal to determine a third sequence, where the third sequence is determined based on the second sequence; performing a second processing on the third sequence to obtain second information of uplink control information UCI, where the second information includes a bit value of UCI.

[0059] Optionally, after receiving the second signal, or when the network device configures scheduling resources for the terminal device, it can determine whether the second condition is met by judging the size relationship between the length N of the third sequence and L1 and L2, and further determine whether the currently received sequence is the third sequence.

[0060] In combination with the second aspect, in some implementations of the second aspect, the second processing includes at least one of the following: coherent addition or correlation detection.

[0061] In combination with the second aspect, in certain implementations of the second aspect, the third sequence is determined based on the second sequence, including: the third sequence is obtained by truncating the second sequence, or the third sequence is obtained by repeatedly splicing the second sequence.

[0062] In conjunction with the second aspect, in some implementations of the second aspect, the length of the second sequence is 2 k -1, k satisfies any of the following:

[0063] k = max(round(log2N), U); or k = k max , k max ≥11;

[0064] Among them, round() represents a round-to-round function, max() represents a maximum value function, N is the length of the first sequence, U represents the number of bits of uplink control information UCI, and N and k are positive integers.

[0065] In combination with the second aspect, in some implementations of the second aspect, the second sequence is a longest linear feedback shift register sequence.

[0066] The beneficial effects of the above-mentioned second aspect and certain implementation methods of the second aspect can be referred to the description of the first aspect and related implementation methods of the first aspect, and will not be repeated here.

[0067] In a third aspect, a communication method is provided. The method may be executed by a sending device, or may be executed by a chip or circuit for a sending device, and the present application does not limit this. For ease of description, the following description is given by taking the execution by a sending device as an example. The sending device may be a terminal device, or a chip or circuit in a terminal device, or a functional module in a terminal device that can call and execute a program.

[0068] The method includes: generating a third sequence when a second condition is met, the third sequence is determined based on a second sequence, the second sequence is a periodic sequence, and the second condition satisfies any one of the following: N>L2, or, N<L1; modulating the third sequence to obtain a second signal and sending the second signal on a second resource.

[0069] According to the solution provided in the present application, a third sequence is generated when the second condition is met. The third sequence can be obtained by truncating the second sequence or by repeatedly splicing the second sequence. Therefore, it can also be understood that the third sequence is spliced ​​by repeated second sequences. Compared with sending multiple repeated subsequences, this implementation method can avoid the increase of detection complexity of network devices.

[0070] In combination with the third aspect, in certain implementations of the third aspect, the third sequence is determined based on the second sequence, which may include: the third sequence is obtained by truncating the second sequence, or the third sequence is obtained by repeatedly splicing the second sequence.

[0071] In combination with the third aspect, in some implementations of the third aspect, the second condition satisfies any one of the following: N>L2, or N<L1, wherein L2 satisfies: L2=2 U -1, U represents the number of bits of uplink control information UCI, L1 represents the The minimum value of the length N of the third sequence when the value is less than or equal to the second threshold, where N is a positive integer.

[0072] In conjunction with the third aspect, in some implementations of the third aspect, the length of the second sequence is 2 k -1, k satisfies any of the following:

[0073] k = max(round(log2N), U); or k = k max , k max ≥11;

[0074] Among them, round() represents a round-to-round function, max() represents a maximum value function, N is the length of the first sequence, U represents the number of bits of uplink control information UCI, and N and k are positive integers.

[0075] In conjunction with the third aspect, in certain implementations of the third aspect, k max At least one of N or U is independent.

[0076] In combination with the third aspect, in certain implementations of the third aspect, the second sequence is a longest linear feedback shift register sequence.

[0077] The beneficial effects of the third aspect and certain implementation methods of the third aspect can be referred to the relevant description of the first aspect, and will not be repeated here.

[0078] In a fourth aspect, a communication device is provided. The communication device includes: a processing unit, configured to generate a first sequence when a first condition is met, the first sequence includes C subsequences, any subsequence of the C subsequences includes the first subsequence, the first subsequence is the shortest sequence among the C subsequences, the C subsequences are all part of a second sequence, the second sequence is a periodic sequence, and C is an integer greater than 1; the processing unit is also configured to modulate the first sequence to obtain a first signal; and a transceiver unit is configured to send the first signal on a first resource.

[0079] The transceiver unit can perform the reception and transmission processing in the aforementioned first aspect, and the processing unit can perform other processing except reception and transmission in the aforementioned first aspect.

[0080] In a fifth aspect, a communication device is provided. The communication device includes: a transceiver unit, configured to receive a first signal on a first resource; a processing unit, configured to demodulate the first signal, determine a first sequence, the first sequence includes C subsequences, any one of the C subsequences includes the first subsequence, the first subsequence is the shortest sequence among the C subsequences, the C subsequences are all part of a second sequence, the second sequence is a periodic sequence, and C is an integer greater than 1; the processing unit is also configured to perform a first processing on the first sequence to obtain first information of uplink control information UCI, the first information includes the bit value of UCI.

[0081] The transceiver unit can perform the reception and transmission processing in the aforementioned second aspect, and the processing unit can perform other processing except reception and transmission in the aforementioned second aspect.

[0082] In a sixth aspect, a communication device is provided. The communication device includes: a processing unit, configured to generate a third sequence when a second condition is satisfied, the third sequence is determined based on a second sequence, the second sequence is a periodic sequence, and the second condition satisfies any one of the following: N>L2, or, N<L1; the processing unit is further configured to modulate the third sequence to obtain a second signal; and a transceiver unit is configured to send the second signal on a second resource.

[0083] The transceiver unit can perform the receiving and sending processing in the third aspect, and the processing unit can perform other processing except receiving and sending in the third aspect.

[0084] In a seventh aspect, a communication device is provided. The communication device includes a transceiver, a processor, and a memory, wherein the processor is used to control the transceiver to send and receive signals, the memory is used to store a computer program, and the processor is used to call and run the computer program from the memory, so that the communication device executes the method in any possible implementation of the first to third aspects above.

[0085] Optionally, there are one or more processors and one or more memories.

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

[0087] Optionally, the communication device further includes a transmitter (transmitter) and a receiver (receiver).

[0088] In an eighth aspect, a communication system is provided. The communication system includes a sending device and a receiving device, wherein the sending device is used to execute the method in any possible implementation of the first aspect or the third aspect, and the receiving device is used to execute the method in any possible implementation of the second aspect.

[0089] Exemplarily, the sending device may be a terminal device, or a chip or circuit in the terminal device, or a functional module in the terminal device that can call and execute a program.

[0090] Exemplarily, the sending device may be a network device, or a chip or circuit in the network device, or a CU or DU in the network device, or a functional module in the network device that can call and execute a program.

[0091] In a ninth aspect, a computer program is provided. When the computer program is executed, the method in any possible implementation of the first to third aspects is executed.

[0092] In a tenth aspect, a computer-readable storage medium is provided. The computer-readable storage medium stores a computer program or code, and when the computer program or code is executed, the method in any possible implementation of the first to third aspects is executed.

[0093] In an eleventh aspect, a chip is provided. The chip includes at least one processor, the at least one processor is coupled to a memory, the memory is used to store a computer program, and the processor is used to call and run the computer program from the memory, so that a communication device equipped with the chip system executes the method in any possible implementation of the first to third aspects above.

[0094] The chip may include an input circuit or interface for sending information or data, and an output circuit or interface for receiving information or data.

[0095] In a twelfth aspect, a computer program product is provided, which includes: a computer program code, and when the computer program code is executed, the method in any possible implementation manner of the first to third aspects is executed. BRIEF DESCRIPTION OF THE DRAWINGS

[0096] Figure 1 is a schematic diagram of a wireless communication system applicable to an embodiment of the present application.

[0097] Figure 2 The present invention is a flowchart of a method for generating a DFT-S-OFDM waveform.

[0098] Figure 3 The present invention is a flowchart of an m-sequence transmission method.

[0099] Figure 4 It is a flow chart of the communication method provided in the embodiment of the present application.

[0100] Figure 5 It is a flow chart of the communication method provided in the embodiment of the present application.

[0101] Figure 6 and Figure 7 It is a schematic diagram of subsequence mutual correlation distribution and BLER performance distribution provided in an embodiment of the present application.

[0102] Figure 8 It is a schematic diagram of the structure of the communication device provided in an embodiment of the present application.

[0103] Fig. 9 It is a schematic diagram of the structure of the communication device provided in an embodiment of the present application.

[0104] Fig.10 It is a schematic diagram of the structure of the chip system provided in the embodiment of the present application. DETAILED DESCRIPTION

[0105] The technical solutions in the embodiments of the present application will be described below in conjunction with the accompanying drawings.

[0106] The technical solution provided in the present application can be applied to various communication systems, such as: the fifth generation (5th generation, 5G) or new radio (new radio, NR) system, long term evolution (long term evolution, LTE) system, LTE frequency division duplex (frequency division duplex, FDD) system, LTE time division duplex (time division duplex, TDD) system, wireless local area network (wireless local area network, WLAN) system, satellite communication system, future communication system, such as the sixth generation (6th generation, 6G) mobile communication system, or a fusion system of multiple systems, etc. The technical solution provided in the present application can also be applied to device to device (D2D) communication, vehicle-to-everything (V2X) communication, machine to machine (M2M) communication, machine type communication (MTC), and Internet of things (IoT) communication system or other communication systems.

[0107] A network element in a communication system may send a signal to another network element or receive a signal from another network element. The signal may include information, signaling, or data, etc. The network element may also be replaced by an entity, a network entity, a device, a communication device, a communication module, a node, a communication node, etc., and the network element is used as an example for description in this application. For example, the communication system may include at least one terminal device and at least one network device. The network device may send a downlink signal to the terminal device, and / or the terminal device may send an uplink signal to the network device.

[0108] In an embodiment of the present application, the terminal device may also be referred to as user equipment (UE), access terminal, user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent or user device.

[0109] The terminal device can be a device that provides voice / data to the user, for example, a handheld device with wireless connection function, a vehicle-mounted device, etc. At present, some examples of terminals are: mobile phones, customer-premises equipment (CPE), tablet computers, laptop computers, PDAs, mobile internet devices (MID), wearable devices, virtual reality (VR) devices, augmented reality (AR) devices, wireless terminals in industrial control, wireless terminals in self-driving, wireless terminals in remote medical surgery, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, wireless terminals in smart homes, cellular phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (PDAs), and wireless terminals in smart cities. assistant, PDA), handheld devices with wireless communication capabilities, computing devices or other processing devices connected to a wireless modem, wearable devices, terminal devices in a 5G network, or terminal devices in a future evolved public land mobile network (public land mobile network, PLMN), etc., and the embodiments of the present application are not limited to this.

[0110] As an example but not limitation, in the embodiments of the present application, the terminal device may also be a wearable device. Wearable devices may also be referred to as wearable smart devices, which are a general term for wearable devices that are intelligently designed and developed using wearable technology for daily wear, such as glasses, gloves, watches, clothing, and shoes. A wearable device is a portable device that is worn directly on the body or integrated into the user's clothes or accessories. Wearable devices are not only hardware devices, but also powerful functions achieved through software support, data interaction, and cloud interaction. Broadly speaking, wearable smart devices include full-featured, large-sized, and fully or partially independent of smartphones, such as smart watches or smart glasses, as well as devices that only focus on a certain type of application function and need to be used in conjunction with other devices such as smartphones, such as various types of smart bracelets and smart jewelry for vital sign monitoring.

[0111] In the embodiment of the present application, the device for realizing the function of the terminal device may be a terminal device, or a device capable of supporting the terminal device to realize the function, such as a chip system, which may be installed in the terminal device or used in combination with the terminal device. In the embodiment of the present application, the chip system may be composed of a chip, or may include a chip and other discrete devices. In the embodiment of the present application, only the device for realizing the function of the terminal device is used as an example for explanation, and the scheme of the embodiment of the present application is not limited.

[0112] The network device in the embodiment of the present application may be a device for communicating with a terminal device, and the network device may also be referred to as an access network device or a wireless access network device, such as a base station. The network device in the embodiment of the present application may refer to a wireless access network (RAN) node (or device) that connects a terminal device to a wireless network. A base station may broadly cover various names as follows, or be replaced with the following names, such as: NodeB, evolved NodeB (eNB), next generation NodeB (gNB), relay station, access point, transmission point (TRP), transmission point (TP), master station, auxiliary station, multi-standard wireless (motor slide retainer, MSR) node, home base station, network controller, access node, wireless node, access point (AP), transmission node, transceiver node, baseband unit (BBU), remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), central unit (CU), distributed unit (DU), positioning node, etc. A base station may be a macro base station, a micro base station, a relay node, a donor node, or the like, or a combination thereof. The base station may also refer to a communication module, modem or chip used to be set in the aforementioned equipment or device. The base station may also be a mobile switching center and a device that performs the base station function in D2D, V2X, and M2M communications, a network-side device in a 6G network, and a device that performs the base station function in a future communication system. The base station may support networks with the same or different access technologies. The embodiments of the present application do not limit the specific technology and specific device form used by the network equipment.

[0113] Base stations can be fixed or mobile. For example, a helicopter or drone can be configured to act as a mobile base station, and one or more cells can move based on the location of the mobile base station. In other examples, a helicopter or drone can be configured to act as a device that communicates with another base station.

[0114] In some deployments, the network device mentioned in the embodiments of the present application may be a device including a CU, or a DU, or a device including a CU and a DU, or a device including a control plane CU node (central unit control plane (central unit-control plane, CU-CP)) and a user plane CU node (central unit user plane (central unit-userplane, CU-UP)) and a DU node. For example, the network device may include a gNB-CU-CP, a gNB-CU-UP, and a gNB-DU.

[0115] In some deployments, multiple RAN nodes collaborate to assist the terminal in achieving wireless access, and different RAN nodes implement part of the functions of the base station. For example, the RAN node can be a CU, DU, CU-CP, CU-UP, or RU. The CU and DU can be set separately, or can also be included in the same network element, such as a BBU. The RU can be included in a radio frequency device or a radio frequency unit, such as an RRU, AAU, or RRH.

[0116] In one possible design, the processing unit for implementing the baseband function in the BBU is called a baseband high layer (BBH) unit, and the processing unit for implementing the baseband function in the RRU / AAU / RRH is called a baseband low layer (BBL) unit.

[0117] In different systems, CU (or CU-CP and CU-UP), DU or RU may also have different names, but those skilled in the art can understand their meanings. For example, in the open radio access network (open RAN, ORAN) system, CU may also be called O-CU (open CU), DU may also be called O-DU, CU-CP may also be called O-CU-CP, CU-UP may also be called O-CU-UP, and RU may also be called O-RU. Any unit in the CU (or CU-CP, CU-UP), DU and RU in this application may be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0118] In the embodiment of the present application, the device for realizing the function of the network device may be a network device; it may also be a device that can support the network device to realize the function, such as a chip system, a hardware circuit, a software module, or a hardware circuit plus a software module; it may also be a CU or DU (or, O-CU or O-DU) in the network device. The device can be installed in the network device or used in combination with the network device. In the embodiment of the present application, the chip system may be composed of chips, or may include chips and other discrete devices. In the embodiment of the present application, only the device for realizing the function of the network device is used as an example for explanation, and the scheme of the embodiment of the present application is not limited.

[0119] Network devices and terminal devices can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on the water; they can also be deployed on aircraft, balloons and satellites in the air. The scenarios in which network devices and terminal devices are located are not limited in the embodiments of the present application. In addition, terminal devices and network devices can be hardware devices, or they can be software functions running on dedicated hardware, software functions running on general-purpose hardware, such as virtualization functions instantiated on a platform (e.g., a cloud platform), or entities including dedicated or general-purpose hardware devices and software functions. The present application does not limit the specific forms of terminal devices and network devices.

[0120] Figure 1 Schematic diagram of a communication system applicable to the communication method of the embodiment of the present application. Figure 1 As shown, the communication system 100 may include at least one network device, such as Figure 1 The network device 110 shown; the communication system 100 may also include at least one terminal device, such as Figure 1 The terminal device 120 and the terminal device 130 are shown. The network device 110 and the terminal devices (such as the terminal device 120 and the terminal device 130) can communicate via a wireless link. The communication devices in the communication system, for example, the network device 110 and the terminal device 120, can communicate via a multi-antenna technology.

[0121] It should be noted that Figure 1 This is a simplified schematic diagram for ease of understanding. For example, the communication system may also include other devices, such as wireless relay devices and / or wireless backhaul devices. Figure 1 In practical applications, the communication system may include multiple network devices and multiple terminal devices. The embodiment of the present application does not limit the number of network devices and terminal devices included in the communication system.

[0122] It should be noted that the embodiments of the present application do not particularly limit the specific structure of the execution subject of the method provided by the embodiments of the present application. As long as it is possible to communicate according to the method provided by the embodiments of the present application by running a program that records the code of the method provided by the embodiments of the present application, for example, the execution subject of the method provided by the embodiments of the present application may be a terminal device or a network device, or, the execution subject may be a functional module in the terminal device or the network device that can call and execute the program.

[0123] To facilitate understanding of the embodiments of the present application, the terms or technologies involved in the present application are first explained.

[0124] 1. Periodic sequence.

[0125] Definition of periodic sequence: When x(n)=x(n+p), -∞<n<∞, and p is the smallest integer that satisfies the equation, x(n) can be called a periodic sequence with a period of p. It should be noted that the period p is an integer, not a time unit, because the sampling interval is uncertain, and its magnitude is also uncertain, which can be units such as microseconds and nanoseconds. It should be understood that m-sequences, sine function sequences, cosine function sequences, etc. are all periodic sequences.

[0126] 2. Enhanced coverage.

[0127] The coverage capability of a communication link can be defined as: the maximum tolerable power attenuation (in dB) when the electromagnetic wave propagates from the transmitter to the receiver while ensuring the transmission rate target. Therefore, increasing the maximum tolerable power attenuation is to improve the coverage capability of the communication link, that is, coverage enhancement. The evaluation indicators can be PAPR and cubic metric (CM). The reduction of PAPR and cubic metric (CM) represents the increase of the power amplifier operating point, which means the increase of the maximum transmission power, and can therefore be used to represent the enhancement of coverage capability.

[0128] Taking the peak to average power ratio (PAPR) as an example, PAPR is defined as the ratio of the peak power to the average power of the signal. The dynamic range of the power amplifier is limited. When the PAPR is too high, it will cause the power amplifier to enter the nonlinear region. In this case, the signal will produce nonlinear distortion after passing through the PA, causing spectrum expansion and in-band signal distortion, reducing system performance. In order to prevent the PA from entering the nonlinear region, power backoff is required. The higher the PAPR, the higher the power that needs to be backed off, and power backoff will lead to a decrease in coverage. Therefore, reducing the PAPR is conducive to improving coverage.

[0129] Compared with the orthogonal frequency division multiplexing (OFDM) waveform, the discrete Fourier transform spread orthogonal frequency division multiplexing (DET-S-OFDM) waveform can effectively reduce the PAPR of the signal, thereby improving the coverage capability. The NR system supports the DFT-S-OFDM waveform, which improves the uplink coverage capability.

[0130] 3. Discrete Fourier transform spread spectrum orthogonal frequency division multiplexing DET-S-OFDM waveform.

[0131] Compared with the cyclic prefix orthogonal frequency division multiplexing (CP-OFDM) waveform, a transform precoder is added to the physical layer processing flow of DFT-S-OFDM. The data is converted from serial to parallel in sequence, and then discrete Fourier transform (DFT) (transform precoding) is performed in sequence. Although multiple symbols are modulated together, they are transmitted one after another, which is equivalent to a single carrier. Multi-carrier orthogonal frequency division multiple access (orthogonal frequency division multiple access, OFDMA) superimposes multiple subcarriers in the time domain, while single carrier OFDM (single carrier OFDM, SC-OFDM) is equivalent to a single subcarrier in the time domain after DFT transformation, so the PAPR is lower.

[0132] Currently, the PUCCH channel transmits uplink control information (UCI) bits in the following ways: DMRS-less based non-coherent transmission (e.g., PUCCH format 0, transmission of 1 to 2 bits), DMRS-based coherent transmission (e.g., PUCCH format 3, transmission of 3 to 11 bits). It should be understood that π / 2-binary phase shift keying (π / 2-BPSK) modulation uses 2 different phases to represent different information, so one BPSK modulation symbol can carry 1 bit of information. Quadrature phase shift keying (QPSK) modulation uses 4 different phases to represent different information, so one QPSK modulation symbol can carry 2 bits of information, and the 4 phases of QPSK can usually be {0, π / 2, π, 3π / 2} or {π / 4, 3π / 4, 5π / 4, 7π / 4}.

[0133] For example, PUCCH format 3 is transmitted using a DFT-S-OFDM waveform modulated by π / 2-BPSK. The modulation symbol of QPSK can be expressed as: a k and b k is two data bits. π / 2-BPSK adds phase rotation on the basis of BPSK to reduce PAPR. The modulation formula of π / 2-BPSK is as follows:

[0134]

[0135] Wherein, b(i) is the i-th data bit.

[0136] Figure 2 The flowchart of the method for generating a DFT-S-OFDM signal is shown below. The method takes π / 2-BPSK modulation and the number of subcarriers as M as an example for illustrative explanation. Figure 2 As shown, the method includes:

[0137] S1, after being encoded by Reed-Muller codes (RM), obtains M data bits {b(0), b(1), ..., b(M-1)}, and after being modulated by π / 2-BPSK, obtains M modulation symbols {s(0), s(1), ..., s(M-1)}.

[0138] S2, M modulation symbols are subjected to M-point discrete Fourier transform (DFT) to obtain frequency domain signals {X(0), X(1), ..., X(M-1)}.

[0139] S3, maps the frequency domain signal to M subcarriers, and performs an N-point inverse fast Fourier transformation (IFFT) to obtain a time domain signal {x(0), x(1), ..., x(N-1)}. N is usually determined by the system bandwidth, and N is greater than M. N and M are positive integers. When there are multiple transmitting antennas, the frequency domain signal can also be multiplied by the precoding matrix before subcarrier mapping.

[0140] S4, adding a cyclic prefix (CP) to the time domain signal, performing digital-to-analog conversion to obtain an analog signal, and sending it through an antenna.

[0141] The following is an exemplary description of a method for generating a frequency domain demodulation reference signal DMRS sequence.

[0142] S1, map the DMRS signal to M subcarriers, and perform N-point IFFT to obtain the time domain signal {x(0), x(1), ..., x(N-1)}. N is usually determined by the system bandwidth, and N is greater than M. When there are multiple transmitting antennas, the frequency domain signal can also be multiplied by the precoding matrix before subcarrier mapping.

[0143] S2, after adding CP to the time domain signal, performs digital-to-analog conversion to obtain an analog signal, and sends it through the antenna.

[0144] On the receiving side, the DMRS symbol is first used for channel estimation, and after obtaining the channel estimation value, the data symbol needs to be equalized. After obtaining the equalized data symbol, the IDFT transformation is first performed to eliminate the influence of DFT precoding, and then the demodulation operation is performed to obtain the likelihood information, and the likelihood information is input into the decoder to obtain the UCI bit value.

[0145] 4. Time domain unit and frequency domain unit.

[0146] Data and / or signaling may be carried by time-frequency resources, which may include resources in the time domain and resources in the frequency domain.

[0147] In the time domain, the time domain resources may include one or more time domain units (or, may also be referred to as time units). The time unit may be of various granularities. A time unit may be a symbol, or a mini-slot, or a slot, or a subframe, etc. Among them, the time length of a frame is 10 milliseconds (ms), including 10 subframes, that is, the time length corresponding to each subframe is 1ms. A slot consists of 7 or 14 symbols, and a mini-slot may include at least one symbol (for example, 2 symbols or 7 symbols or 14 symbols, or any number of symbols less than or equal to 14 symbols).

[0148] The time unit may be: a physical time unit, or a physical time unit used for transmission, or an available time unit (available, a time unit that can be used for transmission), or an available time unit for transmission, or a time unit actually used for transmission (i.e., a time unit actually used for transmission).

[0149] In the frequency domain, frequency domain resources may include one or more frequency domain units. Frequency domain units may be of various granularities. A frequency domain unit may be a resource element (RE), or a resource block (RB), or a subchannel, or a resource pool, or a bandwidth, or a bandwidth part (BWP), or a carrier, or a channel, or an interlace RB, etc. Optionally, a RB or PRB includes several REs. For example, an RB may include 12 REs, 6 REs, 4 REs, or 24 REs, etc., and this application does not limit this.

[0150] 5. Uplink control information UCI.

[0151] UCI includes an acknowledgement (ACK) / negative acknowledgement (NACK) message of an automatic repeat request HARQ transmission, channel state information (CSI), a scheduling request (SR) message, and the like.

[0152] UCI can be transmitted on PUCCH or PUSCH. UCI can be transmitted alone or together with data on PUSCH. In order to ensure the uplink single carrier feature, PUCCH and PUSCH cannot be transmitted separately when time domain resources overlap. Therefore, UCI carried by PUCCH needs to be transmitted on PUSCH.

[0153] 6. m-sequence.

[0154] m-sequence is the abbreviation of the longest linear feedback shift register sequence. It is the longest period sequence generated by a shift register with linear feedback. Generally speaking, the longest period sequence generated by an n-stage linear feedback shift register is equal to 2 n -1. Exemplarily, the feedback shift register includes a plurality of memories, and the bit data for initialization is stored in the memories, and the feedback function f(a1, a2, ..., a n ) generates a new value and adds it to the memory. The m sequence is determined by the initial bit value stored in the feedback shift register and the primitive polynomial. The order of the primitive polynomial is the highest power in the polynomial. For example, for the primitive polynomial f(x) = x 11 +x 2 +1, the recursive formula for the output sequence is: a k =a k-2 +a k-11 , k ≥ 11, then the order of the primitive polynomial is 11.

[0155] In a possible implementation, when used to carry the value of the UCI bit, the order k of the primitive polynomial is usually greater than or equal to the number of UCI bits U. For example, if the number of UCI bits is 11, then the order k of the primitive polynomial is greater than or equal to 11. Assuming that the order of the primitive polynomial is 11, it means that the feedback register includes 11 memories, and these 11 UCI bits are mapped to a1, a2, ..., a 11 , and then generate subsequent bits based on the feedback function, assuming that the feedback function is the XOR operation of all UCI bits in the memory Then the output sequence is

[0156] The mapping relationship between the UCI bit and the m-sequence is exemplarily described below.

[0157] Assuming the number of UCI bits is k, then 2 kWhen an m-sequence is transmitted, for example, when the transmitted sequence is a modified m-sequence (for example, the modified m-sequence includes truncating the m-sequence or repeating the m-sequence), the UCI bit is used to initialize the shift register state, or the UCI bit can be converted into an index value for selecting a sequence from a sequence pool.

[0158] In one possible implementation, the primitive polynomial is f(x)=x 3 +x 2 +1 as an example, a total of 8 m sequences can be generated, namely [0,0,0,0,0,0,0], [0,0,1,0,1,1,1], [0,1,0,1,1,1,0], [1,0,1,1,1,0,0], [0,1,1,1,0,0,1], [1,1,1,0,0,1,0], [1,1,0,0,1,0,1], [1,0,0,1,0,1,1]. It can be found that except for the all-0 sequence, any other m sequence is a cyclic shift version of a certain m sequence, for example, [0,1,0,1,1,1,0] is obtained by cyclically shifting [0,0,1,0,1,1,1] to the left by 1 bit. Since the m sequence has good autocorrelation performance, the correlation value obtained by the correlation processing of the above different cyclic shift versions, i.e., the vector inner product, is small.

[0159] Optionally, a UCI bit with a length of 3 is used for register state initialization, and the UCI bit corresponds to the first 3 bits in the m sequence, as shown in the following table 1.

[0160] Table 1

[0161] UCI Bits m-sequence [0，0，0] [0，0，0，0，0，0，0] [0，0，1] [0，0，1，0，1，1，1] [0，1，0] [0，1，0，1，1，1，0] [1，0，1] [1，0，1，1，1，0，0] [0，1，1] [0，1，1，1，0，0，1] [1，1，1] [1，1，1，0，0，1，0] [1，1，0] [1，1，0，0，1，0，1] [1，0，0] [1，0，0，1，0，1，1]

[0162] It should be noted that the mapping relationship between the UCI bits and the m-sequences shown in Table 1 is only an example given for ease of understanding and does not constitute any limitation. For example, the m-sequences corresponding to the UCI bits [0, 0, 1] and [0, 1, 0] can be interchanged, which has little effect on the detection performance of the network device.

[0163] In another possible implementation, the UCI bits are converted into decimal numbers, for example, [0, 0, 1] corresponds to 1, and [1, 1, 1] corresponds to 7, and then the first and seventh m-sequences are respectively selected from the sequence pool and sent.

[0164] Figure 3 The figure is a flow chart of a transmission method based on a truncated m-sequence. Figure 3 As shown, the method includes:

[0165] S1, determine the primitive polynomial of the m-sequence and the mapping position of the UCI bit;

[0166] For example, assuming that the order k of the primitive polynomial is max Equal to the number of UCI bits k, or set the order k of the primitive polynomial max It is independent of the number of UCI bits k. max When it is greater than the UCI bit number k, it is necessary to max Select k locations in the memory to map the UCI bits.

[0167] S2, map k data bits {b(0), b(1), ..., b(k-1)} to the k mapping positions in step S1, and generate a period of m-sequence

[0168] For example, taking the feedback shift register as an example, S0=b(0), S1=b(1), ..., s K-1 =b(k-1),….

[0169] S3, for m sequence Perform π / 2-BPSK modulation to obtain the modulated signal

[0170] S4, in order to adapt to the limitation of time-frequency resources, the modulated signal The sequence is truncated to a preset sequence length, and then the sequence is DFT-transformed at the OFDM symbol granularity, that is, the sequence in each OFDM symbol is DFT-transformed independently and mapped to the time-frequency resources. The preset sequence length here can be the number of frequency domain REs * the number of time domain OFDM symbols, and can be truncated from any position.

[0171] It should be noted that if If it is less than the preset sequence length, it needs to be repeated.

[0172] Optionally, the execution order of the above S3 and S4 is not limited. In other words, to adapt to the limitation of time-frequency resources, the m sequence can be shortened to a preset sequence length first, and then π / 2-BPSK modulation is performed to obtain a modulated signal.

[0173] S5, perform IFFT of N points to obtain the time domain signal {x(0), x(1), ..., x(N-1)}. N is usually determined by the system bandwidth, and N is greater than k. When there are multiple transmit antennas, the frequency domain signal can also be multiplied by the precoding matrix before subcarrier mapping.

[0174] S6, adding a cyclic prefix (CP) to the time domain signal and performing digital-to-analog conversion to obtain an analog signal, and sending it through an antenna.

[0175] Correspondingly, the base station side performs sequence correlation detection based on fast Hadamard transform (FHT), where the sequence corresponding to the maximum correlation value is the transmission sequence. It should be understood that the matrix composed of all cyclic shift versions of the m sequence can be obtained by the Hadamard matrix through row-column transformation. Assuming that the dimension of the Hadamard matrix is ​​N*N, the number of additions required for the Hadamard matrix is ​​Nlog2N.

[0176] The following describes an implementation method of performing sequence correlation detection based on FHT at the base station side.

[0177] For example, the primitive polynomial is f(x)=x 3 +x 2 +1 as an example, a total of 8 m sequences can be generated, namely [0,0,0,0,0,0,0], [0,0,1,0,1,1,1], [0,1,0,1,1,1,0], [1,0,1,1,1,0,0], [0,1,1,1,0,0,1], [1,1,1,0,0,1,0], [1,1,0,0,1,0,1], [1,0,0,1,0,1,1]. Except for the all-0 sequence, all cyclic shift versions of other m sequences can form the matrix M:

[0178]

[0179] Adding all 0 vectors to the first and second rows of the M matrix gives the matrix

[0180]

[0181] The relationship between the matrix and the Hadamard matrix is ​​as follows:

[0182]

[0183] Among them, P L and P S is a permutation matrix (only one position in each row and column is 1), and the dimension is 2 n *2 n . H is a Hadamard matrix with a dimension of 2 n *2 n , n is the order of the primitive polynomial.

[0184] If the detection complexity is not reduced based on FHT, the received signal can be correlated with the M matrix. For example, if the received signal is R = [0, 1, 0, 1, 1, 1, 0], the received signal is converted into a binary phase signal [1, -1, 1, -1, -1, -1, 1], the elements in the M matrix are also converted into binary phase signals, and the elements of 0 are padded in the first row to obtain M′, M′*R = [-1, -1, 7, -1, -1, -1, -1, -1]. Therefore, the base station side determines that the transmitted m sequence is the third sequence [0, 1, 0, 1, 1, 1, 0] based on the maximum correlation value, and further determines that the transmitted UCI bit is [0, 1, 0], and the required addition is 2 n *(2 n -1).

[0185] If FHT is used for detection, the received signal and can be converted into P L HP S Since there is only one 1 in each row and column of the row-column permutation matrix, the addition complexity can be ignored, and the addition complexity of multiplying any matrix with the Hadamard matrix is ​​2 n *log2(2 n -1), thus reducing the computational complexity.

[0186] In summary, assuming that the UCI bit length is U, N is the preset sequence length, and the order of the primitive polynomial is k, when the period of the m sequence is 2 k When -1≥N, without considering the complexity of finding the maximum energy, the detection complexity is If UCI-len or N is large, the detection complexity of the network device is high. In addition, considering that PUCCH may be repeatedly transmitted in the time domain, the detection complexity will be further increased. Therefore, how to reduce the detection complexity of the m sequence during transmission is an issue that needs to be considered at present.

[0187] In view of this, the present application provides a communication method and a communication device, which, when a first condition is met, generates a first sequence including C subsequences, wherein the C subsequences are all part of a second sequence, and each subsequence includes a first subsequence with the shortest length. By segmenting the second sequence and repeatedly sending it based on the length of the subsequence as a granularity, the detection complexity of the network device can be reduced.

[0188] The above briefly describes the terms involved in this application, which will not be described in the following embodiments. In addition, the above description of terms is only for the sake of ease of understanding, and does not limit the protection scope of the embodiments of this application.

[0189] To facilitate understanding of the embodiments of the present application, the following points are explained:

[0190] 1) In this application, unless otherwise specified or there is a logical conflict, the terms and / or descriptions between different embodiments are consistent and can be referenced to each other. The technical features in different embodiments can be combined to form new embodiments according to their internal logical relationships.

[0191] 2) In this application, "at least one" means one or more, and "more than one" means more than two (including two). "And / or" describes the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural. In the text description of this application, the character " / " generally indicates that the associated objects before and after are in an "or" relationship. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b and c can mean: a, or b, or c, or a and b, or a and c, or b and c, or a, b and c. Where a, b and c can be single or multiple, respectively.

[0192] 3) In the present application, "first", "second" and various numerical references are used to distinguish for the convenience of description and are not used to limit the scope of the embodiments of the present application. For example, they are used to distinguish different messages, etc., rather than to describe a specific order or sequence. It should be understood that the objects described in this way can be interchanged where appropriate so as to be able to describe solutions other than the embodiments of the present application.

[0193] 4) In the present application, the terms "include" and "have" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or apparatus comprising a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to these processes, methods, products or apparatuses.

[0194] 5) In this application, "used for indication" may include being used for direct indication and being used for indirect indication. When describing that a certain indication information is used for indicating A, it may include that the indication information directly indicates A or indirectly indicates A, but it does not mean that the indication information must carry A.

[0195] 6) In this application, "protocol" may refer to a standard protocol in the field of communications, such as 5G protocol, new radio (NR) protocol and related protocols used in future communication systems, which are not limited in this application. "Predefined" may include pre-definition, such as protocol definition. "Preconfiguration" may be implemented by pre-saving corresponding codes, tables or other methods that can be used to indicate relevant information in the device, and this application does not limit its specific implementation method.

[0196] 7) In this application, "communication" can also be described as "data transmission", "information transmission", "data processing", etc. "Transmission" includes "sending" and "receiving".

[0197] 8) In the present application, configuration may refer to a network device being dynamically configured (configured) through signaling or messages, or it may refer to pre-configuration (pre-configured), that is, it may be implemented by pre-saving corresponding codes, tables or other methods that can be used to indicate relevant information in a device (for example, a terminal device). The present application does not limit its specific implementation method.

[0198] 9) In the present application, when comparing A and B, the description of "when A is greater than or equal to B, execute method A, and when A is less than or equal to B, execute method B" may be specifically implemented as "when A is greater than or equal to B, execute method A; or, when A is less than B, execute method B", or "when A is greater than B, execute method A; or, when A is less than or equal to B, execute method B", and the present application does not limit this.

[0199] The communication method provided by the embodiment of the present application will be described in detail below with reference to the accompanying drawings. The embodiment provided by the present application can be applied to the above Figure 1 In the communication system shown. Figure 4 The technical solution of the present application is specifically described. The execution subject may be a sending device or a receiving device, or a chip or circuit for a sending device or a receiving device. The sending device may be a terminal device, or a chip or circuit in a terminal device, or a functional module in a terminal device that can call and execute a program. The receiving device may be a network device, or a chip or circuit in a network device, or a CU or distributed unit DU in a network device, or a functional module in a network device that can call and execute a program. For ease of description, the following is an example of execution by a terminal device and a network device.

[0200] Figure 4 is a flow chart of the communication method provided in the embodiment of the present application. Figure 4 As shown, the method includes:

[0201] S410: When a first condition is met, the terminal device generates a first sequence.

[0202] The first sequence includes C subsequences, any subsequence of the C subsequences contains the first subsequence, the first subsequence is the shortest sequence among the C subsequences, the C subsequences are all part of the second sequence, the second sequence is a periodic sequence, and C is an integer greater than 1.

[0203] Illustratively, the number of the first subsequences may be one or more.

[0204] Exemplarily, the second sequence is the longest linear feedback shift register sequence. For example, the second sequence is an m-sequence, or other periodic sequence, the order of the primitive polynomial of the m-sequence is k, then the period of the m-sequence is 2 k -1. In the embodiment of the present application, the second sequence is a periodic sequence, which can be understood as: satisfying x(n)=x(n+p), where -∞<n<∞ and p is the smallest integer that satisfies the equation, and x(n) can be called a periodic sequence with p as a period. Among them, the period p is an integer, not a time unit, because the sampling interval is uncertain, and its magnitude is also uncertain, which can be units such as microseconds and nanoseconds, and the present application does not limit this.

[0205] In the embodiment of the present application, the length of a sequence can be understood as the number of elements included in the sequence, that is, the length of the first sequence is equal to the number of elements contained in the first sequence. For example, assuming that the first sequence is represented as [a, b, c, d], it means that the length of the first sequence is 4. In other words, the length of the first sequence can be replaced by the number of elements contained in the first sequence. For the sake of ease of description, the present application takes the length of the first sequence as an example for explanation. Therefore, the first subsequence is the shortest sequence among the C subsequences, indicating that the number of elements contained in the first subsequence is less than the number of elements contained in any one of the C subsequences.

[0206] It should be understood that any subsequence of the C subsequences includes the first subsequence, which can be understood as: each subsequence includes the first subsequence, or, in other words, the other subsequences of the C subsequences except the first subsequence all include q consecutive elements, and the q consecutive elements are the same as all the elements included in the first subsequence.

[0207] It should also be understood that the C subsequences are all part of the second sequence, and it can be understood that: each subsequence in the C subsequences is obtained by truncating the second sequence. For example, assuming that C=3, the C subsequences also include the second subsequence and the third subsequence. If the second sequence is represented as [a, b, c, d, e, f, g], then by truncating the second subsequence: the first subsequence can be represented as [a, b, c], the second subsequence can be represented as [a, b, c, d], the third subsequence can be represented as [a, b, c, d, e, f], etc. For another example, assuming C=3, the C subsequences also include a second subsequence and a third subsequence. If the second sequence is expressed as [a, b, c, d, e, f, g], then by truncating the second subsequence, the first subsequence can be expressed as [c, d, e, f], the second subsequence can be expressed as [a, b, c, d, e, f], the third subsequence can be expressed as [b, c, d, e, f, g], etc., and the present application does not limit this.

[0208] For example, C satisfies any of the following:

[0209] or, or,

[0210] Among them, L1 means satisfying The minimum value of the length N of the first sequence when it is less than or equal to the second threshold, or in other words, L1 is the minimum length to ensure that the BLER performance is not impaired, represents the ceiling function, represents the floor function, and round() represents the rounding function. For example, round(5.32)=5.

[0211] In one example, the second sequence is determined based on the first information of UCI, and the first information includes the number of UCI bits and the value of the UCI bit. It should be understood that the first information here includes the total number of UCI bits and the value of each UCI bit. Among them, the second sequence is determined based on the first information of UCI, which can be understood as: when the total number of UCI bits and the value of each UCI bit are determined, the second sequence can be determined accordingly, and the mapping relationship between the second sequence (for example, m sequence) and the UCI bit can refer to the relevant description above, which will not be explained here.

[0212] It should be noted that when generating the first sequence, the terminal device can directly generate each subsequence according to the first information of the UCI and the length of each subsequence, or it can first generate the second sequence according to the first information of the UCI, and then shorten the second sequence to the length of each subsequence to generate each subsequence, or it can directly generate the first sequence by other means, which is not limited in this application.

[0213] For example, the length of the second sequence is 2 k -1, k satisfies any of the following:

[0214] k = max(round(log2N), U); or k = k max , k max ≥11;

[0215] Among them, round() represents a round-to-round function, max() represents a maximum value function, N is the length of the first sequence, U represents the number of bits of uplink control information UCI, and N and k are positive integers.

[0216] Optionally, k max It is independent of at least one of N or U. It should be noted that the value of k may be greater than or equal to the number of bits U of the UCI, and this application does not limit this.

[0217] In a possible implementation, the first condition includes: N>L1, where L1 means that The minimum value of the length N of the first sequence when it is less than or equal to the second threshold, where U represents the number of bits of UCI and N is a positive integer.

[0218] Exemplarily, the second threshold is related to at least one of U or L1, or in other words, the value of the second threshold is determined by at least one of U or L1.

[0219] Exemplarily, the second threshold includes any one of the following: 1 / 8, or 1 / 16.

[0220] For example, L1=12*n, where 12 represents 12 REs contained in 1 RB. For example, the value of n can be any one of 5, 6, 7, 8, 9, and 10, that is, L1 can be any one of 60, 72, 84, 96, 108, and 120.

[0221] In another possible implementation, the first condition includes: L2≥N>L1, where L2 satisfies: L2=2 U -1.

[0222] In this implementation, a first sequence containing C subsequences is generated under the condition that L2≥N>L1. Here, the m sequence can be regarded as a system code. When N is large enough, the actual encoding rate is The BLER performance loss caused by repeated transmission of subsequences is negligible, that is, repeated transmission of subsequences will not reduce the BLER performance of UCI detection.

[0223] Optionally, the difference in length between any two subsequences in the C subsequences is less than a first threshold value, and the first threshold value is a positive integer less than or equal to 5. It should be understood that the difference in length between any two subsequences in the C subsequences is less than the first threshold value, which can be understood as: the length of each subsequence in the C subsequences is close. Exemplarily, for example, C=3, wherein the first subsequence is represented as [a, b, c], the second subsequence is represented as [a, b, c, d], and the third subsequence can be represented as [a, b, c, d, e, f], then the difference in length between the first subsequence and the second subsequence is 1, the difference in length between the second subsequence and the third subsequence is 2, and the difference in length between the first subsequence and the third subsequence is 3, that is, the first threshold value can be 4, or 5.

[0224] In this implementation, the length of each of the C subsequences is close, so that after the network device performs coherent addition processing on the C subsequences, the power of the elements contained in each subsequence is similar, which can ensure the best cross-correlation detection performance.

[0225] For example, the lengths of the first N%C subsequences among the C subsequences are The length of the last CN%C subsequence in C subsequences is Wherein, N is the length of the first sequence, % represents the remainder function, and N is a positive integer.

[0226] Below, taking the second sequence as an m-sequence as an example, when the number of bits of UCI is U, the order of the primitive polynomial of the m-sequence is k, the length of the first sequence is N, and L2 and L1 are set to different values, a specific implementation method of performing a block operation on the m-sequence to obtain a first sequence containing C subsequences is described.

[0227] In the first example, taking U=11, k=11, N=240 as an example, then L2=2 11 -1=2047, assuming L1 is set to 60, then the number of blocks of the m sequence, that is, the number of subsequences contained in the first subsequence Among them, the length of the first N%C=0 subsequence is The length of the subsequent CN%C=4 subsequences is This indicates that the first subsequence contains 4 subsequences, and the length of each subsequence is the same and equal to 60. Therefore, C subsequences can be generated according to the determined subsequence length; or, a subsequence with a length of 2 can be generated. k -1=2047 original m sequence, or generate a length of The truncated m sequence is then truncated according to the length of the C subsequences to obtain C subsequences. It should be understood that in this example, the truncated m sequence does not need to be truncated, and the truncated m sequence with a length of 60 can be repeatedly transmitted, and the number of repetitions is 4.

[0228] In the second example, taking U=11, k=11, N=240 as an example, then L2=2 11 -1=2047, assuming L1 is set to 96, then the number of m-sequence blocks, that is, the number of subsequences contained in the first subsequence The length of the first N%C=0 subsequences is The length of the subsequent CN%C=3 subsequence is It indicates that the first subsequence contains 3 subsequences, and the length of each subsequence is the same and equal to 80. Therefore, C subsequences can be generated according to the determined length of the subsequence; or, an m sequence with a length of 2k-1=2047 can be generated, or a sequence with a length of The truncated m sequence is then truncated according to the length of the C subsequences to obtain C subsequences. It should be understood that in this example, the truncated m sequence does not need to be truncated, and the truncated m sequence with a length of 80 can be repeatedly transmitted, and the number of repetitions is 3.

[0229] In the third example, taking U=11, k=11, N=336 as an example, then L2=2 11 -1=2047, assuming L1 is set to 72, then the number of m-sequence blocks, that is, the number of subsequences contained in the first subsequence The length of the first N%C=1 subsequence is The length of the subsequent CN%C=4 subsequences is This means that the first subsequence contains 5 subsequences, the length of the first subsequence is 68, and the lengths of the next four subsequences are the same and equal to 67. Therefore, C subsequences can be generated according to the determined subsequence lengths; or, a subsequence with a length of 2 can be generated. k -1=2047 m-sequence, or generate a length of The truncated m-sequence is obtained, and then the original m-sequence or the truncated m-sequence is truncated according to the length of C subsequences to obtain C subsequences. In this example, the truncated m-sequence can be truncated to a length of 67 to obtain the last 4 subsequences.

[0230] According to the above examples, it can be found that the block mode of the m sequence provided by the present application can make the lengths of multiple subsequences relatively close. It should be understood that the uniform sequence block mode can make the power of each subsequence of the network device similar after coherent addition, thereby ensuring the best correlation detection performance.

[0231] It should be noted that the above are only examples given for ease of understanding and should not constitute a limitation on the technical solution of the present application. The values ​​of the above parameters U, k, N, L2, and L1 are only examples and are not limited in the present application.

[0232] S420: The terminal device modulates the first sequence to obtain a first signal.

[0233] S430, the terminal device sends a first signal to the network device on the first resource, and correspondingly, the network device receives the first signal from the terminal device on the first resource.

[0234] In a possible implementation manner, the first signal is a signal obtained by subjecting the modulated first sequence to a DFT-s-OFDM waveform.

[0235] Exemplarily, the first resource may be understood as a resource including 14 symbols in the time domain and 12 REs in the frequency domain.

[0236] The modulation method adopted in the above step S420 may be π / 2-BPSK modulation or QPSK modulation. The specific implementation method may refer to the relevant description of the above method 300 and will not be described again here.

[0237] S440: The network device demodulates the first signal to determine a first sequence.

[0238] Exemplarily, the network device demodulates the first signal to determine the first sequence, including: the network device obtains a sequence after demodulating the first signal, and then determines whether the sequence is the first sequence. Optionally, after receiving the first signal, or when the network device schedules uplink resources for the terminal device, the network device can determine whether the first condition is met by judging the size relationship between the length N of the first sequence and L1 and L2, and then determine whether the currently received sequence is the first sequence containing C subsequences. Exemplarily, when the network device configures uplink transmission resources for the terminal device through DCI, it determines whether the first condition is met by judging the size relationship between the length N of the first sequence and L1 and L2, and then determines whether the currently received sequence is the first sequence containing C subsequences.

[0239] S450: The network device performs a first process on the first sequence to obtain first information of UCI, wherein the first information includes a bit value of UCI.

[0240] Exemplarily, the first processing includes at least one of the following: coherent addition or correlation detection. For example, the network device first performs coherent addition on the repeated C subsequence signals, assuming that the received signal is S = [s1, s2, ...s C ], after coherent addition, we can get (If the length of some sequences is shorter than the maximum subsequence length, 0 is added to the missing element position to the maximum subsequence length). For example, if there are two subsequences [a, b, c, d] and [a, b, c], 0 can be added to the last bit of the second subsequence during coherent addition, and then [2a, 2b, 2c, d] is obtained by adding. It can be found that the closer the length of the subsequences, the closer the power of each sequence element after coherent addition; then S′ is used for correlation detection. For the specific implementation method, reference can be made to the relevant description of the above method 300.

[0241] It should be understood that in the coverage scenario, the channel time variability is weak, and the channels experienced by different subsequences are similar, so coherent addition can be used to process the repeated C subsequences.

[0242] It should be understood that the above steps S410 to S450 are exemplary descriptions of the first sequence when the first condition is met, and the detection complexity of the network device is reduced by repeatedly sending C subsequences. Optionally, when the first condition is not met, or when the second condition is met, the terminal device may not perform the block operation, that is, execute the following steps S401 to S405.

[0243] S401: When the second condition is met, the terminal device generates a third sequence.

[0244] The third sequence is determined according to the second sequence, the second sequence is a periodic sequence, and the second sequence may be an m-sequence. For details, please refer to the above related description.

[0245] Exemplarily, the third sequence is determined based on the second sequence, which may include: when the length of the second sequence is long enough, for example, 2 k When -1>N, the third sequence is obtained by truncating the second sequence, or when the length of the second sequence is 2 k When -1<N, the third sequence is obtained by repeatedly splicing the second sequence. Therefore, it can also be understood that the third sequence is spliced ​​by repeated second sequences. Compared with sending multiple repeated subsequences, this implementation method can avoid the increase of detection complexity of network devices.

[0246] In a possible implementation, the second condition satisfies at least one of the following: N>L2, or N<L1, wherein L2 satisfies: L2=2 U -1, U represents the number of UCI bits, L1 represents the When the value is less than or equal to the minimum value of N, the length of the third sequence is N, where N is a positive integer.

[0247] S402: The terminal device modulates the third sequence to obtain a second signal.

[0248] S403, the terminal device sends a second signal to the network device on the second resource, and correspondingly, the network device receives the second signal from the terminal device on the second resource.

[0249] Exemplarily, the second resource may be understood as a resource including 14 symbols in the time domain and 12 REs in the frequency domain. Optionally, the second resource may be the same as or different from the first resource, which is not limited in the present application.

[0250] The specific implementation of the above steps S402 and S403 can refer to the relevant description of the above steps S420 and S430, which will not be described again here.

[0251] S404: The network device demodulates the second signal to determine a third sequence.

[0252] Exemplarily, the network device demodulates the second signal to determine the third sequence, including: the network device obtains a sequence after demodulating the second signal, and then determines whether the sequence is the third sequence. Optionally, after receiving the second signal, or when the network device configures scheduling resources for the terminal device, the network device can determine whether the above second condition is met by determining the size relationship between the length N of the third sequence and L1 and L2, and then determine whether the currently received sequence is the first sequence containing C subsequences.

[0253] S405: The network device performs a second process on the third sequence to obtain second information of the UCI, wherein the second information includes bit values ​​of the UCI.

[0254] Among them, the network device performs sequence correlation detection based on FHT, and the sequence corresponding to the maximum correlation value obtained is the third sequence sent by the terminal device. The specific implementation method can refer to the relevant description of the above method 300 and will not be explained here.

[0255] According to the solution provided by the present application, when the first condition is met, a first sequence including C subsequences is generated, wherein the C subsequences are all part of the second sequence, and each subsequence includes the first subsequence with the shortest length. By segmenting the second sequence and repeatedly sending it based on the length of the subsequence as the granularity, the detection complexity of the network device can be reduced.

[0256] It should be noted that the schemes for the terminal device to perform block operation and not perform block operation on the second sequence (for example, m sequence) can be implemented independently or in combination, and this application does not limit this. Figure 5 An example is given for explaining the implementation method in which the terminal device does not perform the block operation on the m-sequence.

[0257] Figure 5is a flow chart of the communication method provided in the embodiment of the present application. Figure 5 As shown, the method includes:

[0258] S510: When the second condition is met, the terminal device generates a third sequence.

[0259] The third sequence is determined according to the second sequence, the second sequence is a periodic sequence, and the second sequence may be an m-sequence. For details, please refer to the above related description.

[0260] Exemplarily, the third sequence is determined based on the second sequence, which may include: when the length of the second sequence is long enough, for example, 2 k When -1>N, the third sequence is obtained by truncating the second sequence, or when the length of the second sequence is 2 k When -1<N, the third sequence is obtained by repeatedly splicing the second sequence.

[0261] Exemplarily, the second condition satisfies at least one of the following: N>L2, or N<L1, wherein L2 satisfies: L2=2 U -1, U represents the number of UCI bits, L1 represents the When the second condition is met, the third sequence is generated, and the third sequence can be obtained by truncating the second sequence or by repeatedly splicing the second sequence. Therefore, it can be understood that the third sequence is spliced ​​by repeated second sequences. Compared with sending multiple repeated subsequences, this implementation method can avoid the increase of detection complexity of the network device.

[0262] S520: The terminal device modulates the third sequence to obtain a second signal.

[0263] S530, the terminal device sends a second signal to the network device on the second resource, and correspondingly, the network device receives the second signal from the terminal device on the second resource.

[0264] S540: The network device demodulates the second signal to determine a third sequence.

[0265] S550: The network device performs a second process on the third sequence to obtain second information of the UCI, wherein the second information includes a bit value of the UCI.

[0266] Among them, the specific implementation method of the above steps S510 to S550 and the explanation of related features can refer to the relevant description of steps S401 to S405 of the above method 400. For the sake of brevity, they will not be repeated here.

[0267] According to the solution provided in the present application, a third sequence is generated when the second condition is met. The third sequence can be obtained by truncating the second sequence or by repeatedly splicing the second sequence. This implementation method can ensure that the BLER performance is not impaired and reduce the detection complexity of the network device.

[0268] Next, with respect to the first sequence generated under the first condition provided above, and the third sequence generated under the second condition provided above, combined with the attached Figure 6 and Figure 7 , the BLER performance under the condition of meeting the 1% false alarm rate (FAR) indicator is described.

[0269] In the first example, when the PUCCH channel transmits UCI of 11 bits, the order k of the primitive polynomial is 11, and the length N of the first sequence is 168, as shown in FIG. Figure 6 As shown in (a), the horizontal axis represents the normalized correlation value, ranging from 0 to 1, the vertical axis represents the cumulative distribution function, ranging from 0 to 1, the dotted line represents that no block operation is performed, the solid line represents that a block operation is performed, and the first sequence contains 2 subsequences. Figure 6 (a) shows a schematic diagram of the cross-correlation distribution between two subsequences (e.g., subsequence 1 and subsequence 2), that is, detecting the similarity of two subsequences. The more similar the two are, the greater the cross-correlation value is. Figure 6 As shown in (b), the horizontal axis represents the signal-to-noise ratio, in dB, with a value range of -12 to -4, and the vertical axis represents the block error rate, with a value range of 10 -3 To 1, the dotted line indicates that the blocking operation is not performed, the solid line indicates that the blocking operation is performed, and the first sequence includes 2 subsequences. Figure 6 (b) shows a schematic diagram of BLER performance when false alarm is considered, for example, L1 is set to 84, when 1% false alarm is considered, the difference between subsequence 1 and subsequence 2 is 0 dB. It can be seen that the difference in cross-correlation performance is reflected in a small difference in BLER performance.

[0270] In the second example, when the PUCCH channel transmits 11-bit UCI, the order k of the primitive polynomial is 18, and the first sequence length N is 168, as shown in FIG. Figure 7 As shown in (a), the horizontal axis represents the normalized correlation value, ranging from 0 to 1, the vertical axis represents the cumulative distribution function, ranging from 0 to 1, the dotted line represents that no block operation is performed, the solid line represents that a block operation is performed, and the first sequence contains 2 subsequences. Figure 7 (a) shows a schematic diagram of the cross-correlation distribution between two subsequences (eg, subsequence 1 and subsequence 2), as shown in Figure 7As shown in (b), the horizontal axis represents the signal-to-noise ratio, in dB, with a value range of -12 to -4, and the vertical axis represents the block error rate, with a value range of 10 -3 To 1, the dotted line indicates that the blocking operation is not performed, the solid line indicates that the blocking operation is performed, and the first sequence includes 2 subsequences. Figure 7 (b) shows a schematic diagram of BLER performance when false alarm is considered. It can be found that the cross-correlation gap between subsequence 1 and subsequence 2 becomes significantly larger. For example, when L1 is set to 84, when 1% false alarm is considered, the gap between subsequence 1 and subsequence 2 is 0 dB.

[0271] In summary, considering the 1% false alarm, as long as the length N of the first sequence is large enough, the BLER performance loss caused by the repeated transmission of C subsequences can be ignored. This is because the m sequence can be regarded as a system code. When the length N of the first sequence is long, the actual coding rate is U / L1. Assuming U=I1, L1=84, the coding rate is about 1 / 8. As U decreases by half or L1 increases by half, the coding rate may drop from 1 / 8 to 1 / 16, and the corresponding coding gain can be ignored. Therefore, it means that sending the first sequence containing C subsequences, that is, repeatedly sending C subsequences, will not lead to a decrease in BLER performance.

[0272] Below, with respect to the first sequence generated under the first condition provided above, and the third sequence generated under the second condition provided above, in combination with Table 2 and Table 3, an example is given to illustrate how the technical solution of the present application reduces the detection complexity on the network device side.

[0273] In the first example, when 2 U When -1≥N>L1, L1=60 is considered. The terminal device performs a block operation (corresponding to the first sequence containing C subsequences) and does not perform a block operation (corresponding to the third sequence obtained by truncating or repeating the m sequence), so that the network device performs complexity detection and finds that the block operation can reduce the detection complexity ratio, or the detection complexity can be reduced by repeatedly sending C subsequences. For details, see the detection complexity reduction ratio shown in Table 2. As shown in Table 2, 10*12 means that the time domain contains 10 OFDM symbols and the frequency domain contains 12 REs; 15*12 means that the time domain contains 15 OFDM symbols and the frequency domain contains 12 REs; 20*12 means that the time domain contains 20 OFDM symbols and the frequency domain contains 12 REs; 25*12 means that the time domain contains 25 OFDM symbols and the frequency domain contains 12 REs; 30*12 means that the time domain contains 30 OFDM symbols and the frequency domain contains 12 REs.

[0274] For example, the computational complexity corresponding to not performing the block operation is The computational complexity of performing the block operation is

[0275] Table 2

[0276]

[0277] As shown in Table 2, it can be found that the computational complexity can be reduced by 11.7% to 28.8% by repeating C subsequences (that is, the first sequence contains C subsequences). Among them, the length of the first sequence can include 10*12, 15*12, 20*12, 25*12 and 30*12, and U can include 10 and 11. For the same length of the first sequence, as the number of UCI bits increases, the corresponding detection complexity also increases; for the same number of UCI bits U, as the length of the first sequence increases, the corresponding detection complexity also increases. In other words, as the length of the first sequence increases and the number of UCI bits increases, the computational complexity of the network device can be greatly reduced by repeating C subsequences.

[0278] In the second example, N>2 U -1, when this condition is met, N and 2 k -1There are two size relationships: N≥2 k -1 and N<2 k -1, it should be understood that when N<2 k -1, the m sequence will be divided into C repeated subsequences; when N ≥ 2 k -1, the complete period of the m sequence will be repeated to satisfy the first sequence length of N, so there is no need to perform the block operation. k -1 is discussed, for example, assuming that N = α*L1> 2 U -1, α≥2, then when N<2 k When -1, the detection complexity corresponding to the non-block operation is: in, The detection complexity corresponding to the length N of the first sequence is represented; the detection complexity of performing the block operation is: Among them, (α-1)*L1 represents the detection complexity generated when the network device performs coherent addition processing on multiple subsequences. At this time,

[0279] It can be seen that when the number of UCI bits is small, the reduction in FHT complexity brought by repeated subsequence transmission cannot compensate for the increased complexity caused by coherent addition processing. Assuming U = 4, α = 4, L1 = 60, the computational complexity without repeated subsequence transmission is The computational complexity of using subsequence repeated transmission is The repeated transmission of subsequences may cause the complexity to increase by about 102%. UCI_len When -1, you should avoid using the subsequence repeated sending mode.

[0280] In the third example, N < 2 k -1, assuming L1 = 60, k = 11, the complexity gain of the terminal device performing block operation on the m sequence compared to not performing sequence block operation is shown in Table 3. It can be seen from Table 3 that when N < 2 k The case where the detection complexity gains brought by performing the block operation under the condition of -1 are all negative values ​​is explained.

[0281] Table 3

[0282]

[0283] It should be noted that Table 2 and Table 3 are merely examples provided for ease of understanding and do not constitute any limitation on the technical solution of the present application.

[0284] According to the solution provided by the present application, when the first condition is met, a first sequence including C subsequences is generated. In this method, by repeatedly sending C subsequences, the detection complexity of the network device can be reduced, and no additional BLER performance loss is introduced. When the second condition is met, a third sequence is generated. In this method, multiple subsequences are not repeatedly sent, which can ensure that the BLER performance is not impaired and reduce the detection complexity of the network device.

[0285] Combination of the above Figures 1 to 7 The communication method embodiment of the present application is described in detail. Figures 8 to 10 The communication device side embodiment of the present application is described in detail. It should be understood that the description of the device embodiment corresponds to the description of the method embodiment, so the parts not described in detail can refer to the previous method embodiment.

[0286] Figure 8 is a schematic block diagram of a communication device provided in an embodiment of the present application. Figure 8 As shown, the device 1000 may include a transceiver unit 1010 and a processing unit 1020. The transceiver unit 1010 may communicate with the outside, the processing unit 1020 is used for data processing, and the transceiver unit 1010 may also be called a communication interface or a transceiver unit.

[0287] In one possible design, the device 1000 can implement steps or processes corresponding to those executed by the terminal device in the above method embodiment, wherein the processing unit 1020 is used to execute processing-related operations of the terminal device in the above method embodiment, and the transceiver unit 1010 is used to execute transceiver-related operations of the terminal device in the above method embodiment.

[0288] In another possible design, the device 1000 can implement steps or processes corresponding to those executed by the network device in the above method embodiment, wherein the transceiver unit 1010 is used to execute the transceiver related operations of the network device in the above method embodiment, and the processing unit 1020 is used to execute the processing related operations of the network device in the above method embodiment.

[0289] It should be understood that the device 1000 here is embodied in the form of a functional unit. The term "unit" here may refer to an application specific integrated circuit (ASIC), an electronic circuit, a processor (such as a shared processor, a proprietary processor or a group processor, etc.) and a memory for executing one or more software or firmware programs, a merged logic circuit and / or other suitable components that support the described functions. In an optional example, those skilled in the art can understand that the device 1000 can be specifically the terminal device in the above-mentioned embodiment, and can be used to execute the various processes and / or steps corresponding to the terminal device in the above-mentioned method embodiment, or the device 1000 can be specifically the network device in the above-mentioned embodiment, and can be used to execute the various processes and / or steps corresponding to the network device in the above-mentioned method embodiment. To avoid repetition, it is not described here.

[0290] The apparatus 1000 of each of the above-mentioned schemes has the function of implementing the corresponding steps executed by the terminal device in the above-mentioned method, or the apparatus 1000 of each of the above-mentioned schemes has the function of implementing the corresponding steps executed by the network device in the above-mentioned method. The functions can be implemented by hardware, or can be implemented by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above-mentioned functions; for example, the transceiver unit can be replaced by a transceiver (for example, the sending unit in the transceiver unit can be replaced by a transmitter, and the receiving unit in the transceiver unit can be replaced by a receiver), and other units, such as the processing unit, can be replaced by a processor, respectively performing the transceiver operations and related processing operations in each method embodiment.

[0291] In addition, the above-mentioned transceiver unit may also be a transceiver circuit (for example, it may include a receiving circuit and a transmitting circuit), and the processing unit may be a processing circuit. In an embodiment of the present application, the above-mentioned communication device may be a terminal device or a network device in the aforementioned embodiment, or it may be a chip or a chip system, for example: a system on chip (SoC). Among them, the transceiver unit may be an input and output circuit, a communication interface. The processing unit is a processor or a microprocessor or an integrated circuit integrated on the chip. This is not limited here.

[0292] Fig. 9 is a schematic block diagram of a communication device provided in an embodiment of the present application. Fig. 9 As shown, the device 2000 includes a processor 2010 and a transceiver 2020. The processor 2010 and the transceiver 2020 communicate with each other through an internal connection path, and the processor 2010 is used to execute instructions to control the transceiver 2020 to send signals and / or receive signals.

[0293] Optionally, the device 2000 may further include a memory 2030, and the memory 2030 communicates with the processor 2010 and the transceiver 2020 through an internal connection path. The memory 2030 is used to store instructions, and the processor 2010 may execute the instructions stored in the memory 2030.

[0294] In a possible implementation, the apparatus 2000 is used to implement various processes and steps corresponding to the terminal device in the above method embodiment.

[0295] In another possible implementation, the apparatus 2000 is used to implement various processes and steps corresponding to the network device in the above method embodiment.

[0296] It should be understood that the device 2000 can be specifically a terminal device or a network device in the above embodiment, or a chip or a chip system. Correspondingly, the transceiver 2020 can be a transceiver circuit of the chip, which is not limited here. Specifically, the device 2000 can be used to execute the various steps and / or processes corresponding to the terminal device or the network device in the above method embodiment.

[0297] Optionally, the memory 2030 may include a read-only memory and a random access memory, and provide instructions and data to the processor. A portion of the memory may also include a non-volatile random access memory. For example, the memory may also store information about the device type. The processor 2010 may be used to execute instructions stored in the memory, and when the processor 2010 executes instructions stored in the memory, the processor 2010 is used to execute the various steps and / or processes of the above-mentioned method embodiment corresponding to the terminal device or the network device.

[0298] In the implementation process, each step of the above method can be completed by an integrated logic circuit of hardware in a processor or an instruction in the form of software. The steps of the method disclosed in conjunction with the embodiment of the present application can be directly embodied as a hardware processor for execution, or a combination of hardware and software modules in a processor for execution. The software module can be located in a storage medium mature in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in a memory, and the processor reads the information in the memory and completes the steps of the above method in conjunction with its hardware. To avoid repetition, it is not described in detail here.

[0299] It should be noted that the processor in the embodiment of the present application can be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method embodiment can be completed by an integrated logic circuit of hardware in the processor or an instruction in the form of software. The above processor can be a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component. The processor in the embodiment of the present application can implement or execute the methods, steps and logic block diagrams disclosed in the embodiment of the present application. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc. The steps of the method disclosed in the embodiment of the present application can be directly embodied as a hardware decoding processor to perform, or the hardware and software modules in the decoding processor can be combined to perform. The software module can be located in a mature storage medium in the field such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in a memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.

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

[0301] Fig.10 is a schematic block diagram of a chip system provided in an embodiment of the present application. Fig.10 As shown, the chip system 4000 (or may also be called a processing system) includes a logic circuit 3010 and an input / output interface (input / output interface) 3020.

[0302] Among them, the logic circuit 3010 can be a processing circuit in the chip system 3000. The logic circuit 3010 can be coupled to the storage unit and call the instructions in the storage unit so that the chip system 3000 can implement the methods and functions of each embodiment of the present application. The input / output interface 3020 can be an input / output circuit in the chip system 3000, outputting information processed by the chip system 3000, or inputting data or signaling information to be processed into the chip system 3000 for processing.

[0303] As a solution, the chip system 3000 is used to implement the operations performed by the terminal device or the network device in the above method embodiments. For example, the logic circuit 3010 is used to implement the processing-related operations performed by the terminal device or the network device in the above method embodiments, such as Figure 4 or Figure 5 The processing-related operations performed by the terminal device or network device in the embodiment shown; the input / output interface 3020 is used to implement the sending and / or receiving-related operations performed by the terminal device or network device in the above method embodiment, such as Figure 4 or Figure 5 The terminal device or network device in the illustrated embodiment performs operations related to sending and / or receiving.

[0304] An embodiment of the present application also provides a computer-readable storage medium on which are stored computer instructions for implementing the methods executed by a terminal device or a network device in the above-mentioned method embodiments.

[0305] An embodiment of the present application also provides a computer program product, comprising instructions, which, when executed by a computer, implement the methods performed by a terminal device or a network device in the above-mentioned method embodiments.

[0306] An embodiment of the present application also provides a communication system, which includes the terminal device or network device in the above embodiments.

[0307] The explanation of the relevant contents and beneficial effects of any of the above-mentioned devices can be referred to the corresponding method embodiments provided above, which will not be described again here.

[0308] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0309] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be described again here.

[0310] In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

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

[0312] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0313] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application can be essentially or partly embodied in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium and includes several instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0314] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims

1. A communication method, characterized in that: include: When the first condition is met, a first sequence is generated, the first sequence includes C subsequences, any subsequence of the C subsequences includes the first subsequence, the first subsequence is the shortest sequence among the C subsequences, the C subsequences are all part of a second sequence, the second sequence is a periodic sequence, and C is an integer greater than 1; modulating the first sequence to obtain a first signal; The first signal is sent on a first resource.

2. The method according to claim 1, characterized in that The difference between the lengths of any two subsequences in the C subsequences is less than a first threshold, and the first threshold is a positive integer less than or equal to 5.

3. The method according to claim 1 or 2, characterized in that: The second sequence is determined according to first information of uplink control information UCI, where the first information includes the number of bits of the UCI and the value of the UCI bit.

4. The method according to any one of claims 1 to 3, characterized in that The length of the first sequence is N, and the first condition includes: N>L1, where L1 means that The minimum value of N when it is less than or equal to the second threshold, U represents the number of bits of uplink control information UCI, and N is a positive integer.

5. The method according to claim 4, characterized in that The second threshold is related to at least one of U or L1.

6. The method according to claim 4 or 5, characterized in that: The second threshold includes any one of the following: 1 / 8, or 1 / 16.

7. The method according to any one of claims 4 to 6, characterized in that: The U1 is any one of 60, 72, 84, 96, 108, and 120.

8. The method according to any one of claims 4 to 7, characterized in that: The first condition also includes: L2≥N, wherein L2 satisfies: L2=2 U -1.

9. The method according to any one of claims 1 to 8, characterized in that The C satisfies any of the following: or, or, Among them, L1 means satisfying The minimum value of the length N of the first sequence when it is less than or equal to the second threshold, represents the ceiling function, It represents the floor function, and round() represents the rounding function.

10. The method according to any one of claims 1 to 9, characterized in that The lengths of the first N%C subsequences among the C subsequences are The length of the last CN%C subsequence in the C subsequences is Wherein, N is the length of the first sequence, represents the ceiling function, represents the floor function, % represents the remainder function, and N is a positive integer.

11. The method according to any one of claims 1 to 10, characterized in that The method further comprises: When the second condition is met, generating a third sequence, wherein the third sequence is determined according to the second sequence; modulating the third sequence to obtain a second signal; The second signal is sent on a second resource.

12. The method according to claim 11, characterized in that The length of the third sequence is N, and the second condition satisfies at least one of the following: N > L2, or, N < L1, where L2 satisfies: L2 = 2 U -1, U represents the number of bits of the uplink control information UCI, and L1 represents the minimum value of N when it is less than or equal to the second threshold, and N is a positive integer.

13. The method according to claim 11 or 12, characterized in that: The third sequence is determined according to the second sequence, and includes: The third sequence is obtained by truncating the second sequence, or the third sequence is obtained by repeatedly splicing the second sequence.

14. The method according to any one of claims 1 to 13, characterized in that The length of the second sequence is 2 k -1, k satisfies any of the following: k = max(round(log2N),U); or k = k max , k max ≥11; Among them, round() represents a rounding function, max() represents a maximum value function, N is the length of the first sequence, U represents the number of bits of uplink control information UCI, and N and k are positive integers.

15. The method according to claim 14, characterized in that The k max At least one of N or U is independent.

16. The method according to any one of claims 1 to 15, characterized in that The second sequence is the longest linear feedback shift register sequence.

17. A communication method, characterized in that: include: receiving a first signal on a first resource; Demodulating the first signal to determine a first sequence, where the first sequence includes C subsequences, any subsequence of the C subsequences includes the first subsequence, the first subsequence is a sequence with the shortest length among the C subsequences, the C subsequences are all part of a second sequence, the second sequence is a periodic sequence, and C is an integer greater than 1; A first process is performed on the first sequence to obtain first information of uplink control information UCI, where the first information includes a bit value of the UCI.

18. The method according to claim 17, characterized in that: The first processing includes at least one of the following: coherent addition or correlation detection.

19. The method according to claim 17 or 18, characterized in that The difference between the lengths of any two subsequences in the C subsequences is less than a first threshold, and the first threshold is a positive integer less than or equal to 5.

20. The method according to any one of claims 17 to 19, characterized in that The C satisfies any of the following: or, or, Among them, L1 means satisfying The minimum value of the length N of the first sequence when it is less than or equal to the second threshold, represents the ceiling function, represents the floor function, and roumnd() represents the rounding function.

21. The method according to claim 20, characterized in that The second threshold is related to at least one of U or L1.

22. The method according to claim 20 or 21, characterized in that The second threshold includes any one of the following: 1 / 8, or 1 / 16.

23. The method according to any one of claims 17 to 22, characterized in that The lengths of the first N%C subsequences among the C subsequences are The length of the last CN%C subsequence in the C subsequences is Wherein, N is the length of the first sequence, represents the ceiling function, represents the floor function, % represents the remainder function, and N is a positive integer.

24. The method according to any one of claims 17 to 23, characterized in that The method further comprises: receiving a second signal on a second resource; demodulating the second signal to determine a third sequence, where the third sequence is determined based on the second sequence; Perform a second process on the third sequence to obtain second information of uplink control information UCI, where the second information includes a bit value of the UCI.

25. The method according to claim 24, characterized in that: The second processing includes at least one of the following: coherent addition or correlation detection.

26. The method according to claim 24 or 25, characterized in that The third sequence is determined according to the second sequence, and includes: The third sequence is obtained by truncating the second sequence, or the third sequence is obtained by repeatedly splicing the second sequence.

27. The method according to any one of claims 17 to 26, characterized in that The length of the second sequence is 2 k -1, k satisfies any of the following: k = max(round(log2N),U); or k = k max , k max ≥11; Among them, round() represents a rounding function, max() represents a maximum value function, N is the length of the first sequence, U represents the number of bits of uplink control information UCI, and N and k are positive integers.

28. The method according to any one of claims 17 to 28, characterized in that The second sequence is the longest linear feedback shift register sequence.

29. A communication method, characterized in that: include: When the second condition is met, a third sequence is generated, where the third sequence is determined based on the second sequence, where the second sequence is a periodic sequence, and the second condition satisfies any one of the following: N>L2, or N <L1; modulating the third sequence to obtain a second signal; The second signal is sent on a second resource.

30. The method according to claim 29, characterized in that The third sequence is determined according to the second sequence, and includes: The third sequence is obtained by truncating the second sequence, or the third sequence is obtained by repeatedly splicing the second sequence.

31. The method according to claim 29 or 30, characterized in that The length of the third sequence is N, and the second condition satisfies any one of the following: N > L2, or, N < L1, where L2 satisfies: L2 = 2 U -1, U represents the number of bits of the uplink control information UCI, and L1 represents the satisfaction of the minimum value of N when it is less than or equal to the second threshold, and N is a positive integer.

32. A communication device, characterized in that: Used to implement the method as claimed in any one of claims 1-16, or used to implement the method as claimed in any one of claims 29-31.

33. The device according to claim 32, characterized in that The communication device includes any one of the following: a terminal device or a chip.

34. A communication device, characterized in that: Used to implement the method according to any one of claims 17 to 28.

35. The device according to claim 34, characterized in that The communication device includes any one of the following: a network device, a chip, a central unit CU or a distributed unit DU.

36. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program or instructions, and when the computer program or instructions are executed, the method according to any one of claims 1 to 16, the method according to any one of claims 29 to 31, or the method according to any one of claims 17 to 28 is executed.

Images