# US 12,009,836 B2 · Data processing method, communications apparatus, and communications device

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 12,009,836 B2
- Document ID: US12009836B2
- Status: Granted
- Kind: B2
- Application number: 18/188,033
- Filed: 2023-03-22
- Published: 2023-07-13
- Granted: 2024-06-11
- Earliest claimed: 2020-09-23
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Bin Li; Jiaqi Gu; Huazi Zhang
- Web page: https://patentgrep.com/patent/US12009836B2

## CPC

- H03M 13/13: Linear codes
- H04L 1/0041: {Arrangements at the transmitter end}
- H03M 13/091: {Parallel or block-wise CRC computation}
- H03M 13/251: {with block coding}
- H04L 1/0045: {Arrangements at the receiver end}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 1/0058: {Block-coded modulation}
- H04L 1/0066: {Parallel concatenated codes}
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A data processing method, an apparatus, and a device are disclosed. The data processing method may be performed by a first communications device, and the first communications device is a transmit end of encoded data. The first communications device may send a high-order signal to a second communications device by using a plurality of parallel channels, and information bits in the parallel channels are arranged in a specified order. The method helps improve a transmission rate in a parallel channel transmission scenario, and helps the second communications device perform correct decoding.

## Claims

### Claim 1

A method comprising:
receiving, by a second communication device, a first data stream and a second data stream from a first communications device using S parallel channels,
wherein the first data stream comprises a 2T-order high-order signal obtained by mapping information bits in T*M first code blocks in a first parallel channel of the S parallel channels,
wherein the T*M first code blocks are obtained by performing polar code encoding on T*M first to-be-encoded blocks,
wherein the second data stream comprises a 2T-order high-order signal obtained by mapping information bits in T*M second code blocks in a second parallel channel of the S parallel channels,
wherein the T*M second code blocks are obtained by performing polar code encoding on T*M second to-be-encoded blocks,
wherein one parallel channel comprises X information bit blocks,
wherein each information bit block comprises K information bits,
wherein one information bit block is divided into Q information bit sub-blocks,
wherein each information bit sub-block is a binary sequence with a length of K/Q,
wherein, in the first parallel channel, K information bits in each information bit block are arranged according to a first order,
wherein, in the second parallel channel, K information bits in each information bit block are arranged according to a second order,
wherein the second order is different from the first order, and
wherein the second order and the first order meet a mapping relationship;
respectively occupying, in each parallel channel, by Q information bit sub-blocks of an xth information bit block, respectively in an xth timeslot to an (x+Q−1)th timeslot, an N*R(q-1),t+1th to an N*Rq,tth reliable positions of an xth to-be-encoded block to an (x+Q−1)th to-be-encoded block in T equivalent binary subgroups,
wherein q meets 1≤q≤Q and R1,t, R2,t, . . . , RQ,t is a code rate of first Q to-be-encoded blocks in a tth equivalent binary subgroup,
wherein N is a code length,
wherein x meets 1≤x≤X and t meets 1≤t≤T, and
wherein a sum of bit sizes of T equivalent binary subgroups in an sth parallel channel occupied by a qth information bit sub-block of the xth information bit block is K/Q and s meets 1≤s≤S; and
performing hierarchical decoding according to a hierarchical decoding level of an equivalent binary subgroup to obtain decoded data.

### Claim 2 (depends on 1)

