IP Library › Granted Patent US 11,258,463
Granted Patent B2
US 11,258,463 · App. 16/673,581 · Granted Feb 22, 2022

Polar code transmission method and apparatus

Inventors: Hejia Luo (Hangzhou, CN); Gongzheng Zhang (Hangzhou, CN); Jian Wang (Hangzhou, CN); Rong Li (Hangzhou, CN); Yourui HuangFu (Hangzhou, CN); Huazi Zhang (Hangzhou, CN); Ying Chen (Hangzhou, CN); Jun Wang (Shenzhen, CN)
Assignee: HUAWEI TECHNOLOGIES CO., LTD.
H03M13/2792H03M13/13H03M13/616
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,258,463
App. No.
16/673,581
Granted
Feb 22, 2022
Kind
B2
Abstract

A polar code transmission method and apparatus, the method including performing, by a transmit end, polar code encoding on at least one of to-be-encoded bit sequences U to generate an encoded sequence, wherein a length of U is N, and scrambling and interleaving, by the transmit end, the encoded sequence by using a scrambling sequence S X and an interleaving matrix P X .

Claims (45)

1. A polar code transmission method, comprising:

performing, by a transmit end, polar code encoding on at least one of to-be-encoded bit sequences U to generate an encoded sequence, wherein a length of U is N; and

scrambling and interleaving, by the transmit end, the encoded sequence by using a scrambling sequence Sx and an interleaving matrix P x , wherein a mother code length is d×N, wherein the to-be-encoded bit sequences form d parts of an equal length, wherein U is any one of the d parts, and wherein d is an exponential power of 2; and

performing at least one of:

setting a bit at an (N/4) th location in Su to 1 in response to a bit at an (N/2) th location in U being an information bit, and further in response to a bit at an (N/4) th location in U being a fixed bit; or

setting a bit that is in Su and that corresponds to a first information bit location in U to 1 in response to a bit at an (N/4) th location in U being a fixed bit, and further in response to S x =S u ·G N , wherein G N is a generator matrix of a polar code, and wherein Su is a 1×N vector; or

setting a bit that is in Su and that corresponds to a location of a row in Tu to 1 in response to S x =S u ·G N , and G N ·P x ·G N =T u , wherein G N is a generator matrix of a polar code, Su is a 1×N vector, and T u is a transformation matrix, wherein column vectors that are in T u , and that correspond to information bit locations in U constitute an information bit transformation matrix, wherein the row has a largest row weight in an M×M upper triangular matrix in the information bit transformation matrix, and wherein M is a positive integer greater than or equal to 2.

2. The method according to claim 1 , wherein a mother code length is N, and wherein the length of U is the same as the mother code length.

3. The method according to claim 1 , further comprising setting a bit that is in Su and that corresponds to a location of a row in Tu to 1 in response to at least two M×M upper triangular matrices being in the information bit transformation matrix, wherein the row has a largest row weight in at least one M×M upper triangular matrix.

4. The method according to claim 1 , wherein the scrambling and interleaving, by the transmit end, the encoded sequence comprises performing at least one of:

first scrambling and then interleaving, by the transmit end, the encoded sequence; or

first interleaving and then scrambling, by the transmit end, the encoded sequence.

5. The method according to claim 1 , wherein the interleaving matrix comprises a cyclic shift matrix.

6. The method according to claim 5 , wherein interleaving matrix has an offset of N/4.

7. A polar code transmission apparatus, comprising:

a processor; and

a non-transitory computer-readable storage medium storing a program to be executed by the processor, the program including instructions to:

obtain at least one of to-be-encoded bit sequences U;

perform polar code encoding on the at least one of the to-be-encoded bit sequences U to generate an encoded sequence, wherein a length of U is N; and

scramble and interleave the encoded sequence by using a scrambling sequence S x and an interleaving matrix P x , wherein a mother code length is d×N, wherein the to-be-encoded bit sequences form d parts of an equal length, wherein U is any one of the d parts, and wherein d is an exponential power of 2; and

perform at least one of:

set a bit at an (N/2) th location in Su to 1 in response to a bit at an (N/2) th location in U being an information bit, and further in response to a bit at an (N/4) th location in U being a fixed bit: or

set a bit that is in Su and that corresponds to a first information bit location in U to 1 in response to a bit at an (N/4) th location in U being a fixed bit, and further in response to S x =S u ·G N , wherein G N is a generator matrix of a polar code, and wherein Su is a 1×N vector; or

set a bit that is in Su and that corresponds to a location of a row in Tu to 1 in response to S x =S u ·G N , and G N ·P x ·G N =T u , wherein G N is a generator matrix of a polar code, Su is a 1×N vector, and T u is a transformation matrix, wherein column vectors that are in T u , and that correspond to information bit locations in U constitute an information bit transformation matrix, wherein the row has a largest row weight in an M×M upper triangular matrix in the information bit transformation matrix, and wherein M is a positive integer greater than or equal to 2.

