Communication method and apparatus

Abstract

A communication method and an apparatus, relating to the field of communications, and capable of increasing the capacity of a random access sequence and reducing the random access collision probability of a terminal device. In the communication method, the terminal device may initiate random access by using a random access sequence that is constructed by using a ZC sequence and an m sequence and that has a large sequence capacity and a low ambiguity zone. A cyclic shift of a base sequence of the random access sequence is associated with a maximum round-trip delay, and a cyclic shift or a phase shift of an auxiliary sequence is associated with a maximum Doppler frequency shift. This can resist a Doppler frequency shift for any subcarrier spacing, and is not constrained by a condition that the area of a maximum low ambiguity zone does not exceed the length of the ZC sequence.

Description

Communication method and apparatus

[0001] This application claims priority to the Chinese patent application No. 202410745736.5, filed on June 7, 2024, and entitled "Communication method and apparatus", the entire content of which is incorporated herein by reference. TECHNICAL FIELD

[0002] The present application relates to the field of communication, in particular to a communication method and apparatus. BACKGROUND

[0003] In long term evolution (LTE) / new radio (NR) communication, a physical random access channel (PRACH) sequence can be generated by cyclically shifting a ZC (Zadoff-Chu) sequence, and different cyclic shifts of the same root sequence form a zero correlation zone, and any cyclic shift of different root sequences forms a low correlation zone. However, there are the following problems in constructing a PRACH sequence using a ZC sequence:

[0004] (1) ZC sequence capacity is limited: on the one hand, the ZC sequence is proportional to the square of the length of the ZC sequence, and on the other hand, in the random access of the high-speed mobile scene, the greater the Doppler shift, the fewer the available cyclic shifts, resulting in fewer ZC sequences available for random access, and the maximum Doppler shift that the limited ZC sequence can resist does not exceed 2 subcarrier spacings;

[0005] (2) The ambiguity function of the ZC sequence has a multi-peak characteristic, and cannot determine the accurate time delay and / or Doppler;

[0006] (3) The maximum low ambiguity zone area (the product of the maximum round trip time and the maximum Doppler shift) of the ZC sequence does not exceed the length of the ZC sequence.

[0007] Therefore, how to solve the above problems in constructing a PRACH sequence using a ZC sequence is an urgent research topic. SUMMARY

[0008] The present application provides a communication method and apparatus, which constructs a PRACH sequence with large sequence capacity and low ambiguity zone using a ZC sequence and an m sequence, which can improve the PRACH sequence capacity, resist Doppler shift of any subcarrier spacing, and is not constrained by the condition that the maximum low ambiguity zone area does not exceed the length of the ZC sequence.

[0009] To achieve the above purpose, the present application adopts the following technical solutions:

[0010] In a first aspect, a communication method is provided. The method can be applied to a terminal side, such as a terminal device, or a component or module of the terminal device, or a circuit or processor or chip (such as a modem chip, also known as a baseband chip, or a system on chip (SoC) chip or system in package (SIP) chip containing a modem core) responsible for communication functions in the terminal device, or the like, and can also be implemented by a logical module or software capable of implementing all or part of the terminal device. The present application does not limit this, and the following will be described by taking the method applied to the terminal device as an example. The method comprises: receiving a system message, the system message comprising information indicating a maximum round trip delay and information indicating a maximum Doppler shift; obtaining a first random access sequence, the first random access sequence being generated according to a base sequence and an auxiliary sequence of the same length, the base sequence being generated according to an m-sequence, the auxiliary sequence being generated according to a ZC sequence, a cyclic shift of the base sequence being related to the maximum round trip delay and a length of the first random access sequence, a cyclic shift of the auxiliary sequence being related to the maximum Doppler shift and the length of the first random access sequence, or a phase offset of the auxiliary sequence being related to the maximum Doppler shift and the length of the first random access sequence, the length of the first random access sequence being a sequence length of the base sequence or the auxiliary sequence; and transmitting a random access signal according to the first random access sequence.

[0011] In the communication method, the terminal device can initiate random access by using a random access sequence constructed according to a base sequence generated according to an m-sequence and an auxiliary sequence generated according to a ZC sequence, the cyclic shift of the base sequence of the random access sequence being associated with the maximum round trip delay, and the cyclic shift or phase offset of the auxiliary sequence being associated with the maximum Doppler shift. This not only makes the sequence capacity of the random access sequence positively related to the cube of the sequence length, improves the sequence capacity, so as to reduce the probability of random access collision in the scenario of large-scale terminal device access, but also resists Doppler shift of any subcarrier spacing and improves the low ambiguity area.

[0012] In a possible design, the minimum interval of the cyclic shift of the base sequence can be the maximum round trip delay. In the embodiments of the present application, the minimum interval of the cyclic shift of the base sequence refers to the minimum value of the interval between any two different cyclic shifts, or the minimum value of the difference between the cyclic shifts of any two different base sequences.

[0013] In a possible design, the cyclic shift c i may satisfy the following relationship:

[0014] c i =k i Δ T ; wherein ki an index of the cyclic shift of the base sequence, and k i is an integer, is a floor function, Δ T is a maximum round trip delay, N is a sequence length of the first random access sequence, and i is a sequence number of the first random access sequence in a random access sequence resource pool. Thus, the cyclic shift of the base sequence is determined according to the index of the cyclic shift and the maximum round trip delay, such that the value range of the index of the cyclic shift is related to the maximum round trip delay and the sequence length, and the value range of the cyclic shift is that is, c i is an integer multiple of Δ T .

[0015] In a possible design, the minimum interval of the cyclic shift of the auxiliary sequence can be g times of the maximum Doppler shift, g is a minimum positive integer satisfying (gu i )modN=1, u i is a root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N is a sequence length of the first random access sequence, and N ZC is a sequence length of the ZC sequence, and i is a sequence number of the first random access sequence in a random access sequence resource pool. In the embodiment of the application, the minimum interval of the cyclic shift of the auxiliary sequence also refers to the minimum value of the interval between any two different cyclic shifts, or the minimum value of the difference between any two different cyclic shifts of the auxiliary sequence.

[0016] In a possible design, the cyclic shift d i of the auxiliary sequence can satisfy the following relationship:

[0017] d i =l i gΔ F ; where l i is an index of the cyclic shift of the auxiliary sequence, and l i is an integer, is a floor function, Δ F is a maximum Doppler shift. Thus, the cyclic shift of the auxiliary sequence is determined according to the index of the cyclic shift and the g times of the maximum Doppler shift, the value range of the index of the cyclic shift is related to the maximum round trip delay and the sequence length, such that the value range of the cyclic shift is that is, d i is an integer multiple of gΔ F , which can resist the Doppler shift of any subcarrier spacing.

[0018] In a possible design, the minimum interval of the phase offset can be the maximum Doppler shift. In embodiments of this application, the minimum value of the phase offset of the auxiliary sequence also refers to the minimum value of the interval of any two different phase offsets, or the minimum value of the difference between the phase offsets of any two different auxiliary sequences.

[0019] In a possible design, the phase offset θ i may satisfy the following relationship:

[0020] θ i = p i Δ F ; where p i is an index of the phase offset, p i is an integer, floor (·) is a floor function, Δ F is the maximum Doppler shift, N is the sequence length of the first random access sequence, and i is the sequence number of the first random access sequence in the random access sequence resource pool. In this way, the phase offset of the auxiliary sequence is determined according to the index of the phase offset and the maximum Doppler shift, the value range of the index of the phase offset is related to the maximum round trip delay and the sequence length, so that the value range of the phase offset is that is, θ i is an integer multiple of Δ F , and can resist the Doppler shift of any subcarrier spacing.

[0021] In a possible design, the first random access sequence can be one of the N sequences, where floor (·) is a floor function, N is the sequence length of the first random access sequence, and N ZC is the sequence length of the ZC sequence, Δ T is the maximum round trip delay, and Δ F is the maximum Doppler shift. In this way, the sequence capacity of the random access sequence is positively related to the cube of the sequence length N, the larger N is, the larger the sequence capacity is, and increasing the sequence capacity can reduce the probability of random access collision in the scenario of large-scale terminal device access.

[0022] In a possible design, when the sequence length of the m sequence and the sequence length of the ZC sequence are equal, the base sequence is the m sequence and the auxiliary sequence is the ZC sequence, the sequence length of the first random access sequence is 2 r -1 and is a prime number, and r is a positive integer. At this time, since N = N ZC , the sequence capacity of the random access sequence can also be represented as

[0023] In one possible design, the element with index n in the first random access sequence The following relationship can be satisfied:

[0024] Where i is the sequence number of the first random access sequence in the random access sequence resource pool, and k i The index for the cyclic shift of the base sequence. And k i Δ is an integer. T The maximum round-trip time is given by N, where N is the sequence length of the first random access sequence, and u... i U is the root index of the auxiliary sequence, 0 ≤ u i ≤N ZC -1andu i N is an integer. ZC Let l be the sequence length of the ZC sequence. i For the index of the cyclic shift of the auxiliary sequence, And l i Δ is an integer. F For the maximum Doppler frequency shift, The element with index n in the base sequence. Let c be the element with index n in the auxiliary sequence, where 0 ≤ n ≤ N-1 and n is an integer. i The cyclic shift of the base sequence and c i =k i Δ T d i For the cyclic shift of the auxiliary sequence and d i =l i gΔ F , g is to satisfy (gu i The smallest positive integer modulo N = 1, Tr(·) is the trace function of a finite field, and α is the primitive element of the finite field. This is for rounding down.

[0025] In one possible design, the element with index n in the first random access sequence The following relationship can be satisfied:

[0026] Where i is the sequence number of the first random access sequence in the random access sequence resource pool, and k i The index for the cyclic shift of the base sequence. And k i Δ is an integer. T The maximum round-trip time is given by N, where N is the sequence length of the first random access sequence, and u... i U is the root index of the auxiliary sequence, 0 ≤ u i ≤NZC -1 and u i is an integer, N ZC is a sequence length of the ZC sequence, θ i is a phase offset and θ i = p i Δ F , p i is an index of the phase offset, and p i is an integer, Δ F is a maximum Doppler shift, is an element with index n in the base sequence, is an element with index n in the auxiliary sequence, 0≤n≤N-1 and n is an integer, c i is a cyclic shift of the base sequence and c i = k i Δ T , Tr(·) is a trace function of a finite field, α is a primitive element of the finite field, is a floor function.

[0027] In a possible design, the random access sequence resource pool in which the first random access sequence is located further includes a second random access sequence, and the plurality of random access sequences in the random access sequence resource pool have a same length. In a case where a root index of the auxiliary sequence corresponding to the first random access sequence is the same as a root index of the auxiliary sequence corresponding to the second random access sequence, a maximum value of a cross ambiguity function of the first random access sequence and the second random access sequence is less than or equal to N is a sequence length of the first random access sequence; in a case where the root index of the auxiliary sequence corresponding to the first random access sequence is not the same as the root index of the auxiliary sequence corresponding to the second random access sequence, the maximum value of the cross ambiguity function of the first random access sequence and the second random access sequence is less than or approximately equal to

[0028] In a possible design, in a case where the sequence length of the m sequence and the sequence length of the ZC sequence are not equal, the sequence length of the first random access sequence can be 2 r -1 and a prime number, and r is a positive integer.

[0029] In a possible design, in a case where the sequence length of the m sequence is less than the sequence length of the ZC sequence, the auxiliary sequence is a ZC sequence; the base sequence is generated according to the m sequence, and can include: the base sequence is obtained by performing N-point inverse discrete Fourier transform (IDFT) on a first transform sequence, the first transform sequence is obtained by appending N-N m zeroes to a second transform sequence, the second transform sequence is obtained by performing N m -point discrete Fourier transform (DFT) on the m sequence, and Nm is the sequence length of the m-sequence, and N is the sequence length of the first random access sequence. Thus, in the case where the sequence lengths of the m-sequence constituting the base sequence and the ZC sequence constituting the auxiliary sequence are not equal, the m-sequence with the shorter sequence length needs to be processed through DFT, zero padding, and IDFT so as to expand the sequence length of the m-sequence to be consistent with the length of the ZC sequence. At this time, since N = N ZC , the sequence capacity of the random access sequence can also be expressed as

[0030] In one possible design, the element with index n in the first random access sequence can satisfy the following relationship:

[0031] where i is the sequence number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, k i is an integer, Δ T is the maximum round trip delay, u i is the root index of the auxiliary sequence, 0 ≤ u i ≤ N ZC - 1 and u i is an integer, N ZC is the sequence length of the ZC sequence, l i is the index of the cyclic shift of the auxiliary sequence, l i is an integer, Δ F is the maximum Doppler shift, 0 ≤ n ≤ N - 1 and n is an integer, c i is the cyclic shift of the base sequence and c i = k i Δ T , is the element with index n in the base sequence, is the element with index t in the m-sequence, 0 ≤ t ≤ N m - 1 and t is an integer, is the element with index n in the auxiliary sequence, d i is the cyclic shift of the auxiliary sequence and d i = l i g Δ F , g is the smallest positive integer satisfying (gu i ) mod N = 1, Tr(·) is the trace function of the finite field, α is the primitive element of the finite field, is the floor function.

[0032] In one possible design, the element with index n in the first random access sequence can satisfy the following relationship: ​The following relationship can be satisfied:

[0033] where i is the sequence number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, u i is the root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is the sequence length of the ZC sequence, θ i is the phase offset and θ i =p i Δ F , p i is the index of the phase offset, and p i is an integer, Δ F is the maximum Doppler shift, 0≤n≤N-1 and n is an integer, is the element with index n in the base sequence, is the element with index t in the m sequence, 0≤t≤N m -1 and t is an integer, is the element with index n in the auxiliary sequence, c i is the cyclic shift of the base sequence and c i =k i Δ T , Tr(·) is the trace function of the finite field, α is the primitive element of the finite field, is the floor function.

[0034] In a possible design scheme, in the case where the sequence length of the m sequence is greater than the sequence length of the ZC sequence, the base sequence is the m sequence; the auxiliary sequence is generated according to the ZC sequence and can include: the auxiliary sequence is obtained by performing N-point IDFT on a third transform sequence, the third transform sequence is obtained by appending N-N ZC zeroes to a fourth transform sequence, the fourth transform sequence is obtained by performing N ZC -point DFT on the ZC sequence, N ZC is the sequence length of the ZC sequence, and N is the sequence length of the first random access sequence. Therefore, in the case where the sequence lengths of the m sequence constituting the base sequence and the ZC sequence constituting the auxiliary sequence are not equal, the ZC sequence with a shorter sequence length needs to be processed through DFT, zero padding and IDFT to expand the sequence length of the ZC sequence to be consistent with the length of the m sequence.

[0035] In one possible design, an element with index n in the random access sequence The following relationship can be satisfied:

[0036] where i is the sequence number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, u i is the root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, θ i is the phase offset and θ i =p i Δ F , p i is the index of the phase offset, and p i is an integer, Δ F is the maximum Doppler shift, 0≤n≤N-1 and n is an integer, is an element with index n in the base sequence, is an element with index n in the auxiliary sequence, is an element with index t in the ZC sequence, 0≤t≤N ZC -1 and t is an integer, c i is the cyclic shift of the base sequence and c i =k i Δ T , Tr(·) is the trace function of the finite field, α is the primitive element of the finite field, is the floor function.

[0037] In one possible design, the low-misunderstanding area of the first random access sequence is greater than the sequence length of the first random access sequence.

[0038] In a second aspect, a communication method is provided. The method can be applied to a network side, such as a network device, or a component (e.g., a processor, a circuit, a chip, or a chip system) in the network device, and can also be implemented by a logic module or software capable of implementing all or part of the network device. The method includes: sending a system message, the system message including information indicating a maximum round trip delay and information indicating a maximum Doppler shift. Receiving a random access signal, the random access signal corresponding to a first random access sequence, the first random access sequence being generated according to a base sequence and an auxiliary sequence of the same length, the base sequence being generated according to an m sequence, the auxiliary sequence being generated according to a ZC sequence, the cyclic shift of the base sequence being related to the maximum round trip delay and the length of the first random access sequence, the cyclic shift of the auxiliary sequence being related to the maximum Doppler shift and the length of the first random access sequence, or the phase offset of the auxiliary sequence being related to the maximum Doppler shift and the length of the first random access sequence, the length of the first random access sequence being the sequence length of the base sequence or the auxiliary sequence.

[0039] In a possible design, the minimum interval of the cyclic shift of the base sequence can be the maximum round trip delay.

[0040] In a possible design, the cyclic shift c i of the base sequence can satisfy the following relationship:

[0041] c i = k i Δ T ; where k i is the index of the cyclic shift of the base sequence, k i is an integer, Δ T is the maximum round trip delay, N is the sequence length of the first random access sequence, and i is the sequence number of the first random access sequence in a random access sequence resource pool.

[0042] In a possible design, the minimum interval of the cyclic shift of the auxiliary sequence can be g times the maximum Doppler shift, g being the smallest positive integer satisfying (gu i )modN = 1, u i being the root index of the auxiliary sequence, 0 ≤ u i ≤ N ZC -1 and u i being an integer, N being the sequence length of the first random access sequence, N ZC being the sequence length of the ZC sequence, and i being the sequence number of the first random access sequence in a random access sequence resource pool.

[0043] In a possible design, the cyclic shift d i of the auxiliary sequence can satisfy the following relationship:

[0044] d i =l i gΔ F Among them, l i For the index of the cyclic shift of the auxiliary sequence, And l i It is an integer. To round down, Δ F This represents the maximum Doppler frequency shift.

[0045] In one possible design, the minimum phase shift interval can be the maximum Doppler frequency shift.

[0046] In one possible design, the phase offset θ i The following relationship can be satisfied:

[0047] θ i =p i Δ F ; where p i For the index of phase offset, And p i It is an integer. To round down, Δ F Where is the maximum Doppler frequency shift, N is the sequence length of the first random access sequence, and i is the sequence number of the first random access sequence in the random access sequence resource pool.

[0048] In one possible design, the first random access sequence can be One of the sequences, where N is the sequence length of the first random access sequence. ZC Let Δ be the sequence length of the ZC sequence. T For the maximum round-trip time, Δ F For the maximum Doppler frequency shift, This is for rounding down.

[0049] In one possible design, when the lengths of the m-sequence and the ZC-sequence are equal, the base sequence is the m-sequence, the auxiliary sequence is the ZC-sequence, and the length of the first random access sequence is 2. r -1 and is a prime number, r is a positive integer.

[0050] In one possible design, the element with index n in the first random access sequence The following relationship can be satisfied:

[0051] Where i is the sequence number of the first random access sequence in the random access sequence resource pool, and k i The index for the cyclic shift of the base sequence. And ki is an integer, Δ T is the maximum round trip delay, N is the sequence length of the first random access sequence, u i is the root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is the sequence length of the ZC sequence, l i is the index of the cyclic shift of the auxiliary sequence, and l i is an integer, Δ F is the maximum Doppler shift, is the element with index n in the base sequence, is the element with index n in the auxiliary sequence, 0≤n≤N-1 and n is an integer, c i is the cyclic shift of the base sequence and c i =k i Δ T , d i is the cyclic shift of the auxiliary sequence and d i =l i gΔ F , g is the smallest positive integer satisfying (gu i )modN=1, Tr(·) is the trace function of the finite field, α is the primitive element of the finite field, is the floor function.

[0052] In one possible design, the element with index n in the first random access sequence can satisfy the following relationship:

[0053] where i is the sequence number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, N is the sequence length of the first random access sequence, u i is the root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is the sequence length of the ZC sequence, θ i is the phase offset and θ i =p i Δ F , p i is the index of the phase offset, and p i is an integer, Δ FFor the maximum Doppler frequency shift, The element with index n in the base sequence. Let c be the element with index n in the auxiliary sequence, where 0 ≤ n ≤ N-1 and n is an integer. i The cyclic shift of the base sequence and c i =k i Δ T Tr(·) is the trace function of a finite field, and α is the primitive element of the finite field. This is for rounding down.

[0054] In one possible design, the random access sequence resource pool containing the first random access sequence also includes a second random access sequence, and the multiple random access sequences in the resource pool have the same length. When the root index of the auxiliary sequence corresponding to the first random access sequence is the same as the root index of the auxiliary sequence corresponding to the second random access sequence, the maximum value of the mutual ambiguity function between the first and second random access sequences is less than or equal to... N is the sequence length of the first random access sequence; when the root index of the auxiliary sequence corresponding to the first random access sequence is different from the root index of the auxiliary sequence corresponding to the second random access sequence, the maximum value of the mutual ambiguity function of the first random access sequence and the second random access sequence is less than or approximately equal to...

[0055] In one possible design, when the sequence lengths of the m-sequence and the ZC-sequence are not equal, the sequence length of the first random access sequence can be 2. r -1 is one of the unions of prime numbers and r, where r is a positive integer.

[0056] In one possible design, when the length of the m-sequence is less than the length of the ZC-sequence, the auxiliary sequence is the ZC-sequence; the base sequence is generated based on the m-sequence and may include: the base sequence is obtained by performing an N-point Inverse Discrete Fourier Transform (IDFT) on the first transform sequence, and the first transform sequence is obtained by supplementing the second transform sequence with N... m The second transformation sequence, obtained by adding zeros, is obtained by performing N transformations on the m sequence. m Obtained by point discrete Fourier transform (DFT), N m Let m be the sequence length of sequence m, and N be the sequence length of the first random access sequence.

[0057] In one possible design, the element with index n in the first random access sequence The following relationship can be satisfied:

[0058] Where i is the sequence number of the first random access sequence in the random access sequence resource pool, and k iis an index of a cyclic shift of the base sequence, and k i is an integer, Δ T is a maximum round trip delay, u i is a root index of the helper sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is a sequence length of the ZC sequence, l i is an index of a cyclic shift of the helper sequence, and l i is an integer, Δ F is a maximum Doppler shift, 0≤n≤N-1 and n is an integer, c i is a cyclic shift of the base sequence and c i =k i Δ T , is an element with index n in the base sequence, is an element with index t in the m-sequence, 0≤t≤N m -1 and t is an integer, is an element with index n in the helper sequence, d i is a cyclic shift of the helper sequence and d i =l i gΔ F , g is a smallest positive integer satisfying (gu i )modN=1, Tr(·) is a trace function of a finite field, α is a primitive element of the finite field, is a floor function.

[0059] In one possible design, an element with index n in the first random access sequence may satisfy the following relation:

[0060] where i is a sequence number of the first random access sequence in a random access sequence resource pool, k i is an index of a cyclic shift of the base sequence, and k i is an integer, Δ T is a maximum round trip delay, u i is a root index of the helper sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is a sequence length of the ZC sequence, θ i is a phase offset and θ i =p i Δ F , p iis an index of the base sequence, and p i is an integer, Δ F is a maximum Doppler shift, 0≤n≤N-1 and n is an integer, is an element with index n in the base sequence, is an element with index t in the m-sequence, 0≤t≤N m -1 and t is an integer, is an element with index n in the auxiliary sequence, c i is a cyclic shift of the base sequence and c i =k i Δ T , Tr(·) is a trace function of a finite field, and α is a primitive element of the finite field, is a floor function.

[0061] In a possible design, when the sequence length of the m-sequence is greater than the sequence length of the ZC sequence, the base sequence is the m-sequence; the auxiliary sequence is generated according to the ZC sequence, and can include: the auxiliary sequence is obtained by performing N-point IDFT on a third transform sequence, the third transform sequence is obtained by appending N-N ZC zeroes to a fourth transform sequence, the fourth transform sequence is obtained by performing N ZC -point DFT on the ZC sequence, N ZC is the sequence length of the ZC sequence, and N is the sequence length of the first random access sequence.

[0062] In a possible design, an element with index n in the random access sequence may satisfy the following relationship:

[0063] where i is a sequence number of the first random access sequence in a random access sequence resource pool, k i is an index of a cyclic shift of the base sequence, and k i is an integer, Δ T is a maximum round trip delay, u i is a root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, θ i is a phase offset, and θ i =p i Δ F , p i is an index of the phase offset, and p i is an integer, Δ F is a maximum Doppler shift, 0≤n≤N-1 and n is an integer, is an element in the base sequence with index n, is an element in the auxiliary sequence with index n, is an element in the ZC sequence with index t, 0≤t≤N ZC -1 and t is an integer, c i is a cyclic shift of the base sequence and c i = k i Δ T Tr(·) is a trace function of the finite field, α is a primitive element of the finite field, is a floor function.

[0064] In a possible design, the low-misunderstanding area of the first random access sequence is greater than the sequence length of the first random access sequence.

[0065] The specific description of the technical effects of the method of the second aspect can be referred to the related description of the technical effects of the method of the first aspect, and details are not described herein.

[0066] In a third aspect, a communication apparatus is provided for implementing the methods described above. The communication apparatus can be a terminal device in the first aspect, or a device including the terminal device, or a device included in the terminal device, such as a chip. The communication apparatus includes corresponding modules, units, or means for implementing the methods described in the first aspect, which can be implemented by hardware, software, or by executing corresponding software with hardware. The hardware or software includes one or more modules or units corresponding to the functions described above.

[0067] In some possible designs, the communication apparatus includes a processing module and a communication module. The communication module is configured to receive a system message, and the system message includes information indicating a maximum round trip delay and information indicating a maximum Doppler shift. The processing module is configured to obtain a first random access sequence, and the first random access sequence is generated according to a base sequence and an auxiliary sequence with the same length. The base sequence is generated according to an m-sequence, and the auxiliary sequence is generated according to a ZC sequence. A cyclic shift of the base sequence is related to the maximum round trip delay and a length of the first random access sequence. A cyclic shift of the auxiliary sequence is related to the maximum Doppler shift and the length of the first random access sequence, or a phase offset of the auxiliary sequence is related to the maximum Doppler shift and the length of the first random access sequence. The length of the first random access sequence is a sequence length of the base sequence or the auxiliary sequence. The processing module is further configured to send a random access signal according to the first random access sequence.

[0068] In a possible design, the minimum interval of the cyclic shift of the base sequence can be the maximum round trip delay.

[0069] In a possible design, the cyclic shift c of the base sequence can satisfy the following relationship: i The following relationship can be satisfied:

[0070] c i = k i Δ T ; where k i is an index of the cyclic shift of the base sequence, and k i is an integer, is a floor function, Δ T is a maximum round trip delay, N is a sequence length of the first random access sequence, and i is a sequence number of the first random access sequence in a random access sequence resource pool.

[0071] In a possible design, the minimum interval of the cyclic shift of the auxiliary sequence can be g times of the maximum Doppler shift, g is a minimum positive integer satisfying (gu i )modN = 1, u i is a root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N is a sequence length of the first random access sequence, N ZC is a sequence length of a ZC sequence, and i is a sequence number of the first random access sequence in a random access sequence resource pool.

[0072] In a possible design, the cyclic shift d i of the auxiliary sequence can satisfy the following relationship:

[0073] d i = l i gΔ F ; where l i is an index of the cyclic shift of the auxiliary sequence, and l i is an integer, is a floor function, and Δ F is the maximum Doppler shift.

[0074] In a possible design, the minimum interval of the phase offset can be the maximum Doppler shift.

[0075] In a possible design, the phase offset θ i can satisfy the following relationship:

[0076] θ i = p i Δ F ; where p i is an index of the phase offset, and p i is an integer. for downlink, Δ F is the maximum Doppler shift, N is the sequence length of the first random access sequence, and i is the sequence number of the first random access sequence in the random access sequence resource pool.

[0077] In a possible design, the first random access sequence can be one of N sequences, where N is the sequence length of the first random access sequence, N ZC is the sequence length of the ZC sequence, Δ T is the maximum round trip delay, Δ F is the maximum Doppler shift, for downlink.

[0078] In a possible design, when the sequence length of the m sequence and the sequence length of the ZC sequence are equal, the base sequence is the m sequence, the auxiliary sequence is the ZC sequence, the sequence length of the first random access sequence is 2 r -1 and is a prime number, and r is a positive integer.

[0079] In a possible design, the element with index n in the first random access sequence can satisfy the following relationship:

[0080] where i is the sequence number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, N is the sequence length of the first random access sequence, u i is the root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is the length of the ZC sequence, l i is the index of the cyclic shift of the auxiliary sequence, and l i is an integer, Δ F is the maximum Doppler shift, is the element with index n in the base sequence, is the element with index n in the auxiliary sequence, 0≤n≤N-1 and n is an integer, c i is the cyclic shift of the base sequence and c i = k i Δ T , d i is the cyclic shift of the auxiliary sequence and d i = l i ​gΔ F , g is the smallest positive integer satisfying (gu i )modN=1, Tr(·) is a trace function of a finite field, and α is a primitive element of the finite field, is a floor function.

[0081] In a possible design, an element with index n in the first random access sequence can satisfy the following relationship:

[0082] where i is a sequence number of the first random access sequence in a random access sequence resource pool, k i is an index of cyclic shift of the base sequence, and k i is an integer, Δ T is a maximum round trip delay, N is a sequence length of the first random access sequence, u i is a root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is a sequence length of the ZC sequence, θ i is a phase offset, and θ i =p i Δ F , p i is an index of the phase offset, and p i is an integer, Δ F is a maximum Doppler shift, is an element with index n in the base sequence, is an element with index n in the auxiliary sequence, 0≤n≤N-1 and n is an integer, c i is a cyclic shift of the base sequence, and c i =k i Δ T , Tr(·) is a trace function of a finite field, and α is a primitive element of the finite field, is a floor function.

[0083] In a possible design, the random access sequence resource pool in which the first random access sequence is located further includes a second random access sequence, and a plurality of random access sequences in the random access sequence resource pool have a same length. In a case where a root index of an auxiliary sequence corresponding to the first random access sequence is the same as a root index of an auxiliary sequence corresponding to the second random access sequence, a maximum value of a cross-correlation function of the first random access sequence and the second random access sequence is less than or equal to ​N is the sequence length of the first random access sequence; when the root index of the auxiliary sequence corresponding to the first random access sequence is different from the root index of the auxiliary sequence corresponding to the second random access sequence, the maximum value of the mutual ambiguity function of the first random access sequence and the second random access sequence is less than or approximately equal to...

[0084] In one possible design, when the sequence lengths of the m-sequence and the ZC-sequence are not equal, the sequence length of the first random access sequence can be 2. r -1 is one of the unions of prime numbers and r, where r is a positive integer.

[0085] In one possible design, when the length of the m-sequence is less than the length of the ZC-sequence, the auxiliary sequence is the ZC-sequence; the base sequence is generated based on the m-sequence and may include: the base sequence is obtained by performing an N-point Inverse Discrete Fourier Transform (IDFT) on the first transform sequence, and the first transform sequence is obtained by supplementing the second transform sequence with N... m The second transformation sequence, obtained by adding zeros, is obtained by performing N transformations on the m sequence. m Obtained by point discrete Fourier transform (DFT), N m Let m be the sequence length of sequence m, and N be the sequence length of the first random access sequence.

[0086] In one possible design, the element with index n in the first random access sequence The following relationship can be satisfied:

[0087] Where i is the sequence number of the first random access sequence in the random access sequence resource pool, and k i The index for the cyclic shift of the base sequence. And k i Δ is an integer. T For the maximum round-trip time, u i U is the root index of the auxiliary sequence, 0 ≤ u i ≤N ZC -1andu i N is an integer. ZC Let l be the sequence length of the ZC sequence. i For the index of the cyclic shift of the auxiliary sequence, And l i Δ is an integer. F For the maximum Doppler frequency shift, 0 ≤ n ≤ N-1 and n is an integer, c i The cyclic shift of the base sequence and c i =k i Δ T , The element with index n in the base sequence. is an element in the m-sequence with index t, 0≤t≤N-1 and t is an integer, m -1 and t is an integer, is an element in the auxiliary sequence with index n, d i is a cyclic shift of the auxiliary sequence and d i = l i gΔ F , g is the smallest positive integer satisfying (gu i )modN = 1, Tr(·) is the trace function of the finite field, and a is a primitive element of the finite field, is the floor function.

[0088] In one possible design, an element in the first random access sequence with index n may satisfy the following relationship:

[0089] where i is the sequence number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, u i is the root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is the sequence length of the ZC sequence, θ i is the phase offset and θ i = p i Δ F , p i is the index of the phase offset, and p i is an integer, Δ F is the maximum Doppler shift, 0≤n≤N-1 and n is an integer, is an element in the base sequence with index n, is an element in the m-sequence with index t, 0≤t≤N m -1 and t is an integer, is an element in the auxiliary sequence with index n, c i is a cyclic shift of the base sequence and c i = k i Δ T , Tr(·) is the trace function of the finite field, and a is a primitive element of the finite field, is the floor function.

[0090] In a possible design, in a case where the sequence length of the m-sequence is greater than the sequence length of the ZC sequence, the base sequence is the m-sequence; and the auxiliary sequence is generated according to the ZC sequence, which can include: the auxiliary sequence is obtained by performing N-point IDFT on a third transform sequence, the third transform sequence is obtained by appending N-N ZC zeroes to a fourth transform sequence, the fourth transform sequence is obtained by performing N ZC -point DFT on the ZC sequence, N ZC is the sequence length of the ZC sequence, and N is the sequence length of the first random access sequence.

[0091] In a possible design, an element with index n in the random access sequence can satisfy the following relationship:

[0092] where i is the sequence number of the first random access sequence in a random access sequence resource pool, k i is an index of a cyclic shift of the base sequence, k i is an integer, Δ T is a maximum round trip delay, u i is a root index of the auxiliary sequence, 0≤u i N ZC -1 and u i is an integer, θ i is a phase offset and θ i =p i Δ F , p i is an index of the phase offset, p i is an integer, Δ F is a maximum Doppler shift, 0≤n≤N-1 and n is an integer, is an element with index n in the base sequence, is an element with index n in the auxiliary sequence, is an element with index t in the ZC sequence, 0≤t≤N ZC -1 and t is an integer, c i is a cyclic shift of the base sequence and c i =k i Δ T , Tr(·) is a trace function of a finite field, and α is a primitive element of the finite field, is a floor function.

[0093] In a possible design, the low-misunderstanding area of the first random access sequence is greater than the sequence length of the first random access sequence.

[0094] ​In a possible design, the communication module can include a receiving module and a sending module. The sending module is configured to implement the sending function of the communication apparatus in the third aspect, and the receiving module is configured to implement the receiving function of the communication apparatus in the third aspect.

[0095] In a possible design, the communication apparatus in the third aspect can further include a storage module, which stores a program or an instruction. When the processing module executes the program or the instruction, the communication apparatus in the third aspect can execute the method in the first aspect.

[0096] In a fourth aspect, a communication apparatus is provided for implementing the methods described above. The communication apparatus can be the access network device in the second aspect, or a device including the access network device, or a device included in the access network device, such as a chip. The communication apparatus includes corresponding modules, units or means for implementing the methods in the second aspect, which can be implemented by hardware, software or by hardware executing corresponding software. The hardware or software includes one or more modules or units corresponding to the functions described above.

[0097] In some possible designs, the communication apparatus includes a processing module and a communication module. The processing module is configured to control the communication module to send a system message, and the system message includes information indicating a maximum round trip delay and information indicating a maximum Doppler shift. The processing module is configured to control the communication module to receive a random access signal, and the random access signal corresponds to a first random access sequence, the first random access sequence is generated according to a base sequence and an auxiliary sequence with the same length, the base sequence is generated according to an m-sequence, and the auxiliary sequence is generated according to a ZC sequence. The cyclic shift of the base sequence is related to the maximum round trip delay and the length of the first random access sequence, the cyclic shift of the auxiliary sequence is related to the maximum Doppler shift and the length of the first random access sequence, or the phase offset of the auxiliary sequence is related to the maximum Doppler shift and the length of the first random access sequence, and the length of the first random access sequence is the sequence length of the base sequence or the auxiliary sequence.

[0098] In a possible design, the minimum interval of the cyclic shift of the base sequence can be the maximum round trip delay.

[0099] In a possible design, the cyclic shift of the base sequence c i The following relationship can be met:

[0100] c i =k i Δ T ; where k i is the index of the cyclic shift of the base sequence, and k i is an integer, To round down, Δ T The maximum round-trip time is N, where N is the sequence length of the first random access sequence and i is the sequence number of the first random access sequence in the random access sequence resource pool.

[0101] In one possible design, the minimum interval of the cyclic shift of the auxiliary sequence can be g times the maximum Doppler frequency shift, where g satisfies (gu i The smallest positive integer that modulo N = 1, u i U is the root index of the auxiliary sequence, 0 ≤ u i ≤N ZC -1andu i Let N be an integer, where N is the length of the first random access sequence. ZC Let be the sequence length of the ZC sequence, and i be the sequence number of the first random access sequence in the random access sequence resource pool.

[0102] In one possible design, the auxiliary sequence is cyclically shifted by d. i The following relationship can be satisfied:

[0103] d i =l i gΔ F Among them, l i For the index of the cyclic shift of the auxiliary sequence, And l i It is an integer. To round down, Δ F This represents the maximum Doppler frequency shift.

[0104] In one possible design, the minimum phase shift interval can be the maximum Doppler frequency shift.

[0105] In one possible design, the phase offset θ i The following relationship can be satisfied:

[0106] θ i =p i Δ F ; where p i For the index of phase offset, And p i It is an integer. To round down, Δ F Where is the maximum Doppler frequency shift, N is the sequence length of the first random access sequence, and i is the sequence number of the first random access sequence in the random access sequence resource pool.

[0107] In one possible design, the first random access sequence can be One of the sequences, where N is the sequence length of the first random access sequence.ZC is the sequence length of the ZC sequence, Δ T is the maximum round trip delay, Δ F is the maximum Doppler shift, is the floor function.

[0108] In a possible design, the sequence length of the m sequence is equal to the sequence length of the ZC sequence, the base sequence is the m sequence, the auxiliary sequence is the ZC sequence, and the sequence length of the first random access sequence is 2 r -1 and is a prime number, and r is a positive integer.

[0109] In a possible design, an element with an index of n in the first random access sequence may satisfy the following relationship:

[0110] where i is the sequence number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, N is the sequence length of the first random access sequence, u i is the root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is the sequence length of the ZC sequence, l i is the index of the cyclic shift of the auxiliary sequence, and l i is an integer, Δ F is the maximum Doppler shift, is an element with an index of n in the base sequence, is an element with an index of n in the auxiliary sequence, 0≤n≤N-1 and n is an integer, c i is the cyclic shift of the base sequence and c i =k i Δ T , d i is the cyclic shift of the auxiliary sequence and d i =l i gΔ F , g is the smallest positive integer that satisfies (gu i )mod N=1, Tr(·) is a trace function of a finite field, and α is a primitive element of the finite field. is the floor function.

[0111] In a possible design, an element with an index of n in the first random access sequence may satisfy the following relationship:

[0112] wherein i is a serial number of the first random access sequence in a random access sequence resource pool, k i is an index of a cyclic shift of a base sequence, and k i is an integer, Δ T is a maximum round trip delay, N is a sequence length of the first random access sequence, u i is a root index of an auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is a sequence length of a ZC sequence, θ i is a phase offset and θ i =p i Δ F , p i is an index of a phase offset, and p i is an integer, Δ F is a maximum Doppler shift, is an element with an index of n in the base sequence, is an element with an index of n in the auxiliary sequence, 0≤n≤N-1 and n is an integer, c i is a cyclic shift of the base sequence and c i =k i Δ T , Tr(·) is a trace function of a finite field, α is a primitive element of the finite field, is a floor function.

[0113] In a possible design, the random access sequence resource pool in which the first random access sequence is located further includes a second random access sequence, and the plurality of random access sequences in the random access sequence resource pool have a same sequence length. In a case where a root index of the auxiliary sequence corresponding to the first random access sequence is same as a root index of the auxiliary sequence corresponding to the second random access sequence, a maximum value of a cross ambiguity function of the first random access sequence and the second random access sequence is less than or equal to N is a sequence length of the first random access sequence; in a case where the root index of the auxiliary sequence corresponding to the first random access sequence is different from the root index of the auxiliary sequence corresponding to the second random access sequence, a maximum value of a cross ambiguity function of the first random access sequence and the second random access sequence is less than or approximately equal to

[0114] In a possible design, in a case where the sequence length of the m sequence and the sequence length of the ZC sequence are not equal, the sequence length of the first random access sequence can be one in a union set of 2 r -1 and a prime number, and r is a positive integer.

[0115] In one possible design, when the length of the m-sequence is less than the length of the ZC-sequence, the auxiliary sequence is the ZC-sequence; the base sequence is generated based on the m-sequence and may include: the base sequence is obtained by performing an N-point discrete inverse Fourier transform (IDFT) on the first transform sequence, and the first transform sequence is obtained by supplementing the second transform sequence with N... m The second transformation sequence, obtained by adding zeros, is obtained by performing N transformations on the m sequence. m Obtained by point discrete Fourier transform (DFT), N m Let m be the sequence length of sequence m, and N be the sequence length of the first random access sequence.

[0116] In one possible design, the element with index n in the first random access sequence The following relationship can be satisfied:

[0117] Where i is the sequence number of the first random access sequence in the random access sequence resource pool, and k i The index for the cyclic shift of the base sequence. And k i Δ is an integer. T For the maximum round-trip time, u i U is the root index of the auxiliary sequence, 0 ≤ u i ≤N ZC -1andu i N is an integer. ZC Let l be the sequence length of the ZC sequence. i For the index of the cyclic shift of the auxiliary sequence, And l i Δ is an integer. F For the maximum Doppler frequency shift, 0 ≤ n ≤ N-1 and n is an integer, c i The cyclic shift of the base sequence and c i =k i Δ T , The element with index n in the base sequence. Let t be the element with index t in the sequence m, where 0 ≤ t ≤ N. m -1 and t is an integer, For the element with index n in the auxiliary sequence, d i For the cyclic shift of the auxiliary sequence and d i =l i gΔ F , g is to satisfy (gu i The smallest positive integer modulo N = 1, Tr(·) is the trace function of a finite field, and α is the primitive element of the finite field. This is for rounding down.

[0118] In a possible design, an element with index n in the first random access sequence may satisfy the following relationship:

[0119] where i is the sequence number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, u i is the root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is the sequence length of the ZC sequence, θ i is the phase offset and θ i =p i Δ F , p i is the index of the phase offset, and p i is an integer, Δ F is the maximum Doppler shift, 0≤n≤N-1 and n is an integer, is an element with index n in the base sequence, is an element with index t in the m sequence, 0≤t≤N m -1 and t is an integer, is an element with index n in the auxiliary sequence, c i is the cyclic shift of the base sequence and c i =k i Δ T , Tr(·) is the trace function of a finite field, α is a primitive element of the finite field, is the floor function.

[0120] In a possible design, in the case where the sequence length of the m sequence is greater than the sequence length of the ZC sequence, the base sequence is the m sequence; the auxiliary sequence is generated according to the ZC sequence, and can include: the auxiliary sequence is obtained by performing N-point IDFT on a third transform sequence, the third transform sequence is obtained by appending N-N ZC zeroes to a fourth transform sequence, the fourth transform sequence is obtained by performing N ZC -point DFT on the ZC sequence, N ZC is the sequence length of the ZC sequence, and N is the sequence length of the first random access sequence.

[0121] In a possible design, an element with index n in the first random access sequence The following relationship can be satisfied:

[0122] wherein i is a serial number of the first random access sequence in the random access sequence resource pool, k i is an index of the cyclic shift of the base sequence, and k i is an integer, Δ T is a maximum round trip delay, u i is a root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, θ i is a phase offset and θ i =p i Δ F , p i is an index of the phase offset, and p i is an integer, Δ F is a maximum Doppler shift, 0≤n≤N-1 and n is an integer, is an element with index n in the base sequence, is an element with index n in the auxiliary sequence, is an element with index t in the ZC sequence, 0≤t≤N ZC -1 and t is an integer, c i is a cyclic shift of the base sequence and c i =k i Δ T , Tr(·) is a trace function of a finite field, and α is a primitive element of the finite field, is a floor function.

[0123] In a possible design, the low-misunderstanding area of the first random access sequence is greater than the sequence length of the first random access sequence.

[0124] In a possible design, the communication module can include a receiving module and a sending module. The sending module is configured to implement the sending function of the communication apparatus in the fourth aspect, and the receiving module is configured to implement the receiving function of the communication apparatus in the fourth aspect.

[0125] In a possible design, the communication apparatus in the fourth aspect can further include a storage module that stores a program or an instruction. When the processing module executes the program or the instruction, the communication apparatus in the fourth aspect can execute the method in the second aspect.

[0126] In a fifth aspect, a communication method is provided. The method can be applied to a terminal side, such as a terminal device, or a component or module of a terminal device, or a circuit or processor or chip (such as a modem chip, also known as a baseband chip, or a system on chip (SoC) chip or system in package (SIP) chip containing a modem core) responsible for communication functions in a terminal device, and can also be implemented by a logic module or software capable of implementing all or part of a terminal device. The present application does not make any limitation in this regard, and the following will be described by taking the method applied to a terminal device as an example. The method comprises: receiving a system message, the system message comprising information indicating a maximum round trip delay and information indicating a maximum Doppler shift. A first random access sequence is obtained, the first random access sequence being generated according to a base sequence and an auxiliary sequence of the same length, the base sequence being generated according to an m sequence, and the auxiliary sequence being generated according to a ZC sequence, the length of the first random access sequence being the sequence length of the base sequence or the auxiliary sequence, and an element with an index of n in the first random access sequence satisfying the following relationship: Or, Wherein i is the sequence number of the first random access sequence in a random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, N is the sequence length of the first random access sequence, u i is the root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is the sequence length of the ZC sequence, l i is the index of the cyclic shift of the auxiliary sequence, and l i is an integer, Δ F is the maximum Doppler shift, p i is the index of the phase offset, and p i is an integer, is an element with an index of n in the base sequence, is an element with an index of n in the auxiliary sequence, 0≤n≤N-1 and n is an integer, is the floor. A random access signal is transmitted according to the first random access sequence.

[0127] For more detailed description of the method of the fifth aspect, reference can be made to the description of the related method in the first aspect.

[0128] In a sixth aspect, a communication method is provided. The method can be applied to a network side, such as a network device, or a component (e.g., a processor, a circuit, a chip, or a chip system of the network device) in the network device, and can also be implemented by a logic module or software capable of implementing all or part of the network device. The method includes: sending a system message, the system message including information indicating a maximum round trip delay and information indicating a maximum Doppler shift. Receiving a random access signal, the random access signal corresponding to a first random access sequence, the first random access sequence being generated according to a base sequence and an auxiliary sequence of the same length, the base sequence being generated according to an m sequence, the auxiliary sequence being generated according to a ZC sequence, the length of the first random access sequence being the sequence length of the base sequence or the auxiliary sequence, and an element with an index of n in the first random access sequence satisfying the following relationship: Or, Wherein, i is the sequence number of the first random access sequence in a random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, N is the sequence length of the first random access sequence, u i is the root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is the sequence length of the ZC sequence, l i is the index of the cyclic shift of the auxiliary sequence, and l i is an integer, Δ F is the maximum Doppler shift, p i is the index of the phase offset, and p i is an integer, is an element with an index of n in the base sequence, is an element with an index of n in the auxiliary sequence, 0≤n≤N-1 and n is an integer, is the floor. The random access signal is sent according to the first random access sequence.

[0129] More detailed descriptions of the method described in the sixth aspect can be referred to the descriptions of the related methods in the first aspect.

[0130] In a seventh aspect, a communication apparatus is provided, which comprises an interface circuit and one or more processors. The one or more processors are coupled to a memory. The memory is configured to store part or all of the necessary computer programs or instructions for implementing the functions related to the first aspect or the fifth aspect. The one or more processors can execute the computer programs or instructions, which, when executed, cause the communication apparatus to implement the method in any possible design or implementation manner of the first aspect or the fifth aspect. The interface circuit is configured to implement the communication function within the communication apparatus and / or the communication function of the communication apparatus with other apparatuses or components.

[0131] In a possible design, the processor is configured to communicate with other apparatuses or components via the interface circuit.

[0132] In a possible design, the communication apparatus further comprises the memory.

[0133] The communication apparatus described above can be a terminal, or a communication module in the terminal, or a chip responsible for the communication function in the terminal, such as a modem chip (also referred to as a baseband chip) or an SoC or SIP chip containing a modem module.

[0134] In an eighth aspect, a communication apparatus is provided, which comprises an interface circuit and one or more processors. The one or more processors are coupled to a memory. The memory is configured to store part or all of the necessary computer programs or instructions for implementing the functions related to the second aspect or the sixth aspect. The one or more processors can execute the computer programs or instructions, which, when executed, cause the communication apparatus to implement the method in any possible design or implementation manner of the second aspect or the sixth aspect. The interface circuit is configured to implement the communication function within the communication apparatus and / or the communication function of the communication apparatus with other apparatuses or components.

[0135] In a ninth aspect, a communication system is provided, which comprises: a terminal device configured to perform the method in the first aspect, and an access network device configured to perform the method in the second aspect.

[0136] In a tenth aspect, a chip is provided, in which instructions are stored, which, when the chip is run on a communication device, cause the method in the first aspect or the second aspect to be implemented.

[0137] In an eleventh aspect, a computer readable storage medium is provided, in which computer readable instructions are stored, which, when read and executed by a computer, cause the computer to perform the method in any possible design of the first aspect to the second aspect.

[0138] In a twelfth aspect, a computer program product including instructions, which, when executed by a computer, cause the computer to perform the method of any possible design of the first aspect to the second aspect. BRIEF DESCRIPTION OF DRAWINGS

[0139] FIG. 1 is a schematic diagram of distribution of peak values of a self-ambiguity function of a ZC sequence on a delay-Doppler shift plane;

[0140] FIG. 2 is a schematic diagram of association between SSB transmission and random access resources;

[0141] FIG. 3 is a schematic diagram of a scenario in which a large-scale terminal device initiates random access;

[0142] FIG. 4 is a schematic diagram of a structure for combating Doppler shift in a high-speed mobile scenario during random access;

[0143] FIG. 5 is a schematic diagram of distribution of self-ambiguity function values of an m sequence on a delay-Doppler shift plane;

[0144] FIG. 6 is a schematic diagram of an architecture of a communication system provided by an embodiment of the present application;

[0145] FIG. 7 is a schematic diagram of a flow of a communication method provided by an embodiment of the present application;

[0146] FIG. 8 is a schematic diagram of a structure of a random access sequence provided by an embodiment of the present application;

[0147] FIG. 9 is a schematic diagram of distribution of cross-ambiguity function values of a random access sequence on a delay-Doppler shift plane provided by an embodiment of the present application;

[0148] FIG. 10 is a schematic diagram of a flow of sequence length extension of an m sequence and a ZC sequence provided by an embodiment of the present application;

[0149] FIG. 11 is a schematic diagram of a structure of a communication apparatus provided by an embodiment of the present application;

[0150] FIG. 12 is a schematic diagram of a structure of another communication apparatus provided by an embodiment of the present application. DETAILED DESCRIPTION

[0151] In order to better understand the embodiments of the present application, the following points are explained before the embodiments of the present application are introduced.

[0152] First, in the embodiments of the present application, the first, second and various numbers are only for the convenience of distinguishing, and do not limit the scope of the embodiments of the present application. For example, different indication information is distinguished. For another example, the first network area and the second network area are only for distinguishing different areas, and do not limit the sequence. Those skilled in the art can understand that the words "first", "second" and the like do not limit the quantity and execution sequence, and the words "first", "second" and the like do not necessarily mean different.

[0153] Second, in the embodiments of the present application, the descriptions such as "when", "in the case of", "if" and "whether" mean that the device (such as a terminal device or a network device) will make corresponding processing under certain objective circumstances, and are not limited to time, and do not require the device (such as a terminal device or a network device) to have a judgment action when implemented, and do not mean that there are other limitations.

[0154] Third, in the embodiments of the present application, the words "exemplary" or "for example" are used to mean that the examples, illustrations or descriptions are by way of example, illustration or description. Any embodiment or design solution described as "exemplary" or "for example" in the embodiments of the present application should not be interpreted as being more preferred or having more advantages than other embodiments or design solutions. Rather, the words "exemplary" or "for example" are used in the sense of presenting related concepts in a specific manner, for ease of understanding.

[0155] Fourth, in the embodiments of the present application, "at least one" means one or more, and "multiple" means two or more. The association relationship of the associated objects is described, which means that there can be three relationships, for example, A and / or B, which can mean that A exists alone, A and B exist together, and B exists alone, where A and B can be singular or plural. The character " / " generally represents an "or" relationship between the associated objects before and after it. "At least one of the following" or similar expressions means any combination of multiple items, including any combination of single item or multiple items. For example, at least one of a, b or c can mean a, b, c, a-b, a-c, b-c or a-b-c, where a, b and c can be single or multiple.

[0156] Finally, the network architecture and service scenarios described in the embodiments of the present application are used to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided by the embodiments of the present application. Those skilled in the art can know that the technical solutions provided by the embodiments of the present application are also applicable to similar technical problems as the network architecture evolves and new service scenarios appear.

[0157] The following introduces the communication system and applicable network elements, related technologies and terms involved in the embodiments of the present application.

[0158] Embodiments of the present application will present various aspects, embodiments, or features around a system that can include a plurality of devices, components, modules, etc. It should be understood and appreciated that each system can include additional devices, components, modules, etc., and / or can not include all of the devices, components, modules, etc., discussed in connection with the figures. Additionally, a combination of these approaches can also be used.

[0159] The technical solutions of the embodiments of the present application can be applied to various communication systems, for example, a 4th generation (4G) mobile communication system such as an LTE system, a 5th generation (5G) mobile communication system such as an NR system, a 5G-advanced (5.5G) mobile communication system, and a future communication system, etc. The applicable scenarios of the technical solutions of the embodiments of the present application include, but are not limited to, ground cellular communication, non-terrestrial network (NTN) communication such as satellite communication, high altitude platform station (HAPS) communication, vehicle-to-everything (V2X) communication, integrated access and backhaul (IAB), and reconfigurable intelligent surface (RIS) communication, etc.

[0160] 1. Zero correlation zone, low correlation zone, zero ambiguity zone, low ambiguity zone and sequence capacity

[0161] The zero correlation zone refers to that the correlation function is equal to zero within a certain time delay interval (without Doppler shift).

[0162] The low correlation zone refers to that the correlation function does not exceed a threshold value within a certain time delay interval (without Doppler shift).

[0163] The zero ambiguity zone refers to that the ambiguity function is equal to zero within a certain time delay and Doppler interval.

[0164] The low ambiguity zone refers to that the ambiguity function does not exceed a threshold value within a certain time delay and Doppler interval.

[0165] The sequence capacity refers to the number of sequences contained in a sequence set. For example, for a ZC sequence, the sequence capacity refers to the number of sequences constructed by different root indexes and cyclic shifts.

[0166] 2. ZC sequence

[0167] Communication sequences are widely used in LTE / NR standard protocols, and the correlation of the sequences can be used to realize downlink synchronization signals and uplink random access, and the orthogonality of the sequences can be used to realize pilot multiplexing. Common sequence evaluation indexes include autocorrelation, cross-correlation, sequence capacity, frequency offset resistance, peak-to-average power ratio, and two-domain constant modulus.

[0168] The ZC sequence is a discrete sequence with good properties, is a complex sequence, and is a special linear frequency pulse compression sequence. The ZC sequence is commonly used for synchronization and channel estimation in communication systems.

[0169] The PRACH sequence (such as a preamble sequence) in LTE / NR can be generated by using ZC with different cyclic shifts to realize uplink user access and time delay estimation, and then measure the distance of the user relative to the base station. For a time-domain ZC sequence with a cyclic shift index of l, the discrete-time signal can be represented as:

[0170] where s u,l (n) is the nth element of the ZC sequence with a root sequence number u and a cyclic shift index of l, N ZC is the sequence length of the ZC sequence, u ∈ {1, 2,..., N ZC -1}, Δ T is the maximum round-trip time (RTT), and lΔ T is the cyclic shift (value) of the ZC sequence.

[0171] In the embodiments of the present application, the root sequence number of the ZC sequence can also be referred to as a root index, a root indicator, a root, or a root sequence number, and the like, which are not limited.

[0172] Any two ZC sequences with different cyclic shifts of the same root sequence number form a zero correlation zone, and any two ZC sequences with different cyclic shifts of different root sequence numbers form a low correlation zone (the maximum value of the correlation function is ). The ambiguity function of the ZC sequence can be represented as:

[0173] where τ is the time delay, and v is the Doppler shift. As shown in FIG. 1, it is a schematic diagram of the distribution of the peak value of the autocorrelation function of the ZC sequence on the time delay-Doppler shift plane (or referred to as the time delay-Doppler shift domain, τ-v). The peak value of the autocorrelation function of the ZC sequence is N ZC , which is a multi-peak distribution on the τ-v plane, and the autocorrelation function of the ZC sequence has N ZC peak values.

[0174] For the PRACH sequence generated by the ZC sequence, according to the characteristics of cellular mobile communication and the application scenarios of the 5G network, the PRACH sequence capacity is limited, which is specifically manifested in the following three aspects:

[0175] (1) Beam-based initial access

[0176] As shown in FIG. 2, the network device transmits synchronization signal and PBCH block (SSB) 0-SSB 3 in the form of beam sweeping in the cell, different SSB beams are associated with different PRACH resources or different PRACH sequences, so that the terminal device indicates the selected SSB beam by using the PRACH sequence / PRACH frequency domain resource when performing uplink random access. Under the same time-frequency resource condition, a PRACH sequence with larger capacity can carry more beam indication information.

[0177] (2) Massive IoT device simultaneous access

[0178] The terminal devices in the same cell randomly select one PRACH sequence from the 64 PRACH sequences in the resource pool to perform random access, and since the PRACH sequences in the resource pool are limited, when a large number of terminal devices access, the PRACH sequences randomly selected by different terminal devices from the resource pool may be the same, which increases the probability of access competition conflict, as shown in FIG. 3, two terminal devices using PRACH sequence 12 collide, and two terminal devices using PRACH sequence 47 collide. Therefore, increasing the number of PRACH sequences in the resource pool can reduce the collision probability when the terminal device performs random access.

[0179] (3) Random access in high-speed mobile scenarios

[0180] In the high-speed mobile scenario, the terminal device has a Doppler shift when performing random access, and the greater the Doppler shift, the fewer the number of available zero correlation zone cyclic shift sequences. As shown in (a) of FIG. 4, at least 2 / 3 of the zero correlation zone cyclic shift sequences are unavailable to resist ±1 subcarrier spacing frequency offset; as shown in (b) of FIG. 4, at least 4 / 5 of the zero correlation zone cyclic shift sequences are unavailable to resist ±2 subcarrier spacing frequency offset. Therefore, for the high-speed mobile scenario, part of the cyclic shift ZC sequence is unavailable to resist the Doppler shift, resulting in a decrease in the number of available PRACH sequences.

[0181] From the above, the use of ZC sequences to construct PRACH sequences has the following problems:

[0182] (1) ZC sequence capacity is limited: on the one hand, the ZC sequence is proportional to the square of the length of the ZC sequence, on the other hand, in the random access of the high-speed mobile scene, the greater the existing Doppler shift, the fewer the available cyclic shifts, thereby resulting in fewer ZC sequences available for random access, and the maximum Doppler shift that the limited ZC sequence can resist does not exceed 2 subcarrier intervals;

[0183] (2) The ambiguity function of the ZC sequence has a multi-peak characteristic, and the accurate time delay and / or Doppler cannot be determined;

[0184] (3) The maximum low ambiguity area (the product of the maximum round trip delay and the maximum Doppler shift) of the ZC sequence does not exceed the length of the ZC sequence.

[0185] 3. m sequence

[0186] The m sequence is the most basic pseudo-noise sequence (PN sequence) adopted in a code division multiple access (CDMA) system, which is a short form of the longest linear feedback shift register sequence. In the embodiments of the present application, the m sequence can also be referred to as (or represented as) an M-sequence, an m-sequence, or an M sequence, and no limitation is made thereto.

[0187] The NR primary synchronization signal (PSS) adopts a frequency domain mapped m sequence. For a time domain m sequence with a cyclic shift index k, the discrete time signal can be represented as:

[0188] where s k (n) is an element with an index n in the m sequence with a cyclic shift index k, N m is the sequence length of the m sequence, the trace function of the finite field α is a primitive element, Δ T is the maximum round trip delay, kΔ T is the cyclic shift of the m sequence. For a binary m sequence, p = 2, d = log2(N m + 1).

[0189] The sidelobe of the autocorrelation function of the m sequence is always -1, the global ambiguity function of the m sequence has a single peak characteristic, and the maximum sidelobe value is reaching the asymptotic optimality. The autocorrelation function of the m sequence can be represented as:

[0190] where τ is time delay, and v is Doppler shift. As shown in Fig. 5, it is a distribution diagram of the self ambiguity function value of the m sequence in the time delay-Doppler shift plane. The peak value N of the self ambiguity function of the m sequence is m At τ = 0 and v = 0, there is uniqueness, while at τ = 0 and v ≠ 0, the self ambiguity function value of the m sequence is 0, at τ ≠ 0 and v = 0, the self ambiguity function value of the m sequence is 1, and at τ ≠ 0 and v ≠ 0, the self ambiguity function value of the m sequence is The self ambiguity function of the m sequence has a single peak characteristic.

[0191] If the PRACH sequence is generated by using the m sequence, the cross correlation is poor, and because the number of primitive polynomials of the m sequence is small, the number of the PRACH sequences that can be generated is also relatively small, resulting in small PRACH sequence capacity.

[0192] 4. ZC cover m sequence

[0193] In order to expand the sequence capacity, the ZC sequence and the m sequence can be multiplied point by point to obtain the ZC cover m sequence, and the lengths of the ZC sequence and the m sequence are both N. The discrete-time signal of the ZC cover m sequence can be expressed as:

[0194] where s u,k,l (n) is an element with index n in the ZC cover m sequence, is the floor function, k ∈ {0, 1, …, N-1}, and u ∈ {1, 2, …, N-1}. The sidelobe amplitude of the autocorrelation function of the ZC cover m sequence is always The global self ambiguity function has a single peak characteristic, and the maximum sidelobe value is It reaches asymptotic optimality.

[0195] ZC cover m sequence and The cross correlation function of the ZC cover m sequence and the ZC cover m sequence can be expressed as:

[0196] where represents less than or approximately equal to

[0197] The ZC cover m sequence has the characteristics of large capacity and low correlation region, and the sequence capacity is positively correlated with the cube of the sequence length, that is, N3, but it cannot resist Doppler shift.

[0198] As known from the above, using the ZC sequence or the m sequence to generate the PRACH sequence will have the problem of limited sequence capacity, which may cause collision when a large number of terminal devices perform random access. Although the ZC cover m sequence can expand the sequence capacity, it cannot resist the Doppler frequency shift. Therefore, an embodiment of the present application provides a communication method, which uses the ZC sequence and the m sequence to construct a sequence with large sequence capacity and low ambiguity area, to generate the PRACH sequence, which can improve the PRACH sequence capacity, resist the Doppler frequency shift of any subcarrier spacing, and is not restricted by the condition that the maximum low ambiguity area is not more than the ZC sequence length.

[0199] For example, FIG. 6 is a schematic diagram of an architecture of a communication system provided by an embodiment of the present application. As shown in FIG. 6, the communication system includes a network device and a terminal device. The network device and the terminal device can directly communicate with each other, or can forward the communication through other devices. It should be noted that FIG. 6 exemplarily shows one network device and one terminal device, and the number of network devices and terminal devices is not limited in the embodiments of the present application.

[0200] In the embodiments of the present application, the network device can also be referred to as a radio access network (RAN) node, an access network device, a RAN entity or an access node, etc., which is located at the network side of the above communication system, used to help terminal devices to realize wireless access, and is a device with wireless transceiving function or a chip or chip system that can be arranged in the device. The network device includes but is not limited to: a base station, an evolved NodeB (eNodeB), an access point (AP), a transmission reception point (TRP), a next generation NodeB (gNB), a base station in a future mobile communication system, or an access node in a wireless fidelity (Wi-Fi) system, etc. The network device can be a macro base station, a micro base station or an indoor station, a relay node or a donor node, an open radio access network (ORAN), or a wireless controller in a centralized radio access network (CRAN) scenario. Optionally, the RAN node can also be a server, a wearable device, a vehicle or a vehicle-mounted device, etc. For example, the access network device in the V2X technology can be a road side unit (RSU). All or part of the functions of the network device in the present application can also be realized by software functions running on hardware, or by virtualized functions instantiated on a platform (such as a cloud platform). The network device in the present application can also be a logical node, a logical module or software that can realize all or part of the functions of the network device.

[0201] In another possible scenario, a terminal device is assisted by multiple RAN nodes to implement wireless access, and different RAN nodes respectively implement part of functions of a base station. For example, a RAN node can be a central unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU), etc. The CU and the DU can be separately arranged, or can be included in the same network element, for example, in a baseband unit (BBU). The RU can be included in a radio frequency device or a radio frequency unit, for example, in a remote radio unit (RRU), an active antenna processing unit (AAU), or a remote radio head (RRH).

[0202] In different systems, the CU (or CU-CP and CU-UP), DU or RU can also have different names, but those skilled in the art can understand their meanings. For example, in an ORAN system, the CU can also be referred to as an O-CU (open CU), the DU can also be referred to as an O-DU, the CU-CP can also be referred to as an O-CU-CP, the CU-UP can also be referred to as an O-CU-UP, and the RU can also be referred to as an O-RU. For the convenience of description, the CU, CU-CP, CU-UP, DU and RU are taken as examples for description in this application. Any one of the CU (or CU-CP, CU-UP), DU and RU in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0203] The form of the network device is not limited in the embodiments of this application, and the device for implementing the functions of the network device can be the network device, or can be a device capable of supporting the network device to implement the functions, for example, a chip system. The device can be installed in the network device or used in matching with the network device.

[0204] In the embodiments of the present application, the terminal device is a terminal with wireless transceiving function or a chip or chip system that can be arranged in the terminal, which accesses the above communication system. The terminal device can also be referred to as user equipment (UE), user apparatus, access terminal, subscriber unit, subscriber station, mobile station, mobile, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent or user apparatus. The terminal device in the embodiments of the present application can be a mobile phone, a tablet computer, a computer with wireless transceiving function, a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in remote medical treatment, a wireless terminal in smart grid, a wireless terminal in transportation safety, a wireless terminal in smart city, a wireless terminal in smart home, a vehicle-mounted terminal, a RSU with terminal function, etc. The terminal device in the present application can also be a vehicle-mounted module, a vehicle-mounted component, a vehicle-mounted chip or a vehicle-mounted unit built in a vehicle as one or more components or units, and the vehicle can implement the method provided in the present application by means of the built-in vehicle-mounted module, vehicle-mounted component, vehicle-mounted chip or vehicle-mounted unit.

[0205] The embodiments of the present application do not limit the form of the terminal device, and the device for realizing the function of the terminal device can be the terminal device, or can be a device capable of supporting the terminal device to realize the function, such as a chip system. The device can be installed in the terminal device or used in matching with the terminal device. In the embodiments of the present application, the chip system can be composed of a chip, or can include a chip and other discrete devices.

[0206] In the embodiments of the present application, the terminal device can randomly select a random access sequence from the random access sequence resource pool to initiate random access. The random access sequence in the random access sequence resource pool is a sequence with large sequence capacity and low ambiguity region, which is constructed by a ZC sequence and an m sequence. Based on the sequence with large sequence capacity and low ambiguity region, the number of random access sequences in the random access sequence resource pool can be increased, so that the random access collision between terminal devices in the same cell can be reduced. Correspondingly, the network device can correlate the received random access signal with the random access sequence in the random access sequence resource pool to determine which random access sequence the current random access signal corresponds to, so as to determine the random access resource and other information associated with the random access sequence, so as to facilitate the execution of the subsequent random access process.

[0207] It should be pointed out that the scheme in the embodiments of the present application can also be applied to other communication systems, and the corresponding names can also be replaced by the names of the corresponding functions in other communication systems.

[0208] The communication method provided by the embodiments of the present application will be described in detail below with reference to FIGS. 7-10.

[0209] Exemplarily, FIG. 7 is a flow diagram of a communication method provided by the embodiments of the present application. It can be understood that the network device and the terminal device shown in FIG. 6 are taken as an example of the execution subject of the interaction diagram in the present application, but the present application does not limit the execution subject of the interaction diagram. For example, the method performed by the network device in the present application can also be implemented by a module (such as a circuit, a chip or a chip system, etc.) in the network device, or a logical node, a logical module or software capable of realizing all or part of the functions of the network device; the method performed by the terminal device in the present application can also be implemented by a communication module in the terminal device or a circuit or chip (such as a modem chip (also known as a baseband chip), or a SoC chip containing a modem core, or a SIP chip) responsible for communication functions in the terminal device.

[0210] As shown in FIG. 7, the communication method comprises:

[0211] S701, the network device sends a system message to the terminal device. Correspondingly, the terminal device receives the system message from the network device.

[0212] In the embodiments of the present application, after the network device and the terminal device complete downlink synchronization, the network device can send a system message, such as a system information block (SIB) 1, to the terminal device, wherein the system message includes information for indicating a maximum round trip delay and information for indicating a maximum Doppler shift. It should be understood that the system message can also include cell selection information, configuration information of a random access resource used by the terminal device to subsequently initiate random access, system information (SI) scheduling information, and the like, which are not limited herein.

[0213] The maximum round trip delay can be understood as a maximum delay between a time when a sender starts to send a signal and a time when the sender confirms that the signal is received by a receiver within a coverage range of a cell where the terminal device is located, or a maximum delay that can be generated in a process from when the sender starts to send the signal to when the sender confirms that the signal is received by the receiver within a maximum coverage range supported by the cell where the terminal device is located, denoted as Δ T The cell coverage range is related to the maximum round trip delay, such as the cell coverage range is 0~c(Δ T -1)T s / 2, c is the speed of light, T s is a symbol time interval.

[0214] For a cell, a plurality of maximum round trip delays can be pre-defined or pre-configured by agreement, and each maximum round trip delay corresponds to information for indicating the maximum round trip delay, such as an index or a serial number, that is, one maximum round trip delay corresponds to one index or serial number, or in other words, the network device and the terminal device both store a correspondence between the plurality of maximum round trip delays pre-defined or pre-configured by agreement and the information for indicating the maximum round trip delay. Therefore, the network device can determine one maximum round trip delay from the plurality of maximum round trip delays according to a coverage range of a current cell, a symbol transmission rate, and the like, and indicate the maximum round trip delay to the terminal device through the system message, so as to be used by the terminal device to subsequently determine a random access sequence.

[0215] The maximum Doppler shift can also be referred to as a maximum Doppler frequency offset, and can be understood as a maximum frequency offset between a received signal and a transmitted signal caused by movement of the terminal device within a coverage range of a cell where the terminal device is located, denoted as Δ F The movement speed range of the terminal device within the cell is related to the maximum Doppler shift, such as the movement speed range of the terminal device within the cell is -c(Δ F -1)Δf / 4f c ~c(Δ F -1)Δf / 4f c Δf is a subcarrier spacing, and f c is a carrier frequency.

[0216] Similar to the maximum round trip delay, for a cell, a plurality of maximum Doppler shifts can be pre-defined or pre-configured by a protocol, each maximum Doppler shift corresponding to an information for indicating the maximum Doppler shift, such as an index or a serial number, that is, one Doppler shift corresponds to one index or serial number, or in other words, the network device and the terminal device both store the correspondence between the plurality of maximum Doppler shifts pre-defined or pre-configured by the protocol and the information for indicating the maximum Doppler shift. Thus, the network device can determine a maximum Doppler shift from the plurality of maximum Doppler shifts according to the subcarrier spacing, the carrier frequency, etc., and indicate it to the terminal device through a system message for subsequent determination of the random access sequence by the terminal device.

[0217] It should be understood that the indices of the parameters can be numbered continuously from 0 or 1, and this is not limited. In the embodiments of the present application, the indices of the parameters are numbered from 0 as an example.

[0218] S702, the terminal device acquires the first random access sequence.

[0219] The random access sequence is used for the terminal device to initiate random access, and the random access sequence can also be referred to as a random access preamble sequence, a preamble sequence, a PRACH sequence, etc., and this is not limited. The first random access sequence refers to a random access sequence randomly selected by the terminal device from the random access sequence resource pool of the cell.

[0220] Among them, a plurality of different random access sequences are pre-configured in the random access sequence resource pool, and the number of random access sequences in the random access sequence resource pool is related to the capacity of the random access sequence. For different cells, the number of random access sequences in the configured random access sequence resource pool can be the same or different, but the random access sequences in the random access sequence resource pool of each cell are different. For each random access sequence in the random access sequence resource pool, there can also be an index or a serial number corresponding to it, and different indices or serial numbers correspond to different random access sequences.

[0221] In the embodiments of the present application, each random access sequence (including the first random access sequence) is generated according to a base sequence (base sequence) and a supplementary sequence (supplementary sequence) with the same length, as shown in FIG. 8, wherein the base sequence has the characteristics of global low ambiguity, and the supplementary sequence has the characteristics of large sequence capacity and low ambiguity region.

[0222] The same base sequence and different auxiliary sequences can constitute different random access sequences, different base sequences and the same auxiliary sequence can constitute different random access sequences, and different base sequences and different auxiliary sequences can constitute different random access sequences. The sequence length of the random access sequence is the sequence length of the base sequence or the auxiliary sequence, which can be understood as that the sequence length of the random access sequence is determined according to the sequence length of the base sequence and the auxiliary sequence.

[0223] That is, the random access sequence is generated by two sequences with the same sequence length, and the sequence length of the generated random access sequence is the same as the sequence length of the base sequence and the sequence length of the auxiliary sequence constituting the random access sequence. In the embodiment of the application, the sequence lengths of the base sequence, the auxiliary sequence and the random access sequence are all represented as N.

[0224] The base sequence is generated according to the m-sequence, and the base sequence also has a cyclic shift because the m-sequence has a cyclic shift. The cyclic shift of the base sequence is related to the maximum round trip delay and the length of the random access sequence, or in other words, the cyclic shift of the base sequence used to generate the random access sequence is designed based on the maximum round trip delay and the sequence length.

[0225] Different base sequences refer to base sequences with different cyclic shifts. Different cyclic shifts of the m-sequence can constitute different base sequences, and different base sequences can constitute different random access sequences. It should be understood that, since the base sequence is generated according to the m-sequence, there is a transformation relationship between the cyclic shift of the base sequence and the cyclic shift of the m-sequence.

[0226] For any random access sequence, taking the first random access sequence as an example, in a possible design scheme, the cyclic shift c i of the base sequence in the first random access sequence can satisfy the following relationship: i c i = k T ;

[0227] wherein k i is the index of the cyclic shift of the base sequence, k i is an integer, is the floor function, Δ T is the maximum round trip delay, N is the sequence length of the first random access sequence, and i is the serial number / index of the first random access sequence in the random access sequence resource pool.

[0228] Therefore, the cyclic shift of one base sequence corresponds to an index, different indexes correspond to different cyclic shifts, different cyclic shifts correspond to different base sequences, and different base sequences can correspond to different random access sequences, that is, different cyclic shift base sequences correspond to different random access sequences. The index of the cyclic shift can be understood as a multiple value of the maximum round trip delay, the cyclic shift of the base sequence is an integer multiple of the maximum round trip delay, different multiple values correspond to different cyclic shift base sequences, that is, the value range of the cyclic shift of the base sequence is Also expressed as c i is an integer multiple of Δ T . Moreover, the minimum interval of the cyclic shift of the base sequence is the maximum round trip delay, and the minimum interval means that the minimum value of the difference between the cyclic shifts of any two different base sequences is the maximum round trip delay.

[0229] The auxiliary sequence is generated according to the ZC sequence, and since the ZC sequence has a root index and a cyclic shift, or has a root index and a phase offset, the auxiliary sequence also has a root index and a cyclic shift, or has a root index and a phase offset. The same root index and different cyclic shifts / phase offsets can constitute different auxiliary sequences, different root indexes and the same cyclic shifts / phase offsets can constitute different auxiliary sequences, and different root indexes and different cyclic shifts / phase offsets can constitute different auxiliary sequences, that is, different auxiliary sequences refer to auxiliary sequences with at least one different root index and cyclic shift, or at least one different root index and phase offset.

[0230] Wherein, the root index of the auxiliary sequence is related to the sequence length of the auxiliary sequence, for any random access sequence, taking the first random access sequence as an example, the root index of the auxiliary sequence in the first random access sequence can be expressed as u i , 0≤u i ≤N ZC -1 and u i is an integer, N ZC is the sequence length of the ZC sequence, which can be understood as the root index of the ZC sequence constituting the auxiliary sequence.

[0231] The cyclic shift of the auxiliary sequence is related to the maximum Doppler shift and the length of the random access sequence, or the phase offset of the auxiliary sequence is related to the maximum Doppler shift and the length of the random access sequence. That is, the cyclic shift / phase offset of the auxiliary sequence is designed based on the maximum Doppler shift and the length of the random access sequence. It should be understood that there is a transformation relationship between the root index of the auxiliary sequence and the root index of the ZC sequence, there is a transformation relationship between the cyclic shift of the auxiliary sequence and the cyclic shift of the ZC sequence, and there is a transformation relationship between the phase offset of the auxiliary sequence and the phase offset of the ZC sequence.

[0232] For any one random access sequence, taking the first random access sequence as an example:

[0233] In a possible design scheme, the cyclic shift d of the auxiliary sequence in the first random access sequence i can satisfy the following relationship: d i =l i gΔ F ;

[0234] wherein, l i is the index of the cyclic shift of the auxiliary sequence, and l i is an integer, Δ F is the maximum Doppler shift, g is the smallest positive integer satisfying (gu i )modN=1, and g can refer to the multiplicative inverse element of the finite field , which is related to the root index and the length of the auxiliary sequence.

[0235] Therefore, the cyclic shift of one auxiliary sequence also corresponds to an index, different indexes correspond to different cyclic shifts, different cyclic shifts correspond to different auxiliary sequences, and different auxiliary sequences can correspond to different random access sequences, that is, different cyclic shift auxiliary sequences also correspond to different random access sequences. The index l i of the cyclic shift can be understood as a multiple value of the maximum Doppler shift, and the cyclic shift of the auxiliary sequence is an integer multiple of the maximum Doppler shift, different multiple values correspond to different cyclic shift auxiliary sequences, that is, the value range of the cyclic shift of the auxiliary sequence is which can also be expressed as d i is an integer multiple of gΔ F . Moreover, the minimum interval of the cyclic shift of the auxiliary sequence is g times the maximum Doppler shift, and the minimum interval refers to the minimum value of the difference between the cyclic shifts of any two different auxiliary sequences, which is g times the maximum Doppler shift.

[0236] In one possible design, the phase offset θ of the auxiliary sequence in the first random access sequence i The following relationship can be satisfied: θ i =p i Δ F ;

[0237] Where, p i For the index of phase offset, And p i The value is an integer. Therefore, one phase shift corresponds to one index, different indices correspond to different phase shifts, and different phase shifts can correspond to different random access sequences. In other words, different auxiliary sequences for different phase shifts also correspond to different random access sequences. The phase shift index can be understood as a multiple of the maximum Doppler frequency shift. The phase shift of the auxiliary sequence is an integer multiple of the maximum Doppler frequency shift, and different multiples correspond to different auxiliary sequences with different phase shifts. That is, the range of values ​​for the phase shift of the auxiliary sequence is... It can also be expressed as θ i For Δ F The minimum interval of the phase shift of the auxiliary sequence is the maximum Doppler shift, which means that the minimum difference between the phase shifts of any two different auxiliary sequences is the maximum Doppler shift.

[0238] It's understandable, d i =gθ i .

[0239] If the random access sequence satisfies the above design, the random access sequence is cyclically shifted by c according to the base sequence. i (or the index k of the cyclic shift of the base sequence) i ), cyclic shift d of auxiliary sequence i (or the index l of the circular shift of the auxiliary sequence) i ) and the root index u of the auxiliary sequence i The value of is determined, or the random access sequence is cyclically shifted by c according to the base sequence. i (or the index k of the cyclic shift of the base sequence) i Phase offset θ of auxiliary sequence i (or the index p of the phase shift of the auxiliary sequence) i ) and the root index u of the auxiliary sequence i The value of c is determined. i / k i d i / l i u i The different values ​​of c, or i / k i θ i / p i u i Different values ​​of constitute different random access sequences. Therefore, the terminal device can select the index of the cyclic shift of the base sequence, the root index of the auxiliary sequence, and the index of the cyclic shift or phase offset of the auxiliary sequence to obtain the random access sequence.

