Communication method and communication device

Abstract

The invention provides a communication method and a communication device applied to the field of communication. In the technical scheme provided by the invention, network equipment can perform sub-block interleaving processing on a first to-be-interleaved sequence comprising N sub-blocks based on a first sub-sequence, the first sub-sequence comprises N elements, the N elements are in one-to-one correspondence with the N sub-blocks, and each element in the N elements is used for indicating a sequence number of the corresponding sub-block in the first to-be-interleaved sequence, the first subsequence satisfies a preset relationship. The invention provides a channel coding scheme in a low power consumption scene.

Description

Technical Field

[0001] This application relates to the field of wireless communication, and in particular, to a communication method and a communication device. Background Art

[0002] In the 18th release (R18) of the 3rd generation partnership project (3GPP), a low power wake up signal (LP-WUS) was introduced to support the low latency and ultra-low power consumption mechanism of terminal devices in R18. Among them, the terminal device uses a separate low power wake up receiver (LP-WUR) to monitor the LP-WUS and uses the main receiver to process uplink and downlink data. Before receiving the LP-WUS, the main receiver of the terminal device can be set to the off state or the deep sleep state. After receiving the LP-WUS, the terminal device wakes up the main receiver to achieve data reception and transmission, thereby achieving the purpose of energy saving. However, after the introduction of the LP-WUS, the channel coding scheme during LP-WUS transmission has become an urgent problem to be solved. Summary of the Invention

[0003] Embodiments of this application provide a communication method and a communication device, which are applied to the field of wireless communication. This application provides a channel coding scheme for transmitting a low power wake up signal (LP-WUS) in a low power consumption scenario.

[0004] In a first aspect, this application provides a communication method, which is applied to a network device. The method includes: obtaining a first sequence to be interleaved, where 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 a first sub-sequence, where the first sub-sequence includes N elements, the N elements correspond to the N sub-blocks one by one, and each element in the N elements is used to indicate the serial number of the corresponding sub-block in the first sequence to be interleaved, and the first sub-sequence satisfies a preset relationship.

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

[0006] 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 channel coding scheme of a polar code and then implement rate matching based on a sub-block interleaving rate matching method. For example, when the encoded LP-WUS is a polar code with a mother code length Z (Z is a positive integer power of 2), the network device can divide 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 the first sequence to be interleaved; after determining the first sequence to be interleaved, the network device can perform sub-block interleaving processing on the first sequence to be interleaved based on the first subsequence S(j) to obtain the first interleaved sequence, so as to obtain an interleaved sequence of Z bits, and perform rate matching on the interleaved sequence of Z bits by using a rate matching method based on sub-blocks. Among them, the sub-block with the serial number j in the first interleaved sequence can correspond to the sub-block with the serial number S(j) in the first sequence to be interleaved.

[0007] In this technical solution, the first subsequence S(j) can include N elements, and the N elements can correspond to the N sub-blocks one by one. Each of the N elements can be used to indicate the serial number of the corresponding sub-block in the first sequence to be interleaved. Among them, the first subsequence satisfying the preset relationship can be understood as the N elements in the first subsequence satisfying the preset relationship. Among them, the preset relationship can be set according to actual needs and will not be specifically limited here.

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

[0009] Combined with the first aspect, in some implementation manners of the first aspect, 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.

[0010] In this implementation manner, the first sequence can 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 the preset relationship between the first sequence and the first subsequence.

[0011] As an example, the first subsequence satisfying a preset relationship with the first sequence can be understood as that there is a preset relationship between the elements included in the first subsequence and the elements included in the first sequence.

[0012] In combination with the first aspect, in some implementations of the first aspect, the first subsequence includes elements in the first sequence that are less than N, where N is less than or equal to M, and M is the length of the first sequence; or, the first subsequence includes elements in a second subsequence that are less than N, where the second subsequence is a sequence formed by the difference between each element in the first sequence that is greater than or equal to N and N.

[0013] As an example, the length of the first sequence can be understood as the number of elements included in the first sequence.

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

[0015] As an example, elements in the first sequence whose element values are greater than or equal to N can be extracted, and a sequence formed by the difference between each of the extracted elements and N can be used as the second subsequence. The first subsequence may include elements in the second subsequence whose element values are less than N.

[0016] In combination with the first aspect, in some implementations of the first aspect, the first subsequence includes elements in a third subsequence that are less than N, where the third subsequence is a sequence formed by the quotient of elements in the first sequence whose remainder when divided by a first ratio is R and the first ratio. The first ratio is the quotient of M and N, where N is less than or equal to M, and M is the length of the first sequence, and R includes non - negative integers less than the first ratio.

[0017] In this implementation, elements in the first sequence whose remainder when divided by the first ratio is R can be extracted, and a sequence formed by the quotient of each of the extracted elements divided by the first ratio can 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 can be 0 or 1.

[0018] In combination with the first aspect, in some implementations of the first aspect, the first subsequence includes elements in a fourth subsequence that are less than N, where the fourth subsequence is a sequence formed by the quotient of each element in the first sequence and a first ratio. The first ratio is the quotient of M and N, where N is less than or equal to M, and M is the length of the first sequence.

[0019] In this implementation, a sequence formed by the quotient of each element in the first sequence and the first ratio can be used as the fourth subsequence. The first subsequence may include elements in the fourth subsequence whose element values are less than N.

[0020] In combination with the first aspect, in certain implementations of the first aspect, the first subsequence includes elements in the fifth subsequence that are less than N. The fifth subsequence is a sequence formed by the quotient of the multiple elements included in the first sequence and 2. The multiple elements correspond to multiple sub-blocks one by one. Each element in the multiple elements is used to indicate the serial number of the corresponding sub-block in the second sequence to be interleaved. The serial number of each sub-block in the multiple sub-blocks in the interleaved sequence is odd or even. The interleaved sequence is obtained by the first sequence performing sub-block interleaving processing on the second sequence to be interleaved.

[0021] As an example, the interleaved sequence can be understood as the second interleaved sequence. For example, the network device can obtain the second interleaved sequence after performing sub-block interleaving processing on the second sequence to be interleaved based on the first sequence.

[0022] In this implementation, multiple sub-blocks with odd or even serial numbers in the second interleaved sequence can be extracted, and multiple elements corresponding to the multiple sub-blocks in the first sequence can be extracted. The sequence formed by the quotient of each element in the multiple elements divided by 2 is used as the fifth subsequence. The first subsequence can include elements in the fifth subsequence whose element values are less than N.

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

[0024] 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 can obtain the first interleaved sequence after performing sub-block interleaving processing on the first sequence to be interleaved based on the first subsequence. Among them, the sub-block with the serial number 3 in the first sequence to be interleaved before interleaving is located at the 5th position in the first interleaved sequence after interleaving processing. The sub-block with the serial number 4 in the first sequence to be interleaved before interleaving is located at the 4th position in the first interleaved sequence after interleaving processing. In this example, the sub-blocks with the serial numbers 3 and 4 in the first sequence to be interleaved before interleaving are swapped after interleaving processing.

[0025] In combination with the first aspect, in some implementations of the first aspect, the first subsequence satisfies a preset relationship, including: the (i + A)-th 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.

