Cyclic shift based mapping schemes for uplink control transmissions

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 m {<u(n, m), ncs(n, m)>} of the base sequence and the cyclic shift,
• wherein m and n are non-negative integers,
• wherein the 2M combination sets are configured or predefined such that at most K elements are identical between any two combination sets of the 2M combination sets, wherein each of the at most K elements has an identical relative location in each of the any two combination sets, wherein K is a non-negative integer, and:
• wherein the cyclic shift for a j-th symbol is based on a 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)), wherein M(⋅) outputs the cyclic shift of its argument,
• Tcs(n,m)=mod(Yn,B), or mod(Yn+n′,B),
• Yn=mod(AYn−1,D),
• Y−1=m+C,
• wherein Yi is an i-th symbol, and wherein A, B, C, D, and n′ are positive integers.

An apparatus for wireless communication comprising processor electronics and a memory storing instructions, execution of which by the processor electronics 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 m {<u(n, m), ncs(n, m)>} of the base sequence and the cyclic shift,
• wherein m and n are non-negative integers,
• wherein the 2M combination sets are configured or predefined such that at most K elements are identical between any two combination sets of the 2M combination sets, wherein each of the at most K elements has an identical relative location in each of the any two combination sets, wherein K is a non-negative integer, and:
• wherein the cyclic shift for a j-th symbol is based on a 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)), wherein M(⋅) outputs the cyclic shift of its argument,
• Tcs(n,m)=mod(Yn,B), or mod(Yn+n′,B),
• Yn=mod(AYn−1,D),
• Y−1=m+C,
• wherein Yi is an i-th symbol, and wherein A, B, C, D, and n′ are positive integers.

An apparatus for wireless communication comprising a processor electronics and a memory storing instructions, execution of which by the processor electronics 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 m {<u(n, m), ncs(n, m)>} of the base sequence and the cyclic shift,
• wherein m and n are non-negative integers,
• wherein the 2M combination sets are configured or predefined such that at most K elements are identical between any two combination sets of the 2M combination sets, wherein each of the at most K elements has an identical relative location in each of the any two combination sets, wherein K is a non-negative integer, and:
• wherein the cyclic shift for a j-th symbol is based on a 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)), wherein M(⋅) outputs the cyclic shift of its argument,
• Tcs(n,m)=mod(Yn,B), or mod(Yn+n′,B),
• Yn=mod(AYn−1,D),
• Y−1=m+C,
• wherein Yi is an i-th symbol, and wherein A, B, C, D, and n′ are positive integers.