IP Library › Granted Patent US 12,476,656
Granted Patent B2
US 12,476,656 · App. 18/463,404 · Granted Nov 18, 2025

Encoding and decoding method and apparatus

Inventors: Bin Li (Shenzhen, CN); Jiaqi Gu (Shenzhen, CN); Huazi Zhang (Hangzhou, CN); Shengchen Dai (Hangzhou, CN)
Assignee: HUAWEI TECHNOLOGIES CO., LTD.
H03M13/27H03M13/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 12,476,656
App. No.
18/463,404
Granted
Nov 18, 2025
Kind
B2
Abstract

An encoding apparatus may obtain a to-be-encoded sequence, where the to-be-encoded sequence includes information bits and fixed bits, and the information bits and the fixed bits are determined based on reliability and/or row weights of generator matrices corresponding to the to-be-encoded bits; and perform a encoding process on the to-be-encoded sequence to obtain an encoded sequence, where the encoding process includes at least one interleaving process.

Claims (58)

1 . An encoding method, comprising:

obtaining a sequence for encoding, wherein the sequence corresponds to bits for encoding, the bits for encoding comprise information bits carrying target information and fixed bits carrying preset information, and the information bits and the fixed bits are determined based on reliability and/or row weights of generator matrices corresponding to the bits for encoding; and

performing an encoding process on the sequence to obtain an encoded sequence, wherein the encoding process comprises at least one interleaving process.

2 . The encoding method according to claim 1 , wherein the encoding process comprises:

performing a first encoding process on the sequence for encoding to obtain Q first encoded sequences, wherein Q is a positive integer;

performing a first interleaving process on at least one of the Q first encoded sequences to obtain Q second encoded sequences; and

performing a second encoding process on the Q second encoded sequences to obtain the encoded sequence.

3 . The encoding method according to claim 2 , wherein the second encoding process comprises:

performing a third encoding process on the Q second encoded sequences to obtain P third encoded sequences, wherein both P and Q are positive integers;

performing a second interleaving process on at least one of the P third encoded sequences to obtain P fourth encoded sequences; and

performing a fourth encoding process on the P fourth encoded sequences to obtain the encoded sequence.

4 . The encoding method according to claim 1 , wherein the encoding process comprises:

performing a first encoding process on the sequence to obtain Q first encoded sequences denoted as {C 1 (0) , C 2 (0) , . . . , C k (0) , . . . , C Q (0) };

performing a first interleaving process on Q/2 first encoded sequences {C 1 (0) , C 3 (0) , . . . , C 2k−1 (0) , . . . , C Q−1 (0) } in the Q first encoded sequences to obtain Q second encoded sequences {I 1 (1) (C 1 (0) ),C 2 , . . . ,I k (1) (C 2k−1 (0) ),C 2k , . . . ,I Q/2 (1) (C Q−1 (0) ),C Q }, wherein I k (1) indicates to perform first interleaving on a k th first encoded sequence in the Q first encoded sequences;

performing a third encoding process on the Q second encoded sequences to obtain P third encoded sequences {C 1 (1) , C 2 (1) , . . . , C k (1) , . . . , C P (1) }, wherein k, P, and Q are all positive integers, and C k (1) =[I k (1) (C 2k−1 (0) )+C 2k (0) ,C 2k (0) ];

performing a second interleaving process on P/2 third encoded sequences {C 1 (1) , C 3 (1) , . . . , C 2k−1 (1) , . . . , C Q−1 (1) } in the P third encoded sequences to obtain P fourth encoded sequences; and

performing a fourth encoding process on the P fourth encoded sequences to obtain the encoded sequence.

5 . The encoding method according to claim 1 , wherein the encoding process comprises: performing first encoding on the sequence to obtain Q first encoded sequences denoted as {C 1 (0) , C 2 (0) , . . . , C k (0) , . . . , C Q (0) }, wherein k and Q are positive integers;

performing a first interleaving process on Q/2 first encoded sequences {C 1 (0) , C 2 (0) , . . . , C k (0) , . . . , C Q (0) } in the Q first encoded sequences to obtain Q second encoded sequences denoted as {I 1 (1) (C 1 (0) ),C 2 , . . . ,I k (1) (C 2k−1 (0) ),C 2k , . . . ,I Q/2 (1) (C Q−1 (0) ),C Q }, wherein I k (1) indicates to perform first interleaving on a k th first encoded sequence in the Q first encoded sequences; and

performing a second encoding process on the Q second encoded sequences to obtain the encoded sequence.

6 . The encoding method according to claim 2 , wherein the first encoding process comprises: performing equivalent grouping on the sequence, equivalently treating the sequence as Q groups of sub-sequences, and performing an encoding process before a first interleaving process on the Q groups of sub-sequences.

7 . The encoding method according to claim 6 , wherein the performing equivalent grouping on the sequence comprises:

performing equivalent grouping on the sequence based on a predetermined number m of interleaving processes.

8 . The encoding method according to claim 2 , wherein the encoding process before the first interleaving process further comprises one or more interleaving processes.

9 . The encoding method according to claim 2 , wherein the second encoding process comprises: performing next-stage encoding on the Q interleaved second encoded sequences.

10 . The encoding method according to claim 1 , wherein row weights of generator matrices corresponding to the information bits are greater than or equal to row weights of generator matrices corresponding to the fixed bits.