The method according to claim 1,
wherein the to-be-encoded blocks comprise a first to-be-encoded block in the first parallel channel and/or a second to-be-encoded block in the second parallel channel,
wherein respectively occupying, in each parallel channel, by the Q information bit sub-blocks of the xth information bit block comprises:
respectively occupying, in the first parallel channel, by a first information bit sub-block in the Q information bit sub-blocks of the xth information bit block, in the xth timeslot, a first to an N*R1,tth reliable positions of an xth first to-be-encoded block in the T equivalent binary subgroups,
wherein a value of R0,t is 0,
respectively occupying, in an (x+1)th timeslot, by a second information bit sub-block in the Q information bit sub-blocks of the xth information bit block, an N*R1,t+1th to an N*R2,tth reliable positions of (x+1) first to-be-encoded blocks in the T equivalent binary subgroups, until a Qth information bit sub-block in the Q information bit sub-blocks of the xth information bit block
respectively occupies, in the (x+Q−1)th timeslot, the N*R(Q-1),t+1th to the N*RQ,tth reliable positions of the (x+Q−1)th first to-be-encoded block in the T equivalent binary subgroups, and
respectively occupying, in the second parallel channel, by a first information bit sub-block in the Q information bit sub-blocks of the xth information bit block, in the xth timeslot, a first to an N*R1,tth reliable positions of an xth second to-be-encoded block in the T equivalent binary subgroups, and respectively occupying, in an (x+1)th timeslot, by a second information bit sub-block in the Q information bit sub-blocks of the xth information bit block, an N*R1,t+1th to an N*R2,tth reliable positions of (x+1) second to-be-encoded blocks in the T equivalent binary subgroups, until a Qth information bit sub-block in the Q information bit sub-blocks of the xth information bit block respectively occupies, in the (x+Q−1)th timeslot, the N*R(Q-1),t+1th to the N*RQ,tth reliable positions of the (x+Q−1)th second to-be-encoded block in the T equivalent binary subgroups.

### Claim 3 (depends on 1)

The method according to claim 1,
wherein the first order is an information bit transmission order u1, u2, . . . , uK, and the second order is a reversed order uK, uK-1, . . . , u1 of the first order, or
wherein the first order and the second order meet the following mapping relationship:
U=[u1,u2, . . . ,uK]
Ū=[0,0, . . . ,0,u1,u2, . . . ,uK]
Ũ=[ũ1,ũ2, . . . ,ũ2P]
Ũ=ŪF⊗P,
and wherein U represents any information bit block, uk represents any information bit in U, ũk in some information bits [ũ1, ũ2, . . . , ũK] in Ũ is a corresponding information bit after uk is mapped, F is a generator matrix of a polar code, a length of Ū is H=2P, H is greater than or equal to K, and k meets 1≤k≤K.

### Claim 4 (depends on 1)

The method according to claim 1, wherein performing the hierarchical decoding comprises:
when a sum of channel capacities of the first parallel channel and the second parallel channel is greater than or equal to a code rate R, performing decoding, in the first parallel channel, to obtain h1 information bit sub-parts comprised in an information bit block carried by a first code block in an equivalent binary subgroup with a lowest hierarchical decoding level, wherein one information bit sub-block in one parallel channel is divided into T information bit sub-parts, and the T information bit sub-parts are respectively located in T equivalent binary subgroups of the parallel channel;
sequentially performing decoding according to hierarchical decoding levels of equivalent binary subgroups in the first parallel channel to obtain h2 information bit sub-parts respectively corresponding to (T−1) equivalent binary subgroups of the h1 information bit sub-parts in the first parallel channel, wherein the h1 information bit sub-parts and the h2 information bit sub-parts form k1 information bit sub-blocks, and the k1 meets 1≤k1<Q;
performing decoding, in the second parallel channel, to obtain h3 information bit sub-parts of the information bit block carried by a second code block in an equivalent binary subgroup with the lowest hierarchical decoding level;
sequentially performing decoding according to hierarchical decoding levels of equivalent binary subgroups in the second parallel channel to obtain h4 information bit sub-parts respectively corresponding to (T−1) equivalent binary subgroups of the h3 information bit sub-parts in the second parallel channel, wherein the h3 information bit sub-parts and the h4 information bit sub-parts form k2 information bit sub-blocks, and the k1 and the k2 satisfy k1+k2≥Q; and
obtaining the Q information bit sub-blocks comprised in the information bit block as a set formed by the k1 information bit sub-blocks and the k2 information bit sub-blocks.

### Claim 5 (depends on 4)

