Communication method and communication apparatus

Abstract

The present application provides a communication method and a communication apparatus. The method comprises: generating a first sequence when 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 sub-sequences, each sub-sequence includes a first sub-sequence, the first sub-sequence is a sequence having the shortest length among the C sub-sequences, the C sub-sequences are each a part of a second sequence, the second sequence is a periodic sequence, and C is an integer greater than 1.

Description

Communication method and communication device

[0001] This application claims priority to the Chinese patent application filed with the State Intellectual Property Office of China on September 27, 2023, with application number 202311287187.3, and priority to the Chinese patent application entitled “A Communication Method and Communication Device”, all contents of which are incorporated by reference into this application. Technical Field

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

[0003] A terminal device (also known as user equipment (UE)) can transmit uplink control information (UCI) on the physical uplink control channel (PUCCH) to deliver hybrid automatic repeat request (HARQ) response information to a network device (e.g., a base station). UCI can be transmitted using coherent transmission based on a demodulation reference signal (DMRS) or non-coherent transmission using DMRS-less transmission.

[0004] To improve the coverage of communication links, especially in areas with low signal-to-noise ratios, a DMRS-less non-coherent transmission method can be used. In a DMRS-less non-coherent transmission method, DMRS signals are not transmitted, 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 recovered at the receiving side through correlation detection. Due to its good autocorrelation characteristics, different cyclic shift versions of the m-sequence are used to carry different UCI information. Specific implementation methods include: determining the m-sequence based on the UCI, modulating the m-sequence, mapping time-frequency resources, and transmitting the signal.

[0005] However, as the number of UCI bits increases, or in other words, the length of the m-sequence increases, the complexity of signal detection by network devices will greatly increase. Therefore, how to reduce the detection complexity of network devices is an urgent problem to be solved.

[0006] Summary of the Invention

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

[0008] In a first aspect, a communication method is provided. This method can be executed by a sending device, or by a chip or circuit used in the sending device, etc., which is not limited in this application. For ease of description, the following description uses execution by a sending device as an example. The sending device can 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 programs.

[0009] The method includes: generating a first sequence when a first condition is met, the first sequence including C subsequences, any subsequence of the C subsequences including the first subsequence, the first subsequence being the shortest sequence among the C subsequences, the C subsequences being part of a second sequence, the second sequence being a periodic sequence, and C being an integer greater than 1; modulating the first sequence to obtain a first signal; and transmitting the first signal over a first resource.

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

[0011] 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. 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.

[0012] It should be noted that the first sequence includes C subsequences, which can be understood as: the first sequence is spliced ​​by C subsequences.

[0013] It should be understood that any subsequence among 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 among the C subsequences except the first subsequence all include q consecutive elements, and the q consecutive elements are the same as all elements included in the first subsequence.

[0014] It should also be understood that each of the C subsequences is part of the second sequence, which can be understood as: each of the C subsequences is obtained by truncating the second sequence. For example, assuming 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 sequence, 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. Another example, assuming 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 sequence, the first subsequence can be represented as [c, d, e, f], the second subsequence can be represented as [a, b, c, d, e, f], the third subsequence can be represented as [b, c, d, e, f, g], etc. The present application does not limit this.

[0015] It should be noted that any one of the C subsequences contains the first subsequence. Assuming that the lengths of these C subsequences are the same, then these C subsequences are C repeated subsequences. Since any one of the C subsequences contains the first subsequence, and the first subsequence is the shortest subsequence among the C subsequences, so in the embodiments of the present application, these C subsequences can also be referred to as C repeated subsequences, and the difference is only that the lengths of some subsequences are greater than the first subsequence, or in other words, 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, where 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], the fifth subsequence is represented as [a, b, c, d, e]. For the convenience of description, these 5 subsequences can be understood as 5 repeated subsequences.

[0016] Exemplarily, the second sequence is the longest linear feedback shift register sequence. For example, this second sequence is an m-sequence, or other periodic sequences. In the embodiments 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 satisfying this equation, and x(n) can be called a periodic sequence with a period of p. Here, the period p is an integer, not a time unit, because the sampling interval is uncertain and its magnitude is also uncertain, and it can be in units such as microseconds, nanoseconds, etc. The present application does not limit this.

[0017] Exemplarily, 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.

[0018] According to the solution provided in this application, when the first condition is met, a first sequence comprising C subsequences is generated, wherein each of the C subsequences is part of a second sequence, and each subsequence comprises the shortest first subsequence. By using the subsequence length as the granularity, truncating the second sequence according to the length of each subsequence to obtain each subsequence, and then deriving and transmitting the first sequence, the detection complexity of the network device can be reduced.

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

[0020] In conjunction 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.

[0021] In a possible implementation, 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.

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

[0023] 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 subsequence transmission is negligible, that is, repeated subsequence transmission does not reduce the BLER performance of UCI detection.

[0024] In conjunction with the first aspect, in certain implementations of the first aspect, L1 = 12*n, where 12 represents 12 resource elements (REs) included in one RB. For example, n can be any one of 5, 6, 7, 8, 9, and 10, i.e., L1 can be any one of 60, 72, 84, 96, 108, and 120.

[0025] 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.

[0026] 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 subsequence transmission is negligible, that is, repeated subsequence transmission does not reduce the BLER performance of UCI detection.

[0027] 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.

[0028] It should be understood that if the difference in length between any two subsequences in the C subsequences is less than the first threshold, it can be understood that the lengths of each subsequence in the C subsequences are similar. For example, 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, f]. Then, the difference in length between the first and second subsequences is 1, the difference in length between the second and third subsequences is 2, and the difference in length between the first and third subsequences is 3. That is, the first threshold can be 4 or 5.

[0029] 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.

[0030] In combination with the first aspect, in certain 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.

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

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

