# US 11,309,997 B2 · Generation of polar codes with a variable block length utilizing puncturing

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

- Number: US 11,309,997 B2
- Document ID: US11309997B2
- Status: Granted
- Kind: B2
- Application number: 16/874,264
- Filed: 2020-05-14
- Published: 2020-08-27
- Granted: 2022-04-19
- Earliest claimed: 2016-01-25
- Assignees: QUALCOMM Incorporated
- Applicants: QUALCOMM Incorporated
- Inventors: Changlong Xu; Jian Li; Jilei Hou; Neng Wang
- Web page: https://patentgrep.com/patent/US11309997B2

## CPC

- H04L 1/0068: {by puncturing}
- H03M 13/13: Linear codes
- H03M 13/618: {Shortening and extension of codes}
- H03M 13/6362: {by puncturing}
- H04L 1/0054: {Maximum-likelihood or sequential decoding, e.g. Viterbi, Fano, ZJ algorithms}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- 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)

## Abstract

Polar codes may be generated with a variable block length utilizing puncturing. Some puncturing schemes consider punctured bits as unknown bits, and set the log likelihood ratio (LLR) for those bits to zero; while other puncturing schemes consider punctured bits as known bits, and set the LLR for those bits to infinity. Each of these puncturing schemes has been observed to provide benefits over the other under different circumstances, especially corresponding to different coding rates or different signal to noise ratio (SNR). According to aspects of the present disclosure, both puncturing schemes are compared, and the puncturing scheme resulting in the better performance is utilized for transmission.

## Claims

### Claim 1

A method of polar coding, comprising:
selecting a puncturing pattern from a first puncturing pattern and a second puncturing pattern, wherein the first puncturing pattern comprises an unknown-bit puncturing scheme in which first punctured bit locations correspond to unknown bits and the second puncturing pattern comprises a known-bit puncturing scheme in which second punctured bit locations correspond to known bits;
polar coding an information block to produce a polar codeword; and
puncturing the polar codeword using the selected puncturing pattern to produce a punctured codeword comprising a codeword length other than a power of two.

### Claim 2 (depends on 1)

The method of claim 1, wherein the first puncturing pattern is a bit-reversal permutation of the second puncturing pattern.

### Claim 3 (depends on 1)

The method of claim 1, wherein the selecting the selected puncturing pattern from the first puncturing pattern and the second puncturing pattern further comprises:
selecting the puncturing pattern from the first puncturing pattern and the second puncturing pattern based on a coding rate.

### Claim 4 (depends on 3)

The method of claim 3, wherein the selecting the puncturing pattern from the first puncturing pattern and the second puncturing pattern based on the coding rate further comprises:
selecting the first puncturing pattern as the puncturing pattern when the coding rate is less than a coding rate threshold; and
selecting the second puncturing pattern as the puncturing pattern when the coding rate is greater than the coding rate threshold.

### Claim 5 (depends on 4)

The method of claim 4, wherein the coding rate threshold is ½.

### Claim 6 (depends on 1)

The method of claim 1, wherein:
a first reliability of first punctured bits of the polar codeword comprises a first value at a decoder when using the unknown-bit puncturing scheme;
a second reliability of second punctured bits of the polar codeword comprises a second value at the decoder when using the known-bit puncturing scheme, the second value being larger than the first value.

### Claim 7 (depends on 1)

The method of claim 1, wherein the selected puncturing pattern comprises a uniform puncturing pattern.

### Claim 8 (depends on 1)

The method of claim 1, wherein the selecting the puncturing pattern from the first puncturing pattern and the second puncturing pattern further comprises:
calculating a first log likelihood ratio (LLR) sum for the unknown-bit puncturing scheme;
calculating a second LLR sum for the known-bit puncturing scheme; and
selecting between the unknown-bit puncturing scheme and the known-bit puncturing scheme according to a greater LLR sum between the first LLR sum and the second LLR sum.

### Claim 9 (depends on 8)

The method of claim 8, wherein the polar codeword comprises a plurality of coded bit locations, each of the plurality of coded bit locations corresponding to one of a plurality of sub-channels over which the polar codeword is transmitted.