[0240] It can be understood that the index of the cyclic shift of the base sequence of the random access sequence in the random access sequence resource pool can form a resource pool #1, the index of the cyclic shift / phase offset of the auxiliary sequence can form a resource pool #2, and the root index of the auxiliary sequence can form a resource pool #3. The terminal device randomly selects a random access sequence from the random access sequence resource pool, which is equivalent to the terminal device randomly selecting a parameter from resource pool #1, resource pool #2, and resource pool #3 respectively to form a random access sequence.

[0241] Based on the above design, the first random access sequence can be: One of the sequences. That is, based on c i / k i d i / l i u i The value of c i / k i θ i / p i u i The design of the value range can yield... Given a set of random access sequences of the same length but different values, the sequence capacity of the random access sequence is... The random access sequences in the random access sequence resource pool configured for each cell are from... It was selected from a number of different random access sequences. And, The area Δ of the low-ambiguity region in any random access sequence (including the first random access sequence) among the random access sequences. T ·Δ F The sequence length N is greater than the random access sequence.

[0242] Regarding the sequence lengths of the m-sequence and ZC sequence used to generate the random access sequence, the embodiments of this application have the following two designs:

[0243] Design 1: The sequence length of the m-sequence is equal to the sequence length of the ZC sequence.

[0244] In this design 1, the sequence length N of the random access sequence (including the first random access sequence) is 2. r-1 and is a prime number, r is a positive integer, for example, N = 3, 7, 31, 127, 8191, …. In this case, the base sequence is an m-sequence and the auxiliary sequence is a ZC sequence. That is, the random access sequence is generated according to an m-sequence and a ZC sequence with the same length, the cyclic shift of the m-sequence satisfies the above design, and the root index and the cyclic shift / phase offset of the ZC sequence satisfy the above design. Moreover, the sequence length of the base sequence is N m , the sequence length of the auxiliary sequence is N ZC , N = N m = N ZC , and thus the sequence capacity of the random access sequence can also be expressed as The random access sequence in the random access sequence resource pool configured by each cell is selected from 2 different random access sequences.