[0033] It should be noted that when generating the first sequence, the terminal device can directly generate each subsequence based on the first information of the UCI and the length of each subsequence, or it can first generate a second sequence based on the first information of the UCI, and then truncate 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.

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

[0035] or, Or,

[0036] Wherein, L1 represents the minimum value of the length N of the first sequence when it satisfies less than or equal to the second threshold, represents the ceiling function, represents the floor function, and round() represents the rounding function.

[0037] In combination with the first aspect, in some implementations of the first aspect, the lengths of the first N%C subsequences among the C subsequences are The lengths of the last C - N%C subsequences among the C subsequences are Wherein, N is the length of the first sequence, represents the ceiling function, represents the floor function, % represents the modulo function, and N is a positive integer.

[0038] Based on this implementation, the lengths of the C subsequences are relatively close, which can enable the network device to have similar powers of the elements included in each subsequence after performing coherent addition processing on the C subsequences, and can ensure the best cross - correlation detection performance.

[0039] In combination with the first aspect, in some implementations of the first aspect, the method further includes: generating a third sequence according to the second sequence under the condition of satisfying the second condition; modulating the third sequence to obtain a second signal; and transmitting the second signal on a second resource.

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

[0041] Exemplarily, the third sequence is determined according to the second sequence, which may include: the third sequence is obtained by truncating the second sequence, or the third sequence is obtained by repeating and splicing the second sequence. Therefore, it can also be understood that the third sequence is spliced by repeating the second sequence. Compared with transmitting multiple repeated subsequences, this implementation can avoid the increase in the detection complexity of the network device.

[0042] 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, where L2 satisfies: L2 = 2 U - 1, U represents the number of bits of UCI, and L1 represents the minimum value of N when it satisfies less than or equal to the second threshold, and the length of the third sequence is N, and N is a positive integer.

[0043] In combination 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: k = max(rond(log2N), U); or k = k max , k max ≥11;

[0044] Wherein, 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.

[0045] In conjunction with the first aspect, in certain implementations of the first aspect, k max It is irrelevant to 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 UCI bits U, and this application does not impose any limitation on this.

[0046] 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 the receiving device, and this application is not limited thereto. For ease of description, the following description is taken as 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 distributed unit (DU) in a network device, or a functional module in a network device that can call and execute a program.

[0047] The method includes: 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 one of the C subsequences includes the first subsequence, the first subsequence is the shortest sequence among the C subsequences, and the C subsequences are all part of a second sequence, where 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), where the first information includes bit values ​​of the UCI.

[0048] Demodulating the first signal to determine the first sequence includes: the network device demodulating the first signal to obtain a sequence, and then determining whether the sequence is the first sequence. Optionally, after receiving the first signal, or when scheduling uplink resources for the terminal device, the network device may determine whether the first condition is satisfied by determining the relationship between the length N of the first sequence and L1 and L2, thereby determining whether the currently received sequence is the first sequence including C subsequences.

[0049] Exemplarily, when a network device configures uplink transmission resources for a 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.

[0050] According to the solution provided in this application, when the first condition is met, a first sequence comprising C subsequences is generated, wherein each of the C subsequences is part of a second sequence, and each subsequence comprises the first subsequence with the shortest length. By segmenting the second sequence and repeatedly transmitting it based on the subsequence length as granularity, the detection complexity of network devices can be reduced.

[0051] 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.

[0052] 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.

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

[0054] or, or,

[0055] 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 round() represents the rounding function.

[0056] 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.

[0057] 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.

[0058] 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 the 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.

[0059] 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 the bit value of UCI.

[0060] 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 then determine whether the currently received sequence is the third sequence.

[0061] 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.

[0062] 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.

[0063] 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: k = max(round(log2N),U); or k = k max , k max ≥11;

[0064] Wherein, 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.

[0065] In combination with the second aspect, in certain 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. This method can be executed by a sending device, or alternatively, by a chip or circuit for the sending device. This application does not make any restrictions in this regard. For the sake of convenience in description, the following takes the execution by the sending device as an example. Among them, the sending device can 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.

[0068] The method includes: when the second condition is satisfied, generating a third sequence. The third sequence is determined according to a second sequence, and the second sequence is a periodic sequence. 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 by this application, when the second condition is satisfied, a third sequence is generated. 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 composed of repeatedly spliced second sequences. Compared with sending multiple repeated sub-sequences, this implementation method can avoid the increase in the detection complexity of network devices.

[0070] In combination with the third aspect, in some implementation manners of the third aspect, that the third sequence is determined according to the second sequence 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 implementation manners of the third aspect, 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 uplink control information UCI, and L1 represents the minimum value of the length N of the third sequence when it satisfies less than or equal to the second threshold, and N is a positive integer.

[0072] In combination with the third aspect, in some implementation manners of the third aspect, the length of the second sequence is 2 k -1, k satisfies any one of the following: k = max(round(log2N), U); or k = k max , k max ≥11;

[0073] Among them, round() represents the rounding function, max() represents the 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.

[0074] In combination with the third aspect, in some implementation manners of the third aspect, k maxIndependent of at least one of N or U.

[0075] Combined with the third aspect, in some implementations of the third aspect, the second sequence is a maximum length linear feedback shift register sequence.

[0076] The beneficial effects of the above-mentioned third aspect and some implementations of the third aspect can be correspondingly referred to the description related to the first aspect, and will not be elaborated here.

[0077] 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 satisfied, the first sequence includes C sub-sequences, any one of the C sub-sequences contains a first sub-sequence, the first sub-sequence is the shortest sequence among the C sub-sequences, the C sub-sequences 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 further configured to modulate the first sequence to obtain a first signal; a transceiver unit, configured to send the first signal on a first resource.

[0078] The transceiver unit can perform the receiving and sending processes in the foregoing first aspect, and the processing unit can perform other processes in the foregoing first aspect except for receiving and sending.

