IP Library › Granted Patent US 12,463,664
Granted Patent B2
US 12,463,664 · App. 18/065,479 · Granted Nov 4, 2025

Polar code rate matching method and apparatus for satellite communication and terrestrial communication

Inventors: Shengchen Dai (Hangzhou, CN); Rong Li (Hangzhou, CN); Jiajie Tong (Hangzhou, CN); Huazi Zhang (Hangzhou, CN); Xianbin Wang (Hangzhou, CN); Jun Wang (Hangzhou, CN); Wei Huang (Shanghai, CN); Yourui Huangfu (Shanghai, CN)
Assignee: Huawei Technologies Co., Ltd.
H03M13/13H03M13/27H03M13/6362
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,463,664
App. No.
18/065,479
Granted
Nov 4, 2025
Kind
B2
Abstract

The present disclosure relates to polar code rate matching methods, apparatuses, and mediums. One example method includes obtaining K to-be-coded bits and a mother code length N, where N=2 n performing polar code encoding on the K to-be-coded bits based on the mother code length N to obtain an encoded bit sequence, performing rate matching on the polar-encoded bit sequence based on a rate matching sequence to obtain a rate matched sequence with a length of M, and outputting the rate matched sequence.

Claims (65)

1 . A polar code encoding rate matching method, comprising:

obtaining K to-be-encoded bits, a target code length M, and a mother code length N, wherein N=2 n , and M, K, n, and N are positive integers;

performing polar code encoding on the K to-be-encoded bits based on the mother code length N to obtain an encoded bit sequence;

performing rate matching on the encoded bit sequence based on a rate matching sequence to obtain a rate matched sequence, wherein the rate matching sequence is a subsequence of a first sequence, the first sequence is a sequence 1, a sequence 2, or a sequence 3 in Appendix I, the sequence 1 comprises N 2 polarized sub-channel sequence numbers starting from 0, the sequence 2 comprises N 2 /2 polarized sub-channel sequence numbers starting from 0, the sequence 3 comprises N 2 different values, and N 2 is greater than or equal to N; and

outputting the rate matched sequence.

2 . The method according to claim 1 , wherein performing the polar code encoding on the K to-be-encoded bits based on the mother code length N comprises:

mapping the K to-be-encoded bits to K polarized sub-channels in M-P non-punctured polarized sub-channels, wherein reliability of the K polarized sub-channels on which the K to-be-encoded bits are located is higher than reliability of remaining M-P-K polarized sub-channels, wherein P represents a quantity of pre-frozen polarized sub-channels, and wherein P is greater than or equal to 0.

3 . The method according to claim 1 , wherein before performing the rate matching on the encoded bit sequence based on the rate matching sequence to obtain the rate matched sequence, interleaving is performed on the encoded bit sequence.

4 . The method according to claim 1 , wherein a rate matching manner is a puncturing operation, wherein:

if the first sequence is the sequence 1, the puncturing operation comprises taking, based on the target code length M, bits carried by sub-channels corresponding to last M polarized sub-channel sequence numbers in the rate matching sequence, or deleting, based on the target code length M, bits carried by sub-channels corresponding to first N-M polarized sub-channel sequence numbers in the rate matching sequence;

if the first sequence is the sequence 2, the puncturing operation comprises deleting, based on the target code length M, bits carried by sub-channels corresponding to first N-M polarized sub-channel sequence numbers in the rate matching sequence; or

if the first sequence is the sequence 3, the puncturing operation comprises deleting, based on the target code length M, bits carried by polarized sub-channels at which N-M smallest values in the rate matching sequence are located, or taking, based on the target code length M, bits carried by polarized sub-channels corresponding to M largest values in the rate matching sequence.

5 . The method according to claim 1 , wherein:

when N=8192, the rate matching sequence is a sequence 1a, a sequence 2a, or a sequence 3a;

when N=4096, the rate matching sequence is a sequence 1b, a sequence 2b, or a sequence 3b;

when N=2048, the rate matching sequence is a sequence 1c, a sequence 2c, or a sequence 3c;

when N=1024, the rate matching sequence is a sequence 1d, a sequence 2d, or a sequence 3d; or

when N=512, the rate matching sequence is a sequence 1e, a sequence 2e, or a sequence 3e, wherein:

the sequence 1a, the sequence 1b, the sequence 1c, the sequence 1d, and the sequence 1e are subsequences of the sequence 1;

the sequence 2a, the sequence 2b, the sequence 2c, the sequence 2d, and the sequence 2e are subsequences of the sequence 2; and

