# US 2018/0323810 A1 · Early-termination techniques for polar list decoders

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2018/0323810 A1
- Document ID: US20180323810A1
- Status: Published application
- Kind: A1
- Application number: 15/969,724
- Filed: 2018-05-02
- Published: 2018-11-08
- Earliest claimed: 2017-05-05
- Assignees: QUALCOMM Incorporated
- Applicants: QUALCOMM Incorporated
- Inventors: Gabi Sarkis; Jing Jiang; Jamie Menjay Lin; Yang Yang
- Web page: https://patentgrep.com/patent/US20180323810A1

## CPC

- H03M 13/3961: {Arrangements of methods for branch or transition metric calculation}
- H03M 13/13: Linear codes
- H03M 13/3738: {with judging correct decoding}
- H03M 13/3753: {using iteration stopping criteria}
- H04L 1/0045: {Arrangements at the receiver end}
- H04L 1/0053: {specially adapted for power saving}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04W 72/0466: {the resource being a scrambling code}
- H04W 72/20: Control channels or signalling for resource management
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

Methods, systems, and devices for wireless communication are described. In a new radio (NR) system, a wireless device may identify a candidate codeword for a channel employing polar coding. The wireless device may perform a decoding operation on the candidate codeword to determine candidate decoding paths corresponding to encoded information bits. The decoding operation may include multiple decoding path candidates, each of which is associated with a path metric. The wireless device may evaluate a spread metric to determine if a decoding hypothesis is incorrect or if the received codeword is too corrupted for decoding. The spread metric may be based on the path metrics of the decoding paths or soft metrics of the decoding paths determined based on a subset of bit channels of the polar code. The wireless device may normalize the spread metric to compensate for signal-to-noise ratio (SNR) variation.

## Claims

### Claim 1

A method for wireless communication, comprising:
receiving a candidate codeword encoded using a polar code, the candidate codeword generated based at least in part on a plurality of information bits;
performing a decoding process on the candidate codeword, the decoding process comprising, for each bit channel of at least a first subset of bit channels of the polar code:
determining path metrics for each of a plurality of decoding paths;
determining a spread metric based at least in part on a first path metric corresponding to a first decoding path of the plurality of decoding paths and a second path metric corresponding to a second decoding path of the plurality of decoding paths; and
terminating the decoding process based at least in part on a comparison of the spread metric to a spread metric threshold.

### Claim 2 (depends on 1)

The method of claim 1, wherein:
the decoding process is terminated prior to completion of a list decoding process for the each bit channel of the first subset of bit channels.

### Claim 3 (depends on 1)

The method of claim 1, wherein:
the decoding process is terminated prior to completion of an error checking procedure on the plurality of decoding paths.

### Claim 4 (depends on 1)

The method of claim 1, wherein:
the decoding process is terminated following completion of both a list decoding process for the each bit channel of the first subset of bit channels and an error checking procedure on the plurality of decoding paths.

### Claim 5 (depends on 1)

The method of claim 1, wherein:
the first path metric corresponds to a maximum path metric or a minimum path metric of a set of path metrics associated with the plurality of decoding paths; and
the second path metric corresponds to the other of the maximum path metric or the minimum path metric of the set of path metrics.

### Claim 6 (depends on 1)

The method of claim 1, wherein:
the at least the first subset of bit channels of the polar code comprise bit channels subsequent to at least one bit channel corresponding to at least one of the plurality of information bits.

### Claim 7 (depends on 1)

The method of claim 1, wherein:
the path metrics for the plurality of decoding paths are based on bit metrics for the each bit channel for the plurality of decoding paths and for a second subset of bit channels of the polar code preceding the each bit channel for the plurality of decoding paths.

### Claim 8 (depends on 7)

The method of claim 7, further comprising:
selecting, according to a decoding order, the second subset of bit channels of the polar code preceding the each bit channel based at least in part on at least one of generator weights associated with bit channels of the polar code, reliability metrics associated with the bit channels of the polar code, or a combination thereof.

### Claim 9 (depends on 7)

The method of claim 7, wherein:
the second subset of bit channels of the polar code preceding the each bit channel comprises at least one information bit channel associated with one of the plurality of information bits and at least one frozen bit channel.

### Claim 10 (depends on 1)

The method of claim 1, wherein:
the spread metric is determined based at least in part on a function of a maximum path metric of a set of path metrics associated with the plurality of decoding paths, a minimum path metric of the set of path metrics or an average path metric of the set of path metrics.

### Claim 11 (depends on 1)

The method of claim 1, wherein:
the spread metric is determined based at least in part on a standard deviation of a set of path metrics associated with the plurality of decoding paths, a variance of the set of path metrics, or any combination thereof.