[0079] 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 to determine a first sequence, the first sequence includes C sub-sequences, any one of the C sub-sequences contains a first sub-sequence, the first sub-sequence is the shortest sequence among the C sub-sequences, the C sub-sequences 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 further configured to perform a first process on the first sequence to obtain a first information of the uplink control information UCI, and the first information includes the bit values of the UCI.

[0080] The transceiver unit can perform the receiving and sending processes in the foregoing second aspect, and the processing unit can perform other processes in the foregoing second aspect except for receiving and sending.

[0081] B 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 according to 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; a transceiver unit, configured to send the second signal on a second resource.

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

[0083] In a seventh aspect, a communication device is provided. The communication device includes a transceiver, a processor, and a memory. The processor is configured to control the transceiver to transmit and receive signals. The memory is configured to store a computer program. The processor is configured to retrieve and execute the computer program from the memory, so that the communication device performs the method of any possible implementation of the first to third aspects above.

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

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

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

[0087] 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 configured to execute the method in any possible implementation of the first or third aspect, and the receiving device is configured to execute the method in any possible implementation of the second aspect.

[0088] 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.

[0089] 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.

[0090] In a ninth aspect, a computer program is provided, which, when executed, causes the method in any possible implementation of the first to third aspects to be executed.

[0091] 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.

[0092] In an eleventh aspect, a chip is provided. The chip includes at least one processor coupled to a memory, the memory being configured to store a computer program, and the processor being configured to retrieve and execute the computer program from the memory, so that a communication device equipped with the chip system performs the method of any possible implementation of the first to third aspects above.

[0093] 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.

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

[0095] FIG1 is a schematic diagram of a wireless communication system applicable to an embodiment of the present application.

[0096] FIG2 is a flow chart of a method for generating a DFT-S-OFDM waveform.

[0097] FIG3 is a schematic flow chart of a method for transmitting an m-sequence.

[0098] FIG4 is a flow chart of a communication method provided in an embodiment of the present application.

[0099] FIG5 is a flow chart of a communication method provided in an embodiment of the present application.

[0100] FIG6 and FIG7 are schematic diagrams of subsequence mutual correlation distribution and BLER performance distribution provided by embodiments of the present application.

[0101] FIG8 is a schematic diagram of the structure of a communication device provided in an embodiment of the present application.

[0102] FIG9 is a schematic structural diagram of a communication device provided in an embodiment of the present application.

[0103] FIG10 is a schematic structural diagram of a chip system provided in an embodiment of the present application. DETAILED DESCRIPTION

[0104] The technical solutions in the embodiments of the present application will be described below with reference to the accompanying drawings.

[0105] The technical solutions provided in this application can be applied to various communication systems, such as: fifth generation (5G) or new radio (NR) systems, long term evolution (LTE) systems, LTE frequency division duplex (FDD) systems, LTE time division duplex (TDD) systems, wireless local area networks (WLAN) systems, satellite communication systems, future communication systems, such as sixth generation (6G) mobile communication systems, or a fusion system of multiple systems. The technical solutions provided in this 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 systems or other communication systems.

[0106] A network element in a communication system can send signals to or receive signals from another network element. These signals may include information, signaling, or data. The term "network element" can also be replaced by an entity, network entity, device, communication device, communication module, node, communication node, and the like. This application uses the network element as an example for description. For example, a communication system may include at least one terminal device and at least one network device. A network device can send downlink signals to a terminal device, and / or a terminal device can send uplink signals to a network device.

[0107] 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.

[0108] A terminal device can be a device that provides voice / data to a user, for example, a handheld device with wireless connection function, a vehicle-mounted device, etc. Currently, 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 so on. 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 communication network (public land mobile network, PLMN), etc., the embodiments of the present application are not limited to this.

[0109] As an example and not a limitation, in the embodiment of the present application, the terminal device may also be a wearable device. Wearable devices may also be called 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 achieve powerful functions through software support, data interaction, and cloud interaction. Broadly speaking, wearable smart devices include those that are fully functional, large in size, and can achieve complete or partial functions without relying on smartphones, such as smart watches or smart glasses, as well as those 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 smart bracelets and smart jewelry for vital sign monitoring.

[0110] In the embodiments of the present application, the device for realizing the function of the terminal device can be a terminal device, or a device capable of supporting the terminal device to realize the function, such as a chip system, which can be installed in the terminal device or used in combination with the terminal device. In the embodiments of the present application, the chip system can be composed of a chip, or it can include a chip and other discrete devices. In the embodiments of the present application, only the terminal device is used as an example for description, and the embodiments of the present application are not limited to the solutions of the embodiments of the present application.