[0026] In this implementation, there is a preset relationship between the (i + A)-th element and the i-th element in the first subsequence. Therefore, after determining the first A elements in the first subsequence, the (A + 1)-th to the 2A-th elements in the first subsequence can be determined based on the first A elements.

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

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

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

[0030] As an example, when A = X×M and X is an integer greater than 1, the first M elements in the first subsequence can include M elements in the first sequence. Among the (M + 1)-th to the 2M-th elements of the first subsequence, the (c + M)-th element can be the sum of the c-th element and M. Thus, the first 2M elements in the first subsequence can be determined, and further, the first A elements in the first subsequence can be determined, where c is a positive integer less than or equal to M.

[0031] In combination with the first aspect, in some implementations of the first aspect, the first subsequence satisfies a preset relationship, including: the (i + A)-th 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.

[0032] In this implementation, there is a preset relationship between the (i + A)-th element and the i-th element in the first subsequence. Therefore, after determining the first A elements in the first subsequence, the (A + 1)-th to the 2A-th elements in the first subsequence can be determined based on the first A elements.

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

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

[0035] As an example, when A = M, T = 2, the first A elements in the first subsequence may include the values obtained by multiplying each of the M elements in the first sequence by 2. For example, when the first sequence is {0 1}, the first A elements in the first subsequence may be {0 2}.

[0036] As an example, when A = X × M and X is an integer greater than 1, T = 2 × X. The first M elements in the first subsequence may be the values obtained by multiplying each of the M elements in the first sequence by 2 × X. Among the (M + 1)-th to the 2M-th elements of the first subsequence, the (c + M)-th element may be the sum of the c-th 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.

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

[0038] In this implementation, the first sequence may be the above-mentioned 32-long sub-block interleaved sequence.

[0039] In combination with the first aspect, in some implementations of the first aspect, 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 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}.

[0040] In this implementation manner, when the length of the first subsequence is 64, the first subsequence can be {0 1 2 4 3 5 67 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 3334 36 35 37 38 39 40 48 41 49 42 50 43 51 44 52 45 53 46 54 47 55 56 57 58 6059 61 62 63}, or the first subsequence can be {0 2 4 8 6 10 12 14 16 32 18 34 20 36 22 3824 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 1935 21 37 23 39 25 41 27 43 29 45 31 47 49 51 53 57 55 59 61 63}.

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

[0042] For example, the device may include: an acquisition module and a processing module. The acquisition module is used to acquire a first sequence to be interleaved, and the first sequence to be interleaved includes N sub-blocks, where N is an integer greater than 1; the processing module is used to perform sub-block interleaving processing on the first sequence to be interleaved based on the first subsequence, the first subsequence includes N elements, the N elements correspond to the N sub-blocks one by one, and each element in the N elements is used to indicate the serial number of the corresponding sub-block in the first sequence to be interleaved, and the first subsequence satisfies a preset relationship.

[0043] In combination with the second aspect, in some implementation manners of the second aspect, that the first subsequence satisfies a preset relationship includes: that the first subsequence satisfies a preset relationship with a first sequence, and the first sequence is a known sequence.

[0044] In combination with the second aspect, in some implementation manners of the second aspect, the first subsequence includes elements in the first sequence that are less than N, where N is less than or equal to M, and M is the length of the first sequence; or, the first subsequence includes elements in a second subsequence that are less than N, and the second subsequence is a sequence formed by the difference between each element in the first sequence that is greater than or equal to N and N.

[0045] 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. The third subsequence is a sequence formed by the quotient of the elements in the first sequence whose remainder when divided by the first ratio is R and the first ratio. The first ratio is the quotient of M and N, where N is less than or equal to M, M is the length of the first sequence, and R includes non - negative integers less than the first ratio.

[0046] 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. The fourth subsequence is a sequence formed by the quotient of each element in the first sequence and the first ratio. The first ratio is the quotient of M and N, where N is less than or equal to M, and M is the length of the first sequence.

[0047] In combination with the second aspect, in certain implementations of the second aspect, the first subsequence includes elements in the fifth subsequence that are less than N. The fifth subsequence is a sequence formed by the quotient of multiple elements included in the first sequence and 2. The multiple elements correspond to multiple sub - blocks one by one. Each element in the multiple elements is used to indicate the serial number of the corresponding sub - block in the second sequence to be interleaved. The serial number of each sub - block in the interleaved sequence is odd or even. The interleaved sequence is obtained by performing sub - block interleaving processing on the second sequence to be interleaved with the first sequence.

[0048] In combination with the second aspect, in certain implementations of the second 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}.

[0049] In combination with the second aspect, in certain implementations of the second aspect, the first subsequence satisfies a preset relationship, including: the (i + A)-th 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.

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

[0051] In combination with the second aspect, in certain implementations of the second aspect, the first subsequence satisfies a preset relationship, including: the (i + A)-th 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.

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

[0053] In combination with the second aspect, in certain 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}.

[0054] In combination with the second aspect, in certain implementations of the second aspect, 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 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}.

[0055] In a third aspect, the present application provides a communication device, including a processor, which can be coupled to a memory and is used to call program code in the memory to execute the method described in the first aspect or any one of its possible implementations. Optionally, the device further includes a memory. Optionally, the device further includes a communication interface, and the processor is coupled to the communication interface.

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

[0057] In a fourth aspect, the present application provides a computer program product including instructions. When the computer program product runs on a computer, it causes the computer to execute the method described in the first aspect or any one of its possible implementation manners.

[0058] In a fifth aspect, the present application provides a computer-readable medium. The computer-readable medium stores program code for a device to execute, and the program code includes code for executing the method described in the first aspect or any one of its possible implementation manners.

[0059] For the technical effects that can be achieved by any one of the third to fifth aspects and any one of its possible designs, please refer to the technical effects that can be brought by the first aspect or any one of its possible implementation manners described above, and will not be repeated here. Description of the Drawings

[0060] Figure 1 FIG. is a schematic diagram of an application scenario provided by an embodiment of the present application;

[0061] Figure 2 FIG. is a schematic diagram of a communication system process provided by another embodiment of the present application;

[0062] Figure 3 FIG. is a schematic diagram of the working principle of a low-power wake-up signal provided by an embodiment of the present application;

[0063] Figure 4 FIG. is a schematic flowchart of a communication method provided by an embodiment of the present application;

[0064] Figure 5 FIG. is a schematic structural diagram of a communication device provided by an embodiment of the present application;

[0065] Figure 6 FIG. is a schematic structural diagram of a communication device provided by another embodiment of the present application. Detailed Embodiments

[0066] Here, the exemplary embodiments will be described in detail, and the examples are shown in the drawings. When the following description relates to the drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The implementation manners described in the following exemplary embodiments do not represent all implementation manners consistent with the present application. On the contrary, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the appended claims.

[0067] The technical solutions provided by this application can be applied to various communication systems, including but not limited to: narrow band-internet of things (NB-IoT), global system for mobile communications (GSM), enhanced data rate for GSM evolution (EDGE), wideband code division multiple access (WCDMA), code division multiple access (CDMA) 2000 system, time division-synchronization code division multiple access (TD-SCDMA), long term evolution (LTE), 5th generation (5G) mobile communication system (such as 5G new radio (NR) communication system), various future evolved communication systems (such as 6th generation (6G) communication system), or wireless communication systems such as satellite communication.

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