### Claim 12 (depends on 1)

The method of claim 1, wherein determining the spread metric comprises:
comparing the first path metric to the second path metric and normalizing the comparison with respect to one of the first path metric or the second path metric.

### Claim 13 (depends on 1)

The method of claim 1, wherein:
the decoding process is terminated based at least in part on the spread metric being below the spread metric threshold.

### Claim 14 (depends on 1)

The method of claim 1, wherein:
the spread metric threshold is selected based at least in part on one or both of an early-termination probability associated with the candidate codeword and an error-correction performance associated with the candidate codeword.

### Claim 15 (depends on 1)

The method of claim 1, wherein:
the candidate codeword is received via a physical downlink control channel (PDCCH) or a physical uplink control channel (PUCCH).

### Claim 16

An apparatus for wireless communication, comprising:
means for receiving a candidate codeword encoded using a polar code, the candidate codeword generated based at least in part on a plurality of information bits;
means for performing a decoding process on the candidate codeword, the means for performing the decoding process comprising, for each bit channel of at least a first subset of bit channels of the polar code:
means for determining path metrics for each of a plurality of decoding paths;
means for determining a spread metric based at least in part on a first path metric corresponding to a first decoding path of the plurality of decoding paths and a second path metric corresponding to a second decoding path of the plurality of decoding paths; and
means for terminating the decoding process based at least in part on a comparison of the spread metric to a spread metric threshold.

### Claim 17 (depends on 16)

The apparatus of claim 16, wherein:
the decoding process is terminated prior to completion of a list decoding process for the each bit channel of the first subset of bit channels.

### Claim 18 (depends on 16)

The apparatus of claim 16, wherein:
the decoding process is terminated prior to completion of an error checking procedure on the plurality of decoding paths.

### Claim 19 (depends on 16)

The apparatus of claim 16, wherein:
the decoding process is terminated following completion of both a list decoding process for the each bit channel of the first subset of bit channels and an error checking procedure on the plurality of decoding paths.

### Claim 20 (depends on 16)

The apparatus of claim 16, wherein:
the first path metric corresponds to a maximum path metric or a minimum path metric of a set of path metrics associated with the plurality of decoding paths; and
the second path metric corresponds to the other of the maximum path metric or the minimum path metric of the set of path metrics.

### Claim 21 (depends on 16)

The apparatus of claim 16, wherein:
the at least the first subset of bit channels of the polar code comprise bit channels subsequent to at least one bit channel corresponding to at least one of the plurality of information bits.

### Claim 22 (depends on 16)

The apparatus of claim 16, wherein:
the path metrics for the plurality of decoding paths are based on bit metrics for the each bit channel for the plurality of decoding paths and for a second subset of bit channels of the polar code preceding the each bit channel for the plurality of decoding paths.

### Claim 23 (depends on 22)

The apparatus of claim 22, further comprising:
means for selecting, according to a decoding order, the second subset of bit channels of the polar code preceding the each bit channel based at least in part on at least one of generator weights associated with bit channels of the polar code, reliability metrics associated with the bit channels of the polar code, or a combination thereof.

### Claim 24 (depends on 22)

The apparatus of claim 22, wherein:
the second subset of bit channels of the polar code preceding the each bit channel comprises at least one information bit channel associated with one of the plurality of information bits and at least one frozen bit channel.

### Claim 25 (depends on 16)

The apparatus of claim 16, wherein:
the spread metric is determined based at least in part on a function of a maximum path metric of a set of path metrics associated with the plurality of decoding paths, a minimum path metric of the set of path metrics or an average path metric of the set of path metrics.

### Claim 26 (depends on 16)

The apparatus of claim 16, wherein:
the spread metric is determined based at least in part on a standard deviation of a set of path metrics associated with the plurality of decoding paths, a variance of the set of path metrics, or any combination thereof.

### Claim 27 (depends on 16)

The apparatus of claim 16, wherein the means for determining the spread metric comprises:
means for comparing the first path metric to the second path metric and normalizing the comparison with respect to one of the first path metric or the second path metric.

### Claim 28 (depends on 16)

The apparatus of claim 16, wherein:
the decoding process is terminated based at least in part on the spread metric being below the spread metric threshold.

### Claim 29 (depends on 16)

The apparatus of claim 16, wherein:
the spread metric threshold is selected based at least in part on one or both of an early-termination probability associated with the candidate codeword and an error-correction performance associated with the candidate codeword.

### Claim 30 (depends on 16)

The apparatus of claim 16, wherein:
the candidate codeword is received via a physical downlink control channel (PDCCH) or a physical uplink control channel (PUCCH).

### Claim 31

