Communication method and communication apparatus

Abstract

The present application provides a communication method and a communication apparatus, which are applied to the field of communications. In the technical solution provided in the present application, a network device can perform, on the basis of a first sub-sequence, sub-block interleaving processing on a first sequence to be interleaved that includes N sub-blocks, wherein the first sub-sequence includes N elements, the N elements correspond to the N sub-blocks on a one-to-one basis, each of the N elements is used for indicating the serial number of the corresponding sub-block in said first sequence, and the first sub-sequence meets a preset relationship. The present application provides a channel coding scheme in a low-power scenario.

Description

Communication method and communication device

[0001] This application claims priority to the Chinese patent application filed with the China Patent Office on November 27, 2023, with application number 202311604112.3 and application name “Communication Method and Communication Device”, the entire contents of which are incorporated by reference into this application. Technical Field

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

[0003] A low power wake up signal (LP-WUS) was introduced in Release 18 (R18) of the 3rd Generation Partnership Project (3GPP) to support the low latency and ultra-low power consumption mechanism of terminal devices in R18. The terminal device uses a separate low power wake up receiver (LP-WUR) to listen to LP-WUS and uses the main receiver to process uplink and downlink data. Before receiving the LP-WUS, the terminal device can set the main receiver to be turned off or to a deep sleep state. After receiving the LP-WUS, the terminal device wakes up the main receiver to receive and transmit data, thereby achieving energy saving. However, after the introduction of LP-WUS, the channel coding scheme during LP-WUS transmission has become an urgent problem that needs to be solved. Summary of the Invention

[0004] The present invention provides a communication method and a communication device for use in the field of wireless communications. The present invention provides a channel coding scheme for transmitting a low power wake-up signal (LP-WUS) in a low power scenario.

[0005] In a first aspect, the present application provides a communication method, which is applied to a network device, and the method includes: obtaining a first sequence to be interleaved, the first sequence to be interleaved includes N sub-blocks, and N is an integer greater than 1; performing sub-block interleaving processing on the first sequence to be interleaved based on the first sub-sequence, the first sub-sequence includes N elements, the N elements correspond one-to-one to the N sub-blocks, each element of the N elements is used to indicate the sequence number of the corresponding sub-block in the first sequence to be interleaved, and the first sub-sequence satisfies a preset relationship.

[0006] As an example, the method may be executed by a network device, or may be executed by a chip system, a hardware circuit and / or a software module applied to the network device.

[0007] As an example, in a low-power scenario, when a network device sends a low-power wake-up signal (LP-WUS) to a terminal device, the network device can encode the LP-WUS based on a polar code channel coding scheme, and then implement rate matching based on a sub-block interleaving rate matching method. For example, when the encoded LP-WUS is a mother code long polar code with a length of Z (Z is a positive integer power of 2), the network device can divide the Z polar code bits into N sub-blocks, where N is an integer greater than 1, and each sub-block can contain Z / N bits. At this time, the sequence composed of N sub-blocks can be called a first sequence to be interleaved; after determining the first sequence to be interleaved, the network device can perform sub-block interleaving on the first sequence to be interleaved based on the first sub-sequence S(j) to obtain a first interleaved sequence, thereby obtaining an interleaved Z bit sequence, and perform rate matching on the interleaved Z bit sequence using a sub-block-based rate matching method. Among them, the sub-block with sequence number j in the first interleaved sequence can correspond to the sub-block with sequence number S(j) in the first sequence to be interleaved.

[0008] In this technical solution, the first subsequence S(j) may contain N elements, each of which may correspond one-to-one to N subblocks. Each of the N elements may indicate the sequence number of the corresponding subblock in the first sequence to be interleaved. The first subsequence satisfying a preset relationship can be understood as the N elements in the first subsequence satisfying a preset relationship. This preset relationship can be set based on actual needs and is not specifically limited here.

[0009] This technical solution provides a channel coding scheme for LP-WUS transmission in a low-power scenario, so that network devices can transmit LP-WUS based on the channel coding scheme.

[0010] In combination with the first aspect, in certain implementations of the first aspect, the first subsequence satisfies a preset relationship, including: the first subsequence satisfies a preset relationship with a first sequence, and the first sequence is a known sequence.

[0011] In this implementation, the first sequence may be a known sequence in the existing communication field, so that the network device can determine the first subsequence based on the first sequence and a preset relationship between the first sequence and the first subsequence.

[0012] As an example, the first subsequence and the first sequence satisfying a preset relationship may be understood as the presence of a preset relationship between elements included in the first subsequence and elements included in the first sequence.

[0013] In combination with the first aspect, in certain implementations of the first aspect, the first subsequence includes elements smaller than N in the first sequence, where N is less than or equal to M, and M is the length of the first sequence; or, the first subsequence includes elements smaller than N in a second subsequence, where the second subsequence is a sequence consisting of the difference between each element of the elements greater than or equal to N in the first sequence and N.

[0014] As an example, the length of the first sequence may be understood as the number of elements contained in the first sequence.

[0015] As an example, the first subsequence may include elements whose values ​​are less than N in the first sequence.

[0016] As an example, elements whose element values ​​are greater than or equal to N can be extracted from the first sequence, and a sequence consisting of the difference between each element in the extracted elements and N can be used as the second subsequence. The first subsequence can contain elements whose element values ​​are less than N in the second subsequence.

[0017] In combination with the first aspect, in certain implementations of the first aspect, the first subsequence includes elements in the third subsequence that are less than N, and the third subsequence is a sequence consisting of the quotient of the elements in the first sequence whose remainder between the elements and the first ratio is R and the first ratio, the first ratio is the quotient between M and N, N is less than or equal to M, M is the length of the first sequence, and R includes a non-negative integer less than the first ratio.

[0018] In this implementation, elements in the first sequence whose remainders are R after the element values ​​are divided by the first ratio may be extracted, and a sequence consisting of quotients of each of the extracted elements divided by the first ratio may be used as the third subsequence. The first subsequence may include elements in the third subsequence whose element values ​​are less than N. As an example, when the first ratio is 2, R may be 0 or 1.

[0019] In combination with the first aspect, in certain implementations of the first aspect, the first subsequence includes elements in the fourth subsequence that are less than N, and the fourth subsequence is a sequence consisting of the quotient between each element in the first sequence and a first ratio, the first ratio is the quotient between M and N, N is less than or equal to M, and M is the length of the first sequence.

[0020] In this implementation, a sequence consisting of quotients between each element in the first sequence and the first ratio may be used as the fourth subsequence, and the first subsequence may include elements whose values ​​in the fourth subsequence are less than N.

[0021] In combination with the first aspect, in certain implementations of the first aspect, the first subsequence includes elements less than N in the fifth subsequence, and the fifth subsequence is a sequence consisting of quotients between multiple elements contained in the first sequence and 2. The multiple elements correspond one-to-one to multiple sub-blocks, and each of the multiple elements is used to indicate the sequence number of the corresponding sub-block in the second sequence to be interleaved. The sequence number of each sub-block in the interleaved sequence is an odd number or an even number, and the interleaved sequence is obtained by performing sub-block interleaving processing on the second sequence to be interleaved by the first sequence.

[0022] As an example, the interleaving sequence may be understood as the second interleaving sequence. For example, the network device may perform sub-block interleaving on the second sequence to be interleaved based on the first sequence to obtain the second interleaving sequence.

[0023] In this implementation, multiple sub-blocks with odd or even sequence numbers in the second interleaved sequence can be extracted, and multiple elements in the first sequence corresponding to the multiple sub-blocks are extracted, and a sequence consisting of quotients after each element in the multiple elements is divided by 2 is used as the fifth sub-sequence. The first sub-sequence may include elements in the fifth sub-sequence whose element values ​​are less than N.

[0024] In combination with the first aspect, in some implementations of the first aspect, the first subsequence satisfies a first preset relationship, including: the first subsequence is any one of the following sequences: {0 1 2 3 4 8 5 9 6 10 7 11 12 13 14 15}, {0 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15}, {0 1 2 3 4 5 6 7 8 9 10 12 11 13 14 15}, {0 3 2 1 4 5 8 7 6 9 10 11 15 13 14 12}, or {0 3 2 1 4 5 8 7 6}.

[0025] As an example, when the first subsequence is {0 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15}, the network device may perform sub-block interleaving on the first sequence to be interleaved based on the first subsequence to obtain a first interleaved sequence. The sub-block numbered 3 in the first sequence to be interleaved before interleaving is located at position 5 in the first interleaved sequence after interleaving, and the sub-block numbered 4 in the first sequence to be interleaved before interleaving is located at position 4 in the first interleaved sequence after interleaving. In this example, the sub-blocks numbered 3 and 4 in the first sequence to be interleaved before interleaving are swapped after interleaving.

[0026] In combination with the first aspect, in certain implementations of the first aspect, the first subsequence satisfies a preset relationship, including: the i+Ath element in the first subsequence is equal to the sum of the i-th element and A, N=2×A, A is an integer greater than 1, and i is a positive integer less than or equal to A.

[0027] In this implementation, the i+Ath element and the ith element in the first subsequence satisfy a preset relationship. Therefore, after determining the first A elements in the first subsequence, the A+1th to 2Ath elements in the first subsequence can be determined based on the first A elements.

[0028] In combination with the first aspect, in certain implementations of the first aspect, the j-th element in the first subsequence is equal to the j-th element in the first sequence, where j is a positive integer less than or equal to A.

[0029] In this implementation, the first A elements in the first subsequence may be determined through the first sequence.

[0030] As an example, when A=M, the first A elements in the first subsequence may include M elements in the first sequence.

[0031] As an example, when A=X×M, where X is an integer greater than 1, the first M elements in the first subsequence may include the M elements in the first sequence, and among the M+1th to 2Mth elements of the first subsequence, the c+Mth element may be the sum of the cth element and M, thereby determining the first 2M elements in the first subsequence, and further determining the first A elements in the first subsequence, where c is a positive integer less than or equal to M.