[0069] 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, user unit, user station, mobile station, mobile platform, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent or user device, etc. The terminal device may be a device that provides voice / data connectivity to users. For example, it may be a handheld device with wireless connection function, a vehicle-mounted device, etc. Currently, some examples of terminal devices are: mobile phone, tablet computer, laptop computer, palmtop computer, mobile internet device (MID), wearable device, virtual reality (VR) device, augmented reality (AR) device, wireless terminal in industrial control, wireless terminal in self-driving, wireless terminal in remote medical surgery, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, wireless terminal in smart home, cellular phone, cordless phone, session initiation protocol (SIP) phone, wireless local loop (WLL) station, personal digital assistant (PDA), handheld device with wireless communication function, computing device or other processing device connected to a wireless modem, vehicle-mounted device, wearable device, terminal device in a 5G network or terminal device in a future evolved public land mobile network (PLMN), etc. The embodiments of the present application are not limited thereto. 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 part of the future development of information technology. Its main technical feature is to connect objects to the network through communication technology, so as to realize an intelligent network of human-machine interconnection and object-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 a device capable of supporting the terminal device to realize its functions, such as a chip system. This device may be installed in the terminal device.In the embodiments of the present application, the chip system may be composed of chips, or may include chips and other discrete devices.

[0070] The network device in the embodiments of the present application may be a device that provides wireless communication functions for terminal devices, and may also be referred to as an access network device or a radio access network device. It may be a transmission reception point (TRP), or may also be an evolved NodeB (eNB or eNodeB) in the LTE system, or may also be a home base station (for example, home evolved NodeB, or home Node B, HNB), a base band unit (BBU), or may also be a radio controller in the cloud radio access network (CRAN) scenario. Or the network device may be a relay station, an access point, a vehicle-mounted device, a wearable device, and a network device in a 5G network or a network device in a future evolved PLMN network, etc. It may be an access point (AP) in a WLAN, or may be a gNB in a new radio (NR) system, or may be a satellite base station in a satellite communication system, etc., as well as a device that undertakes the function of a network device in Device-to-Device (D2D), vehicle-to-everything (V2X), and machine-to-machine (M2M) communications. The embodiments of the present application do not limit this. In one 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 implementing the function of the network device may be the network device itself, or may be a device capable of supporting the network device to implement its function, such as a chip system, and this device may be installed in the network device.

[0071] The network device provides services for the terminal devices in the cell. The terminal devices communicate with the network device corresponding to the cell or other devices through the transmission resources allocated by the network device (for example, frequency domain resources, or in other words, spectrum resources). The network device can be a macro base station (such as a macro eNB or a macro gNB, etc.), or can also be a base station corresponding to a small cell. Here, the small cell can include: metro cell, micro cell, picocell, femto cell, etc. These small cells have the characteristics of small coverage range and low transmission power, and are suitable for providing high-rate data transmission services.

[0072] The embodiments of the present application can be applied to a 5G communication system. Exemplarily, Figure 1 FIG. is a schematic diagram of an application scenario provided for an embodiment of the present application. As Figure 1 shown, the communication system 100 may include a base station 110, a terminal device 121, and a terminal device 122. Among them, the number of terminal devices is only an example, and the embodiments of the present application do not limit this.

[0073] Among them, the base station 110 can provide communication services for the terminal devices in a cell, such as the terminal device 121 and the terminal device 122. The base station 110 can send downlink information to the terminal device 121 and / or the terminal device 122. The downlink information can be control information or data information, and the embodiments of the present application do not limit this. The terminal device 121 and / or the terminal device 122 can send uplink information to the base station 110.

[0074] The base station 110 may include a BBU and a remote radio unit (RRU). The BBU and the RRU can be placed in different places. For example, the RRU is pulled far and placed in a high-traffic area, and the BBU is placed in the central computer room. The BBU and the RRU can also be placed in the same computer room. The BBU and the RRU can also be different components under a rack.

[0075] Next, in combination with Figure 2 , the communication system process when the network device and the terminal device communicate is described in detail.

[0076] Figure 2 FIG. is a schematic diagram of a communication system process provided for another embodiment of the present application. For ease of description, it is assumed that the network device is the sending end and the terminal device is the receiving end. The network device can send a downlink signal to the terminal device. The downlink signal can be called the digital signal to be transmitted, or the information source. It should be understood that Figure 2 the communication system process shown can also be applied to the communication scenario where the terminal device sends an uplink signal to the network device.

[0077] As shown in Figure 2 Figure , the network device needs to perform source coding to convert the source into a bit stream, perform channel coding on the bit stream, and modulate the coded bit stream into a signal waveform suitable for channel transmission, and then send the signal waveform to the channel; correspondingly, the terminal device can detect the downlink signal sent by the network device on the channel. After the terminal device detects the signal, it can demodulate, channel decode, and source decode the detected signal, so as to restore the downlink signal, and convert the restored downlink signal into the target data format after destination decoding.

[0078] In some implementation manners, polar codes can be used for channel coding and channel decoding. Among them, after the network device implements channel coding through polar codes, it can adjust the number of bits of the coded bit stream through rate matching to adapt to the carrying capacity of the channel, that is, the number of bits of the adjusted bit stream is the same as the number of bits that the channel can carry. Correspondingly, the terminal device can perform derate matching before channel decoding.

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

[0080] Table 5.4.1.1-1 Sub-block Interleaver Pattern P(i)

[0081] i P(i) i P(i) i P(i) i P(i) i P(i) i P(i) i P(i) i P(i) 0 0 4 3 8 8 12 10 16 12 20 14 24 24 28 27 1 1 5 5 9 16 13 18 17 20 21 22 25 25 29 29 2 2 6 6 10 9 14 11 18 13 22 15 26 26 30 30 3 4 7 7 11 17 15 19 19 21 23 23 27 28 31 31

[0082] In this example, it is assumed that after polar code coding, a mother code length polar code with a length of W (W is a positive integer power of 2) is obtained. The W polar code bits are divided into 32 sub-blocks, and each sub-block can contain W / 32 bits. At this time, the sequence composed of 32 sub-blocks can be called the sequence to be interleaved. The network device can interleave these 32 sub-blocks based on Table 5.4.1.1-1 to obtain an interleaved sequence, so as to obtain an interleaved sequence of W bits. Among them, i can be understood as the serial number of each sub-block in the 32 sub-blocks in the interleaved sequence, and P(i) can be understood as the serial number of each sub-block in the 32 sub-blocks in the sequence to be interleaved. The sub-block with the serial number i in the interleaved sequence corresponds to the sub-block with the serial number P(i) in the sequence to be interleaved, so as to realize the interleaving of 32 sub-blocks. For example, the sub-block with the serial number 3 in the interleaved sequence corresponds to the sub-block with the serial number 4 in the sequence to be interleaved, and the sub-block with the serial number 4 in the interleaved sequence corresponds to the sub-block with the serial number 3 in the sequence to be interleaved.