the sequence 3a, the sequence 3b, the sequence 3c, the sequence 3d, and the sequence 3e are subsequences of the sequence 3.

6 . The method according to claim 1 , wherein the K to-be-encoded bits comprise cyclic redundancy check bits.

7 . The method according to claim 1 , wherein the K to-be-encoded bits comprise parity check bits.

8 . A polar code rate dematching method, comprising:

obtaining a to-be-decoded information sequence of M bits, wherein the to-be-decoded information sequence comprises K to-be-decoded bits;

determining a mother code length N, wherein N=2 n , and M, K, n, and N are positive integers;

performing rate dematching and decoding on the to-be-decoded information sequence based on the mother code length N and a rate matching sequence to obtain a decoding result, wherein the rate matching sequence is a subsequence of a first sequence, the first sequence is a sequence 1, a sequence 2, or a sequence 3 in Appendix I, the sequence 1 comprises N 2 polarized sub-channel sequence numbers starting from 0, the sequence 2 comprises N 2 /2 polarized sub-channel sequence numbers starting from 0, the sequence 3 comprises N 2 different values, and N 2 is greater than or equal to N; and

outputting the decoding result.

9 . The method according to claim 8 , wherein a rate matching manner is a puncturing operation, wherein

if the first sequence is the sequence 1, the puncturing operation comprises taking, based on a target code length M, bits carried by sub-channels corresponding to last M polarized sub-channel sequence numbers in the rate matching sequence, or deleting, based on the target code length M, bits carried by sub-channels corresponding to first N-M polarized sub-channel sequence numbers in the rate matching sequence;

if the first sequence is the sequence 2, the puncturing operation comprises deleting, based on the target code length M, bits carried by sub-channels corresponding to first N-M polarized sub-channel sequence numbers in the rate matching sequence; or

if the first sequence is the sequence 3, the puncturing operation comprises deleting, based on the target code length M, bits carried by polarized sub-channels at which N-M smallest values in the rate matching sequence are located, or taking, based on the target code length M, bits carried by polarized sub-channels corresponding to M largest values in the rate matching sequence.

10 . The method according to claim 8 , wherein:

when N=8192, the rate matching sequence is a sequence 1a, a sequence 2a, or a sequence 3a;

when N=4096, the rate matching sequence is a sequence 1b, a sequence 2b, or a sequence 3b;

when N=2048, the rate matching sequence is a sequence 1c, a sequence 2c, or a sequence 3c;

when N=1024, the rate matching sequence is a sequence 1d, a sequence 2d, or a sequence 3d; or

when N=512, the rate matching sequence is a sequence 1e, a sequence 2e, or a sequence 3e, wherein:

the sequence 1a, the sequence 1b, the sequence 1c, the sequence 1d, and the sequence 1e are subsequences of the sequence 1;

the sequence 2a, the sequence 2b, the sequence 2c, the sequence 2d, and the sequence 2e are subsequences of the sequence 2; and

the sequence 3a, the sequence 3b, the sequence 3c, the sequence 3d, and the sequence 3e are subsequences of the sequence 3.

11 . The method according to claim 8 , wherein the K bits comprise cyclic redundancy check bits.

12 . The method according to claim 8 , wherein the K bits comprise parity check bits.

13 . A polar code rate matching apparatus, comprising:

at least one processor; and

one or more memories coupled to the at least one processor and storing programming instructions for execution by the at least one processor to:

obtain K to-be-encoded bits and a target code length M, wherein K is a positive integer;

determine a mother code length N, and perform polar code encoding on the K to-be-encoded bits based on the mother code length N to obtain an encoded bit sequence, wherein N=2 n , n is a positive integer, and K≤N; and

perform rate matching on the encoded bit sequence based on a rate matching sequence to obtain a rate matched bit sequence with a length of M, wherein the rate matching sequence is a subsequence of a first sequence, the first sequence is a sequence 1, a sequence 2, or a sequence 3 in Appendix I, the sequence 1 comprises N 2 polarized sub-channel sequence numbers starting from 0, the sequence 2 comprises N 2 /2 polarized sub-channel sequence numbers starting from 0, the sequence 3 comprises N 2 different values, and N 2 is greater than or equal to N.

14 . The apparatus according to claim 13 , wherein performing the polar code encoding on the K to-be-encoded bits based on the mother code length N comprises:

mapping the K to-be-encoded bits to K polarized sub-channels in M-P non-punctured polarized sub-channels, wherein reliability of the K polarized sub-channels on which the K to-be-encoded bits are located is higher than reliability of remaining M-P-K polarized sub-channels, wherein P represents a quantity of pre-frozen polarized sub-channels, and wherein P is greater than or equal to 0.

15 . The apparatus according to claim 13 , wherein before performing the rate matching on the encoded bit sequence based on the rate matching sequence to obtain the rate matched bit sequence with a length of M, interleaving is performed on the encoded bit sequence.

16 . The apparatus according to claim 13 , wherein a rate matching manner is a puncturing operation, wherein:

if the first sequence is the sequence 1, the puncturing operation comprises taking, based on the target code length M, bits carried by sub-channels corresponding to last M polarized sub-channel sequence numbers in the rate matching sequence, or deleting, based on the target code length M, bits carried by sub-channels corresponding to first N-M polarized sub-channel sequence numbers in the rate matching sequence;

if the first sequence is the sequence 2, the puncturing operation comprises deleting, based on the target code length M, bits carried by sub-channels corresponding to first N-M polarized sub-channel sequence numbers in the rate matching sequence; or

if the first sequence is the sequence 3, the puncturing operation comprises deleting, based on the target code length M, bits carried by polarized sub-channels at which N-M smallest values in the rate matching sequence are located, or taking, based on the target code length M, bits carried by polarized sub-channels corresponding to M largest values in the rate matching sequence.

17 . The apparatus according to claim 13 , wherein:

when N=8192, the rate matching sequence is a sequence 1a, a sequence 2a, or a sequence 3a;

when N=4096, the rate matching sequence is a sequence 1b, a sequence 2b, or a sequence 3b;

when N=2048, the rate matching sequence is a sequence 1c, a sequence 2c, or a sequence 3c;

when N=1024, the rate matching sequence is a sequence 1d, a sequence 2d, or a sequence 3d; or

when N=512, the rate matching sequence is a sequence 1e, a sequence 2e, or a sequence 3e, wherein:

the sequence 1a, the sequence 1b, the sequence 1c, the sequence 1d, and the sequence 1e are subsequences of the sequence 1;

the sequence 2a, the sequence 2b, the sequence 2c, the sequence 2d, and the sequence 2e are subsequences of the sequence 2; and

the sequence 3a, the sequence 3b, the sequence 3c, the sequence 3d, and the sequence 3e are subsequences of the sequence 3.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 16, 2023
From: DAI, SHENGCHEN; LI, RONG; TONG, JIAJIE; ZHANG, HUAZI; WANG, XIANBIN; WANG, JUN; HUANG, WEI; HUANGFU, YOURUI
To: HUAWEI TECHNOLOGIES CO., LTD.
Reel/Frame 063650/0554 →
Priority Claims (1)
CN 202010554330.0 · Jun 17, 2020 · national
Continuity (2)
Continuation PCTCN2021099903 · Jun 12, 2021
Related Publication 20230113448A1 · Apr 13, 2023
References Cited (18)
US 10637609B2 · Xu · 2020 [cited by examiner]
US 10673466B2 · Chen · 2020 [cited by examiner]
US 10938422B2 · Chen · 2021 [cited by examiner]
US 10938506B2 · Zhang · 2021 [cited by examiner]
US 11005504B2 · Chen · 2021 [cited by examiner]
US 11750217B2 · Qiao · 2023 [cited by examiner]
US 20230113448A1 · Dai · 2023 [cited by examiner]
US 20230123058A1 · Dai · 2023 [cited by examiner]
CN 108288969A · 2018 [cited by applicant]
CN 108574562A · 2018 [cited by applicant]
CN 108631916A · 2018 [cited by applicant]
CN 108809486A · 2018 [cited by applicant]
CN 109391353A · 2019 [cited by applicant]
CN 110198200A · 2019 [cited by applicant]
CN 111200476A · 2020 [cited by applicant]
International Search Report and Written Opinion in International Appln. No. PCT/CN2021/099903, mailed on Sep. 13, 2021, 18 pages (with English translation). [cited by applicant]
Samsung, “Design of Unified Rate-Matching for Polar Codes,” 3GPP TSG RAN WG1 NR Ad-Hoc#2, R1-1710750, Qingdao, P.R. China, Jun. 27-30, 2017, 6 pages. [cited by applicant]
Extended European Search Report in European Appln. No. 21826123.8, mailed on Sep. 19, 2023, 14 pages. [cited by applicant]