[0032] In combination with the first aspect, in certain implementations of the first aspect, the first subsequence satisfies a preset relationship, including: the i+Ath element in the first subsequence is equal to the sum of the i-th element and 1, N=2×A, A is an integer greater than 1, and i is a positive integer less than or equal to A.

[0033] In this implementation, the i+Ath element and the ith element in the first subsequence satisfy a preset relationship. Therefore, after determining the first A elements in the first subsequence, the A+1th to 2Ath elements in the first subsequence can be determined based on the first A elements.

[0034] In combination with the first aspect, in certain implementations of the first aspect, the j-th element in the first subsequence is equal to T times the j-th element in the first sequence, where T is the ratio of N to M, M is the length of the first sequence, and j is a positive integer less than or equal to A.

[0035] In this implementation, the first A elements in the first subsequence may be determined through the first sequence.

[0036] As an example, when A=M and T=2, the first A elements in the first subsequence may include the value of each of the M elements in the first sequence multiplied by 2. For example, when the first sequence is {0 1}, the first A elements in the first subsequence may be {0 2}.

[0037] As an example, when A=X×M, X is an integer greater than 1, T=2×X, the first M elements in the first subsequence can be the value of each of the M elements in the first sequence multiplied by 2×X, and among the M+1th element to the 2Mth element of the first subsequence, the c+Mth element can be the sum of the cth element and 1, so that the first 2M elements in the first subsequence can be determined, and then the first A elements in the first subsequence can be determined, where c is a positive integer less than or equal to M.

[0038] In combination with the first aspect, in some implementations of the first aspect, the first sequence is: {0 1 2 4 3 5 6 7 8 16 9 17 10 18 11 19 12 20 13 21 14 22 15 23 24 25 26 28 27 29 30 31}.

[0039] In this implementation, the first sequence may be the aforementioned 32-length sub-block interleaved sequence.

[0040] 47 55 56 57 58 60 59 61 62 63}, or {0 2 4 8 6 10 12 14 16 32 18 34 20 35 36 37 38 39 40 48 41 49 42 50 43 51 44 52 45 53 46 54 47 55 56 57 58 60 59 61 62 63}. 36 22 38 24 40 26 42 28 44 30 46 48 50 52 56 54 58 60 62 1 3 5 9 7 11 13 15 17 33 19 35 21 37 23 39 25 41 27 43 29 45 31 47 49 51 53 57 55 59 61 63}.

[0041] 47 55 56 57 58 60 59 61 62 63}, or the first subsequence may be {0 1 2 4 3 5 6 7 8 16 9 17 10 18 11 19 12 20 13 21 14 22 15 23 24 25 26 28 27 29 30 31 32 33 34 36 35 37 38 39 40 48 41 49 42 50 43 51 44 52 45 53 46 54 47 55 56 57 58 60 59 61 62 63}. 22 38 24 40 26 42 28 44 30 46 48 50 52 56 54 58 60 62 1 3 5 9 7 11 13 15 17 33 19 35 21 37 23 39 25 41 27 43 29 45 31 47 49 51 53 57 55 59 61 63}.

[0042] In a second aspect, the present application provides a communication device, which includes modules for implementing the method in the first aspect or any one of the implementations thereof, and each module can be implemented in the form of hardware and / or software.

[0043] For example, the apparatus may include: an acquisition module and a processing module. The acquisition module is configured to acquire a first sequence to be interleaved, where the first sequence to be interleaved includes N sub-blocks, where N is an integer greater than 1; and the processing module is configured to perform sub-block interleaving on the first sequence to be interleaved based on a first sub-sequence, where the first sub-sequence includes N elements, the N elements corresponding one-to-one to the N sub-blocks, each of the N elements indicating a sequence number of a corresponding sub-block in the first sequence to be interleaved, and the first sub-sequence satisfies a preset relationship.

[0044] In combination with the second aspect, in certain implementations of the second aspect, the first subsequence satisfies a preset relationship, including: the first subsequence satisfies a preset relationship with a first sequence, and the first sequence is a known sequence.

[0045] In combination with the second aspect, in certain implementations of the second aspect, the first subsequence includes elements smaller than N in the first sequence, where N is less than or equal to M, and M is the length of the first sequence; or, the first subsequence includes elements smaller than N in the second subsequence, and the second subsequence is a sequence consisting of the difference between each element of the elements greater than or equal to N in the first sequence and N.

[0046] In combination with the second aspect, in certain implementations of the second aspect, the first subsequence includes elements in the third subsequence that are less than N, and the third subsequence is a sequence consisting of the quotient of the elements in the first sequence whose remainder between the elements and the first ratio is R and the first ratio, the first ratio is the quotient between M and N, N is less than or equal to M, M is the length of the first sequence, and R includes a non-negative integer less than the first ratio.

[0047] In combination with the second aspect, in certain implementations of the second aspect, the first subsequence includes elements in the fourth subsequence that are less than N, and the fourth subsequence is a sequence consisting of the quotient between each element in the first sequence and a first ratio, the first ratio is the quotient between M and N, N is less than or equal to M, and M is the length of the first sequence.

[0048] In combination with the second aspect, in certain implementations of the second aspect, the first subsequence includes elements less than N in the fifth subsequence, and the fifth subsequence is a sequence consisting of quotients between multiple elements contained in the first sequence and 2. The multiple elements correspond one-to-one to multiple sub-blocks, and each of the multiple elements is used to indicate the sequence number of the corresponding sub-block in the second sequence to be interleaved. The sequence number of each sub-block in the interleaved sequence is an odd number or an even number, and the interleaved sequence is obtained by performing sub-block interleaving processing on the second sequence to be interleaved by the first sequence.

[0049] In combination with the second aspect, in some implementations of the second aspect, the first subsequence satisfies the first preset relationship, including: the first subsequence is any one of the following sequences: {0 1 2 3 4 8 5 9 6 10 7 11 12 13 14 15}, {0 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15}, {0 1 2 3 4 5 6 7 8 9 10 12 11 13 14 15}, {0 3 2 1 4 5 8 7 6 9 10 11 15 13 14 12}, or {0 3 2 1 4 5 8 7 6}.

[0050] In combination with the second aspect, in certain implementations of the second aspect, the first subsequence satisfies a preset relationship, including: the i+Ath element in the first subsequence is equal to the sum of the i-th element and A, N=2×A, A is an integer greater than 1, and i is a positive integer less than or equal to A.

[0051] In combination with the second aspect, in certain implementations of the second aspect, the j-th element in the first subsequence is equal to the j-th element in the first sequence, where j is a positive integer less than or equal to A.

[0052] In combination with the second aspect, in certain implementations of the second aspect, the first subsequence satisfies a preset relationship, including: the i+Ath element in the first subsequence is equal to the sum of the i-th element and 1, N=2×A, A is an integer greater than 1, and i is a positive integer less than or equal to A.

[0053] In combination with the second aspect, in certain implementations of the second aspect, the j-th element in the first subsequence is equal to T times the j-th element in the first sequence, where T is the ratio of N to M, M is the length of the first sequence, and j is a positive integer less than or equal to A.

[0054] In combination with the second aspect, in some implementations of the second aspect, the first sequence is: {0 1 2 4 3 5 6 7 8 16 9 17 10 18 11 19 12 20 13 21 14 22 15 23 24 25 26 28 27 29 30 31}.

[0055] 47 55 56 57 58 60 59 61 62 63}, or {0 2 4 8 6 10 12 14 16 32 18 34 20 35 36 37 38 39 40 48 41 49 42 50 43 51 44 52 45 53 46 54 47 55 56 57 58 60 59 61 62 63}. 36 22 38 24 40 26 42 28 44 30 46 48 50 52 56 54 58 60 62 1 3 5 9 7 11 13 15 17 33 19 35 21 37 23 39 25 41 27 43 29 45 31 47 49 51 53 57 55 59 61 63}.

[0056] In a third aspect, the present application provides a communication device, comprising a processor, the processor being coupled to a memory and configured to call program code in the memory to execute the method described in the first aspect or any possible implementation thereof. Optionally, the device further comprises a memory. Optionally, the device further comprises a communication interface, the processor being coupled to the communication interface.

[0057] Optionally, the apparatus may be a network device (such as a base station), or a chip system, a hardware circuit and / or a software module applied in a network device.

[0058] In a fourth aspect, the present application provides a computer program product comprising instructions, which, when executed on a computer, enables the computer to execute the method as described in the first aspect or any possible implementation thereof.

[0059] In a fifth aspect, the present application provides a computer-readable medium storing program code for execution by a device, wherein the program code includes code for executing the method described in the first aspect or any possible implementation thereof.

[0060] For the technical effects that can be achieved by any of the third to fifth aspects and any possible designs of any of them, please refer to the description of the technical effects that can be brought about by the first aspect or any possible implementation method thereof, and no further details will be given here. BRIEF DESCRIPTION OF THE DRAWINGS

[0061] FIG1 is a schematic diagram of an application scenario provided by an embodiment of the present application;

[0062] FIG2 is a flow chart of a communication system provided by another embodiment of the present application;

[0063] FIG3 is a schematic diagram showing the working principle of a low-power wake-up signal provided by an embodiment of the present application;

[0064] FIG4 is a schematic flow chart of a communication method provided in one embodiment of the present application;

[0065] FIG5 is a schematic structural diagram of a communication device provided by an embodiment of the present application;

[0066] FIG6 is a schematic structural diagram of a communication device provided in another embodiment of the present application. DETAILED DESCRIPTION

[0067] Exemplary embodiments will be described in detail herein, with examples illustrated in the accompanying drawings. In the following description, when referring to the drawings, identical numerals in different figures represent identical or similar elements, unless otherwise indicated. The embodiments described in the following exemplary embodiments are not intended to represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present application, as detailed in the appended claims.