### Claim 10 (depends on 9)

The method of claim 9, wherein the calculating the first LLR sum for the unknown-bit puncturing scheme comprises:
setting a respective unknown-bit LLR for each coded bit location of the plurality of coded bit locations corresponding to one of the first punctured bit locations to zero; and
determining respective first coded bit LLRs for remaining ones of the plurality of coded bit locations.

### Claim 11 (depends on 10)

The method of claim 10, wherein the information block comprises a plurality of original bit locations, and wherein the calculating the first LLR sum for the unknown-bit puncturing scheme further comprises:
calculating respective first LLRs for the plurality of original bit locations of the information block from the respective first coded bit LLRs and the respective unknown-bit LLRs by performing density evolution or Gaussian approximation; and
calculating the first LLR sum based on the first LLRs.

### Claim 12 (depends on 11)

The method of claim 11, wherein the polar codeword comprises an original codeword length of N, and further comprising:
sorting the plurality of sub-channels based on the first LLRs;
selecting K best sub-channels of the plurality of sub-channels in accordance with the first LLRs;
setting first original bits of the information block corresponding to the K best sub-channels as information bits; and
setting second original bits of the information block corresponding to N−K sub-channels as frozen bits.

### Claim 13 (depends on 9)

The method of claim 9, wherein the calculating the second LLR sum for the known-bit puncturing scheme comprises:
setting a respective known-bit LLR for each coded bit location of the plurality of coded bit locations corresponding to one of the second punctured bit locations to a value greater than zero; and
determining respective second coded bit LLRs for remaining ones of the coded bit locations.

### Claim 14 (depends on 13)

The method of claim 13, wherein the information block comprises a plurality of original bit locations, and wherein calculating the second LLR sum for the known-bit puncturing scheme further comprises:
calculating respective second LLRs for the plurality of original bit locations of the information block from the respective second coded bit LLRs and the respective known-bit LLRs by performing density evolution or Gaussian approximation; and
calculating the second LLR sum based on the second LLRs.

### Claim 15 (depends on 14)

The method of claim 14, wherein the polar codeword comprises an original codeword length of N, and the punctured codeword comprises the codeword length of M, and further comprising:
sorting the plurality of sub-channels based on the second LLRs;
selecting K best sub-channels of the plurality of sub-channels, excluding the sub-channels corresponding to the second punctured bit locations, in accordance with the second LLRs;
setting first original bits of the information block corresponding to the K best sub-channels as information bits;
setting second original bits of the information block corresponding to the sub-channels corresponding to the second punctured bit locations as frozen bits; and
setting third original bits of the information block corresponding to a remaining number of sub-channels as frozen bits, wherein the remaining number of sub-channels is equal to a difference between N−K and N−M sub-channels.

### Claim 16 (depends on 1)

The method of claim 1, wherein the puncturing the polar codeword is performed during the polar coding the information block.

### Claim 17 (depends on 1)

The method of claim 1, wherein the polar codeword comprises an original codeword length of N, and the punctured codeword comprises the codeword length of M, and further comprising:
setting a last N−M original bits of the information block to zero when the selected puncturing pattern comprises the second puncturing pattern.

### Claim 18

An apparatus configured for polar coding, the apparatus comprising:
a processor;
a memory coupled to the processor; and
a transceiver coupled to the processor,
wherein the processor and the memory are configured to:
select a puncturing pattern from a first puncturing pattern and a second puncturing pattern, wherein the first puncturing pattern comprises an unknown-bit puncturing scheme in which first punctured bit locations correspond to unknown bits and the second puncturing pattern comprises a known-bit puncturing scheme in which second punctured bit locations correspond to known bits;
polar code an information block to produce a polar codeword; and
puncture the polar codeword using the selected puncturing pattern to produce a punctured codeword comprising a codeword length other than a power of two.

### Claim 19 (depends on 18)

The apparatus of claim 18, wherein the first puncturing pattern is a bit-reversal permutation of the second puncturing pattern.

