# US 2024/0204912 A1 · Bit Order of NR PBCH Payload to Enhance Polar Code Performance

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

- Number: US 2024/0204912 A1
- Document ID: US20240204912A1
- Status: Published application
- Kind: A1
- Application number: 18/395,536
- Filed: 2023-12-23
- Published: 2024-06-20
- Earliest claimed: 2017-10-03
- Assignees: Telefonaktiebolaget LM Ericsson (publ)
- Applicants: Telefonaktiebolaget Lm Ericsson (Publ)
- Inventors: Anders Wesslén; Dennis Hui; Yufei Blankenship
- Web page: https://patentgrep.com/patent/US20240204912A1

## CPC

- H04L 1/0042: {Encoding specially adapted to other signal generation operation, e.g. in order to reduce transmit distortions, jitter, or to improve signal shape (H04L1/0067 takes precedence)}
- H03M 13/13: Linear codes
- H04L 1/0011: {applied to payload information}
- H04L 1/0058: {Block-coded modulation}
- H04L 1/0061: {Error detection codes}
- H04L 1/0071: {Use of interleaving (interleaving per se H03M13/27)}
- H03M 13/09: Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
- 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

Systems and methods are described herein that allow information carrying bits of a transmission block to be placed at higher-reliability positions prior to transmission. An exemplary method includes generating a set of payload bits to be encoded for transmission, wherein the set of payload bits includes at least one known bit, interleaving the set of payload bits to generate an interleaved set of payload bits, wherein the interleaved set includes the at least one known bit in a predetermined position in the interleaved set, providing the interleaved set to a cyclic redundancy check (CRC) encoder to generate CRC-interleaved set of payload bits, wherein the CRC-interleaved set includes the at least one known bit in a predetermined position within the CRC-interleaved set, and encoding the CRC-interleaved set for transmission to a wireless device. Associated network nodes and wireless devices are included.

## Claims

### Claim 1

A method for preparing a transport block for transmission by a network node, the method comprising:
generating a first set of payload bits to be encoded for transmission to a wireless device;
interleaving the set of payload bits to generate a second set of payload bits, wherein the second set includes the at least one known bit in a predetermined position in the second set;
generating a set of one or more parity check bits based on the first set of payload bits or the second set of payload bits, wherein at least some of the parity check bits have values known to the wireless device;
providing the second set of payload bits and the set of parity check bits to a cyclic redundancy check (CRC) encoder to generate a third set of payload bits, wherein the third set includes at least some of the parity check bits in a predetermined position within the third set;
encoding the third set with polar encoding for transmission to the wireless device; and
transmitting the polar-encoded third set to the wireless device.

### Claim 2 (depends on 1)

The method of claim 1, wherein the values known to the wireless device are known or partially known.

### Claim 3

(canceled)

### Claim 4

(canceled)

### Claim 5 (depends on 1)

The method of claim 1, wherein parity check bits are interleaved such that one or more parity checks are positioned in a high reliability position for transmission.

### Claim 6 (depends on 1)

The method of claim 1, wherein the set of payload bits comprises at least 13 known bits and wherein the known bits are placed at the following positions in the interleaved set of payload bits: [1, 4, 5, 8, 10, 11, 14, 15, 16, 20, 24, 26, 28].

### Claim 7

(canceled)

### Claim 8 (depends on 1)

The method of claim 1, wherein the one or more parity bits comprise values that are determined by the values of other bits in the CRC-interleaved set.

### Claim 9

(canceled)

### Claim 10

A network node for communication in a cellular communications network, the network node comprising:
a network interface in communication with a radio transceiver for communication with a wireless device via the cellular communications network;
a memory having executable instructions stored thereon;
processing circuitry in communication with the memory such that, when the processing circuitry executes the instructions, the processing performs operations comprising:
generating a first set of payload bits to be encoded for transmission to a wireless device;
interleaving the set of payload bits to generate a second set of payload bits, wherein the second set includes the at least one known bit in a predetermined position in the second set;
generating a set of one or more parity check bits based on the first set of payload bits or the second set of payload bits, wherein at least some of the parity check bits have values known to the wireless device;
providing the second set of payload bits and the set of parity check bits to a cyclic redundancy check (CRC) encoder to generate a third set of payload bits, wherein the third set includes at least some of the parity check bits in a predetermined position within the third set;
encoding the third set with polar encoding for transmission to the wireless device; and
transmitting the polar-encoded third set to the wireless device.

### Claim 11 (depends on 10)

The network node of claim 10, wherein the known value that is known or partially known.

### Claim 12

(canceled)

### Claim 13 (depends on 10)

The network node of claim 10, wherein encoding the third set for transmission comprises using a polar encoder to encode the third set for transmission.

### Claim 14 (depends on 10)

The network node of claim 10, wherein the interleaved such that the at least one known bit is located in a high reliability position for transmission.

### Claim 15 (depends on 10)

The network node of claim 10, wherein the set of payload bits comprises at least 13 known bits and wherein the known bits are placed at the following positions in the interleaved set of payload bits: [1, 4, 5, 8, 10, 11, 14, 15, 16, 20, 24, 26, 28].

### Claim 16

(canceled)

### Claim 17 (depends on 14)

The network node of claim 14, wherein the one or more parity bits comprise values that are determined by the values of other bits in the CRC-interleaved set.

### Claim 18 (depends on 10)

The network node of claim 10, wherein the processing circuitry comprises:
a first interleaver, wherein the first interleaver is a known-bit interleaver;
a cyclic redundancy check (CRC) encoder coupled to the first interleaver and to a second interleaver; and
a polar encoder coupled to the second interleaver.

### Claim 19

A method, comprising:
receiving a physical broadcast channel (PBCH) transmission from a network node, the PBCH transmission being encoded according to a polar encoding that places at least one known bit in a known location in the PBCH transmission, the at least one known bit having a known value; and
decoding the PBCH transmission received from the network node, wherein the decoding is based on the known value.

### Claim 20 (depends on 19)

The method of claim 19, wherein the polar encoding places a parity check (PC) bit at one of the known location.

### Claim 21 (depends on 20)

The method of claim 20, wherein the polar encoding couples a data bit with the PC bit and wherein a value of PC bit is determined based on the data bit.

### Claim 22

(canceled)

### Claim 23

(canceled)