[0068] The technical solution provided in this application can be applied to various communication systems, including but not limited to: narrowband Internet of Things (NB-IoT) system, global system for mobile communications (GSM), enhanced data rate for GSM evolution (EDGE), wideband code division multiple access (WCDMA), code division multiple access (CDMA) 2000 system, time division-synchronization code division multiple access (TD-SCDMA), long term evolution (LTE), fifth generation (5G) mobile communication system (such as 5G new radio (NR) communication system), various communication systems evolved in the future (such as sixth generation (6G) communication system) or satellite communication and other wireless communication systems.

[0069] The technical solution provided in this application can also be applied to the three major application scenarios of 5G mobile communication systems, including enhanced mobile broadband (eMBB), ultra-reliable and ultra-low latency communications (URLLC) and massive machine type of communication (mMTC), or other application scenarios such as enhanced machine-type communication (eMTC).

[0070] The terminal device in the embodiments of the present application may also be referred to as: user equipment (UE), mobile station (MS), mobile terminal (MT), access terminal, subscriber unit, subscriber station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent, or user device. The terminal device can be a device that provides voice / data connectivity to a user, such as a handheld device or vehicle-mounted device with wireless connection function. At present, some examples of terminal devices are: mobile phones, tablet computers, laptop computers, PDAs, mobile internet devices (MIDs), 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), handheld devices with wireless communication capabilities, computing devices or other processing devices connected to wireless modems, vehicle-mounted devices, wearable devices, terminal devices in 5G networks or future evolved public land mobile communication networks (PLMNs). The embodiments of the present application do not limit this. In addition, in the embodiments of the present application, the terminal device may also be a terminal device in an Internet of Things (IoT) system. IoT is an important component of the future development of information technology. Its main technical feature is to connect objects to the network through communication technology, thereby realizing an intelligent network of human-machine interconnection and object-to-object interconnection. In the embodiments of the present application, the device for realizing the functions of the terminal device may be the terminal device itself, or it may be a device that can support the terminal device to realize its functions, such as a chip system, which may be installed in the terminal device.In the embodiment of the present application, the chip system can be composed of chips, or can include chips and other discrete devices.