[0111] The network device in the embodiments of the present application may be a device for communicating with a terminal device, and may also be referred to as an access network device or a radio access network device. For example, the network device may be a base station. The network device in the embodiments of the present application may refer to a radio 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 replace the following names, such as: NodeB, evolved NodeB (eNB), next generation NodeB (gNB), relay station, access point, transmitting and receiving point (TRP), transmitting point (TP), master station, secondary station, multi-standard radio (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. A base station may also refer to a communication module, modem, or chip used to be set in the aforementioned device or apparatus. A base station may also be a mobile switching center and a device that performs base station functions in D2D, V2X, and M2M communications, a network-side device in a 6G network, or a device that performs base station functions in future communication systems. A base station may support networks with the same or different access technologies. The embodiments of this application do not limit the specific technology and specific device form used by network devices.

[0112] 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.

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

[0114] In some deployments, multiple RAN nodes collaborate to assist terminals in achieving wireless access, with different RAN nodes implementing portions of the base station's functionality. For example, a RAN node can be a CU, DU, CU-CP, CU-UP, or RU. The CU and DU can be separate or included in the same network element, such as the BBU. The RU can be included in a radio frequency device or radio unit, such as an RRU, AAU, or RRH.

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

[0116] 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 an open radio access network (open RAN, ORAN) system, CU may also be referred to as O-CU (open CU), DU may also be referred to as O-DU, CU-CP may also be referred to as O-CU-CP, CU-UP may also be referred to as O-CU-UP, and RU may also be referred to as O-RU. Any of 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.

[0117] 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 illustration, and does not limit the solution of the embodiment of the present application.

[0118] 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 surface; they can also be deployed on aircraft, balloons and satellites in the air. The embodiments of this application do not limit the scenarios in which network devices and terminal devices are located. 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. This application does not limit the specific forms of terminal devices and network devices.

[0119] FIG1 is a schematic diagram of a communication system applicable to the communication method of an embodiment of the present application. As shown in FIG1 , the communication system 100 may include at least one network device, such as the network device 110 shown in FIG1 ; the communication system 100 may also include at least one terminal device, such as the terminal device 120 and the terminal device 130 shown in FIG1 . The network device 110 and the terminal device (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 multi-antenna technology.

[0120] It should be noted that Figure 1 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, which are not shown in Figure 1. In actual applications, the communication system may include multiple network devices and multiple terminal devices. The embodiments of the present application do not limit the number of network devices and terminal devices included in the communication system.

[0121] 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 can communicate according to the method provided by the embodiments of the present application by running a program recorded with 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 can be a terminal device or a network device, or the execution subject can be a functional module in the terminal device or the network device that can call and execute the program.

[0122] To facilitate the understanding of the embodiments of the present application, the terms or technologies involved in the present application will be described first.

[0123] 1. Periodic sequence.

[0124] Definition of periodic sequence: When x(n) = x(n + p), -∞ < n < ∞, and p is the smallest integer that satisfies this 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, and it can be in units such as microseconds and nanoseconds. It should be understood that m-sequences, sine function sequences, cosine function sequences, etc. are all periodic sequences.

[0125] 2. Coverage enhancement.

[0126] The coverage ability of a communication link can be defined as: the maximum tolerable power attenuation (in dB) when electromagnetic waves propagate from the transmitter to the receiver on the premise of ensuring the transmission rate target. Therefore, increasing the maximum tolerable power attenuation is to improve the coverage ability of the communication link, that is, coverage enhancement. The evaluation metrics can be PAPR and cubic metric (CM). The reduction of PAPR and cubic metric (CM) indicates the uplift of the operating point of the power amplifier, which means the increase of the maximum transmission power, and thus can be used to characterize the enhancement of the coverage ability.

[0127] Taking the peak-to-average power ratio (PAPR) as an example, the definition of PAPR is 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 generate nonlinear distortion after passing through the PA, resulting in spectrum spreading and in-band signal distortion, reducing the system performance. In order to avoid the PA entering the nonlinear region, power back-off is required. The higher the PAPR, the higher the power that needs to be backed off, and the power back-off will lead to a decrease in the coverage ability. Therefore, reducing PAPR is beneficial to improving the coverage ability.

[0128] Compared to orthogonal frequency division multiplexing (OFDM) waveforms, discrete Fourier transform spread orthogonal frequency division multiplexing (DET-S-OFDM) waveforms can effectively reduce the PAPR of signals, thereby improving coverage. NR systems support DFT-S-OFDM waveforms, which improve uplink coverage.

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

[0130] Compared to the cyclic prefix orthogonal frequency division multiplexing (CP-OFDM) waveform, the DFT-S-OFDM physical layer processing flow adds a transform precoder. The data is serial-to-parallel converted into parallel data, 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 (OFDMA) superimposes multiple subcarriers in the time domain, while single-carrier OFDM (SC-OFDM) is equivalent to a single subcarrier in the time domain after DFT transformation, resulting in a lower PAPR.

[0131] Currently, the PUCCH channel transmits uplink control information (UCI) bits in the following ways: DMRS-less non-coherent transmission (e.g., PUCCH format 0, transmitting 1 to 2 bits), and DMRS-based coherent transmission (e.g., PUCCH format 3, transmitting 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. The 4 phases of QPSK can usually be {0, π / 2, π, 3π / 2} or {π / 4, 3π / 4, 5π / 4, 7π / 4}.

[0132] 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 =2 data bits. π / 2-BPSK adds phase rotation to BPSK to reduce PAPR. The modulation formula of π / 2-BPSK is as follows:

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

[0134] FIG2 is a flow chart of a method for generating a DFT-S-OFDM signal. The following is an exemplary description using π / 2-BPSK modulation with M subcarriers as an example. As shown in FIG2 , the method includes:

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

[0136] 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)}.

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

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

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

[0140] S1 maps the DMRS signal onto M subcarriers and performs an N-point IFFT to obtain the time-domain signal {x(0), x(1), …, x(N-1)}. N is typically determined by the system bandwidth and is greater than M. When multiple transmitting antennas are present, the frequency-domain signal can also be multiplied by the precoding matrix before subcarrier mapping.

[0141] 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.

[0142] On the receiving side, channel estimation is first performed using DMRS symbols. After obtaining the channel estimate, the data symbols are equalized. After obtaining the equalized data symbols, an IDFT transform is performed to eliminate the effects of DFT precoding. Demodulation is then performed to obtain likelihood information, which is then input into a decoder to obtain the UCI bit value.

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

[0144] 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.

[0145] In the time domain, time domain resources may include one or more time domain units (or, may also be referred to as time units). Time units may be of various granularities. A time unit may be a symbol, or a mini-slot, or a slot, or a subframe, etc. 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, 7 symbols, or 14 symbols, or any number of symbols less than or equal to 14 symbols).

[0146] The time unit can 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).

[0147] 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 (RB), or a bandwidth (BW), or a bandwidth part (BWP), or a carrier (carrier), or a channel (channel), or an interlace (interlace) RB, etc. Optionally, an RB or PRB includes several REs. For example, an RB may include 12 REs, 6 REs, 4 REs, or 24 REs, etc., which is not limited in this application.

