IP Library Granted Patent US 11,432,186
Granted Patent B2
US 11,432,186 · App. 16/748,825 · Granted Aug 30, 2022

Method and device for transmitting data with rate matching

Inventors: Gongzheng Zhang (Hangzhou, CN); Yourui HuangFu (Hangzhou, CN); Lingchen Huang (Hangzhou, CN); Ying Chen (Hangzhou, CN); Yunfei Qiao (Hangzhou, CN); Rong Li (Hangzhou, CN)
Assignee: Huawei Technologies Co., Ltd.
H04W28/04H04L1/0013H04L1/0057H04L1/0068H04L1/0071
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,432,186
App. No.
16/748,825
Granted
Aug 30, 2022
Kind
B2
Abstract

Embodiments of the application provide a method for transmitting data in a wireless communication network. A device of the network receives a bit sequence of K information bits. The device polar codes the bit sequence to obtain a first encoded sequence, wherein a length of the first encoded sequence is N, and N is greater than or equal to K. The device block interleaves the first encoded sequence to obtain an interleaved bit sequence. The device determines a transmission code rate R. When the transmission code rate R is less than the code rate threshold, the device outputs a second bit sequence. The length of the second bit sequence is M, M is smaller than N. The second bit sequence is punctured from the interleaved bit sequence by removing (N−M) bits from beginning of the interleaved bit sequence.

Claims (76)

1. An apparatus in a communication device, comprising one or more processors and one or more memories storing program instructions; wherein when the program instructions are executed by the one or more processors, the apparatus is configured to:

obtain a bit sequence, wherein the bit sequence comprises K bits of information, and K is a positive integer;

encode the bit sequence to obtain a first encoded sequence, wherein the first encoded sequence comprises N bits, N is greater than or equal to K, and N is an integer power of 2;

block interleave the first encoded sequence, to obtain an interleaved bit sequence of N bits;

obtain a target code length M, wherein M is a positive integer; and

obtain and output a second bit sequence of M bits;

wherein:

when N<M, the second bit sequence is obtained by repeating the interleaved bit sequence, until a total number of M bits is reached; and

when N>M and a transmission code rate K/M is less than a code rate threshold, the second bit sequence is obtained by puncturing (N−M) bits from beginning of the interleaved bit sequence, and

wherein:

in block interleaving the first encoded sequence to obtain the interleaved bit sequence, the apparatus is configured to:

divide the first encoded sequence into S bit groups that are of equal length; and

interleave the first encoded sequence in bit groups based on a symmetrical sequence.

2. The apparatus according to claim 1 , wherein when N>M and the transmission code rate K/M is greater than the code rate threshold, the second bit sequence is obtained by shortening (N−M) bits from end of the interleaved bit sequence.

3. The apparatus according to claim 2 , wherein when N>M and the transmission code rate K/M is greater than the code rate threshold, the second bit sequence is obtained by shortening (N−M) bits from end of the interleaved bit sequence according to the following order:

removing a quantity N1 of bit groups from the S bit groups of the interleaved bit sequence starting from the end of the interleaved bit sequence, wherein N1=└(N−M)/(N/S)┘; and

removing a quantity N2 of bits from a bit group at the end of the remaining S−N1 bit groups of the interleaved bit sequence, wherein N2=N−M−N1×(N/S).

4. The apparatus according to claim 1 , wherein the symmetrical sequence comprises a sequence, Sequence, wherein an ith element of the Sequence, Sequence (i), satisfies:

Sequence (i)=S−Sequence (S−i) and 1<=i<S.

5. The apparatus according to claim 1 , wherein S=32.

6. The apparatus according to claim 1 , wherein when N>M and a transmission code rate K/M is less than a code rate threshold, the second bit sequence is obtained by puncturing (N−M) bits from beginning of the interleaved bit sequence according to the following order:

removing a quantity L1 of bit groups from the S bit groups of the interleaved bit sequence starting from the beginning of the interleaved bit sequence, wherein L1=└(N−M)/(N/S)┘; and

removing a quantity L2 of bits from a bit group at the beginning of the remaining S−L1 bit groups of the interleaved bit sequence, wherein L2=N−M−L1×(N/S).

7. The apparatus according to claim 1 , wherein a value of the code rate threshold is any one of the following:

0, 1/4, 1/3, 2/5, 1/2, and 1.

8. The apparatus according to claim 1 , wherein the apparatus is a microchip, and the communication device is a base station or a user terminal.

9. A microchip, comprising one or more integrated circuits that are configured to:

obtain a bit sequence, wherein the bit sequence comprises K bits of information, and K is a positive integer;

encode the bit sequence to obtain a first encoded sequence, wherein the first encoded sequence comprises N bits, N is greater than or equal to K, and N is an integer power of 2;

block interleave the first encoded sequence, to obtain an interleaved bit sequence of N bits;

obtain a target code length M, wherein M is a positive integer; and

obtain and output a second bit sequence of M bits;

wherein:

when N<M, the second bit sequence is obtained by repeating the interleaved bit sequence, until a total number of M bits is reached; and

when N>M and a transmission code rate K/M is less than a code rate threshold, the second bit sequence is obtained by puncturing (N−M) bits from beginning of the interleaved bit sequence, and

wherein:

in block interleaving the first encoded sequence to obtain the interleaved bit sequence, the one or more integrated circuits are configured to:

divide the first encoded sequence into S bit groups that are of equal length; and

interleave the first encoded sequence in bit groups based on a symmetrical sequence.

10. The microchip according to claim 9 , wherein when N>M and the transmission code rate K/M is greater than the code rate threshold, the second bit sequence is obtained by shortening (N−M) bits from end of the interleaved bit sequence.

11. The microchip according to claim 10 , wherein when N>M and the transmission code rate K/M is greater than the code rate threshold, the second bit sequence is obtained by shortening (N−M) bits from end of the interleaved bit sequence according to the following order:

removing a quantity N1 of bit groups from the S bit groups of the interleaved bit sequence starting from the end of the interleaved bit sequence, wherein N1=└(N−M)/(N/S)┘; and

removing a quantity N2 of bits from a bit group at the end of the remaining S−N1 bit groups of the interleaved bit sequence, wherein N2=N−M−N1×(N/S).

12. The microchip according to claim 9 , wherein the symmetrical sequence comprises a sequence, Sequence, wherein an ith element of the Sequence, Sequence (i), satisfies:

Sequence (i)=S−Sequence (S−i) and 1<=i<S.

13. The microchip according to claim 9 , wherein S=32.

14. The microchip according to claim 9 , wherein when N>M, and a transmission code rate K/M is less than a code rate threshold, the second bit sequence is obtained by puncturing (N−M) bits from beginning of the interleaved bit sequence according to the following order:

removing a quantity L1 of bit groups from the S bit groups of the interleaved bit sequence starting from the beginning of the interleaved bit sequence, wherein L1=└(N−M)/(N/S)┘; and

removing a quantity L2 of bits from a bit group at the beginning of the remaining S−L1 bit groups of the interleaved bit sequence wherein L2=N−M−L1×(N/S).

15. The microchip according to claim 9 , wherein a value of the code rate threshold is any one of the following:

0, 1/4, 1/3, 2/5, 1/2, and 1.

16. A method for processing data in a wireless communication network, comprising:

obtaining, by an information processing device, a bit sequence, wherein the bit sequence comprises K bits of information, and K is a positive integer;

encoding, by the device, the bit sequence to obtain a first encoded sequence, wherein the first encoded sequence comprises N bits, N is greater than or equal to K, and N is an integer power of 2;

block interleaving, by the device, the first encoded sequence, to obtain an interleaved bit sequence of N bits;

obtaining, by the device, a target code length M, wherein M is a positive integer; and

obtaining and outputting, by the device, a second bit sequence of M bits;

wherein:

when N<M, the second bit sequence is obtained by repeating the interleaved bit sequence, until a total number of M bits is reached; and

when N>M and a transmission code rate K/M is less than a code rate threshold, the second bit sequence is obtained by puncturing (N−M) bits from beginning of the interleaved bit sequence, and

wherein:

block interleaving the first encoded sequence to obtain the interleaved bit sequence comprises:

dividing the first encoded sequence into S bit groups that are of equal length; and

interleaving the first encoded sequence in bit groups based on a symmetrical sequence.

17. The method according to claim 16 , wherein when N>M and the transmission code rate K/M is greater than the code rate threshold, the second bit sequence is obtained by shortening (N−M) bits from end of the interleaved bit sequence.

18. The method according to claim 17 , wherein when N>M and the transmission code rate K/M is greater than the code rate threshold, the second bit sequence is obtained by shortening (N−M) bits from end of the interleaved bit sequence according to the following order:

removing a quantity N1 of bit groups from the S bit groups of the interleaved bit sequence starting from the end of the interleaved bit sequence, wherein N1=└(N−M)/(N/S)┘; and

removing a quantity N2 of bits from a bit group at the end of the remaining S−N1 bit groups of the interleaved bit sequence, wherein N2=N−M−N1×(N/S).

19. The method according to claim 16 , wherein the symmetrical sequence comprises a sequence, Sequence, wherein an ith element of the Sequence, Sequence (i), satisfies:

Sequence (i)=S−Sequence (S−i) and 1<=i<S.

20. The method according to claim 16 , wherein S=32.

21. The method according to claim 16 , wherein when N>M and a transmission code rate K/M is less than a code rate threshold, the second bit sequence is obtained by puncturing (N−M) bits from beginning of the interleaved bit sequence according to the following order:

removing a quantity L1 of bit groups from the S bit groups of the interleaved bit sequence starting from the beginning of the interleaved bit sequence, wherein L1=└(N−M)/(N/S)┘; and

removing a quantity L2 of bits from a bit group at the beginning of the remaining S−L1 bit groups of the interleaved bit sequence, wherein L2=N−M−L1×(N/S).

22. The method according to claim 16 , wherein a value of the code rate threshold is any one of:

0, 1/4, 1/3, 2/5, 1/2, and 1.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 24, 2022
From: ZHANG, GONGZHENG; HUANGFU, YOURUI; HUANG, LINGCHEN; CHEN, YING; QIAO, YUNFEI; LI, RONG
To: HUAWEI TECHNOLOGIES CO., LTD.
Reel/Frame 059998/0604 →
Priority Claims (1)
CN 201710185302.4 · Mar 25, 2017 · national
Continuity (4)
Continuation 16561027 · Sep 5, 2019
Continuation 16164833 · Oct 19, 2018
Continuation PCTCN2018080395 · Mar 24, 2018
Related Publication 20200236589A1 · Jul 23, 2020