# US 12,191,980 B2 · Random access preambles in wireless communication > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,191,980 B2 - Document ID: US12191980B2 - Status: Granted - Kind: B2 - Application number: 17/403,605 - Filed: 2021-08-16 - Published: 2021-12-02 - Granted: 2025-01-07 - Earliest claimed: 2019-02-15 - Assignees: Zte Corporation - Applicants: ZTE Corporation - Inventors: Chenchen Zhang; Wei Cao; Zhen Yang; Kaibo Tian; Nan Zhang - Web page: https://patentgrep.com/patent/US12191980B2 ## CPC - H04J 13/0062: {Zadoff-Chu} - H04J 13/107: {by concatenation} - H04B 7/26: at least one of which is mobile - H04J 13/22: Allocation of codes with a zero correlation zone - H04L 27/2607: {Cyclic extensions} - H04L 27/2613: {Structure of the reference signals} - H04W 56/0045: {compensating for timing error by altering transmission time} - H04W 74/0833: Random access procedures, e.g. with 4-step access - 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) - H04B: TRANSMISSION - 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 Methods, systems, and devices for generating preamble sequences where several Zadoff-Chu (ZC) sequences are generated based on multiple roots and multiple cyclic shifts per root and combined to generate the preamble sequences. Some embodiments may be used in wireless communication embodiments in which large propagation delays and/or Doppler movement are expected. ## Claims ### Claim 1 A method of wireless communication, comprising: generating, by a wireless device, a preamble sequence by combining a plurality of Zadoff-Chu (ZC) sequences of a first length, wherein the plurality of ZC sequences is based on two or more roots including a first root and a second root different from the first root and a cyclic shift list per root, wherein each ZC sequence is based on a root of the two or more roots and a cyclic shift list corresponding to the root, wherein the generating the preamble sequence by combining the plurality of ZC sequences comprises: selecting the first root from the two or more roots and an ith cyclic shift list from a set of cyclic shift lists corresponding to the first root; selecting the second root from the two or more roots and a jth cyclic shift list from a set of cyclic shift lists corresponding to the second root, wherein an amount of cyclic shift between adjacent sequences in the ith cyclic shift list is different from an amount of cyclic shift between adjacent sequences in the jth cyclic shift list; generating a first group of ZC sequences based on the first root and the ith cyclic shift list; generating a second group of ZC sequences based on the second root and the jth cyclic shift list; and generating the preamble sequence by combining the first group of ZC sequences and the second group of ZC sequences; and generating, by the wireless device, a transmission waveform using the preamble sequence. ### Claim 2 (depends on 1) The method of claim 1, wherein the generating of the preamble sequence by combining the plurality of ZC sequences comprises: receiving a length of the ZC sequences, a plurality of roots including the two or more roots which include the first root and the second root, and a plurality of cyclic shift lists sets corresponding to the plurality of roots, wherein each cyclic shift lists set comprises a plurality of cyclic shift lists. ### Claim 3 (depends on 1) The method of claim 1, wherein the ith cyclic shift list corresponding to the first root comprises N cyclic shift values, wherein N is a positive integer, and the jth cyclic shift list corresponding to the second root comprises M cyclic shift values, wherein M is a positive integer. ### Claim 4 (depends on 2) The method of claim 2, wherein the plurality of roots and the plurality of cyclic shift lists sets corresponding to the plurality of roots, collectively uniquely identifies the preamble sequence from among a plurality of preamble sequences. ### Claim 5 (depends on 4) The method of claim 4, wherein any two cyclic shift lists in a cyclic shift lists set do not completely overlap with each other when a cyclic shift is applied to any one of the two cyclic shift lists. ### Claim 6 (depends on 1) The method of claim 1, further comprising: generating a cyclic prefix by prepending a portion of the preamble sequence, wherein the portion is obtained from a tail of the preamble sequence; and generating a guard time interval to follow the prepended preamble sequence. ### Claim 7 (depends on 1) The method of claim 1, wherein combining the first group of ZC sequences and the second group of ZC sequences comprises superposing the first group of ZC sequences and the second group of ZC sequences. ### Claim 8 (depends on 1) The method of claim 1, wherein combining the first group of ZC sequences and the second group of ZC sequences comprises concatenating and superposing the first group of ZC sequences and the second group of ZC sequences. ### Claim 9 (depends on 6) The method of claim 6, further comprising: generating a random access preamble signal based on the cyclic prefix, the preamble sequence, and the guard time interval; and transmitting the random access preamble signal to a wireless node. ### Claim 10 (depends on 9) The method of claim 9, further comprising receiving a timing advance value from the wireless node in response to transmitting the random access preamble signal to the wireless node. ### Claim 11 A wireless communication apparatus comprising a processor configured to implement a method, comprising: generating a preamble sequence by combining a plurality of Zadoff-Chu (ZC) sequences of a first length, wherein the plurality of ZC sequences is based on two or more roots including a first root and a second root different from the first root and a cyclic shift list per root, wherein each ZC sequence is based on a root of the two or more roots and a cyclic shift list corresponding to the root, wherein the generating the preamble sequence by combining the plurality of ZC sequences comprises: selecting the first root from the two or more roots and an ith cyclic shift list from a set of cyclic shift lists corresponding to the first root; selecting the second root from the two or more roots and a jth cyclic shift list from a set of cyclic shift lists corresponding to the second root, wherein an amount of cyclic shift between adjacent sequences in the ith cyclic shift list is different from an amount of cyclic shift between adjacent sequences in the jth cyclic shift list; generating a first group of ZC sequences based on the first root and the ith cyclic shift list; generating a second group of ZC sequences based on the second root and the jth cyclic shift list; and generating the preamble sequence by combining the first group of ZC sequences and the second group of ZC sequences; and generating a transmission waveform using the preamble sequence. ### Claim 12 (depends on 11) The apparatus of claim 11, wherein the generating of the preamble sequence by combining the plurality of ZC sequences comprises: receiving a length of the ZC sequences, a plurality of roots including the two or more roots which include the first root and the second root, and a plurality of cyclic shift lists sets corresponding to the plurality of roots, wherein each cyclic shift lists set comprises a plurality of cyclic shift lists. ### Claim 13 (depends on 11) The apparatus of claim 11, wherein the ith cyclic shift list corresponding to the first root comprises N cyclic shift values, wherein N is a positive integer, and the jth cyclic shift list corresponding to the second root comprises M cyclic shift values, wherein M is a positive integer. ### Claim 14 (depends on 11) The apparatus of claim 11, wherein the method further comprises: generating a cyclic prefix by prepending a portion of the preamble sequence, wherein the portion is obtained from a tail of the preamble sequence; and generating a guard time interval to follow the prepended preamble sequence. ### Claim 15 (depends on 11) The apparatus of claim 11, wherein combining the first group of ZC sequences and the second group of ZC sequences comprises superposing the first group of ZC sequences and the second group of ZC sequences. ### Claim 16 (depends on 11) The apparatus of claim 11, wherein combining the first group of ZC sequences and the second group of ZC sequences comprises concatenating and superposing the first group of ZC sequences and the second group of ZC sequences.