The method according to claim 4,
wherein receiving the first data stream and the second data stream comprises receiving the first data stream, the second data stream, and a third data stream received from the first communications device using the S parallel channels, wherein the third data stream comprises a 2T-order high-order signal obtained by mapping information bits in T*M third code blocks in the third parallel channel of the S parallel channels, and the T*M third code blocks are obtained by performing polar code encoding on T*M third to-be-encoded blocks, wherein, in the third parallel channel, K information bits in the one information bit block are arranged according to a second order, wherein a second order used for information bits in the third parallel channel is different from a second order used for information bits in the second parallel channel, and
wherein performing the hierarchical decoding according to the hierarchical decoding level of the equivalent binary subgroup, to obtain decoded data comprises:
when a sum of channel capacities of the first parallel channel, the second parallel channel, and the third parallel channel is greater than or equal to a code rate R, performing decoding, in the first parallel channel, to obtain h1 information bit sub-parts comprised in an information bit block carried by a first code block in an equivalent binary subgroup with a lowest hierarchical decoding level;
sequentially performing decoding according to hierarchical decoding levels of equivalent binary subgroups in the first parallel channel to obtain h2 information bit sub-parts respectively corresponding to (T−1) equivalent binary subgroups of the h1 information bit sub-parts in the first parallel channel, wherein the h1 information bit sub-parts and the h2 information bit sub-parts form k1 information bit sub-blocks, and the k1 meets 1≤k1<Q;
performing decoding, in the second parallel channel according to a second order of an information bit arrangement in the second parallel channel, to obtain h3 information bit sub-parts of the information bit block carried by a second code block in an equivalent binary subgroup with the lowest hierarchical decoding level;
sequentially performing decoding according to hierarchical decoding levels of equivalent binary subgroups in the second parallel channel to obtain h4 information bit sub-parts respectively corresponding to (T−1) equivalent binary subgroups of the h3 information bit sub-parts in the second parallel channel, wherein the h3 information bit sub-parts and the h4 information bit sub-parts form k2 information bit sub-blocks, and the k1 and the k2 satisfy k1+k2<Q;
performing decoding, in the third parallel channel according to a second order of an information bit arrangement in the third parallel channel, to obtain h5 information bit sub-parts of the information bit block carried by a third code block in an equivalent binary subgroup with the lowest hierarchical decoding level;
sequentially performing decoding according to hierarchical decoding levels of equivalent binary subgroups in the third parallel channel to obtain h6 information bit sub-parts respectively corresponding to (T−1) equivalent binary subgroups of the h5 information bit sub-parts in the third parallel channel, wherein the h5 information bit sub-parts and the h6 information bit sub-parts form k3 information bit sub-blocks, and the k1, the k2, and the k3 satisfy k1+k2+k3≥Q; and
obtaining the Q information bit sub-blocks comprised in the information bit block as a set formed by the k1 information bit sub-blocks, the k2 information bit sub-blocks, and the k3 information bit sub-blocks.

### Claim 6 (depends on 1)

The method according to claim 1, wherein receiving the first data stream and the second data stream comprises:
receiving the first data stream and the second data stream until a Sth data stream, wherein an sth data stream in the first data stream and the second data stream until the Sth data stream comprises a 2T-order high-order signal obtained by mapping information bits in T*M sth code blocks in an sth parallel channel of the S parallel channels, wherein the T*M sth code blocks are obtained by performing polar code encoding on T*M sth to-be-encoded blocks, wherein K information bits in each processed information bit block are arranged according to the first order, and
respectively occupying, in the sth parallel channel, by Q information bit sub-blocks of an xth information bit block, respectively in an xth timeslot to an (x+Q−1)th timeslot, an N*R(q-1),t+1th to an N*Rq,tth reliable positions of an xth sth to-be-encoded block to an (x+Q−1)th sth to-be-encoded block in T equivalent binary subgroups, wherein processing on each information bit block meets the following condition:
mapping K information bits of each information bit block from a binary field to a finite field with 2w elements, wherein each information bit block after mapping corresponds to a symbol sequence, a length of the symbol sequence is K/w, w is a positive integer greater than 1, and wherein any symbol sequence and a symbol sequence obtained after conversion of any symbol sequence satisfy the following relationship:
Ā=Ã*Hs,
wherein à is the any symbol sequence, Ā is a symbol sequence after à is converted, a length of Ā is K/w, Hs is a universal decoding matrix of K/w×K/w in a finite field with 2w elements, s is used to indicate an sth data stream, s meets 1≤s≤S, S is a positive integer greater than 3, [As,1, As,2, . . . , As,K] is an information bit block corresponding to Ā after reverse mapping, and As,k is a corresponding information bit after the reverse mapping.