[0071] The network device in the embodiment of the present application can be a device that provides wireless communication functions for the terminal device, and can also be called an access network device or a wireless access network device. It can be a transmission reception point (TRP), an evolved base station (eNB or eNodeB) in the LTE system, a home base station (for example, home evolved NodeB, or home Node B, HNB), a base band unit (BBU), or a wireless controller in a cloud radio access network (CRAN) scenario, or the network device can be a relay station, an access point, a vehicle-mounted device, a wearable device, a network device in a 5G network, or a network device in a future evolved PLMN network, etc. It can be an access point (AP) in a WLAN, or a new wireless (new The gNB in ​​a new radio (NR) system may be a satellite base station in a satellite communication system, etc., as well as a device that assumes the function of a network device in device-to-device (D2D), vehicle-to-everything (V2X), and machine-to-machine (M2M) communications, etc., and the embodiments of the present application are not limited thereto. In a network structure, the network device may include a centralized unit (CU) node, or a distributed unit (DU) node, or a radio access network (RAN) device including a CU node and a DU node, or a RAN device including a control plane CU node (CU-CP node) and a user plane CU node (CU-UP node) and a DU node. In the embodiments of the present application, the device for realizing the function of the network device may be the network device itself, or it may be a device that can support the network device to realize its function, such as a chip system, which may be installed in the network device.

[0072] The network device provides services for the terminal devices within the cell. The terminal devices communicate with the network devices or other devices corresponding to the cell through the transmission resources (for example, frequency domain resources, or spectrum resources) allocated by the network device. The network device can be a macro base station (for example, macro eNB or macro gNB, etc.), or a base station corresponding to a small cell. The small cells here may include: metro cells, micro cells, pico cells, femto cells, etc. These small cells have the characteristics of small coverage and low transmission power, and are suitable for providing high-speed data transmission services.

[0073] The embodiments of the present application may be applicable to 5G communication systems. For example, FIG1 is a schematic diagram of an application scenario provided by one embodiment of the present application. As shown in FIG1 , a communication system 100 may include a base station 110, a terminal device 121, and a terminal device 122. The number of terminal devices is merely an example and is not limited in the embodiments of the present application.

[0074] Among them, base station 110 can provide communication services for terminal devices within a cell, such as terminal device 121 and terminal device 122. Base station 110 can send downlink information to terminal device 121 and / or terminal device 122. The downlink information can be control information or data information, which is not limited in this embodiment of the present application. Terminal device 121 and / or terminal device 122 can send uplink information to base station 110.

[0075] Base station 110 may include a base station unit (BBU) and a remote radio unit (RRU). The BBU and RRU may be located in different locations. For example, the RRU may be located remotely in a high-traffic area, while the BBU may be located in a central equipment room. The BBU and RRU may also be located in the same equipment room. The BBU and RRU may also be separate components within the same rack.

[0076] 2 , the communication system flow when the network device and the terminal device communicate is described in detail.

[0077] Figure 2 is a schematic diagram of a communication system flow provided by another embodiment of the present application. For ease of description, the network device is assumed to be the transmitting end and the terminal device is assumed to be the receiving end. The network device can send a downlink signal to the terminal device. This downlink signal can be referred to as a digital signal to be transmitted, or a signal source. It should be understood that the communication system flow shown in Figure 2 is also applicable to communication scenarios in which a terminal device sends an uplink signal to a network device.

[0078] As shown in Figure 2, the network device needs to perform source coding to convert the source into a bit stream, perform channel coding to encode the bit stream, and modulate the encoded bit stream into a signal waveform suitable for channel transmission before sending the signal waveform to the channel; accordingly, the terminal device can detect the downlink signal sent by the network device on the channel. After detecting the signal, the terminal device can demodulate, channel decode and source decode the detected signal to restore the downlink signal, and convert the restored downlink signal into the target data format after destination decoding.

[0079] In some implementations, polar codes may be used for channel coding and decoding. After the network device implements channel coding using polar codes, it can adjust the number of bits in the encoded bit stream through rate matching to match the channel's carrying capacity. That is, the adjusted number of bits in the bit stream is consistent with the number of bits that the channel can carry. Accordingly, the terminal device can perform rate matching before channel decoding.

[0080] As an example, the network device can perform rate matching based on a rate matching interleaver. For example, the rate matching interleaver of the existing polar code is a sub-block interleaver with a length of 32, as shown in Table 5.4.1.1-1.

[0081] Table 5.4.1.1-1 Sub-block interleaver pattern P(i)

[0082] In this example, assume that after polar code encoding, a mother code long polar code of length W (W is a positive integer power of 2) is obtained. The W polar code bits are divided into 32 subblocks, each of which can contain W / 32 bits. The sequence composed of these 32 subblocks is called the interleaved sequence. The network device can interleave these 32 subblocks based on Table 5.4.1.1-1 to obtain an interleaved sequence, thereby obtaining an interleaved bit sequence of W. Here, i can be understood as the sequence number of each of the 32 subblocks in the interleaved sequence, and P(i) can be understood as the sequence number of each of the 32 subblocks in the interleaved sequence. The subblock with sequence number i in the interleaved sequence corresponds to the subblock with sequence number P(i) in the interleaved sequence, thereby achieving interleaving of the 32 subblocks. For example, subblock with sequence number 3 in the interleaved sequence corresponds to subblock with sequence number 4 in the interleaved sequence, and subblock with sequence number 4 in the interleaved sequence corresponds to subblock with sequence number 3 in the interleaved sequence.

[0083] In the embodiment of the present application, P(i) = {0 1 2 4 3 5 6 7 8 16 9 17 10 18 11 19 12 20 13 21 14 22 15 23 24 25 26 28 27 29 30 31} can be referred to as a 32-length sub-block interleaver sequence. Table 5.4.1.1-1 can be understood as a 32-length sub-block interleaver, i can be understood as the sequence number of the element in the sub-block interleaver, and P(i) can be understood as the element in the sub-block interleaver. For example, the element with sequence number 3 in the sub-block interleaver is 4.

[0084] After obtaining the interleaved W bit sequence, the network device can determine E bits based on the W bits by puncturing, shortening, or repeating them, thereby completing rate matching. E is the number of bits after rate matching, i.e., the number of bits that the channel can carry.

[0085] A low power wake up signal (LP-WUS) was introduced in Release 18 (R18) of the 3rd Generation Partnership Project (3GPP) to support the low-latency and ultra-low power consumption mechanism of the terminal device. Figure 3 is a schematic diagram of the working principle of a low power wake up signal provided in an embodiment of the present application. As shown in Figure 3, the terminal device may include a main receiver and a low power wake up receiver (LP-WUR), and the main receiver and LP-WUR are respectively configured with separate antennas and radio frequency units (RF). Among them, the downlink signal sent by the network device to the terminal device may include an NR signal and an LP-WUS, and the terminal device can use the main receiver to receive the NR signal and use the LP-WUR to monitor the LP-WUS. Before receiving the LP-WUS, the main receiver of the terminal device can be set to an off state or a deep sleep state. After receiving the LP-WUS, the terminal device can wake up the main receiver to receive the signal, thereby achieving the purpose of energy saving. It should be noted that the terminal device can also use the main receiver to send an uplink signal to the network device. However, after the introduction of LP-WUS, the channel coding scheme during LP-WUS transmission becomes an urgent problem that needs to be solved.

[0086] Those skilled in the art have proposed that LP-WUS can reuse the NR control channel coding scheme. However, the minimum mother code length of the NR control channel coding scheme (such as polar code) is 32, and its sub-block interleaving sequence length is also 32, which cannot support sub-block interleaving with a shorter mother code length. When LP-WUS is transmitted, the minimum mother code length of the channel coding may be less than 32. Therefore, how to determine the channel coding scheme of LP-WUS based on the NR control channel coding scheme has become a technical problem that needs to be solved urgently. It should be noted that LP-WUS is introduced to meet the low-latency and ultra-low power consumption mechanism of the terminal device. Therefore, the maximum payload bit number (payload size), radio network temporary identity (RNTI) bit number and cyclic redundancy check (CRC) bit number during LP-WUS transmission will be reduced accordingly, so that the minimum mother code length of the channel coding during LP-WUS transmission may be less than 32.

[0087] In view of this, the present application provides a communication method and a communication device. The present application provides a channel coding scheme for the data channel and control channel used to transmit LP-WUS in a low-power scenario. The channel coding scheme can be compatible with the NR control channel coding scheme, thereby solving the requirements of low-power devices for energy efficiency, coverage and forwarding action rules (FAR). In the technical solution provided by the present application, the data channel and control channel used to transmit LP-WUS can adopt the same channel coding scheme, and the minimum mother code length in the channel coding scheme can be less than 32. It should be understood that the technical solution provided by the present application is a channel coding scheme, which can be applicable to dedicated network equipment or general equipment, for example, it can be applicable to various terminal devices that support low-latency and ultra-low power consumption mechanisms, and can also be applicable to network equipment.

[0088] The technical solution provided in this application will be described in detail below with reference to the accompanying drawings.

[0089] Figure 4 is a schematic flow chart of a communication method provided in one embodiment of the present application. As shown in Figure 4, the method may include S410 and S420.

[0090] As an example, the method may be executed by a network device, or may be executed by a chip system, a hardware circuit and / or a software module applied to the network device.

[0091] S410: Obtain a first sequence to be interleaved, where the first sequence to be interleaved includes N sub-blocks, where N is an integer greater than 1.

[0092] In this embodiment, when the network device sends the LP-WUS to the terminal device, it can perform source coding, channel coding, rate matching, and modulation on the LP-WUS before sending it to the channel; accordingly, the terminal device can detect the LP-WUS on the channel.

[0093] As an example, after the network device encodes the LP-WUS based on the channel coding scheme of the polar code, it can use a rate matching method based on sub-block interleaving to perform rate matching. The rate matching method based on sub-block interleaving includes puncturing, shortening, or repetition. For example, when the encoded LP-WUS is a mother code long polar code with a length of Z (Z is a positive integer power of 2), the network device can divide the Z polar code bits into N sub-blocks, each sub-block can contain Z / N bits, and the sequence composed of N sub-blocks can be called the first sequence to be interleaved. Wherein, N is an integer greater than 1. For example, N can be an integer greater than 1 and less than 32.

[0094] S420, performing sub-block interleaving processing on a first sequence to be interleaved based on a first subsequence, where the first subsequence includes N elements, the N elements correspond one-to-one to the N sub-blocks, each of the N elements is used to indicate a sequence number of a corresponding sub-block in the first sequence to be interleaved, and the first subsequence satisfies a preset relationship.

[0095] As an example, after determining a first sequence to be interleaved, the network device may perform sub-block interleaving on the first sequence to be interleaved based on the first subsequence, thereby obtaining a first interleaved sequence, and further obtaining an interleaved sequence of Z bits. After obtaining the interleaved sequence of Z bits, the network device may implement rate matching through puncturing, shortening, or repetition. The first interleaved sequence includes N sub-blocks, and the sub-block with sequence number j in the first interleaved sequence may correspond to the sub-block with sequence number S(j) in the first sequence to be interleaved, thereby achieving interleaving of the N sub-blocks. It should be understood that the first sub-sequence S(j) may include N elements, each of which may correspond one-to-one to the N sub-blocks, and each of the N elements may be used to indicate the sequence number of the corresponding sub-block in the first sequence to be interleaved. In this embodiment of the present application, S(j) may be referred to as a first sub-sequence, or an N-length sub-block interleaved sequence, and the first sub-sequence satisfies a preset relationship. The preset relationship may be set according to actual needs and is not specifically limited in this application.

[0096] In some possible implementations, the first subsequence satisfies the preset relationship, which can be understood as the N elements in the first subsequence satisfying the preset relationship. For example, the first subsequence can be any of the following sequences: {0 1 2 3 4 8 5 9 6 10 7 11 12 13 14 15}, {0 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15}, {0 1 2 3 4 5 6 7 8 9 10 12 11 13 14 15}, {0 3 2 1 4 5 8 7 6 9 10 11 15 13 14 12}, or {0 3 2 1 4 5 8 7 6}.

[0097] The embodiments of the present application provide a channel coding scheme for low-power scenarios, enabling network devices to transmit LP-WUS signals based on the channel coding scheme, thereby implementing channel coding in low-power scenarios. It should be understood that LP-WUS is only one example of a signal transmitted in a low-power scenario, and the present embodiment can also be applied to other low-power scenarios, which is not specifically limited by the present application.

[0098] In one possible implementation, the first subsequence may satisfy a preset relationship with the first sequence, and the first sequence may be a known sequence. In this implementation, the network device may nestedly generate a sub-block interleaved sequence (such as the first sub-sequence) with a shorter mother code length based on a given sub-block interleaved sequence. It should be understood that the network device may perform sub-block interleaving on the second sequence to be interleaved based on the first sequence to obtain a second interleaved sequence. The first sequence may include M elements, each of which corresponds one-to-one to the M sub-blocks included in the second sequence to be interleaved, and each of the M elements is used to indicate the sequence number of the corresponding sub-block in the second sequence to be interleaved.

[0099] In this implementation, when N is less than or equal to the length of the first sequence M, a first subsequence can be extracted from the first sequence. The length of the first sequence can be understood as the number of elements included in the first sequence, and the first sequence can be referred to as a mother-subblock interleaved sequence of the first subsequence.

[0100] As a first example, the first subsequence S(j) may include elements less than N in the first sequence Q(i), or in other words, N elements with values ​​less than N may be extracted from the first sequence Q(i) in natural order to form the first subsequence S(j). For example, {S(j) = Q(i) <N,i=0,1,…,M-1,j=0,1,…,N-1}。

[0101] In this example, if the first sequence Q(i) is the sub-block interleaved sequence P(i) shown in Table 5.4.1.1-1, and N = 16, the first sub-sequence S(j) can be extracted from the sub-block interleaved sequence P(i) in Table 5.4.1.1-1 in the following manner: {S(j) = P(i) < 16, i = 0, 1, ..., 31, j = 0, 1, ..., 15}. For example, the first sub-sequence S(j) = {0 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15}, or the first sub-sequence S(j) can be as shown in Table 1:

[0102] Table 1 Sub-block interleaver pattern S(j)

[0103] It should be understood that j can be understood as the sequence number of each of the 16 subblocks in the first interleaving sequence, and S(j) can be understood as the sequence number of each of the 16 subblocks in the first sequence to be interleaved. The subblock with sequence number j in the first interleaving sequence corresponds to the subblock with sequence number S(j) in the first sequence to be interleaved, thereby achieving interleaving of the 16 subblocks. For example, the subblock with sequence number 3 in the first interleaving sequence corresponds to the subblock with sequence number 4 in the first sequence to be interleaved, and the subblock with sequence number 4 in the first interleaving sequence corresponds to the subblock with sequence number 3 in the first sequence to be interleaved.

[0104] In this embodiment, S(j) = {0 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15} can be called a 16-length sub-block interleaving sequence. Table 1 can be understood as a 16-length sub-block interleaver, j can be understood as the sequence number of the element in the sub-block interleaver, and S(j) can be understood as the element in the sub-block interleaver. For example, the element with sequence number 3 in the sub-block interleaver is 4.

[0105] The method is simple in extracting the first subsequence, and in the first subsequence extracted by the method, only the positions of the 4th sub-block (i.e., the sub-block numbered 3 in the first interleaved sequence) and the 5th sub-block (i.e., the sub-block numbered 4 in the first interleaved sequence) are changed. As a result, when the network device performs sub-block interleaving on the first sequence to be interleaved based on the first subsequence determined by the method, the interleaving order of the sub-blocks can be closer to the natural order.

[0106] As a second example, the first subsequence S(j) may include elements in the second subsequence S2(j2) that are less than N, and the second subsequence S2(j2) may be a sequence formed by the difference between each element greater than or equal to N in the first sequence Q(i) and N. For example, the second subsequence S2(j2) can be extracted from the first sequence Q(i) in the following way: {S2(j2) = (Q(i) ≥ N) - N, i = 0, 1, …, M - 1, j2 = 0, 1, …, M - N + 1}, and the first subsequence S(j) can be extracted from the second subsequence S2(j2) in the following way: {S(j) = S2(j2) < N, j2 = 0, 1, …, M - N + 1, j = 0, 1, …, N - 1}. Here, the elements greater than or equal to N in the first sequence Q(i) can be understood as the elements in the first sequence Q(i) whose element values are greater than or equal to N.

[0107] In this example, if the first sequence Q(i) is the sub-block interleaved sequence P(i) shown in Table 5.4.1.1-1 and N = 16, the elements greater than or equal to 16 in the sub-block interleaved sequence P(i) are: {16 17 18 19 20 21 22 23 24 25 26 28 27 29 30 31}, the second subsequence S2(j2) is a sequence formed by the difference between the elements greater than or equal to 16 extracted from the sub-block interleaved sequence P(i) and N = 16, S2(j2) = {0 1 2 3 4 5 6 7 8 9 10 12 11 13 14 15}, then the first subsequence S(j) is the elements in the second subsequence S2(j2) that are less than N = 16, S(j) = {0 1 2 3 4 5 6 7 8 9 10 12 11 13 14 15}.

[0108] As a third example, the first subsequence S(j) may include elements in the third subsequence S3(j3) that are less than N, and the third subsequence S3(j3) may be a sequence formed by the quotient of the elements in the first sequence Q(i) whose remainder with the first ratio is R and the first ratio. The first ratio is the quotient of M and N, and R may include non-negative integers less than the first ratio. Here, the elements in the third subsequence S3(j3) that are less than N can be understood as the elements in the third subsequence S3(j3) whose element values are less than N.

[0109] In this example, the first ratio u can be 1 ≤ u ≤ M, the symbol can be understood as rounding down, that is, u can be understood as the quotient of M and N. It should be understood that 0 ≤ R < u. For example, when u is 2, R can take 0 or 1. In some implementation manners, the first ratio u can also be 2 ≤ u ≤ M, the symbol It can be understood as rounding up, and this application does not limit this. Take the example to illustrate the content in this example.

[0110] For example, the elements of the first sequence Q(i) that leave a remainder equal to R after being divided by the first ratio u can be sequentially extracted, and the sequence consisting of the values ​​obtained by dividing each extracted element by the first ratio u and rounding down is used as the third subsequence S3(j3), that is, the sequence consisting of the quotients of each extracted element divided by the first ratio u is used as the third subsequence S3(j3). It should be understood that dividing each extracted element by the first ratio u is to scale the value range of the extracted element to between 0 and N. The first subsequence S(j) may include elements of the third subsequence S3(j3) that are less than N. It should be noted that if the first ratio u is rounded down when calculating, the third subsequence S3(j3) should also be rounded down when determining. Correspondingly, if the first ratio u is rounded up when calculating, the third subsequence S3(j3) should also be rounded up when determining. If the number of elements in the first sequence Q(i) whose remainders after division by the first ratio u are equal to R is less than N, then the elements in the first sequence Q(i) whose remainders after division by the first ratio u are equal to R±1 can be continuously extracted until the number of extracted elements is equal to N.

[0111] In this example, if the first sequence Q(i) is the sub-block interleaving sequence P(i) shown in Table 5.4.1.1-1, and N=16, the first ratio u=32 / 16=2, and R can be 0 or 1. Assuming that R=0, the elements in the sub-block interleaved sequence P(i) whose remainders are equal to 0 after being divided by the first ratio u=2 are the elements with even values ​​in the sub-block interleaved sequence P(i), that is, {0 2 4 6 8 16 10 18 12 20 14 22 24 26 28 30}, and a sequence consisting of the values ​​obtained by rounding down after dividing each extracted element by the first ratio u=2 is used as the third subsequence S3(j3), that is, S3(j3)={0 1 2 3 4 8 5 9 6 10 7 11 12 13 14 15}. At this time, the first subsequence S(j) is the elements in the third subsequence S3(j3) that are less than N, S(j)={0 1 2 3 4 8 5 9 6 10 7 11 12 13 14 15}. For example, the first subsequence S(j) may be as shown in Table 2:

[0112] Table 2 Sub-block interleaver pattern S(j)

[0113] It should be understood that when N=16, the first subsequence S(j) can be extracted from the first sequence Q(i) based on the parity of the elements in the first sequence Q(i).

[0114] In this embodiment, S(j) = {0 1 2 3 4 8 5 9 6 10 7 11 12 13 14 15} can be called a 16-length sub-block interleaving sequence. Table 2 can be understood as a 16-length sub-block interleaver. j can be understood as the sequence number of the element in the sub-block interleaver, and S(j) can be understood as the element in the sub-block interleaver. For example, the element with sequence number 5 in the sub-block interleaver is 8.

[0115] In this example, compared to the rate matching method of puncturing or shortening based on the first subsequence shown in Table 1, when the network device performs puncturing or shortening based on the first subsequence shown in Table 2, the puncturing or shortening positions are more evenly distributed, thereby improving the performance of the polar code after rate matching. In the first subsequence shown in Table 1, only the positions of the 4th and 5th subblocks in the first interleaved sequence are changed.

[0116] As a fourth example, the first subsequence S(j) may include elements in the fourth subsequence S4(j4) that are less than N. The fourth subsequence S4(j4) may be a sequence consisting of quotients between each element in the first sequence Q(i) and the first ratio. The elements in the fourth subsequence S4(j4) that are less than N may be understood as elements in the fourth subsequence S4(j4) whose values ​​are less than N.

[0117] In this example, the first ratio u can be 1≤u≤M, that is, u can be understood as the quotient between M and N.

[0118] For example, the quotient of each element in the first sequence Q(i) divided by the first ratio u can be calculated in sequence, and the sequence of the calculated quotients can be used as the fourth subsequence S4(j4). Among them, only the first occurrence of the quotient can be included in the fourth subsequence S4(j4). If the quotient of Q(i) divided by the first ratio u appears repeatedly, the repeated quotient is skipped until the calculation is completed. Among them, the first subsequence S(j) contains elements of the fourth subsequence S4(j4) that are less than N. In some embodiments, when calculating the quotient of each element in the first sequence Q(i) divided by the first ratio u, the first occurrence of the quotient can be included in the fourth subsequence S4(j4) in sequence until the length of the fourth subsequence S4(j4) is N, at which point the fourth subsequence S4(j4) can be regarded as the first subsequence S(j).

[0119] In this example, if the first sequence Q(i) is the sub-block interleaved sequence P(i) shown in Table 5.4.1.1-1, and N = 16, the first ratio u = 32 / 16 = 2. Then, the first subsequence S(j) = {0 1 2 3 4 8 5 9 6 10 7 11 12 13 14 15}. It can be seen that the first subsequence S(j) determined in this example is consistent with the first subsequence S(j) shown in Table 2.

[0120] In this example, if the first sequence Q(i) is the sub-block interleaved sequence P(i) shown in Table 5.4.1.1-1, and N=16, the first ratio u=32 / 16=2. In some implementations, a pseudo code for the first subsequence can be generated based on the sub-block interleaved sequence P(i) shown in Table 5.4.1.1-1, thereby determining the first subsequence. This application does not limit the specific implementation of generating the pseudo code for the first subsequence.

[0121] In this example, when the network device performs puncturing or shortening based on the first subsequence determined in this example, compared with the rate matching method of puncturing or shortening based on the first subsequence shown in Table 1, the position distribution of puncturing or shortening is more random and the interleaving effect is better.

[0122] As a fifth example, the first subsequence S(j) may include elements less than N in the fifth subsequence S5(j5), and the fifth subsequence S5(j5) may be a sequence consisting of quotients between multiple elements included in the first sequence Q(i) and 2. The multiple elements may correspond one-to-one to multiple subblocks, and each of the multiple elements is used to indicate the sequence number of the corresponding subblock in the second sequence to be interleaved. The sequence number of each subblock in the interleaved sequence is an odd number or an even number, and the interleaved sequence is obtained by performing subblock interleaving processing on the second sequence to be interleaved with the first sequence. The interleaved sequence in this example is the second interleaved sequence.

[0123] In this example, the network device can determine multiple sub-blocks in the second interleaved sequence whose sequence number j5 is an odd or even number, extract multiple elements corresponding to the multiple sub-blocks from S5(j5), and round down or round up each of the extracted multiple elements after dividing by 2, thereby obtaining a fifth sub-sequence S5(j5). It should be noted that in this embodiment, only the value of each of the multiple elements when it first appears after being divided by 2 and rounded down can be included in the fifth sub-sequence S5(j5). If the value of each of the multiple elements when it is divided by 2 and rounded down appears repeatedly, the repeated value is skipped, that is, the repeated value is not included in the fifth sub-sequence S5(j5). Among them, rounding down each of the extracted multiple elements after dividing by 2 to obtain the fifth sub-sequence S5(j5) can be understood as taking the sequence consisting of the quotients obtained after dividing each of the multiple elements by 2 as the fifth sub-sequence S5(j5). The first subsequence S(j) may include elements smaller than N in the fifth subsequence S5(j5), and the elements smaller than N in the fifth subsequence S5(j5) may be understood as elements with values ​​smaller than N in the fifth subsequence S5(j5).

[0124] In this example, if the first sequence Q(i) is the sub-block interleaved sequence P(i) shown in Table 5.4.1.1-1, and N=9, P(i) corresponding to when i is an even number or an odd number in Table 5.4.1.1-1 can be extracted. For example, the sequence extracted from P(i) corresponding to when i is an even number in Table 5.4.1.1-1 is {0 6 4 2 8 10 16 14 12 18 20 22 30 26 28 24}; and each element in the extracted sequence is divided by 2 and rounded down to obtain a fifth subsequence S5(j5), S5(j5)={0 3 2 1 4 5 8 7 6 9 10 11 15 13 14 12}, and the first subsequence S(j) includes the elements in the fifth subsequence S5(j5) that are less than N=9, S(j)={0 3 2 1 4 5 8 7 6}.

[0125] In this example, a first subsequence can be extracted from the first sequence based on the parity of the sequence number of each subblock in the second interleaved sequence of the M subblocks. When the network device performs rate matching based on the first subsequence determined by this method, better error correction performance can be achieved. If the first sequence is referred to as a parent-subblock interleaved sequence of the first subsequence, then the nesting characteristic between the first sequence and the first subsequence is a sequence number nesting method.

[0126] As a sixth example, if the first sequence Q(i) is the sub-block interleaved sequence P(i) shown in Table 5.4.1.1-1, and N=16, the first subsequence S(j) can be determined in the following manner.

[0127] For example, in the first step, the sub-block interleaved sequence P(i) can be converted into the following binary representation, such as P(i) = [b0 b1 b2 b3 b4], where the first bit b0 from left to right can be the least significant bit (LSB), and the last bit b4 from left to right, or the rightmost bit b4, can be the most significant bit (MSB). Then P(i) can be:

[0128] In the second step, extract the binary sequence with LSB=0 from the binary sequence in the first step. (It can be seen that the element corresponding to the LSB being 0 is P(i) corresponding to i being {0 2 3 6 8 9 12 13 16 17 20 21 24 26 27 30} in Table 5.4.1.1-1) and only retain the 4 bits after removing the LSB (b0), such as [b1 b2 b3 b4], thereby obtaining 16 new binary sequences, as shown below:

[0129] In the third step, the 16 4-bit binary numbers determined in the second step are converted to decimal numbers, thereby obtaining a 16-length sub-block interleaved sequence, namely, the first sub-sequence S(j). The first sub-sequence S(j) = {0 1 2 3 4 8 5 9 6 10 7 11 12 13 14 15}. It can be seen that the first sub-sequence determined in this example is the same as the first sub-sequences determined in the third and fourth examples.

[0130] In some implementations, a binary sequence with LSB=1, b1=0, b1=1, b2=0, and b2=1 can also be extracted from the binary sequence in the first step, and only the 4 bits after removing the LSB, b1, or b2 are retained, thereby obtaining 16 new binary sequences, and then obtaining a 16-length sub-block interleaved sequence, that is, the first subsequence S(j), the first subsequence S(j)={0 1 2 3 4 8 5 9 6 10 7 11 12 13 14 15}.

[0131] In this example, a sub-block interleaver S(j) with a length N less than 32 can be generated based on a sub-block interleaver P(i) with a length of NR 32, and 32 decimal numbers are converted into 32 binary sequences of log2(32)=5 bits. By extracting 16 binary numbers with LSB=0, LSB=1, b1=0, b1=1, b2=0, or b2=1, a final 16-long sub-block interleaved sequence S(j) is formed. The method of extracting the first sub-sequence in this example is simple, so that when the network device performs sub-block interleaving on the first sequence to be interleaved based on the first sub-sequence determined in this example, the order of the sub-block interleaving is more consistent with the polarization characteristics, and higher polarization efficiency can be obtained after rate matching.

[0132] As a seventh example, if the first sequence Q(i) is the sub-block interleaved sequence P(i) shown in Table 5.4.1.1-1, and N=16, the first subsequence S(j) can be determined in the following manner.

[0133] For example, in the first step, the sub-block interleaved sequence P(i) can be converted into the following binary representation, such as P(i) = [b0 b1 b2 b3 b4], where the first bit b0 from left to right can be the LSB, and the last bit b4 from left to right, or the rightmost bit b4, can be the MSB. P(i) can then be a 32-bit binary sequence as shown in the first step of the sixth example, and will not be further described here.

[0134] In the second step, extract the binary sequence with MSB = 0 from the binary sequence in the first step. (It can be seen that the corresponding element when MSB is 0 is P(i) corresponding to i {0 1 2 3 4 5 6 7 8 10 12 14 16 18 20 22} in Table 5.4.1.1-1) and only retain the 4 bits after removing the MSB, such as [b0 b1 b2 b3], thereby obtaining 16 new binary sequences, as shown below:

[0135] In the third step, the 16 4-bit binary numbers determined in the second step are converted to decimal numbers, thereby obtaining a 16-length sub-block interleaved sequence, namely, the first sub-sequence S(j). The first sub-sequence S(j) = {0 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15}. It can be seen that the first sub-sequence determined in this example is the same as the first sub-sequence determined in the first example.

[0136] In some implementations, a binary sequence with the second MSB (b3) = 0 can also be extracted from the binary sequence in the first step, and only the 4 bits after removing b3 are retained, thereby obtaining 16 new binary sequences, and then obtaining a 16-length sub-block interleaved sequence, that is, the first subsequence S(j), the first subsequence S(j) = {0 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15}.

[0137] In some implementations, a binary sequence with MSB = 1 or the second MSB (b3) = 1 can be extracted from the binary sequence in the first step, and only the 4 bits after removing the MSB or b3 are retained, thereby obtaining 16 new binary sequences, and further obtaining a 16-length sub-block interleaved sequence, namely, the first subsequence S(j), where the first subsequence S(j) = {0 1 2 3 4 5 6 7 8 9 10 12 11 13 14 15}. It can be seen that the first subsequence determined in this method is the same as the first subsequence determined in the second example.

[0138] In this example, a sub-block interleaver S(j) with a length N less than 32 can be generated based on a sub-block interleaver P(i) with a length NR of 32. The 32 decimal numbers are converted into 32 binary sequences of log2(32)=5 bits, and 16 binary numbers with MSB=1, MSB=0, b3=1, or b3=0 are extracted to form a final 16-bit sub-block interleaved sequence S(j). The method for extracting the first sub-sequence in this example is simple, and when the network device performs sub-block interleaving on the first sequence to be interleaved based on the first sub-sequence determined by this method, the interleaving order of the sub-blocks is more consistent with the natural order.

[0139] 47 55 56 57 58 60 59 61 62 63}, or the first subsequence may be {0 1 2 4 3 5 6 7 8 16 9 17 10 18 11 19 12 20 13 21 14 22 15 23 24 25 26 28 27 29 30 31 32 33 34 36 35 37 38 39 40 48 41 49 42 50 43 51 44 52 45 53 46 54 47 55 56 57 58 60 59 61 62 63}. 22 38 24 40 26 42 28 44 30 46 48 50 52 56 54 58 60 62 1 3 5 9 7 11 13 15 17 33 19 35 21 37 23 39 25 41 27 43 29 45 31 47 49 51 53 57 55 59 61 63}.

