Polar code encoding method and apparatus

US11870457B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-11870457-B2
Application numberUS-202217826540-A
CountryUS
Kind codeB2
Filing dateMay 27, 2022
Priority dateNov 30, 2019
Publication dateJan 9, 2024
Grant dateJan 9, 2024

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.

This application discloses a polar code encoding method and apparatus, which can improve encoding performance through codeword construction. The method includes: obtaining K information bits to be encoded, where K is a positive integer; determining a first bit sequence based on the K information bits to be encoded, where a length of the first bit sequence is N, the first bit sequence includes fixed bits and the K information bits to be encoded, and the K information bits to be encoded may further include a check bit; determining a second bit sequence based on the first bit sequence and an upper triangular matrix, where the upper triangular matrix is a matrix having N rows and N columns, and the upper triangular matrix may be an upper triangular Toeplitz matrix; and performing polar code encoding on the second bit sequence to obtain and output an encoded sequence.

First claim

Opening claim text (preview).

What is claimed is: 1. A polar code encoding method implemented by a polar code encoding apparatus, comprising: obtaining, by an input interface circuit of the polar code encoding apparatus, K information bits to be encoded, wherein K is a positive integer; determining, by a processor of the polar code encoding apparatus, K information bit positions; mapping, by the processor of the polar code encoding apparatus, the K information bits to be encoded to the K information bit positions to obtain a first bit sequence, wherein a length of the first bit sequence is N, N is a positive integer power of 2, and the first bit sequence comprises fixed bits and the K information bits to be encoded; determining, by the processor of the polar code encoding apparatus, a second bit sequence based on the first bit sequence and an upper triangular matrix, wherein the upper triangular matrix is a matrix having N rows and N columns; performing, by the processor of the polar code encoding apparatus, polar code encoding on the second bit sequence to obtain an encoded sequence; and transmitting, by the output interface circuit of the polar code encoding apparatus, the encoded sequence to a device to be decoded. 2. The method according to claim 1 , wherein the upper triangular matrix is an upper triangular Toeplitz matrix. 3. The method according to claim 1 , wherein the K information bit positions is determined based on reliability sorting of N polarized channels for a polar code and a weight of each row in N rows of a generator matrix for the polar code, wherein the generator matrix for the polar code is a matrix having N rows and N columns, the N rows of the generator matrix for the polar code are in a one-to-one correspondence with N bit positions of the first bit sequence, and the N polarized channels are in a one-to-one correspondence with the N bit positions of the first bit sequence. 4. The method according to claim 3 , wherein the K information bit positions is determined by selecting bit positions corresponding to polarized channels having highest reliability when sorted in descending order and rows of the generator matrix for the polar code having weights not less than a first threshold, as the K information bit positions. 5. The method according to claim 3 , wherein the K information bit positions is determined by selecting bit positions corresponding to rows of the generator matrix for the polar code having largest weights when sorted in descending order and polarized channels having reliability not less than a second threshold in the reliability sorting of the polarized channels, as the K information bit positions. 6. The method according to claim 3 , wherein the K information bit positions is determined based on reliability sorting of the N polarized channels for the polar code with a polarized channel related to rate matching removed and based on a weight of each row in the N rows of the generator matrix for the polar code with a row related to rate matching removed, wherein the polarized channel related to rate matching comprises a punctured, shortened, or pre-frozen polarized channel, and the row related to rate matching comprises a row corresponding to the punctured, shortened, or pre-frozen polarized channel. 7. The method according to claim 1 , wherein the K information bit positions is determined according to the descending order of reliability of N polarized channels for a polar code, wherein the N polarized channels are in a one-to-one correspondence with N bit positions of the first bit sequence. 8. The method according to claim 1 , wherein the K information bit positions is determined based on a weight of each row in N rows of a generator matrix for a polar code, wherein the generator matrix for the polar code is a matrix having N rows and N columns, and the N rows of the generator matrix for the polar code are in a one-to-one correspondence with N bit positions of the first bit sequence. 9. The method according to claim 1 , wherein the determining a second bit sequence based on the first bit sequence and an upper triangular matrix comprises: multiplying the first bit sequence by the upper triangular matrix to obtain the second bit sequence. 10. The method according to claim 1 , wherein the performing polar code encoding on the second bit sequence to obtain an encoded sequence comprises: multiplying the second bit sequence by the generator matrix for the polar code to obtain the encoded sequence. 11. A polar code encoding apparatus, comprising: at least one processor; and at least one non-transitory memory coupled to the at least one processor and storing program instructions, wherein the at least one processor is configured to execute the program instructions to cause the polar code encoding apparatus to: obtain K information bits to be encoded, wherein K is a positive integer; determine K information bit positions; map the K information bits to be encoded to the K information bit positions to obtain a first bit sequence, wherein a length of the first bit sequence is N, N is a positive integer power of 2, and the first bit sequence comprises fixed bits and the K information bits to be encoded; determine a second bit sequence based on the first bit sequence and an upper triangular matrix, wherein the upper triangular matrix is a matrix having N rows and N columns; perform polar code encoding on the second bit sequence to obtain an encoded sequence; and transmit the encoded sequence to a device to be decoded. 12. The apparatus according to claim 11 , wherein the upper triangular matrix is an upper triangular Toeplitz matrix. 13. The apparatus according to claim 11 , wherein the at least one processor is further configured to execute the program instructions to cause the polar code encoding apparatus to: determine the K information bit positions based on reliability sorting of N polarized channels for a polar code and a weight of each row in N rows of a generator matrix for the polar code, wherein the generator matrix for the polar code is a matrix having N rows and N columns, the N rows of the generator matrix for the polar code are in a one-to-one correspondence with N bit positions of the first bit sequence, and the N polarized channels are in a one-to-one correspondence with the N bit positions of the first bit sequence. 14. The apparatus according to claim 13 , wherein the at least one processor is further configured to execute the program instructions to cause the polar code encoding apparatus to: select bit positions corresponding to polarized channels having highest reliability when sorted in descending order and rows of the generator matrix for the polar code having weights not less than a first threshold, as the K information bit positions. 15. The apparatus according to claim 13 , wherein the at least one processor is further configured to execute the program instructions to cause the polar code encoding apparatus to: select bit positions corresponding to rows of the generator matrix for the polar code having largest weights when sorted in descending order and polarized channels having reliability not less than a second threshold in the reliability sorting of the polarized channels, as the K information bit positions. 16. The apparatus according to claim 11 , wherein the at least one processor is further configured to execute the program instructions to cause the polar code encoding apparatus to: determine the K information bit positions based on reliability sorting of the N polarized channels for the polar code with a polarized channel related to rate matching remov

Assignees

Inventors

Classifications

  • H03M13/07Primary

    Arithmetic codes · CPC title

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

  • Hard decision decoding, e.g. bit flipping, modified or weighted bit flipping · CPC title

  • H03M13/13Primary

    Linear codes · CPC title

  • Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms · 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 US11870457B2 cover?
This application discloses a polar code encoding method and apparatus, which can improve encoding performance through codeword construction. The method includes: obtaining K information bits to be encoded, where K is a positive integer; determining a first bit sequence based on the K information bits to be encoded, where a length of the first bit sequence is N, the first bit sequence includes f…
Who is the assignee on this patent?
Huawei Tech Co Ltd
What technology area does this patent fall under?
Primary CPC classification H03M13/07. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Jan 09 2024 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 6 related publications on this page (citations in our corpus or others sharing the same primary CPC).