[0083] In the embodiments 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 interleaving sequence. Table 5.4.1.1-1 can be understood as a 32-length sub-block interleaver, i can be understood as the serial number of the element in this sub-block interleaver, and P(i) can be understood as the element in this sub-block interleaver. For example, the element with the serial number 3 in this sub-block interleaver is 4.

[0084] Among them, after the network device obtains the W interleaved bit sequences, it can determine E bits based on these W bits by means of puncture, shortening or repetition, so as to complete rate matching. Among them, E is the number of bits after rate matching, that is, the number of bits that the channel can carry.

[0085] In the 18th release (R18) of the 3rd generation partnership project (3GPP), a low power wake up signal (LP-WUS) was introduced to support the low-latency and ultra-low-power mechanism of the terminal device. Figure 3 This is a schematic diagram of the working principle of a low power wake up signal provided by the embodiments of the present application. As Figure 3 shown, the terminal device may include a main receiver and a low power wake up receiver (LP-WUR). The main receiver and the LP-WUR are respectively configured with separate antennas and radio frequency (RF) units. Among them, the downlink signal sent by the network device to the terminal device may include an NR signal and an LP-WUS. The terminal device may use the main receiver to receive the NR signal and may use the LP-WUR to monitor the LP-WUS. Before receiving the LP-WUS, the main receiver of the terminal device may be set to the off state or the deep sleep state. After receiving the LP-WUS, the terminal device may wake up the main receiver to achieve signal reception, so as to achieve the purpose of energy saving. It should be noted that the terminal device may also use the main receiver to send an uplink signal to the network device. However, after the introduction of the LP-WUS, the channel coding scheme during the transmission of the LP-WUS has become an urgent problem to be solved.

[0086] Those skilled in the art propose that the 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 the polar code) is 32, and the length of its sub-block interleaving sequence 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 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 urgently needs to be solved. It should be noted that LP-WUS is introduced to meet the low-latency and ultra-low-power consumption mechanism of terminal devices. Therefore, when LP-WUS is transmitted, the maximum payload size, the number of bits of the radio network temporary identity (RNTI), and the number of bits of the cyclic redundancy check (CRC) will be reduced accordingly, so that the minimum mother code length of 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 the control channel used to transmit LP-WUS in a low-power scenario. This channel coding scheme can be compatible with the NR control channel coding scheme, so as to solve 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 the control channel used to transmit LP-WUS can adopt the same channel coding scheme, and the minimum mother code length in this 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 applied to dedicated network devices or general devices. For example, it can be applied to various terminal devices that support low-latency and ultra-low-power consumption mechanisms, and can also be applied to network devices.

[0088] Next, the technical solution provided by the present application will be described in detail with reference to the accompanying drawings.

[0089] Figure 4 It is a schematic flowchart of a communication method provided by an embodiment of the present application. As Figure 4 shown, the method may include S410 and S420.

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

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

[0092] In this embodiment, when the network device sends LP-WUS to the terminal device, LP-WUS can be subjected to source coding, channel coding, rate matching, and modulation before being sent to the channel; correspondingly, the terminal device can detect LP-WUS on the channel.

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

[0094] S420. Perform sub-block interleaving processing on the first sequence to be interleaved based on the first subsequence. The first subsequence contains N elements, and the N elements correspond to the N sub-blocks one by one. Each element in the N elements is used to indicate the serial number of the corresponding sub-block in the first sequence to be interleaved. The first subsequence satisfies a preset relationship.

[0095] As an example, after determining the first sequence to be interleaved, the network device can perform sub-block interleaving processing on the first sequence to be interleaved based on the first subsequence, so as to obtain the first interleaved sequence, and then an interleaved Z-bit sequence can be obtained. After the network device obtains the interleaved Z-bit sequence, rate matching can be achieved by means of puncturing, shortening, or repeating. Among them, the first interleaved sequence contains N sub-blocks. The sub-block with serial number j in the first interleaved sequence can correspond to the sub-block with serial number S(j) in the first sequence to be interleaved, so as to realize the interleaving of N sub-blocks. It should be understood that the first subsequence S(j) can contain N elements, and the N elements can correspond to the N sub-blocks one by one. Each element in the N elements can be used to indicate the serial number of the corresponding sub-block in the first sequence to be interleaved. In the embodiment of the present application, S(j) can be called the first subsequence, or an N-length sub-block interleaving sequence. The first subsequence satisfies a preset relationship. Among them, the preset relationship can be set according to actual needs, and the present application does not make specific limitations on this.

[0096] In some possible implementation manners, the first subsequence satisfies a preset relationship, which can be understood as that the N elements in the first subsequence satisfy the preset relationship. For example, the first subsequence can be any one of the following sequences: {0 1 2 3 4 8 5 96 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 67 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 14 5 8 7 6}.

[0097] In an embodiment of the present application, a channel coding scheme in a low-power scenario is provided, so that a network device can transmit LP-WUS based on this channel coding scheme, thereby implementing channel coding in a low-power scenario. It should be understood that LP-WUS is only an example of the signal transmitted in a low-power scenario, and this embodiment can also be applied to other low-power scenarios, and the present application does not make specific limitations thereon.

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

[0099] In this implementation manner, when N is less than or equal to the length M of the first sequence, the first subsequence can be extracted from the first sequence. Wherein, 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 called the mother sub-block interleaved sequence of the first subsequence.

[0100] As a first example, the first subsequence S(j) can include the elements in the first sequence Q(i) that are less than N, or in other words, N elements with element values less than N can be extracted from the first sequence Q(i) in the 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 subsequence S(j) can be extracted from the sub-block interleaved sequence P(i) in Table 5.4.1.1-1 in the following way: {S(j) = P(i) < 16, i = 0, 1, …, 31, j = 0, 1, …, 15}. For example, the first subsequence S(j) = {0 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15}, or the first subsequence S(j) can be as shown in Table 1:

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

[0103] j S(j) j S(j) j S(j) j S(j) 0 0 4 3 8 8 12 12 1 1 5 5 9 9 13 13 2 2 6 6 10 10 14 14 3 4 7 7 11 11 15 15

[0104] It should be understood that j can be regarded as the serial number of each sub-block in the first interleaved sequence among the 16 sub-blocks, S(j) can be regarded as the serial number of each sub-block in the first sequence to be interleaved among the 16 sub-blocks, and the sub-block with the serial number j in the first interleaved sequence corresponds to the sub-block with the serial number S(j) in the first sequence to be interleaved, so as to realize the interleaving of 16 sub-blocks. For example, the sub-block with the serial number 3 in the first interleaved sequence corresponds to the sub-block with the serial number 4 in the first sequence to be interleaved, and the sub-block with the serial number 4 in the first interleaved sequence corresponds to the sub-block with the serial number 3 in the first sequence to be interleaved.

[0105] 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 sub-block interleaved sequence of length 16. Table 1 can be regarded as a sub-block interleaver of length 16. j can be regarded as the serial number of the element in this sub-block interleaver, and S(j) can be regarded as the element in this sub-block interleaver. For example, the element with the serial number 3 in this sub-block interleaver is 4.