[0140] As an example, the first subsequence satisfies a preset relationship, which may include: the i+Ath element and the ith element in the first subsequence satisfy the preset relationship, the length of the first subsequence is N, N=2×A, A is an integer greater than 1, and i is a positive integer less than or equal to A. Therefore, if the first A elements in the first subsequence are determined, the A+1th to 2Ath elements in the first subsequence can be determined based on the first A elements.

[0141] As an example, the i+Ath element and the i-th element in the first subsequence satisfy a preset relationship, which may include: the i+Ath element in the first subsequence is equal to the sum of the i-th element and A.

[0142] As an example, the jth element in the first subsequence can be equal to the jth element in the first sequence, where j is a positive integer less than or equal to A. The first sequence can be a known sequence. The network device can perform sub-block interleaving on the second sequence to be interleaved based on the first sequence, thereby obtaining a second interleaved sequence. The first sequence can include M elements, each of which corresponds one-to-one to the M sub-blocks included in the second sequence to be interleaved, and each of the M elements indicates the sequence number of the corresponding sub-block in the second sequence to be interleaved.

[0143] As an example, A may be a positive integer multiple of M. For example, when A=M, the first A elements in the first subsequence may include the M elements in the first sequence. For another example, when A=X×M, and X is an integer greater than 1, the first M elements in the first subsequence may include the M elements in the first sequence, and among the M+1th to 2Mth elements of the first subsequence, the c+Mth element may be the sum of the cth element and M, thereby determining the first 2M elements in the first subsequence, and further determining the first A elements in the first subsequence, where c is a positive integer less than or equal to M.