### Claim 7 (depends on 1)

The method according to claim 1, wherein each of code blocks carries at least one information bit sub-block and carries at most Q information bit sub-blocks, and wherein the code blocks comprise the first code block and the second code block.

### Claim 8 (depends on 7)

The method according to claim 7,
wherein each of the code blocks is sequentially arranged according to an identifier of the code block, wherein the first code block respectively corresponding to each of the T equivalent binary subgroups carries one information bit sub-block, wherein quantities of information bit blocks carried by the first code block to a Qth code block corresponding to each of the T equivalent binary subgroups are sequentially increased by one according to an arrangement order of the code blocks, wherein the Qth code block carries Q information bit sub-blocks, and
wherein quantities of information bit sub-blocks carried by a (Q+1)th code block to Mth code block respectively corresponding to each of the T equivalent binary subgroups are sequentially decreased by one according to the arrangement order of the code blocks, and the Mth code block carries one information bit sub-block, or wherein quantities of information bit sub-blocks carried by the (Q+1)th to the Mth code blocks respectively corresponding to each of the T equivalent binary subgroups are all Q information bit sub-blocks.

### Claim 9 (depends on 8)

The method according to claim 8, wherein Q is a quantization order of a code rate R, wherein Q is a positive integer, wherein a sum of code rates of ith code blocks respectively corresponding to the T equivalent binary subgroups is i×R/Q, wherein i meets 1≤i≤Q, wherein a sum of code rates of the jth code blocks respectively corresponding to the T equivalent binary subgroups is (M−j+1)×R/Q, wherein j meets Q+1≤j≤M, or wherein a sum of code rates of jth code blocks respectively corresponding to the T equivalent binary subgroups is R, and wherein j meets Q+1≤j≤M.

### Claim 10

A communication apparatus comprising:
a transceiver configured to:
receive a first data stream and a second data stream from a first communications device using S parallel channels, wherein the first data stream comprises a 2T-order high-order signal obtained by mapping information bits in T*M first code blocks in a first parallel channel of the S parallel channels, wherein the T*M first code blocks are obtained by performing polar code encoding on T*M first to-be-encoded blocks, wherein the second data stream comprises a 2T-order high-order signal obtained by mapping information bits in T*M second code blocks in a second parallel channel of the S parallel channels, wherein the T*M second code blocks are obtained by performing polar code encoding on T*M second to-be-encoded blocks, wherein one parallel channel comprises X information bit blocks, each information bit block comprising K information bits, wherein one information bit block is divided into Q information bit sub-blocks, each information bit sub-block being a binary sequence with a length of K/Q, wherein, in the first parallel channel, K information bits in each information bit block are arranged according to a first order, wherein, in the second parallel channel, K information bits in each information bit block are arranged according to a second order, wherein the second order is different from the first order, and wherein the second order and the first order meet a mapping relationship; and
respectively occupy, in each parallel channel, by Q information bit sub-blocks of an xth information bit block, respectively in an xth timeslot to an (x+Q−1)th timeslot, an N*R(q-1),t+1th to an N*Rq,tth reliable positions of an xth to-be-encoded block to an (x+Q−1)th to-be-encoded block in T equivalent binary subgroups, wherein q meets 1≤q≤Q and R1,t, R2,t, . . . , RQ,t is a code rate of the first Q to-be-encoded blocks in a tth equivalent binary subgroup, N is a code length, x meets 1≤x≤X, and t meets 1≤t≤T, wherein a sum of bit sizes of T equivalent binary subgroups in an sth parallel channel occupied by a qth information bit sub-block of the xth information bit block is K/Q and s meets 1≤s≤S; and
a processor configured to perform hierarchical decoding according to a hierarchical decoding level of an equivalent binary subgroup, to obtain decoded data.