[0106] The method for extracting the first subsequence is simple, and only the positions of the 4th sub-block (i.e., the sub-block with the serial number 3 in the first interleaved sequence) and the 5th sub-block (i.e., the sub-block with the serial number 4 in the first interleaved sequence) are changed in the first subsequence extracted by this method. Therefore, when the network device performs sub-block interleaving processing on the first sequence to be interleaved based on the first subsequence determined by this method, the interleaving order of the sub-blocks can be closer to the natural order.

[0107] As a second example, the first subsequence S(j) can include the elements in the second subsequence S 2 (j 2 ) that are less than N. The second subsequence S 2 (j 2) It can 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 S can be extracted from the first sequence Q(i) in the following way 2 (j 2 ) : {S 2 (j 2 ) = (Q(i) ≥ N) - N, i = 0, 1, …, M - 1, j 2 = 0, 1, …, M - N + 1}, the first subsequence S(j) can be extracted from the second subsequence S 2 (j 2 ) in the following way: {S(j) = S 2 (j 2 ) < N, j 2 = 0, 1, …, M - N + 1, j = 0, 1, …, N - 1}. Among them, 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.

[0108] 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 S 2 (j 2 ) is the 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, S 2 (j 2 ) = {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 less than N = 16 in the second subsequence S 2 (j 2 ), S(j) = {0 1 2 3 4 5 6 7 8 9 10 12 11 13 14 15}.

[0109] As a third example, the first subsequence S(j) can contain the elements less than N in the third subsequence S 3 (j 3 ), the third subsequence S 3 (j 3 ) can be a sequence formed by the quotient of the elements whose remainder with the first ratio is R and the first ratio in the first sequence Q(i), the first ratio is the quotient of M and N, and R can contain non - negative integers less than the first ratio. Among them, the third subsequence S 3 (j 3Elements less than N in can be understood as the third subsequence S 3 (j 3 ) with element values less than N.

[0110] In this example, the first ratio u can be 1 ≤ u ≤ M, and the symbol can be understood as floor division, that is, u can be understood as the quotient between 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 implementations, the first ratio u can also be 2 ≤ u ≤ M, and the symbol can be understood as ceiling division, and this application does not limit it. The following takes as an example to illustrate the content in this example.

[0111] For example, elements in the first sequence Q(i) whose remainder is equal to R after being divided by the first ratio u can be extracted in sequence, and a sequence composed of the values obtained by floor dividing each extracted element by the first ratio u can be used as the third subsequence S 3 (j 3 ), that is, a sequence composed of the quotient of each extracted element divided by the first ratio u is used as the third subsequence S 3 (j 3 ). It should be understood that dividing each extracted element by the first ratio u is to scale the value range of the extracted elements to between 0 and N. The first subsequence S(j) can include elements less than N in the third subsequence S 3 (j 3 ). It should be noted that if floor division is used when calculating the first ratio u, then floor division should also be used when determining the third subsequence S 3 (j 3 ); correspondingly, if ceiling division is used when calculating the first ratio u, then ceiling division should also be used when determining the third subsequence S 3 (j 3 ). If the number of elements in the first sequence Q(i) whose remainder is equal to R after being divided by the first ratio u is less than N, then elements in the first sequence Q(i) whose remainder is equal to R ± 1 after being divided by the first ratio u can be extracted continuously until the number of extracted elements is equal to N.

[0112] 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. At this time, R can be 0 or 1. Assuming 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 the sequence formed by the values obtained by taking the floor of each extracted element after dividing by the first ratio u = 2 is used as the third subsequence S 3 (j 3 ), that is, S 3 (j 3 ) = {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 S 3 (j 3 ) 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) can be as shown in Table 2:

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

[0114] j S(j) j S(j) j S(j) j S(j) 0 0 4 4 8 6 12 12 1 1 5 8 9 10 13 13 2 2 6 5 10 7 14 14 3 3 7 9 11 11 15 15

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

[0116] 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 interleaved sequence. Table 2 can be understood as a 16-length sub-block interleaver. j can be understood as the serial number of the element in this sub-block interleaver, and S(j) can be understood as the element in this sub-block interleaver. For example, the element with serial number 5 in this sub-block interleaver is 8.

[0117] In this example, compared with the rate matching method of puncturing or shortening based on the first subsequence shown in Table 1, when the network device performs rate matching of puncturing or shortening based on the first subsequence shown in Table 2, the distribution of the puncturing or shortening positions is more uniform, and thus the performance of the polar code after rate matching is better. Among them, only the positions of the 4th sub-block and the 5th sub-block in the first interleaved sequence are changed in the first subsequence shown in Table 1.

[0118] As a fourth example, the first subsequence S(j) can include a fourth subsequence S 4 (j4 ) the elements less than N in the fourth subsequence S 4 (j 4 ) can be a sequence formed by the quotient of each element in the first sequence Q(i) and the first ratio. Among them, the fourth subsequence S 4 (j 4 ) the elements less than N in can be understood as the elements in the fourth subsequence S 4 (j 4 ) whose element values are less than N.

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

[0120] For example, the quotient of each element in the first sequence Q(i) divided by the first ratio u can be calculated in turn, and the sequence formed by the calculated quotients is used as the fourth subsequence S 4 (j 4 ). Among them, only the quotient that appears for the first time can be included in the fourth subsequence S 4 (j 4 ). When 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 the elements less than N in the fourth subsequence S 4 (j 4 ). In some embodiments, when calculating the quotient of each element in the first sequence Q(i) divided by the first ratio u, the quotient that appears for the first time can be included in the fourth subsequence S 4 (j 4 ) in turn until the length of the fourth subsequence S 4 (j 4 ) is N. At this time, the fourth subsequence S 4 (j 4 ) can be regarded as the first subsequence S(j).

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

[0122] 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 when N = 16, the first ratio u = 32 / 16 = 2. In some implementations, the pseudo-code for generating the first subsequence can be based on the sub-block interleaved sequence P(i) shown in Table 5.4.1.1-1, so as to determine the first subsequence. The present application does not limit the specific implementation manner of the pseudo-code for generating the first subsequence.

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

[0124] As a fifth example, the first subsequence S(j) may include the fifth subsequence S 5 (j 5 ) of elements less than N, and the fifth subsequence S 5 (j 5 ) may be a sequence formed by the quotient of multiple elements included in the first sequence Q(i) and 2. The multiple elements may correspond to multiple sub-blocks one by one. Each element in the multiple elements is used to indicate the serial number of the corresponding sub-block in the second sequence to be interleaved. The serial number of each sub-block in the multiple sub-blocks in the interleaved sequence is odd or even. The interleaved sequence is obtained by the first sequence performing sub-block interleaving processing on the second sequence to be interleaved. The interleaved sequence in this example is the second interleaved sequence.

[0125] In this example, the network device can determine multiple sub-blocks with odd or even serial numbers j 5 in the second interleaved sequence, and extract the multiple elements corresponding to the multiple sub-blocks from S 5 (j 5 ), and round down or round up each element in the extracted multiple elements after dividing by 2, so as to obtain the fifth subsequence S 5 (j 5 ). It should be noted that in this embodiment, only the value of the first occurrence after rounding down each element in the multiple elements after dividing by 2 can be included in the fifth subsequence S 5 (j 5 ). If the value of rounding down each element in the multiple elements after dividing by 2 repeats, the repeated value is skipped, that is, the repeated value is not included in the fifth subsequence S 5 (j 5 ). Among them, the fifth subsequence S 5 (j 5) can be understood as taking the sequence formed by the quotients obtained by dividing each element in multiple elements by 2 as the fifth subsequence S 5 (j 5 )。The first subsequence S(j) can include the fifth subsequence S 5 (j 5 ) elements less than N, and the elements less than N in the fifth subsequence S 5 (j 5 ) can be understood as the elements in the fifth subsequence S 5 (j 5 ) with element values less than N.

[0126] 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, the P(i) corresponding to even or odd i in Table 5.4.1.1-1 can be extracted. For example, the sequence extracted when i is even in Table 5.4.1.1-1 is {06 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 then rounded down to obtain the fifth subsequence S 5 (j 5 ), S 5 (j 5 ) = {0 32 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 S 5 (j 5 ) less than N = 9, S(j) = {0 3 2 1 4 5 8 7 6}.

[0127] In this example, the first subsequence can be extracted from the first sequence based on the parity of the serial numbers of each sub-block in the M sub-blocks in the second interleaved sequence. When the network device performs rate matching based on the first subsequence determined by this method, better error correction performance can be obtained. Among them, if the first sequence is called the mother sub-block interleaved sequence of the first subsequence, the nesting characteristic between the first sequence and the first subsequence is the serial number nesting method.

[0128] As the 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 way.

[0129] 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 leftmost bit b0 can be the least significant bit (LSB), and the rightmost bit b4, or the last bit from left to right, can be the most significant bit (MSB). Then P(i) can be:

[0130]

[0131]

[0132] 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 elements corresponding to LSB = 0 are the P(i) values when i is {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 keep the 4 bits after removing LSB (b0), such as [b1 b2 b3 b4], so as to obtain 16 new binary sequences as follows:

[0133]

[0134] In the third step, convert the 16 4-bit binary numbers determined in the second step into decimal numbers, so as to obtain a 16-long sub-block interleaved sequence, that is, the first subsequence S(j). Among them, 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 determined in this example is the same as the first subsequences determined in the third example and the fourth example.

[0135] In some implementation manners, it is also possible to extract the binary sequences with LSB = 1, b1 = 0, b1 = 1, b2 = 0, and b2 = 1 from the binary sequence in the first step, and only keep the 4 bits after removing LSB, b1, or b2, so as to obtain 16 new binary sequences, and further obtain a 16-long sub-block interleaved sequence, that is, the first subsequence S(j), and the first subsequence S(j) = {0 1 2 3 4 8 5 9 6 10 7 11 12 13 14 15}.

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

[0137] As the 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 way.

[0138] 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. Then P(i) can be the 32-length binary sequence as shown in the first step of the sixth example, which will not be elaborated here.

[0139] 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 elements corresponding to MSB = 0 are the 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 keep the 4 bits after removing the MSB, such as [b0 b1 b2 b3], so as to obtain 16 new binary sequences as follows:

[0140]

[0141] In the third step, convert the 16 4-bit binary numbers determined in the second step into decimal numbers, so as to obtain the 16-length sub-block interleaved sequence, that is, the first subsequence S(j). Among them, the first subsequence 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 subsequence determined in this example is the same as the first subsequence determined in the first example.

[0142] In some implementations, it is also possible to extract the binary sequences with the second MSB (b3) = 0 from the binary sequences in the first step, and only retain the 4 bits after removing b3, so as to obtain 16 new binary sequences, and further obtain a 16-length sub-block interleaved sequence, that is, the first subsequence S(j), and the first subsequence S(j) = {0 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15}.

[0143] In some implementations, it is also possible to extract the binary sequences with the MSB = 1 or the second MSB (b3) = 1 from the binary sequences in the first step, and only retain the 4 bits after removing the MSB or b3, so as to obtain 16 new binary sequences, and further obtain a 16-length sub-block interleaved sequence, that is, the first subsequence S(j), and 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 by this method is the same as the first subsequence determined by the second example.

[0144] In this example, it is possible to generate a sub-block interleaver S(j) with a length N less than 32 based on the NR 32-length sub-block interleaver P(i), convert 32 decimal numbers into 32 binary sequences of log2(32) = 5 bits, and by taking out 16 binary numbers with MSB = 1, MSB = 0, b3 = 1 or b3 = 0, thus constituting the final 16-length sub-block interleaved sequence S(j). The method for extracting the first subsequence in this example is simple, and when the network device performs sub-block interleaving processing on the first sequence to be interleaved based on the first subsequence determined by this method, the interleaving order of the sub-blocks is more in line with the natural order.

[0145] In a possible implementation, the first subsequence satisfies a preset relationship. The first subsequence can be {0 1 2 43 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 3132 33 34 36 35 37 38 39 40 48 41 49 42 50 43 51 44 52 45 53 46 54 47 55 56 5758 60 59 61 62 63}, or the first subsequence can be {0 2 4 8 6 10 12 14 16 32 18 34 20 3622 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 1733 19 35 21 37 23 39 25 41 27 43 29 45 31 47 49 51 53 57 55 59 61 63}.

[0146] As an example, the first subsequence satisfies a preset relationship, which may include: there is a preset relationship between the (i + A)-th element and the i-th element in the first subsequence. 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 + 1)-th to 2A-th elements in the first subsequence can be determined based on the first A elements.

[0147] As an example, the preset relationship between the (i + A)-th element and the i-th element in the first subsequence may include: the (i + A)-th element in the first subsequence is equal to the sum of the i-th element and A.

[0148] As an example, the j-th element in the first subsequence can be equal to the j-th 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 processing on the second sequence to be interleaved based on the first sequence, so as to obtain a second interleaved sequence. The first sequence can include M elements, and the M elements correspond one by one to the M sub-blocks in the second sequence to be interleaved. Each of the M elements is used to indicate the serial number of the corresponding sub-block in the second sequence to be interleaved.

[0149] As an example, A can be a positive integer multiple of M. For example, when A = M, the first A elements in the first subsequence can include M elements in the first sequence. Another example is when A = X × M, where X is an integer greater than 1. In this case, the first M elements in the first subsequence can include M elements in the first sequence. Among the elements from the (M + 1)-th to the 2M-th in the first subsequence, the (c + M)-th element can be the sum between the c-th element and M. Thus, the first 2M elements in the first subsequence can be determined, and further, the first A elements in the first subsequence can be determined, where c is a positive integer less than or equal to M.

[0150] 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, where 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 S 1 (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}, and the elements from the 33rd to the 64th in S(j), S 2 (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}.

[0151] As another example, there can be a preset relationship between the (i + A)-th element and the i-th element in the first subsequence, which can include: the (i + A)-th element in the first subsequence is equal to the sum between the i-th element and 1.

[0152] As an example, the j-th element in the first subsequence can be equal to T times the j-th 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 processing on the second sequence to be interleaved based on the first sequence, so as to obtain a second interleaved sequence. The first sequence can include M elements, and the M elements correspond one by one to the M sub-blocks included in the second sequence to be interleaved. Each element in the M elements is used to indicate the serial number of the corresponding sub-block in the second sequence to be interleaved.

[0153] As an example, A can be a positive integer multiple of M. For example, when A = M, T = 2, and the first A elements in the first subsequence can include the values obtained by multiplying each of the M elements in the first sequence by 2. For example, when the first sequence is {0 1}, the first A elements in the first subsequence can be {0 2}. Another example is that when A = X × M and X is an integer greater than 1, T = 2 × X. The first M elements in the first subsequence can be the values obtained by multiplying each of the M elements in the first sequence by 2 × X. Among the (M + 1)-th element to the 2M-th element in the first subsequence, the (c + M)-th element can be the sum of the c-th 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.

[0154] 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}, and T = 2, then the first 32 elements S 1 (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 62}, and the 33rd element to the 64th element S 2(j) is: {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}, so, 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 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}.

[0155] 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 by extending the first sequence, so the first sequence can be called the mother block 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. Therefore, the first subsequence can also be called the mother block interleaved sequence of the first sequence. This application does not make specific restrictions on the relationship between the two.

[0156] In a 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 subsequence S(j) can be determined in the following way.

[0157] 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. Then P(i) can be a 32-bit binary sequence as shown in the first step of the sixth example, which will not be elaborated here.

[0158] In the second step, the binary sequence in the first step is bit-flipped in reverse order (from the 16th to the 1st) and cascaded to the 33rd to 64th positions of the binary sequence, as shown in the following bold part:

[0159]

[0160]

[0161] Among them, {1 1 1 1 1} can be flipped to {0 0 0 0 0} after bit flipping. It can be seen that the 17th binary bit is obtained by bit flipping the 16th binary bit, and so on. The 32nd binary bit is obtained by bit flipping the 1st binary bit.

[0162] In the third step, a new bit is added to the right of the MSB (such as b4) position of the 64 - row binary sequence obtained in the second step, and the added bit is used as the new MSB. Among the first 32 binary bits in the 64 - row binary sequence, the new MSB can be 0, and among the last 32 binary bits, the new MSB can be 1. As shown below, the new MSB is b5.

[0163]

[0164]

[0165] In the fourth step, the 64 6 - bit binary numbers determined in the third step are converted into decimal numbers, so as to obtain a 64 - length sub - block interleaved sequence, that is, the first sub - sequence S(j). Among them, the first sub - sequence 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}.

[0166] In a 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 way.

[0167] 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 right - most bit b4 can be the MSB.

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

[0169] Among them, the specific implementation processes of the first step and the second step in this implementation can refer to the first step and the second step in the above - mentioned possible implementation, which will not be elaborated here.

[0170] Step 3: Add a new bit to the left of the position of the MSB (such as b4) of the 64-bit binary sequence obtained in Step 2, and use the added bit as the new LSB. Among the first 32 binary bits of the 64-bit binary sequence, the new LSB can be 0, and among the last 32 binary bits, the new LSB can be 1. As shown below, the new MSB is the new b0.

[0171]

[0172]

[0173] Step 4: Convert the 64 6-bit binary numbers determined in Step 3 into decimal numbers, so as to obtain a 64-length sub-block interleaved sequence, that is, the first sub-sequence S(j). Where the first sub-sequence 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 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}.