### Claim 20 (depends on 18)

The apparatus of claim 18, wherein the processor and the memory are further configured to:
select the puncturing pattern from the first puncturing pattern and the second puncturing pattern based on a coding rate.

### Claim 21 (depends on 20)

The apparatus of claim 20, wherein the processor and the memory are further configured to:
select the first puncturing pattern as the puncturing pattern when the coding rate is less than a coding rate threshold; and
select the second puncturing pattern as the puncturing pattern when the coding rate is greater than the coding rate threshold.

### Claim 22 (depends on 21)

The apparatus of claim 21, wherein the coding rate threshold is ½.

### Claim 23 (depends on 18)

The apparatus of claim 18, wherein:
a first reliability of first punctured bits of the polar codeword comprises a first value at a decoder when using the unknown-bit puncturing scheme;
a second reliability of second punctured bits of the polar codeword comprises a second value at the decoder when using the known-bit puncturing scheme, the second value being larger than the first value.

### Claim 24 (depends on 18)

The apparatus of claim 18, wherein the selected puncturing pattern comprises a uniform puncturing pattern.

### Claim 25 (depends on 18)

The apparatus of claim 18, wherein the puncturing the polar codeword is performed during the polar coding the information block.

### Claim 26 (depends on 18)

The apparatus of claim 18, wherein the polar codeword comprises an original codeword length of N, and the punctured codeword comprises the codeword length of M, and wherein the processor and the memory are further configured to:
set a last N−M original bits of the information block to zero when the selected puncturing pattern comprises the second puncturing pattern.

### Claim 27

An apparatus configured for polar coding, the apparatus comprising:
means for selecting a puncturing pattern from a first puncturing pattern and a second puncturing pattern, wherein the first puncturing pattern comprises an unknown-bit puncturing scheme in which first punctured bit locations correspond to unknown bits and the second puncturing pattern comprises a known-bit puncturing scheme in which second punctured bit locations correspond to known bits;
means for polar coding an information block to produce a polar codeword; and
means for puncturing the polar codeword using the selected puncturing pattern to produce a punctured codeword comprising a codeword length other than a power of two.

### Claim 28 (depends on 27)

The apparatus of claim 27, wherein the first puncturing pattern is a bit-reversal permutation of the second puncturing pattern.

### Claim 29 (depends on 27)

The apparatus of claim 27, wherein the means for selecting the puncturing pattern from the first puncturing pattern and the second puncturing pattern further comprises:
means for selecting the puncturing pattern from the first puncturing pattern and the second puncturing pattern based on a coding rate.

### Claim 30 (depends on 29)

The apparatus of claim 29, wherein the means for selecting the puncturing pattern from the first puncturing pattern and the second puncturing pattern based on the coding rate further comprises:
means for selecting the first puncturing pattern as the puncturing pattern when the coding rate is less than a coding rate threshold; and
means for selecting the second puncturing pattern as the puncturing pattern when the coding rate is greater than the coding rate threshold.

### Claim 31 (depends on 30)

The apparatus of claim 30, wherein the coding rate threshold is ½.

### Claim 32 (depends on 27)

The apparatus of claim 27, wherein:
a first reliability of first punctured bits of the polar codeword comprises a first value at a decoder when using the unknown-bit puncturing scheme;
a second reliability of second punctured bits of the polar codeword comprises a second value at the decoder when using the known-bit puncturing scheme, the second value being larger than the first value.

### Claim 33 (depends on 27)

The apparatus of claim 27, wherein the selected puncturing pattern comprises a uniform puncturing pattern.

### Claim 34 (depends on 27)

The apparatus of claim 27, wherein the means for puncturing the polar codeword performs the puncturing during the polar coding of the information block by the means for polar coding.

### Claim 35 (depends on 27)

The apparatus of claim 27, wherein the polar codeword comprises an original codeword length of N, and the punctured codeword comprises the codeword length of M, and further comprising:
means for setting a last N-M original bits of the information block to zero when the selected puncturing pattern comprises the second puncturing pattern.