11 . The encoding method according to claim 10 , wherein reliability corresponding to the information bits is greater than a reliability threshold.

12 . The encoding method according to claim 10 , further comprising:

calculating a row weight of a generator matrix corresponding to each of bits for encoding; and

sorting the bits for encoding in descending order of the row weights of the generator matrices, and selecting first K bits as the information bits, and other bits as the fixed bits; or sorting the bits for encoding in ascending order of the row weights of the generator matrices, and selecting last K bits as the information bits, and other bits as the fixed bits, wherein

a quantity K of the information bits is preset.

13 . The encoding method according to claim 11 , further comprising:

selecting, from the bits for encoding, a bit whose reliability is greater than the reliability threshold;

determining row weights of generator matrices corresponding to bits whose reliability is greater than the reliability threshold; and

sorting, in descending order of the row weights of the generator matrices, the bits whose reliability is greater than the reliability threshold, and selecting first K bits as the information bits, and other bits as the fixed bits; or sorting, in ascending order of the row weights of the generator matrices, the bits whose reliability is greater than the reliability threshold, and selecting last K bits as the information bits, and other bits as the fixed bits, wherein

a quantity K of the information bits is preset.

14 . The encoding method according to claim 11 , further comprising:

calculating reliability corresponding to each of the bits for encoding;

sorting the bits for encoding in descending order of the reliability or ascending order of the reliability;

selecting M bits based on the reliability threshold or a sequence number of the reliability corresponding to each of the M bits; and

selecting K bits from the M bits as the information bits based on a sequence number of a row weight of a generator matrix corresponding to each of the bits for encoding, wherein M is greater than or equal to K, and both M and K are positive integers.

15 . The encoding method according to claim 1 , wherein reliability corresponding to the information bits is greater than or equal to reliability corresponding to the fixed bits.

16 . The encoding method according to claim 15 , further comprising:

calculating reliability of a sub-channel corresponding to each of the bits for encoding; and

sorting the bits for encoding in descending order of the reliability, and selecting first K bits as the information bits, and other bits as the fixed bits; or sorting the bits for encoding in ascending order of the reliability, and selecting last K bits as the information bits, and other bits as the fixed bits, wherein

a quantity K of the information bits is preset.

17 . The encoding method according to claim 1 , wherein reliability corresponding to the information bits is greater than or equal to reliability corresponding to the fixed bits, and row weights of generator matrices corresponding to the information bits are greater than a row weight threshold.

18 . The encoding method according to claim 17 , further comprising:

selecting, from the bits for encoding, bits in which row weights of the generator matrices are greater than the row weight threshold;

determining reliability corresponding to the bits in which the row weights of the generator matrices are greater than the row weight threshold; and

sorting, in descending order of the reliability, the bits in which the row weights of the generator matrices are greater than the row weight threshold, and selecting first K bits as the information bits, and other bits as the fixed bits; or sorting, in descending order of the reliability or ascending order of the reliability, the bits in which the row weights of the generator matrices are greater than the row weight threshold, and selecting last K bits as the information bits, and other bits as the fixed bits, wherein

a quantity K of the information bits is preset.

19 . An encoding apparatus, comprising at least one processor and a memory storing instructions that, when executed by the at least one processor, cause the encoding apparatus to:

obtain a sequence for encoding, wherein the sequence corresponds to bits for encoding, the bits for encoding comprise information bits caring target information and fixed bits carrying preset information, and the information bits and the fixed bits are determined based on reliability and/or row weights of generator matrices corresponding to the bits for encoding; and

perform an encoding process on the sequence for encoding to obtain an encoded sequence, wherein the encoding process comprises at least one interleaving process.

20 . A decoding method comprising:

receiving a sequence for decoding, wherein the sequence for decoding are encoded based on a sequence corresponding to information bits carrying target information and fixed bits carrying preset information, and the information bits and the fixed bits are determined based on reliability and/or row weights of generator matrices corresponding to the information bits and the fixed bits; and

performing a decoding process on the sequence to obtain a decoded sequence, wherein the decoding process comprises at least one de-interleaving process between two decoding processes.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 4, 2024
From: LI, BIN; GU, JIAQI; ZHANG, HUAZI; DAI, SHENGCHEN
To: HUAWEI TECHNOLOGIES CO., LTD.
Reel/Frame 068482/0489 →
Priority Claims (1)
CN 202110260804.5 · Mar 10, 2021 · national
Continuity (2)
Continuation PCTCN2022079571 · Mar 7, 2022
Related Publication 20240030941A1 · Jan 25, 2024
References Cited (10)
US 11258463B2 · Luo · 2022 [cited by examiner]
US 20080055122A1 · Tan · 2008 [cited by examiner]
US 20190158226A1 · Hui · 2019 [cited by examiner]
US 20200067536A1 · Luo · 2020 [cited by examiner]
US 20200119846A1 · Wang · 2020 [cited by examiner]
CN 101371448A · 2009 [cited by applicant]
CN 108809500A · 2018 [cited by applicant]
CN 112448724A · 2021 [cited by applicant]
WO WO2008059160A2 · 2008 [cited by examiner]
International Search Report and Written Opinion issued in PCT/CN2022/079571, dated May 19, 2022, 10 pages. [cited by applicant]