### Claim 11 (depends on 10)

The apparatus of claim 10,
wherein the to-be-encoded blocks comprise a first to-be-encoded block in the first parallel channel and/or a second to-be-encoded block in the second parallel channel, and
wherein the transceiver is configured to respectively occupy by:
respectively occupying, in the first parallel channel, by a first information bit sub-block in the Q information bit sub-blocks of the xth information bit block, in the xth timeslot, a first to an N*R1,tth reliable positions of an xth first to-be-encoded block in the T equivalent binary subgroups,
wherein a value of R0,t is 0,
respectively occupying, in an (x+1)th timeslot, by a second information bit sub-block in the Q information bit sub-blocks of the xth information bit block, an N*R1,t+1th to an N*R2,tth reliable positions of (x+1) first to-be-encoded blocks in the T equivalent binary subgroups, until a Qth information bit sub-block in the Q information bit sub-blocks of the xth information bit block
respectively occupies, in the (x+Q−1)th timeslot, the N*R(Q-1),t+1th to the N*RQ,tth reliable positions of the (x+Q−1)th first to-be-encoded block in the T equivalent binary subgroups, and
respectively occupying, in the second parallel channel, by a first information bit sub-block in the Q information bit sub-blocks of the xth information bit block, in the xth timeslot, a first to an N*R1,tth reliable positions of an xth second to-be-encoded block in the T equivalent binary subgroups; and
respectively occupying, in an (x+1)th timeslot, by a second information bit sub-block in the Q information bit sub-blocks of the xth information bit block, an N*R1,t+1th to an N*R2,tth reliable positions of (x+1) second to-be-encoded blocks in the T equivalent binary subgroups, until a Qth information bit sub-block in the Q information bit sub-blocks of the xth information bit block
respectively occupies, in the (x+Q−1)th timeslot, the N*R(Q-1),t+1th to the N*RQ,tth reliable positions of the (x+Q−1)th second to-be-encoded block in the T equivalent binary subgroups.

### Claim 12 (depends on 10)

The apparatus according to claim 10,
wherein the first order is an information bit transmission order u1, u2, . . . , uK and the second order is a reversed order uK, uK-1, . . . , u1 of the first order, or
U=[u1,u2, . . . ,uK]
Ū=[0,0, . . . ,0,u1,u2, . . . ,uK]
Ũ=[ũ1,ũ2, . . . ,ũ2P]
Ũ=ŪF⊗P,
and wherein U represents any information bit block, uk represents any information bit in U, ũk in some information bits [ũ1, ũ2, . . . , ũK] in Ũ is a corresponding information bit after uk is mapped, F is a generator matrix of a polar code, a length of Ū is H=2P, H is greater than or equal to K, and k meets 1≤k≤K.

### Claim 13 (depends on 10)