[0174] In the embodiment of the present application, the network device can 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 implementation manners, there may also be a sub-block interleaved sequence in the 6G communication system, such as the first sub-sequence determined in the embodiment of the present application, but the usage scenario of the sub-block interleaved sequence may not be limited to before rate matching, and it can be applicable to scenarios such as hybrid automatic repeat-request (HARQ) transmission. For example, before HARQ transmission, polar code encoding can be performed on HARQ first, and the mother code length polar code with a length of Y (Y is a positive integer power of 2) obtained after encoding is divided into B sub-blocks. At this time, the sequence composed of the B sub-blocks can be called the third sequence to be interleaved; then sub-block interleaving is performed on the third sequence to be interleaved based on a preset sub-block interleaved sequence to obtain a third interleaved sequence, so as to obtain Y interleaved bit sequences. Therefore, the bit sequences carried in each sub-block can be sent in turn according to the numbering order of each sub-block in the third interleaved sequence, so as to complete the HARQ transmission.

[0175] In a possible implementation manner, the length of the sub-block interleaved sequence may be related to the mother code length of the polar code. For example, the maximum mother code length N of the polar codem When = 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 m = 1024, and the length of its corresponding sub - block interleaving sequence is 32 = 1024 / 32. Therefore, when the maximum mother code length N of the polar code m = 8192, the length of its sub - block interleaving sequence can be 8192 / 32 = 256.

