# US 11,444,667 B2 · Methods and apparatus for orthogonal sequence transmission with frequency hopping > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 11,444,667 B2 - Document ID: US11444667B2 - Status: Granted - Kind: B2 - Application number: 17/235,872 - Filed: 2021-04-20 - Published: 2021-10-28 - Granted: 2022-09-13 - Earliest claimed: 2020-04-22 - Assignees: QUALCOMM Incorporated - Applicants: QUALCOMM Incorporated - Inventors: Yi Huang; Wei Yang; Peter Gaal; Hwan Joon Kwon; Krishna Kiran Mukkavilli; Tingfang Ji; Wanshi Chen; Juan Montojo - Web page: https://patentgrep.com/patent/US11444667B2 ## CPC - H04B 7/0482: {Adaptive codebooks} - H04L 5/0012: {Hopping in multicarrier systems} - H04B 1/713: using frequency hopping - H04J 13/0074: {Code shifting or hopping} - H04J 13/12: Generation of orthogonal codes - H04L 5/0019: {in which one code is applied, as a temporal sequence, to all frequencies} - H04L 27/2613: {Structure of the reference signals} - H04W 72/0466: {the resource being a scrambling code} - H04W 72/21: in the uplink direction of a wireless link, i.e. towards the network - H04L 5/0048: {Allocation of pilot signals, i.e. of signals known to the receiver (allocation of control signalling H04L5/0053; use of control signalling H04L5/0091)} - H04L 27/26132: {using repetition} - H04L 27/26136: {Pilot sequence conveying additional information} - H04B: TRANSMISSION - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) - 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) - H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72) ## Abstract The present disclosure relates to methods and devices for wireless communication including an apparatus, e.g., a UE and/or base station. The apparatus can determine a first orthogonal matrix and a second orthogonal matrix, the first orthogonal matrix including a size of M×N1 with M×N1 rows and M×N1 columns, the second orthogonal matrix including a size of M×N2 with M×N2 rows and M×N2 columns. The apparatus can also determine a first codebook based on the first orthogonal matrix and a second codebook based on the second orthogonal matrix, the first codebook and the second codebook including a plurality of codepoints. Also, the apparatus can transmit a first signal and a second signal, the first signal including a first codepoint of the plurality of codepoints in the first codebook, the second signal including a second codepoint of the plurality of codepoints in the second codebook. ## Claims ### Claim 1 A method of wireless communication at a user equipment (UE), comprising: determining a first orthogonal matrix and a second orthogonal matrix; determining a first codebook based on the first orthogonal matrix and a second codebook based on the second orthogonal matrix, the first codebook including a plurality of codepoints, the second codebook including a plurality of codepoints; and transmitting at least one first signal and at least one second signal to convey a K bit payload in an uplink resource, the at least one first signal including a first codepoint of the plurality of codepoints in the first codebook, the at least one second signal including a second codepoint of the plurality of codepoints in the second codebook, where K is an integer. ### Claim 2 (depends on 1) The method of claim 1, wherein the at least one first signal is transmitted in a first frequency hop and the at least one second signal is transmitted in a second frequency hop. ### Claim 3 (depends on 1) The method of claim 1, further comprising: generating the first orthogonal matrix and the second orthogonal matrix, the first orthogonal matrix including a size of M×N1 with M×N1 rows and M×N1 columns, the second orthogonal matrix including a size of M×N2 with M×N2 rows and M×N2 columns, where M is an integer, N1 is an integer, and N2 is an integer. ### Claim 4 (depends on 1) The method of claim 1, wherein the first orthogonal matrix is determined via a Kronecker product of a first discrete Fourier transform (DFT) matrix and a frequency domain base sequence, the first DFT matrix including a size of N1×N1 with N1 rows and N1 columns, the frequency domain base sequence including a length M sequence and a cyclic shift m, and wherein the second orthogonal matrix is determined via a Kronecker product of a second DFT matrix and the frequency domain base sequence, the second DFT matrix including a size of N2×N2 with N2 rows and N2 columns, where N1 is an integer and N2 is an integer. ### Claim 5 (depends on 4) The method of claim 4, further comprising: selecting one or more rows or one or more columns in the first DFT matrix, wherein the first orthogonal matrix is determined via a Kronecker product of the one or more rows or one or more columns in the first DFT matrix and the frequency domain base sequence; and selecting one or more rows or one or more columns in the second DFT matrix, wherein the second orthogonal matrix is determined via a Kronecker product of the one or more rows or one or more columns in the second DFT matrix and the frequency domain base sequence. ### Claim 6 (depends on 1) The method of claim 1, further comprising: selecting the plurality of codepoints in the first codebook from the first orthogonal matrix; and selecting the plurality of codepoints in the second codebook from the second orthogonal matrix. ### Claim 7 (depends on 6) The method of claim 6, wherein the plurality of codepoints in the first codebook correspond to a number of rows or columns in the first orthogonal matrix, the number of rows or columns in the first orthogonal matrix being equal to 2K, wherein the plurality of codepoints in the second codebook correspond to a number of rows or columns in the second orthogonal matrix, the number of rows or columns in the second orthogonal matrix being equal to 2K, wherein the plurality of codepoints in the first codebook correspond to a plurality of first sequences and the plurality of codepoints in the second codebook correspond to a plurality of second sequences. ### Claim 8 (depends on 1) The method of claim 1, wherein the first codebook includes a size of 2K×(M×N1) with 2K rows and M×N1 columns, wherein the second codebook includes a size of 2K×(M×N2) with 2K rows and M×N2 columns, wherein K is a number of bits in an uplink control information (UCI) payload transmitted by the UE in a physical uplink control channel (PUCCH) resource, where M is an integer, N1 is an integer, and N2 is an integer. ### Claim 9 (depends on 8) The method of claim 8, further comprising: converting a bit stream of the UCI payload to a decimal number k; and selecting the first codepoint in the first codebook and the second codepoint in the second codebook, wherein the first codepoint is equal to a kth codepoint in the first codebook, wherein the second codepoint is equal to a kth codepoint in the second codebook. ### Claim 10 (depends on 1) The method of claim 1, wherein at least one of the at least one first signal or the at least one second signal are associated with a number of orthogonal frequency division multiplexing (OFDM) symbols, wherein the number of OFDM symbols is equal to N, where N is an integer. ### Claim 11 (depends on 10) The method of claim 10, wherein N1 is equal to N/2 and N2 is equal to N/2, wherein N is an even integer. ### Claim 12 (depends on 10) The method of claim 10, wherein N1 is equal to floor(N/2) and N2 is equal to ceil(N/2), wherein floor(N/2) is a greatest integer less than or equal to N/2 and ceil(N/2) is a least integer greater than or equal to N/2, wherein N is an odd integer. ### Claim 13 (depends on 1) The method of claim 1, wherein the at least one first signal and the at least one second signal are transmitted on a physical uplink control channel (PUCCH). ### Claim 14 An apparatus for wireless communication, the apparatus being a user equipment (UE), comprising: a memory; a transceiver; and at least one processor coupled to the memory and the transceiver and configured to: determine a first orthogonal matrix and a second orthogonal matrix; determine a first codebook based on the first orthogonal matrix and a second codebook based on the second orthogonal matrix, the first codebook including a plurality of codepoints, the second codebook including a plurality of codepoints; and transmit, via the transceiver, at least one first signal and at least one second signal to convey a K bit payload in an uplink resource, the at least one first signal including a first codepoint of the plurality of codepoints in the first codebook, the at least one second signal including a second codepoint of the plurality of codepoints in the second codebook, where K is an integer. ### Claim 15 (depends on 14) The apparatus of claim 14, wherein the first orthogonal matrix is determined via a Kronecker product of a first discrete Fourier transform (DFT) matrix and a frequency domain base sequence, the first DFT matrix including a size of N1×N1 with N1 rows and N1 columns, the frequency domain base sequence including a length M sequence and a cyclic shift m, and wherein the second orthogonal matrix is determined via a Kronecker product of a second DFT matrix and the frequency domain base sequence, the second DFT matrix including a size of N2×N2 with N2 rows and N2 columns, where N1 is an integer and N2 is an integer. ### Claim 16 (depends on 15) The apparatus of claim 15, wherein the at least one processor is further configured to: select one or more rows or one or more columns in the first DFT matrix, wherein the first orthogonal matrix is determined via a Kronecker product of the one or more rows or one or more columns in the first DFT matrix and the frequency domain base sequence; and select one or more rows or one or more columns in the second DFT matrix, wherein the second orthogonal matrix is determined via a Kronecker product of the one or more rows or one or more columns in the second DFT matrix and the frequency domain base sequence. ### Claim 17 (depends on 14) The apparatus of claim 14, wherein the at least one processor is further configured to: select the plurality of codepoints in the first codebook from the first orthogonal matrix; and select the plurality of codepoints in the second codebook from the second orthogonal matrix. ### Claim 18 (depends on 14) The apparatus of claim 14, wherein the first codebook includes a size of 2K×(M×N1) with 2K rows and M×N1 columns, wherein the second codebook includes a size of 2K×(M×N2) with 2K rows and M×N2 columns, wherein K is a number of bits in an uplink control information (UCI) payload transmitted by the UE in a physical uplink control channel (PUCCH) resource, where M is an integer, N1 is an integer, and N2 is an integer. ### Claim 19 (depends on 18) The apparatus of claim 18, wherein the at least one processor is further configured to: convert a bit stream of the UCI payload to a decimal number k; and select the first codepoint in the first codebook and the second codepoint in the second codebook, wherein the first codepoint is equal to a kth codepoint in the first codebook, wherein the second codepoint is equal to a kth codepoint in the second codebook. ### Claim 20 A method of wireless communication at a base station, comprising: receiving at least one first signal and at least one second signal to convey a K bit payload in an uplink resource, the at least one first signal associated with a first codebook including a plurality of codepoints, the at least one second signal associated with a second codebook including a plurality of codepoints, where K is an integer; correlating the at least one first signal with each of the plurality of codepoints in the first codebook and the at least one second signal with each of the plurality of codepoints in the second codebook; combining, based on the correlation, a first correlation output of the at least one first signal and a second correlation output of the at least one second signal, the first correlation output corresponding to a correlation with the at least one first signal and the second correlation output corresponding to a correlation with the at least one second signal; and determining at least one codepoint based on a highest combined correlation of the at least one first signal and the at least one second signal. ### Claim 21 (depends on 20) The method of claim 20, further comprising: concatenating the at least one first signal into a first vector and the at least one second signal into a second vector. ### Claim 22 (depends on 21) The method of claim 21, wherein the at least one first signal corresponds to a first grid and the at least one second signal corresponds to a second grid. ### Claim 23 (depends on 20) The method of claim 20, further comprising: generating the first correlation output of the at least one first signal; and generating the second correlation output of the at least one second signal. ### Claim 24 (depends on 23) The method of claim 23, wherein the at least one codepoint is determined based on a non-coherent energy combination of the first correlation output and the second correlation output. ### Claim 25 (depends on 20) The method of claim 20, wherein the at least one first signal is received in a first frequency hop and the at least one second signal is received in a second frequency hop. ### Claim 26 (depends on 20) The method of claim 20, wherein the plurality of codepoints in the first codebook correspond to a plurality of first sequences and the plurality of codepoints in the second codebook correspond to a plurality of second sequences. ### Claim 27 (depends on 20) The method of claim 20, wherein the first codebook includes a size of 2K×(M×N1) with 2K rows and M×N1 columns, wherein the second codebook includes a size of 2K×(M×N2) with 2K rows and M×N2 columns, where M is an integer, N1 is an integer, and N2 is an integer. ### Claim 28 (depends on 27) The method of claim 27, wherein K is a number of bits in an uplink control information (UCI) payload received by the base station in a physical uplink control channel (PUCCH) resource. ### Claim 29 (depends on 20) The method of claim 20, wherein the at least one first signal and the at least one second signal are received on a physical uplink control channel (PUCCH). ### Claim 30 An apparatus for wireless communication, the apparatus being a base station, comprising: a memory; a transceiver; and at least one processor coupled to the memory and the transceiver and configured to: receive, via the transceiver, at least one first signal and at least one second signal to convey a K bit payload in an uplink resource, the at least one first signal associated with a first codebook including a plurality of codepoints, the at least one second signal associated with a second codebook including a plurality of codepoints, where K is an integer; correlate the at least one first signal with each of the plurality of codepoints in the first codebook and the at least one second signal with each of the plurality of codepoints in the second codebook; combine, based on the correlation, a first correlation output of the at least one first signal and a second correlation output of the at least one second signal, the first correlation output corresponding to a correlation with the at least one first signal and the second correlation output corresponding to a correlation with the at least one second signal; and determine at least one codepoint based on a highest combined correlation of the at least one first signal and the at least one second signal.