# US 12,113,617 B2 · Puncturing and repetition for information encoding

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

- Number: US 12,113,617 B2
- Document ID: US12113617B2
- Status: Granted
- Kind: B2
- Application number: 17/319,283
- Filed: 2021-05-13
- Published: 2021-08-26
- Granted: 2024-10-08
- Earliest claimed: 2017-01-12
- Assignees: QUALCOMM Incorporated
- Applicants: QUALCOMM Incorporated
- Inventors: Hari Sankar; Gabi Sarkis; Changlong Xu; Alexei Gorokhov; Jing Jiang; Joseph Binamira Soriaga; Jilei Hou
- Web page: https://patentgrep.com/patent/US12113617B2

## CPC

- H04L 1/0068: {by puncturing}
- H04L 1/0069: {Puncturing patterns}
- H03M 13/13: Linear codes
- H03M 13/6356: {by repetition or insertion of dummy data, i.e. rate reduction}
- H03M 13/6362: {by puncturing}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- H04L 5/006: {Quality of the received signal, e.g. BER, SNR, water filling}
- 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

The disclosure relates in some aspects to information encoding. Information encoding may involve puncturing bits of a codeword or repeating bits of a codeword. The disclosure relates in some aspects to selecting a puncturing or repetition pattern. In some aspects, a puncture pattern for data encoding is selected based on a criterion that the output and the repetition input of an XOR are not erased. In some aspects, a repetition pattern for data encoding is selected based on a criterion that repetition not be applied for the output and the repetition input of an XOR.

## Claims

### Claim 1

A method of communication performed by a wireless communication device, comprising:
encoding data to generate a codeword comprising a plurality of bit tuples, each of the plurality of bit tuple comprising a first bit and a second bit of the codeword, the first bit being an output of a mutually exclusively logic, and the second bit being an input of the mutually exclusively logic;
swapping bits of the codeword; and
modifying the codeword by puncturing the swapped codeword of a plurality of bits of the codeword, wherein at most only one bit of a particular bit tuple of the plurality of bit tuples is punctured; and
transmitting the modified codeword.

### Claim 2 (depends on 1)

The method of claim 1, the encoding being Polar code encoding.

### Claim 3 (depends on 2)

The method of claim 2, the plurality of bit tuples comprising consecutive bits of the codeword.

### Claim 4 (depends on 3)

The method of claim 3, the consecutive bits being at a beginning of the codeword.

### Claim 5 (depends on 1)

The method of claim 1, encoding data being via a plurality of mutually exclusive logic stages, the mutually exclusively logic being a final stage of the plurality of mutually exclusive logic stages.

### Claim 6

An apparatus for communication, comprising:
a memory;
a processor coupled to the memory, the processor comprising a combination of computing components, the processor and the memory being configured to:
encode data to generate a codeword comprising a plurality of bit tuples, each of the plurality of bit tuple comprising a first bit and a second bit of the codeword, the first bit being an output of a mutually exclusively logic, and the second bit being an input of the mutually exclusively logic;
swap bits of the codeword;
modify the codeword by puncturing the swapped codeword of a plurality of bits of the codeword, wherein at most only one bit of a particular bit tuple of the plurality of bit tuples is punctured; and
transmit the modified codeword.

### Claim 7 (depends on 6)

The apparatus of claim 6, the processor and the memory being configured to encode data by Polar code encoding.

### Claim 8 (depends on 7)

The apparatus of claim 7, the plurality of bit tuples comprising consecutive bits of the codeword.

### Claim 9 (depends on 8)

The apparatus of claim 8, the consecutive bits being at a beginning of the codeword.

### Claim 10 (depends on 6)

The apparatus of claim 6, the processor and the memory being further configured to encode data via a plurality of mutually exclusive logic stages, the mutually exclusively logic being a final stage of the plurality of mutually exclusive logic stages.

### Claim 11

A method of communication performed by a wireless communication device, comprising:
encoding data, via a plurality of mutually exclusive logic stages, to generate a codeword comprising a plurality of bit tuple, each of the plurality of bit tuple comprising a first bit and a second bit of the codeword,
the first bit and the second bit being associated by a mutually exclusively logic,
the mutually exclusively logic being a final stage of the plurality of mutually exclusive logic stages;
swapping bits of the codeword;
modifying the codeword by puncturing the swapped codeword, wherein at most only one bit of a particular bit tuple of the plurality of bit tuples is punctured; and
transmitting the modified codeword.

### Claim 12 (depends on 11)

The method of claim 11, the encoding being Polar code encoding.

### Claim 13 (depends on 12)

The method of claim 12, the plurality of bit tuples comprising consecutive bits of the codeword.

### Claim 14 (depends on 13)

The method of claim 13, the consecutive bits being at a beginning of the codeword.

### Claim 15 (depends on 11)

The method of claim 11, the final stage being a last one of a most number of stages.

### Claim 16

An apparatus for communication, comprising:
a memory;
a processor coupled to the memory, the processor comprising a combination of computing components, the processor and the memory being configured to:
encode data, via a plurality of mutually exclusive logic stages, to generate a codeword comprising a plurality of bit tuples, each of the plurality of bit tuple comprising a first bit and a second bit of the codeword, the first bit and the second bit being associated by a mutually exclusively logic, the mutually exclusively logic being a final stage of the plurality of mutually exclusive logic stages;
swap bits of the codeword;
modify the codeword by puncturing on the swapped codeword, wherein at most only one bit of a particular bit tuple of the plurality of bit tuples is punctured; and
transmit the modified codeword.

### Claim 17 (depends on 16)

The apparatus of claim 16, the processor and the memory being configured to encode data by Polar code encoding.

### Claim 18 (depends on 17)

The apparatus of claim 17, the plurality of bit tuple comprising consecutive bits of the codeword.

### Claim 19 (depends on 18)

The apparatus of claim 18, the consecutive bits being at a beginning of the codeword.

### Claim 20 (depends on 16)

The apparatus of claim 16, the final stage being a last one of a most number of stages.

### Claim 21 (depends on 2)

The method of claim 2,
the puncturing swapped codeword being based on a puncture pattern,
the puncture pattern being based on puncturing a number of bits associated with the plurality of bit tuples,
each of the plurality bit tuples having at most only one bit punctured.

### Claim 22 (depends on 2)

The method of claim 2,
the second bit being one bit of the data, and the particular bit tuple having no bit punctured.

### Claim 23 (depends on 7)

The apparatus of claim 7, the processor and the memory being further configured to:
puncture the swapped codeword being based on a puncture pattern,
the puncture pattern being based on puncturing a number of bits associated with the plurality of bit tuples,
each of the plurality bit tuples having at most only one bit punctured.

### Claim 24 (depends on 7)

The apparatus of claim 7,
the second bit being one bit of the data, and the particular bit tuple having no bit punctured.