IP Library › Granted Patent US 12,671,526
Granted Patent B2
US 12,671,526 · App. 18/779,058 · Granted Jun 30, 2026

Polar code encoding method, polar code decoding method, and apparatuses thereof

Inventors: Huazi Zhang (Hangzhou, CN); Jiajie Tong (Hangzhou, CN); Gongzheng Zhang (Hangzhou, CN); Shengchen Dai (Hangzhou, CN); Xianbin Wang (Hangzhou, CN); Rong Li (Boulogne Billancourt, FR); Jun Wang (Hangzhou, CN)
Assignee: Huawei Technologies Co., Ltd.
H04L1/1819H03M13/033H03M13/13H03M13/611H03M13/6306H04L1/0057H04L1/1867
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 12,671,526
App. No.
18/779,058
Filed
Jul 21, 2024
Granted
Jun 30, 2026
Kind
B2
Art Unit
2111
USPC
714/751
Abstract

Embodiments of this application disclose a polar code encoding method, a polar code decoding method, and apparatuses thereof, to reduce encoding and decoding complexity. The method in embodiments of this application includes: generating an input vector, where the input vector includes T subblocks, a first information bit of a first subblock is obtained by replicating a second information bit of a second subblock, the first subblock and the second subblock are subblocks of the T subblocks, a sequence number of the first subblock is after a sequence number of the second subblock, and T is an integer greater than or equal to 2; and performing polar encoding on the input vector to obtain an encoded bit.

Claims (49)

1 . A polar code decoding method, wherein the method comprises:

receiving, by a communications apparatus, to-be-decoded bit information, wherein the to-be-decoded bit information comprises information about a bit of a first subblock and information about a bit of a second subblock, the bit of the first subblock is obtained by replicating the bit of the second subblock, and a sequence number of the second subblock is after a sequence number of the first subblock, and wherein a quantity of information bits included in the first subblock is larger than a quantity of information bits included in the second subblock; and

performing, by the communications apparatus, polar decoding based on the to-be-decoded bit information to obtain polar decoded bits.

2 . The method according to claim 1 , wherein that the bit of the first subblock is obtained by replicating the bit of the second subblock comprises:

obtaining a first information bit of the first subblock by replicating a second information bit of the second subblock according to a mapping relationship, wherein the mapping relationship comprises a mapping relationship between a subchannel that is comprised in the first subblock and that carries the first information bit and a subchannel that is comprised in the second subblock and that carries the second information bit.

3 . The method according to claim 2 , wherein the performing polar decoding based on the to-be-decoded bit information to obtain polar decoded bits comprises:

performing polar decoding on the to-be-decoded bit information based on a first generator matrix and according to the mapping relationship to obtain the polar decoded bits, wherein

the first generator matrix is generated based on a second generator matrix, the second generator matrix comprises at least two matrix blocks distributed based on a preset location relationship, the matrix block comprises a plurality of first generator matrix cores, the first generator matrix comprises A matrix blocks, a location relationship between two adjacent matrix blocks in the A matrix blocks is determined based on the preset location relationship, and A is a positive integer.

4 . The method according to claim 3 , wherein the to-be-decoded bit information comprises Q first log likelihood ratios (LLRs), and Q is a positive integer.

5 . The method according to claim 4 , wherein the Q first LLRs comprise P first LLR sequences, a first LLR sequence of the P first LLR sequences comprises at least two first LLRs, and P is an integer greater than or equal to 2, and wherein the performing polar decoding on the to-be-decoded bit information based on a first generator matrix and according to the mapping relationship to obtain the polar decoded bits comprises:

determining P second LLR sequences corresponding to the P first LLR sequences, wherein one first LLR sequence corresponds to one subblock, and one second LLR sequence corresponds to one subblock;

determining, based on a P th second LLR sequence to obtain a codeword decoding result of a P th subblock and an information decoding result of the P th subblock; and

determining, based on at least one codeword decoding result of a subblock from a codeword decoding result of an (i+1) th subblock to the codeword decoding result of the P th subblock, at least one information decoding result of a subblock from an information decoding result of the (i+1) th subblock to the information decoding result of the P th subblock, and an i th second LLR sequence, a codeword decoding result of an i th subblock and an information decoding result of the i th subblock, wherein i is an integer ranging from 1 to P−1.

6 . The method according to claim 3 , wherein the location relationship between two adjacent matrix blocks in the A matrix blocks is the same as the preset location relationship.

7 . The method according to claim 2 , wherein the mapping relationship is determined based on a preset reliability sequence indicating a reliability ranking of subchannels in at least one of the first subblock or the second subblock.

8 . The method according to claim 7 , wherein the preset reliability sequence comprises a reliability ranking of subchannels of the first subblock, and the mapping relationship is determined by selecting a subchannel of the first subblock based on the reliability ranking.

9 . A decoding apparatus, wherein the decoding apparatus comprises:

at least one processor; and

one or more memories coupled to the at least one processor and storing programming instructions, which when executed by the at least one processor, cause the apparatus to:

receive to-be-decoded bit information, wherein the to-be-decoded bit information comprises information about a bit of a first subblock and information about a bit of a second subblock, the bit of the first subblock is obtained by replicating the bit of the second subblock, and a sequence number of the second subblock is after a sequence number of the first subblock, and wherein a quantity of information bits included in the first subblock is larger than a quantity of information bits included in the second subblock; and

perform polar decoding based on the to-be-decoded bit information to obtain polar decoded bits.

10 . The apparatus according to claim 9 , wherein the programming instructions, when executed by the at least one processor, cause the apparatus to:

obtain a first information bit of the first subblock by replicating a second information bit of the second subblock according to a mapping relationship, wherein the mapping relationship comprises a mapping relationship between a subchannel that is comprised in the first subblock and that carries the first information bit and a subchannel that is comprised in the second subblock and that carries the second information bit.

11 . The apparatus according to claim 10 , wherein the programming instructions, when executed by the at least one processor, cause the apparatus to:

perform polar decoding on the to-be-decoded bit information based on a first generator matrix and according to the mapping relationship to obtain the polar decoded bits, wherein

the first generator matrix is generated based on a second generator matrix, the second generator matrix comprises at least two matrix blocks distributed based on a preset location relationship, the matrix block comprises a plurality of first generator matrix cores, the first generator matrix comprises A matrix blocks, a location relationship between two adjacent matrix blocks in the A matrix blocks is determined based on the preset location relationship, and A is a positive integer.

12 . The apparatus according to claim 11 , wherein the to-be-decoded bit information comprises Q first log likelihood ratios (LLRs), and Q is a positive integer.

13 . The apparatus according to claim 12 , wherein the Q first LLRs comprise P first LLR sequences, a first LLR sequence of the P first LLR sequences comprises at least two first LLRs, and P is an integer greater than or equal to 2, and wherein the programming instructions, when executed by the at least one processor, cause the apparatus to:

determine P second LLR sequences corresponding to the P first LLR sequences, wherein one first LLR sequence corresponds to one subblock, and one second LLR sequence corresponds to one subblock;

determine, based on a P th second LLR sequence to obtain a codeword decoding result of a P th subblock and an information decoding result of the P th subblock; and

determine, based on at least one codeword decoding result of a subblock from a codeword decoding result of an (i+1) th subblock to the codeword decoding result of the P th subblock, at least one information decoding result of a subblock from an information decoding result of the (i+1) th subblock to the information decoding result of the P th subblock, and an i th second LLR sequence, a codeword decoding result of an i th subblock and an information decoding result of the i th subblock, wherein i is an integer ranging from 1 to P−1.

14 . The apparatus according to claim 11 , wherein the location relationship between two adjacent matrix blocks in the A matrix blocks is the same as the preset location relationship.

15 . The apparatus according to claim 10 , wherein the mapping relationship is determined based on a preset reliability sequence indicating a reliability ranking of subchannels in at least one of the first subblock or the second subblock.

16 . The apparatus according to claim 15 , wherein the preset reliability sequence comprises a reliability ranking of subchannels of the first subblock, and the mapping relationship is determined by selecting a subchannel of the first subblock based on the reliability ranking.

17 . A non-transitory computer-readable storage medium, wherein the computer-readable storage medium comprises a computer program, and the computer program, when executed by a computer, causes the computer to:

receive to-be-decoded bit information, wherein the to-be-decoded bit information comprises information about a bit of a first subblock and information about a bit of a second subblock, the bit of the first subblock is obtained by replicating the bit of the second subblock, and a sequence number of the second subblock is after a sequence number of the first subblock, and wherein a quantity of information bits included in the first subblock is larger than a quantity of information bits included in the second subblock; and

perform polar decoding based on the to-be-decoded bit information to obtain polar decoded bits.

18 . The non-transitory computer-readable storage medium according to claim 17 , wherein the computer program, when executed by the computer, causes the computer to:

obtain a first information bit of the first subblock by replicating a second information bit of the second subblock according to a mapping relationship, wherein the mapping relationship comprises a mapping relationship between a subchannel that is comprised in the first subblock and that carries the first information bit and a subchannel that is comprised in the second subblock and that carries the second information bit.

19 . The non-transitory computer-readable storage medium according to claim 18 , wherein the computer program, when executed by the computer, causes the computer to:

perform polar decoding on the to-be-decoded bit information based on a first generator matrix and according to the mapping relationship to obtain the polar decoded bits, wherein

the first generator matrix is generated based on a second generator matrix, the second generator matrix comprises at least two matrix blocks distributed based on a preset location relationship, the matrix block comprises a plurality of first generator matrix cores, the first generator matrix comprises A matrix blocks, a location relationship between two adjacent matrix blocks in the A matrix blocks is determined based on the preset location relationship, and A is a positive integer.