[0148] 5. Uplink control information UCI.

[0149] 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.

[0150] UCI can be transmitted on either the PUCCH or the PUSCH. When transmitted on the PUSCH, UCI can be transmitted independently or together with data. To maintain the uplink single-carrier feature, the PUCCH and PUSCH cannot be transmitted separately when their time domain resources overlap. Therefore, the UCI carried by the PUCCH must be transferred to the PUSCH for transmission.

[0151] 6. m sequence.

[0152] 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, 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.

[0153] In one possible implementation, when used to carry the value of the UCI bit, the order k of the primitive polynomial is generally 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 contains 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

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

[0155] Assuming the number of UCI bits is k, then 2 k When 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.

[0156] In one possible implementation, the primitive polynomial is f(x)=x 3 +x 2Taking the all-0 sequence as an example, a total of eight m-sequences can be generated: [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,1]. It can be seen that, except for the all-0 sequence, any other m-sequence is a cyclically shifted 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. Because m-sequences have good autocorrelation properties, the correlation value obtained by the vector inner product of the above different cyclically shifted versions is small.

[0157] 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 Table 1 below.

[0158] Table 1

[0159] It should be noted that the mapping relationship between the UCI bits and the m-sequence shown in Table 1 is only an example given to facilitate 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 impact on the detection performance of the network device.

[0160] 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 selected from the sequence pool and sent.

[0161] FIG3 is a flow chart of a transmission method based on a truncated m-sequence. As shown in FIG3 , the method includes:

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

[0163] 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 has nothing to do with the number of UCI bits k. When the order of the primitive polynomial k max When it is greater than the UCI bit number k, it is necessary to start from k max Select k locations in the memory to map the UCI bits.

[0164] S2, maps k data bits {b(0), b(1), ..., b(k-1)} to the k mapping positions in step S1, and generates a period according to the primitive polynomial m-sequence

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

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

[0167] 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 subjected to a DFT transform at the OFDM symbol granularity. This means that the sequence within each OFDM symbol is independently DFT-transformed and mapped to the time-frequency resources. The preset sequence length can be the number of frequency-domain REs times the number of time-domain OFDM symbols, and truncation can be performed at any position.

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

[0169] 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 truncated to a preset sequence length first, and then π / 2-BPSK modulation is performed to obtain a modulated signal.

[0170] S5 performs an N-point IFFT to obtain the time-domain signal {x(0), x(1), …, x(N-1)}. N is typically determined by the system bandwidth and is greater than k. When multiple transmit antennas are present, the frequency-domain signal can also be multiplied by the precoding matrix before subcarrier mapping.

[0171] S6, adding a cyclic prefix (CP) to the time domain signal and performing digital-to-analog conversion to obtain an analog signal, which is then sent through an antenna.

[0172] Correspondingly, the base station performs sequence correlation detection based on the fast Hadamard transform (FHT). The sequence corresponding to the maximum correlation value is the transmitted sequence. It should be understood that the matrix consisting of all cyclically shifted versions of the m-sequence can be obtained by transforming the rows and columns of the Hadamard matrix. Assuming the Hadamard matrix dimension is N*N, the number of Hadamard matrix additions required is Nlog2N.

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

[0174] 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,1]. Except for the all-0 sequence, all cyclic shift versions of other m-sequences can form the matrix M:

[0175] Adding all 0 vectors to the first row and the first row of the M matrix gives the matrix

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

[0177] Among them, P L and P S is a permutation matrix (each row and column has only one position set to 1), and both dimensions are 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.

[0178] If FHT is not used to reduce detection complexity, 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 first row is padded with 0 elements 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 bits are [0, 1, 0]. The required addition is 2 n *(2 n -1).

[0179] If FHT is used for detection, the received signal and Correlation can be converted into P L HP SSince 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.

[0180] 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 network devices is high. In addition, considering that PUCCH may be repeatedly transmitted in the time domain, the detection complexity is further increased. Therefore, how to reduce the detection complexity of m-sequence transmission is an issue that needs to be considered.

[0181] In view of this, the present application provides a communication method and communication device that, when a first condition is met, generates a first sequence comprising C subsequences, wherein each of the C subsequences is part of a second sequence, and each subsequence comprises the shortest first subsequence. By segmenting the second sequence and repeatedly transmitting it based on the subsequence length as granularity, the detection complexity of network devices can be reduced.

[0182] The above briefly explains the terms involved in this application, which will not be explained in the following embodiments. In addition, the above explanations of the terms are only for ease of understanding and do not limit the scope of protection of the embodiments of this application.

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

[0184] 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 by each other. The technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationships.

[0185] 2) In this application, "at least one" means one or more, and "more" 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 previous and next associated objects are in an "or" relationship. "At least one of the following items" or similar expressions refers to any combination of these items, including any combination of single items 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. Wherein a, b and c can be single or multiple, respectively.

[0186] 3) Throughout this application, the terms "first," "second," and various numerical references are used for descriptive purposes only and are not intended to limit the scope of the embodiments of this application. For example, they are used to distinguish between different messages, rather than to describe a specific order or precedence. It should be understood that these terms are interchangeable, where appropriate, to describe scenarios beyond the embodiments of this application.

[0187] 4) In this application, the terms "comprise" 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.

[0188] 5) In this application, "used to indicate" can include being used for direct indication and being used for indirect indication. When describing that a certain indication information is used to indicate A, it can include that the indication information directly indicates A or indirectly indicates A, and does not necessarily mean that the indication information carries A.

[0189] 6) In this application, "protocol" may refer to a standard protocol in the field of communications, such as a 5G protocol, a 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.

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

[0191] 8) In this application, configuration may refer to the network device being dynamically configured (configured) through signaling or messages, or it may refer to pre-configuration (pre-configured), that is, it may be achieved 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). This application does not limit its specific implementation method.