[0144] 1 19 12 20 13 21 14 22 15 23 24 25 26 28 27 29 30 31}。 English: As an example, if A = 64, M = 32, and the first sequence is the sub-block interleaved sequence P(i) shown in Table 5.4.1.1-1, P(i) = {0 1 2 4 3 5 6 7 8 16 9 17 10 18 11 19 12 20 13 21 14 22 15 23 24 25 26 28 27 29 30 31}, then the first 32 elements S1(j) in the first subsequence S(j) are: {0 1 2 4 3 5 6 7 8 16 9 17 10 18 11 19 12 20 13 21 14 22 15 23 24 25 26 28 27 29 30 31}, the 33rd to 64th elements S2(j) in S(j) are: {32 33 34 36 35 37 38 39 40 48 41 49 42 50 43 51 44 52 45 53 46 54 47 55 56 57 58 60 59 61 62 63}, therefore, S(j)={0 1 2 4 3 5 6 7 8 16 9 17 10 18 11 19 12 20 13 21 14 22 15 23 24 25 26 28 27 29 30 31 32 33 34 36 35 37 38 39 40 48 41 49 42 50 43 51 44 52 45 53 46 54 47 55 56 57 58 60 59 61 62 63}.

[0145] As another example, the i+Ath element and the i-th element in the first subsequence satisfy a preset relationship, which may include: the i+Ath element in the first subsequence is equal to the sum of the i-th element and 1.

[0146] As an example, the jth element in the first subsequence can be equal to T times the jth element in the first sequence, where T is the ratio of N to M, and M can be the length of the first sequence. The first sequence can be a known sequence. The network device can perform sub-block interleaving on the second sequence to be interleaved based on the first sequence, thereby obtaining a second interleaved sequence. The first sequence can include M elements, each of which corresponds one-to-one to the M sub-blocks included in the second sequence to be interleaved, and each of the M elements indicates the sequence number of the corresponding sub-block in the second sequence to be interleaved.

[0147] As an example, A may be a positive integer multiple of M. For example, when A=M, T=2, and the first A elements in the first subsequence may include the value of each of the M elements in the first sequence multiplied by 2. For example, when the first sequence is {0 1}, the first A elements in the first subsequence may be {0 2}. For another example, when A=X×M, X is an integer greater than 1, T=2×X, the first M elements in the first subsequence may include the value of each of the M elements in the first sequence multiplied by 2×X, and among the M+1th to 2Mth elements of the first subsequence, the c+Mth element may be the sum between the cth element and 1, thereby determining the first 2M elements in the first subsequence, and further determining the first A elements in the first subsequence, where c is a positive integer less than or equal to M.

