# US 11,309,920 B2 · Recipient identification for fifth generation communication

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

- Number: US 11,309,920 B2
- Document ID: US11309920B2
- Status: Granted
- Kind: B2
- Application number: 16/461,064
- Filed: 2017-10-31
- Published: 2019-09-05
- Granted: 2022-04-19
- Earliest claimed: 2016-12-02
- Assignees: Nokia Technologies Oy
- Applicants: Nokia Technologies Oy
- Inventors: Jaakko Eino Ilmari Vihriälä; Keeth Saliya Jayasinghe
- Web page: https://patentgrep.com/patent/US11309920B2

## CPC

- H03M 13/618: {Shortening and extension of codes}
- H03M 13/09: Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
- H03M 13/1194: {Repeat-accumulate [RA] codes}
- H03M 13/13: Linear codes
- H03M 13/2906: {using block codes (H03M13/2957 takes precedence)}
- H03M 13/2957: {Turbo codes and decoding}
- H03M 13/6362: {by puncturing}
- H04L 1/0013: {Rate matching, e.g. puncturing or repetition of code symbols}
- H04L 1/004: {by using forward error control (H04L1/0618 takes precedence; coding, decoding or code conversion, for error detection or correction H03M13/00)}
- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 1/0067: {Rate matching (H04L1/0013 and H04L1/08 take precedence)}
- H04W 28/06: Optimizing {the usage of the radio link}, e.g. header compression, information sizing {, discarding information (system modifying transmission characteristic according to link quality by modifying frame length H04L1/0007; dynamic adaptation of the packet size for flow control or congestion control H04L47/365)}
- H04W 72/23: in the downlink direction of a wireless link, i.e. towards a terminal
- H04W 76/11: Allocation or use of connection identifiers
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- 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

Identification of communication participants may be an important aspect of various communication systems. For example, fifth generation (5G) wireless communication systems may benefit from suitable recipient identification. A method can include obtaining data bits to be communicated to a target device. The method can also include obtaining identification bits corresponding to at least one of sender or receiver of the data bits. The method can further include multiplexing the data bits with the identification bits.

## Claims

### Claim 1

An apparatus, comprising:
at least one processor; and
at least one memory including computer program code, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to perform:
obtain data bits to be communicated to a target device;
obtain identification bits corresponding to at least one of sender or receiver of the data bits;
multiplex the data bits with the identification bits by insertion coding, wherein the identification bits are used as known bits in the insertion coding; and
encode the multiplexed bits.

### Claim 2 (depends on 1)

The apparatus of claim 1, wherein the identification bits comprise a radio network temporary identifier.

### Claim 3 (depends on 1)

The apparatus of claim 1, wherein the identification bits comprise a common identifier of a plurality of receiving devices.

### Claim 4 (depends on 1)

The apparatus of claim 1, wherein the data bits comprise downlink control information.

### Claim 5 (depends on 1)

The apparatus of claim 1, wherein the identification bits are used as known bits with channel code shortening.

### Claim 6 (depends on 1)

The apparatus of claim 1, wherein the at least one memory and the computer program code are further configured to, with the at least one processor, cause the apparatus to: remove identification data bits from the encoded bits.

### Claim 7 (depends on 1)

The apparatus of claim 1, wherein the at least one memory and the computer program code are further configured to, with the at least one processor, cause the apparatus to: perform rate matching on the encoded data bits.

### Claim 8

An apparatus, comprising:
at least one processor; and
at least one memory including computer program code,
wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to perform:
receive encoded data bits; and
insert logarithmic likelihood ratio values corresponding to identification data bits into the received encoded data bits.

### Claim 9 (depends on 8)

The apparatus of claim 8, wherein identification bits comprise a radio network temporary identifier.

### Claim 10 (depends on 8)

The apparatus of claim 8, wherein the data bits comprise downlink control information.

### Claim 11 (depends on 8)

The apparatus of claim 8, wherein the at least one memory and the computer program code are further configured to, with the at least one processor, cause the apparatus to: decode the combined logarithmic likelihood ratio values and encoded data bits.

### Claim 12 (depends on 11)

The apparatus of claim 11, wherein the at least one memory and the computer program code are further configured to, with the at least one processor, cause the apparatus to: remove the identification data bits.

### Claim 13 (depends on 8)

The apparatus of claim 8, wherein the at least one memory and the computer program code are further configured to, with the at least one processor, cause the apparatus to: rate dematch the encoded data bits prior to inserting the logarithmic likelihood ratio values.

### Claim 14

A method, comprising:
obtaining data bits to be communicated to a target device;
obtaining identification bits corresponding to at least one of sender or receiver of the data bits;
multiplexing the data bits with the identification bits by insertion coding, wherein the identification bits are used as known bits in the insertion coding; and
encoding the multiplexed bits.

### Claim 15 (depends on 14)

The method of claim 14, wherein the identification bits comprise a radio network temporary identifier.

### Claim 16 (depends on 14)

The method of claim 14, wherein the identification bits comprise a common identifier of a plurality of receiving devices.

### Claim 17 (depends on 14)

The method of claim 14, wherein the identification bits are used as known bits with channel code shortening.

### Claim 18 (depends on 14)

The method of claim 14, further comprising: removing identification data bits from the encoded bits.