Communication method and device

Abstract

The invention discloses a communication method and device, relates to the technical field of communication, and can simultaneously map a part of information bits into each sent sequence to improve the decoding performance. In the method, K first bits are determined according to a reliability sequence with the length of N1, and K second bits are determined according to a reliability sequence with the length of N2; dividing bits of a first sequence with the length of (N2-N1) into X groups of bits, and dividing A first bits into X groups of first bits; the X groups of bits comprise A second bits, the number of the first bits included in the xth group of first bits is the same as the number of the second bits included in the xth group of bits, and x = 1, 2,..., X; and according to an information bit sequence with the length of K, mapping information bits corresponding to the xth group of first bits to second bits of the xth group of bits of the first sequence to obtain a second sequence, performing polarization coding to obtain a coded bit sequence, and sending one or more bits in the coded bit sequence to a receiving end device.

Description

Communication method and device Technical Field

[0001] The embodiments of the present application relate to the field of communication technologies, and in particular, to a communication method and apparatus. Background Art

[0002] In communication systems, to reduce coding complexity, a coding scheme using polar codes has been proposed. Before using polar codes for encoding, the information bits of the sequence to be encoded need to be mapped to corresponding bits.

[0003] When constructing Polar codes for hybrid automatic repeat request (HARQ) transmission, a portion of the information bits of the sequence to be encoded can be mapped simultaneously to both the initial transmission sequence and the retransmission sequence. This allows for better decoding performance, whether decoding the initial transmission sequence alone or jointly decoding the initial and retransmission sequences. Alternatively, when constructing Polar codes that support self-decoding, a portion of the information bits of the sequence to be encoded can be simultaneously mapped to multiple redundancy versions. This allows for better decoding performance when decoding each redundancy version independently.

[0004] Based on the above description of Polar codes used for HARQ transmission and Polar codes supporting self-decoding, both encoding and decoding rely on mapping a portion of information bits simultaneously into each transmitted sequence. Therefore, how to map information bits to reduce decoding complexity and improve decoding performance has become a pressing technical challenge.

[0005] Summary of the Invention

[0006] The embodiments of the present application provide a communication method and apparatus that can simultaneously map a portion of information bits into each transmitted sequence, thereby reducing decoding complexity and improving decoding performance.

[0007] In the first aspect, an embodiment of the present application provides a communication method, which can be executed by a sending device, or by a component of the sending device (such as a processor, chip, or chip system, etc.), or by a logic module or software that can realize all or part of the functions of the sending device. The method includes: determining K first bits according to a reliability sequence with a length of N1, and determining K second bits according to a reliability sequence with a length of N2, where K≤N1<N2; dividing the bits of the first sequence with a length of (N2-N1) into X groups of bits, and dividing A first bits of the K first bits into X groups of first bits, wherein the X groups of bits include A second bits of the K second bits, the number of first bits included in the xth group of first bits is the same as the number of second bits included in the xth group of bits, and X≥2, x=1, 2, ..., X; mapping, according to an information bit sequence with a length of K, information bits corresponding to the xth group of first bits to second bits in the xth group of bits of the first sequence to obtain a second sequence; performing polarization coding on the second sequence to obtain a coded bit sequence; and transmitting one or more bits in the coded bit sequence to a receiving device.

[0008] Based on the first aspect, a portion of the information bits (such as A information bits) of an information bit sequence of length K can be simultaneously mapped to A first bit positions and A second bit positions, that is, there is a corresponding check relationship between the A first bit positions and the A second bit positions, which can reduce the decoding complexity and improve the decoding performance. At the same time, when performing bit mapping, the present application can also perform hierarchical mapping, that is, the A first bit positions can be divided into X groups of first bits, and the bits of the first sequence can be divided into X groups of bits. In this way, the transmitting end device can map the information bit corresponding to the first bit position of the xth group to the second bit position in the xth group of bits of the first sequence, thereby realizing hierarchical mapping. At the same time, there is a corresponding check relationship between the first bit position of the xth group and the second bit position in the xth group of bits, which can reduce the decoding complexity, balance the performance of a small amount of retransmission and a large amount of retransmission, and improve the decoding performance.

[0009] In one possible design, according to a first interleaving pattern, the information bits corresponding to the first bit positions of the x-th group are interleaved and mapped to the second bit positions in the x-th group of bits.

[0010] Based on this possible design, information bits can be interleaved and mapped based on the first interleaving pattern to reduce decoding complexity and improve decoding performance.

[0011] In one possible design, according to the first interleaving pattern, the information bits corresponding to the first bits in the xth group of first bits, which are numbered in ascending order, are interleaved and mapped onto the second bits in the xth group of bits, which are numbered in descending order.

[0012] Based on this possible design, a reverse mapping relationship can be used to interleave and map the information bits corresponding to the first bit of the xth group to the second bit of the xth group, so that the sending device only needs to push the data in sequence without pre-storing the specific mapping relationship, which can greatly simplify the implementation and reduce the implementation complexity.

[0013] In one possible design, the information bit sequence is mapped to the K first bits of a third sequence of length N1 to obtain a fourth sequence; and the information bit corresponding to the first bit of the xth group is determined based on the information bits corresponding to A first bits among the K first bits.

[0014] Based on this possible design, a feasible solution is provided for determining the information bits corresponding to the A first bits.

[0015] In one possible design, the second sequence and the fourth sequence are XORed to obtain an XORed sequence; and polarization coding is performed on the XORed sequence to obtain a coded bit sequence.

[0016] In one possible design, polarization coding is performed on the second sequence to obtain a first polarization sequence; polarization coding is performed on the fourth sequence to obtain a second polarization sequence; and an exclusive-OR process is performed on the first polarization sequence and the second polarization sequence to obtain a coded bit sequence.

[0017] Based on the above two possible designs, multiple feasible solutions are provided for performing polarization coding on the second sequence.

[0018] In a second aspect, an embodiment of the present application provides a communication method, which can be executed by a receiving device, or by a component of the receiving device (such as a processor, chip, or chip system, etc.), or by a logic module or software that can implement all or part of the functions of the receiving device. The method includes: receiving a symbol sequence from a transmitting device; wherein the length of the information bit sequence corresponding to the symbol sequence is K; determining K first bits according to a reliability sequence of length N1, and determining K second bits according to a reliability sequence of length N2; K≤N1<N2; dividing the bits of the first sequence of length (N2-N1) into X groups of bits, and dividing A first bits of the K first bits into X groups of first bits; wherein the X groups of bits include A second bits of the K second bits, the number of first bits included in the xth group of first bits is the same as the number of second bits included in the xth group of bits, X≥2, x=1, 2, ..., X; decoding the symbol sequence according to the second bits in the X groups of bits and the X groups of first bits.

[0019] Based on the second aspect, since the transmitting device simultaneously maps a portion of the information bits (e.g., A information bits) of the information bit sequence of length K to the first bit of the X groups and the second bit of the X groups of bits when encoding the information bit sequence, that is, a corresponding check relationship exists between the first bit of the X groups and the second bit of the X groups of bits. When decoding the symbol sequence, the receiving device can use the same method as the transmitting device to determine the first bit of the X groups and the second bit of the X groups of bits, and then perform decoding based on the check relationship between the first bit of the X groups and the second bit of the X groups of bits. This can reduce decoding complexity and improve decoding performance.

[0020] On the third aspect, an embodiment of the present application provides a communication method, which can be executed by a transmitting device, or by a component of the transmitting device (such as a processor, a chip, or a chip system, etc.), and can also be implemented by a logic module or software that can realize all or part of the functions of the transmitting device. The method includes: determining K first bits according to a reliability sequence of length N1, and determining K second bits according to a reliability sequence of length N2; K≤N1<N2; dividing the bits of the first sequence of length (N2-N1) into X groups of bits; dividing A first bits of the K first bits into X groups of first bits; wherein the X groups of bits include A second bits of the K second bits, the number of first bits included in the xth group of first bits is the same as the number of second bits included in the xth group of bits, and X≥2, x=1, 2, ..., X; according to an information bit sequence of length K, map the information bit corresponding to the first bit of the x-th group to the third bit of the x-th group in a fifth sequence of length N2, map a copy of the information bit corresponding to the first bit of the x-th group to the second bit of the x-th group of bits in the fifth sequence to obtain a sixth sequence, perform polarization coding on the sixth sequence to obtain a coded bit sequence, and send one or more bits of the coded bit sequence to a receiving device; wherein the third bit of the x-th group corresponds to the first bit of the x-th group.

[0021] Based on the third aspect, a portion of the information bits (such as A information bits) of an information bit sequence of length K can be simultaneously mapped to A second bit positions and A third bit positions, that is, there is a corresponding check relationship between the A second bit positions and the A third bit positions of the sixth sequence, which can reduce the decoding complexity and improve the decoding performance. At the same time, when performing bit mapping, the present application can also perform hierarchical mapping, that is, the A first bit positions can be divided into X groups of first bit positions, the bits of the first sequence can be divided into X groups of bits, and the A third bit positions can be divided into X groups of third bits. In this way, the transmitting end device can map the information bit corresponding to the first bit position of the xth group to the third bit position of the xth group of the fifth sequence, and map the copy bit of the information bit corresponding to the first bit position of the xth group to the second bit position of the xth group of bits of the fifth sequence, thereby realizing hierarchical mapping. At the same time, there is a corresponding check relationship between the third bit position of the xth group and the second bit position in the xth group of bits, which can reduce the decoding complexity and improve the decoding performance.

[0022] In one possible design, according to the second interleaving pattern, the information bit corresponding to the first bit position of the xth group is interleaved and mapped to the third bit position of the xth group in the fifth sequence, and the copy bit of the information bit corresponding to the first bit position of the xth group is interleaved and mapped to the second bit position in the xth group of bits in the fifth sequence.

[0023] Based on this possible design, information bits can be interleaved and mapped based on the second interleaving pattern to reduce decoding complexity and improve decoding performance.

[0024] In one possible design, the information bit sequence is mapped to the K first bits of a third sequence of length N1 to obtain a fourth sequence; and the information bit corresponding to the first bit of the xth group is determined based on the information bits corresponding to A first bits among the K first bits.

[0025] Based on this possible design, a feasible solution is provided for determining the information bits corresponding to the A first bits.

[0026] In one possible design, KA information bits in the information bit sequence, excluding the A information bits corresponding to the X groups of first bits, are mapped to KA second bits excluding the A second bits among the K second bits of the fifth sequence.

[0027] Fourthly, an embodiment of the present application provides a communication method, which can be executed by a receiving device, or by a component of the receiving device (such as a processor, chip, or chip system, etc.), or by a logic module or software that can realize all or part of the functions of the receiving device. The method includes: receiving a symbol sequence from a transmitting end device; wherein the length of an information bit sequence corresponding to the symbol sequence is K; determining K first bits according to a reliability sequence having a length of N1, and determining K second bits according to a reliability sequence having a length of N2; K≤N1<N2; dividing the bits of the first sequence having a length of (N2-N1) into X groups of bits; dividing A first bits among the K first bits into X groups of first bits; wherein the X groups of bits include A second bits among the K second bits, the number of first bits included in the xth group of first bits is the same as the number of second bits included in the xth group of bits, and X≥2, x=1, 2, ..., X; decoding the symbol sequence according to the second bits in the X groups of bits and the X groups of third bits; wherein the xth group of third bits corresponds to the xth group of first bits, and X≥2, x=1, 2, ..., X.

[0028] Based on the fourth aspect, since the transmitting device copies A information bits in the information bit sequence when encoding the information bit sequence, and maps the A information bits and the A copied bits to the third bit of the X groups and the second bit of the X groups of bits, that is, a corresponding check relationship exists between the third bit of the X groups and the second bit of the X groups of bits. When decoding the symbol sequence, the receiving device can use the same method as the transmitting device to determine the second bit of the X groups of bits and the third bit of the X groups, and then perform decoding based on the check relationship between the third bit of the X groups and the second bit of the X groups of bits. This can reduce decoding complexity and improve decoding performance.

[0029] Based on the above first to fourth aspects, in one possible design, A first bits are determined based on K first bits and K second bits.

[0030] Based on the above-mentioned first to fourth aspects, in a possible design, K third bits are determined based on the K first bits; wherein, the third bit corresponding to the first bit numbered i is numbered i+N2-N1, 0≤i≤N1-1; based on the A third bits, A first bits are determined; wherein, the first bit corresponding to the third bit numbered j is numbered j-(N2-N1), N2-N1≤j≤N2-1; the A third bits are bits in the K third bits that are numbered differently from the K second bits.

[0031] Based on the above first to fourth aspects, in a possible design, the A first bits are the last A bits of the K first bits sorted from high to low in terms of reliability.

[0032] Based on the above three possible designs, multiple feasible solutions are provided for determining the A first bits.

[0033] Based on the above-mentioned first to fourth aspects, in one possible design, A second bits are determined based on K first bits and K second bits.

[0034] Based on the above-mentioned first to fourth aspects, in one possible design, K third bits are determined based on the K first bits; wherein the third bit corresponding to the first bit numbered i is numbered i+N2-N1, 0≤i≤N1-1; based on the K third bits, A second bits are determined; wherein the A second bits are bits in the K second bits that have different numbers from the K third bits.

[0035] Based on the above-mentioned first to fourth aspects, in one possible design, the A second bits are the A bits numbered less than N2-N1 among the K second bits.

[0036] Based on the above three possible designs, multiple feasible solutions are provided for determining A second bits.

[0037] Based on the first to fourth aspects above, in one possible design, A first bits are divided into X groups of first bits according to their reliability; wherein the reliability of the first bits in the x+1th group is higher than the reliability of the first bits in the xth group.

[0038] Based on this possible design, a feasible solution is provided for grouping the first bit.

[0039] Based on the first to fourth aspects above, in one possible design, sub-block interleaving is performed on the first sequence according to a third interleaving pattern, and the bits of the interleaved first sequence are divided into X groups of bits; wherein the xth group of bits includes Yx sub-blocks, and Yx is a positive integer.

[0040] Based on this possible design, the transmitting device can divide the first sequence into X groups of bits, or after interleaving the first sequence (such as sub-block interleaving), divide the bits of the interleaved first sequence into X groups of bits to reduce decoding complexity and improve decoding performance.

[0041] Based on the foregoing first to fourth aspects, in one possible design, the third interleaving pattern is any of the following sub-block interleaving patterns: [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]; or, [0 4 8 12 1 5 9 13 2 6 10 14 3 7 11 15 16 20 24 28 17 21 25 29 18 22 26 30 19 23 27 31]; or, [0 8 16 24 1 9 17 25 2 10 18 26 3 11 19 27 4 12 20 28 5 13 21 29 6 14 22 30 7 15 23 31].

[0042] Based on the possible design, multiple possible designs are provided for the third interleaving pattern.

[0043] Based on the above-mentioned first to fourth aspects, in one possible design, the bits of the first sequence are divided into X groups of bits according to preset configuration information; or, the bits of the first sequence are divided into X groups of bits according to retransmission resources.

[0044] Based on this possible design, the transmitting device can group according to preset configuration information or according to retransmission resources, balancing the performance of small and large retransmissions and reducing decoding complexity.

[0045] Based on the foregoing first to fourth aspects, in a possible design, among the X groups of bits, there is at least one group of bits whose length is an integer power of 2.

[0046] Based on the foregoing first to fourth aspects, in a possible design, a length of a first group of bits in the X groups of bits is an integer power of 2.

[0047] Based on the first to fourth aspects above, in one possible design, the length from the first group of bits to the x'th group of bits in the X groups of bits is an integer power of 2, 2≤x'≤X.

[0048] Based on the above three possible designs, when the transmitting device divides the first sequence into X groups of bits, it can be ensured that there is at least one group of bits whose length satisfies an integer power of 2, thereby reducing decoding complexity and improving decoding performance.

[0049] Based on the above first to fourth aspects, in one possible design, X is equal to 2, the first group of bits in the X groups of bits includes (N2-N1) / 8 bits of the first sequence, and the second group of bits includes 7(N2-N1) / 8 bits of the first sequence.

[0050] Based on this possible design, the last (N2-N1) / 8 bits can be grouped into one group, and the remaining 7(N2-N1) / 8 bits can be grouped into another group to minimize the chip area.

[0051] Based on the first to fourth aspects above, in one possible design, X is equal to 3, the first group of bits in the X groups of bits includes (N2-N1) / 8 bits of the first sequence, the second group of bits includes (N2-N1) / 8 bits of the first sequence, and the third group of bits includes 3(N2-N1) / 4 bits of the first sequence.

[0052] Based on this possible design, the last (N2-N1) / 8 bits can be grouped together, the next (N2-N1) / 8 bits can be grouped together, and the remaining 3 (N2-N1) / 4 bits can be grouped together. Compared to the previous possible design, although the chip area may increase, decoding performance can be further improved.

[0053] Based on the above first to fourth aspects, in one possible design, X is equal to 4, the first group of bits in the X groups of bits includes (N2-N1) / 8 bits of the first sequence, the second group of bits includes (N2-N1) / 8 bits of the first sequence, the third group of bits includes (N2-N1) / 4 bits of the first sequence, and the fourth group of bits includes (N2-N1) / 2 bits of the first sequence.

[0054] Based on this possible design, the last (N2-N1) / 8 bits can be grouped together, followed by (N2-N1) / 8 bits, followed by (N2-N1) / 4 bits, and the remaining (N2-N1) / 2 bits. Compared to the first two possible designs, this achieves a balance between chip area and decoding performance.

[0055] Based on the above first to fourth aspects, in one possible design, X is equal to 2, the first group of bits in the X groups of bits includes (N2-N1) / 4 bits of the first sequence, and the second group of bits includes 3(N2-N1) / 4 bits of the first sequence.

[0056] Based on this possible design, the last (N2-N1) / 4 bits can be grouped together, and the remaining 3 (N2-N1) / 4 bits can be grouped together. Compared to the previous three possible designs, this prioritizes better performance during retransmission of the (N2-N1) / 4 bits, while balancing chip area and decoding performance.

[0057] In a fifth aspect, an embodiment of the present application provides a communication method, which can be executed by a transmitting device, or by a component of the transmitting device (such as a processor, chip, or chip system), or by a logic module or software that can implement all or part of the functions of the transmitting device. The method includes: dividing the bits of a seventh sequence of length N into X groups of bits, and dividing A information bits in an information bit sequence of length K into X groups of information bits; wherein the number of information bits included in the xth group of bits is equal to the number of information bits included in the xth group of information bits; x = 1, 2, ..., X; X ≥ 2; interleaving and mapping the xth group of information bits onto the information bits in the xth group of bits of the seventh sequence according to an interleaving pattern to obtain an eighth sequence; performing polarization coding on the eighth sequence to obtain a coded bit sequence, and sending one or more bits of the coded bit sequence to the receiving device.

[0058] Based on the fifth aspect, the transmitting device can group the information bit sequence when encoding it, and then perform interleaving processing according to the interleaving pattern to reduce decoding complexity and improve decoding performance.