The apparatus according to claim 10, wherein the processor is configured to perform hierarchical decoding by:
when a sum of channel capacities of the first parallel channel and the second parallel channel is greater than or equal to a code rate R, performing decoding, in the first parallel channel, to obtain h1 information bit sub-parts comprised in an information bit block carried by a first code block in an equivalent binary subgroup with a lowest hierarchical decoding level, wherein one information bit sub-block in one parallel channel is divided into T information bit sub-parts, and the T information bit sub-parts are respectively located in T equivalent binary subgroups of the parallel channel;
sequentially performing decoding according to hierarchical decoding levels of equivalent binary subgroups in the first parallel channel to obtain h2 information bit sub-parts respectively corresponding to (T−1) equivalent binary subgroups of the h1 information bit sub-parts in the first parallel channel, wherein the h1 information bit sub-parts and the h2 information bit sub-parts form k1 information bit sub-blocks, and the k1 satisfies 1≤k1<Q;
performing decoding, in the second parallel channel, to obtain h3 information bit sub-parts of the information bit block carried by a second code block in an equivalent binary subgroup with the lowest hierarchical decoding level;
sequentially performing decoding according to hierarchical decoding levels of equivalent binary subgroups in the second parallel channel to obtain h4 information bit sub-parts respectively corresponding to (T−1) equivalent binary subgroups of the h3 information bit sub-parts in the second parallel channel, wherein the h3 information bit sub-parts and the h4 information bit sub-parts form k2 information bit sub-blocks, and the k1 and the k2 satisfy k1+k2≥Q; and
obtaining the Q information bit sub-blocks comprised in the information bit block as a set formed by the k1 information bit sub-blocks and the k2 information bit sub-blocks.

### Claim 14 (depends on 13)

The apparatus according to claim 13,
wherein the transceiver is configured to receive the first data stream and the second data stream by:
receiving the first data stream, the second data stream, and a third data stream received from the first communications device using the S parallel channels, wherein the third data stream comprises a 2T-order high-order signal obtained by mapping information bits in T*M third code blocks in the third parallel channel of the S parallel channels, wherein the T*M third code blocks are obtained by performing polar code encoding on T*M third to-be-encoded blocks, wherein, in the third parallel channel, K information bits in the one information bit block are arranged according to a second order, wherein a second order used for information bits in the third parallel channel is different from a second order used for information bits in the second parallel channel, and
wherein the processor is configured to perform hierarchical decoding by:
when a sum of channel capacities of the first parallel channel, the second parallel channel, and the third parallel channel is greater than or equal to a code rate R, performing decoding, in the first parallel channel, to obtain h1 information bit sub-parts comprised in an information bit block carried by a first code block in an equivalent binary subgroup with a lowest hierarchical decoding level;
sequentially performing decoding according to hierarchical decoding levels of equivalent binary subgroups in the first parallel channel to obtain h2 information bit sub-parts respectively corresponding to (T−1) equivalent binary subgroups of the h1 information bit sub-parts in the first parallel channel, wherein the h1 information bit sub-parts and the h2 information bit sub-parts form k1 information bit sub-blocks, and the k1 meets 1≤k1<Q;
performing decoding, in the second parallel channel according to a second order of an information bit arrangement in the second parallel channel, to obtain h3 information bit sub-parts of the information bit block carried by a second code block in an equivalent binary subgroup with the lowest hierarchical decoding level;
sequentially performing decoding according to the hierarchical decoding levels of equivalent binary subgroups in the second parallel channel to obtain h4 information bit sub-parts respectively corresponding to (T−1) equivalent binary subgroups of the h3 information bit sub-parts in the second parallel channel, wherein the h3 information bit sub-parts and the h4 information bit sub-parts form k2 information bit sub-blocks, and the k1 and the k2 satisfy k1+k2<Q;
performing decoding, in the third parallel channel according to a second order of an information bit arrangement in the third parallel channel, to obtain h5 information bit sub-parts of the information bit block carried by a third code block in an equivalent binary subgroup with the lowest hierarchical decoding level;
sequentially performing decoding according to hierarchical decoding levels of equivalent binary subgroups in the third parallel channel to obtain h6 information bit sub-parts respectively corresponding to (T−1) equivalent binary subgroups of the h5 information bit sub-parts in the third parallel channel, wherein the h5 information bit sub-parts and the h6 information bit sub-parts form k3 information bit sub-blocks, and the k1, the k2, and the k3 satisfy k1+k2+k3≥Q; and
obtaining the Q information bit sub-blocks comprised in the information bit block as a set formed by the k1 information bit sub-blocks, the k2 information bit sub-blocks, and the k3 information bit sub-blocks.