[0148] 4 30 46 48 50 52 56 54 58 60 60 70 80 90 100 0 0 1 2 4 3 5 6 7 8 16 9 17 10 18 11 19 12 20 13 21 14 22 15 23 24 25 26 28 27 29 30 31}, T = 2, then the first 32 elements S1(j) in the first subsequence S(j) are: {0 2 4 8 6 10 12 14 16 32 18 34 20 36 22 38 24 40 26 42 28 44 30 46 48 50 52 56 54 58 60 60 70 80 90 100 0 0 1 2 40 26 42 28 44 30 46 48 50 52 56 54 58 60 62}, the 33rd to 64th elements S2(j) in S(j) are: {1 3 5 9 7 11 13 15 17 33 19 35 21 37 23 39 25 41 27 43 29 45 31 47 49 51 53 57 55 59 61 63}, therefore, S(j)={0 2 4 8 6 10 12 14 16 32 18 34 20 36 22 38 24 40 26 42 28 44 30 46 48 50 52 56 54 58 60 62}. 19 35 21 37 23 39 25 41 27 43 29 45 31 47 49 51 53 57 55 59 61 63}.

[0149] In this implementation, it can be seen that when N is greater than the length M of the first sequence, the first subsequence can be generated based on the extension of the first sequence. It should be understood that, on the one hand, the first subsequence can be obtained based on the extension of the first sequence, and therefore the first sequence can be referred to as the mother-subblock interleaved sequence of the first subsequence. On the other hand, the length of the first subsequence is greater than the length of the first sequence, and the first sequence can be extracted from the first subsequence based on the methods provided in the first to seventh examples above, and therefore the first subsequence can also be referred to as the mother-subblock interleaved sequence of the first sequence. This application does not specifically limit the relationship between the two.

[0150] In one possible implementation, if the first sequence is the sub-block interleaved sequence P(i) shown in Table 5.4.1.1-1, and N=64, the first sub-sequence S(j) can be determined in the following manner.

[0151] For example, in the first step, the sub-block interleaved sequence P(i) can be converted into the following binary representation, such as P(i) = [b0 b1 b2 b3 b4], where the first bit b0 from left to right can be the LSB, and the last bit b4 from left to right, or the rightmost bit b4, can be the MSB. P(i) can then be a 32-bit binary sequence as shown in the first step of the sixth example, and will not be further described here.

[0152] In the second step, the binary sequence in the first step is bit-flipped from the back to the front (from the 16th to the 1st) and concatenated to the 33rd to the 64th positions in the binary sequence, as shown in the bold part below:

[0153] Among them, {1 1 1 1 1} can be bit-flipped to {0 0 0 0 0}. It can be seen that the 17th binary bit is obtained by bit-flipping the 16th binary bit. Similarly, the 32nd binary bit is obtained by bit-flipping the 1st binary bit.

[0154] In the third step, add a new bit to the right of the MSB (e.g., b4) of the 64-line binary sequence obtained in the second step and use the new bit as the new MSB. The new MSB can be 0 for the first 32 bits of the 64-line binary sequence, and 1 for the last 32 bits. As shown below, the new MSB is b5.

[0155] Step 4: Convert the 64 6-bit binary numbers determined in step 3 into decimal numbers, thereby obtaining a 64-length sub-block interleaved sequence, i.e., the first subsequence S(j). Wherein, the first subsequence S(j) = {0 1 2 4 3 5 6 7 8 16 9 17 10 18 11 19 12 20 13 21 14 22 15 23 24 25 26 28 27 29 30 31 32 33 34 36 35 37 38 39 40 48 41 49 42 50 43 51 44 52 45 53 46 54 47 55 56 57 58 60 59 61 62 63}.

[0156] In one possible implementation, if the first sequence is the sub-block interleaved sequence P(i) shown in Table 5.4.1.1-1, and N=64, the first sub-sequence S(j) can be determined in the following manner.

[0157] In this implementation, in the first step, the sub-block interleaved sequence P(i) can be converted into the following binary representation, such as P(i) = [b0 b1 b2 b3 b4], where the first bit b0 from left to right can be the LSB, and the last bit b4 from left to right, or the rightmost bit b4, can be the MSB.

[0158] In the second step, the binary sequence in the first step is bit-flipped from the back to the front (from the 16th to the 1st) and concatenated to the 33rd to the 64th positions in the binary sequence.

[0159] Among them, the specific implementation process of the first and second steps in this implementation method can refer to the first and second steps in the above possible implementation methods, and will not be repeated here.

[0160] Step 3: Add a new bit to the left of the MSB (e.g., b4) of the 64-row binary sequence obtained in step 2, and use the new bit as the new LSB. The new LSB can be 0 for the first 32 bits of the 64-row binary sequence, and 1 for the last 32 bits. As shown below, the new MSB is the new b0.

[0161] 1 3 5 9 7 11 13 15 17 33 19 35 21 37 23 39 25 41 27 43 29 45 31 47 49 51 53 57 55 59 61 63}.

[0162] In an embodiment of the present application, the network device may perform sub-block interleaving on the first sequence to be interleaved based on the first sub-sequence, and perform rate matching based on the bit sequence after sub-block interleaving. In some implementations, a sub-block interleaved sequence may also exist in the 6G communication system, such as the first sub-sequence determined in the embodiment of the present application, but the use scenario of the sub-block interleaved sequence may not be limited to before rate matching, such as being applicable to scenarios such as hybrid automatic repeat-request (HARQ) transmission. For example, before HARQ transmission, the HARQ may be polar coded, and the mother code length polar code obtained after coding is Y (Y is a positive integer power of 2) divided into B sub-blocks. At this time, the sequence composed of the B sub-blocks can be called a third sequence to be interleaved; then, based on the preset sub-block interleaving sequence, the third sequence to be interleaved is sub-block interleaved to obtain a third interleaved sequence, thereby obtaining the interleaved Y bit sequences. Therefore, the bit sequence carried in each sub-block can be sent in sequence according to the order in which each sub-block in the B sub-blocks is numbered in the third interleaved sequence, thereby completing the HARQ transmission.

[0163] In one possible implementation, the length of the sub-block interleaving sequence may be related to the mother code length of the polar code. For example, the maximum mother code length N of the polar code is m =8192, the length of the corresponding sub-block interleaving sequence can be 256. It should be noted that the maximum mother code length N of the existing NR polar code is m =1024, the corresponding sub-block interleaving sequence length is 32=1024 / 32, so the maximum mother code length N of the polar code is m =8192, the length of its sub-block interleaving sequence can be 8192 / 32=256.

[0164] Correspondingly, the maximum mother code length N of the polar code in the sub-block interleaved sequence is m =4096, the length of the corresponding sub-block interleaving sequence can be 128. As an example, the sub-block interleaving sequence can be extracted from the 256-length sub-block interleaving sequence corresponding to the mother code length of 8192. For example, by using the extraction methods shown in the first to seventh examples, the 128-length sub-block interleaving sequence can be used as a new sub-block interleaving sequence to adapt to application scenarios with shorter mother code lengths.

[0165] Correspondingly, the maximum mother code length N of the polar code in the sub-block interleaved sequence is m =2048, the length of the corresponding sub-block interleaving sequence may be 64. As an example, the sub-block interleaving sequence may be extracted from a 128-length sub-block interleaving sequence corresponding to a mother code length of 4096 to adapt to application scenarios with shorter mother code lengths.

[0166] Correspondingly, the maximum mother code length N of the polar code in the sub-block interleaved sequence is m When the maximum mother code length is less than or equal to 1024 of the existing NR polar code but greater than 32, the corresponding sub-block interleaving sequence length can be 32. As an example, the sub-block interleaving sequence can be extracted from the 64-length sub-block interleaving sequence corresponding to the mother code length of 2048 to adapt to the application scenario when the mother code length is shorter. The sub-block interleaving sequence can be the sub-block interleaving sequence in the existing NR polar code, such as P(i) shown in Table 5.4.1.1-1.

[0167] In this implementation, the length of the corresponding sub-block interleaving sequence can be determined based on the mother code length. For example, as the mother code length decreases, the length of the corresponding sub-block interleaving sequence also decreases accordingly. For example, the sub-block interleaving sequence corresponding to a shorter mother code can be nested and read from the sub-block interleaving sequence corresponding to a longer mother code. In another example, the sub-block interleaving sequence corresponding to a longer mother code can be expanded from the sub-block interleaving sequence corresponding to a shorter mother code length, as described in the expansion method in the previous embodiment. In this implementation, a single sub-block interleaving sequence can be used to accommodate sub-block interleaving for different mother code lengths.

[0168] In some implementations, the selection of a rate matching method in a low-power scenario can be determined by the mother code length of the polar code. As an example, when the mother code length of the polar code is less than a preset value, a rate matching method based on sub-block interleaving is supported; when the mother code length of the polar code is greater than or equal to the preset value, a rate matching method based on sub-block interleaving is not supported. The preset value can be set according to actual needs, and this application does not impose specific restrictions on this. For example, the preset value can be 32. If the mother code length obtained after polar code channel coding is greater than or equal to 32, the rate matching implementation complexity is relatively large. In this case, the rate matching method based on sub-block interleaving with puncturing or shortening is not adopted, and a simple repetition rate matching method is adopted. For example, the transmission length can be fixed to the mother code length, or rate matching can be achieved through simple repetition based on the mother code length. The transmission length can be understood as the bit length or number of bits that the channel can carry. If the mother code length obtained after polar code channel coding is less than 32, the rate matching method based on sub-block interleaving is relatively simple, so a rate matching method based on sub-block interleaving, such as puncturing, shortening, or repetition, can be supported. In the embodiment of the present application, the rate matching method based on sub-block interleaving can be implemented based on a rate matching interleaver, and the rate matching interleaver can be the sub-block interleaver determined in this embodiment, such as the first subsequence S(j).

[0169] In this implementation, whether to adopt a rate matching method with higher complexity, such as shortening or puncturing, can be determined based on the mother code length, thereby achieving a compromise between rate matching complexity and communication performance.

