# US 2023/0146287 A1 · Cyclic shift based mapping schemes for uplink control transmissions

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

- Number: US 2023/0146287 A1
- Document ID: US20230146287A1
- Status: Published application
- Kind: A1
- Application number: 18/150,434
- Filed: 2023-01-05
- Published: 2023-05-11
- Earliest claimed: 2020-07-07
- Assignees: Zte Corporation
- Applicants: ZTE Corporation
- Inventors: Shuqiang Xia; Chunli Liang; Peng Hao; Xianghui Han
- Web page: https://patentgrep.com/patent/US20230146287A1

## CPC

- H04J 13/0074: {Code shifting or hopping}
- H04L 27/2605: {Symbol extensions, e.g. Zero Tail, Unique Word [UW]}
- H04W 72/21: in the uplink direction of a wireless link, i.e. towards the network
- H04L 5/0016: {Time-frequency-code}
- Y02D 30/70: in wireless communication networks
- H04J: MULTIPLEX COMMUNICATION (transmission in general H04B; peculiar to transmission of digital information H04L5/00; systems for the simultaneous or sequential transmission of more than one television signal H04N7/08; in exchanges H04Q11/00; stereophonic systems H04S)
- 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)
- Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE

## Abstract

Methods, systems, and devices for mapping schemes for cyclic shift based uplink control transmissions in mobile communication technology are described. An exemplary method for wireless communication includes transmitting, by a wireless device over a control channel, an M-bit payload using N symbols, wherein M and N are positive integers, wherein each of the N symbols is represented using a base sequence (u(n, m)) and a cyclic shift (ncs(n, m)) of the base sequence, wherein n=0, 1, . . . (N−1) indexes a symbol in the N symbols, wherein m=0, 1, . . . (2M−1) indexes a combination set, wherein m and n are non-negative integers, wherein the cyclic shift for a j-th symbol is based on a cyclic shift for a (j−1)-th symbol, and wherein j=1, 2, . . . (N−1) is a positive integer.

## Claims

### Claim 1

A method for wireless communication, comprising:
transmitting, by a wireless device over a control channel, an M-bit payload using N symbols, wherein M and N are positive integers,
wherein each of the N symbols is represented using a base sequence (u(n, m)) and a cyclic shift (ncs(n, m)) of the base sequence,
wherein n=0, 1, . . . (N−1) indexes a symbol in the N symbols,
wherein m=0, 1, . . . (2M−1) indexes a combination set,
wherein m and n are non-negative integers, and:
wherein (1) the cyclic shift for a j-th symbol is based on a cyclic shift for a (j−1)-th symbol, and wherein j=1, 2, . . . (N−1) is a positive integer, or (2) wherein the cyclic shift for each of the N symbols is based on one or more pseudorandom binary sequences.

### Claim 2 (depends on 1)

The method of claim 1, wherein the cyclic shift for a j-th symbol is based on the cyclic shift for a (j−1)-th symbol, wherein j=1, 2, . . . (N−1) is a positive integer, wherein the cyclic shift (ncs(n, m)) of the base sequence is determined as:
ncs(n, m)=M(Tcs(n, m)),
Tcs(n, m)=mod(Yn, B),
Yn=mod(AYn−1, D),
Y−1=m+C,
wherein Yi is an i-th symbol, wherein A, B, C, and D are positive integers, and wherein B is a number of cyclic shifts used for the base sequence.

### Claim 3 (depends on 1)

The method of claim 1, wherein the cyclic shift for a j-th symbol is based on the cyclic shift for a (j−1)-th symbol, wherein j=1, 2, . . . (N−1) is a positive integer, and wherein the cyclic shift (ncs(n, m)) of the base sequence is determined as:
ncs(n, m)=M(Tcs(n, m)),
Tcs(n, m)=mod(Yn+n′, B),
Yn=mod(AYn−1, D),
Y−1=m+C,
wherein Yi is an i-th symbol, wherein A, B, C, D, and n′ are positive integers, and wherein B is a number of cyclic shifts used for the base sequence.

### Claim 4 (depends on 2)

The method of claim 2, wherein C is a parameter specific to the wireless device, and wherein C is a function of a cell radio network temporary identifier (C-RNTI) associated with the wireless device.

### Claim 5 (depends on 1)

The method of claim 1, wherein the cyclic shift for each of the N symbols is based on the one or more pseudorandom binary sequences, and wherein the cyclic shift (ncs(n, m)) of the base sequence is determined as:
ncs(n, m)=mod(Σi=07c(8n+i)×2i, B),
wherein the one or more pseudorandom binary sequences comprise c(k), x1(k) and x2(k), which are defined as:
c(k)=mod(x1(k+Nc)+x2(k+Nc), 2),
x1(k+31)=mod(x1(k+3)+x1(k), 2),
x2(k+31)=mod(x2(k+3)+x2(k+2)+x2(k+1)+x2(k), 2),
wherein Nc is a positive integer.