[0059] In a sixth aspect, embodiments of the present application provide a communication method, which can be executed by a receiving device, or by a component of the receiving device (e.g., a processor, chip, or chip system), or by a logic module or software capable of implementing all or part of the functions of the receiving device. The method comprises: receiving a symbol sequence from a transmitting device; dividing the bits of a seventh sequence of length N into X groups of bits, where X ≥ 2; and decoding the symbol sequence based on the information bits in the X groups of bits.

[0060] Based on the sixth aspect, since the transmitting device groups the A information bits in the information bit sequence when encoding the information bit sequence and interleaves and maps them to the information bits in the X groups of bits according to the interleaving pattern, the receiving device can use the same method as the transmitting device to determine the information bits in the X groups of bits when decoding the symbol sequence, and then decode the symbol sequence based on the interleaving pattern and the information bits in the X groups of bits, thereby reducing decoding complexity and improving decoding performance.

[0061] In one possible design, sub-block interleaving is performed on the seventh sequence, and the bits of the interleaved seventh sequence are divided into X groups of bits.

[0062] In one possible design, the interleaving pattern is one or more of the following: a random interleaving pattern, a triangular interleaving pattern, a row-column interleaving pattern, or a reverse interleaving pattern.

[0063] In the seventh aspect, an embodiment of the present application provides a communication device, which can be applied to the transmitting end device of the first aspect, the third aspect, or the fifth aspect above to implement the functions performed by the transmitting end device above. The communication device can be a transmitting end device, or it can be a chip or chip system or system on chip of the transmitting end device, etc. The communication device can perform the functions performed by the transmitting end device above through hardware, or it can perform the corresponding software implementation through hardware. The hardware or software includes one or more modules corresponding to the above functions. For example, a transceiver module and a processing module. The transceiver module can independently complete the following transceiver operations, or it can cooperate with the processing module to complete the following transceiver operations; accordingly, the processing module can also independently complete the following processing operations, or it can cooperate with the transceiver module to complete the following processing operations, without limitation.

[0064] Exemplarily, a processing module is configured to determine K first bits based on a reliability sequence having a length of N1, and to determine K second bits based on a reliability sequence having a length of N2; K≤N1<N2; the processing module is further configured to divide the bits of the first sequence having a length of (N2-N1) into X groups of bits, and to divide A first bits of the K first bits into X groups of first bits; wherein the X groups of bits include A second bits of the K second bits, the number of first bits included in the x-th group of first bits is the same as the number of second bits included in the x-th group of bits, and X≥2, x=1, 2, ..., X; the processing module is further configured to map, based on an information bit sequence having a length of K, the information bit corresponding to the x-th group of first bits to the second bit in the x-th group of bits of the first sequence, to obtain a second sequence; and perform polarization coding on the second sequence to obtain a coded bit sequence; and the transceiver module is configured to send one or more bits in the coded bit sequence to a receiving device.

[0065] In another example, the processing module is configured to determine K first bits according to a reliability sequence having a length of N1, and to determine K second bits according to a reliability sequence having a length of N2; K≤N1<N2; the processing module is further configured to divide the bits of the first sequence having a length of (N2-N1) into X groups of bits; and to divide A first bits of the K first bits into X groups of first bits; wherein the X groups of bits include A second bits of the K second bits, the number of first bits included in the xth group of first bits is the same as the number of second bits included in the xth group of bits, and X≥2 , x=1, 2, ..., X; the processing module is further used to map, according to the information bit sequence of length K, the information bit corresponding to the first bit of the x-th group to the third bit of the x-th group in a fifth sequence of length N2, map the copy of the information bit corresponding to the first bit of the x-th group to the second bit of the x-th group of bits in the fifth sequence, to obtain a sixth sequence, and perform polarization coding on the sixth sequence to obtain a coded bit sequence; the transceiver module is used to send one or more bits in the coded bit sequence to a receiving device, wherein the third bit of the x-th group corresponds to the first bit of the x-th group.

[0066] In another example, a processing module is configured to divide bits of a seventh sequence of length N into X groups of bits, and to divide A information bits in an information bit sequence of length K into X groups of information bits; wherein the number of information bits included in the x-th group of bits is equal to the number of information bits included in the x-th group of information bits; x=1, 2, ..., X; and X≥2; the processing module is further configured to interleave and map the x-th group of information bits onto information bits in the x-th group of bits of the seventh sequence according to an interleaving pattern to obtain an eighth sequence; perform polarization coding on the eighth sequence to obtain a coded bit sequence, and transmit one or more bits of the coded bit sequence to a receiving device.

[0067] Optionally, the transceiver module and the processing module of the communication device in the seventh aspect can also perform the corresponding functions in the above-mentioned first aspect or any possible design of the first aspect, or perform the corresponding functions in the above-mentioned third aspect or any possible design of the third aspect, or perform the above-mentioned fifth aspect or any possible design of the fifth aspect. Please refer to the detailed description in the method example for details, and the beneficial effects that can be achieved can also be found in the above-mentioned related content.

[0068] In the eighth aspect, an embodiment of the present application provides a communication device, which can be applied to the receiving end device of the second aspect, fourth aspect, or sixth aspect above to implement the functions performed by the receiving end device above. The communication device can be a receiving end device, or it can be a chip or chip system or system on chip of the receiving end device, etc. The communication device can perform the functions performed by the receiving end device above through hardware, or it can perform the corresponding software implementation through hardware. The hardware or software includes one or more modules corresponding to the above functions. For example, a transceiver module and a processing module. The transceiver module can independently complete the following transceiver operations, or it can cooperate with the processing module to complete the following transceiver operations; accordingly, the processing module can also independently complete the following processing operations, or it can cooperate with the transceiver module to complete the following processing operations, without limitation.

[0069] Exemplarily, a transceiver module is used to receive a symbol sequence from a transmitting device; wherein the length of the information bit sequence corresponding to the symbol sequence is K; the processing module is used to determine K first bits based on a reliability sequence with a length of N1, and determine K second bits based on a reliability sequence with a length of N2; K≤N1<N2; the processing module is further used to divide the bits of the first sequence with a length of (N2-N1) into X groups of bits, and divide A first bits of the K first bits into X groups of first bits; wherein the X groups of bits include A second bits of the K second bits, the number of first bits included in the xth group of first bits is the same as the number of second bits included in the xth group of bits, and X≥2, x=1, 2, ..., X; the processing module is further used to decode the symbol sequence based on the second bits in the X groups of bits and the X groups of first bits.

[0070] In another example, a transceiver module is used to receive a symbol sequence from a transmitting device; wherein the length of the information bit sequence corresponding to the symbol sequence is K; the processing module is used to determine K first bits based on a reliability sequence of length N1, and determine K second bits based on a reliability sequence of length N2, where K≤N1<N2; the processing module is further used to divide the bits of the first sequence of length (N2-N1) into X groups of bits; and divide A first bits of the K first bits into X groups of first bits; wherein the X groups of bits include A second bits of the K second bits, the number of first bits included in the xth group of first bits is the same as the number of second bits included in the xth group of bits, and X≥2, x=1, 2, ..., X; the processing module is further used to decode the symbol sequence based on the second bits in the X groups of bits and the X groups of third bits; wherein the xth group of third bits corresponds to the xth group of first bits, and X≥2, x=1, 2, ..., X.

[0071] In another example, the transceiver module is further used to receive a symbol sequence from a transmitting device; the processing module is used to divide the bits of the seventh sequence of length N into X groups of bits, where X ≥ 2; and the processing module is further used to decode the symbol sequence based on the information bits in the X groups of bits.

[0072] Optionally, the transceiver module and the processing module of the communication device in the eighth aspect can also perform the corresponding functions in the above-mentioned second aspect or any possible design of the second aspect, or perform the above-mentioned fourth aspect or any possible design of the fourth aspect, or perform the above-mentioned sixth aspect or any possible design of the sixth aspect. Please refer to the detailed description in the method example for details, and the beneficial effects that can be achieved can also be found in the above-mentioned related content.

[0073] In the ninth aspect, an embodiment of the present application provides a communication device, which includes one or more processors; one or more processors are used to run computer programs or instructions. When the one or more processors execute the computer instructions or instructions, the communication method described in the first aspect or any possible design of the first aspect is executed, or the communication method described in the second aspect or any possible design of the second aspect is executed, or the communication method described in the third aspect or any possible design of the third aspect is executed, or the communication method described in the fourth aspect or any possible design of the fourth aspect is executed, or the communication method described in the fifth aspect or any possible design of the fifth aspect is executed, or the communication method described in the sixth aspect or any possible design of the sixth aspect is executed.

[0074] In one possible design, the communication device further includes one or more memories, the one or more memories being coupled to one or more processors, and the one or more memories being used to store the above-mentioned computer programs or instructions. In one possible implementation, the memory is located outside the communication device. In another possible implementation, the memory is located within the communication device. In an embodiment of the present application, the processor and the memory may also be integrated into one device, that is, the processor and the memory may also be integrated together. In one possible implementation, the communication device further includes a transceiver, and the transceiver is used to receive information and / or send information.

[0075] In one possible design, the communication device further includes one or more communication interfaces, the one or more communication interfaces are coupled to the one or more processors, and the one or more communication interfaces are used to communicate with other modules outside the communication device.

[0076] In the tenth aspect, an embodiment of the present application provides a communication device, which includes an interface circuit and a logic circuit; the interface circuit is used to input and / or output information; the logic circuit is used to execute the communication method described in the first aspect or any possible design of the first aspect, or execute the communication method described in the second aspect or any possible design of the second aspect, or execute the communication method described in the third aspect or any possible design of the third aspect, or execute the communication method described in the fourth aspect or any possible design of the fourth aspect, or execute the communication method described in the fifth aspect or any possible design of the fifth aspect, or execute the communication method described in the sixth aspect or any possible design of the sixth aspect, and process and / or generate information according to the information.

[0077] In the eleventh aspect, an embodiment of the present application provides a computer-readable storage medium, which stores computer instructions or programs. When the computer instructions or programs are run on a computer, the communication method described in the first aspect or any possible design of the first aspect is executed, or the communication method described in the second aspect or any possible design of the second aspect is executed, or the communication method described in the third aspect or any possible design of the third aspect is executed, or the communication method described in the fourth aspect or any possible design of the fourth aspect is executed, or the communication method described in the fifth aspect or any possible design of the fifth aspect is executed, or the communication method described in the sixth aspect or any possible design of the sixth aspect is executed.

[0078] In aspect 12, an embodiment of the present application provides a computer program product comprising computer instructions, which, when run on a computer, enables the communication method described in the first aspect or any possible design of the first aspect to be executed, or enables the communication method described in the second aspect or any possible design of the second aspect to be executed, or enables the communication method described in the third aspect or any possible design of the third aspect to be executed, or enables the communication method described in the fourth aspect or any possible design of the fourth aspect to be executed, or enables the communication method described in the fifth aspect or any possible design of the fifth aspect to be executed, or enables the communication method described in the sixth aspect or any possible design of the sixth aspect to be executed.

[0079] In aspect 13, an embodiment of the present application provides a computer program, which, when running on a computer, enables the communication method described in the first aspect or any possible design of the first aspect to be executed, or enables the communication method described in the second aspect or any possible design of the second aspect to be executed, or enables the communication method described in the third aspect or any possible design of the third aspect to be executed, or enables the communication method described in the fourth aspect or any possible design of the fourth aspect to be executed, or enables the communication method described in the fifth aspect or any possible design of the fifth aspect to be executed, or enables the communication method described in the sixth aspect or any possible design of the sixth aspect to be executed.

[0080] In the fourteenth aspect, an embodiment of the present application provides a chip, comprising: a processor, the processor being coupled to a memory, the memory being used to store programs or instructions, and when the program or instructions are executed by the processor, the communication method as described in the first aspect or any possible design of the first aspect is executed, or the communication method as described in the second aspect or any possible design of the second aspect is executed, or the communication method as described in the third aspect or any possible design of the third aspect is executed, or the communication method as described in the fourth aspect or any possible design of the fourth aspect is executed, or the communication method as described in the fifth aspect or any possible design of the fifth aspect is executed, or the communication method as described in the sixth aspect or any possible design of the sixth aspect is executed.

[0081] Among them, the technical effects brought about by any design method in aspects 9 to 14 can refer to the technical effects brought about by the above-mentioned first aspect or any possible design in the first aspect, or refer to the technical effects brought about by the above-mentioned second aspect or any possible design in the second aspect, or refer to the technical effects brought about by the above-mentioned third aspect or any possible design in the third aspect, or refer to the technical effects brought about by the above-mentioned fourth aspect or any possible design in the fourth aspect, or refer to the technical effects brought about by the above-mentioned fifth aspect or any possible design in the fifth aspect, or refer to the technical effects brought about by the above-mentioned sixth aspect or any possible design in the sixth aspect, and no further details will be given.

[0082] In aspect fifteen, an embodiment of the present application provides a communication system, which may include a communication device for executing the first aspect or any possible design of the first aspect and a communication device for executing the second aspect or any possible design of the second aspect, or include the communication device as described in the third aspect or any possible design of the third aspect and a communication device for executing the fourth aspect or any possible design of the fourth aspect, or include the communication device as described in the fifth aspect or any possible design of the fifth aspect and a communication device for executing the sixth aspect or any possible design of the sixth aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0083] FIG1 is a schematic diagram of a Polar code provided in an embodiment of the present application;

[0084] FIG2 is a schematic diagram of a Polar code for HARQ transmission provided in an embodiment of the present application;

[0085] FIG3 is a schematic diagram of a Polar code supporting self-decoding provided in an embodiment of the present application;

[0086] FIG4 is a schematic diagram of a Polar code for HARQ transmission provided in an embodiment of the present application;

[0087] FIG5 is a schematic diagram of a communication system provided in an embodiment of the present application;

[0088] FIG6 is a schematic diagram of encoding and decoding performed by a transmitting device and a receiving device according to an embodiment of the present application;

[0089] FIG7 is a schematic diagram of a communication device provided in an embodiment of the present application;

[0090] FIG8 is a flow chart of a communication method provided in an embodiment of the present application;

[0091] FIG9 is a schematic diagram of a Polar code for HARQ transmission provided in an embodiment of the present application;

[0092] FIG10 is a flow chart of a communication method provided in an embodiment of the present application;

[0093] FIG11 is a schematic diagram of a Polar code supporting self-decoding provided in an embodiment of the present application;

[0094] FIG12 is a flow chart of a communication method provided in an embodiment of the present application;

[0095] FIG13 is a schematic diagram of a transmitting end device provided in an embodiment of the present application;

[0096] FIG14 is a schematic diagram of a receiving device provided in an embodiment of the present application;

[0097] FIG15 is a schematic diagram of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0098] Before describing the embodiments of the present application, the technical terms involved in the embodiments of the present application are described.

[0099] Polar codes are the first channel coding scheme rigorously proven to achieve Shannon channel capacity. They offer excellent error correction performance and low decoding complexity. They have been selected by the Third Generation Partnership Project (3GPP) as the coding scheme for the uplink and downlink control channels of enhanced mobile broadband (eMBB) scenarios in fifth-generation (5G) mobile communication systems.

[0100] In the Polar code encoding scheme, bits can be divided into fixed bits (or frozen bits) and information bits based on their reliability. Bits with lower reliability are fixed bits and can be used to carry fixed bits (or frozen bits). These fixed bits are typically set to 0 and are known to both the sender and receiver during actual transmission. Bits with higher reliability are information bits and can be used to carry information bits (data) during actual transmission.

[0101] For example, as shown in Figure 1, a typical 8×8 Polar code encoding diagram is provided, in which bits with higher reliability (such as u7, u6, u5, u3) can be set as information bits, carrying information bits 0 or 1; bits with lower reliability (such as u4, u2, u1, u0) can be set as fixed bits, carrying fixed bit 0.

[0102] Polar code decoding: With the inclusion of Polar codes in the 5G standard, research on Polar code decoding has become a hot topic in communications. Mainstream Polar code decoding methods can be categorized into two types based on their decoding timing: sequential decoding and non-sequential decoding. Sequential decoding involves decoding the code bit by bit based on the inherent sequential nature of the Polar code design; non-sequential decoding involves decoding the code bit by bit based on other Polar code structures (such as the Tanner graph and trellis graph) and outputting the decoding results in parallel.

[0103] For sequential decoding, the main Polar code decoding algorithms include successive cancellation (SC) decoding, successive cancellation list (SCL) decoding, successive cancellation stack (SCS) decoding, and cyclic redundancy check (CRC)-aided successive cancellation list (CA-SCL) decoding. For non-sequential decoding, the main Polar code non-sequential decoding algorithms include belief propagation (BP) decoding.

[0104] Among the above decoding algorithms, SC decoding has the worst decoding performance, while SCL decoding significantly improves its performance. Adding CA-SCL decoding after CRC check can make the performance of Polar codes better than low-density parity-check codes (LDPC) and Turbo codes. Therefore, SCL decoding and CA-SCL decoding are primarily used in communication systems.

[0105] Based on the above description of Polar codes, information bits must be placed in corresponding information bit positions before Polar code encoding. When constructing Polar codes for hybrid automatic repeat request (HARQ) transmission or for constructing Polar codes that support self-decoding, the bit mapping process can be specially designed to reduce decoding complexity and improve decoding performance.

[0106] The following describes in detail the Polar codes used for HARQ transmission and the Polar codes that support self-decoding:

[0107] HARQ transmission is a common technology in wireless communications. HARQ transmission can combine forward error correction (FEC) codes with automatic repeat request (ARQ) methods. The specific process may include the following steps:

[0108] Step 1: The sending device sends a coded bit sequence with a higher code rate as the initial transmission.

[0109] Step 2: The receiving device receives the symbol sequence and attempts to decode it.

[0110] If the receiving device decodes successfully, the receiving device may feed back an acknowledgment frame (ACK) to the sending device, and the sending device may stop sending based on the acknowledgment frame.

[0111] If the receiving device fails to decode, it can buffer the received symbol sequence and send a negative acknowledgement (NACK) frame back to the sending device. Alternatively, it can omit the negative acknowledgement frame. If the sending device receives a negative acknowledgement frame or does not receive an acknowledgment frame within a certain period of time, it can continue to send the coded bit sequence as incremental redundancy (IR). The receiving device can decode the two received sequences together.

[0112] In the aforementioned HARQ transmission, compared to sending a sequence in at least two separate transmissions all at once, HARQ transmission allows for pausing transmission if decoding is successful, improving system throughput. Specifically, if the initial transmission is successful, retransmission is unnecessary, saving spectrum resources and improving spectrum efficiency. If the initial transmission is unsuccessful, the receiving device can decode both received sequences simultaneously, still achieving the error correction performance of long codes.