[0170] It should be noted that in the embodiment of the present application, the terminal device can be a low-power device, and the channel coding scheme involved in the terminal device, such as the data channel coding scheme and the control channel coding scheme of the passive IoT, can be the same, and both can reuse the coding scheme of the existing NR control channel. In order to further reduce power consumption, the maximum mother code length of the channel coding scheme provided in the embodiment of the present application can be reduced to any one of {32 64 128 256}, and the minimum mother code length can be less than 32, such as the minimum mother code length can be 16. In addition, after performing channel coding and rate matching, the network device can choose not to perform bit interleaving (such as triangular interleaving) operations, thereby reducing power consumption and reducing the complexity of encoding and decoding.

[0171] It should be understood that when a network device sends an LP-WUS based on the channel coding scheme provided in the embodiments of the present application, when a terminal device receives the LP-WUS, the detection, demodulation, decoding and other operations should also be modified accordingly.

[0172] Figure 5 is a schematic diagram of the structure of a communication device provided in one embodiment of the present application. As shown in Figure 5, the communication device 500 may include: an acquisition module 510 and a processing module 520. The device 500 may be used to implement the various steps / operations performed by the network device in the method shown in Figure 4.

[0173] For example, when the apparatus 500 is used to implement the method implemented by the network device in FIG. 4 , the acquisition module 510 may be used to implement S410 ; and the processing module 520 may be used to implement S420 .

[0174] Figure 6 is a schematic diagram of the structure of a communication device provided by another embodiment of the present application. The device 600 shown in Figure 6 can be used to implement the method executed by the network device in any of the above embodiments.

[0175] As shown in Figure 6, the apparatus 600 of this embodiment includes a memory 610, a processor 620, a communication interface 630, and a bus 640. The memory 610, the processor 620, and the communication interface 630 are connected to each other via the bus 640.

[0176] The memory 610 may be a read-only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM). The memory 610 may store programs. When the program stored in the memory 610 is executed by the processor 620, the processor 620 is configured to execute the various steps / operations performed by the network device in any of the aforementioned embodiments.

[0177] The processor 620 can be a general-purpose central processing unit (CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits to execute relevant programs to implement the communication method shown in the method embodiment of the present application.

[0178] The processor 620 may also be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the communication method shown in the embodiment of the present application may be completed by hardware integrated logic circuits in the processor 620 or software instructions.

[0179] The processor 620 may also be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA), or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component. The processor 620 may implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of the present application. The general-purpose processor may be a microprocessor or any conventional processor.

[0180] 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 decoding processor, or can be executed by a combination of hardware and software modules in the decoding 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 610, and the processor 620 reads the information in the memory 610 and, in combination with its hardware, completes the functions required to be performed by the units included in the communication device of the present application. For example, the various steps / functions performed by the network device in Figure 4 can be executed. Optionally, the memory 610 and the processor 620 can be integrated together.

[0181] The communication interface 630 may use, but is not limited to, a transceiver or other transceiver device to implement communication between the apparatus 600 and other devices or apparatuses.

[0182] The bus 640 may include a path for transmitting information between the various components of the device 600 (eg, the memory 610 , the processor 620 , and the communication interface 630 ).

[0183] Some embodiments of the present application also provide a computer program product that, when executed on a processor, can implement the methods described in the aforementioned embodiments. Some embodiments of the present application also provide a computer-readable storage medium that contains computer instructions that, when executed on a processor, can implement the methods described in the aforementioned embodiments.

[0184] It should be noted that the modules or components shown in the above embodiments may be one or more integrated circuits configured to implement the above methods, such as one or more application specific integrated circuits (ASICs), one or more microprocessors (digital signal processors (DSPs), or one or more field programmable gate arrays (FPGAs). For another example, when a module is implemented by a processing element calling a program code, the processing element may be a general-purpose processor, such as a central processing unit (CPU) or other processor that can call a program code, such as a controller. For another example, these modules may be integrated together and implemented in the form of a system-on-a-chip (SOC).

[0185] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware, software modules or any combination thereof. When software is used for implementation, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the process or function according to the embodiment of the present application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions can be transmitted from a website, computer, server or data center to another website, computer, server or data center via a wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) method. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more available media integrations. The available medium can be a magnetic medium (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a DVD), or a semiconductor medium (e.g., a solid-state drive (SSD)).

[0186] The term "plurality" in this article refers to two or more. The term "and / or" in this article is merely a description of the association relationship of associated objects, indicating that three relationships may exist. For example, A and / or B can represent three situations: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in this article generally indicates that the previous and next associated objects are in an "or" relationship; in the formula, the character " / " indicates that the previous and next associated objects are in a "division" relationship. In addition, it should be understood that in the description of this application, words such as "first" and "second" are only used for the purpose of distinguishing the description, and cannot be understood as indicating or implying relative importance, nor can they be understood as indicating or implying order.

[0187] It will be understood that the various numerical numbers involved in the embodiments of the present application are merely distinctions for the convenience of description and are not intended to limit the scope of the embodiments of the present application.

[0188] It can be understood that in the embodiments of the present application, the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

Claims

1. A communication method, characterized in that: The method is applied to a network device, and the method comprises: Obtain a first sequence to be interleaved, where the first sequence to be interleaved includes N sub-blocks, where N is an integer greater than 1; Sub-block interleaving is performed on the first sequence to be interleaved based on a first subsequence, the first subsequence includes N elements, the N elements correspond one-to-one to the N sub-blocks, each of the N elements is used to indicate a sequence number of a corresponding sub-block in the first sequence to be interleaved, and the first subsequence satisfies a preset relationship.

2. The method according to claim 1, characterized in that The first subsequence satisfies a preset relationship, including: The first subsequence satisfies a preset relationship with the first sequence, and the first sequence is a known sequence.

3. The method according to claim 2, characterized in that The first subsequence includes elements of the first sequence that are smaller than N, where N is smaller than or equal to M, and M is the length of the first sequence; or The first subsequence includes elements smaller than N in the second subsequence, and the second subsequence is a sequence formed by the difference between each element of the elements greater than or equal to N in the first sequence and N.

4. The method according to claim 2, characterized in that: The first subsequence includes elements less than N in the third subsequence, and the third subsequence is a sequence consisting of the quotient of the elements in the first sequence whose remainder between the elements and the first ratio is R and the first ratio, the first ratio is the quotient between M and N, N is less than or equal to M, M is the length of the first sequence, and R includes a non-negative integer less than the first ratio.

5. The method according to claim 2, characterized in that: The first subsequence includes elements less than N in the fourth subsequence, and the fourth subsequence is a sequence consisting of quotients between each element in the first sequence and a first ratio, the first ratio is a quotient between M and N, N is less than or equal to M, and M is the length of the first sequence.

6. The method according to claim 2, characterized in that The first subsequence includes elements less than N in the fifth subsequence, the fifth subsequence is a sequence consisting of quotients between multiple elements included in the first sequence and 2, the multiple elements correspond one-to-one to multiple sub-blocks, each of the multiple elements is used to indicate the sequence number of the corresponding sub-block in the second sequence to be interleaved, the sequence number of each sub-block in the interleaved sequence is an odd number or an even number, and the interleaved sequence is obtained by performing sub-block interleaving processing on the second sequence to be interleaved by the first sequence.

7. The method according to any one of claims 1 to 5, characterized in that The first subsequence satisfies a first preset relationship, including: The first subsequence is any one of the following sequences: {0 1 2 3 4 8 5 9 6 10 7 11 12 13 14 15}, {0 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15}, {0 1 2 3 4 5 6 7 8 9 10 12 11 13 14 15}, {0 3 2 1 4 5 8 7 6 9 10 11 15 13 14 12}, or {0 3 2 1 4 5 8 7 6}.

8. The method according to claim 1, characterized in that The first subsequence satisfies a preset relationship, including: The i+Ath element in the first subsequence is equal to the sum of the ith element and A, N=2×A, A is an integer greater than 1, and i is a positive integer less than or equal to A.

9. The method according to claim 8, characterized in that The j-th element in the first subsequence is equal to the j-th element in the first sequence, where j is a positive integer less than or equal to A.

10. The method according to claim 1, characterized in that The first subsequence satisfies a preset relationship, including: The i+Ath element in the first subsequence is equal to the sum of the ith element and 1, N=2×A, A is an integer greater than 1, and i is a positive integer less than or equal to A.

11. The method according to claim 10, characterized in that The j-th element in the first subsequence is equal to T times the j-th element in the first sequence, where T is the ratio of N to M, M is the length of the first sequence, and j is a positive integer less than or equal to A.

12. The method according to claim 2, 3, 4, 5, 6, 9 or 11, characterized in that The first sequence is: {0 1 2 4 3 5 6 7 8 16 9 17 10 18 11 19 12 20 13 21 14 22 15 23 24 25 26 28 27 29 30 31}.

13. The method according to any one of claims 8 to 11, characterized in that The first subsequence satisfies a preset relationship, including: The first subsequence is {0 1 2 4 3 5 6 7 8 16 9 17 10 18 11 19 12 20 13 21 14 22 15 23 24 25 26 28 27 29 30 31 32 33 34 36 35 37 38 39 40 48 41 49 42 50 43 51 44 52 45 53 46 54 47 55 56 57 58 60 59 61 62 63}, or, {0 2 4 8 6 10 12 14 16 32 18 34 20 36 22 38 24 40 26 42 31 47 49 51 53 57 55 59 61 63}.

14. A communication device, characterized in that: The method comprises various functional modules for implementing the method according to any one of claims 1 to 13.

15. A communication device, characterized in that: include: A processor, wherein the processor is coupled to a memory, wherein the memory is used to store a computer program, and when the processor calls the computer program, the device is caused to execute the method according to any one of claims 1 to 13.

16. A computer program product, characterized in that The method comprises a computer program code, which, when executed on a computer, causes the computer to implement the method according to any one of claims 1 to 13.

17. A computer readable medium, characterized in that The computer-readable medium stores a program code for computer execution, the program code including instructions for executing the method according to any one of claims 1 to 13.

Images