### Claim 15 (depends on 10)

The apparatus according to claim 10,
wherein the transceiver is configured to receive the first data stream and the second data stream by:
receiving the first data stream and the second data stream until a Sth data stream, wherein an sth data stream in the first data stream and the second data stream until the Sth data stream comprises a 2T-order high-order signal obtained by mapping information bits in T*M sth code blocks in an sth parallel channel of the S parallel channels, wherein the T*M sth code blocks are obtained by performing polar code encoding on T*M sth to-be-encoded blocks, wherein K information bits in each processed information bit block are arranged according to the first order, and
respectively occupying, in the sth parallel channel, by Q information bit sub-blocks of an xth information bit block, respectively in an xth timeslot to an (x+Q−1)th timeslot, an N*R(q-1),t+1th to an N*Rq,tth reliable positions of an xth sth to-be-encoded block to an (x+Q−1)th sth to-be-encoded block in T equivalent binary subgroups, wherein processing on each information bit block meets the following condition:
mapping K information bits of each information bit block from a binary field to a finite field with 2w elements, wherein each information bit block after mapping corresponds to a symbol sequence, a length of the symbol sequence is K/w, w is a positive integer greater than 1, and wherein any symbol sequence and a symbol sequence obtained after conversion of the any symbol sequence satisfy the following relationship:
Ā=Ã*Hs,
wherein à is the any symbol sequence, Ā is a symbol sequence after à is converted, a length of Ā is K/w, Hs is a universal decoding matrix of K/w×K/w in a finite field with 2w elements, s is used to indicate an sth data stream, s meets 1≤s≤S, S is a positive integer greater than 3, [As,1, As,2, . . . , As,K] is an information bit block corresponding to Ā after reverse mapping, and As,k is a corresponding information bit after the reverse mapping.

### Claim 16 (depends on 10)

The apparatus according to claim 10, wherein each of code blocks carries at least one information bit sub-block and carries at most Q information bit sub-blocks, and wherein the code blocks comprise the first code block and the second code block.

### Claim 17 (depends on 16)

The apparatus according to claim 16,
wherein each of the code blocks is sequentially arranged according to an identifier of the code block, wherein the first code block respectively corresponding to each of the T equivalent binary subgroups carries one information bit sub-block, quantities of information bit blocks carried by the first code block to a Qth code block corresponding to each of the T equivalent binary subgroups are sequentially increased by one according to an arrangement order of the code blocks, wherein the Qth code block carries Q information bit sub-blocks,
wherein quantities of information bit sub-blocks carried by the (Q+1)th code block to Mth code block respectively corresponding to each of the T equivalent binary subgroups are sequentially decreased by one according to the arrangement order of the code blocks, and wherein the Mth code block carries one information bit sub-block, or wherein quantities of information bit sub-blocks carried by the (Q+1)th to the Mth code blocks respectively corresponding to each of the T equivalent binary subgroups are all Q information bit sub-blocks.

### Claim 18 (depends on 17)

The apparatus according to claim 17, wherein the Q is a quantization order of a code rate R, wherein Q is a positive integer, wherein a sum of code rates of ith code blocks respectively corresponding to the T equivalent binary subgroups is i×R/Q, wherein i meets 1≤i≤Q, wherein a sum of code rates of jth code blocks respectively corresponding to the T equivalent binary subgroups (M−j+1)×R/Q and wherein j meets Q+1≤j≤M, or wherein a sum of code rates of jth code blocks respectively corresponding to the T equivalent binary subgroups is R, and wherein j meets Q+1≤j≤M.

### Claim 19