[0113] Exemplarily, as shown in FIG2 , an IR-HARQ framework based on Polar code is provided, which may include an initial transmission sequence (or also referred to as a U code) of length 8 and a retransmission sequence (or also referred to as a V code) of length 8. The initial transmission sequence and the retransmission sequence can be combined to form a coded bit sequence of length 16. In the initial transmission sequence, the bits filled with Figure 1 and Figure 2 are information bits. In the retransmission sequence, the bits filled with Figure 3 are information bits. There is a corresponding check relationship between the bits filled with Figure 3 and the bits filled with Figure 1, that is, the bits filled with Figure 3 and the bits filled with Figure 1 to which they are mapped are placed with the same information bits.

[0114] Based on the Polar code described in Figure 2, the receiving device can decode the initial transmission sequence alone. The bits filled with patterns 1 and 2 are information bits. If decoding is successful, the transmitting device does not need to continue sending the coded bit sequence. If decoding fails, the receiving device can decode the initial transmission sequence and the retransmission sequence together. Specifically, it can decode the Polar code of length 16 composed of the initial transmission sequence and the retransmission sequence. The bits filled with patterns 2 and 3 are information bits. When decoding the bits filled with pattern 1, the result has already been obtained by decoding the same bits filled with pattern 3. The bits filled with pattern 1 become known values ​​and can be understood as dynamically frozen bits.

[0115] Based on the above bit mapping relationship, it can be seen that the IR-HARQ framework based on Polar codes needs to form a corresponding check relationship between some information bits of the initial transmission sequence and some information bits of the retransmission sequence. In other words, some information bits need to be mapped to both the initial transmission sequence and the retransmission sequence. This ensures that the corresponding information bits are always carried in the most reliable position, whether decoding the initial transmission sequence alone or decoding the initial transmission sequence and retransmission sequence together, thereby improving decoding performance.

[0116] Polar codes that support self-decoding: Polar codes are relatively user-friendly. The receiving device can perform self-decoding based solely on the received Polar codes.

[0117] In communication systems, a common coverage enhancement method is to directly send multiple redundancy versions (RVs). Each RV can be understood as a coded bit sequence. These RVs usually have the following requirements:

[0118] 1) Each RV version needs to be able to be decoded independently.

[0119] 2) Multiple RV versions can be combined as long codes to enhance decoding.

[0120] Compared to sending a single longer code, the multi-RV transmission scheme allows the receiving device to still be able to decode based on the remaining RVs even if one RV is completely lost. When sending a single long code, the receiving device does not need to have this capability.

[0121] For example, as shown in FIG3 , a schematic diagram of the coding of a Polar code that supports self-decoding is provided. The left side shows the coding diagram of a common Polar code. By performing inter-stage interleaving, the fence diagram on the right can be obtained. It can be seen that receiving RV version 1 (or U code) or RV version 2 (or V code) alone can include complete information of all information bits. When channel conditions are good, the receiving device can perform self-decoding based on RV version 1 or RV version 2 alone.

[0122] In summary, for Polar codes, whether used for IR-HARQ transmission or supporting self-decoding, the characteristic of a corresponding parity check relationship between some information bits in each transmitted sequence (or, alternatively, a corresponding parity check relationship between some information bits in the V code and some information bits in the U code) is required. From a bit mapping perspective, when constructing the bit map for the equivalent long code, some information bits need to be mapped simultaneously to each transmitted sequence (or, alternatively, some information bits are mapped simultaneously to both the U code and the V code).

[0123] Furthermore, when implementing the HARQ transmission mechanism in a communication system, retransmission resources are determined by system scheduling and can be few or many. Therefore, it is best to support rateless transmission. This means that the encoding is done in advance, and the number of codeword bits to be sent is determined based on the number of retransmission resources. The corresponding number of codeword bits is then taken from the encoding and sent. In other words, "rateless" does not predetermine the code rate, but rather determines the code rate after the resources are given.

[0124] To meet the aforementioned requirement of "simultaneously mapping some information bits to both the U code and the V code" while supporting rateless transmission, the receiving device can employ a reverse mapping relationship, verifying the V code and the U code in reverse order. This allows the receiving device to address the mapping bits based on a stack structure. That is, when decoding the V code, the receiving device can sequentially push the decoding results of the mapped bits into the stack; when decoding the U code, the pre-stored results are retrieved from the stack in a backward order to assist in decoding other information bits. This reverse mapping method allows the transmitting or receiving device to simply push or retrieve data sequentially, without pre-storing specific mapping relationships. This greatly simplifies implementation and reduces complexity.

[0125] However, from the perspective of decoding performance, the first mapping bits sent in rateless transmission must correspond to the least reliable information bits in the protected U code, and the second least reliable information bits in the protected U code must correspond to the least reliable information bits in the protected U code. This ensures that the least reliable bits in the protected U code are always protected, regardless of whether a large number of retransmissions are performed as shown in (a) of Figure 4 or a small number of retransmissions as shown in (b) of Figure 4.

[0126] However, the above reverse mapping relationship is based on the natural order of the bits, not on reliability. That is, the encoding based on the above reverse mapping relationship cannot guarantee that the bits with the lowest reliability in the U code are always protected regardless of a small amount of retransmission or a large amount of reselection.

[0127] Furthermore, if a reverse-order mapping is constructed based on a large number of retransmissions, the protected U code bits for a small number of retransmissions might not be the least reliable positions, resulting in inaccurate selection and performance loss. If a reverse-order mapping is constructed based on a small number of retransmissions, it would be impossible to use a stack to address the checksum, leading to excessive decoder performance. Using a reverse-order mapping makes it difficult to balance decoding performance for both small and large retransmissions.

[0128] Therefore, how to perform Polar code encoding to achieve information bit mapping, reduce decoding complexity, and improve decoding performance has become a technical problem that needs to be solved urgently.

[0129] To solve the above technical problems, an embodiment of the present application provides a communication method, in which a transmitting device can determine K first bits based on a reliability sequence of length N1, and determine K second bits based on a reliability sequence of length N2; K≤N1<N2; the bits of the first sequence of length (N2-N1) are divided into X groups of bits, and A first bits of the K first bits are divided into X groups of first bits; wherein the X groups of bits include A second bits of the K second bits, the number of first bits included in the xth group of first bits is the same as the number of second bits included in the xth group of bits, and X≥2, x=1, 2, ..., X; according to an information bit sequence of length K, the information bit corresponding to the xth group of first bits is mapped to the second bit in the xth group of bits of the first sequence to obtain a second sequence; and the second sequence is polarized coded.

[0130] In an embodiment of the present application, a portion of the information bits (such as A information bits) of an information bit sequence of length K can be simultaneously mapped to A first bit positions and A second bit positions, that is, there is a corresponding check relationship between the A first bit positions and the A second bit positions, which can reduce the decoding complexity and improve the decoding performance. At the same time, when performing bit mapping, the present application can also perform hierarchical mapping, that is, the A first bit positions can be divided into X groups of first bits, and the bits of the first sequence can be divided into X groups of bits. In this way, the transmitting end device can map the information bit corresponding to the first bit position of the xth group to the second bit position in the xth group of bits of the first sequence, thereby realizing hierarchical mapping. At the same time, there is a corresponding check relationship between the first bit position of the xth group and the second bit position in the xth group of bits, which can reduce the decoding complexity, balance the performance of a small amount of retransmission and a large amount of retransmission, and improve the decoding performance.

[0131] The following describes in detail the implementation of the embodiments of the present application in conjunction with the accompanying drawings.

[0132] The communication method provided in the embodiments of the present application can be used in any communication system, which can be a 3GPP communication system, for example, a long term evolution (LTE) system, or a fifth generation (5G) mobile communication system, a system of hybrid networking of LTE and 5G, a NR system, a NR vehicle to everything (V2X) system, a device-to-device (D2D) communication system, a machine to machine (M2M) communication system, the Internet of Things (IoT), a narrowband Internet of Things (NB-IoT), a global system for mobile communications (GSM), an enhanced data rate for GSM evolution (EDGE), a wideband code division multiple access (WCDMA), a code division multiple access 2000 (CDMA2000), a time division-synchronization code division multiple access (TD-CDMA) system, or a time division-synchronization code division multiple access (TD-CDMA) system. access (TD-SCDMA), enhanced mobile broadband (eMBB), ultra-reliable and low-latency communication (URLLC), enhanced machine-type communication (eMTC), and various types of next-generation communication systems, such as the sixth generation (6G) mobile communication system, may also be non-terrestrial network (NTN) system, non-3GPP communication system, etc., without restriction.

[0133] The communication method provided in the embodiments of the present application can be applied to various communication scenarios. For example, it can be applied to one or more of the following communication scenarios: coding of control channels, coding of data channels, etc., without limitation.

[0134] The communication system provided in the embodiment of the present application is described below using FIG5 as an example.

[0135] FIG5 is a schematic diagram of a communication system provided in an embodiment of the present application. As shown in FIG5 , the communication system may include at least one terminal device and at least one network device.

[0136] Among them, the terminal device in Figure 5 can be located within the beam / cell coverage of the network device, and the network device can provide communication services for the terminal device. Exemplarily, the network device can use channel coding to encode the downlink data, and transmit it to the terminal device through the air interface after constellation modulation (that is, the network device is a transmitting device, and the terminal device is a receiving device); the terminal device can also use channel coding to encode the uplink data, and send it to the network device through the air interface after constellation modulation (that is, the terminal device is a transmitting device, and the network device is a receiving device). It can be understood that when network devices communicate with each other, or when terminal devices communicate with each other, they can also communicate based on channel coding, that is, the transmitting device and the receiving device can both be network devices, or both can be terminal devices, without limitation.

[0137] The terminal device in Figure 5 can be a device with wireless transceiver functions or a chip or chip system that can be set up in the device, which can allow users to access the network and is used to provide voice and / or data connectivity to users. The terminal device can also be called user equipment (UE), subscriber unit (subscriber unit), terminal (terminal), mobile station (MS), mobile terminal (MT), etc.

[0138] Exemplarily, the terminal device in FIG5 may be a mobile phone, a tablet computer, or a computer with wireless transceiver function. The terminal device may also be a user station, a mobile station, a remote station, a remote terminal device, a mobile terminal device, a user terminal device, a wireless communication device, a user agent, a user device, a cellular phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a handheld device with wireless communication capabilities, a computing device, a processing device connected to a wireless modem, an in-vehicle device, a wearable device, a terminal device in the Internet of Things, a home appliance, a virtual reality (VR) terminal, an augmented reality (AR) terminal, a wireless terminal in industrial control, a wireless terminal in unmanned driving, a wireless terminal in telemedicine, a wireless terminal in a smart grid, a wireless terminal in a smart city, a wireless terminal in a smart home, a vehicle with vehicle-to-vehicle (V2V) communication capabilities, an intelligent connected vehicle, a UAV to UAV (UAV to Unmanned aerial vehicles (UAVs, U2Us) with communication capabilities, terminal devices in future networks, or terminal devices in future evolved public land mobile networks (PLMNs), etc. are not restricted.

[0139] The network device in Figure 5 can be any device deployed in an access network that can communicate wirelessly with a terminal device. It can also be a chip or chip system that can be installed in the above-mentioned device. It can also be a logical node or logical module or a function implemented in software. It can be used to implement wireless physical control functions, resource scheduling and wireless resource management, wireless access control, mobility management, etc. Specifically, the network device can be a device that supports wired access or a device that supports wireless access.

[0140] Exemplarily, the network device may be composed of one or more access network (AN) / radio access network (RAN) nodes. The AN / RAN nodes may be: a gNB, a transmission reception point (TRP), an evolved NodeB (eNB), a radio network controller (RNC), a NodeB (NB), a base station controller (BSC), a base transceiver station (BTS), a home evolved NodeB (HNB), a base band unit (BBU), or a wireless fidelity (Wi-Fi) access point (AP).

[0141] In another example, network equipment may include a baseband unit (BBU) and a remote radio unit (RRU). The BBU and RRU can be placed in different locations. For example, the RRU can be remotely located in a high-traffic area, while the BBU can be placed in a central computer room. The BBU and RRU can also be placed in the same computer room. The BBU and RRU can also be different components within the same rack.

[0142] In another example, the network device may also be a device including a centralized unit (CU) node, or a distributed unit (DU) node, or a CU node and a DU node. For example, the network device can be divided into CU and DU from a logical function perspective, with some protocol layer functions placed in the CU for centralized control, and the remaining part or all of the protocol layer functions distributed in the DU, which is centrally controlled by the CU. Furthermore, the centralized unit CU can also be divided into a control plane (CU-CP) and a user plane (CU-UP). In different systems, CU (including CU-CP or CU-UP) or DU may also have different names. For example, in an open radio access network (O-RAN) system, CU may also be called O-CU (open CU), DU may also be called O-DU, CU-CP may also be called O-CU-CP, and CU-UP may also be called O-CU-UP.

[0143] Based on the above description of the terminal device and the network device, optionally, the communication method provided in the embodiment of the present application can be implemented by the above-mentioned terminal device or network device, or by components of the terminal device or network device, such as an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), or software (such as program code in a memory) deployed in the terminal device or network device, without limitation.

[0144] Optionally, in an embodiment of the present application, the transmitting device (or referred to as a signal source) and the receiving device (or referred to as a signal sink) may perform encoding and decoding using the process shown in FIG. 6 below.

[0145] The transmitting device can perform source coding on the bits it generates to obtain a source bit stream. This source bit stream is then channel-coded and modulated before being sent to the receiving device via a noisy channel. When the receiving device receives the modulated symbols via the noisy channel, it can demodulate them and then perform channel decoding to recover the source bit stream. This is then followed by source recovery to obtain the decoding result.

[0146] In a specific implementation, as shown in Figure 5 , each terminal device and network device can adopt the structure shown in Figure 7 , or include the components shown in Figure 7 . Figure 7 is a schematic diagram of the structure of a communication device 700 provided in an embodiment of the present application. The communication device 700 can be a terminal device or a chip or system-on-chip in a terminal device; it can also be a network device or a chip or system-on-chip in a network device. As shown in Figure 7 , the communication device 700 includes a processor 701, a transceiver 702, and a communication circuit 703.

[0147] Furthermore, the communication device 700 may further include a memory 704 , wherein the processor 701 , the memory 704 and the transceiver 702 may be connected via a communication line 703 .

[0148] The processor 701 is a central processing unit (CPU), a general-purpose processor, a network processor (NP), a digital signal processor (DSP), a microprocessor, a microcontroller, a programmable logic device (PLD), or any combination thereof. The processor 701 may also be other devices with processing functions, such as circuits, devices, or software modules, without limitation.

[0149] Transceiver 702 is used to communicate with other devices or other communication networks. The other communication networks may be Ethernet, radio access networks (RAN), wireless local area networks (WLAN), etc. Transceiver 702 may be a module, circuit, transceiver, or any device capable of communication.

[0150] The communication line 703 is used to transmit information between the components included in the communication device 700.

[0151] The memory 704 is used to store instructions, where the instructions may be computer programs.

[0152] The memory 704 may be a read-only memory (ROM) or other type of static storage device that can store static information and / or instructions, or a random access memory (RAM) or other type of dynamic storage device that can store information and / or instructions, or an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disc storage, optical disc storage (including compact disc, laser disc, optical disc, digital versatile disc, Blu-ray disc, etc.), magnetic disk storage media or other magnetic storage devices, etc., without limitation.

[0153] It should be noted that the memory 704 can exist independently of the processor 701 or can be integrated with the processor 701. The memory 704 can be used to store instructions, program code, or some data. The memory 704 can be located within the communication device 700 or outside the communication device 700, without limitation. The processor 701 is configured to execute the instructions stored in the memory 704 to implement the communication method provided in the following embodiments of this application.

[0154] In one example, the processor 701 may include one or more CPUs, such as CPU0 and CPU1 in FIG. 7 .

[0155] As an optional implementation, the communication device 700 includes multiple processors. For example, in addition to the processor 701 in FIG. 7 , it may also include a processor 707 .

[0156] As an optional implementation, the communication apparatus 700 further includes an output device 705 and an input device 706. For example, the input device 706 is a keyboard, a mouse, a microphone, a joystick, or the like, and the output device 705 is a display screen, a speaker, or the like.

[0157] It should be noted that communication device 700 may be a desktop computer, a portable computer, a network server, a mobile phone, a tablet computer, a wireless terminal, an embedded device, a chip system, or a device having a structure similar to that shown in FIG7 . Furthermore, the structure shown in FIG7 does not limit the communication device. In addition to the components shown in FIG7 , the communication device may include more or fewer components than shown, or combine certain components, or arrange the components differently.

[0158] In the embodiment of the present application, the chip system can be composed of chips, or can include chips and other discrete devices.

[0159] In addition, the actions, terms, etc. involved in the various embodiments of this application can refer to each other without limitation. The message names or parameter names in the messages exchanged between the various devices in the embodiments of this application are only examples, and other names can also be used in specific implementations without limitation.

[0160] The following describes the communication method provided in an embodiment of the present application in conjunction with the communication system shown in FIG5 and with reference to FIG8 below. The transmitting device may be any terminal device or network device in the communication system shown in FIG5, and the receiving device may also be any terminal device or network device in the communication system shown in FIG5. The transmitting device or receiving device described in the following embodiment may include the components shown in FIG7.

[0161] A communication method provided in an embodiment of the present application is described below using Polar codes used for HARQ transmission as an example with reference to FIG8 . As shown in FIG8 , the method may include:

[0162] Step 801: The transmitting end device determines K first bits according to a reliability sequence of length N1.

[0163] Wherein, K≤N1, K and N1 are both positive integers.

[0164] The value of K can be determined according to the length of the information bit sequence, that is, the length of the information bit sequence can be determined as K.

[0165] Exemplarily, the information bit sequence may include information bits and cyclic redundancy check (CRC) bits, and K may be the sum of the number of information bits and the number of CRC bits included in the information bit sequence.

[0166] The specific value of N1 can be determined according to the length of the initial transmission sequence, that is, the length of the initial transmission sequence can be determined as N1, and then the reliability sequence with the length of N1 can be determined.

[0167] The reliability sequence may be used to indicate the reliability corresponding to each bit of the sequence. A larger value of the reliability indicates a more reliable bit.

[0168] Optionally, the reliability sequence may be predefined by the protocol. The transmitting device may determine N1 based on the length of the initial transmission sequence, and then select a reliability sequence with a length of N1 from one or more reliability sequences predefined by the protocol.

[0169] For example, taking the transmitting end device determining that N1 is 16 as an example, the reliability sequence with a length of 16 may be the reliability sequence shown in the following Table 1, where: Represents reliability, Indicates the bit corresponding to the reliability:

[0170] Table 1

[0171] It can be understood that the above Table 1 is defined starting from bit 0, and can also be defined starting from bit 1, that is, the above 0, 1, ..., 15 can be replaced by 1, 2, ..., 16 respectively without limitation.

[0172] Referring to the above reliability sequence, the transmitting end device may select the first K bits of the reliability sequence of length N1 as the K first bits in order of reliability from high to low (or also from large to small).

[0173] For example, taking the reliability sequence as the reliability sequence with a length N1 of 16 as described in Table 1 above, and the length K of the information bit sequence as 15, according to the reliability sequence, the K first bits can be determined as: {15 14 13 11 7 12 10 6 9 5 3 8 4 2 1}.

