Data processing method, communications apparatus, and communications device

Patent metadata

Field	Value
Publication number	US-12009836-B2
Application number	US-202318188033-A
Country	US
Kind code	B2
Filing date	Mar 22, 2023
Priority date	Sep 23, 2020
Publication date	Jun 11, 2024
Grant date	Jun 11, 2024

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.

First claim

What is claimed is:

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 2 T -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 2 T -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 x th information bit block, respectively in an x th timeslot to an (x+Q−1) th timeslot, an N*R (q-1),t +1 th to an N*R q,t th reliable positions of an x th 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 R 1,t , R 2,t , . . . , R Q,t is a code rate of first Q to-be-encoded blocks in a t th 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 s th parallel channel occupied by a q th information bit sub-block of the x th 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.

2. 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 x th 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 x th information bit block, in the x th timeslot, a first to an N*R 1,t th reliable positions of an x th first to-be-encoded block in the T equivalent binary subgroups,
wherein a value of R 0,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 x th information bit block, an N*R 1,t +1 th to an N*R 2,t th reliable positions of (x+1) first to-be-encoded blocks in the T equivalent binary subgroups, until a Q th information bit sub-block in the Q information bit sub-blocks of the x th information bit block
respectively occupies, in the (x+Q−1) th timeslot, the N*R (Q-1),t +1 th to the N*R Q,t th 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 x th information bit block, in the x th timeslot, a first to an N*R 1,t th reliable positions of an x th 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 x th information bit block, an N*R 1,t +1 th to an N*R 2,t th reliable positions of (x+1) second to-be-encoded blocks in the T equivalent binary subgroups, until a Q th information bit sub-block in the Q information bit sub-blocks of the x th information bit block respectively occupies, in the (x+Q−1) th timeslot, the N*R (Q-1),t +1 th to the N*R Q,t th reliable positions of the (x+Q−1) th second to-be-encoded block in the T equivalent binary subgroups.

3. The method according to claim 1 ,
wherein the first order is an information bit transmission order u 1 , u 2 , . . . , u K , and the second order is a reversed order u K , u K-1 , . . . , u 1 of the first order, or
wherein the first order and the second order meet the following mapping relationship:
U=[u 1 ,u 2 , . . . ,u K ]
Ū=[ 0,0, . . . ,0, u 1 ,u 2 , . . . ,u K ]
Ũ=[ũ 1 ,ũ 2 , . . . ,ũ 2 P ]
Ũ=ŪF ⊗P ,

 and wherein U represents any information bit block, u k represents any information bit in U, ũ k in some information bits [ũ 1 , ũ 2 , . . . , ũ K ] in Ũ is a corresponding information bit after u k is mapped, F is a generator matrix of a polar code, a length of Ū is H=2 P , H is greater than or equal to K, and k meets 1≤k≤K.

4. 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 h 1 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 h 2 information bit sub-parts respectively corresponding to (T−1) equivalent binary subgroups of the h 1 information bit sub-parts in the first parallel channel, wherein the h 1 information bit sub-parts and the h 2 information bit sub-parts form k 1 information bit sub-blocks, and the k 1 meets 1≤k 1 <Q;
performing decoding, in the second parallel channel, to obtain h 3 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 h 4 information bit sub-parts respectively corresponding to (T−1) equivalent binary subgroups of the h 3 information bit sub-parts in the second parallel channel, wherein the h 3 information bit sub-parts and the h 4 information bit sub-parts form k 2 information bit sub-blocks, and the k 1 and the k 2 satisfy k 1 +k 2 ≥Q; and
obtaining the Q information bit sub-blocks comprised in the information bit block as a set formed by the k 1 information bit sub-blocks and the k 2 information bit sub-blocks.

5. 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 2 T -order high-order signal obtained by mapping inform

Assignees

• Huawei Tech Co Ltd

Inventors

• Li Bin
• Gu Jiaqi
• Zhang Huazi

Classifications

• H03M13/091

  Parallel or block-wise CRC computation · CPC title

• H04L1/0045

  Arrangements at the receiver end · CPC title

• H04L1/0058

  Block-coded modulation · CPC title

• H03M13/13 Primary

  Linear codes · CPC title

• H03M13/251

  with block coding · CPC title