### Claim 6 (depends on 5)

The method of claim 5, wherein an initialization of x2(k) is based on an uplink control information (UCI), and wherein the UCI comprises a bit sequence [a0, a1, . . . , am−1], and wherein x2(k) is initialized as:
x2(0)=a0, x2(1)=a1, x2(2)=a2, . . . , x2(M−1)=aM−1, and
x2(M)=x2(M+1)= . . . =x2(30)=0.

### Claim 7

A method for wireless communication, comprising:
receiving, by a network node from a wireless device over a control channel, an M-bit payload on N symbols, wherein M and N are positive integers; and
transmitting, subsequent to the receiving, one or more subsequent communications to the wireless device over a data channel,
wherein each of the N symbols is represented using a base sequence (u(n, m)) and a cyclic shift (ncs (n, m)) of the base sequence,
wherein n=0, 1, . . . (N−1) indexes a symbol in the N symbols,
wherein m=0, 1, . . . (2M−1) indexes a combination set,
wherein m and n are non-negative integers, and:
wherein (1) the cyclic shift for a j-th symbol is based on a cyclic shift for a (j−1)-th symbol, and wherein j=1, 2, . . . (N−1) is a positive integer, or (2) the cyclic shift for each of the N symbols is based on one or more pseudorandom binary sequences.

### Claim 8 (depends on 1)

The method of claim 1, wherein the cyclic shift for a j-th symbol is based on the cyclic shift for a (j−1)-th symbol, wherein j=1, 2, . . . (N−1) is a positive integer, wherein the cyclic shift (ncs(n, m)) of the base sequence is determined as:
ncs(n, m)=M(Tcs(n, m)),
Tcs(n, m)=mod(Yn, B),
Yn=mod(AYn−1, D),
Y−1=m+C,
wherein Yi is an i-th symbol, wherein A, B, C, and D are positive integers, and wherein B is a number of cyclic shifts used for the base sequence.

### Claim 9 (depends on 8)

The method of claim 8, wherein the cyclic shift for a j-th symbol is based on the cyclic shift for a (j−1)-th symbol, wherein j=1, 2, . . . (N−1) is a positive integer, and wherein the cyclic shift (ncs(n, m)) of the base sequence is determined as:
ncs(n, m)=M(Tcs(n, m)),
Tcs(n, m)=mod(Yn+n′, B),
Yn=mod(AYn−1, D),
Y−1=m+C,
wherein Yi is an i-th symbol, wherein A, B, C, D, and n′ are positive integers, and wherein B is a number of cyclic shifts used for the base sequence.

### Claim 10 (depends on 9)

The method of claim 9, wherein C is a parameter specific to the wireless device, and wherein C is a function of a cell radio network temporary identifier (C-RNTI) associated with the wireless device.

### Claim 11 (depends on 7)

The method of claim 7, wherein the cyclic shift for each of the N symbols is based on the one or more pseudorandom binary sequences, and wherein the cyclic shift (ncs(n, m)) of the base sequence is determined as:
ncs(n, m)=mod(Σi=07c(8n+i)×2i, B),
wherein the one or more pseudorandom binary sequences comprise c(k), x1(k) and x2(k), which are defined as:
c(k)=mod(x1(k+Nc)+x2(k+Nc), 2),
x1(k+31)=mod(x1(k+3)+x1(k), 2).

### Claim 12 (depends on 11)

The method of claim 11, wherein an initialization of x2(k) is based on an uplink control information (UCI), and wherein the UCI comprises a bit sequence [a0, a1, . . . , aM−1], and wherein x2(k) is initialized as:
x2(0)=a0, x2(1)=a1, x2(2)=a2, . . . , x2(M−1)=aM−1, and
x2(M)=x2(M+1)= . . . =x2(30)=0.

### Claim 13

An apparatus for wireless communication comprising a processor and a memory storing instructions, execution of which by the processor causes the apparatus to perform operations comprising:
transmitting, over a control channel, an M-bit payload using N symbols, wherein M and N are positive integers,
wherein each of the N symbols is represented using a base sequence (u(n, m)) and a cyclic shift (ncs(n, m)) of the base sequence,
wherein n=0, 1, . . . (N−1) indexes a symbol in the N symbols,
wherein m=0, 1, . . . (2M−1) indexes a combination set,
wherein m and n are non-negative integers, and:
wherein (1) the cyclic shift for a j-th symbol is based on a cyclic shift for a (j−1)-th symbol, and wherein j=1, 2, . . . (N−1) is a positive integer, or (2) wherein the cyclic shift for each of the N symbols is based on one or more pseudorandom binary sequences.

### Claim 14 (depends on 13)