[0174] Optionally, the K first bits can be recorded as It represents a first bit set I1 in a sequence of length N1, where I1 may include K first bits.

[0175] For example,

[0176] Step 802: The transmitting end device determines K second bits according to a reliability sequence of length N2.

[0177] Wherein, N1<N2, N2 is a positive integer.

[0178] For example, N2=2N1.

[0179] The specific value of N2 can be determined according to the total length of the initial transmission sequence and the retransmission sequence, that is, the total length of the initial transmission sequence and the retransmission sequence can be determined as N2, and then the reliability sequence with a length of N2 is determined.

[0180] Optionally, the transmitting device may determine the above N2 according to the total length of the initial transmission sequence and the retransmission sequence, and then select a reliability sequence with a length of N2 from one or more reliability sequences predefined in the protocol.

[0181] For example, taking the transmitting end device determining that N2 is 32 as an example, the reliability sequence with a length of 32 may be the reliability sequence shown in the following Table 2, where: Represents reliability, Indicates the bit corresponding to the reliability:

[0182] Table 2

[0183] It can be understood that the above Table 2 is defined starting from bit 0, and can also be defined starting from bit 1, that is, the above 0, 1, ..., 31 can be replaced by 1, 2, ..., 32 respectively without limitation.

[0184] Referring to the above reliability sequence, the transmitting end device may select the first K bits of the reliability sequence of length N2 as the K second bits in descending order of reliability.

[0185] Exemplarily, taking the reliability sequence as the reliability sequence with a length N2 of 32 as described in Table 2 above, and the length K of the information bit sequence as 15, according to the reliability sequence, it can be determined that the K second bits are: {31 30 29 27 23 15 28 22 25 26 21 14 13 19 11}.

[0186] Optionally, the K second bits can be recorded as It represents a second bit set I2 in a sequence of length N2, where I2 may include K second bits.

[0187] For example,

[0188] Optionally, there is no strict restriction on the order of execution of the above steps 801 and 802, that is, step 801 can be executed first, and then step 802, or step 802 can be executed first, and then step 801, or step 801 and step 802 can be executed at the same time without restriction.

[0189] Step 803: The transmitting device divides the bits of the first sequence of length (N2-N1) into X groups of bits.

[0190] The transmitting end device may divide the bits of the first sequence into X groups of bits, or may interleave the first sequence and divide the interleaved bits of the first sequence into X groups of bits.

[0191] Optionally, the transmitting device may interleave the first sequence according to a third interleaving pattern to obtain an interleaved first sequence.

[0192] Optionally, the third interleaving pattern may be one or more of the following: a random interleaving pattern, a triangular interleaving pattern, a row-column interleaving pattern, or a reverse interleaving pattern, etc., without limitation.

[0193] Exemplarily, the transmitting end device may interleave the first sequence based on the third interleaving pattern with bits as the granularity to obtain the interleaved first sequence.

[0194] In another example, the transmitting device may also perform interleaving based on the third interleaving pattern with sub-blocks as the granularity, that is, the first sequence may be divided into M sub-blocks, and the M sub-blocks may be interleaved to obtain the interleaved first sequence.

[0195] Each sub-block may include one or more bits. The transmitting device may divide the first sequence of bits into M sub-blocks according to reliability (e.g., in descending order or in descending order), or may divide the first sequence of bits into M sub-blocks according to a natural order of numbering (e.g., in descending order or in descending order), without limitation.

[0196] For example, the third interleaving pattern may be any one of the following three sub-block interleaving patterns: [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]; or, [0 4 8 12 1 5 9 13 2 6 10 14 3 7 11 15 16 20 24 28 17 21 25 29 18 22 26 30 19 23 27 31]; or, [0 8 16 24 1 9 17 25 2 10 18 26 3 11 19 27 4 12 20 28 5 13 21 29 6 14 22 30 7 15 23 31].

[0197] Among them, the first seed block interleaving pattern has better compatibility, such as better compatibility with the NR communication system; the second seed block interleaving pattern has better performance; and the third seed block interleaving pattern is relatively simple to implement.

[0198] It can be understood that the above sub-block interleaving pattern is defined starting from 1 bit, and can also be defined starting from 0 bit, that is, the above 1, 2, ..., 32 can be replaced by 0, 1, ..., 31 respectively without limitation.

[0199] Based on the above description of the first sequence and the interleaved first sequence, optionally, the transmitting end device may divide the bits of the first sequence (or the interleaved first sequence) into X groups of bits according to preset configuration information or retransmission resources.

[0200] The transmitting device may divide the bits of the first sequence (or the interleaved first sequence) into X groups of bits at a bit granularity, where the xth group of bits includes Zx bits, where Zx is a positive integer. Alternatively, the transmitting device may divide the bits of the first sequence (or the interleaved first sequence) into X groups of bits at a sub-block granularity, where the xth group of bits includes Yx sub-blocks, where Yx is a positive integer. x = 1, 2, ..., X.

[0201] Exemplarily, the transmitting end device may determine the specific value of X according to preset configuration information, and may also determine the number of bits or sub-blocks included in each group of bits.

[0202] For example, taking the preset configuration information indicating that the value of X is 2, and indicating that the first group of bits includes (N2-N1) / 8 bits of the first sequence (or the interleaved first sequence), and the second group of bits includes 7(N2-N1) / 8 bits of the first sequence (or the interleaved first sequence), as an example, if the first sequence (or the interleaved first sequence) includes (N2-N1)=64 bits, it can be determined that the first group of bits includes 8 bits and the second group of bits includes 56 bits.

[0203] Among them, (N2-N1) / 8 bits and 7(N2-N1) / 8 bits can also be converted into sub-blocks for description. For example, taking the first sequence (or the first sequence after interleaving) being divided into (N2-N1) / 2 sub-blocks, that is, one sub-block includes 2 bits, (N2-N1) / 8 bits can also be described as (N2-N1) / 16 sub-blocks, and 7(N2-N1) / 8 bits can also be described as 7(N2-N1) / 16 sub-blocks.

[0204] Optionally, the preset configuration information may be predefined by a protocol, or may be indicated to the sending device by other devices, without limitation.

[0205] In another example, the transmitting device may also divide the bits of the first sequence (or the interleaved first sequence) into X groups of bits according to the retransmission resources.

[0206] Among them, the transmitting device can determine the number of bits (or sub-blocks) of the first retransmission based on the retransmission resources of the first retransmission, that is, determine the number of bits (or sub-blocks) included in the first group of bits; determine the number of bits (or sub-blocks) of the second retransmission based on the retransmission resources of the second retransmission, that is, determine the number of bits (or sub-blocks) included in the second group of bits;...; determine the number of bits (or sub-blocks) of the second retransmission based on the retransmission resources of the Xth retransmission, that is, determine the number of bits (or sub-blocks) included in the Xth group of bits.

[0207] For example, if the transmitting device determines that 4 sub-blocks need to be retransmitted based on the retransmission resources of the first retransmission, it can be determined that the first group of bits includes 4 sub-blocks. If the transmitting device determines that 12 sub-blocks need to be retransmitted based on the retransmission resources of the second retransmission, it can be determined that the second group of bits includes 12 sub-blocks.

[0208] Based on the above description of the X groups of bits, in a possible design, there is at least one group of bits in the X groups of bits whose length is an integer power of 2.

[0209] Exemplarily, the length of the first group of bits in the X groups of bits is an integer power of 2.

[0210] In another possible design, the length from the first group of bits to the x'th group of bits in the X groups of bits is an integer power of 2, 2≤x'≤X.

[0211] Illustratively, the length from the first group of bits to the second group of bits in the X groups of bits is an integer power of 2, or the length from the first group of bits to the third group of bits in the X groups of bits is an integer power of 2, and so on, without limitation.

[0212] Based on the above description, illustratively, the value of X can be any of the following: 2, 3, 4, etc., without limitation.

[0213] In the first example, taking X equal to 2 as an example, the first group of bits in the X groups of bits may include (N2-N1) / 8 bits of the first sequence (or the interleaved first sequence), and the second group of bits may include 7(N2-N1) / 8 bits of the first sequence (or the interleaved first sequence).

[0214] Among them, (N2-N1) / 8 bits and 7(N2-N1) / 8 bits can also be converted into sub-blocks for description. For example, taking the first sequence (or the first sequence after interleaving) being divided into (N2-N1) / 2 sub-blocks, that is, one sub-block includes 2 bits, (N2-N1) / 8 bits can also be described as (N2-N1) / 16 sub-blocks, and 7(N2-N1) / 8 bits can also be described as 7(N2-N1) / 16 sub-blocks.

[0215] For example, taking the first sequence (or the first sequence after interleaving) including 32 sub-blocks as an example, the last four sub-blocks may be grouped together, and the remaining sub-blocks may be grouped together to minimize the chip area.

[0216] In the second example, taking X equal to 3 as an example, the first group of bits in the X groups of bits may include (N2-N1) / 8 bits of the first sequence (or the interleaved first sequence), the second group of bits may include (N2-N1) / 8 bits of the first sequence (or the interleaved first sequence), and the third group of bits may include 3(N2-N1) / 4 bits of the first sequence (or the interleaved first sequence).

[0217] Among them, (N2-N1) / 8 bits and 3(N2-N1) / 4 bits can also be converted into sub-blocks for description. For details, please refer to the relevant description in the first example above and will not be repeated here.

[0218] For example, if the first sequence (or the interleaved first sequence) includes 32 sub-blocks, the last four sub-blocks can be grouped together, the next four sub-blocks can be grouped together, and the remaining sub-blocks can be grouped together. Compared to the first example above, although the chip area may increase, decoding performance can be further improved.

[0219] In the third example, taking X equal to 4 as an example, the first group of bits in the X groups of bits may include (N2-N1) / 8 bits of the first sequence (or the interleaved first sequence), the second group of bits may include (N2-N1) / 8 bits of the first sequence (or the interleaved first sequence), the third group of bits may include (N2-N1) / 4 bits of the first sequence (or the interleaved first sequence), and the fourth group of bits may include (N2-N1) / 2 bits of the first sequence (or the interleaved first sequence).

[0220] Among them, (N2-N1) / 8 bits, (N2-N1) / 4 bits, and (N2-N1) / 2 bits can also be converted into sub-blocks for description. For details, please refer to the relevant description in the first example above and will not be repeated here.

[0221] For example, if the first sequence (or the interleaved first sequence) includes 32 sub-blocks, the last four sub-blocks can be grouped together, the next four sub-blocks together, the next eight sub-blocks together, and the remaining sub-blocks together. Compared to the first and second examples above, this method can achieve a balance between chip area and decoding performance.

[0222] In the fourth example, taking X equal to 2 as an example, the first group of bits in the X groups of bits may include (N2-N1) / 4 bits of the first sequence (or the interleaved first sequence), and the second group of bits may include 3(N2-N1) / 4 bits of the first sequence (or the interleaved first sequence).

[0223] Among them, (N2-N1) / 4 bits and 3(N2-N1) / 4 bits can also be converted into sub-blocks for description. For details, please refer to the relevant description in the first example above and will not be repeated here.

[0224] For example, if the first sequence (or the interleaved first sequence) includes 32 sub-blocks, the last eight sub-blocks can be grouped together, and the remaining sub-blocks can be grouped together. Compared to the third example above, this method prioritizes (N2 - N1) / 4 bits for retransmission, while balancing chip area and decoding performance.

[0225] Based on the above description of the X groups of bits, the transmitting device may group the first sequence or the interleaved first sequence according to any one of the following three possible designs to obtain X groups of bits.

[0226] In a first possible design, the transmitting device may group the first sequence according to reliability to obtain X groups of bits.

[0227] Exemplarily, the reliability of the x+1th group of bits is higher than the reliability of the xth group of bits, where x=1, 2, ..., X. That is, the 1st group of bits is the least reliable Z1 bits (or Y1 sub-blocks) among the X groups of bits, the 2nd group of bits is the least reliable Z2 bits (or Y2 sub-blocks) among (X groups of bits - 1st group of bits), ..., the Xth group of bits is the least reliable Z bits among (X groups of bits - (1st group of bits + 2nd group of bits + ... + X-1th group of bits)). X bits (or Y X sub-blocks).

[0228] For example, taking X=2 and the first sequence sorted from high to low in reliability as {15 14 13 11 7 12 10 6 9 5 3 8 4 2 1 0}, the first sequence can be divided into the following two groups of bits: {1 0} and {15 14 13 11 7 12 10 6 9 5 3 8 4 2 1 0}.

[0229] In another example, the reliability of the x+1th group of bits is lower than the reliability of the xth group of bits, where x=1, 2, ..., X. That is, the first group of bits is the most reliable Z1 bits (or Y1 sub-blocks) among the X groups of bits, the second group of bits is the most reliable Z2 bits (or Y2 sub-blocks) among (X groups of bits - 1st group of bits), ..., the Xth group of bits is the most reliable Z bits among (X groups of bits - (1st group of bits + 2nd group of bits + ... + X-1th group of bits)). X bits (or Y X sub-blocks).

[0230] For example, taking X=2 and the first sequence sorted from high to low in reliability as {15 14 13 11 7 12 10 6 9 5 3 8 4 2 1 0}, the first sequence can be divided into the following two groups of bits: {15 14} and {13 11 7 12 10 6 9 5 3 8 4 2 1 0}.

[0231] In a second possible design, the transmitting device may also group the first sequence according to the natural order of the numbers to obtain X groups of bits.

[0232] Exemplarily, the number of the x+1th group of bits is greater than the number of the xth group of bits, where x=1, 2, ..., X. That is, the first group of bits is the smallest numbered Z1 bits (or Y1 sub-blocks) in the Xth group of bits, the second group of bits is the smallest numbered Z2 bits (or Y2 sub-blocks) in (Xth group of bits - (1st group of bits + 2nd group of bits + ... + X-1th group of bits)). X bits (or Y X sub-blocks).

[0233] For example, taking X=2 and the first sequence being sorted from smallest to largest as {0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15}, the first sequence can be divided into the following two groups of bits: {0 1} and {2 3 4 5 6 7 8 9 10 11 12 13 14 15}.

[0234] In another example, the number of the x+1th group of bits is smaller than the number of the xth group of bits, where x=1, 2, ..., X. That is, the first group of bits is the Z1 bits (or Y1 sub-blocks) with the largest number in the X groups of bits, the second group of bits is the Z2 bits (or Y2 sub-blocks) with the largest number in (X groups of bits - 1st group of bits), ..., the Xth group of bits is the Z bits (or Y2 sub-blocks) with the largest number in (X groups of bits - (1st group of bits + 2nd group of bits + ... + X-1th group of bits)). X bits (or Y X sub-blocks).

[0235] For example, taking X=2 and the first sequence being sorted from smallest to largest as {0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15}, the first sequence can be divided into the following two groups of bits: {14 15} and {0 1 2 3 4 5 6 7 8 9 10 11 12 13}.

[0236] In a third possible design, the transmitting device may group the interleaved first sequence according to the interleaved order to obtain X groups of bits.

[0237] Exemplarily, the transmitting end device may group the interleaved first sequence in order from front to back, that is, the first group of bits is the Z1 bits (or Y1 sub-blocks) that are ranked first in the interleaved first sequence, the second group of bits is the Z2 bits (or Y2 sub-blocks) that are ranked first in the interleaved first sequence excluding the first group of bits, ..., the Xth group of bits is the Zth bit group (or Y2 sub-block) that is ranked first in the interleaved first sequence excluding (the 1st group of bits + the 2nd group of bits + ... + the X-1th group of bits). X bits (or Y X sub-blocks).

[0238] For example, taking X=2 and the first sequence after interleaving being {13 11 8 9 4 7 2 3 15 10 14 1 5 0 6 12} from front to back, the first sequence can be divided into the following two groups of bits: {13 11} and {8 9 4 7 2 3 15 10 14 1 5 0 6 12}.

[0239] In another example, the transmitting device may also group the interleaved first sequence in order from back to front, that is, the first group of bits is the last Z1 bits (or Y1 sub-blocks) in the interleaved first sequence, the second group of bits is the last Z2 bits (or Y2 sub-blocks) in the interleaved first sequence excluding the first group of bits, ..., the Xth group of bits is the last Z bits (or Y2 sub-blocks) in the interleaved first sequence excluding (the first group of bits + the second group of bits + ... + the X-1th group of bits). X bits (or Y X sub-blocks).

[0240] For example, taking X=2 and the interleaved first sequence being {13 11 8 9 4 7 2 3 15 10 14 1 5 0 6 12} from front to back, the first sequence can be divided into the following two groups of bits: {6 12} and {13 11 8 9 4 7 2 3 15 10 14 1 5 0}.

[0241] Based on the above description of the X groups of bits, the X groups of bits may include A second bits among the K second bits, where A≤K, and A and X are both positive integers.

[0242] In a first possible design, A second bits are determined based on K first bits and K second bits.

[0243] Exemplarily, the transmitting device may determine K third bits based on the K first bits, and determine A second bits based on the K third bits.

[0244] The third bit corresponding to the first bit numbered i is numbered i+N2-N1, 0≤i≤N1-1. The A second bits are bits in the K second bits that have different numbers from the K third bits.

[0245] Optionally, the K first bits can be recorded as Let the K second bits be You can Add (N2-N1) to the number of each first bit in i, and get K third bits. Then the A second bits can be recorded as Indicates a bit in the K second bits that has a different number from the K third bits.

[0246] For example, taking K as 15, N1 as 16, and N2 as 32, assuming that the K first bits {15 14 13 11 7 12 10 6 9 5 3 8 4 2 1}, K second bits is {31 30 29 27 23 15 28 22 25 26 21 14 13 19 11}, The number i of each first bit in the number is added to 16 (i.e. N2-N1), and the K third bits are obtained. Then the A second bits can be recorded as

[0247] It should be noted that the above-mentioned first possible design illustrates the method of determining A second bits by taking the definition starting from bit 0 as an example. It can be understood that when the definition starts from bit 1, the third bit corresponding to the first bit numbered i is numbered i+N2-N1, 1≤i≤N1.

[0248] In a second possible design, the A second bits are A bits numbered less than N2-N1 among the K second bits.

[0249] For example, taking K as 15, N1 as 16, and N2 as 32, assuming that the 15 (i.e., K) second bits are {31 30 29 27 23 15 28 22 25 26 21 14 13 19 11}, it can be determined that the bits numbered less than 16 (i.e., N2-N1) among the 15 second bits are {15 14 13 11}, that is, the A second bits are {15 14 13 11}.

[0250] It should be noted that this second possible design illustrates the method of determining A second bits by taking the definition starting from bit 0 as an example. It can be understood that when the definition starts from bit 1, the A second bits are the A bits among the K second bits whose numbers are less than or equal to N2-N1.

[0251] Based on the above description of the A second bits, the distribution of the A second bits in the X groups of bits can be determined, that is, the second bits and the number of second bits included in each group of the X groups of bits can be determined. The above process of dividing the bits of the first sequence or the interleaved first sequence into X groups of bits can also be described as the process of dividing the A second bits into X groups of bits, or as the process of dividing the A second bits into X groups of second bits.

