Multiple-symbol combination based decoding for general polar codes

US2017366204A1 · US · A1

Patent metadata
FieldValue
Publication numberUS-2017366204-A1
Application numberUS-201715611281-A
CountryUS
Kind codeA1
Filing dateJun 1, 2017
Priority dateJun 17, 2016
Publication dateDec 21, 2017
Grant date

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.

The present disclosure relates to multiple-symbol combination based decoding for general polar codes. Multiple-symbol combination based decoding of a received word that is based on a codeword involves determining whether all nodes at an intermediate stage of the multiple-symbol combination based decoding, which provide their outputs as inputs to a subset of nodes at a next stage of the multi-symbol combination based decoding, are associated with trust symbols in the received word that have a higher reliability of being successfully decoded than doubt symbols in the received word. A hard decision is performed in response to a positive determination.

First claim

Opening claim text (preview).

We claim: 1 . A method comprising: receiving a word that is based on a codeword, wherein the codeword was generated based on a generator matrix for a polar code and an input vector that includes information symbols; applying multiple-symbol combination based decoding to the received word, the multiple-symbol combination based decoding comprising: determining whether all nodes at an intermediate stage of the multiple-symbol combination based decoding, which provide their outputs as inputs to a subset of nodes at a next stage of the multiple-symbol combination based decoding, are associated with trust symbols in the received word that have a higher reliability of being successfully decoded than doubt symbols in the received word; and performing a hard decision in response to determining that all of the nodes at the intermediate stage, which provide their outputs as inputs to the subset of nodes at the next stage of the multiple-symbol combination based decoding, are associated with trust symbols. 2 . The method of claim 1 , wherein the multiple-symbol combination based decoding comprises List decoding. 3 . The method of claim 1 , wherein at least one of the information symbols in the input vector comprises a non-binary symbol. 4 . The method of claim 1 , wherein the input vector comprises at least one frozen symbol. 5 . The method of claim 1 , wherein the received word comprises a plurality of information symbol positions, wherein the method further comprises determining which of the information symbol positions in the received word are trust symbol positions and doubt symbol positions, and wherein determining whether all nodes at an intermediate stage, which provide their outputs as inputs to a subset of nodes at a next stage of the multiple-symbol combination based decoding, are associated with trust symbols is based on the determined trust symbol positions. 6 . The method of claim 5 , further comprising: receiving information indicative of a number of the information symbol positions in the received word that are trust symbol positions, wherein determining which of the information symbol positions in the received word are trust symbol positions and doubt symbol positions is based on the received information. 7 . The method of claim 5 , wherein determining which of the symbol positions in the received word are trust symbol positions and doubt symbol positions is based on one or more of: a decoding complexity and an error performance. 8 . A non-transitory processor-readable medium storing instructions which, when executed by one or more processors, cause the one or more processors to perform a method, the method comprising: receiving a word that is based on a codeword, wherein the codeword was generated based on a generator matrix for a polar code and an input vector that includes information symbols; applying multiple-symbol combination based decoding to the received word, the multiple-symbol combination based decoding comprising: determining whether all nodes at an intermediate stage of the multiple-symbol combination based decoding, which provide their outputs as inputs to a subset of nodes at a next stage of the multiple-symbol combination based decoding, are associated with trust symbols in the received word that have a higher reliability of being successfully decoded than doubt symbols in the received word; and performing a hard decision in response to determining that all of the nodes at the intermediate stage, which provide their outputs as inputs to the subset of nodes at the next stage of the multiple-symbol combination based decoding, are associated with trust symbols. 9 . An apparatus comprising: a receiver for receiving a word that is based on a codeword, wherein the codeword was generated based on a generator matrix for a polar code and an input vector that includes information symbols; and a processor, coupled to the receiver, configured to apply multiple-symbol combination based decoding to the received word, the multiple-symbol combination based decoding comprising: determining whether all nodes at an intermediate stage of the multiple-symbol combination based decoding, which provide their outputs as inputs to a subset of nodes at a next stage of the multiple-symbol combination based decoding, are associated with trust symbols in the received word that have a higher reliability of being successfully decoded than doubt symbols in the received word; and performing a hard decision in response to determining that all of the nodes at the intermediate stage, which provide their outputs as inputs to the subset of nodes at the next stage of the multiple-symbol combination based decoding are associated with trust symbols. 10 . The apparatus of claim 9 , wherein the multiple-symbol combination based decoding comprises List decoding. 11 . The apparatus of claim 9 , wherein at least one symbol in the input vector comprises a non-binary symbol. 12 . The apparatus of claim 9 , wherein the input vector comprises at least one frozen symbol. 13 . The apparatus of claim 9 , wherein the received word comprises a plurality of information symbol positions, wherein the processor is further configured to determine which of the information symbol positions in the received word are trust symbol positions and doubt symbol positions, and wherein the processor is configured to determine whether all nodes at an intermediate stage, which provide their outputs as inputs to a subset of nodes at a next stage of the multiple-symbol combination based decoding, are associated with trust symbols based on the determined trust symbol positions. 14 . The apparatus of claim 13 , wherein the processor is further configured to receive information indicative of a number of the information symbol positions in the received word that are trust symbol positions, wherein the processor is configured to determine which of the information symbol positions in the received word are trust symbol positions and doubt symbol positions based on the received information. 15 . The apparatus of claim 13 , wherein the processor is configured to determine which of the symbol positions in the received word are trust symbol positions and doubt symbol positions based on one or more of: a decoding complexity and an error performance.

Assignees

Inventors

Classifications

  • using symbol combining, e.g. Chase combining of symbols received twice or more · CPC title

  • H04L25/061Primary

    providing hard decisions only; arrangements for tracking or suppressing unwanted low frequency components, e.g. removal of DC offset (removal of DC offset in coupling arrangements H04L25/029, H04L25/0296) · CPC title

  • Non-binary linear block codes not provided for otherwise · CPC title

  • H03M13/616Primary

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

  • Linear codes · 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 US2017366204A1 cover?
The present disclosure relates to multiple-symbol combination based decoding for general polar codes. Multiple-symbol combination based decoding of a received word that is based on a codeword involves determining whether all nodes at an intermediate stage of the multiple-symbol combination based decoding, which provide their outputs as inputs to a subset of nodes at a next stage of the multi-sy…
Who is the assignee on this patent?
Shi Wuxian, Zhang Ran, Cheng Nan, and 2 more
What technology area does this patent fall under?
Primary CPC classification H03M13/3769. Mapped technology areas include Electricity.
When was this patent published?
Publication date Thu Dec 21 2017 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).