[0192] 9) In this application, when comparing A and B, the description of "when A is greater than or equal to B, execute method A, when A is less than or equal to B, execute method B" can 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". This application does not limit this.

[0193] 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 communication system shown in Figure 1 above. The technical solution of the present application is specifically described in conjunction with Figure 4. The execution subject can be a sending device or a receiving device, or a chip or circuit for a sending device or a receiving device. Among them, the sending device can 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 can 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 the sake of convenience of description, the following is an example of execution by a terminal device and a network device.

[0194] FIG4 is a flow chart of a communication method provided in an embodiment of the present application. As shown in FIG4 , the method includes:

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

[0196] 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.

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

[0198] Exemplarily, the second sequence is a longest linear feedback shift register sequence. For example, the second sequence is an m-sequence, or other periodic sequence. If 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 embodiments 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 satisfying this equation, and x(n) can be called a periodic sequence with a period of p. Here, 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 in units such as microseconds and nanoseconds, and the present application does not limit this.

[0199] In the embodiments 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 included in the first sequence. For example, assuming the first sequence is represented as [a, b, c, d], it means the length of the first sequence is 4. That is to say, the length of the first sequence can be replaced by the number of elements included in the first sequence. For the convenience of description, the present application takes the length of the first sequence as an example for illustration. Therefore, as the shortest sequence among the C subsequences, it means that the number of elements included in the first subsequence is less than the number of elements included in any one of the C subsequences.

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

[0201] It should also be understood that the C subsequences are all part of the second sequence, which can be understood as: each of the C subsequences is obtained by truncating the second sequence. For example, assuming C = 3, the C subsequences further 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 sequence, 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. Another example, assuming C = 3, the C subsequences further 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 sequence, the first subsequence can be represented as [c, d, e, f], the second subsequence can be represented as [a, b, c, d, e, f], the third subsequence can be represented as [b, c, d, e, f, g], etc., and the present application does not limit this.

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

[0203] or, or,

[0204] 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.

[0205] In one example, the second sequence is determined based on the first information of UCI, and the first information includes the number of bits of UCI and the value of the UCI bit. It should be understood that the first information here includes the total number of bits of UCI 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 bits of UCI and the value of each UCI bit are determined, the second sequence can be determined accordingly. The mapping relationship between the second sequence (for example, m sequence) and the UCI bit can refer to the relevant description above and will not be explained here.

[0206] It should be noted that when generating the first sequence, the terminal device can directly generate each subsequence based on the first information of the UCI and the length of each subsequence, or it can first generate a second sequence based on the first information of the UCI, and then truncate 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.

[0207] For example, 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;

[0208] Wherein, 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.

[0209] Optionally, k max It is irrelevant to 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 UCI bits U, and this application does not impose any limitation on this.

[0210] 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 UCI bits and N is a positive integer.

[0211] 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.

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

[0213] For example, L1=12*n, where 12 represents the 12 REs contained 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.

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

[0215] 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 subsequence transmission is negligible, that is, repeated subsequence transmission does not reduce the BLER performance of UCI detection.

[0216] Optionally, the difference in length between any two subsequences in the C subsequences is less than a first threshold, where the first threshold 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, which can be understood as: the lengths of each subsequence in the C subsequences are close. For example, 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, f]. Then, the difference in length between the first and second subsequences is 1, the difference in length between the second and third subsequences is 2, and the difference in length between the first and third subsequences is 3, i.e., the first threshold can be 4 or 5.

[0217] 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.

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

[0219] Below, taking the second sequence as an m-sequence as an example, a specific implementation method for performing a block operation on the m-sequence to obtain a first sequence containing C subsequences is described, when the number of UCI bits 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.

[0220] 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 subsequence is This means 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 obtained, and the original m-sequence or the truncated m-sequence is truncated according to the length of 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 with a repetition number of 4.

[0221] 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 This means 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 subsequence length; 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 the original m-sequence or the truncated m-sequence is truncated according to the length of 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 with a repetition number of 3.

[0222] 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 subsequence 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 based on the determined subsequence length; or, a subsequence of length 2 can be generated. k -1=2047 m sequence, or generate a length of The truncated m-sequence is obtained, and 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.

[0223] Based on the above examples, it can be found that the block division method of the m-sequence provided in this application can make the lengths of multiple subsequences relatively close. It should be understood that the uniform sequence block division method can make the power of each subsequence similar after coherent addition by the network device, thereby ensuring optimal correlation detection performance.

[0224] 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 this application. The values ​​of the above parameters U, k, N, L2, and L1 are only examples and this application does not limit them.

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

[0226] 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.

[0227] In a possible implementation manner, the first signal is a signal obtained by performing a DFT-s-OFDM waveform on the modulated first sequence.

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

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

[0230] S440: The network device demodulates the first signal and determines a first sequence.

[0231] Exemplarily, the network device demodulates the first signal and determines 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.

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

[0233] 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. Assume 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, the missing elements are padded with 0s to the maximum subsequence length.) For example, given two subsequences [a, b, c, d] and [a, b, c], the last bit of the second subsequence can be padded with 0 during coherent addition, and then the sum can be obtained as [2a, 2b, 2c, d]. It can be found that the closer the subsequence lengths, the closer the power of each sequence element after coherent addition. Correlation detection is then performed using S′. For specific implementation methods, refer to the description of method 300 above.

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

[0235] It should be understood that the above steps S410 to S450 are exemplary descriptions of the first sequence under the condition of satisfying the first condition. By repeating the transmission through C sub-sequences, the detection complexity of the network device is reduced. Optionally, when the first condition is not satisfied, or in other words, when the second condition is satisfied, the terminal device may not perform the chunking operation, that is, the following steps S401 to S405 are executed.

[0236] S401. When the second condition is satisfied, the terminal device generates a third sequence.

[0237] Among them, 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 specific references, please refer to the above relevant descriptions.