[0252] The A second bits are distributed in at least two groups of bits among the X groups of bits.

[0253] For example, taking the X groups of bits as {1 0}, {15 14}, {13 11 7 12}, {10 6 9 5 3 8 4 2 1 0}, and the A second bits as {15 14 13 11}, it can be determined that the first group of bits does not include the second bit, that is, the number of second bits included in the first group of bits is 0; the second group of bits includes 15 and 14, that is, the number of second bits included in the second group of bits is 2; the second group of bits includes 13 11, and the number of second bits included in the third group of bits is 2; the fourth group of bits does not include the second bit, that is, the number of second bits included in the fourth group of bits is 0.

[0254] Step 804: The transmitting end device divides A first bits out of the K first bits into X groups of first bits.

[0255] In a first possible design, A first bits are determined based on K first bits and K second bits.

[0256] Exemplarily, the transmitting device may determine K third bits based on the K first bits, and determine A first bits based on A third bits among the K third bits.

[0257] The third bit corresponding to the first bit numbered i is numbered i+N2-N1, where 0≤i≤N1-1. The A third bits are bits in the K third bits that have different numbers from the K second bits. The first bit corresponding to the third bit numbered j is numbered j-(N2-N1), where N2-N1≤j≤N2-1.

[0258] Optionally, the K first bits can be recorded as Let the K second bits be You can Add (N2-N1) to the number of each first bit in i, and get K third bits. Then the A third bits can be recorded as Indicates the bits in the K third bits that are different from the K second bits. Subtract (N2-N1) from the number j of each third bit in the equation to get A first bits.

[0259] For example, taking K as 15, N1 as 16, and N2 as 32, assuming that the K first bits {15 14 13 11 7 12 10 6 9 5 3 8 4 2 1}, K second bits is {31 30 29 27 23 15 28 22 25 26 21 14 13 19 11}, The number i of each first bit in the number is added to 16 (i.e. N2-N1), and the K third bits are obtained. Then the K third bits can be and K second bits The bits {24 20 18 17} with different numbers are determined as A third bits Then we can The number j of each third bit in is subtracted by 16 (i.e. N2-N1), and the A first bits are obtained.

[0260] It should be noted that the first possible design described above uses the definition starting from bit 0 as an example to illustrate the method of determining the A first bits. It can be understood that when the definition starts from bit 1, the third bit corresponding to the first bit numbered i is numbered i+N2-N1, 1≤i≤N1. The first bit corresponding to the third bit numbered j is numbered j-(N2-N1), N2-N1+1≤j≤N2.

[0261] In a second possible design, the A first bits are the last A bits of the K first bits sorted in descending order of reliability.

[0262] Among them, the number of bits numbered less than N2-N1 in the K second bits can be determined as the specific value of A.

[0263] For example, taking K as 15, N1 as 16, and N2 as 32, assuming that the 15 (i.e., K) second bits are {31 30 29 27 23 15 28 22 25 26 21 14 13 19 11}, it can be determined that the number of bits numbered less than 16 (i.e., N2-N1) in the 15 second bits is 4, i.e., A is equal to 4.

[0264] For example, taking K as 15, A as 4, and the determined 15 first bits as {15 14 13 11 7 12 10 6 9 5 3 8 4 2 1}, assuming that the 15 first bits are sorted from high to low in reliability as 15, 14, 13, 11, 7, 12, 10, 6, 9, 5, 3, 8, 4, 2, 1, it can be determined that the A first bits are {8 4 2 1}.

[0265] It should be noted that in this second possible design, the specific value of A is explained by taking the definition starting from bit 0 as an example. It can be understood that when the definition starts from bit 1, the number of bits numbered less than or equal to N2-N1 in the K second bits can be determined as the specific value of A.