[0176] Correspondingly, when the maximum mother code length N of the polar code with the sub - block interleaving sequence m = 4096, the length of the corresponding sub - block interleaving sequence can be 128. As an example, this sub - block interleaving sequence can be extracted from the 256 - long sub - block interleaving sequence corresponding to the mother code length of 8192, such as using the extraction methods shown in the first to seventh examples above, so that the 128 - long sub - block interleaving sequence can be used as a new sub - block interleaving sequence to adapt to the application scenario when the mother code length is shorter.

[0177] Correspondingly, when the maximum mother code length N of the polar code with the sub - block interleaving sequence m = 2048, the length of the corresponding sub - block interleaving sequence can be 64. As an example, this sub - block interleaving sequence can be extracted from the 128 - long sub - block interleaving sequence corresponding to the mother code length of 4096 to adapt to the application scenario when the mother code length is shorter.

[0178] Correspondingly, when the maximum mother code length N of the polar code with the sub - block interleaving sequence m is less than or equal to the maximum mother code length 1024 of the existing NR polar code but greater than 32, the length of the corresponding sub - block interleaving sequence can be 32. As an example, this sub - block interleaving sequence can be extracted from the 64 - long 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. Among them, this sub - block interleaving sequence can be the sub - block interleaving sequence in the existing NR polar, such as P(i) shown in Table 5.4.1.1 - 1.

[0179] In this implementation method, the length of the corresponding sub - block interleaving sequence can be determined according to the mother code length. For example, when the mother code length becomes shorter, the length of the corresponding sub - block interleaving sequence also becomes shorter accordingly. For example, the sub - block interleaving sequence corresponding to a shorter mother code can be nestedly read from the sub - block interleaving sequence corresponding to a longer mother code; another example is that the sub - block interleaving sequence corresponding to a longer mother code can be extended from the sub - block interleaving sequence corresponding to a shorter mother code length, such as the extension method described in the foregoing embodiments. In this implementation method, one sub - block interleaving sequence can be used to be compatible with the sub - block interleaving of different mother code lengths.

[0180] In some implementation manners, the selection of the rate matching manner in the low-power consumption 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 manner 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 manner based on sub-block interleaving is not supported. The preset value can be set according to actual requirements, and the present application does not make specific limitations thereon. 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 high. At this time, a rate matching manner based on puncturing or shortening with sub-block interleaving is not adopted, but a simple repetition rate matching manner is adopted. For example, the transmission length can be fixed to the mother code length, or rate matching is achieved through simple repetition based on the mother code length. The transmission length can be understood as the bit length or the 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 manner based on sub-block interleaving is relatively simple. Therefore, a rate matching manner based on sub-block interleaving can be supported, such as puncturing, shortening, or repetition. In the embodiments 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).