8. The apparatus according to claim 7 , wherein a mother code length is N, and wherein the length of U is the same as the mother code length.

9. The apparatus according to claim 7 , further comprising setting a bit that is in Su and that corresponds to a location of a row in Tu to 1 in response to at least two M×M upper triangular matrices being in the information bit transformation matrix, wherein the row has a largest row weight in at least one M×M upper triangular matrix.

10. The apparatus according to claim 7 , wherein the instructions to scramble and interleave the encoded sequence by using a scrambling sequence S x and an interleaving matrix P x include instructions to perform at least one of:

first scrambling and then interleaving the encoded sequence; or

first interleaving and then scrambling the encoded sequence.

11. The apparatus according to claim 7 , wherein the interleaving matrix comprises a cyclic shift matrix.

12. The apparatus according to claim 11 , wherein interleaving matrix has an offset of N/4.

13. A non-transitory computer readable storage medium storing computer readable instructions that, when run in an apparatus, cause the apparatus to:

obtain at least one of to-be-encoded bit sequences U;

perform polar code encoding on the at least one of the to-be-encoded bit sequences U to generate an encoded sequence, wherein a length of U is N; and

scramble and interleave the encoded sequence by using a scrambling sequence S x and an interleaving matrix P x , wherein a mother code length is d×N, wherein the to-be-encoded bit sequences form d parts of an equal length, wherein U is any one of the d parts, and wherein d is an exponential power of 2; and

perform at least one of:

set a bit at an (N/2) th location in S u to 1 in response to a bit at an (N/2) th location in U being an information bit, and further in response to a bit at an (N/4) th location in U being a fixed bit; or

set a bit that is in Su and that corresponds to a first information bit location in U to 1 in response to a bit at an (N/4) th location in U being a fixed bit, and further in response to S x =S u ·G N , wherein G N is a generator matrix of a polar code, and wherein Su is a 1×N vector; or

set a bit that is in Su and that corresponds to a location of a row in Tu to 1 in response to S x =S u ·G N , and G N ·P x ·G N =T u , wherein G N is a generator matrix of a polar code, S u is a 1×N vector, and T u is a transformation matrix, wherein column vectors that are in T u , and that correspond to information bit locations in U constitute an information bit transformation matrix,-wherein the row has a largest row weight in an M×M upper triangular matrix in the information bit transformation matrix, and wherein M is a positive integer greater than or equal to 2.

14. The computer readable storage medium according to claim 13 , wherein a mother code length is N, and wherein the length of U is the same as the mother code length.

15. The computer readable storage medium according to claim 13 , wherein the instructions, when run in the apparatus, further cause the apparatus to set a bit that is in S u and that corresponds to a location of a row in Tu to 1 in response to at least two M×M upper triangular matrices being in the information bit transformation matrix, wherein the row has a largest row weight in at least one M×M upper triangular matrix.

16. The computer readable storage medium according to claim 13 , wherein the instructions that cause the apparatus to scramble and interleave the encoded sequence by using a scrambling sequence Sx and an interleaving matrix P x include instructions that, when run in the apparatus, further cause the apparatus to perform at least one of:

first scrambling and then interleaving the encoded sequence; or

first interleaving and then scrambling the encoded sequence.

17. The computer readable storage medium according to claim 13 , wherein the interleaving matrix comprises a cyclic shift matrix.

Assignments (2)
CORRECTIVE ASSIGNMENT TO CORRECT THE ASSIGNEE TO HUAWEI TECHNOLOGIES CO., LTD., LOGNGANG, SHENZHEN, CHINA, 518129 PREVIOUSLY RECORDED AT REEL: 052473 FRAME: 0172. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Apr 24, 2020
From: LUO, HEJIA; ZHANG, GONGZHENG; WANG, JIAN; LI, RONG; HUANGFU, YOURUI; ZHANG, HUAZI; CHEN, YING; WANG, JUN
To: HUAWEI TECHNOLOGIES CO., LTD.
Reel/Frame 052486/0857 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 23, 2020
From: LUO, HEJIA; ZHANG, GONGZHENG; WANG, JIAN; LI, RONG; HUANGFU, YOURUI; ZHANG, HUAZI; CHEN, YING; WANG, JUN
To: TAIWAN SEMICONDUCTOR MANUFACTURING COMPANY, LTD.
Reel/Frame 052473/0172 →
Priority Claims (1)
CN 201710314206.5 · May 5, 2017 · national
Continuity (2)
Continuation PCTCN2018085711 · May 4, 2018
Related Publication 20200067536A1 · Feb 27, 2020
Cited By (1)
US 12,476,656