The apparatus of claim 13, wherein the cyclic shift for a j-th symbol is based on the cyclic shift for a (j−1)-th symbol, wherein j=1, 2, . . . (N−1) is a positive integer, wherein the cyclic shift (ncs (n, m)) of the base sequence is determined as:
ncs(n, m)=M(Tcs(n, m)),
Tcs(n, m)=mod(Yn, B),
Yn=mod(AYn−1, D),
Y−1=m+C,
wherein Yi is an i-th symbol, wherein A, B, C, and D are positive integers, and wherein B is a number of cyclic shifts used for the base sequence.

### Claim 15 (depends on 13)

The apparatus of claim 13, wherein he cyclic shift for a j-th symbol is based on the cyclic shift for a (j−1)-th symbol, wherein j=1, 2, . . . (N−1) is a positive integer, and wherein the cyclic shift (ncs (n, m)) of the base sequence is determined as:
ncs(n, m)=M(Tcs(n, m)),
Tcs(n, m)=mod(Yn+n′, B),
Yn=mod(AYn−1, D),
Y−1=m+C,
wherein Yi is an i-th symbol, wherein A, B, C, D, and n′ are positive integers, and wherein B is a number of cyclic shifts used for the base sequence.

### Claim 16 (depends on 13)

The apparatus of claim 13, wherein the cyclic shift for each of the N symbols is based on the one or more pseudorandom binary sequences, and wherein the cyclic shift (ncs(n, m)) of the base sequence is determined as:
ncs(n, m)=mod(Σi=07c(8n+i)×2i, B),
wherein the one or more pseudorandom binary sequences comprise c(k), x1(k) and x2(k), which are defined as:
c(k)=mod(x1(k+Nc)+x2(k+Nc), 2),
x1(k+31)=mod(x1(k+3)+x1(k), 2),
x2(k+31)=mod(x2(k+3)+x2(k2)+x2(k+1)+x2(k), 2),
wherein Nc is a positive integer.

### Claim 17

An apparatus for wireless communication comprising a processor and a memory storing instructions, execution of which by the processor causes the apparatus to perform operations comprising:
receiving, from a wireless device over a control channel, an M-bit payload on N symbols, wherein M and N are positive integers; and
transmitting, subsequent to the receiving, one or more subsequent communications to the wireless device over a data channel,
wherein each of the N symbols is represented using a base sequence (u(n, m)) and a cyclic shift (ncs(n, m)) of the base sequence,
wherein n=0, 1, . . . (N−1) indexes a symbol in the N symbols,
wherein m=0, 1, . . . (2M−1) indexes a combination set,
wherein m and n are non-negative integers, and:
wherein (1) the cyclic shift for a j-th symbol is based on a cyclic shift for a (j−1)-th symbol, and wherein j=1, 2, . . . (N−1) is a positive integer, or (2) the cyclic shift for each of the N symbols is based on one or more pseudorandom binary sequences.

### Claim 18 (depends on 17)

The apparatus of claim 17, wherein the cyclic shift for a j-th symbol is based on the cyclic shift for a (j−1)-th symbol, wherein j=1, 2, . . . (N−1) is a positive integer, wherein the cyclic shift (n (n, m)) of the base sequence is determined as:
ncs(n, m)=M(Tcs(n, m)),
Tcs(n, m)=mod(Yn, B),
Yn=mod(AYn−1, D),
Y−1=m+C,
wherein Yi is an i-th symbol, wherein A, B, C, and D are positive integers, and wherein B is a number of cyclic shifts used for the base sequence.

### Claim 19 (depends on 17)

The apparatus of claim 17, wherein the cyclic shift for a j-th symbol is based on the cyclic shift for a (j−1)-th symbol, wherein j=1, 2, . . . (N−1) is a positive integer, and wherein the cyclic shift (n (n, m)) of the base sequence is determined as:
ncs(n, m)=M(Tcs(n, m)),
Tcs(n, m)=mod(Yn+n′, B),
Yn=mod(AYn−1, D),
Y−1=m+C,
wherein Yi is an i-th symbol, wherein A, B, C, D, and n′ are positive integers, and wherein B is a number of cyclic shifts used for the base sequence.

### Claim 20 (depends on 17)

The apparatus of claim 17, wherein the cyclic shift for each of the N symbols is based on the one or more pseudorandom binary sequences, and wherein the cyclic shift (ncs(n, m)) of the base sequence is determined as:
ncs(n, m)=mod(Σi=07c(8n+i)×2i, B),
wherein the one or more pseudorandom binary sequences comprise c(k), x1(k) and x2(k), which are defined as:
c(k)=mod(x1(k+Nc)+x2(k+Nc), 2),
x1(k+31)=mod(x1(k+3)+x1(k), 2),
x2(k+31)=mod(x2(k+3)+x2(k2)+x2(k+1)+x2(k), 2),
wherein Nc is a positive integer.