[0266] Based on the above description of the A first bits, the A first bits can be Divide into X groups of first bits (such as The number of first bits included in the xth group of first bits is the same as the number of second bits included in the xth group of bits. When the number of second bits included in the xth group of bits is 0, the number of first bits included in the xth group of first bits is also 0.

[0267] In a first possible design, the transmitting device may group A first bits according to reliability to obtain X groups of first bits.

[0268] For example, the reliability of the first bit of the x+1th group is higher than the reliability of the first bit of the xth group, where x=1, 2, ..., X. yes The most unreliable The first bit, yes The most unreliable first bits, ..., yes The most unreliable The first bit.

[0269] For example, if X=2, the number of second bits included in the first bit group of the two bit groups is 2, the number of second bits included in the second bit group is also 2, and A first bits Taking the reliability order {8 4 2 1} from high to low as an example, the A first bits can be divided into the following two groups of first bits:

[0270] In another example, the reliability of the first bit of the x+1th group is lower than the reliability of the first bit of the xth group, where x=1, 2, ..., X. yes The most reliable The first bit, yes The most reliable first bits, ..., yes The most reliable The first bit.

[0271] For example, if X=2, the number of second bits included in the first bit group of the two bit groups is 2, the number of second bits included in the second bit group is also 2, and A first bits Taking the reliability order {8 4 2 1} from high to low as an example, the A first bits can be divided into the following two groups of first bits:

[0272] In a second possible design, the transmitting device may also group the A first bits according to the natural order of the numbers to obtain X groups of first bits.

[0273] Exemplarily, the number of the first bit of the x+1th group is greater than the number of the first bit of the xth group, x=1, 2, ..., X. yes The smallest number The first bit, yes The smallest number first bits, ..., yes The smallest number The first bit.

[0274] For example, if X=2, the number of second bits included in the first group of bits in the two groups of bits is 2, the number of second bits included in the second group of bits is also 2, and A first bits Taking the order of numbers from small to large as {1 2 4 8} as an example, the A first bits can be divided into the following two groups of first bits:

[0275] In another example, the number of the first bit of the x+1th group is smaller than the number of the first bit of the xth group, x=1, 2, ..., X. yes The largest number The first bit, yes The largest number first bits, ..., yes The largest number The first bit.

[0276] For example, if X=2, the number of second bits included in the first group of bits in the two groups of bits is 2, the number of second bits included in the second group of bits is also 2, and A first bits Taking the order {8 4 2 1} from largest to smallest (or also called from high to low) as an example, the A first bits can be divided into the following two groups of first bits:

[0277] In a third possible design, the transmitting device may also interleave the A first bits according to a fourth interleaving pattern, and divide the interleaved A first bits into X groups of first bits.

[0278] Optionally, the fourth interleaving pattern may be one or more of the following: a random interleaving pattern, a triangular interleaving pattern, a row-column interleaving pattern, or a reverse interleaving pattern, etc., without limitation.

[0279] Optionally, the A first bits after interleaving may be grouped in order from front to back, i.e. It is the first bit in the A bits after interleaving. The first bit, is the A first bits after interleaving except The top one other than first bits, ..., is the A first bits after interleaving except The top one other than Alternatively, the A first bits after interleaving can be grouped in order from back to front, i.e. It is the last bit in the A first bits after interleaving. The first bit, is the A first bits after interleaving except The last one in the list first bits, ..., is the A first bits after interleaving except The last one in the list The first bit.

[0280] Exemplarily, interleaving may be performed based on the fourth interleaving pattern with bits as the granularity to obtain A interleaved first bits, and the A interleaved first bits may be divided into X groups of first bits.

[0281] For example, if X=2, the number of second bits included in the first group of bits in the two groups of bits is 2, the number of second bits included in the second group of bits is also 2, and A first bits Taking {8 4 2 1} as an example, the A first bits can be interleaved according to the fourth interleaving pattern with the bit as the granularity. Assuming that the A first bits after interleaving are {2 8 1 4}, the A first bits after interleaving can be divided into the following two groups of first bits in the order from front to back:

[0282] In another example, interleaving can be performed based on the fourth interleaving pattern with sub-blocks as the granularity, that is, A first bits can be divided into B sub-blocks, and the B sub-blocks can be interleaved to obtain A first bits after interleaving, and the A first bits after interleaving can be divided into X groups of first bits.

[0283] Each sub-block may include one or more first bits. A first bits may be divided into B sub-blocks according to reliability (e.g., in descending order or in descending order), or may be divided into B sub-blocks according to a natural order of numbering (e.g., in descending order or in descending order), without limitation.

[0284] For example, if X=2, the number of second bits included in the first group of bits in the two groups of bits is 2, the number of second bits included in the second group of bits is also 2, and the number of A first bits is Taking {8 4 2 1} and B = 2 as an example, the A first bits can be divided into the following two sub-blocks according to the natural order of the numbers: sub-block 1 = {8 4}, sub-block 2 = {2 1}. Then, the two sub-blocks can be interleaved according to the fourth interleaving pattern with the sub-blocks as the granularity. Assuming that the A first bits after interleaving are {2 1 8 4}, the A first bits after interleaving can be divided into the following two groups of first bits in the order from front to back:

[0285] Step 805: The transmitting end device maps the information bit corresponding to the first bit of the x-th group to the second bit of the x-th group of bits in the first sequence according to the information bit sequence of length K to obtain a second sequence.

[0286] The transmitting device may map an information bit sequence of length K to K first bits of a third sequence of length N1 to obtain a fourth sequence, and determine A information bits corresponding to X groups of first bits based on information bits corresponding to A first bits among the K first bits. Alternatively, this may be described as determining information bits corresponding to each first bit in the X groups of first bits, or as determining information bits corresponding to each group of first bits in the X groups of first bits.

[0287] Among them, the transmitting end device can select the first K bits of the third sequence as K first bits (the K first bits are information bits) in order from high to low reliability based on the above-mentioned reliability sequence of length N1, map the information bit sequence of length K to the K first bits, that is, map the information bit sequence to the K information bits of the third sequence, set the values ​​of the remaining N1-K bits of the third sequence to 0, and obtain a fourth sequence.

[0288] Exemplarily, taking the reliability sequence as the reliability sequence with a length of 16 shown in Table 1 above, and the length of the third sequence as 16, when the length of the information bit sequence is 15, according to the reliability sequence shown in Table 1, it can be determined that the K first bits of the third sequence with reliability from high to low are {15 14 13 11 7 12 10 6 9 5 3 8 4 2 1}. That is, as shown in FIG9 , the information bits can be determined to be {15 14 13 11 7 12 10 6 9 5 3 8 4 2 1} (that is, the bits filled with Figure 1 and Figure 2 in FIG9 ). The information bit sequence with a length of 15 can be mapped to these 15 information bits of the third sequence, and the value of the remaining bit of the third sequence (that is, the bit not filled with the graph in FIG9 ) is set to 0 to obtain a fourth sequence.

[0289] Based on the above description of the A first bits and the X groups of first bits, the transmitting end device may determine the information bits corresponding to the A first bits included in the X groups of first bits according to the fourth sequence.

[0290] Exemplarily, as shown in FIG9 , taking A first bits as {8 4 2 1} (i.e., the bits filled with figure 1 in FIG9 ) as an example, the transmitting device can determine the information bits located at the 8th, 4th, 2nd, and 1st bits in the fourth sequence as the information bits corresponding to the A first bits, that is, as the information bits corresponding to the first bits of X groups.

[0291] Optionally, the transmitting device may further perform polarization coding on the fourth sequence to obtain an initial transmission sequence.

[0292] Based on the above description, the transmitting device may use the second bit in the xth group of bits in the first sequence as the information bit, and map the information bit corresponding to the first bit in the xth group to the second bit in the xth group of bits in the first sequence, where x = 1, 2, ..., X. The transmitting device may also set the values ​​of N2-N1-A bits in the first sequence, excluding the second bit in the xth group of bits, to 0 to obtain a second sequence.

[0293] For example, as shown in FIG9 , N1 is 16, N2 is 32, and the first bits of the X groups are The second bits in the X groups of bits are For example, the transmitting device can map the information bits at the 8th and 4th bits in the fourth sequence with a length of 16 to the 11th and 13th bits of the first sequence with a length of 16; map the information bits at the 2nd and 1st bits in the fourth sequence to the 14th and 15th bits of the first sequence, and set the values ​​of the remaining 12 bits in the first sequence to 0 to obtain the second sequence.

[0294] Optionally, the transmitting end device may interleave and map the information bits corresponding to the first bit position of the xth group to the second bit position in the xth group of bits according to the first interleaving pattern.

[0295] In a first possible design, the transmitting device may interleave and map the information bit corresponding to the first bit position of the xth group to the second bit position in the xth group of bits using a reverse mapping relationship according to the first interleaving pattern.

[0296] Exemplarily, the transmitting device may, based on the first interleaving pattern, use a reverse mapping relationship to interleave and map the information bits corresponding to the first bits in the first bit positions of the xth group, which are numbered in ascending order, to the second bits in the xth group, which are numbered in descending order.

[0297] For example, as shown in FIG9 , N1 is 16, N2 is 32, and the first bits of the X groups are The second bits in the X groups of bits are For example, the transmitting device can interleave and map the information bits at the 4th and 8th bits in the fourth sequence with a length of 16 to the 13th and 11th bits of the first sequence with a length of 16 according to the first interleaving pattern; map the information bits at the 1st and 2nd bits in the fourth sequence to the 15th and 14th bits of the first sequence, and set the values ​​of the remaining 12 bits in the first sequence to 0 to obtain a second sequence.

[0298] In a second possible design, the transmitting device may also interleave the first bit of the xth group according to the first interleaving pattern, and map the information bits corresponding to the first bit of the xth group after interleaving to the second bit in the xth group of bits in a certain order (such as from front to back, or from back to front).

[0299] Exemplarily, the transmitting device can interleave the first bits of the xth group with bit granularity according to the first interleaving pattern to obtain the interleaved first bits of the xth group, and map the information bits corresponding to the interleaved first bits of the xth group to the second bit in the xth group of bits in a certain order.

[0300] In another example, the transmitting device may also interleave the first bits of the xth group based on the first interleaving pattern with sub-blocks as the granularity, that is, divide the first bits of the xth group into multiple sub-blocks, interleave the multiple sub-blocks to obtain the interleaved first bits of the xth group, and map the information bits corresponding to the interleaved first bits of the xth group to the second bit in the xth group of bits in a certain order.

[0301] Each sub-block may include one or more first bits. The xth group of first bits may be divided into multiple sub-blocks according to reliability (e.g., in descending order or in descending order), or may be divided into multiple sub-blocks according to a natural order of numbering (e.g., in descending order or in descending order), without limitation.

[0302] In a third possible design, similar to the above-mentioned sending end device dividing A first bits and A second bits into X groups of first bits and X groups of bits respectively when performing bit mapping, and performing mapping based on bit groups, when the sending end device maps the information bit corresponding to the first bit of the x-th group to the second bit of the x-th group of bits, it can also divide the first bit of the x-th group of bits and the second bit of the x-th group of bits into multiple sub-blocks, and perform bit mapping based on the sub-blocks according to the first interleaving pattern. That is, the information bit corresponding to the first sub-block of the first bit of the x-th group of bits can be interleaved and mapped to the first sub-block of the second bit of the x-th group of bits, ..., and the information bit corresponding to the last sub-block of the first bit of the x-th group of bits can be interleaved and mapped to the last sub-block of the second bit of the x-th group of bits.

[0303] Among them, the description of dividing the first bit of the xth group and the second bit of the xth group of bits into multiple sub-blocks can refer to the description in the above-mentioned second possible design and will not be repeated here.

[0304] Based on the above three possible designs, illustratively, the first interleaving pattern may be one or more of the following: a random interleaving pattern, a triangular interleaving pattern, a row-column interleaving pattern, or a reverse interleaving pattern, etc., without limitation.

[0305] Optionally, different from the above interleaving, the transmitting device may also scramble the information bits corresponding to the first bits of the X groups, and map the scrambled information bits corresponding to the first bits of the X groups to the second bits of the X groups of bits in the first sequence to obtain a second sequence.

[0306] Step 806: The transmitting device performs polarization coding on the second sequence to obtain a coded bit sequence.

[0307] In a first possible design, when the transmitting device performs polarization coding on the second sequence, it may perform an XOR process on the second sequence and the fourth sequence to obtain an XORed sequence, and then perform polarization coding on the XORed sequence to obtain a retransmission sequence.

[0308] In a second possible design, when the transmitting device performs polarization encoding on the second sequence, it may also perform polarization encoding on the second sequence to obtain a first polarization sequence, perform polarization encoding on the fourth sequence to obtain a second polarization sequence, and perform an XOR operation on the first polarization sequence and the second polarization sequence to obtain a retransmission sequence.

[0309] It can be understood that, for the HARQ transmission scenario, the coded bit sequence may also be called a retransmission sequence.

[0310] Step 807: The transmitting device sends one or more bits in the coded bit sequence to the receiving device; correspondingly, the receiving device receives the symbol sequence from the transmitting device.

[0311] Among them, one or more bits in the coded bit sequence sent by the transmitting device to the receiving device may be affected by interference such as noise when transmitted through the channel. The symbol sequence received by the receiving device is one or more bits in the coded bit sequence affected by interference such as noise.

[0312] Optionally, the transmitting device may refer to the aforementioned description of HARQ transmission and send an initial transmission sequence (such as a sequence after polarization encoding of the above-mentioned fourth sequence) to the receiving device. The receiving device attempts to decode the received symbol sequence (the symbol sequence is the symbol sequence corresponding to the initial transmission sequence). If the decoding is successful, a confirmation frame may be fed back to the transmitting device. The transmitting device may stop sending based on the confirmation frame. If the decoding at the receiving end fails, the receiving device may cache the received symbol sequence and feed back a negative acknowledgment frame to the transmitting device, or it may not feed back a negative acknowledgment frame to the transmitting device. When the transmitting device receives a negative acknowledgment frame or does not receive a confirmation frame within a certain period of time, it may continue to send one or more bits in the above-mentioned coded bit sequence as incremental redundancy. The receiving device may decode the symbol sequence corresponding to the received initial transmission sequence and the symbol sequence corresponding to one or more bits in the above-mentioned coded bit sequence together.

[0313] Step 808: The receiving end device determines K first bits according to the reliability sequence of length N1, and determines K second bits according to the reliability sequence of length N2.

[0314] The receiving device may adopt the same method as the transmitting device to determine the K first bits and the K second bits with reference to the above steps 801 and 802, which will not be described in detail.

[0315] Step 809: The receiving end device divides the bits of the first sequence of length (N2-N1) into X groups of bits, and divides A first bits of the K first bits into X groups of first bits.

[0316] Step 810: The receiving device decodes the symbol sequence according to the X groups of first bits and the second bits in the X groups of bits.

[0317] The receiving device may adopt the same method as the transmitting device, referring to steps 803 and 804 above to determine the first bit of the X groups and the second bit of the X groups of bits, and then decode the symbol sequence.

[0318] Optionally, when decoding the symbol sequence, the receiving device may decode the symbol sequence corresponding to the received initial transmission sequence and the symbol sequence corresponding to one or more bits in the coded bit sequence together according to the first bit of the X groups and the second bit of the X groups of bits.

[0319] When decoding the symbol sequence, the receiving device may determine the information bit located at the second bit position of the symbol sequence based on the second bit position in the determined X groups of bits. Since the transmitting device simultaneously maps A information bits of the information bit sequence of length K to the first bit position of the X groups and the second bit position in the X groups of bits when encoding the information bit sequence, a corresponding check relationship exists between the first bit position of the X groups and the second bit position in the X groups of bits. Therefore, based on this check relationship, the receiving device may determine the information bit located at the first bit position of the X groups of bits of the symbol sequence based on the information bit located at the second bit position in the X groups of bits, thereby achieving decoding.

[0320] Based on the method shown in FIG8 above, a portion of the information bits (such as A information bits) of the information bit sequence of length K can be simultaneously mapped to the A first bits of the fourth sequence corresponding to the initial transmission sequence, and the A second bits of the second sequence corresponding to the retransmission sequence, that is, the A first bits of the fourth sequence and the A second bits of the second sequence have a corresponding check relationship, which can reduce the decoding complexity and improve the decoding performance. At the same time, when performing bit mapping, the present application can also perform hierarchical mapping, that is, the A first bits can be divided into X groups of first bits, and the bits of the first sequence can be divided into X groups of bits. In this way, the transmitting end device can map the information bit corresponding to the first bit of the xth group to the second bit of the xth group of bits of the first sequence, realizing hierarchical mapping. At the same time, there is a corresponding check relationship between the first bit of the xth group and the second bit of the xth group, which can reduce the decoding complexity, balance the performance of a small amount of retransmission and a large amount of retransmission, and improve the decoding performance. In addition, when decoding the symbol sequence, the receiving device can use the same method as the transmitting device to determine the first bit of the X groups and the second bit of the X groups of bits, and then perform decoding based on the check relationship between the first bit of the X groups of bits and the second bit of the X groups of bits, thereby reducing decoding complexity and improving decoding performance.

[0321] The following describes a communication method provided in an embodiment of the present application, taking Polar codes that support self-decoding as an example and referring to FIG10 . As shown in FIG10 , the method may include:

[0322] Step 1001: The transmitting end device determines K first bits according to a reliability sequence of length N1.

[0323] The description of step 1001 may refer to the above description of step 801 and will not be repeated here.

[0324] Step 1002: The transmitting end device determines K second bits according to a reliability sequence of length N2.

[0325] The description of step 1002 may refer to the above description of step 802 and will not be repeated here.

[0326] Step 1003: The transmitting end device divides the bits of the first sequence of length (N2-N1) into X groups of bits.

[0327] The X groups of bits include A second bits among the K second bits, and X≥2.

[0328] The description of step 1003 may refer to the above description of step 803 and will not be repeated here.

[0329] Step 1004: The transmitting end device divides A first bits out of the K first bits into X groups of first bits.

[0330] The number of first bits included in the x-th group of first bits is the same as the number of second bits included in the x-th group of bits, where x=1, 2, . . . , X.

[0331] The description of step 1004 may refer to the above description of step 804 and will not be repeated here.

[0332] Step 1005: The transmitting device maps the information bit corresponding to the first bit of the x-th group to the third bit of the x-th group in a fifth sequence of length N2 according to the information bit sequence of length K, and maps the copy of the information bit corresponding to the first bit of the x-th group to the second bit of the x-th group of bits in the fifth sequence, to obtain a sixth sequence.

[0333] The third bit of the xth group corresponds to the first bit of the xth group. For example, the third bit corresponding to the first bit numbered i is numbered i+N2-N1, where 0≤i≤N1-1.

[0334] The transmitting end device may use the third bit of the xth group in the fifth sequence as the information bit, and map the information bit corresponding to the first bit of the xth group to the third bit of the xth group in the fifth sequence, where x = 1, 2, ..., X. The transmitting end device may also use the second bit of the xth group of bits in the fifth sequence as the information bit, and map a copy of the information bit corresponding to the first bit of the xth group to the second bit of the xth group of bits in the fifth sequence, where x = 1, 2, ..., X.

[0335] Optionally, the transmitting device can also map KA information bits other than A information bits in the information bit sequence (or can also be described as information bits corresponding to KA first bits other than A first bits in the K first bits) to KA second bits other than A second bits in the K second bits of the fifth sequence.

[0336] Optionally, the transmitting device may further set the values ​​of N2-KA bits in the fifth sequence except the second bit in the X groups of bits, the third bit in the X groups, and KA second bits to 0 to obtain a sixth sequence.

[0337] For example, K is 15, N1 is 16, N2 is 32, and the first bits of the X groups are The second bits in the X groups of bits are Taking the KA second bits as {31 30 29 27 23 28 22 25 26 21 19} as an example, the transmitting device can determine that the X groups of third bits are {24 20} and {18 17}, respectively. Based on this, as shown by the bits filled with Figure 1 in Figure 11, the transmitting device can map the information bits at bits 8 and 4 in the fourth sequence of length 16 to bits 24 and 20 in the fifth sequence of length 32; and map the information bits at bits 2 and 1 in the fourth sequence to bits 18 and 17 in the fifth sequence.

[0338] As shown in the bits filled with Figure 3 in Figure 11, the transmitting device can also map the copy bits of the information bits located at the 8th and 4th bits in the fourth sequence to the 11th and 13th bits of the fifth sequence; and map the copy bits of the information bits located at the 2nd and 1st bits in the fourth sequence to the 14th and 15th bits of the fifth sequence.

[0339] As shown in the bits filled with Figure 2 in Figure 11, the transmitting device may also map the 11 information bits in the fourth sequence, excluding the information bits located at bits 8, 4, 2, and 1, to bits 31, 30, 29, 27, 23, 28, 22, 25, 26, 21, and 19 of the fifth sequence. The transmitting device may also set the values ​​of the remaining 13 bits in the fifth sequence to 0 to obtain a sixth sequence.

[0340] Optionally, the transmitting end device may interleave and map the information bits corresponding to the first bit position of the xth group to the third bit position of the xth group according to the second interleaving pattern.

[0341] In a first possible design, the transmitting device may interleave and map the information bit corresponding to the first bit position of the xth group to the third bit position of the xth group using a reverse mapping relationship according to the second interleaving pattern.

[0342] Exemplarily, the transmitting device may, according to the second interleaving pattern, use a reverse mapping relationship to interleave and map the information bits corresponding to the first bit in the first bit of the xth group, which is numbered in ascending order, to the third bit in the third bit of the xth group, which is numbered in descending order.

[0343] In the second possible design, the transmitting device may also interleave the first bit of the xth group according to the second interleaving pattern, and map the information bits corresponding to the interleaved first bit of the xth group to the third bit of the xth group in a certain order (such as from front to back, or from back to front).

[0344] Exemplarily, the transmitting device may interleave the first bit of the xth group with the bit as the granularity according to the second interleaving pattern to obtain the interleaved first bit of the xth group, and map the information bits corresponding to the interleaved first bit of the xth group to the third bit of the xth group in a certain order.

[0345] In another example, the transmitting device may also interleave the first bit of the xth group based on the second interleaving pattern with a sub-block as the granularity, that is, divide the first bit of the xth group into multiple sub-blocks, interleave the multiple sub-blocks to obtain the interleaved first bit of the xth group, and map the information bits corresponding to the interleaved first bit of the xth group to the third bit of the xth group in a certain order.

[0346] In a third possible design, similar to the above-mentioned sending end device dividing A first bits and A third bits into X groups of first bits and X groups of third bits respectively during bit mapping and performing mapping based on bit groups, when the sending end device maps the information bits corresponding to the x-th group of first bits to the x-th group of third bits, it may also divide the x-th group of first bits and the x-th group of third bits into multiple sub-blocks, and perform bit mapping based on the sub-blocks according to the second interleaving pattern. That is, the information bits corresponding to the first sub-block in the x-th group of first bits may be interleaved and mapped to the first sub-block in the x-th group of third bits, ..., and the information bits corresponding to the last sub-block in the x-th group of first bits may be interleaved and mapped to the last sub-block in the x-th group of third bits.

[0347] Optionally, the transmitting end device may also interleave and map the copy of the information bit corresponding to the first bit of the x-th group to the second bit in the x-th group of bits according to the second interleaving pattern.

[0348] Among them, the description of this optional solution can refer to the relevant description in the above step 805 of the transmitting device interleaving and mapping the information bit corresponding to the first bit of the xth group to the second bit of the xth group of bits, which is not repeated here.

[0349] Optionally, the transmitting device may also interleave and map the information bits corresponding to KA first bits other than A first bits in the K second bits to KA second bits other than A second bits in the K second bits of the fifth sequence according to the second interleaving pattern.

[0350] In a first possible design, the transmitting device may interleave and map the information bits corresponding to the KA first bits to the KA second bits using a reverse mapping relationship according to the second interleaving pattern.

[0351] Exemplarily, the transmitting device may use a reverse mapping relationship according to the first interleaving pattern to interleave and map the information bits corresponding to the first bits in the KA first bits, which are numbered in ascending order, to the second bits in the KA second bits, which are numbered in descending order.

[0352] In the second possible design, the transmitting device may also interleave the KA first bits according to the second interleaving pattern, and map the information bits corresponding to the interleaved KA first bits to the KA second bits in a certain order (such as from front to back, or from back to front).

[0353] Exemplarily, the transmitting device may interleave KA first bits according to a second interleaving pattern with bit granularity to obtain KA interleaved first bits, and map the information bits corresponding to the KA interleaved first bits to KA second bits in a certain order.

[0354] In another example, the transmitting device may also interleave the KA first bit positions based on the second interleaving pattern with sub-blocks as the granularity, that is, divide the KA first bit positions into multiple sub-blocks, interleave the multiple sub-blocks to obtain the interleaved KA first bit positions, and map the information bits corresponding to the interleaved KA first bit positions to the KA second bit positions in a certain order.

[0355] In a third possible design, similar to the above-mentioned sending end device dividing A first bits and A second bits into X groups of first bits and X groups of second bits respectively when performing bit mapping, and performing mapping based on bit groups, when the sending end device maps the information bits corresponding to KA first bits to KA second bits, it can also divide the KA first bits and KA second bits into multiple sub-blocks respectively, and perform bit mapping based on sub-blocks according to a second interleaving pattern, that is, the information bit corresponding to the first sub-block of the KA first bits can be interleaved and mapped to the first sub-block of the KA second bits, ..., and the information bit corresponding to the last sub-block of the KA first bits can be interleaved and mapped to the last sub-block of the KA second bits.

[0356] Based on the above description of the second interleaving pattern, illustratively, the second interleaving pattern may be one or more of the following: a random interleaving pattern, a triangular interleaving pattern, a row-column interleaving pattern, or a reverse interleaving pattern, etc., without limitation.

[0357] Optionally, different from the above interleaving, the transmitting device may also scramble the information bits corresponding to the first bit of the X group, map the scrambled information bits corresponding to the first bit of the X group to the third bit of the X group in the fifth sequence, scramble the copy of the information bits corresponding to the first bit of the X group, and map the scrambled copy to the second bit of the X group of bits in the fifth sequence.

[0358] Optionally, the transmitting device may also scramble the information bits corresponding to the KA first bits, and map the scrambled information bits to the KA second bits.

[0359] It can be understood that, during the above-mentioned interleaving or scrambling process, any one of the information bits corresponding to the first bit positions of the X groups, the copy bits of the information bits corresponding to the first bit positions of the X groups, and the information bits corresponding to the KA first bits can be interleaved or scrambled. Alternatively, any two of them can be interleaved or scrambled, or all three can be interleaved or scrambled, without limitation.

[0360] Step 1006: The transmitting device performs polarization coding on the sixth sequence to obtain a coded bit sequence.

[0361] The sixth sequence of length N2 may include two RV versions, each of which can be decoded independently. The two RV versions can also be combined as a long code for enhanced decoding. The transmitting device may perform polarization coding on the sixth sequence including the two RV versions to obtain a coded bit sequence.

[0362] Exemplarily, as shown in FIG11 , the sixth sequence of length 32 may include RV version 1 of length 16 and RV version 2 of length 16. Each RV version may be decoded independently, and the two RV versions may also be combined as a long code for enhanced decoding.

[0363] Step 1007: The transmitting device sends one or more bits in the coded bit sequence to the receiving device; correspondingly, the receiving device receives the symbol sequence from the transmitting device.

[0364] Step 1008: The receiving end device determines K first bits according to the reliability sequence of length N1, and determines K second bits according to the reliability sequence of length N2.

[0365] The receiving device may adopt the same method as the transmitting device to determine the K first bits and the K second bits with reference to the above steps 801 and 802, which will not be described in detail.

[0366] Step 1009: The receiving end device divides the bits of the first sequence of length (N2-N1) into X groups of bits; and divides A first bits of the K first bits into X groups of first bits.

[0367] Step 1010: The receiving end device decodes the symbol sequence according to the second bit in the X groups of bits and the third bit in the X groups of bits.

[0368] The receiving device may adopt the same method as the transmitting device, referring to steps 803 and 804 above, to determine the second bit in the X groups of bits and the third bit in the X groups of bits, and then decode the symbol sequence according to the second bit in the X groups of bits and the third bit in the X groups of bits.

[0369] The receiving end device may perform self-decoding according to RV version 1 or RV version 2 of the sixth sequence alone, or may use RV version 1 and RV version 2 together as a long code for enhanced decoding.

[0370] Exemplarily, the receiving device may decode the RV version 1 in the received symbol sequence according to the second bit in the X groups of bits.

[0371] In another example, the receiving device may also decode the RV version 2 in the received symbol sequence according to the X groups of third bits and KA second bits among the K second bits.

[0372] In another example, the receiving device may also use RV version 1 and RV version 2 in the received symbol sequence together as a long code, and decode the long code according to the second bit in the X groups of bits and the third bit in the X groups of bits.

[0373] When decoding the long code, the receiving device may determine the information bit located at the second bit position of the long code based on the second bit position in the determined X groups of bits. Since the transmitting device simultaneously maps A information bits of the information bit sequence of length K to the third bit position in the X groups and the second bit position in the X groups of bits when encoding the information bit sequence, a corresponding parity check relationship exists between the third bit position in the X groups of bits and the second bit position in the X groups of bits. Therefore, based on this parity check relationship, the receiving device may determine the information bit located at the third bit position in the X groups of bits of the long code based on the information bit located at the second bit position in the X groups of bits, thereby achieving decoding.

[0374] Based on the method shown in FIG10 above, a portion of the information bits (such as A information bits) of the information bit sequence of length K can be simultaneously mapped to the A second bits of RV version 1 and the A third bits of RV version 2, that is, the information bits on the A second bits of the sixth sequence and the information bits on the A third bits have a corresponding check relationship, thereby reducing the decoding complexity and improving the decoding performance. At the same time, when performing bit mapping, the present application can also perform hierarchical mapping, that is, the A first bits can be divided into X groups of first bits, the bits of the first sequence can be divided into X groups of bits, and the A third bits can be divided into X groups of third bits. In this way, the transmitting end device can map the information bit corresponding to the first bit of the xth group to the third bit of the xth group of the fifth sequence, and map the copy bit of the information bit corresponding to the first bit of the xth group to the second bit of the xth group of bits of the fifth sequence, thereby realizing hierarchical mapping, thereby reducing the decoding complexity and improving the decoding performance. In addition, when decoding the symbol sequence, the receiving device can use the same method as the transmitting device to determine the second bit in the X groups of bits and the third bit in the X groups of bits, and then perform decoding based on the check relationship between the second bit in the X groups of bits and the third bit in the X groups of bits, thereby reducing decoding complexity and improving decoding performance.

[0375] In addition, an embodiment of the present application further provides a communication method based on interleaving processing, as shown in FIG12 , which may include:

[0376] Step 1201: The transmitting end device divides the bits of the seventh sequence of length N into X groups of bits, and divides A information bits in the information bit sequence of length K into X groups of information bits.

[0377] The number of information bits included in the x-th group of bits is equal to the number of information bits included in the x-th group of information bits; x=1, 2, ..., X; X≥2.

[0378] Optionally, the transmitting device may perform sub-block interleaving on the seventh sequence, and divide the bits of the interleaved seventh sequence into X groups of bits.

[0379] Step 1202: The transmitting end device interleaves and maps the xth group of information bits onto the information bits in the xth group of bits of the seventh sequence according to the interleaving pattern to obtain an eighth sequence.

[0380] Illustratively, the interleaving pattern may be one or more of the following: a random interleaving pattern, a triangular interleaving pattern, a row-column interleaving pattern, or a reverse interleaving pattern.

[0381] When encoding the information bit sequence, the transmitting device can perform interleaving according to the interleaving pattern to reduce decoding complexity and improve decoding performance. When performing bit mapping, the present application can also adopt a bit grouping processing method to achieve layered mapping, thereby reducing decoding complexity and improving decoding performance.

[0382] Step 1203: The transmitting end device performs polarization coding on the eighth sequence to obtain a coded bit sequence.

[0383] Step 1204: The transmitting device sends one or more bits in the coded bit sequence to the receiving device; correspondingly, the receiving device receives the symbol sequence from the transmitting device.

[0384] Step 1205: The receiving device divides the bits of the seventh sequence of length N into X groups of bits.

[0385] Step 1206: The receiving device decodes the symbol sequence according to the information bits in the X groups of bits.

[0386] Specifically, because the transmitting device groups A information bits in the information bit sequence when encoding the information bit sequence, and interleaves and maps them to the information bits in the X bit groups according to the interleaving pattern, the receiving device can use the same method as the transmitting device to determine the information bits in the X bit groups when decoding the symbol sequence, and then decode the symbol sequence according to the interleaving pattern and the information bits in the X bit groups, thereby reducing decoding complexity and improving decoding performance.

[0387] It should be noted that the various embodiments of this application can be implemented independently or in combination, without limitation. Unless otherwise specified or there is a logical conflict, the terms and / or descriptions of the different embodiments provided in this application are consistent and can be referenced by each other. The technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships.

[0388] It is understood that in the embodiments of the present application, the execution subject may perform some or all of the steps in the embodiments of the present application. These steps or operations are merely examples, and the embodiments of the present application may also perform other operations or variations of various operations. In addition, the various steps may be performed in a different order than those presented in the embodiments of the present application, and it is possible that not all operations in the embodiments of the present application need to be performed.

[0389] The above mainly introduces the solution provided by the embodiment of the present application from the perspective of interaction between devices. It is understandable that, in order to realize the above functions, each device includes a hardware structure and / or software module corresponding to the execution of each function. Those skilled in the art should easily realize that, in combination with the algorithm steps of each example described in the embodiments disclosed herein, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0390] The embodiments of the present application can divide the functional modules of each device according to the above method examples. For example, each functional module can be divided according to each function, or two or more functions can be integrated into one processing module. The above integrated modules can be implemented in the form of hardware or in the form of software functional modules. It should be noted that the division of modules in the embodiments of the present application is schematic and is only a logical function division. In actual implementation, there may be other division methods.