[0245] For example, if N = 127, Δ T = 2, and Δ F = 3, the sequence capacity of the random access sequence is Therefore, the random access sequence in the random access sequence resource pool configured by each cell can be selected from 333396 different random access sequences, and the number of random access sequences in the random access sequence resource pool can be more than 64, such as 128, 256, 512, 1024, and the like.

[0246] The representation of the random access sequence can include the following two forms:

[0247] (1) In the case where the random access sequence is composed of the cyclic shift of the base sequence (i.e., the m-sequence) and the cyclic shift of the auxiliary sequence (i.e., the ZC sequence), the element with index or serial number n in the first random access sequence can satisfy the following relationship:

[0248] wherein is the element with index or serial number n in the base sequence, is the element with index or serial number n in the auxiliary sequence, 0 ≤ n ≤ N-1 and n is an integer, Tr(·) is the trace function of the finite field, α is the primitive element of the finite field, and the meanings of the other parameters can be referred to the related description in the above scheme, which will not be described herein. It should be understood that in the embodiments of the present application, the element with index or serial number n in the sequence can be understood as the (n+1)th element in the sequence.

[0249] For the ambiguity function of any two random access sequences in the random access sequence resource pool or ​any two of the random access sequences, with the first random access sequence and the second random access sequence the mutual confusion function of the first random access sequence and the second random access sequence satisfies the following relationship:

