Encoding and decoding method and apparatus

US12476656B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-12476656-B2
Application numberUS-202318463404-A
CountryUS
Kind codeB2
Filing dateSep 8, 2023
Priority dateMar 10, 2021
Publication dateNov 18, 2025
Grant dateNov 18, 2025

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

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.

First claim

Opening claim text (preview).

What is claimed is: 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 informat

Assignees

Inventors

Classifications

  • Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations · CPC title

  • Use of interleaving (interleaving per se H03M13/27) · CPC title

  • Block codes (H04L1/0061, H04L1/0064 take precedence) · CPC title

  • Arrangements at the transmitter end · CPC title

  • Specific encoding aspects, e.g. encoding by means of decoding · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US12476656B2 cover?
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…
Who is the assignee on this patent?
Huawei Tech Co Ltd
What technology area does this patent fall under?
Primary CPC classification H03M7/40. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Nov 18 2025 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 4 related publications on this page (citations in our corpus or others sharing the same primary CPC).