[0391] In the case of dividing each functional module according to each function, Figure 13 shows a sending end device 130, which can execute the actions performed by the sending end device in the method shown in Figures 8 to 12 above. All relevant contents of each step involved in the above method embodiment can be referred to the functional description of the corresponding functional module. The technical effects that can be obtained can be referred to the above method embodiment and will not be repeated here.

[0392] The transmitting device 130 may include a transceiver module 1301 and a processing module 1302. Exemplarily, the transmitting device 130 may be a communications device, or a chip used in a communications device, or other combined device or component having the aforementioned functions of the transmitting device. When the transmitting device 130 is a communications device, the transceiver module 1301 may be a transceiver, which may include an antenna and radio frequency circuits, etc.; the processing module 1302 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the transmitting device 130 is a component having the aforementioned functions of the transmitting device, the transceiver module 1301 may be a radio frequency unit; the processing module 1302 may be a processor (or processing circuit), such as a baseband processor. When the transmitting device 130 is a system-on-chip (SoC), the transceiver module 1301 may be the input / output interface of the chip (e.g., a baseband chip); the processing module 1302 may be the system-on-chip's processor (or processing circuit), which may include one or more central processing units. It should be understood that the transceiver module 1301 in the embodiment of the present application can be implemented by a transceiver or a transceiver-related circuit component; the processing module 1302 can be implemented by a processor or a processor-related circuit component (or, referred to as a processing circuit).

[0393] For example, the transceiver module 1301 can be used to perform all transceiver operations performed by the transmitting device in the embodiments shown in Figures 8 to 12, and / or to support other processes of the technology described in this document; the processing module 1302 can be used to perform all operations other than transceiver operations performed by the transmitting device in the embodiments shown in Figures 8 to 12, and / or to support other processes of the technology described in this document.

[0394] In a first possible example, the processing module 1302 may be configured to determine K first bits based on a reliability sequence of length N1, and to determine K second bits based on a reliability sequence of length N2, where K≤N1<N2. The processing module 1302 may also be configured to divide bits of a first sequence of length (N2-N1) into X groups of bits, and to divide A first bits of the K first bits into X groups of first bits, where the X groups of bits include A second bits of the K second bits, the number of first bits included in the xth group of first bits is the same as the number of second bits included in the xth group of bits, and X≥2, x=1, 2, ..., X. The processing module 1302 may also be configured to map, based on an information bit sequence of length K, information bits corresponding to the xth group of first bits to second bits in the xth group of bits of the first sequence, to obtain a second sequence; and perform polarization coding on the second sequence to obtain a coded bit sequence. The transceiver module 1301 may be configured to send one or more bits of the coded bit sequence to a receiving device.

[0395] In one possible design, the processing module 1302 may also be configured to interleave and map the information bits corresponding to the first bit positions of the x-th group to the second bit positions in the x-th group of bits according to the first interleaving pattern.

[0396] In one possible design, the processing module 1302 can also be used to interleave and map the information bits corresponding to the first bits in the first bit positions of the xth group, which are sorted in ascending order according to the first interleaving pattern, onto the second bits in the xth group, which are sorted in descending order according to the first interleaving pattern.

[0397] In one possible design, processing module 1302 can also be used to map the information bit sequence to the K first bits of a third sequence of length N1 to obtain a fourth sequence; and determine the information bit corresponding to the first bit of the xth group based on the information bits corresponding to A first bits among the K first bits.

[0398] In one possible design, the processing module 1302 may further be configured to perform an XOR operation on the second sequence and the fourth sequence to obtain an XOR-processed sequence; and perform polarization coding on the XOR-processed sequence to obtain a coded bit sequence.

[0399] In one possible design, the processing module 1302 may further be configured to perform polarization coding on the second sequence to obtain a first polarization sequence; perform polarization coding on the fourth sequence to obtain a second polarization sequence; and perform an XOR operation on the first polarization sequence and the second polarization sequence to obtain a coded bit sequence.

[0400] In a second possible example, the processing module 1302 may be configured to determine K first bits based on a reliability sequence having a length of N1, and to determine K second bits based on a reliability sequence having a length of N2; K≤N1<N2; the processing module 1302 may also be configured to divide the bits of the first sequence having a length of (N2-N1) into X groups of bits; and to divide A first bits of the K first bits into X groups of first bits; wherein the X groups of bits include A second bits of the K second bits, the number of first bits included in the xth group of first bits is the same as the number of second bits included in the xth group of bits, and X ≥2, x=1, 2, ..., X; the processing module 1302 may further be configured to, based on an information bit sequence of length K, map the information bit corresponding to the first bit of the x-th group to the third bit of the x-th group in a fifth sequence of length N2, map a copy of the information bit corresponding to the first bit of the x-th group to the second bit of the x-th group of bits in the fifth sequence, to obtain a sixth sequence, and perform polarization coding on the sixth sequence to obtain a coded bit sequence; the transceiver module 1301 may be configured to send one or more bits in the coded bit sequence to a receiving device, wherein the third bit of the x-th group corresponds to the first bit of the x-th group.

[0401] In one possible design, the processing module 1302 can also be used to interleave and map the information bits corresponding to the first bit position of the xth group to the third bit position of the xth group in the fifth sequence according to the second interleaving pattern, and interleave and map the copy bits of the information bits corresponding to the first bit position of the xth group to the second bit position in the xth group of bits in the fifth sequence.

[0402] In one possible design, processing module 1302 can also be used to map the information bit sequence to the K first bits of a third sequence of length N1 to obtain a fourth sequence; and determine the information bit corresponding to the first bit of the xth group based on the information bits corresponding to A first bits among the K first bits.

[0403] In one possible design, processing module 1302 may further be configured to map KA information bits in the information bit sequence, excluding the A information bits corresponding to the X groups of first bits, to KA second bits excluding the A second bits among the K second bits of the fifth sequence.

[0404] Based on the above first possible example and the second possible example, in one possible design, A first bits are determined based on K first bits and K second bits.

[0405] Based on the above-mentioned first possible example and the second possible example, in a possible design, the processing module 1302 can also be used to determine K third bits based on the K first bits; wherein the third bit corresponding to the first bit numbered i is numbered i+N2-N1, 0≤i≤N1-1; the processing module 1302 can also be used to determine A first bits based on A third bits; wherein the first bit corresponding to the third bit numbered j is numbered j-(N2-N1), N2-N1≤j≤N2-1; the A third bits are bits in the K third bits that are numbered differently from the K second bits.

[0406] Based on the first possible example and the second possible example, in one possible design, the A first bits are the last A bits of the K first bits sorted in descending order of reliability.

[0407] Based on the above first possible example and the second possible example, in one possible design, A second bits are determined based on K first bits and K second bits.

[0408] Based on the above-mentioned first possible example and the second possible example, in one possible design, the processing module 1302 can also be used to determine K third bits based on the K first bits; wherein the third bit corresponding to the first bit numbered i is numbered i+N2-N1, 0≤i≤N1-1; the processing module 1302 can also be used to determine A second bits based on the K third bits; wherein the A second bits are bits in the K second bits that are numbered differently from the K third bits.

[0409] Based on the above first possible example and the second possible example, in one possible design, the A second bits are the A bits whose numbers are less than N2-N1 among the K second bits.

[0410] Based on the above-mentioned first possible example and the second possible example, in one possible design, the processing module 1302 can also be used to divide the A first bits into X groups of first bits according to reliability; wherein the reliability of the first bits in the x+1th group is higher than the reliability of the first bits in the xth group.

[0411] Based on the first possible example and the second possible example described above, in one possible design, the processing module 1302 may further be configured to perform sub-block interleaving on the first sequence according to a third interleaving pattern, and divide the bits of the interleaved first sequence into X groups of bits; wherein the xth group of bits includes Yx sub-blocks, and Yx is a positive integer.

[0412] Based on the foregoing first possible example and the second possible example, in one possible design, the third interleaving pattern is any of the following sub-block interleaving patterns: [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]; or, [0 4 8 12 1 5 9 13 2 6 10 14 3 7 11 15 16 20 24 28 17 21 25 29 18 22 26 30 19 23 27 31]; or, [0 8 16 24 1 9 17 25 2 10 18 26 3 11 19 27 4 12 20 28 5 13 21 29 6 14 22 30 7 15 23 31].

[0413] Based on the above-mentioned first possible example and the second possible example, in one possible design, the processing module 1302 can also be used to divide the bits of the first sequence into X groups of bits according to preset configuration information; or divide the bits of the first sequence into X groups of bits according to retransmission resources.

[0414] Based on the foregoing first possible example and second possible example, in one possible design, among the X groups of bits, there is at least one group of bits whose length is an integer power of 2.

[0415] Based on the foregoing first possible example and second possible example, in one possible design, the length of a first group of bits in the X groups of bits is an integer power of 2.

[0416] Based on the first possible example and the second possible example, in one possible design, the length from the first group of bits to the x'th group of bits in the X groups of bits is an integer power of 2, 2≤x'≤X.

[0417] Based on the above first possible example and the second possible example, in one possible design, X is equal to 2, the first group of bits in the X groups of bits includes (N2-N1) / 8 bits of the first sequence, and the second group of bits includes 7(N2-N1) / 8 bits of the first sequence.

[0418] Based on the above first possible example and the second possible example, in one possible design, X is equal to 3, the first group of bits in the X groups of bits includes (N2-N1) / 8 bits of the first sequence, the second group of bits includes (N2-N1) / 8 bits of the first sequence, and the third group of bits includes 3(N2-N1) / 4 bits of the first sequence.

[0419] Based on the above first possible example and the second possible example, in one possible design, X is equal to 4, the first group of bits in the X groups of bits includes (N2-N1) / 8 bits of the first sequence, the second group of bits includes (N2-N1) / 8 bits of the first sequence, the third group of bits includes (N2-N1) / 4 bits of the first sequence, and the fourth group of bits includes (N2-N1) / 2 bits of the first sequence.

[0420] Based on the above first possible example and the second possible example, in one possible design, X is equal to 2, the first group of bits in the X groups of bits includes (N2-N1) / 4 bits of the first sequence, and the second group of bits includes 3(N2-N1) / 4 bits of the first sequence.

[0421] In a third possible example, the processing module 1302 is configured to divide bits of a seventh sequence of length N into X groups of bits, and to divide A information bits in an information bit sequence of length K into X groups of information bits; wherein the number of information bits included in the x-th group of bits is equal to the number of information bits included in the x-th group of information bits; x=1, 2, ..., X; and X≥2; the processing module 1302 is further configured to interleave and map the x-th group of information bits onto information bits in the x-th group of bits of the seventh sequence according to an interleaving pattern to obtain an eighth sequence; and perform polarization coding on the eighth sequence to obtain a coded bit sequence. The transceiver module 1301 is configured to send one or more bits in the coded bit sequence to a receiving device.

[0422] In one possible design, the processing module 1302 may also be configured to perform sub-block interleaving on the seventh sequence, and divide the bits of the interleaved seventh sequence into X groups of bits.

[0423] In one possible design, the interleaving pattern is one or more of the following: a random interleaving pattern, a triangular interleaving pattern, a row-column interleaving pattern, or a reverse interleaving pattern.

[0424] Figure 14 shows a receiving end device 140, which can execute the actions executed by the receiving end device in the method shown in Figures 8 to 12 above. All relevant contents of each step involved in the above method embodiment can be referred to the functional description of the corresponding functional module. The technical effects that can be obtained can refer to the above method embodiment and will not be repeated here.

[0425] The receiving device 140 may include a transceiver module 1401 and a processing module 1402. Exemplarily, the receiving device 140 may be a communications device, or a chip used in a communications device, or other combined device or component having the aforementioned functions of the receiving device. When the receiving device 140 is a communications device, the transceiver module 1401 may be a transceiver, which may include an antenna and radio frequency circuits, etc.; the processing module 1402 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the receiving device 140 is a component having the aforementioned functions of the receiving device, the transceiver module 1401 may be a radio frequency unit; the processing module 1402 may be a processor (or processing circuit), such as a baseband processor. When the receiving device 140 is a system-on-chip (SoC), the transceiver module 1401 may be the input / output interface of the chip (e.g., a baseband chip); the processing module 1402 may be the system-on-chip's processor (or processing circuit), which may include one or more central processing units. It should be understood that the transceiver module 1401 in the embodiment of the present application can be implemented by a transceiver or a transceiver-related circuit component; the processing module 1402 can be implemented by a processor or a processor-related circuit component (or, referred to as a processing circuit).

[0426] For example, the transceiver module 1401 can be used to perform all transceiver operations performed by the receiving device in the embodiments shown in Figures 8 to 12, and / or to support other processes of the technology described in this document; the processing module 1402 can be used to perform all operations other than transceiver operations performed by the receiving device in the embodiments shown in Figures 8 to 12, and / or to support other processes of the technology described in this document.

[0427] In a first possible example, the transceiver module 1401 is configured to receive a symbol sequence from a transmitting device, wherein the length of the information bit sequence corresponding to the symbol sequence is K. The processing module 1402 is configured to determine K first bits based on a reliability sequence having a length of N1, and to determine K second bits based on a reliability sequence having a length of N2, where K≤N1<N2. The processing module 1402 is further configured to divide the bits of the first sequence having a length of (N2-N1) into X groups of bits, and to divide A first bits of the K first bits into X groups of first bits, wherein the X groups of bits include A second bits of the K second bits, the number of first bits included in the xth group of first bits is the same as the number of second bits included in the xth group of bits, and X≥2, x=1, 2, ..., X. The processing module 1402 is further configured to decode the symbol sequence based on the second bits in the X groups of bits and the X groups of first bits.

[0428] In a second possible example, the transceiver module 1401 is configured to receive a symbol sequence from a transmitting device; wherein the length of the information bit sequence corresponding to the symbol sequence is K; the processing module 1402 is configured to determine K first bits according to a reliability sequence having a length of N1, and to determine K second bits according to a reliability sequence having a length of N2; K≤N1<N2; the processing module 1402 is further configured to divide the bits of the first sequence having a length of (N2-N1) into X groups of bits; and to divide A second bits of the K first bits into X groups of bits. A bit is divided into X groups of first bits; wherein the X groups of bits include A second bits out of the K second bits, the number of first bits included in the x-th group of first bits is the same as the number of second bits included in the x-th group of bits, and X ≥ 2, x = 1, 2, ..., X; the processing module 1402 is further configured to decode the symbol sequence according to the second bits in the X groups of bits and the X groups of third bits; wherein the x-th group of third bits corresponds to the x-th group of first bits, and X ≥ 2, x = 1, 2, ..., X.

[0429] Based on the above first possible example and the second possible example, in one possible design, A first bits are determined based on K first bits and K second bits.

[0430] Based on the above-mentioned first possible example and the second possible example, in a possible design, the processing module 1402 can also be used to determine K third bits based on the K first bits; wherein the third bit corresponding to the first bit numbered i is numbered i+N2-N1, 0≤i≤N1-1; the processing module 1402 can also be used to determine A first bits based on A third bits; wherein the first bit corresponding to the third bit numbered j is numbered j-(N2-N1), N2-N1≤j≤N2-1; the A third bits are bits in the K third bits that are numbered differently from the K second bits.

[0431] Based on the first possible example and the second possible example, in one possible design, the A first bits are the last A bits of the K first bits sorted in descending order of reliability.

[0432] Based on the above first possible example and the second possible example, in one possible design, A second bits are determined based on K first bits and K second bits.

[0433] Based on the above-mentioned first possible example and the second possible example, in one possible design, the processing module 1402 can also be used to determine K third bits based on the K first bits; wherein the third bit corresponding to the first bit numbered i is numbered i+N2-N1, 0≤i≤N1-1; the processing module 1402 can also be used to determine A second bits based on the K third bits; wherein the A second bits are bits in the K second bits that are numbered differently from the K third bits.

[0434] Based on the above first possible example and the second possible example, in one possible design, the A second bits are the A bits whose numbers are less than N2-N1 among the K second bits.

[0435] Based on the first possible example and the second possible example described above, in one possible design, the processing module 1402 can also be used to divide the A first bits into X groups of first bits according to their reliability; wherein the reliability of the first bits in the x+1th group is higher than the reliability of the first bits in the xth group.

[0436] Based on the first possible example and the second possible example described above, in one possible design, the processing module 1402 may further be configured to perform sub-block interleaving on the first sequence according to a third interleaving pattern, and divide the bits of the interleaved first sequence into X groups of bits; wherein the xth group of bits includes Yx sub-blocks, where Yx is a positive integer.

[0437] Based on the foregoing first possible example and the second possible example, in one possible design, the third interleaving pattern is any of the following sub-block interleaving patterns: [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]; or, [0 4 8 12 1 5 9 13 2 6 10 14 3 7 11 15 16 20 24 28 17 21 25 29 18 22 26 30 19 23 27 31]; or, [0 8 16 24 1 9 17 25 2 10 18 26 3 11 19 27 4 12 20 28 5 13 21 29 6 14 22 30 7 15 23 31].

[0438] Based on the above-mentioned first possible example and the second possible example, in one possible design, the processing module 1402 can also be used to divide the bits of the first sequence into X groups of bits according to preset configuration information; or divide the bits of the first sequence into X groups of bits according to retransmission resources.

[0439] Based on the foregoing first possible example and second possible example, in one possible design, among the X groups of bits, there is at least one group of bits whose length is an integer power of 2.

[0440] Based on the foregoing first possible example and second possible example, in one possible design, the length of a first group of bits in the X groups of bits is an integer power of 2.

[0441] Based on the first possible example and the second possible example, in one possible design, the length from the first group of bits to the x'th group of bits in the X groups of bits is an integer power of 2, 2≤x'≤X.

[0442] Based on the above first possible example and the second possible example, in one possible design, X is equal to 2, the first group of bits in the X groups of bits includes (N2-N1) / 8 bits of the first sequence, and the second group of bits includes 7(N2-N1) / 8 bits of the first sequence.

[0443] Based on the above first possible example and the second possible example, in one possible design, X is equal to 3, the first group of bits in the X groups of bits includes (N2-N1) / 8 bits of the first sequence, the second group of bits includes (N2-N1) / 8 bits of the first sequence, and the third group of bits includes 3(N2-N1) / 4 bits of the first sequence.

[0444] Based on the above first possible example and the second possible example, in one possible design, X is equal to 4, the first group of bits in the X groups of bits includes (N2-N1) / 8 bits of the first sequence, the second group of bits includes (N2-N1) / 8 bits of the first sequence, the third group of bits includes (N2-N1) / 4 bits of the first sequence, and the fourth group of bits includes (N2-N1) / 2 bits of the first sequence.

[0445] Based on the above first possible example and the second possible example, in one possible design, X is equal to 2, the first group of bits in the X groups of bits includes (N2-N1) / 4 bits of the first sequence, and the second group of bits includes 3(N2-N1) / 4 bits of the first sequence.

[0446] In a third possible example, the transceiver module 1401 is further used to receive a symbol sequence from a transmitting device; the processing module is used to divide the bits of the seventh sequence of length N into X groups of bits, where X ≥ 2; and the processing module 1402 is further used to decode the symbol sequence according to the information bits in the X groups of bits.