[0250] wherein τ is a time delay and ν is a Doppler frequency domain and ν∈[0,Δ F -1], and ∨ is a logical or, is less than or approximately equal to. It should be understood that, in the case of u i =u j ,k i =k j ,p i =p j ,τ=0,ν=0, the second random access sequence is the first random access sequence, is a self-confusion function.

[0251] (2) In the case where the random access sequence is composed of a cyclic shift of a base sequence (i.e., an m-sequence) and a phase offset of an auxiliary sequence (i.e., a ZC sequence), the element with index or serial number n in the first random access sequence may satisfy the following relationship:

[0252] wherein is the element with index or serial number n in the base sequence, is the element with index or serial number n in the auxiliary sequence.

[0253] For the confusion function of any two of the random access sequences in the random access sequence resource pool, or any two of the random access sequences, with the first random access sequence and the second random access sequence the mutual confusion function of the first random access sequence and the second random access sequence satisfies the following relationship:

[0254] wherein τ is a time delay and ν is a Doppler frequency domain and ν∈[0,Δ F -1]. It should be understood that, in the case of u i =u j ,k i =k j ,p i =p j ,τ=0,ν=0, the second random access sequence is the first random access sequence, is a self-confusion function.

[0255] As can be seen from the above, in the case that the root index of the auxiliary sequence corresponding to the first random access sequence is the same as the root index of the auxiliary sequence corresponding to the second random access sequence, the maximum value of the cross ambiguity function of the first random access sequence and the second random access sequence is less than or equal to In the case that the root index of the auxiliary sequence corresponding to the first random access sequence is not the same as the root index of the auxiliary sequence corresponding to the second random access sequence, the maximum value of the cross ambiguity function of the first random access sequence and the second random access sequence is less than or approximately equal to Therefore, different random access sequences can be distinguished by the peak value of the cross ambiguity function of the random access sequence.

[0256] For example, taking N = 127 as an example, (a) of FIG. 9 shows that u i = u j In the case of u i ≠ u j In the case of u

[0257] As shown in (a) of FIG. 9, in the case of u i = u j When τ = 0 and v = 0, the peak value of the cross ambiguity function is N (0 dB); when τ = 0 and v ≠ 0, the cross ambiguity function value is 0 (less than 60 dB); when τ ≠ 0 and v ≠ 0, the cross ambiguity function value is part of 1 (such as the black points on the plane), and part of The cross ambiguity function value is The points of the cross ambiguity function value correspond to a dB value greater than the dB value corresponding to the cross ambiguity function value 1, and the cross ambiguity function value corresponds to a dB value greater than the dB value corresponding to the cross ambiguity function value 0.

[0258] As shown in (b) of FIG. 9, in the case of u i ≠ u j In the case of u The mutual blurring function value corresponding to each point on the τ-ν plane is converted into a dB value less than or equal to 0 dB.

[0259] The sequence length of the m sequence and the sequence length of the ZC sequence are not equal in the design 2.

[0260] In the design 2, the sequence length N of the random access sequence (including the first random access sequence) can be 2 r -1 and a prime number, and r is a positive integer, for example, N=3, 5, 7, 11, 13, 15, 17, 19, 23, 29, 31, ….

[0261] In the design 2, there are two cases as follows:

[0262] Case 1: The sequence length of the m sequence is less than the sequence length of the ZC sequence.

[0263] In the case 1, the auxiliary sequence is the ZC sequence, and the base sequence is obtained by transforming the m sequence, and in a possible implementation, the base sequence is obtained by performing N-point IDFT (inverse discrete fourier transform) on the first transformed sequence, the first transformed sequence is obtained by appending N-N m zeroes to the second transformed sequence, and the second transformed sequence is obtained by performing N m point DFT (discrete fourier transform) on the m sequence, N m is the sequence length of the m sequence.

[0264] The first transformed sequence is obtained by appending N-N m zeroes to the second transformed sequence, which can be continuously appending N-N m zeroes to the head of the second transformed sequence, continuously appending N-N m zeroes to the tail of the second transformed sequence, continuously appending N A zeroes to the head of the second transformed sequence and appending N-N m -N A zeroes to the tail of the second transformed sequence, N A is a positive integer, which is not limited.