An apparatus for wireless communication, comprising:
a processor;
memory in electronic communication with the processor; and
instructions stored in the memory and operable, when executed by the processor, to cause the apparatus to:
receive a candidate codeword encoded using a polar code, the candidate codeword generated based at least in part on a plurality of information bits;
perform a decoding process on the candidate codeword, the decoding process comprising, for each bit channel of at least a first subset of bit channels of the polar code:
determine path metrics for each of a plurality of decoding paths;
determine a spread metric based at least in part on a first path metric corresponding to a first decoding path of the plurality of decoding paths and a second path metric corresponding to a second decoding path of the plurality of decoding paths; and
terminate the decoding process based at least in part on a comparison of the spread metric to a spread metric threshold.

### Claim 32 (depends on 31)

The apparatus of claim 31, wherein:
the decoding process is terminated prior to completion of a list decoding process for the each bit channel of the first subset of bit channels.

### Claim 33 (depends on 31)

The apparatus of claim 31, wherein:
the decoding process is terminated prior to completion of an error checking procedure on the plurality of decoding paths.

### Claim 34 (depends on 31)

The apparatus of claim 31, wherein:
the decoding process is terminated following completion of both a list decoding process for the each bit channel of the first subset of bit channels and an error checking procedure on the plurality of decoding paths.

### Claim 35 (depends on 31)

The apparatus of claim 31, wherein:
the first path metric corresponds to a maximum path metric or a minimum path metric of a set of path metrics associated with the plurality of decoding paths; and
the second path metric corresponds to the other of the maximum path metric or the minimum path metric of the set of path metrics.

### Claim 36 (depends on 31)

The apparatus of claim 31, wherein:
the at least the first subset of bit channels of the polar code comprise bit channels subsequent to at least one bit channel corresponding to at least one of the plurality of information bits.

### Claim 37 (depends on 31)

The apparatus of claim 31, wherein:
the path metrics for the plurality of decoding paths are based on bit metrics for the each bit channel for the plurality of decoding paths and for a second subset of bit channels of the polar code preceding the each bit channel for the plurality of decoding paths.

### Claim 38 (depends on 37)

The apparatus of claim 37, wherein the instructions are further executable by the processor to:
select, according to a decoding order, the second subset of bit channels of the polar code preceding the each bit channel based at least in part on at least one of generator weights associated with bit channels of the polar code, reliability metrics associated with the bit channels of the polar code, or a combination thereof.

### Claim 39 (depends on 37)

The apparatus of claim 37, wherein:
the second subset of bit channels of the polar code preceding the each bit channel comprises at least one information bit channel associated with one of the plurality of information bits and at least one frozen bit channel.

### Claim 40 (depends on 31)

The apparatus of claim 31, wherein:
the spread metric is determined based at least in part on a function of a maximum path metric of a set of path metrics associated with the plurality of decoding paths, a minimum path metric of the set of path metrics or an average path metric of the set of path metrics.

### Claim 41 (depends on 31)

The apparatus of claim 31, wherein:
the spread metric is determined based at least in part on a standard deviation of a set of path metrics associated with the plurality of decoding paths, a variance of the set of path metrics, or any combination thereof.

### Claim 42 (depends on 31)

The apparatus of claim 31, wherein the instructions are further executable by the processor to:
compare the first path metric to the second path metric and normalizing the comparison with respect to one of the first path metric or the second path metric.

### Claim 43 (depends on 31)

The apparatus of claim 31, wherein:
the decoding process is terminated based at least in part on the spread metric being below the spread metric threshold.

### Claim 44 (depends on 31)

The apparatus of claim 31, wherein:
the spread metric threshold is selected based at least in part on one or both of an early-termination probability associated with the candidate codeword and an error-correction performance associated with the candidate codeword.

### Claim 45 (depends on 31)

The apparatus of claim 31, wherein:
the candidate codeword is received via a physical downlink control channel (PDCCH) or a physical uplink control channel (PUCCH).

### Claim 46

A non-transitory computer-readable medium storing code for wireless communication, the code comprising instructions executable by a processor to:
receive a candidate codeword encoded using a polar code, the candidate codeword generated based at least in part on a plurality of information bits;
perform a decoding process on the candidate codeword, the instructions executable by the processor to perform the decoding process comprising, for each bit channel of at least a first subset of bit channels of the polar code, further instructions executable by the processor to:
determine path metrics for each of a plurality of decoding paths;
determine a spread metric based at least in part on a first path metric corresponding to a first decoding path of the plurality of decoding paths and a second path metric corresponding to a second decoding path of the plurality of decoding paths; and
terminate the decoding process based at least in part on a comparison of the spread metric to a spread metric threshold.