[0181] In this implementation manner, it is possible to determine whether to adopt a rate matching manner with relatively high complexity such as shortening or puncturing based on the mother code length, so as to achieve a compromise between the rate matching complexity and the communication performance.

[0182] It should be noted that in the embodiments of the present application, the terminal device can be a low-power consumption device, and the channel coding schemes involved in the terminal device, such as the data channel coding scheme and the control channel coding scheme of passive Internet of Things (passive IoT), can be the same, and the coding scheme of the existing NR control channel can be reused. Among them, to further reduce power consumption, the maximum mother code length of the channel coding scheme provided in the embodiments 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. For example, the minimum mother code length can be 16. In addition, after the network device performs channel coding and rate matching, it can choose not to perform a bit interleaving (such as triangular interleaving) operation, thereby reducing power consumption and reducing the complexity of encoding and decoding.

[0183] It should be understood that when the network device sends LP-WUS based on the channel coding scheme provided in the embodiments of the present application, corresponding changes should also occur in the operations such as detection, demodulation, and decoding when the terminal device receives LP-WUS.

[0184] Figure 5 This is a schematic structural diagram of a communication device provided in an embodiment of the present application. As shown in Figure 5As shown, the communication device 500 may include: an acquisition module 510 and a processing module 520. Among them, the device 500 can be used to implement Figure 4 each step / operation performed by the network device in the method shown.

[0185] For example, when the device 500 is used to implement the method implemented by the network device in Figure 4 , the acquisition module 510 can be used to implement S410; the processing module 520 can be used to implement S420.

[0186] Figure 6 It is a schematic structural diagram of a communication device provided in another embodiment of the present application. Figure 6 The device 600 shown can be used to implement the method performed by the network device in any of the foregoing embodiments.

[0187] Such as Figure 6 shown, the device 600 of this embodiment includes: a memory 610, a processor 620, a communication interface 630, and a bus 640. Among them, the memory 610, the processor 620, and the communication interface 630 are communicatively connected to each other through the bus 640.

[0188] The memory 610 can be a read only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM). The memory 610 can store a program. When the program stored in the memory 610 is executed by the processor 620, the processor 620 is used to execute each step / operation performed by the network device in any of the foregoing embodiments.

[0189] 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, and is used to execute relevant programs to implement the communication method shown in the method embodiment of the present application.

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

[0191] The aforementioned 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 devices, discrete gate or transistor logic devices, discrete hardware components. It can implement or execute the various methods, steps, and logic block diagrams disclosed in the embodiments of the present application. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.

[0192] The steps of the method disclosed in combination with the embodiments of the present application can be directly embodied as being executed and completed by a hardware decoding processor, or by a combination of hardware and software modules in the decoding processor. The software module may be located in a mature storage medium in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, or an electrically erasable programmable memory, a register, etc. This storage medium is located in the memory 610, and the processor 620 reads the information in the memory 610 and combines its hardware to complete the functions required to be executed by the units included in the communication device of the present application. For example, it can execute Figure 4 each of the steps / functions executed by the network device in

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

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

[0195] In some embodiments of the present application, a computer program product is also provided. When the computer program product runs on a processor, it can implement the methods shown in the foregoing embodiments. In some embodiments of the present application, a computer-readable storage medium is also provided. The computer-readable storage medium contains computer instructions. When the computer instructions run on a processor, they can implement the methods shown in the foregoing embodiments.

[0196] 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. For example: one or more application specific integrated circuits (ASICs), or, one or more digital signal processors (DSPs), or, one or more field programmable gate arrays (FPGAs), etc. Again, when a certain module above is implemented in the form of a processing element calling program code, the processing element may be a general-purpose processor, such as a central processing unit (CPU) or other processors that can call program code, such as a controller. Again, these modules may be integrated together and implemented in the form of a system-on-a-chip (SOC).

[0197] In the above embodiments, it may be implemented in whole or in part by software, hardware, firmware, software modules, or any combination thereof. When implemented using software, it may 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 processes or functions according to the embodiments of the present application are generated in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another. For example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wire (such as coaxial cable, optical fiber, digital subscriber line (DSL)) or wirelessly (such as infrared, wireless, microwave, etc.). The computer-readable storage medium may be any available medium that the computer can access or a data storage device such as a server or data center that includes one or more integrated available media. The available medium may be a magnetic medium (for example, a floppy disk, a hard disk, a magnetic tape), an optical medium (for example, a DVD), or a semiconductor medium (for example, a solid state disk (SSD)), etc.

[0198] As used herein, the term "a plurality of" means two or more. The term "and / or" in this article is merely a description of the relationship between associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist simultaneously, and B exists alone. In addition, the character " / " in this article generally represents an "or" relationship between the associated objects before and after; in a formula, the character " / " represents a "division" relationship between the associated objects before and after. 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 descriptions, and should not be understood as indicating or implying relative importance, nor as indicating or implying order.

[0199] It can be understood that in the embodiments of this application, the various numerical numbers involved are only for the convenience of description and do not limit the scope of the embodiments of this application.

[0200] It can be understood that in the embodiments of this application, the magnitudes of the sequence numbers of the above processes do not mean the sequence of execution. The execution sequence of each process should be determined by its function and internal logic, and should not constitute any limitation to the implementation process of the embodiments of this application.

Claims

1. A communication method, characterized in that, the method 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 a first subsequence, the first subsequence includes N elements, the N elements correspond to the N sub-blocks one by one, and each element in the N elements is used to indicate the serial number of the 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 a 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 in the first sequence that are less than N, and N is less than or equal to M, where M is the length of the first sequence; or, the first subsequence includes elements in a second subsequence that are less than N, and the second subsequence is a sequence formed by the difference between each element in the first sequence that is greater than or equal to N and N.

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

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

6. The method according to claim 2, characterized in that, the first subsequence includes elements in a fifth subsequence that are less than N, and the fifth subsequence is a sequence formed by the quotient of a plurality of elements included in the first sequence and 2, the plurality of elements correspond to a plurality of sub-blocks one by one, and each element in the plurality of elements is used to indicate the serial number of the corresponding sub-block in a second sequence to be interleaved, and the serial number of each sub-block in the interleaved sequence is odd or even, 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, wherein, the first subsequence satisfies a preset relationship, including: the (i + A)-th 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.

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

10. The method according to claim 1, wherein, the first subsequence satisfies a preset relationship, including: the (i + A)-th 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.

11. The method according to claim 10, wherein, the j-th element in the first subsequence is equal to T times the j-th element in the first sequence, 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, wherein, 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, wherein, 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 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}.

14. A communication device, characterized in that, it includes respective functional modules for implementing the method according to any one of claims 1 to 13.

15. A communication device, characterized in that, it includes: a processor, the processor is coupled with a memory, the memory is used for storing a computer program, when the processor calls the computer program, the device is enabled to execute the method according to any one of claims 1 to 13.

16. A computer program product, characterized in that, it includes computer program code, when the computer program code runs on a computer, the computer is enabled 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 program code for a computer to execute, and the program code includes instructions for executing the method according to any one of claims 1 to 13.

Images