[0238] Exemplarily, the third sequence is determined according to the second sequence, and may include: when the length of the second sequence is long enough, for example, when 2 k -1 > N, the third sequence is obtained by truncating the second sequence, or when the length of the second sequence 2 k -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 repeating the second sequence. Compared with transmitting multiple repeated sub-sequences, this implementation method can avoid the increase in the detection complexity of the network device.

[0239] In a possible implementation manner, 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 UCI, and L1 represents the minimum value of N when it satisfies less than or equal to the second threshold. The length of the third sequence is N, and N is a positive integer.

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

[0241] S403. The terminal device sends the second signal to the network device on the second resource. Correspondingly, the network device receives the second signal from the terminal device on the second resource.

[0242] Exemplarily, the second resource can be understood as a resource that includes 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. This application does not make any limitations in this regard.

[0243] Among them, for the specific implementation manners of the above steps S402 and S403, please refer to the relevant descriptions of the above steps S420 and S430, and will not be elaborated here.

[0244] S404. The network device demodulates the second signal to determine the third sequence.

[0245] Exemplarily, the network device demodulating the second signal to determine the third sequence includes: the network device demodulating the second signal to obtain a sequence, and then determining whether the sequence is the third sequence. Optionally, after receiving the second signal, or when configuring scheduling resources for the terminal device, the network device may determine whether the second condition is satisfied by determining the relationship between the length N of the third sequence and L1 and L2, thereby determining whether the currently received sequence is the first sequence comprising C subsequences.

[0246] 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.

[0247] 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.

[0248] According to the solution provided in this application, when the first condition is met, a first sequence comprising C subsequences is generated, wherein each of the C subsequences is part of a second sequence, and each subsequence comprises the first subsequence with the shortest length. By segmenting the second sequence and repeatedly transmitting it based on the subsequence length as granularity, the detection complexity of network devices can be reduced.

[0249] It should be noted that the schemes of performing a block operation and not performing a block operation on the second sequence (e.g., the m-sequence) by the terminal device can be implemented independently or in combination, and this application does not limit this. Below, an example is provided for illustrating the implementation method of not performing a block operation on the m-sequence by the terminal device in conjunction with FIG5.

[0250] FIG5 is a flow chart of a communication method provided in an embodiment of the present application. As shown in FIG5 , the method includes:

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

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

[0253] For example, 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.

[0254] Exemplarily, 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 UCI, and L1 represents the minimum value of N when it satisfies less than or equal to the second threshold. The length of the third sequence is N, and N is a positive integer. That is, the third sequence is generated when the second condition is satisfied. 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 composed of repeated splicing of the second sequence. Compared with sending multiple repeated sub-sequences, this implementation method can avoid the increase in the detection complexity of the network device.

[0255] S520, the terminal device modulates the third sequence to obtain a second signal.

[0256] S530, the terminal device sends the second signal to the network device on the second resource. Correspondingly, the network device receives the second signal from the terminal device on the second resource.

[0257] S540, the network device demodulates the second signal to determine the third sequence.

[0258] S550, the network device performs a second processing on the third sequence to obtain the second information of UCI. Where the second information includes the bit values of UCI.

[0259] Where, for the specific implementation manners of the above steps S510 to S550 and the explanations of related features, reference can be made to the relevant descriptions of steps S401 to S405 of the above method 400. For the sake of brevity, the description will not be repeated here.

[0260] According to the solution provided in this application, the third sequence is generated when the second condition is satisfied. 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 damaged and reduce the detection complexity of the network device.

[0261] Next, for the first sequence generated under the first condition and the third sequence generated under the second condition provided above, in combination with FIGS. 6 and 7, the BLER performance under the condition of satisfying the 1% false alarm rate (FAR) index will be described.

[0262] In the first example, when the PUCCH channel transmits 11-bit UCI, the order k of the primitive polynomial is 11, and the length N of the first sequence is 168, as shown in Figure 6 (a), the horizontal axis represents the normalized correlation value, ranging from 0 to 1, and the vertical axis represents the cumulative distribution function, ranging from 0 to 1. The dotted line indicates that the block operation is not performed, and the solid line indicates that the 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 (such as subsequence 1 and subsequence 2), that is, detecting the similarity of the two subsequences. The more similar the two are, the larger the cross-correlation value is. As shown in Figure 6 (b), the horizontal axis represents the signal-to-noise ratio in dB, ranging from -12 to -4, and the vertical axis represents the block error rate, ranging from 10 -3 The dashed line indicates no blocking operation, while the solid line indicates blocking operation, with the first sequence containing two subsequences. Figure 6(b) shows the BLER performance when false alarms are considered. For example, when L1 is set to 84 and a 1% false alarm is considered, the difference between subsequence 1 and subsequence 2 is 0 dB. This shows that the difference in cross-correlation performance is reflected in a relatively small difference in BLER performance.

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

[0264] In summary, considering a 1% false alarm rate, as long as the length N of the first sequence is sufficiently large, the BLER loss caused by repeated transmission of C subsequences is negligible. This is because the m-sequence can be considered a systematic code. When the length N of the first sequence is long, the actual coding rate is U / L1. Assuming U = 11 and L1 = 84, the coding rate is approximately 1 / 8. However, as U is halved or L1 is doubled, the coding rate may drop from 1 / 8 to 1 / 16, and the corresponding coding gain is negligible. Therefore, transmitting a first sequence consisting of C subsequences, i.e., repeatedly transmitting C subsequences, does not result in a decrease in BLER performance.

[0265] 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.

[0266] In the first example, when 2 U When -1 ≥ N > L1, considering L1 = 60, the terminal device performs a blocking operation (corresponding to the first sequence containing C subsequences) and does not perform a blocking operation (corresponding to the third sequence obtained by truncating or repeating the m-sequence). The network device performs a complexity check and finds that performing the blocking operation can reduce the detection complexity ratio, or in other words, repeatedly sending the C subsequences can reduce the detection complexity. 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; and 30*12 means that the time domain contains 30 OFDM symbols and the frequency domain contains 12 REs.

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