[0265] As shown in FIG. 10, in the case of N m <N ZC =N (N ZC is the length of the ZC sequence), the m sequence with the sequence length of N m is output by N m point DFT, the second transformed sequence is obtained by appending zero (appending N-N mThe first transform sequence is outputted, the first transform sequence is outputted by N-point IDFT, and then the base sequence is multiplied by the ZC sequence (auxiliary sequence) point by point to obtain the random access sequence.

[0266] At this time, the sequence length of the base sequence and the sequence length of the auxiliary sequence are both the sequence length N of the ZC sequence ZC , i.e. N ZC =N, so the sequence capacity of the random access sequence can also be expressed as The random access sequence in the random access sequence resource pool configured by each cell is selected from different random access sequences.

[0267] For example, if N m =127, N ZC =N=139, Δ T =2, and Δ F =3, the sequence capacity of the random access sequence is Therefore, the random access sequence in the random access sequence resource pool configured by each cell can be selected from 438012 different random access sequences, and the number of random access sequences in the random access sequence resource pool can also be more than 64, such as 128, 256, 512, 1024, etc.

[0268] For example, if N m =127, N ZC =N=839, Δ T =15, and Δ F =5, the sequence capacity of the random access sequence is Therefore, the random access sequence in the random access sequence resource pool configured by each cell can be selected from 7697030 different random access sequences, and the number of random access sequences in the random access sequence resource pool can also be more than 64, such as 128, 256, 512, 1024, etc.

[0269] The random access sequence can include the following two forms:

[0270] (1) In the case where the random access sequence is composed of the cyclic shift of the base sequence and the cyclic shift of the auxiliary sequence (i.e. the ZC sequence), the element with index or serial number n in the first random access sequence can satisfy the following relationship:

[0271] wherein, is the element with index or serial number n in the base sequence, is the element with index or serial number t in the m sequence, 0≤t≤N m ​-1 and t is an integer, is an element with index or serial number n in the auxiliary sequence.

[0272] (2) In the case where the random access sequence is composed of the cyclic shift of the base sequence and the phase offset of the auxiliary sequence (i.e. the ZC sequence), an element with index or serial number n in the first random access sequence may satisfy the following relationship:

[0273] wherein, is an element with index or serial number n in the auxiliary sequence.

[0274] It should be understood that, the cyclic shift of the base sequence and the cyclic shift of the base sequence have a transformation relationship.

[0275] Case 2: the sequence length of the m sequence is greater than the sequence length of the ZC sequence.

[0276] In this case 2, the base sequence is the m sequence, and the auxiliary sequence is obtained by transforming the ZC sequence. In one possible implementation, the auxiliary sequence is obtained by performing N-point IDFT on the third transformed sequence, the third transformed sequence is obtained by appending N-N ZC zeroes to the fourth transformed sequence, the fourth transformed sequence is obtained by performing N ZC -point DFT on the ZC sequence, and N ZC is the sequence length of the ZC sequence.

[0277] wherein the third transformed sequence is obtained by appending N-N ZC zeroes to the fourth transformed sequence, which can be continuously appending N-N ZC zeroes to the head of the fourth transformed sequence, continuously appending N-N ZC zeroes to the tail of the fourth transformed sequence, continuously appending N B zeroes to the head of the fourth transformed sequence and appending N-N ZC -N B zeroes to the tail of the fourth transformed sequence, and N B is a positive integer, which is not limited.

[0278] For example, as shown in FIG. 10, in the case where N ZC <N m =N, the ZC sequence with the sequence length of N ZC is subjected to N ZC -point DFT to output the fourth transformed sequence, the fourth transformed sequence is subjected to zero appending (appending N-N ZC zeroes) to output the third transformed sequence, the third transformed sequence is subjected to N-point IDFT to output the auxiliary sequence, and then the base sequence (i.e. the m sequence) and the auxiliary sequence are subjected to point-by-point multiplication to obtain the random access sequence.

[0279] The difference between case 2 and case 1 and design 1 is that N ZC ≠ N, so the sequence capacity of the random access sequence is The random access sequence in the random access sequence resource pool configured for each cell is selected from different random access sequences.

[0280] For example, if N m = N = 511, N ZC = 139, Δ T = 13, Δ F = 1, the sequence capacity of the random access sequence is Therefore, the random access sequence in the random access sequence resource pool configured for each cell can be selected from 2750202 different random access sequences, and the number of random access sequences in the random access sequence resource pool can also exceed 64, such as 128, 256, 512, 1024, etc.

[0281] In the case where the random access sequence is composed of the cyclic shift of the base sequence (i.e. the m-sequence) and the phase offset of the auxiliary sequence, the element with index or serial number n in the first random access sequence may satisfy the following relationship:

[0282] wherein, is the element with index or serial number n in the base sequence, is the element with index or serial number n in the auxiliary sequence, is the element with index or serial number t in the ZC sequence, 0≤t≤N ZC -1 and t is an integer.

[0283] It should be understood that the cyclic shift of the base sequence and the cyclic shift of the auxiliary sequence have a transformation relationship, the phase offset of the base sequence and the phase offset of the auxiliary sequence have a transformation relationship.

[0284] That is, in the case where the sequence lengths of the m-sequence and the ZC sequence are not equal in length, the sequence with shorter sequence length in the m-sequence and the ZC sequence can be first expanded to be consistent with the length of the sequence with longer sequence length, thereby constructing a random access sequence with length .

[0285] For the above design 2, case 1 and case 2, for any two random access sequences in the random access sequence resource pool, the mutual ambiguity function or The mutual ambiguity function of any two of the random access sequences, taking a first random access sequence and a second random access sequence as an example, the maximum value of the mutual ambiguity function of the first random access sequence and the second random access sequence is less than or approximately equal to That is, when the m sequence is shorter, the maximum value of the mutual ambiguity function is less than or approximately equal to When the ZC sequence is shorter, the maximum value of the mutual ambiguity function is less than or approximately equal to

[0286] As can be seen from the above, in the embodiments of the present application, the random access sequence can have the following characteristics:

[0287] Characteristic 1, large sequence capacity, the sequence capacity can reach

[0288] Characteristic 2, large low ambiguity area (Δ T ·Δ F ) is greater than the sequence length N;

[0289] Characteristic 3, against arbitrary subcarrier spacing Doppler shift;

[0290] Characteristic 4, in the case of equal length of the sequence length of the m sequence and the ZC sequence, the sequence length N is 2 r -1 and is a prime number;

[0291] Characteristic 5, in the case of unequal length of the sequence length of the m sequence and the ZC sequence, the sequence length N is the union of 2 r -1 and prime number;

[0292] Characteristic 6, the minimum cyclic shift of the non-zero base sequence is the maximum round trip delay Δ T , the minimum cyclic shift of the non-zero base sequence is gΔ F , and the minimum phase offset of the non-zero base sequence is Δ F .

[0293] Therefore, the terminal device can randomly select a random access sequence from a random access sequence resource pool including random access sequences with the above characteristics, and the randomly selected random access sequence is the first random access sequence.

[0294] S703, the terminal device sends a random access signal according to the first random access sequence. Correspondingly, the network device receives the random access signal from the terminal device.

[0295] After the terminal device obtains the first random access sequence, the terminal device can send a random access signal obtained by modulating, mapping, etc. The random access signal can be referred to as a random access request, Msg1 or preamble.

[0296] For the random access resource used by the terminal device to send the random access signal, when the network device and the terminal device are in downlink synchronization, the network device associates each synchronization signal SSB sent by the network device with a corresponding random access resource, so that the terminal device can select the strongest SSB from the scanned multiple SSBs, and send the random access signal using the random access resource associated with the strongest SSB.

[0297] Correspondingly, the network device can perform a fuzzy function calculation on the received random access signal and each random access sequence in the random access sequence resource pool to obtain the value of the fuzzy function of the random access signal and different random access sequences, so that the network device can determine which random access sequence in the random access sequence resource pool the random access signal corresponds to according to the value of the fuzzy function of the random access signal and the random access signal, and the network device can also calculate the timing advance (TA) according to the random access signal, so as to perform a subsequent random access process, such as sending a random access response (RAR) to the terminal device, wherein the RAR includes information indicating the random access sequence corresponding to the random access signal and the TA. The information indicating the random access sequence corresponding to the random access signal can be an index, such as the index of the random access sequence corresponding to the random access signal in the random access sequence resource pool. The specific implementation of the network device performing the random access process can refer to the existing implementation manner, and will not be described here.

[0298] It can be understood that the random access sequence in the embodiments of the present application can also be used to generate sequences corresponding to other signals after transformation, such as demodulation reference signals (DMRS), sounding reference signals (SRS), sensing signals, etc., which are not limited.

[0299] It should be understood that in the embodiments of the present application, the multiplication of any two parameters, such as "ab", has the same meaning as "a·b" or "a×b", which is not limited.

[0300] Based on the communication method shown in FIG. 7, the terminal device can initiate random access through a random access sequence constructed by a base sequence generated according to an m sequence and an auxiliary sequence generated according to a ZC sequence, a cyclic shift of the base sequence of the random access sequence is associated with a maximum round trip delay, and a cyclic shift or phase offset of the auxiliary sequence is associated with a maximum Doppler shift. Not only does the capacity of the random access sequence positively correlate with the cube of the sequence length, but it also improves the sequence capacity, thereby reducing the probability of random access collision in the scenario of large-scale terminal device access, and resisting arbitrary subcarrier spacing Doppler shift and improving the low ambiguity area.

[0301] It can be understood that the methods and / or steps implemented by the network device in the above various embodiments can also be implemented by components (such as processors, chips, chip systems, circuits, logic modules, or software) available to the network device; the methods and / or steps implemented by the terminal device can also be implemented by components (such as processors, chips, chip systems, circuits, logic modules, or software) available to the terminal device.

[0302] The above mainly introduces the schemes provided in the present application. Accordingly, the present application also provides a communication apparatus, which is used to implement various methods in the above method embodiments. The communication apparatus can be the network device in the above method embodiments, or an apparatus containing the network device, or a component available to the network device, such as a chip or a chip system. Alternatively, the communication apparatus can be the terminal device in the above method embodiments, or an apparatus containing the terminal device, or a component available to the terminal device, such as a chip or a chip system.

[0303] It can be understood that the communication apparatus contains hardware structures and / or software modules corresponding to the implementation of various functions. Those skilled in the art should easily realize that, in combination with the units and algorithm steps of the examples described in the embodiments disclosed herein, the present application can be realized in the form of hardware or a combination of hardware and computer software. Whether a certain function is driven by hardware or computer software to drive hardware depends on the specific application and design constraints of the technical solution. Professional technicians can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.

[0304] The embodiments of the present application can divide the functional modules of the communication device according to the method embodiments, for example, each functional module can be divided according to each function, or two or more functions can be integrated into one processing module. The integrated module can be realized in the form of hardware or in the form of a software functional module. It should be noted that the division of the modules in the embodiments of the present application is illustrative, and is only a logical functional division. When actually implemented, another division manner can be used.

[0305] Taking the communication device as the network device or the terminal device in the method embodiments, FIG. 11 is a structural schematic diagram of a communication device provided by an embodiment of the present application. As shown in FIG. 11, the communication device 1100 includes a processing module 1101 and a communication module 1102. The processing module 1101 is configured to perform the processing functions of the network device or the terminal device in the method embodiments. The communication module 1102 is configured to perform the communication functions of the network device or the terminal device in the method embodiments.

[0306] The related content of each step of the method embodiments can be referred to the function description of the corresponding functional module, and will not be repeated here.

[0307] In a possible design, the communication module 1102 can include a receiving module and a sending module (not shown in FIG. 11). The sending module and the receiving module are respectively configured to implement the sending function and the receiving function of the communication device 1100.

[0308] In a possible design, the communication device 1100 can further include a storage module (not shown in FIG. 11), which stores a program or instructions. When the processing module 1101 executes the program or instructions, the communication device 1100 can perform the functions of the network device or the terminal device in the method shown in FIG. 7.

[0309] In some embodiments, the processing module 1101 involved in the communication device 1100 can be realized by a processor or a processor-related circuit component, and can be a processor or a processing unit. The communication module 1102 can be realized by a transceiver or a transceiver-related circuit component, and can be a transceiver or a receiving unit.

[0310] Exemplarily, FIG. 12 is a structural schematic diagram of another communication apparatus provided by the embodiments of the present application. The communication apparatus can be the network device or the terminal device in the method embodiments, or can be a chip (system) or other components or assemblies that can be arranged in the network device or the terminal device. As shown in FIG. 12, the communication apparatus 1200 can include a processor 1201, a bus 1202, a communication interface 1203, and a memory 1204. The processor 1201, the memory 1204, and the communication interface 1203 communicate through the bus 1202. The communication apparatus 1200 can be the network device or the terminal device. It should be understood that the number of processors and memories in the communication apparatus 1200 is not limited by the present application.

[0311] The bus 1202 can be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus, etc. The bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, only one line is shown in FIG. 12, but it does not mean that there is only one bus or only one type of bus. The bus 1202 can include a path for transmitting information between various components (for example, the memory 1204, the processor 1201, and the communication interface 1203) of the communication apparatus 1200.

[0312] The processor 1201 can include any one or more of a central processing unit (CPU), a graphics processing unit (GPU), a microprocessor (MP), or a digital signal processor (DSP), etc.

[0313] The memory 1204 can include a volatile memory (for example, a random access memory (RAM)), and the processor 1201 can further include a non-volatile memory (for example, a read-only memory (ROM), a flash memory, a hard disk drive (HDD), or a solid state drive (SSD)).

[0314] The communication interface 1203 uses a transceiver module such as, but not limited to, a network interface card or a transceiver to implement the communication between the communication apparatus 1200 and other devices or communication networks.

[0315] The executable program code stored in the memory 1204 is executed by the processor 1201 to implement the functions of the network device or the terminal device in the foregoing method embodiments, respectively. That is, the memory 1204 stores instructions for implementing the communication method.

[0316] In another aspect, the embodiments of the present application further provide a computer program product containing instructions, which, when executed on a communication device, enable the communication device to perform the method according to any one of the foregoing embodiments.

[0317] In another aspect, the embodiments of the present application further provide a computer readable storage medium. The computer readable storage medium stores computer programs or instructions, which, when executed on a communication device, enable the communication device to perform the method according to any one of the foregoing embodiments.

[0318] In the foregoing embodiments, the implementation can be achieved entirely or partially in software, hardware, firmware, or any combination thereof. When implemented by using a software program, the implementation can be achieved entirely or partially in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the entire or partial process or function according to the embodiments of the present application is generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable apparatus. The computer instructions can be stored in a computer readable storage medium or transferred from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions can be transferred from one website, computer, server, or data center to another website, computer, server, or data center through a wired (for example, coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (for example, infrared, wireless, microwave, etc.) manner. The computer readable storage medium can be any available medium that can be accessed by a computer or data storage device, such as one or more servers, data centers, etc., integrated with one or more media. The available medium can be a magnetic medium (for example, a floppy disk, a hard disk, a magnetic tape), an optical medium (for example, a DVD), or a semiconductor medium (for example, a solid state disk (SSD)), etc.

[0319] Those skilled in the art can clearly understand that the units and algorithm steps of each example described in combination with the embodiments disclosed herein can be realized by electronic hardware or a combination of computer software and electronic hardware. Whether the functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.

[0320] Those skilled in the art can clearly understand that, for the convenience and brevity of the description, the specific working processes of the above-described system, device and unit can refer to the corresponding processes in the foregoing method embodiments, which will not be repeated here.

[0321] In several embodiments provided in the present application, it should be understood that the disclosed system, device and method can be implemented in other ways. For example, the above-described device embodiments are only schematic, for example, the division of the units is only a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the units shown or discussed can be indirect coupling or communication connection through some interface, device or unit, and can be electrical, mechanical or other forms.

[0322] The units described as separate components can or can not be physically separated, and the components shown as units can or can not be physical units, that is, they can be located in one place, or can be distributed on a plurality of network units. Part or all of the units can be selected according to actual needs to achieve the purpose of the embodiment.

[0323] In addition, each functional unit in each embodiment of the present application can be integrated into a processing unit, or each unit can exist physically independently, or two or more units can be integrated into one unit.

[0324] If the functions are implemented in the form of software function units and sold or used as independent products, they can be stored in a computer readable storage medium. Based on this understanding, the technical solutions of the present application can be embodied in the form of a software product in essence or in the form of a part or the technical solutions of the present application that make contributions to the prior art. The computer software product is stored in a storage medium and includes a plurality of instructions for causing a computer device (which can be a personal computer, a server, or an access network device, etc.) to execute all or part of the steps of the methods described in various embodiments of the present application. The aforementioned storage medium includes a U disk, a mobile hard disk, a ROM, a random access memory RAM, a magnetic disk or an optical disk, and various program code storage media.

[0325] Although the present application is described herein in conjunction with various embodiments, those skilled in the art, with the benefit of the drawings, the disclosure, and the appended claims, can understand and implement other variations of the disclosed embodiments in the implementation of the claimed application. In the claims, the word "comprising" does not exclude other components or steps, and "a" or "one" does not exclude a plurality. A single processor or other unit can implement several of the functions listed in the claims. Measures recited in mutually different dependent claims can be combined and can be realized by a combination of measures.

[0326] Although the present application is described in conjunction with specific features and embodiments thereof, it is evident that various modifications and combinations can be made in light of the foregoing disclosure without departing from the spirit and scope of the present application. Accordingly, the present specification and drawings are to be regarded simply as illustrative of the present application defined in the appended claims, and it is intended to cover any and all modifications, variations, combinations or equivalents that fall within the scope of the present application. Obviously, those skilled in the art can make various modifications and variations to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims and their equivalents, they are intended to be included in the present application.

Claims

1. A communication method characterized by comprising: The method comprises: receiving a system message, the system message comprising information indicating a maximum round trip delay and information indicating a maximum Doppler shift; obtaining a first random access sequence, the first random access sequence being generated according to a base sequence and an auxiliary sequence with the same length, the base sequence being generated according to an m-sequence, the auxiliary sequence being generated according to a ZC sequence, a cyclic shift of the base sequence being related to the maximum round trip delay and a length of the first random access sequence, a cyclic shift of the auxiliary sequence being related to the maximum Doppler shift and the length of the first random access sequence, or a phase offset of the auxiliary sequence being related to the maximum Doppler shift and the length of the first random access sequence, the length of the first random access sequence being a sequence length of the base sequence or the auxiliary sequence; sending a random access signal according to the first random access sequence.

2. The method of claim 1, wherein, A minimum interval of the cyclic shift of the base sequence is the maximum round trip delay.

3. The method of claim 2, wherein, cyclic shifts c of the base sequence i satisfies the following relation: c i = k i Δ T ; wherein k i is an index of a cyclic shift of the base sequence, and k i is an integer, to round down, Δ T is the maximum round trip latency, N is the sequence length of the first random access sequence, and i is the sequence number of the first random access sequence in the random access sequence resource pool.

4. The method according to any one of claims 1 to 3, characterized in that, A minimum interval of cyclic shifts of the auxiliary sequence is g times the maximum Doppler shift, g being a minimum positive integer satisfying (gu i ) mod N = 1, u i being a root index of the auxiliary sequence, 0 ≤ u i ≤ N ZC - 1 and u i being an integer, N ZC being a sequence length of the ZC sequence, N being a sequence length of the first random access sequence, and i being a sequence number of the first random access sequence in a random access sequence resource pool.

5. The method of claim 4, wherein, The cyclic shift d of the helper sequence i satisfies the following relation: d i = l i gΔ F ; wherein, l i is an index of a cyclic shift of the secondary sequence, and l i is an integer, to round down, Δ F is the maximum Doppler shift.

6. The method according to any one of claims 1-5, characterized in that, A minimum interval of the phase offset is the maximum Doppler shift.

7. The method of claim 6, wherein, The phase shift θ i satisfies the following relationship: θ i = p i Δ F ; wherein p i is an index of the phase offset, and p i is an integer, to round down, Δ F is the maximum Doppler shift, N is the sequence length of the first random access sequence, and i is the sequence number of the first random access sequence in the random access sequence resource pool.

8. The method according to any one of claims 1-7, characterized in that, The first random access sequence is one of N sequences, where N is a sequence length of the first random access sequence, N one of N sequences, where N is a sequence length of the first random access sequence, N ZC is a sequence length of the ZC sequence, Δ T is the maximum round trip delay, Δ F is the maximum Doppler shift.

9. The method according to any one of claims 1-8, characterized in that, In a case where the sequence length of the m sequence and the sequence length of the ZC sequence are equal, the base sequence is the m sequence, the auxiliary sequence is the ZC sequence, and the sequence length of the first random access sequence is 2 r -1 and is a prime number, and r is a positive integer.

10. The method of claim 9, wherein, an element of the first random access sequence with index n satisfies the following relationship: wherein i is the serial number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, N is a sequence length of the first random access sequence, u i is a root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is a sequence length of the ZC sequence, l i is an index of a cyclic shift of the auxiliary sequence, and l i is an integer, Δ F is the maximum Doppler shift, for the element of the base sequence with index n, for an element of the auxiliary sequence with index n, 0≤n≤N-1 and n being an integer, c i is a cyclic shift of the base sequence and c i = k i Δ T , d i is a cyclic shift of the auxiliary sequence and d i = l i gΔ F , g being the smallest positive integer satisfying (gu i ) mod N = 1, is the trace function of the finite field, and a is a primitive element of the finite field, is rounded down.

11. The method of claim 9, wherein, an element of the first random access sequence with index n satisfies the following relationship: wherein i is the serial number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, N is a sequence length of the first random access sequence, u i is a root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is a sequence length of the ZC sequence, θ i is the phase offset and θ i = p i Δ F , p i is an index of the phase offset, and p i is an integer, Δ F is the maximum Doppler shift, for the element of the base sequence with index n, for an element of the auxiliary sequence with index n, 0≤n≤N-1 and n being an integer, c i is a cyclic shift of the base sequence and c i = k i Δ T , Tr(·) is the trace function of the finite field, α is a primitive element of the finite field, is rounded down.

12. The method according to any one of claims 9-11, characterized in that, The random access sequence resource pool in which the first random access sequence is located further comprises a second random access sequence, a plurality of random access sequences in the random access sequence resource pool having the same length; In a case where a root index of an auxiliary sequence corresponding to the first random access sequence is same as a root index of an auxiliary sequence corresponding to the second random access sequence, a maximum value of a mutual ambiguity function of the first random access sequence and the second random access sequence is less than or equal to N is a sequence length of the first random access sequence; In a case where the root index of the auxiliary sequence corresponding to the first random access sequence is not the same as the root index of the auxiliary sequence corresponding to the second random access sequence, the maximum value of the mutual confusion function of the first random access sequence and the second random access sequence is less than or approximately equal to 13. The method of any one of claims 1-8, wherein, In a case where the sequence length of the m sequence and the sequence length of the ZC sequence are not equal, the sequence length of the first random access sequence is 2 r -1 and one in the union set of prime numbers, r is a positive integer.

14. The method of claim 13, wherein, In a case where a sequence length of the m-sequence is smaller than a sequence length of the ZC sequence, the auxiliary sequence is the ZC sequence; The base sequence is generated according to an m-sequence, comprising: The base sequence is obtained by performing an N-point inverse discrete Fourier transform (IDFT) on a first transform sequence, the first transform sequence being obtained by appending N-N m zeroes to a second transform sequence, the second transform sequence being obtained by performing an N m point discrete Fourier transform (DFT) on the m-sequence, N m being a sequence length of the m-sequence, and N being a sequence length of the first random access sequence.

15. The method of claim 14, wherein, an element of the first random access sequence with index n satisfies the following relationship: wherein i is the serial number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, u i is a root index of the secondary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is a sequence length of the ZC sequence, l i is an index of the cyclic shift of the secondary sequence, and l i is an integer, Δ F is the maximum Doppler shift, 0≤n≤N-1 and n is an integer, c i is a cyclic shift of the base sequence and c i = k i Δ T , for the element of the base sequence with index n, for an element of the m-sequence with index t, 0≤t≤N m -1 and t is an integer, for an element of the auxiliary sequence with index n, d i is a cyclic shift of the auxiliary sequence and d i = 1 i gΔ F , g is the smallest positive integer satisfying (gu i ) mod N = 1, Tr(·) is the trace function of the finite field, a is a primitive element of the finite field, is rounded down.

16. The method of claim 14, wherein, an element of the first random access sequence with index n satisfies the following relationship: wherein i is the serial number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, u i is a root index of the secondary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is a sequence length of the ZC sequence, θ i is the phase offset and θ i = p i Δ F , p i is an index of the phase offset, and p i is an integer, Δ F is the maximum Doppler shift, 0 ≤ n ≤ N - 1 and n is an integer, for the element of the base sequence with index n, for an element of the m-sequence with index t, 0≤t≤N m -1 and t is an integer, for an element of the auxiliary sequence with index n, c i is a cyclic shift of the base sequence and c i = k i Δ T , Tr(·) is the trace function of the finite field, a is a primitive element of the finite field, is rounded down.

17. The method of claim 13, wherein, In a case where a sequence length of the m-sequence is greater than a sequence length of the ZC sequence, the base sequence is the m-sequence; The auxiliary sequence is generated according to the ZC sequence, comprising: The auxiliary sequence is obtained by performing N-point IDFT on a third transform sequence, the third transform sequence is obtained by appending N-N ZC zeroes to a fourth transform sequence, the fourth transform sequence is obtained by performing N ZC point DFT on the ZC sequence, N ZC is a sequence length of the ZC sequence, and N is a sequence length of the first random access sequence.

18. The method of claim 17, wherein, An element of the random access sequence with index n satisfies the following relation: wherein i is the serial number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, u i is a root index of the secondary sequence, 0≤u i ≤N ZC -1 and u i is an integer, θ i is the phase offset and θ i = p i Δ F , p i is an index of the phase offset, and p i is an integer, Δ F is the maximum Doppler shift, 0≤n≤N-1 and n is an integer, for the element of the base sequence with index n, for the element of the auxiliary sequence with index n, for an element of the ZC sequence with index t, 0≤t≤N ZC -1 and t is an integer, c i is a cyclic shift of the base sequence and c i = k i Δ T , Tr(·) is the trace function of the finite field, α is a primitive element of the finite field, is rounded down.

19. The method of any one of claims 1-18, wherein, A low ambiguity area of the first random access sequence is greater than a sequence length of the first random access sequence.

20. A method of communication, comprising: The method comprises: sending a system message, the system message comprising information indicating a maximum round trip delay and information indicating a maximum Doppler shift; receiving a random access signal, the random access signal corresponding to a first random access sequence, the first random access sequence being generated according to a base sequence and an auxiliary sequence with the same length, the base sequence being generated according to an m-sequence, the auxiliary sequence being generated according to a ZC sequence, a cyclic shift of the base sequence being related to the maximum round trip delay and a length of the first random access sequence, a cyclic shift of the auxiliary sequence being related to the maximum Doppler shift and the length of the first random access sequence, or a phase offset of the auxiliary sequence being related to the maximum Doppler shift and the length of the first random access sequence, the length of the first random access sequence being a sequence length of the base sequence or the auxiliary sequence.

21. The method of claim 20, wherein, A minimum interval of the cyclic shift of the base sequence is the maximum round trip delay.

22. The method of claim 21, wherein, cyclic shifts c of the base sequence i satisfies the following relation: c i = k i Δ T ; wherein k i is an index of a cyclic shift of the base sequence, and k i is an integer, to round down, Δ T is the maximum round trip latency, N is the sequence length of the first random access sequence, and i is the sequence number of the first random access sequence in the random access sequence resource pool.

23. The method of any one of claims 20-21, wherein, A minimum interval of cyclic shifts of the auxiliary sequence is g times the maximum Doppler shift, g being a minimum positive integer satisfying (gu i ) mod N = 1, u i being a root index of the auxiliary sequence, 0 ≤ u i ≤ N ZC -1 and u i being an integer, N ZC being a sequence length of the ZC sequence, N being a sequence length of the first random access sequence, and i being a sequence number of the first random access sequence in a random access sequence resource pool.

24. The method of claim 23, wherein, The cyclic shift d of the helper sequence i satisfies the following relation: d i = l i gΔ F ; wherein l i is an index of a cyclic shift of the secondary sequence, and l i is an integer, to round down, Δ F is the maximum Doppler shift.

25. The method of any one of claims 20-24, wherein, A minimum interval of the phase offset is the maximum Doppler shift.

26. The method of claim 25, wherein, The phase shift θ i satisfies the following relationship: θ i = p i Δ F ; wherein p i is an index of the phase offset, and p i is an integer, to round down, Δ F is the maximum Doppler shift, N is the sequence length of the first random access sequence, and i is the sequence number of the first random access sequence in the random access sequence resource pool.

27. The method of any one of claims 20-26, wherein, The first random access sequence is One of the sequences, where N is the sequence length of the first random access sequence. ZC Δ is the sequence length of the ZC sequence. T For the maximum round-trip time, Δ F The maximum Doppler frequency shift is given.

28. The method of any one of claims 20-27, wherein, In a case where the sequence length of the m sequence and the sequence length of the ZC sequence are equal, the base sequence is the m sequence, the auxiliary sequence is the ZC sequence, and the sequence length of the first random access sequence is 2 r -1 and is a prime number, and r is a positive integer.

29. The method of claim 28, wherein, an element of the first random access sequence with index n satisfies the following relationship: wherein i is the serial number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, N is a sequence length of the first random access sequence, u i is a root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is a sequence length of the ZC sequence, l i is an index of a cyclic shift of the auxiliary sequence, and l i is an integer, Δ F is the maximum Doppler shift, for the element of the base sequence with index n, for an element of the auxiliary sequence with index n, 0≤n≤N-1 and n being an integer, c i is a cyclic shift of the base sequence and c i = k i Δ T , d i is a cyclic shift of the auxiliary sequence and d i = l i gΔ F , g being the smallest positive integer satisfying (gu i ) mod N = 1, is the trace function of the finite field, and a is a primitive element of the finite field, is rounded down.

30. The method of claim 28, wherein, an element of the first random access sequence with index n satisfies the following relationship: wherein i is the serial number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, N is a sequence length of the first random access sequence, u i is a root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is a sequence length of the ZC sequence, θ i is the phase offset and θ i = p i Δ F , p i is an index of the phase offset, and p i is an integer, Δ F is the maximum Doppler shift, for the element of the base sequence with index n, for an element of the auxiliary sequence with index n, 0≤n≤N-1 and n being an integer, c i is a cyclic shift of the base sequence and c i = k i Δ T , Tr(·) is the trace function of the finite field, α is a primitive element of the finite field, is rounded down.

31. The method of any one of claims 28-30, wherein, The random access sequence resource pool in which the first random access sequence is located further comprises a second random access sequence, a plurality of random access sequences in the random access sequence resource pool having the same length; In a case where a root index of an auxiliary sequence corresponding to the first random access sequence is same as a root index of an auxiliary sequence corresponding to the second random access sequence, a maximum value of a mutual ambiguity function of the first random access sequence and the second random access sequence is less than or equal to N is a sequence length of the first random access sequence; In a case where the root index of the auxiliary sequence corresponding to the first random access sequence is not the same as the root index of the auxiliary sequence corresponding to the second random access sequence, the maximum value of the mutual confusion function of the first random access sequence and the second random access sequence is less than or approximately equal to 32. The method of any one of claims 20-27, wherein, In a case where the sequence length of the m sequence and the sequence length of the ZC sequence are not equal, the sequence length of the first random access sequence is 2 r -1 and one in the union of prime numbers, r being a positive integer.

33. The method of claim 32, wherein, In a case where the sequence length of the m sequence is less than the sequence length of the ZC sequence, the auxiliary sequence is the ZC sequence; The base sequence is generated according to an m sequence, and includes: The base sequence is obtained by performing an N-point inverse discrete Fourier transform (IDFT) on a first transform sequence, the first transform sequence being obtained by appending N-N m zeroes to a second transform sequence, the second transform sequence being obtained by performing an N m point discrete Fourier transform (DFT) on the m-sequence, N m being a sequence length of the m-sequence, and N being a sequence length of the first random access sequence.

34. The method of claim 33, wherein, an element of the first random access sequence with index n satisfies the following relationship: wherein i is the serial number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, u i is a root index of the secondary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is a sequence length of the ZC sequence, l i is an index of the cyclic shift of the secondary sequence, and l i is an integer, Δ F is the maximum Doppler shift, 0≤n≤N-1 and n is an integer, c i is a cyclic shift of the base sequence and c i = k i Δ T , for the element of the base sequence with index n, for an element of the m-sequence with index t, 0≤t≤N m -1 and t is an integer, for an element of the auxiliary sequence with index n, d i is a cyclic shift of the auxiliary sequence and d i = l i gΔ F , g is the smallest positive integer satisfying (gu i ) mod N = 1, Tr(·) is the trace function of the finite field, a is a primitive element of the finite field, is rounded down.

35. The method of claim 33, wherein, an element of the first random access sequence with index n satisfies the following relationship: wherein i is the serial number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, u i is a root index of the secondary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is a sequence length of the ZC sequence, θ i is the phase offset and θ i = p i Δ F , p i is an index of the phase offset, and p i is an integer, Δ F is the maximum Doppler shift, 0≤n≤N-1 and n is an integer, for the element of the base sequence with index n, for an element of the m-sequence with index t, 0≤t≤N m -1 and t is an integer, for an element of the auxiliary sequence with index n, c i is a cyclic shift of the base sequence and c i = k i Δ T , Tr(·) is the trace function of the finite field, a is a primitive element of the finite field, is rounded down.

36. The method of claim 32, wherein, In a case where the sequence length of the m sequence is greater than the sequence length of the ZC sequence, the base sequence is the m sequence; The auxiliary sequence is generated according to the ZC sequence, and includes: The auxiliary sequence is obtained by N-point IDFT on a third transform sequence, the third transform sequence is obtained by appending N-N ZC zeroes to a fourth transform sequence, the fourth transform sequence is obtained by N ZC point DFT on the ZC sequence, N ZC is a sequence length of the ZC sequence, and N is a sequence length of the first random access sequence.

37. The method of claim 36, wherein, An element of the random access sequence with index n satisfies the following relation: wherein i is the serial number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, u i is a root index of the secondary sequence, 0≤u i ≤N ZC -1 and u i is an integer, θ i is the phase offset and θ i = p i Δ F , p i is an index of the phase offset, and p i is an integer, Δ F is the maximum Doppler shift, 0≤n≤N-1 and n is an integer, for the element of the base sequence with index n, for an element of the auxiliary sequence with index n, for an element of the ZC sequence with index t, 0≤t≤N ZC -1 and t is an integer, c i is a cyclic shift of the base sequence and c i = k i Δ T , Tr(·) is the trace function of the finite field, and a is a primitive element of the finite field, is rounded down.

38. The method of any one of claims 20-37, wherein, The low ambiguity region area of the first random access sequence is greater than the sequence length of the first random access sequence.

39. A communications device, characterized by includes: a processing module and a communication module; wherein The communication module is configured to receive a system message, the system message including information indicating a maximum round trip delay and information indicating a maximum Doppler shift; The processing module is configured to obtain a first random access sequence, the first random access sequence being generated according to a base sequence and an auxiliary sequence with the same length, the base sequence being generated according to an m sequence, the auxiliary sequence being generated according to a ZC sequence, a cyclic shift of the base sequence being related to the maximum round trip delay and a length of the first random access sequence, a cyclic shift of the auxiliary sequence being related to the maximum Doppler shift and the length of the first random access sequence, or a phase offset of the auxiliary sequence being related to the maximum Doppler shift and the length of the first random access sequence, the length of the first random access sequence being a sequence length of the base sequence or the auxiliary sequence; The communication module is configured to send a random access signal according to the first random access sequence.

40. The device of claim 39, wherein, A minimum interval of the cyclic shift of the base sequence is the maximum round trip delay.

41. The device of claim 40, wherein, cyclic shifts c of the base sequence i satisfies the following relation: c i = k i Δ T ; wherein k i is an index of a cyclic shift of the base sequence, and k i is an integer, to round down, Δ T is the maximum round trip latency, N is the sequence length of the first random access sequence, and i is the sequence number of the first random access sequence in the random access sequence resource pool.

42. The device of any one of claims 39-41, wherein, A minimum interval of cyclic shifts of the auxiliary sequence is g times the maximum Doppler shift, g being a minimum positive integer satisfying (gu i ) mod N = 1, u i being a root index of the auxiliary sequence, 0 ≤ u i ≤ N ZC - 1 and u i being an integer, N ZC being a sequence length of the ZC sequence, N being a sequence length of the first random access sequence, and i being a sequence number of the first random access sequence in a random access sequence resource pool.

43. The device of claim 42, wherein, The cyclic shift d of the helper sequence i satisfies the following relation: d i = l i gΔ F ; wherein l i is an index of a cyclic shift of the secondary sequence, and l i is an integer, to round down, Δ F is the maximum Doppler shift.

44. The device of any one of claims 39-43, wherein, A minimum interval of the phase offset is the maximum Doppler shift.

45. The device of claim 44, wherein, The phase shift θ i satisfies the following relationship: θ i = p i Δ F ; wherein p i is an index of the phase offset, and p i is an integer, to round down, Δ F is the maximum Doppler shift, N is the sequence length of the first random access sequence, and i is the sequence number of the first random access sequence in the random access sequence resource pool.

46. The device of any one of claims 39-45, wherein, The first random access sequence is one of one of N sequences, where N is a sequence length of the first random access sequence, N ZC is a sequence length of the ZC sequence, Δ T is the maximum round trip delay, Δ F is the maximum Doppler shift.

47. The device of any one of claims 39-46, wherein, In a case where the sequence length of the m sequence and the sequence length of the ZC sequence are equal, the base sequence is the m sequence, the auxiliary sequence is the ZC sequence, and the sequence length of the first random access sequence is 2 r -1 and is a prime number, and r is a positive integer.

48. The device of claim 47, wherein, an element of the first random access sequence with index n satisfies the following relationship: wherein i is the serial number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, N is a sequence length of the first random access sequence, u i is a root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is a sequence length of the ZC sequence, l i is an index of a cyclic shift of the auxiliary sequence, and l i is an integer, Δ F is the maximum Doppler shift, for the element of the base sequence with index n, for an element of the auxiliary sequence with index n, 0≤n≤N-1 and n being an integer, c i is a cyclic shift of the base sequence and c i = k i Δ T , d i is a cyclic shift of the auxiliary sequence and d i = l i gΔ F , g being the smallest positive integer satisfying (gu i ) mod N = 1, is the trace function for the finite field, and a is a primitive element of the finite field, is rounded down.

49. The device of claim 47, wherein, an element of the first random access sequence with index n satisfies the following relationship: wherein i is the serial number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, N is a sequence length of the first random access sequence, u i is a root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is a sequence length of the ZC sequence, θ i is the phase offset and θ i = p i Δ F , p i is an index of the phase offset, and p i is an integer, Δ F is the maximum Doppler shift, for the element of the base sequence with index n, for an element of the auxiliary sequence with index n, 0≤n≤N-1 and n being an integer, c i is a cyclic shift of the base sequence and c i = k i Δ T , Tr(·) is the trace function of the finite field, α is a primitive element of the finite field, is rounded down.

50. The device of any one of claims 47-49, wherein, The first random access sequence is in a random access sequence resource pool, and the random access sequence resource pool further includes a second random access sequence, a plurality of random access sequences in the random access sequence resource pool having the same length; In a case where a root index of an auxiliary sequence corresponding to the first random access sequence is same as a root index of an auxiliary sequence corresponding to the second random access sequence, a maximum value of a mutual ambiguity function of the first random access sequence and the second random access sequence is less than or equal to N is a sequence length of the first random access sequence; In a case where the root index of the auxiliary sequence corresponding to the first random access sequence is not the same as the root index of the auxiliary sequence corresponding to the second random access sequence, the maximum value of the mutual confusion function of the first random access sequence and the second random access sequence is less than or approximately equal to 51. The device of any one of claims 39-46, wherein, In a case where the sequence length of the m sequence and the sequence length of the ZC sequence are not equal, the sequence length of the first random access sequence is 2 r -1 and one in the union of prime numbers, r being a positive integer.

52. The device of claim 51, wherein, In a case where the sequence length of the m sequence is less than the sequence length of the ZC sequence, the auxiliary sequence is the ZC sequence; The base sequence is generated according to an m sequence, and includes: The base sequence is obtained by performing an N-point inverse discrete Fourier transform (IDFT) on a first transform sequence, the first transform sequence being obtained by appending N-N m zeroes to a second transform sequence, the second transform sequence being obtained by performing an N m point discrete Fourier transform (DFT) on the m-sequence, N m being a sequence length of the m-sequence, and N being a sequence length of the first random access sequence.

53. The device of claim 52, wherein, an element of the first random access sequence with index n satisfies the following relationship: wherein i is the serial number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, u i is a root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is a sequence length of the ZC sequence, l i is an index of the cyclic shift of the auxiliary sequence, and l i is an integer, Δ F is the maximum Doppler shift, 0≤n≤N-1 and n is an integer, c i is a cyclic shift of the base sequence and c i = k i Δ T , for the element of the base sequence with index n, for an element of the m-sequence with index t, 0≤t≤N m -1 and t is an integer, for an element of the auxiliary sequence with index n, d i is a cyclic shift of the auxiliary sequence and d i = l i gΔ F , g is the smallest positive integer satisfying (gu i ) mod N = 1, Tr(·) is the trace function of the finite field, and a is a primitive element of the finite field, is rounded down.

54. The device of claim 52, wherein, an element of the first random access sequence with index n satisfies the following relationship: wherein i is the serial number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, u i is a root index of the secondary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is a sequence length of the ZC sequence, θ i is the phase offset and θ i = p i Δ F , p i is an index of the phase offset, and p i is an integer, Δ F is the maximum Doppler shift, 0≤n≤N-1 and n is an integer, for the element of the base sequence with index n, for an element of the m-sequence with index t, 0≤t≤N m -1 and t is an integer, for an element of the auxiliary sequence with index n, c i is a cyclic shift of the base sequence and c i = k i Δ T , Tr(·) is the trace function of the finite field, a is a primitive element of the finite field, is rounded down.

55. The device of claim 51, wherein, In a case where the sequence length of the m sequence is greater than the sequence length of the ZC sequence, the base sequence is the m sequence; The auxiliary sequence is generated according to the ZC sequence, and includes: The auxiliary sequence is obtained by N-point IDFT on a third transform sequence, the third transform sequence is obtained by appending N-N ZC zeroes to a fourth transform sequence, the fourth transform sequence is obtained by N ZC point DFT on the ZC sequence, N ZC is a sequence length of the ZC sequence, and N is a sequence length of the first random access sequence.

56. The device of claim 55, wherein, An element of the random access sequence with index n satisfies the following relation: wherein i is the serial number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, u i is a root index of the secondary sequence, 0≤u i ≤N ZC -1 and u i is an integer, θ i is the phase offset and θ i = p i Δ F , p i is an index of the phase offset, and p i is an integer, Δ F is the maximum Doppler shift, 0≤n≤N-1 and n is an integer, for the element of the base sequence with index n, for an element of the auxiliary sequence with index n, for an element of the ZC sequence with index t, 0≤t≤N ZC -1 and t is an integer, c i is a cyclic shift of the base sequence and c i = k i Δ T , Tr(·) is the trace function of the finite field, a is a primitive element of the finite field, is rounded down.

57. The device of any one of claims 39-56, wherein, The low ambiguity region area of the first random access sequence is greater than the sequence length of the first random access sequence.

58. A communications device, characterized by includes: a processing module and a communication module; wherein The processing module is configured to control the communication module to send a system message, the system message including information indicating a maximum round trip delay and information indicating a maximum Doppler shift; The processing module is further configured to control the communication module to receive a random access signal, the random access signal corresponding to a first random access sequence, the first random access sequence being generated according to a base sequence and an auxiliary sequence with the same length, the base sequence being generated according to an m-sequence, the auxiliary sequence being generated according to a ZC sequence, a cyclic shift of the base sequence being related to a maximum round trip delay and a length of the first random access sequence, a cyclic shift of the auxiliary sequence being related to a maximum Doppler shift and the length of the first random access sequence, or a phase offset of the auxiliary sequence being related to the maximum Doppler shift and the length of the first random access sequence, the length of the first random access sequence being a sequence length of the base sequence or the auxiliary sequence.

59. The device of claim 58, wherein, A minimum interval of the cyclic shift of the base sequence is the maximum round trip delay.

60. The device of claim 59, wherein, cyclic shifts c of the base sequence i satisfies the following relation: c i = k i Δ T ; wherein k i is an index of a cyclic shift of the base sequence, and k i is an integer, to round down, Δ T is the maximum round trip latency, N is the sequence length of the first random access sequence, and i is the sequence number of the first random access sequence in the random access sequence resource pool.

61. The device of any one of claims 58-59, wherein, A minimum interval of cyclic shifts of the auxiliary sequence is g times the maximum Doppler shift, g being a minimum positive integer satisfying (gu i ) mod N = 1, u i being a root index of the auxiliary sequence, 0 ≤ u i ≤ N ZC -1 and u i being an integer, N ZC being a sequence length of the ZC sequence, N being a sequence length of the first random access sequence, and i being a sequence number of the first random access sequence in a random access sequence resource pool.

62. The device of claim 61, wherein, The cyclic shift d of the helper sequence i satisfies the following relation: d i = l i gΔ F ; wherein l i is an index of a cyclic shift of the secondary sequence, and l i is an integer, to round down, Δ F is the maximum Doppler shift.

63. The device of any one of claims 58-62, wherein, A minimum interval of the phase offset is the maximum Doppler shift.

64. The device of claim 63, wherein, The phase shift θ i satisfies the following relationship: θ i = p i Δ F ; wherein p i is an index of the phase offset, and p i is an integer, to round down, Δ F is the maximum Doppler shift, N is the sequence length of the first random access sequence, and i is the sequence number of the first random access sequence in the random access sequence resource pool.

65. The device of any one of claims 58-64, wherein, The first random access sequence is one of N sequences one of N sequences, where N is a sequence length of the first random access sequence, N ZC is a sequence length of the ZC sequence, Δ T is the maximum round trip delay, Δ F is the maximum Doppler shift.

66. The device of any one of claims 58-65, wherein, In a case where the sequence length of the m sequence and the sequence length of the ZC sequence are equal, the base sequence is the m sequence, the auxiliary sequence is the ZC sequence, and the sequence length of the first random access sequence is 2 r -1 and is a prime number, and r is a positive integer.

67. The device of claim 66, wherein, an element of the first random access sequence with index n satisfies the following relationship: wherein i is the serial number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, N is a sequence length of the first random access sequence, u i is a root index of the auxiliary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is a sequence length of the ZC sequence, l i is an index of a cyclic shift of the auxiliary sequence, and l i is an integer, Δ F is the maximum Doppler shift, for the element of the base sequence with index n, for an element of the auxiliary sequence with index n, 0≤n≤N-1 and n being an integer, c i is a cyclic shift of the base sequence and c i = k i Δ T , d i is a cyclic shift of the auxiliary sequence and d i = l i gΔ F , g being the smallest positive integer satisfying (gu i ) mod N = 1, is the trace function of the finite field, and a is a primitive element of the finite field, is rounded down.

68. The device of claim 66, wherein, an element of the first random access sequence with index n satisfies the following relationship: wherein i is the serial number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, N is a sequence length of the first random access sequence, u i is a root index of the secondary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is a sequence length of the ZC sequence, θ i is the phase offset and θ i = p i Δ F , p i is an index of the phase offset, and p i is an integer, Δ F is the maximum Doppler shift, for the element of the base sequence with index n, for an element of the auxiliary sequence with index n, 0≤n≤N-1 and n being an integer, c i is a cyclic shift of the base sequence and c i = k i Δ T , Tr(·) is the trace function of the finite field, a is a primitive element of the finite field, is rounded down.

69. The device of any one of claims 66-68, wherein, The first random access sequence is in a random access sequence resource pool, and the random access sequence resource pool further includes a second random access sequence, a plurality of random access sequences in the random access sequence resource pool having the same length; In a case where a root index of an auxiliary sequence corresponding to the first random access sequence is same as a root index of an auxiliary sequence corresponding to the second random access sequence, a maximum value of a mutual ambiguity function of the first random access sequence and the second random access sequence is less than or equal to N is a sequence length of the first random access sequence; In a case where the root index of the auxiliary sequence corresponding to the first random access sequence is not the same as the root index of the auxiliary sequence corresponding to the second random access sequence, the maximum value of the mutual confusion function of the first random access sequence and the second random access sequence is less than or approximately equal to 70. The device of any one of claims 58-65, wherein, In a case where the sequence length of the m sequence and the sequence length of the ZC sequence are not equal, the sequence length of the first random access sequence is 2 r -1 and one in the union of prime numbers, r being a positive integer.

71. The device of claim 70, wherein, In a case where the sequence length of the m-sequence is less than the sequence length of the ZC sequence, the auxiliary sequence is the ZC sequence. The base sequence is generated according to an m-sequence, including: The base sequence is obtained by performing an N-point inverse discrete Fourier transform (IDFT) on a first transform sequence, which is obtained by appending N-N m zeroes to a second transform sequence, which is obtained by performing an N m point discrete Fourier transform (DFT) on the m-sequence, N m being a sequence length of the m-sequence, and N being a sequence length of the first random access sequence.

72. The device of claim 71, wherein, An element of the first random access sequence with index n satisfies the following relationship: wherein i is the serial number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, u i is a root index of the secondary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is a sequence length of the ZC sequence, l i is an index of the cyclic shift of the secondary sequence, and l i is an integer, Δ F is the maximum Doppler shift, 0≤n≤N-1 and n is an integer, c i is a cyclic shift of the base sequence and c i = k i Δ T , for the element of the base sequence with index n, for an element of the m-sequence with index t, 0≤t≤N m -1 and t is an integer, for an element of the auxiliary sequence with index n, d i is a cyclic shift of the auxiliary sequence and d i = l i gΔ F , g is the smallest positive integer satisfying (gu i ) mod N = 1, Tr(·) is the trace function of the finite field, and a is a primitive element of the finite field, is rounded down.

73. The device of claim 71, wherein, an element of the first random access sequence with index n satisfies the following relationship: wherein i is the serial number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, u i is a root index of the secondary sequence, 0≤u i ≤N ZC -1 and u i is an integer, N ZC is a sequence length of the ZC sequence, θ i is the phase offset and θ i = p i Δ F , p i is an index of the phase offset, and p i is an integer, Δ F is the maximum Doppler shift, 0≤n≤N-1 and n is an integer, for the element of the base sequence with index n, for an element of the m-sequence with index t, 0≤t≤N m -1 and t is an integer, for an element of the auxiliary sequence with index n, c i is a cyclic shift of the base sequence and c i = k i Δ T , Tr(·) is the trace function of the finite field, a is a primitive element of the finite field, is rounded down.

74. The device of claim 70, wherein, In a case where the sequence length of the m-sequence is greater than the sequence length of the ZC sequence, the base sequence is the m-sequence; The auxiliary sequence is generated according to the ZC sequence, including: The auxiliary sequence is obtained by N-point IDFT on a third transform sequence, the third transform sequence is obtained by appending N-N ZC zeroes to a fourth transform sequence, the fourth transform sequence is obtained by N ZC point DFT on the ZC sequence, N ZC is a sequence length of the ZC sequence, and N is a sequence length of the first random access sequence.

75. The device of claim 74, wherein, An element of the random access sequence with index n satisfies the following relation: wherein i is the serial number of the first random access sequence in the random access sequence resource pool, k i is the index of the cyclic shift of the base sequence, and k i is an integer, Δ T is the maximum round trip delay, u i is a root index of the secondary sequence, 0≤u i ≤N ZC -1 and u i is an integer, θ i is the phase offset and θ i = p i Δ F , p i is an index of the phase offset, and p i is an integer, Δ F is the maximum Doppler shift, 0≤n≤N-1 and n is an integer, for the element of the base sequence with index n, for the element of the auxiliary sequence with index n, for an element of the ZC sequence with index t, 0≤t≤N ZC -1 and t is an integer, c i is a cyclic shift of the base sequence and c i = k i Δ T , Tr(·) is the trace function of the finite field, α is a primitive element of the finite field, is rounded down.

76. The device of any one of claims 58-75, wherein, A low ambiguity region area of the first random access sequence is greater than the sequence length of the first random access sequence.

77. A communications device, characterized by The apparatus includes a module for performing the method of any one of claims 1-38.

78. A communications device, characterized by The apparatus includes: a processor; The processor is configured to run a computer program or instructions to cause the method of any one of claims 1-38 to be implemented.

79. A computer-readable storage medium, characterized in that, The computer readable storage medium stores a computer program or instructions, which, when executed by a communication device, implement the method of any one of claims 1-38.

80. A computer program product, characterised in that, The computer program code, when executed on a communication device, causes the communication device to implement the method of any one of claims 1-38.

Images