[0447] In one possible design, the processing module 1402 may also be configured to perform sub-block interleaving on the seventh sequence, and divide the bits of the interleaved seventh sequence into X groups of bits.

[0448] In one possible design, the interleaving pattern is one or more of the following: a random interleaving pattern, a triangular interleaving pattern, a row-column interleaving pattern, or a reverse interleaving pattern.

[0449] As another possible implementation, transceiver module 1301 in Figure 13 can be replaced by a transceiver that integrates the functionality of transceiver module 1301; processing module 1302 can be replaced by a processor that integrates the functionality of processing module 1302. Furthermore, transmitting device 130 shown in Figure 13 can also include memory. Alternatively, transceiver module 1401 in Figure 14 can be replaced by a transceiver that integrates the functionality of transceiver module 1401; processing module 1402 can be replaced by a processor that integrates the functionality of processing module 1402. Furthermore, receiving device 140 shown in Figure 14 can also include memory.

[0450] Alternatively, when the processing module 1302 is replaced by a processor and the transceiver module 1301 is replaced by a transceiver, the transmitting device 130 involved in the embodiment of the present application may also be the communication device 150 shown in Figure 15. Alternatively, when the processing module 1402 is replaced by a processor and the transceiver module 1401 is replaced by a transceiver, the receiving device 140 involved in the embodiment of the present application may also be the communication device 150 shown in Figure 15.

[0451] The processor may be a logic circuit 1501, and the transceiver may be an interface circuit 1502. Furthermore, the communication device 150 shown in FIG15 may further include a memory 1503.

[0452] The embodiments of the present application also provide a computer program product, which, when executed by a computer, can implement the functions of any of the above method embodiments.

[0453] The embodiments of the present application also provide a computer program, which, when executed by a computer, can implement the functions of any of the above method embodiments.

[0454] The embodiment of the present application also provides a computer-readable storage medium. All or part of the processes in the above-mentioned method embodiments can be completed by a computer program to instruct the relevant hardware, and the program can be stored in the above-mentioned computer-readable storage medium. When the program is executed, it can include the processes of the above-mentioned method embodiments. The computer-readable storage medium can be an internal storage unit of the terminal (including the data sending end and / or the data receiving end) of any of the above-mentioned embodiments, such as the hard disk or memory of the terminal. The above-mentioned computer-readable storage medium can also be an external storage device of the above-mentioned terminal, such as a plug-in hard disk equipped on the above-mentioned terminal, a smart memory card (smart media card, SMC), a secure digital (secure digital, SD) card, a flash card (flash card), etc. Further, the above-mentioned computer-readable storage medium can also include both the internal storage unit of the above-mentioned terminal and an external storage device. The above-mentioned computer-readable storage medium is used to store the above-mentioned computer program and other programs and data required by the above-mentioned terminal. The above-mentioned computer-readable storage medium can also be used to temporarily store data that has been output or is to be output.

[0455] It should be noted that the terms "first" and "second" in the specification, claims and drawings of this application are used to distinguish different objects, rather than to describe a specific order. "First" and "second" are used for descriptive purposes only and cannot be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Therefore, the features defined as "first" and "second" may explicitly or implicitly include one or more of the features. In the description of this embodiment, unless otherwise specified, "multiple" means two or more.

[0456] Furthermore, the terms "include," "comprise," and "have," and any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, product, or apparatus comprising a series of steps or elements is not limited to the listed steps or elements, but may optionally include steps or elements not listed, or may optionally include other steps or elements inherent to the process, method, product, or apparatus.

[0457] It should be understood that in this application, "at least one (item)" refers to one or more. "Multiple" refers to two or more. "At least two (items)" refers to two or three and more than three. "And / or" is used to describe the association relationship of associated objects, indicating that three relationships can exist. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following items" or similar expressions refers to any combination of these items, including any combination of single items or plural items. For example, at least one of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, c can be single or multiple. “When” and “if” both mean that corresponding measures will be taken under certain objective circumstances. They do not limit the time, nor do they require any judgment action when they are implemented, nor do they mean that there are other limitations.

[0458] In the embodiments of this application, words such as "exemplary" or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described as "exemplary" or "for example" in the embodiments of this application should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner to facilitate understanding.

[0459] In this application, "sending information to ... (a terminal device)" can be understood as the destination of the information being the terminal device. This can include sending information directly or indirectly to the terminal device. "Receiving information from ... (a terminal device)" can be understood as the source of the information being the terminal device. This can include receiving information directly or indirectly from the terminal device. The information may undergo necessary processing between the source and destination, such as formatting changes, but the destination can still understand the valid information from the source.

[0460] Through the description of the above implementation methods, technical personnel in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional modules is used as an example. In actual applications, the above-mentioned functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above.

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

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

[0463] In addition, the functional units in the various embodiments of the present application may be integrated into a single processing unit, or each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.

[0464] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application or all or part of the technical solution can be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for enabling a device (which can be a single-chip microcomputer, chip, etc.) or a processor to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a ROM, a RAM, a magnetic disk, or an optical disk.

Claims

1. A communication method, characterized in that: include: Determine K first bits according to a reliability sequence of length N1, and determine K second bits according to a reliability sequence of length N2; K is less than or equal to N1, and N1 is less than N2; Divide the bits of the first sequence of length (N2-N1) into X groups of bits, and divide A first bits of the K first bits into X groups of first bits; wherein the X groups of bits include A second bits of the K second bits, the number of first bits included in the xth group of first bits is the same as the number of second bits included in the xth group of bits, and X is greater than or equal to 2, and x=1, 2, ..., X; According to an information bit sequence of length K, mapping the information bit corresponding to the first bit of the x-th group to the second bit of the x-th group of bits of the first sequence to obtain a second sequence; performing polarization coding on the second sequence to obtain a coded bit sequence; One or more bits in the coded bit sequence are sent to a receiving device.

2. The method according to claim 1, characterized in that The mapping the information bit corresponding to the first bit of the x-th group to the second bit of the x-th group of bits of the first sequence includes: According to the first interleaving pattern, the information bits corresponding to the first bit positions of the x-th group are interleaved and mapped to the second bit positions in the x-th group of bits.

3. The method according to claim 2, characterized in that The step of interleaving and mapping the information bits corresponding to the first bit positions of the x-th group to the second bit positions in the x-th group of bits according to the first interleaving pattern includes: According to the first interleaving pattern, information bits corresponding to first bits in the x-th group of first bits, which are numbered in ascending order, are interleaved and mapped onto second bits in the x-th group of bits, which are numbered in descending order.

4. The method according to any one of claims 1 to 3, characterized in that: Mapping the information bit sequence to the K first bits of a third sequence of length N1 to obtain a fourth sequence; According to the information bits corresponding to the A first bits among the K first bits, the information bits corresponding to the x-th group of first bits are determined.

5. The method according to claim 4, characterized in that The performing polarization encoding on the second sequence includes: Performing an XOR process on the second sequence and the fourth sequence to obtain an XOR-processed sequence; Polar coding is performed on the sequence after the XOR processing to obtain a coded bit sequence.

6. The method according to claim 4, characterized in that The performing polarization encoding on the second sequence includes: Performing polarization encoding on the second sequence to obtain a first polarization sequence; Performing polarization encoding on the fourth sequence to obtain a second polarization sequence; An XOR process is performed on the first polarization sequence and the second polarization sequence to obtain a coded bit sequence.

7. A communication method, characterized in that: include: Receive a symbol sequence from a transmitting device; wherein the length of the information bit sequence corresponding to the symbol sequence is K; Determine K first bits according to a reliability sequence of length N1, and determine K second bits according to a reliability sequence of length N2; K is less than or equal to N1, and N1 is less than N2; Divide the bits of the first sequence of length (N2-N1) into X groups of bits, and divide A first bits of the K first bits into X groups of first bits; wherein the X groups of bits include A second bits of the K second bits, the number of first bits included in the xth group of first bits is the same as the number of second bits included in the xth group of bits, and X is greater than or equal to 2, and x=1, 2, ..., X; The symbol sequence is decoded according to a second bit in the X groups of bits and the X groups of first bits.

8. A communication method, characterized in that: include: Determine K first bits according to a reliability sequence of length N1, and determine K second bits according to a reliability sequence of length N2; K is less than or equal to N1, and N1 is less than N2; Divide the bits of the first sequence of length (N2-N1) into X groups of bits; divide A first bits of the K first bits into X groups of first bits; wherein the X groups of bits include A second bits of the K second bits, the number of first bits included in the xth group of first bits is the same as the number of second bits included in the xth group of bits, and X is greater than or equal to 2, and x=1, 2, ..., X; According to the information bit sequence of length K, the information bit corresponding to the first bit of the x-th group is mapped to the third bit of the x-th group in the fifth sequence of length N2, and the copy bit of the information bit corresponding to the first bit of the x-th group is mapped to the second bit of the x-th group of bits of the fifth sequence, to obtain a sixth sequence; wherein the third bit of the x-th group corresponds to the first bit of the x-th group; Performing polarization coding on the sixth sequence to obtain a coded bit sequence; One or more bits in the coded bit sequence are sent to a receiving device.

9. The method according to claim 8, characterized in that The step of mapping the information bit corresponding to the first bit of the x-th group to the third bit of the x-th group in a fifth sequence having a length of N2, and mapping the copy bit of the information bit corresponding to the first bit of the x-th group to the second bit of the x-th group of bits of the fifth sequence, comprises: According to the second interleaving pattern, the information bits corresponding to the first bit positions of the xth group are interleaved and mapped to the third bit positions of the xth group in the fifth sequence, and the copy bits of the information bits corresponding to the first bit positions of the xth group are interleaved and mapped to the second bit positions in the xth group of bits of the fifth sequence.

10. The method according to claim 8 or 9, characterized in that: Mapping the information bit sequence to the K first bits of a third sequence of length N1 to obtain a fourth sequence; According to the information bits corresponding to the A first bits among the K first bits, the information bits corresponding to the x-th group of first bits are determined.

11. The method according to any one of claims 8 to 10, characterized in that: The method further comprises: Mapping KA information bits in the information bit sequence except the A information bits corresponding to the X groups of first bits to KA second bits in the K second bits of the fifth sequence except the A second bits.

12. A communication method, characterized in that: include: Receive a symbol sequence from a transmitting device; wherein the length of the information bit sequence corresponding to the symbol sequence is K; Determine K first bits according to a reliability sequence of length N1, and determine K second bits according to a reliability sequence of length N2; K is less than or equal to N1, and N1 is less than N2; Divide the bits of the first sequence of length (N2-N1) into X groups of bits; divide A first bits of the K first bits into X groups of first bits; wherein the X groups of bits include A second bits of the K second bits, the number of first bits included in the xth group of first bits is the same as the number of second bits included in the xth group of bits, and X is greater than or equal to 2, and x=1, 2, ..., X; The symbol sequence is decoded according to the second bit in the X groups of bits and the third bit in the X groups; wherein the third bit in the xth group corresponds to the first bit in the xth group.

13. The method according to any one of claims 1 to 12, characterized in that: The A first bits are determined according to the K first bits and the K second bits.

14. The method according to claim 13, characterized in that Determine K third bits according to the K first bits; wherein the third bit corresponding to the first bit numbered i is numbered i+N2-N1, i is greater than or equal to 0, and i is less than or equal to N1-1; According to the A third bit positions, the A first bit positions are determined; wherein, the first bit position corresponding to the third bit position numbered j is numbered j-(N2-N1), the j is greater than or equal to N2-N1, and the j is less than or equal to N2-1; the A third bit positions are the bits among the K third bit positions that are numbered differently from the K second bit positions.

15. The method according to any one of claims 1 to 12, characterized in that: The A first bits are the last A bits of the K first bits sorted in descending order of reliability.

16. The method according to any one of claims 1 to 15, characterized in that: The A second bits are determined according to the K first bits and the K second bits.

17. The method according to claim 16, characterized in that Determine K third bits according to the K first bits; wherein the third bit corresponding to the first bit numbered i is numbered i+N2-N1, i is greater than or equal to 0, and i is less than or equal to N1-1; The A second bits are determined according to the K third bits; wherein the A second bits are bits of the K second bits that are numbered differently from the K third bits.

18. The method according to any one of claims 1 to 15, characterized in that: The A second bits are the A bits whose numbers are less than N2-N1 among the K second bits.

19. The method according to any one of claims 1 to 17, characterized in that: The step of dividing A first bits among the K first bits into X groups of first bits comprises: The A first bits are divided into the X groups of first bits according to their reliability; wherein the reliability of the first bits of the x+1th group is higher than the reliability of the first bits of the xth group.

20. The method according to any one of claims 1 to 19, characterized in that: The step of dividing the bits of the first sequence having a length of (N2-N1) into X groups of bits comprises: According to the third interleaving pattern, sub-block interleaving is performed on the first sequence, and bits of the interleaved first sequence are divided into the X groups of bits; wherein the xth group of bits includes Yx sub-blocks, and Yx is a positive integer.

21. The method according to claim 20, characterized in that The third interleaving pattern is any of the following sub-block interleaving patterns: [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]; or [0 4 8 12 1 5 9 13 2 6 10 14 3 7 11 15 16 20 24 28 17 21 25 29 18 22 26 30 19 23 27 31]; or [0 8 16 24 1 9 17 25 2 10 18 26 3 11 19 27 4 12 20 28 5 13 21 29 6 14 22 30 7 15 23 31]。 22. The method according to any one of claims 1 to 21, characterized in that: The step of dividing the bits of the first sequence having a length of (N2-N1) into X groups of bits comprises: Dividing the bits of the first sequence into the X groups of bits according to preset configuration information; or The bits of the first sequence are divided into the X groups of bits according to the retransmission resources.

23. The method according to any one of claims 1 to 22, characterized in that: Among the X groups of bits, at least one group of bits has a length that is an integer power of 2.

24. The method according to any one of claims 1 to 23, characterized in that The length of a first group of bits in the X groups of bits is an integer power of 2.

25. The method according to claim 24, characterized in that The length of the first group of bits to the x'th group of bits in the x groups of bits is an integer power of 2, the x' is greater than or equal to 2, and the x' is less than or equal to the x.

26. The method according to any one of claims 1 to 25, characterized in that X is equal to 2, a first group of bits in the X groups of bits includes (N2-N1) / 8 bits of the first sequence, and a second group of bits includes 7(N2-N1) / 8 bits of the first sequence; or X is equal to 3, a first group of bits in the X groups of bits includes (N2-N1) / 8 bits of the first sequence, a second group of bits includes (N2-N1) / 8 bits of the first sequence, and a third group of bits includes 3(N2-N1) / 4 bits of the first sequence; or X is equal to 4, a first group of bits in the X groups of bits includes (N2-N1) / 8 bits of the first sequence, a second group of bits includes (N2-N1) / 8 bits of the first sequence, a third group of bits includes (N2-N1) / 4 bits of the first sequence, and a fourth group of bits includes (N2-N1) / 2 bits of the first sequence; or The X is equal to 2, a first group of bits in the X groups of bits includes (N2-N1) / 4 bits of the first sequence, and a second group of bits includes 3(N2-N1) / 4 bits of the first sequence.

27. A communication method, characterized in that: include: Divide the bits of the seventh sequence of length N into X groups of bits, and divide the A information bits in the information bit sequence of length K into X groups of information bits; wherein the number of information bits included in the x-th group of bits is equal to the number of information bits included in the x-th group of information bits; x=1, 2, ..., X; and X is greater than or equal to 2; Interleaving and mapping the xth group of information bits onto information bits in the xth group of bits of the seventh sequence according to an interleaving pattern to obtain an eighth sequence; Performing polarization coding on the eighth sequence to obtain a coded bit sequence; One or more bits in the coded bit sequence are sent to a receiving device.

28. A communication method, characterized in that: include: receiving a symbol sequence from a transmitting device; Divide the bits of the seventh sequence of length N into X groups of bits, where X is greater than or equal to 2; The symbol sequence is decoded according to the information bits in the X groups of bits.

29. The method according to claim 27 or 28, characterized in that The step of dividing the bits of the seventh sequence having a length of N into X groups of bits comprises: Sub-block interleaving is performed on the seventh sequence, and bits of the interleaved seventh sequence are divided into the X groups of bits.

30. The method according to any one of claims 27 to 29, characterized in that: The interleaving pattern is one or more of the following: a random interleaving pattern, a triangular interleaving pattern, a row-column interleaving pattern, or a reverse interleaving pattern.

31. A communication device, characterized in that: The communication device includes a processor; the processor is used to run a computer program or instructions so that the communication method described in any one of claims 1-6, 13-26 is executed, or the communication method described in any one of claims 7, 13-26 is executed, or the communication method described in any one of claims 8-11, 13-26 is executed, or the communication method described in any one of claims 12-26 is executed, or the communication method described in any one of claims 27, 29-30 is executed, or the communication method described in any one of claims 28-30 is executed.

32. The communication device according to claim 31, characterized in that The communication device further comprises a memory for storing the computer program or instructions.

33. A communication device, characterized in that: The communication device includes an interface circuit and a logic circuit; the interface circuit is used to input and / or output information; the logic circuit is used to execute the communication method described in any one of claims 1-6, 13-26, or the communication method described in any one of claims 7, 13-26, or the communication method described in any one of claims 8-11, 13-26, or the communication method described in any one of claims 12-26, or the communication method described in any one of claims 27, 29-30, or the communication method described in any one of claims 28-30, and process and / or generate the information according to the information.

34. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions or programs, which, when executed on a computer, cause the communication method described in any one of claims 1 to 6 and 13 to 26 to be executed, or the communication method described in any one of claims 7 and 13 to 26 to be executed, or the communication method described in any one of claims 8 to 11 and 13 to 26 to be executed, or the communication method described in any one of claims 12 to 26 to be executed, or the communication method described in any one of claims 27 and 29 to 30 to be executed, or the communication method described in any one of claims 28 to 30 to be executed.

35. A computer program product, characterized in that The computer program product includes computer instructions; when part or all of the computer instructions are executed on a computer, the communication method described in any one of claims 1 to 6 and 13 to 26 is executed, or the communication method described in any one of claims 7 and 13 to 26 is executed, or the communication method described in any one of claims 8 to 11 and 13 to 26 is executed, or the communication method described in any one of claims 12 to 26 is executed, or the communication method described in any one of claims 27 and 29 to 30 is executed, or the communication method described in any one of claims 28 to 30 is executed.

36. A communication system, characterized in that: The method comprises a communication device for executing the communication method as described in any one of claims 1 to 6 and 13 to 26 and a communication device for executing the communication method as described in any one of claims 7 and 13 to 26; or, the communication device for executing the communication method as described in any one of claims 8 to 11 and 13 to 26 and a communication device for executing the communication method as described in any one of claims 12 to 26; or, the communication device for executing the communication method as described in any one of claims 27 and 29 to 30 and a communication device for executing the communication method as described in any one of claims 28 to 30.

Images