[0268] Table 2

[0269] As shown in Table 2, it can be found that repeating C subsequences (that is, the first sequence contains C subsequences) can reduce the computational complexity by 11.7% to 28.8%. 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, repeating C subsequences can significantly reduce the computational complexity of the network device.

[0270] In the second example, N>2 U -1, when this condition is met, N and 2 k -1 There 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 cycle of the m sequence will be repeated to meet the first sequence length N, so there is no need to perform block operation. k For example, let us assume that N = α*L1>2 U -1, α≥2, then when N<2 k When -1, the detection complexity corresponding to the non-blocking 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,

[0271] It can be seen that when the number of UCI bits U is small, the reduction in FHT complexity brought about 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 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.

[0272] 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. As can be seen from Table 3, 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 is explained.

[0273] Table 3

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

[0275] According to the solution provided in this application, when the first condition is met, a first sequence comprising C subsequences is generated. This approach, by repeatedly sending the C subsequences, can reduce the detection complexity of network devices while also not incurring additional BLER performance loss. When the second condition is met, a third sequence is generated. This approach does not repeatedly send multiple subsequences, thereby ensuring that BLER performance is not compromised and reducing the detection complexity of network devices.

[0276] The communication method embodiment of the present application is described in detail above in conjunction with Figures 1 to 7 . Below, the communication device embodiment of the present application will be described in detail in conjunction with Figures 8 to 10 . It should be understood that the description of the device embodiment corresponds to the description of the method embodiment. Therefore, for portions not described in detail, reference can be made to the above method embodiment.

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

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

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

[0280] 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 dedicated processor or a group processor, etc.) and a memory for executing one or more software or firmware programs, a combined logic circuit and / or other suitable components that support the described functions. In an optional example, those skilled in the art will understand that the device 1000 can be specifically the terminal device in the above embodiment, and can be used to execute the various processes and / or steps corresponding to the terminal device in the above method embodiment, or the device 1000 can be specifically the network device in the above embodiment, and can be used to execute the various processes and / or steps corresponding to the network device in the above method embodiment. To avoid repetition, it will not be described here.

[0281] The apparatus 1000 of each of the above-mentioned solutions 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 solutions 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 to respectively perform the sending and receiving operations and related processing operations in each method embodiment.

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

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

[0284] Optionally, the apparatus 2000 may further include a memory 2030, which communicates with the processor 2010 and the transceiver 2020 via 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.

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

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

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

[0288] 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 non-volatile random access memory. For example, the memory may also store device type information. The processor 2010 may be configured to execute instructions stored in the memory. When the processor 2010 executes the instructions stored in the memory, the processor 2010 is configured to perform the various steps and / or processes of the aforementioned method embodiments corresponding to the terminal device or network device.

[0289] During implementation, each step of the above method can be completed by an integrated logic circuit of the hardware in the processor or by instructions in the form of software. The steps of the method disclosed in conjunction with the embodiments of the present application can be directly embodied as being executed by a hardware processor, or can be executed by a combination of hardware and software modules in the processor. 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 the 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 will not be described in detail here.

[0290] It should be noted that the processor in the embodiments of the present application can be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above-described method embodiment can be completed by hardware integrated logic circuits in the processor or by software instructions. The above-described 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, or a discrete hardware component. The processor in the embodiments of the present application can implement or execute the various methods, steps, and logic block diagrams disclosed in the embodiments of the present application. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the method disclosed in the embodiments of the present application can be directly implemented and executed by a hardware decoding processor, or by a combination of hardware and software modules in the decoding processor. The software module can be located in a storage medium well-known in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, etc. The storage medium is located in the memory, and the processor reads the information in the memory and, in conjunction with its hardware, completes the steps of the above-described method.

[0291] It is understood that the memory in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchronous link DRAM (SLDRAM), and direct RAM bus RAM (DR RAM). 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.

[0292] FIG10 is a schematic block diagram of a chip system provided in an embodiment of the present application. As shown in FIG10 , the chip system 4000 (or also referred to as a processing system) includes a logic circuit 3010 and an input / output interface 3020 .

[0293] Logic circuit 3010 may be a processing circuit in chip system 3000. Logic circuit 3010 may be coupled to a storage unit and call instructions in the storage unit, so that chip system 3000 can implement the methods and functions of various embodiments of the present application. Input / output interface 3020 may be an input / output circuit in chip system 3000, outputting information processed by chip system 3000 or inputting data or signaling information to be processed into chip system 3000 for processing.

[0294] As a solution, the chip system 3000 is used to implement the operations performed by the terminal device or network device in each of the above method embodiments. For example, the logic circuit 3010 is used to implement the processing-related operations performed by the terminal device or network device in the above method embodiments, such as the processing-related operations performed by the terminal device or network device in the embodiment shown in Figure 4 or Figure 5; 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 embodiments, such as the sending and / or receiving-related operations performed by the terminal device or network device in the embodiment shown in Figure 4 or Figure 5.

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

[0296] 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.

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

[0298] 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 and will not be described again here.

[0299] Those skilled 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 beyond the scope of this application.

[0300] Those skilled in the art will 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.

[0301] In the several embodiments provided in this 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 merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, 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.

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

[0303] 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.

[0304] 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, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the method 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.

[0305] The above description is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of this application. Therefore, the scope of protection of this application should be based on the scope of protection 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 L1 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, It represents the floor function, and round() 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 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.

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.

37. A computer program product, characterized in that When the computer program product is executed, the method according to any one of claims 1 to 16 is implemented, or the method according to any one of claims 17 to 28 is implemented, or the method according to any one of claims 29 to 31 is implemented.

Images