20 . The non-transitory computer-readable storage medium according to claim 19 , wherein the to-be-decoded bit information comprises Q first log likelihood ratios (LLRs), and Q is a positive integer.

21 . The non-transitory computer-readable storage medium according to claim 20 , wherein the Q first LLRs comprise P first LLR sequences, a first LLR sequence of the P first LLR sequences comprises at least two first LLRs, and P is an integer greater than or equal to 2, and wherein the computer program, when executed by the computer, causes the computer to:

determine P second LLR sequences corresponding to the P first LLR sequences, wherein one first LLR sequence corresponds to one subblock, and one second LLR sequence corresponds to one subblock;

determine, based on a P th second LLR sequence to obtain a codeword decoding result of a P th subblock and an information decoding result of the P th subblock; and

determine, based on at least one codeword decoding result of a subblock from a codeword decoding result of an (i+1) th subblock to the codeword decoding result of the P th subblock, at least one information decoding result of a subblock from an information decoding result of the (i+1) th subblock to the information decoding result of the P th subblock, and an i th second LLR sequence, a codeword decoding result of an i th subblock and an information decoding result of the i th subblock, wherein i is an integer ranging from 1 to P−1.

22 . The non-transitory computer-readable storage medium according to claim 19 , wherein the location relationship between two adjacent matrix blocks in the A matrix blocks is the same as the preset location relationship.

23 . The non-transitory computer-readable storage medium according to claim 18 , wherein the mapping relationship is determined based on a preset reliability sequence indicating a reliability ranking of subchannels in at least one of the first subblock or the second subblock.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 25, 2024
From: ZHANG, HUAZI; TONG, JIAJIE; ZHANG, GONGZHENG; DAI, SHENGCHEN; WANG, XIANBIN; LI, RONG; WANG, JUN
To: HUAWEI TECHNOLOGIES CO., LTD.
Reel/Frame 068692/0247 →
Priority Claims (1)
CN 202010554839.5 · Jun 17, 2020 · national
Continuity (3)
Continuation 18067513 · Dec 16, 2022
Continuation PCTCN2021100530 · Jun 17, 2021
Related Publication 20250015933A1 · Jan 9, 2025
References Cited (27)
US 11394399B2 · Li · 2022 [cited by examiner]
US 12074713B2 · Zhang · 2024 [cited by examiner]
US 20080059867A1 · Lin et al. · 2008 [cited by applicant]
US 20170132125A1 · Cai et al. · 2017 [cited by applicant]
US 20170214416A1 · Ge et al. · 2017 [cited by applicant]
US 20170366199A1 · Ge et al. · 2017 [cited by applicant]
US 20180323804A1 · Sadiq et al. · 2018 [cited by applicant]
US 20190028119A1 · Yang et al. · 2019 [cited by applicant]
US 20190393986A1 · Wang et al. · 2019 [cited by applicant]
US 20200099471A1 · Ye et al. · 2020 [cited by applicant]
US 20200343909A1 · Chen · 2020 [cited by examiner]
US 20210099213A1 · Chen et al. · 2021 [cited by applicant]
US 20220123767A1 · Bioglio et al. · 2022 [cited by applicant]
US 20220393701A1 · Fujimori · 2022 [cited by examiner]
US 20230030044A1 · Li · 2023 [cited by examiner]
CN 108282249A · 2018 [cited by applicant]
CN 109412608A · 2019 [cited by applicant]
CN 110447187A · 2019 [cited by applicant]
CN 110945814A · 2020 [cited by applicant]
WO 2019158112A1 · 2019 [cited by applicant]
WO 2019192461A1 · 2019 [cited by applicant]
WO 2019239467A1 · 2019 [cited by applicant]
Qualcomm Incorporated, “Sequence construction of Polar codes for control channel,” 3GPP TSG-RAN WG1 #90, R1-1713468, Prague, Czech Republic, Aug. 21-25, 2017, 15 pages. [cited by applicant]
Li et al., “Capacity-achieving rateless polar codes,” 2016 IEEE International Symposium on In-formation Theory (ISIT), Barcelona, Spain, Jul. 10-15, 2016, 5 pages. [cited by applicant]
Jung et al., “Construction of Rate-Compatible Punctured Polar Codes Using Hierarchical Puncturing,” 2018 IEEE International Symposium on Information Theory (ISIT), Vail, CO, USA, Jun. 17-22, 2018, 5 pages. [cited by applicant]
International Search Report and Written Opinion in International Appln. No. PCT/CN2021/100530, mailed on Sep. 15, 2021, 16 pages (with English translation). [cited by applicant]
Zhou et al., “Polarization Weight Family Methods for Polar Code Construction,” 2018 IEEE 87th Vehicular Technology Conference (VTC Spring), Jun. 3, 2018, pp. 1-5. [cited by applicant]