A method comprising:
obtaining, by a first communication device, a plurality of binary sequences, wherein the plurality of binary sequences are obtained by using S parallel channels, wherein each parallel channel comprises T equivalent binary subgroups, wherein one equivalent binary subgroup carries one binary sequence, wherein one parallel channel comprises X information bit blocks, wherein each information bit block comprises K information bits, wherein one information bit block is divided into Q information bit sub-blocks, wherein each information bit sub-block is a binary sequence with a length of K/Q, wherein, in a first parallel channel of the S parallel channels, K information bits in each information bit block are arranged according to a first order, wherein, in a second parallel channel of the S parallel channels, K information bits in each information bit block are arranged according to a second order, and wherein the second order is different from the first order, the second order and the first order meeting a mapping relationship;
respectively placing, by the first communication device, in each parallel channel, Q information bit sub-blocks of an xth information bit block, respectively in an xth timeslot to an (x+Q−1)th timeslot, at an N*R(q-1),tth to an N*Rq,tth reliable positions of an xth to-be-encoded block to an (x+Q−1)th to-be-encoded block in T equivalent binary subgroups, wherein q meets 1≤q≤Q and R1,t, R2,t, . . . , RQ,t is a code rate of first Q to-be-encoded blocks in a tth equivalent binary subgroup, wherein N is a code length, wherein x meets 1≤x≤X and t meets 1≤t≤T, wherein T is greater than or equal to 2, wherein a sum of bit sizes of T equivalent binary subgroups in an sth parallel channel occupied by a qth information bit sub-block of the xth information bit block is K/Q, and wherein s meets 1≤s≤S and q meets 1≤q≤Q;
performing, by the first communication device, polar code encoding on M first to-be-encoded blocks in each equivalent binary subgroup separately for the T equivalent binary subgroups in the first parallel channel, in order to obtain M first code blocks in each equivalent binary subgroup;
performing, by the first communication device, polar code encoding on M second to-be-encoded blocks in each equivalent binary subgroup separately for the T equivalent binary subgroups in the second parallel channel, in order to obtain M second code blocks in each equivalent binary subgroup; and
sending, by the first communication device, a first data stream and a second data stream to a second communications device, wherein the first data stream comprises a 2T-order high-order signal obtained by mapping information bits in T*M first code blocks in the first parallel channel, and wherein the second data stream comprises a 2T-order high-order signal obtained by mapping information bits in T*M second code blocks in the second parallel channel.

### Claim 20 (depends on 19)

The method according to claim 19,
wherein the to-be-encoded blocks comprise a first to-be-encoded block in the first parallel channel and/or a second to-be-encoded block in the second parallel channel, and
wherein respectively placing, in each parallel channel, the Q information bit sub-blocks of the xth information bit block comprises:
placing, in the first parallel channel, a first information bit sub-block in the Q information bit sub-blocks of the xth information bit block, in the xth timeslot, at a first to an N*R1,tth reliable positions of an xth first to-be-encoded block in T equivalent binary subgroups, wherein a value of R0,t is 0;
placing, in an (x+1)th timeslot, a second information bit sub-block in the Q information bit sub-blocks of the xth information bit block at an N*R1,t+1th to a N*R2,tth reliable positions of (x+1) first to-be-encoded blocks in the T equivalent binary subgroups, until a Qth information bit sub-block in the Q information bit sub-blocks of the xth information bit block is placed, in the (x+Q−1)th timeslot, at the N*R(Q-1),t+1th to the R*NQ,tth reliable positions of the (x+Q−1)th first to-be-encoded block in the T equivalent binary subgroups, and
placing, in the second parallel channel, a first information bit sub-block in the Q information bit sub-blocks of the xth information bit block, in the xth timeslot, at a first to an N*R1,tth reliable positions of an xth second to-be-encoded block in T equivalent binary subgroups; and
placing, in an (x+1)th timeslot, a second information bit sub-block in the Q information bit sub-blocks of the xth information bit block at an N*R1,t+1th to an N*R2,tth reliable positions of (x+1) second to-be-encoded blocks in the T equivalent binary subgroups, until a Qth information bit sub-block in the Q information bit sub-blocks of the xth information bit block is placed, in the (x+Q−1)th timeslot, in the N*R(Q-1),t+1th to the N*RQ,tth reliable positions of the (x+Q−1)th second to-be-encoded block in the T equivalent binary subgroups.