Communication method and communication apparatus

Abstract

Disclosed in the present application are a communication method and a communication apparatus. The method is applied to random access scenarios, and the method comprises: a first communication apparatus generating a random access signal, the random access signal being obtained on the basis of a first sequence; and sending the random access signal, wherein the first sequence is a sequence in a preamble sequence set, the preamble sequence set at least comprises some or all of cyclic shift versions (including a second sequence) of the second sequence, the second sequence is obtained on the basis of a primitive polynomial and / or an initial value corresponding to a first index in a first table, and the first index is an index in a first column of the first table. The number of preamble sequences in the preamble sequence set used by the first communication apparatus is greater than 64, for example, 128 or 256, and compared with preamble sequence sets that support only 64 preamble sequences at most in the prior art, the present application can support larger-scale multi-user access.

Description

Communication methods and communication devices

[0001] This application claims priority to Chinese Patent Application No. 202510499220.1, filed with the State Intellectual Property Office of China on April 18, 2025, entitled "Communication Method and Communication Device", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of communications, and more particularly to communication methods and communication devices. Background Technology

[0003] Random access is the process by which user equipment (UE) establishes a connection and achieves uplink synchronization with a cell (or network). After random access is completed, communication can occur between the base station and the UE. The purpose of random access is to establish uplink synchronization between the UE and the cell and to request dedicated resources from the cell for the UE to perform service transmission.

[0004] Compared to 4G and 5G, the increase in connection density of next-generation wireless communication systems will be very significant. As an extension of massive machine-type communications (mMTC), massive communication, as outlined in International Mobile Telecommunications-2030 (IMT-2030), presents new demands on network capabilities.

[0005] Because the connection density of next-generation wireless communication systems will increase significantly, the number of users initiating random access on the same time-frequency resources within the same cell will also increase dramatically. Therefore, it is necessary to study high-capacity random access schemes to support larger-scale multi-user access. Summary of the Invention

[0006] This application discloses a communication method and a communication device, providing a random access scheme that supports a larger scale of multi-user access.

[0007] In a first aspect, embodiments of this application provide a communication method applied to a first communication device. The method is implemented by the first communication device or a component on the first communication device side (e.g., a chip, processing system, or functional module in the first communication device). The following description uses an implementation by a first communication device as an example. The method includes: the first communication device generating a random access signal, the random access signal being obtained based on a first sequence; and transmitting the random access signal; wherein the first sequence is obtained based on a second sequence and a first cyclic shift value, the second sequence being obtained based on the primitive polynomial and / or initial value corresponding to a first index in a first table, the first index being an index in the first column of the first table; the first cyclic shift value being an integer greater than or equal to 0, and the first table including some or all rows from at least two columns of a second table, the at least two columns including the first column and the third column of the second table:

[0008] The aforementioned at least two columns can be the first and third columns of the second table, or all columns of the second table, i.e., the first, second, and third columns. In this application, [3,1,0,0,2,0,0] represents the primitive polynomial f(x) = x. 7 +2x 4 +x+3, the primitive polynomial represented by [3,0,2,0,3,0,0] is f(x)=x 7 +3x 4 +2x 2 +3. The primitive polynomial and / or initial value corresponding to the first index in the first table is the primitive polynomial and / or initial value contained in the row where the first index is located in the first table. The first sequence is a sequence in the preamble sequence set. The first sequence is a preamble sequence. The preamble sequence is also called a preamble code sequence. The preamble sequence set includes at least some or all cyclically shifted versions of the second sequence (including the second sequence). Taking the sequence [a,b,c,d] as an example, all cyclically shifted versions of the sequence [a,b,c,d] are [a,b,c,d], [b,c,d,a], [c,d,a,b], [d,a,b,c]. In this application, a cyclically shifted version of a sequence refers to the sequence obtained after cyclically shifting the sequence, or in other words, a cyclically shifted version of a sequence refers to the sequence obtained after cyclically shifting the sequence. All cyclically shifted versions of a sequence are all sequences obtained after cyclically shifting the sequence.

[0009] Optionally, the set of leading sequences may also include partially or fully cyclically shifted versions of sequences obtained from primitive polynomials and / or initial values ​​corresponding to other indices in the first table. The number of leading sequences in the set may be greater than 64, for example, 128, 256, etc. The length of the first sequence is 127.

[0010] Using the first aspect of the method, the first communication device transmits a random access signal based on a first sequence. The first sequence is a preamble sequence. The first sequence is randomly selected by the first communication device from a set of preamble sequences. The number of preamble sequences in the set of preamble sequences used by the first communication device can be greater than 64, for example, 128, 256, etc. Compared with the preamble sequence set that only supports a maximum of 64 preamble sequences in the prior art, it can support a larger scale of multi-user access, that is, realize high-capacity access.

[0011] In one possible design of the first aspect, the method further includes: a first communication device receiving a first index.

[0012] In one possible design of the first aspect, the method further includes: a first communication device receiving a second index, the first index being determined by the second index, the initial value corresponding to the first index being different from the initial value corresponding to the second index, or the primitive polynomial corresponding to the first index being different from the primitive polynomial corresponding to the second index.

[0013] Secondly, embodiments of this application provide another communication method applied to a second communication device. This method is implemented by the second communication device or components on the second communication device side (e.g., chips, processing systems, or functional modules in the second communication device). The following description uses an implementation by a second communication device as an example. The method includes: the second communication device receiving a random access signal, the random access signal being obtained based on a first sequence; determining the first sequence based on the received random access signal; wherein the first sequence is obtained based on a second sequence and a first cyclic shift value, the second sequence being obtained based on the primitive polynomial and / or initial value corresponding to a first index in a first table, the first index being an index in the first column of the first table; the first cyclic shift value being an integer greater than or equal to 0, the first table including some or all rows from at least two columns of the aforementioned second table (i.e., the second table of the first aspect), the at least two columns including the first column and the third column of the second table. The primitive polynomial and / or initial value corresponding to the first index in the first table is the primitive polynomial and / or initial value contained in the row where the first index is located in the first table. The first sequence is a sequence in a set of preceding sequences. The set of preceding sequences includes at least some or all cyclic shift versions of the second sequence (including the second sequence).

[0014] Optionally, the set of leading sequences may also include some or all cyclically shifted versions of sequences obtained from primitive polynomials and / or initial values ​​corresponding to other indices in the first table. The number of leading sequences in the set of leading sequences is greater than 64, for example, 128, 256, etc.

[0015] Using the second method, the first communication device determines a first sequence based on the received random access signal. The first sequence is a preamble sequence. The first sequence is one of the sequences in the preamble sequence set. Since the number of preamble sequences in this preamble sequence set can be greater than 64, for example, 128, 256, etc., compared with the existing technology which only supports a maximum of 64 preamble sequences in the preamble sequence set, it can support a larger scale of multi-user access, that is, realize high-capacity access.

[0016] In one possible design of the second aspect, the method further includes: the second communication device sending the first index.

[0017] In one possible design of the second aspect, the method further includes: a second communication device sending a second index, the second index being used to determine a first index, wherein the initial value corresponding to the first index is different from the initial value corresponding to the second index, or the primitive polynomial corresponding to the first index is different from the primitive polynomial corresponding to the second index.

[0018] In one possible design of the first or second aspect, the first table includes some or all rows of the second table, and the second sequence is obtained according to the primitive polynomial and initial value corresponding to the first index in the first table. The first sequence is a sequence in a leading sequence set, which includes some or all cyclically shifted versions of the second sequence (including the second sequence) and some or all cyclically shifted versions of the sequence obtained according to the primitive polynomial and initial value corresponding to the second index; this allows for high-capacity access. For example, the first table is rows 1 to 129 of the second table. Another example is that the first table includes row 1 and rows 130 to 257 of the second table. Yet another example is that the first table is the second table. Yet another example is that the first table includes rows 1 to 5 and rows 10 to 20 of the second table.

[0019] In one possible design of the first or second aspect, the first table includes some or all rows from the first and third columns of the second table, the second sequence is obtained according to the initial value corresponding to the first index in the first table and the primitive polynomial specified by the protocol, the first sequence is a sequence in the preamble sequence set, the preamble sequence set includes some or all cyclically shifted versions of the second sequence (including the second sequence) and some or all cyclically shifted versions of the sequence obtained according to the initial value corresponding to the second index and the primitive polynomial specified by the protocol; large-capacity access can be achieved.

[0020] In one possible design of either the first or second aspect, the second sequence is a quaternion sequence, the first index is (p, i), p indicates the primitive polynomial corresponding to the first index, i indicates the initial value corresponding to the first index, and the primitive polynomial corresponding to the first index, the initial value corresponding to the first index, and the second sequence satisfy the following formula:

[0021] Among them, s p,i (n) represents the nth element in the second sequence, where L is an integer greater than 1, and c p,k This represents the coefficient of the term with power k in the primitive polynomial corresponding to the first index; the initial value v corresponding to the first index. p,i Satisfy the following formula:

[0022] The initial value corresponding to the first index is a decimal number. The initial value v corresponding to the first index p,i The formula satisfies the conversion from decimal to quaternary.

[0023] Thirdly, embodiments of this application provide another communication method, which is applied to a first communication device. This method is implemented by the first communication device or a component on the first communication device side (e.g., a chip, processing system, or functional module in the first communication device). The following description uses an implementation by the first communication device as an example. The method includes: the first communication device generating a random access signal, the random access signal being obtained based on a first sequence; and transmitting the random access signal; wherein the first sequence is obtained based on a second sequence and a first cyclic shift value, the second sequence being obtained based on the primitive polynomial and / or initial value corresponding to a first index in a first table, the first index being an index in the first column of the first table; the first cyclic shift value being an integer greater than or equal to 0, and the first table including some or all rows of the following second table:

[0024] The primitive polynomial and / or initial value corresponding to the first index in the first table is the primitive polynomial and / or initial value contained in the row containing the first index in the first table. The first sequence is a sequence in the set of leading sequences. The set of leading sequences includes at least some or all of the cyclically shifted versions of the second sequence (including the second sequence).

[0025] Optionally, the set of leading sequences may also include some or all cyclically shifted versions of sequences obtained from primitive polynomials and / or initial values ​​corresponding to other indices in the first table. The number of leading sequences in the set of leading sequences is greater than 64, for example, 128, 256, etc.

[0026] Using the third method, the first communication device transmits a random access signal based on a first sequence. The first sequence is a preamble sequence. The first sequence is randomly selected by the first communication device from a set of preamble sequences. The number of preamble sequences in the set used by the first communication device can be greater than 64, for example, 128, 256, etc. Compared with the existing technology that only supports a maximum of 64 preamble sequences, it can support a larger scale of multi-user access, that is, achieve high-capacity access.

[0027] For possible implementations of the communication device in the third aspect, please refer to the various possible implementations in the first aspect.

[0028] For the technical effects of the various possible implementations of the third aspect, please refer to the introduction of the technical effects of the various possible implementations of the first aspect.

[0029] Fourthly, embodiments of this application provide another communication method applied to a second communication device. This method is implemented by the second communication device or components on the second communication device side (e.g., chips, processing systems, or functional modules within the second communication device). The following description uses an implementation by a second communication device as an example. The method includes: the second communication device receiving a random access signal, the random access signal being obtained based on a first sequence; determining the first sequence based on the received random access signal; wherein the first sequence is obtained based on a second sequence and a first cyclic shift value, the second sequence being obtained based on the primitive polynomial and / or initial value corresponding to a first index in a first table, the first index being an index in the first column of the first table; the first cyclic shift value being an integer greater than or equal to 0, and the first table including some or all rows of the second table described in the third aspect. The primitive polynomial and / or initial value corresponding to the first index in the first table is the primitive polynomial and / or initial value contained in the row where the first index is located in the first table. The first sequence is a sequence in a set of preceding sequences. The set of preceding sequences includes at least some or all cyclic shift versions of the second sequence (including the second sequence). Optionally, the set of leading sequences may also include some or all cyclically shifted versions of sequences obtained from primitive polynomials and / or initial values ​​corresponding to other indices in the first table. The number of leading sequences in the set of leading sequences is greater than 64, for example, 128, 256, etc.

[0030] Using the fourth method, the first communication device determines a first sequence based on the received random access signal. The first sequence is a preamble sequence. The first sequence is one of the sequences in the preamble sequence set. Since the number of preamble sequences in this preamble sequence set can be greater than 64, for example, 128, 256, etc., compared with the existing technology which only supports a maximum of 64 preamble sequences, it can support a larger scale of multi-user access, that is, realize high-capacity access.

[0031] For possible implementations of the communication device in the fourth aspect, please refer to the various possible implementations in the second aspect.

[0032] For the technical effects of the various possible implementations of the fourth aspect, please refer to the introduction of the technical effects of the various possible implementations of the second aspect.

[0033] In one possible design of the third or fourth aspect, the second sequence is a quaternion sequence, and the primitive polynomial corresponding to the first index, the initial value corresponding to the first index, and the second sequence satisfy the following formula:

[0034] Among them, s p,i (n) represents the nth element in the second sequence, p indicates the primitive polynomial corresponding to the first index, i indicates the initial value corresponding to the first index, L is an integer greater than 1, and c p,k This represents the coefficient of the term with power k in the primitive polynomial corresponding to the first index; the initial value v corresponding to the first index. p,i Satisfy the following formula:

[0035] The initial value corresponding to the first index is a decimal number.

[0036] Fifthly, embodiments of this application provide another communication method, which is applied to a first communication device. The method is implemented by the first communication device or a component on the first communication device side (such as a chip, processing system, or functional module in the first communication device). The following description uses the implementation of the first communication device as an example. The method includes: a first communication device receiving first indication information, the first indication information indicating a first primitive polynomial; and sending a random access signal, the random access signal being obtained based on a third sequence, the third sequence being obtained based on a fourth sequence and a second cyclic shift value, the fourth sequence being obtained based on the first primitive polynomial and an initial value from a set of initial values, the second cyclic shift value being an integer greater than or equal to 0, and any two initial values ​​from the set of initial values ​​being a second initial value and a third initial value, the second initial value and the third initial value satisfying that: the intersection of the sequence obtained based on the first primitive polynomial and the second initial value with the set of all cyclic shift version sequences corresponding to the sequence obtained based on the first primitive polynomial and the third initial value is an empty set, or in other words, the intersection of the set of all cyclic shift version sequences corresponding to the sequence obtained based on the first primitive polynomial and the second initial value with the set of all cyclic shift version sequences corresponding to the sequence obtained based on the first primitive polynomial and the third initial value is an empty set. In this application, the set of all cyclic shift version sequences corresponding to a sequence is a set including the sequence and some or all of the cyclic shift versions of the sequence.

[0037] The third sequence is a preamble sequence. The third sequence is a sequence randomly selected by the first communication device from the preamble sequence set. Since the third sequence is obtained based on the fourth sequence and the second cyclic shift value, the preamble sequence set includes at least some or all cyclic shift versions of the fourth sequence (including the fourth sequence). Optionally, the preamble sequence set also includes some or all cyclic shift versions of sequences obtained based on the first primitive polynomial and other initial values ​​in the initial value set. Therefore, the number of preamble sequences in this preamble sequence set can be set according to actual needs, for example, 128, 256, etc.; compared to the existing technology that only supports a maximum of 64 preamble sequences, this can support a larger scale of multi-user access. The preamble sequences in the preamble sequence set used by the first communication device maintain low cross-correlation, ensuring low cross-correlation between preamble sequences used within the same cell.

[0038] In one possible design of the fifth aspect, the method further includes: the first communication device adding one or more fourth initial values ​​from a plurality of sequentially arranged initial values ​​to the set of initial values, wherein the fourth initial values ​​satisfy the following condition: the intersection of the sequence obtained based on the first primitive polynomial and the fourth initial value with the set of all cyclically shifted version sequences corresponding to the sequence obtained based on the first primitive polynomial and any initial value in the set of initial values ​​is an empty set; or, in other words, the intersection of the set of all cyclically shifted version sequences corresponding to the sequence obtained based on the first primitive polynomial and the fourth initial value with the set of all cyclically shifted version sequences corresponding to the sequence obtained based on any initial value in the set of initial values ​​is an empty set.

[0039] Sixthly, embodiments of this application provide another communication method applied to a second communication device. This method is implemented by the second communication device or components on the second communication device side (e.g., chips, processing systems, or functional modules within the second communication device). The following description uses an implementation by a second communication device as an example. The method includes: the second communication device sending first indication information, the first indication information indicating a first primitive polynomial; receiving a random access signal, the random access signal being obtained based on a third sequence, the third sequence being obtained based on a fourth sequence and a second cyclic shift value, the fourth sequence being obtained based on the first primitive polynomial and one initial value from the initial value set, the second cyclic shift value being an integer greater than or equal to 0, and any two values ​​in the initial value set being a second initial value and a third initial value, the second initial value and the third initial value satisfying that the intersection of the sequence obtained based on the first primitive polynomial and the second initial value with the set of all cyclic shift version sequences corresponding to the sequence obtained based on the first primitive polynomial and the third initial value is an empty set.

[0040] The third sequence is a preamble sequence. The third sequence is a sequence randomly selected by the first communication device from a set of preamble sequences. Since the third sequence is obtained based on the fourth sequence and the second cyclic shift value, the set of preamble sequences includes at least some or all cyclic shift versions of the fourth sequence (including the fourth sequence). Optionally, the set of preamble sequences also includes some or all cyclic shift versions of sequences obtained based on the first primitive polynomial and other initial values ​​in the initial value set. Therefore, the number of preamble sequences in this set can be set according to actual needs, for example, 128, 256, etc.; compared to the existing technology which only supports a maximum of 64 preamble sequences, this can support a larger scale of multi-user access. Optionally, maintaining low cross-correlation between any preamble sequences in the set used by the first communication device ensures low cross-correlation between preamble sequences used within the same cell.

[0041] In one possible design of the sixth aspect, the initial values ​​in the initial value set are one or more fourth initial values ​​among a plurality of ordered initial values, the fourth initial values ​​satisfying the following condition: the intersection of the sequence obtained based on the first primitive polynomial and the fourth initial value with the set of all cyclically shifted version sequences corresponding to the sequence obtained based on the first primitive polynomial and any initial value in the initial value set is an empty set.

[0042] In one possible design of the fifth or sixth aspect, the third sequence is one of a set of leading sequences, which includes some or all cyclically shifted versions of the second sequence. Optionally, the set of leading sequences also includes some or all cyclically shifted versions of a sequence obtained from the first primitive polynomial and other initial values ​​in the set of initial values.

[0043] In one possible design of the fifth or sixth aspect, the multiple initial values ​​arranged in sequence are either initial values ​​ordered from smallest to largest, or multiple initial values ​​arranged in sequence are initial values ​​ordered from largest to smallest.

[0044] In one possible design of the fifth or sixth aspect, the first indication information is also used to indicate the minimum and / or maximum initial value among a plurality of initial values; thereby reducing the time required to determine the set of initial values.

[0045] In one possible design of the fifth or sixth aspect, the fourth sequence is one of M sequences, which are obtained from the first primitive polynomial and the smallest or largest M initial values ​​in the initial value set, where M is an integer greater than 0; this enables high-capacity access. The aforementioned preamble sequence set includes the M sequences and some or all cyclically shifted versions of each of the M sequences.

[0046] In one possible design of the fifth or sixth aspect, the first indication information is a first index, which is an index in the first column of the first table, and the primitive polynomial corresponding to the first index in the first table is the first primitive polynomial. The first table includes some or all of the rows of the following second table:

[0047] In a seventh aspect, embodiments of this application provide a communication device that has the function of implementing the behavior described in the first aspect method embodiment. The communication device may be a communication equipment, a component of a communication equipment (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the communication equipment. The function of the communication device can be implemented by hardware or by hardware executing corresponding software, the hardware or software including one or more modules or units corresponding to the above functions. In one possible implementation, the communication device includes a transceiver module and a processing module, wherein: the processing module is used to generate a random access signal, the random access signal being obtained based on a first sequence; the transceiver module is used to transmit the random access signal; wherein the first sequence is obtained according to a second sequence and a first cyclic shift value, the second sequence being obtained according to the primitive polynomial and / or initial value corresponding to a first index in a first table, the first index being an index in the first column of the first table; the first cyclic shift value is an integer greater than or equal to 0, the first table including some or all rows in at least two columns of the second table in the first aspect, the at least two columns including the first column and the third column of the second table.

[0048] In one possible design of the seventh aspect, the transceiver module is also used to receive the first index.

[0049] In one possible design of the seventh aspect, the transceiver module is also used to receive a second index, the first index being determined by the second index, the initial value corresponding to the first index being different from the initial value corresponding to the second index, or the primitive polynomial corresponding to the first index being different from the primitive polynomial corresponding to the second index.

[0050] In one possible design of the seventh aspect, the first table includes some or all rows of the second table, and the second sequence is obtained according to the primitive polynomial and initial value corresponding to the first index in the first table; the processing module is specifically used to determine the primitive polynomial and initial value corresponding to the second index from the first table; determine a preamble sequence set according to the primitive polynomial and initial value corresponding to the second index, wherein the number of preamble sequences in the preamble sequence set is greater than 64; randomly select a sequence from the preamble sequence set to obtain the first sequence; and generate a random access signal based on the first sequence; wherein the preamble sequence set includes some or all cyclically shifted versions of the second sequence (including the second sequence) and some or all cyclically shifted versions of the sequence obtained according to the primitive polynomial and initial value corresponding to the second index.

[0051] In one possible design of the seventh aspect, the first table includes some or all rows of the first and second columns of the second table, and the second sequence is obtained according to the primitive polynomial corresponding to the first index in the first table and the initial value specified by the protocol; the processing module is specifically used to determine the primitive polynomial corresponding to the second index from the first table; determine a preamble sequence set according to the primitive polynomial corresponding to the second index and the initial value specified by the protocol, wherein the number of preamble sequences in the preamble sequence set is greater than 64; randomly select a sequence from the preamble sequence set to obtain the first sequence; and generate a random access signal based on the first sequence; wherein the preamble sequence set includes some or all cyclic shift versions of the second sequence (including the second sequence) and some or all cyclic shift versions of the sequence obtained according to the primitive polynomial corresponding to the second index and the initial value specified by the protocol.

[0052] In one possible design of the seventh aspect, the first table includes some or all rows of the first and second columns of the second table, and the second sequence is obtained according to the initial value corresponding to the first index in the first table and the primitive polynomial specified in the protocol; the processing module is specifically used to determine the initial value corresponding to the second index from the first table; determine a preamble sequence set according to the initial value corresponding to the second index and the primitive polynomial specified in the protocol, wherein the number of preamble sequences in the preamble sequence set is greater than 64; randomly select a sequence from the preamble sequence set to obtain the first sequence; and generate a random access signal based on the first sequence; wherein the preamble sequence set includes some or all cyclically shifted versions of the second sequence (including the second sequence) and some or all cyclically shifted versions of the sequence obtained according to the initial value corresponding to the second index and the primitive polynomial specified in the protocol.

[0053] For possible implementations of the communication device in the seventh aspect, please refer to the various possible implementations in the first aspect.

[0054] For the technical effects of the various possible implementations of the seventh aspect, please refer to the introduction of the technical effects of the various possible implementations of the first aspect.

[0055] Eighthly, embodiments of this application provide another communication device that has the function of implementing the behavior described in the second aspect of the method embodiments. This communication device may be a communication equipment, a component of a communication equipment (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the communication equipment. It may also be implemented by hardware executing corresponding software, the hardware or software including one or more modules or units corresponding to the above functions. In one possible implementation, the communication device includes a transceiver module and a processing module, wherein: the transceiver module is used to receive a random access signal, the random access signal being obtained based on a first sequence; the processing module is used to determine the first sequence based on the received random access signal; wherein the first sequence is obtained according to a second sequence and a first cyclic shift value, the second sequence being obtained according to the primitive polynomial and / or initial value corresponding to a first index in a first table, the first index being an index in the first column of the first table; the first cyclic shift value is an integer greater than or equal to 0, the first table including some or all rows of at least two columns of the second table (i.e., the second table of the first aspect), the at least two columns including the first column and the third column of the second table.

[0056] In one possible design of the eighth aspect, the transceiver module is also used to send the first index.

[0057] In one possible design of the eighth aspect, the transceiver module is also used to send a second index, which is used to determine the first index. The initial value corresponding to the first index is different from the initial value corresponding to the second index, or the primitive polynomial corresponding to the first index is different from the primitive polynomial corresponding to the second index.

[0058] For possible implementations of the communication device in the eighth aspect, please refer to the various possible implementations in the second aspect.

[0059] For the technical effects of the various possible implementations of the eighth aspect, please refer to the introduction of the technical effects of the various possible implementations of the second aspect.

[0060] In a ninth aspect, embodiments of this application provide another communication device that has the function of implementing the behavior described in the method embodiments of the third aspect. The communication device may be a communication equipment, a component of a communication equipment (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the communication equipment. The function of the communication device can be implemented by hardware or by hardware executing corresponding software, the hardware or software including one or more modules or units corresponding to the above functions. In one possible implementation, the communication device includes a transceiver module and a processing module, wherein: the processing module is used to generate a random access signal, the random access signal being obtained based on a first sequence; the transceiver module is used to transmit the random access signal; wherein the first sequence is obtained according to a second sequence and a first cyclic shift value, the second sequence being obtained according to the primitive polynomial and / or initial value corresponding to a first index in a first table, the first index being an index in the first column of the first table; the first cyclic shift value is an integer greater than or equal to 0, and the first table includes some or all rows of the second table. The second table in the ninth aspect is the same as the second table in the third aspect, and will not be described again here.

[0061] For possible implementations of the communication device in the ninth aspect, please refer to the various possible implementations in the third aspect.

[0062] For the technical effects of the various possible implementations of the ninth aspect, please refer to the introduction of the technical effects of the various possible implementations of the third aspect.

[0063] In a tenth aspect, embodiments of this application provide another communication device that has the function of implementing the behavior described in the fourth aspect of the method embodiments. This communication device may be a communication equipment, a component of a communication equipment (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the communication equipment. It may also be implemented by hardware executing corresponding software, the hardware or software including one or more modules or units corresponding to the above-described functions. In one possible implementation, the communication device includes a transceiver module and a processing module, wherein: the transceiver module is used to receive a random access signal, the random access signal being obtained based on a first sequence; the processing module is used to determine the first sequence based on the received random access signal; wherein the first sequence is obtained according to a second sequence and a first cyclic shift value, the second sequence being obtained according to the primitive polynomial and / or initial value corresponding to a first index in a first table, the first index being an index in the first column of the first table; the first cyclic shift value is an integer greater than or equal to 0, and the first table includes some or all rows of the second table described in the third aspect.

[0064] For possible implementations of the communication device in the tenth aspect, please refer to the various possible implementations in the fourth aspect.

[0065] For the technical effects of the various possible implementations of the tenth aspect, please refer to the introduction of the technical effects of the various possible implementations of the fourth aspect.

[0066] Eleventhly, embodiments of this application provide another communication device that has the function of implementing the behavior described in the fifth aspect of the method embodiments. This communication device may be a communication equipment, a component of a communication equipment (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the communication equipment. The functions of this communication device can be implemented by hardware or by hardware executing corresponding software, the hardware or software including one or more modules or units corresponding to the aforementioned functions. In one possible implementation, the communication device includes a transceiver module and a processing module, wherein: the transceiver module is used to receive first indication information, the first indication information being used to indicate a first primitive polynomial; the processing module is used to generate a random access signal; the transceiver module is also used to transmit the random access signal, the random access signal being obtained based on a third sequence, the third sequence being obtained based on a fourth sequence and a second cyclic shift value, the fourth sequence being obtained based on the first primitive polynomial and an initial value from a set of initial values, the second cyclic shift value being an integer greater than or equal to 0, and any two initial values ​​from the set of initial values ​​being a second initial value and a third initial value, the second initial value and the third initial value satisfying that: the intersection of the sequence obtained based on the first primitive polynomial and the second initial value with the set of all cyclic shift version sequences corresponding to the sequence obtained based on the first primitive polynomial and the third initial value is an empty set.

[0067] In one possible design of the eleventh aspect, the processing module is further configured to add one or more fourth initial values ​​from a plurality of sequentially arranged initial values ​​to the set of initial values, wherein the fourth initial value satisfies the following condition: the intersection of the sequence obtained based on the first primitive polynomial and the fourth initial value with the set of all cyclically shifted version sequences corresponding to the sequence obtained based on the first primitive polynomial and any initial value in the set of initial values ​​is an empty set; thereby the set of initial values ​​can be obtained.

[0068] In one possible design of the eleventh aspect, the fourth sequence is obtained based on the first primitive polynomial and the fifth initial value in the initial value set; the processing module is further configured to determine a preamble sequence set based on one or more initial values ​​in the first primitive polynomial and the initial value set; the preamble sequence set includes some or all cyclically shifted versions of the fourth sequence (including the fourth sequence), optionally, the preamble sequence set includes some or all cyclically shifted versions of the sequence obtained based on the sixth initial value in the first primitive polynomial and the initial value set, the sixth initial value being different from the fifth initial value; a sequence is randomly selected from the preamble sequence set to obtain a third sequence; the processing module is specifically configured to generate a random access signal based on the third sequence.

[0069] For possible implementations of the communication device in the eleventh aspect, please refer to the various possible implementations in the fifth aspect.

[0070] For the technical effects of the various possible implementations of the eleventh aspect, please refer to the introduction of the technical effects of the various possible implementations of the fifth aspect.

[0071] In a twelfth aspect, embodiments of this application provide another communication device that has the function of implementing the behavior described in the sixth aspect method embodiment. This communication device may be a communication equipment, a component of a communication equipment (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the communication equipment. It may also be implemented by hardware executing corresponding software, the hardware or software including one or more modules or units corresponding to the above-described functions. In one possible implementation, the communication device includes a transceiver module and a processing module, wherein: the processing module is used to generate (determine) first indication information; the transceiver module is used to send the first indication information, which indicates a first primitive polynomial; and to receive a random access signal, which is obtained based on a third sequence, which is obtained based on a fourth sequence and a second cyclic shift value, the fourth sequence being obtained based on the first primitive polynomial and an initial value from a set of initial values, the second cyclic shift value being an integer greater than or equal to 0, and any two initial values ​​in the set of initial values ​​being a second initial value and a third initial value, wherein the second initial value and the third initial value satisfy the following: the intersection of the sequence obtained based on the first primitive polynomial and the second initial value with the set of all cyclic shift version sequences corresponding to the sequence obtained based on the first primitive polynomial and the third initial value is an empty set.

[0072] For possible implementations of the communication device in aspect 12, please refer to the various possible implementations in aspect 6.

[0073] For the technical effects of the various possible implementations of the twelfth aspect, please refer to the introduction of the technical effects of the various possible implementations of the sixth aspect.

[0074] In a thirteenth aspect, embodiments of this application provide another communication device, the communication device including a processor coupled to a memory for storing computer programs or instructions, the processor for executing the computer programs or instructions in the memory to cause the communication device to perform the methods of any one of the first to sixth aspects described above.

[0075] Optionally, the communication device further includes a memory. For example, the communication device may be a chip, the processor may be a processing unit within the chip, and the memory may be random access memory or cache within the chip.

[0076] In this embodiment of the application, during the execution of the above method, the process of sending information (or signals) can be understood as a process of outputting information based on a computer program or instruction of the processor. When outputting information, the processor outputs the information to the transceiver so that the transceiver can transmit it. After being output by the processor, the information may undergo further processing before reaching the transceiver. Similarly, when the processor receives input information, the transceiver receives the information and inputs it into the processor. Furthermore, after the transceiver receives the information, the information may undergo further processing before being input into the processor.

[0077] Unless otherwise specified, or unless it contradicts its actual function or internal logic in the relevant description, the sending and / or receiving operations involved by the processor can generally be understood as processor-based computer program or instruction output.

[0078] In implementation, the processor described above can be a processor specifically designed to execute these methods, or it can be a processor that executes computer programs or instructions stored in memory to execute these methods, such as a general-purpose processor. For example, the processor can also be used to execute programs stored in memory, which, when executed, cause the communication device to perform the methods as shown in the first aspect or any possible implementation thereof.

[0079] In one possible implementation, the memory is located outside the aforementioned communication device. In another possible implementation, the memory is located inside the aforementioned communication device.

[0080] In one possible implementation, the processor and memory may be integrated into a single device; that is, the processor and memory may be integrated together.

[0081] In one possible implementation, the communication device further includes a transceiver for receiving or transmitting signals, etc.

[0082] In a fourteenth aspect, this application provides another communication device, which includes a processing circuit and an interface circuit, the interface circuit being used to acquire or output data; the processing circuit being used to perform the method as described in any one of the first to sixth aspects above.

[0083] In a fifteenth aspect, this application provides a computer-readable storage medium storing a computer program or instructions that, when executed on a computer, cause the computer to perform the methods described in any of the first to sixth aspects above. For example, the computer is a terminal device or an access network device.

[0084] In a sixteenth aspect, this application provides a computer program product that, when run on a computer, causes the computer to perform the method described in any one of the first to sixth aspects above.

[0085] In a seventeenth aspect, this application provides a chip including a communication interface and a processor; the communication interface is used for signal transmission and reception of the chip; the processor is used to execute computer programs or instructions, causing a communication device including the chip to perform the method as described in any one of the first to sixth aspects above.

[0086] In the eighteenth aspect, this application provides a communication system, including the communication device of the seventh aspect and the communication device of the eighth aspect.

[0087] In a nineteenth aspect, this application provides a communication system, including the communication apparatus of the ninth aspect and the communication apparatus of the tenth aspect.

[0088] In a twentieth aspect, this application provides a communication system, including a communication device according to an eleventh aspect and a communication device according to a twelfth aspect. Attached Figure Description

[0089] Figure 1 is a schematic diagram of a communication system applicable to the embodiments of this application;

[0090] Figure 2 shows a schematic diagram of the basic structure of a feedback shift register;

[0091] Figure 3 is a schematic diagram of a competition-based random access procedure;

[0092] Figure 4 is a flowchart illustrating a communication method provided in an embodiment of this application;

[0093] Figure 5 shows a schematic diagram of the process for detecting the received signal;

[0094] Figure 6 is a flowchart illustrating another communication method provided in an embodiment of this application;

[0095] Figure 7 is a schematic diagram of the structure of a communication device 70 provided in an embodiment of this application;

[0096] Figure 8 is a schematic diagram of another communication device provided in an embodiment of this application;

[0097] Figure 9 is a schematic diagram of another structure of the communication device provided in an embodiment of this application. Detailed Implementation

[0098] The terms "first" and "second," etc., used in the specification, claims, and drawings of this application are only used to distinguish different objects and not to describe a specific order. It is understood that the various numerical designations used in the embodiments of this application are merely for descriptive convenience and are not intended to limit the scope of the embodiments of this application. The order of the process numbers does not imply the order of execution; the execution order of each process should be determined by its function and inherent logic. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or device that includes a series of steps or units is not limited to the listed steps or units, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to these processes, methods, products, or devices.

[0099] The term "embodiment" as used herein means that a particular feature, structure, or characteristic described in connection with an embodiment may be included in at least one embodiment of this application. The appearance of this phrase in various places throughout the specification does not necessarily refer to the same embodiment, nor is it a mutually exclusive, independent, or alternative embodiment. Those skilled in the art will understand, explicitly and implicitly, that the embodiments described herein can be combined with other embodiments. In this application, message names are used only to distinguish different messages and should not be construed as limiting. That is, any message name in this application can be replaced with other names, and this application does not impose any limitations.

[0100] The terminology used in the following embodiments of this application is for the purpose of describing particular embodiments only and is not intended to be limiting of this application. As used in the specification and appended claims of this application, the singular expressions “a,” “an,” “the,” “the,” “the,” and “this” are intended to include the plural expressions as well, unless the context clearly indicates otherwise. It should also be understood that the term “and / or” as used in this application refers to and includes any or all possible combinations of one or more of the listed items. For example, “A and / or B” can mean: the presence of only A, the presence of only B, and the presence of both A and B, where A and B can be singular or plural. The term “multiple” as used in this application refers to two or more. In the textual description of this application, the character “ / ” generally indicates that the preceding and following objects are in an “or” relationship.

[0101] It is understood that in the various embodiments of this application, "B corresponding to A" means that there is a correspondence between A and B, and B can be determined based on A. However, it should also be understood that determining (or generating) B based on (or on) A does not mean that B is determined (or generated) solely based on (or on) A; B can also be determined (or generated) based on (or on) A and / or other information.

[0102] It should be understood that in this application, the indication includes direct indication (also known as explicit indication) and implicit indication. Direct indication information A refers to information A being included; implicit indication information A refers to information A being indicated through the correspondence between information A and information B, and through direct indication information B. The correspondence between information A and information B can be predefined, pre-stored, pre-burned, or pre-configured.

[0103] It should be understood that in this application, information C is used to determine information D, including both situations where information D is determined solely based on information C and situations where it is determined based on information C and other information. Furthermore, information C can also be used to determine information D indirectly, for example, where information D is determined based on information E, and information E is determined based on information C.

[0104] Furthermore, in the embodiments of this application, "network element A sends information A to network element B" can be understood as network element B being the destination of information A or an intermediate network element in the transmission path between the destination and network element B, which may include sending information directly or indirectly to network element B. "Network element B receives information A from network element A" can be understood as network element A being the source of information A or an intermediate network element in the transmission path between the source and network element A, which may include receiving information directly or indirectly from network element A. Information may undergo necessary processing between the source and destination, such as format changes, but the destination can understand the valid information from the source. Similar expressions in this application can be understood in a similar way and will not be elaborated further here.

[0105] The technical solutions in this application will now be described with reference to the accompanying drawings.

[0106] First, the communication system to which the embodiments of this application are applicable will be described.

[0107] Figure 1 is a schematic diagram of a communication system applicable to an embodiment of this application. As shown in Figure 1, the communication system includes: an access network device and a terminal device. Optionally, the access network device is connected to the core network via wireless or wired means. Optionally, the core network device and the access network device in the core network can be different physical devices, or they can be the same physical device integrating core network logical functions and wireless access network logical functions.

[0108] Access network equipment is a device deployed in a radio access network to provide wireless communication functions. Alternatively, access network equipment is a device with wireless transceiver capabilities used to communicate with terminal devices. Access network equipment is a node in the radio access network (RAN), also known as a base station or RAN node. In other words, access network equipment is a device that provides base station functionality within the network. For example, in 2G networks, devices providing base station functionality include base transceiver stations (BTS) and base station controllers (BSCs). In 3G networks, devices providing base station functionality include NodeBs (NodeBs) and radio network controllers (RNCs). In 4G networks, devices providing base station functionality include evolved NodeBs (eNBs). In WLANs, devices providing base station functionality are access points (APs). In 5G networks such as New Radio (NR) or Long Term Evolution (LTE)+, equipment providing base station functionality includes evolved Node Bs (gNBs), Transmission and Reception Points (TRPs), or Transmission Points (TPs). TRPs or TPs may exclude the baseband portion and include only the radio frequency (RF) portion, or they may include both the baseband and RF portions. Access network equipment can also be base stations, broadband network gateways (BNGs), aggregation switches, or 3GPP access equipment in public land mobile networks (PLMNs) that evolve after 5G.

[0109] The aforementioned RAN can be configured as a RAN defined by the 3GPP protocol, an open radio access network (O-RAN), or a cloud radio access network (C-RAN), etc. Access network equipment can also include various forms of base stations, such as macro base stations, micro base stations (also known as small stations), relay stations, mobile switching centers, and equipment that performs base station functions in device-to-device (D2D), vehicle-to-everything (V2X), and machine-to-machine (M2M) communications, as well as access network equipment in non-terrestrial networks (NTN), etc., without specific limitations.

[0110] Access network equipment may also include network elements or modules that implement some of the functions of a base station, such as one or more of the following: a centralized unit (CU), a distributed unit (DU), or a radio unit (RU). Optionally, the CU can be further separated into a CU-control plane (CP) and a CU-user plane (UP). The functions of the CU and DU can be implemented by different network elements, or simultaneously by the base band unit (BBU) of the base station. The functions of the RU can be implemented by the radio frequency equipment of the base station. For example, the radio frequency equipment of the base station may be a remote radio unit (RRU), a pico remote radio unit (pRRU), an active antenna unit (AAU), or other units, modules, or devices with radio frequency processing functions. The communication interface protocol between the BBU and the radio frequency equipment can be the Common Public Radio Interface (CPRI) protocol, the Enhanced Common Public Radio Interface (eCPRI) protocol, or the fronthaul interface protocol between the DU and RU in the O-RAN system, etc., without restriction.

[0111] The communication device used to implement the functions of the access network device can be the access network device itself, or it can be a device that supports the access network device in implementing these functions, such as a chip system. This device can be installed in the access network device or used in conjunction with the access network device. The chip system in this embodiment can be composed of chips, or it can include chips and other discrete components.

[0112] A terminal device is a device with wireless transceiver capabilities. Terminal devices are primarily used to receive or send service data. They can communicate with one or more core networks via the RAN (Access Node) (the access portion of a wireless communication network). Terminal devices can be mobile or stationary. Terminal devices have different names for user equipment in different networks, such as: terminal, mobile station, subscriber unit, station, cellular phone, personal digital assistant, wireless modem, wireless communication equipment, handheld device, laptop, cordless phone, wireless local loop station, vehicle-mounted equipment, remote station, remote terminal, mobile device, user terminal, wireless communication equipment, user agent, or user equipment, etc.

[0113] Terminal devices can also include satellite phones, cellular phones, smartphones, wireless data cards, wireless modems, machine-type communication devices, cordless phones, session initiation protocol (SIP) phones, customer-premises equipment (CPE), point-of-sale (POS) machines, handheld devices with wireless communication capabilities, computing devices or other processing devices connected to a wireless modem, communication devices mounted on high-altitude aircraft, wearable devices, drones, robots, terminals in device-to-device (D2D) communication, terminals in vehicle-to-everything (V2X) communication, virtual reality (VR) terminal devices, augmented reality (AR) terminal devices, wireless terminals in industrial control, wireless terminals in self-driving, wireless terminals in remote medical care, wireless terminals in smart grids, wireless terminals in transportation safety, and wireless terminals in smart cities. There are no restrictions on wireless terminals in cities, wireless terminals in smart homes, or terminal devices in communication networks that evolve after 5G.

[0114] The terminal device can also be a device with radio frequency identification (RFID) functionality. For example, the terminal device can be an RFID tag. The terminal device can be an active RFID tag, a passive RFID tag, or a semi-passive RFID tag. In some embodiments, the terminal device can be a device with Internet of Things (IoT) functionality. For example, the terminal device can be an IoT tag. The terminal device can also be a terminal in A-IoT, i.e., an A-IoT terminal (e.g., an A-IoT tag).

[0115] The communication device used to implement the functions of a terminal device can be the terminal device itself, or it can be a device that supports the terminal device in implementing those functions, such as a chip system. This device can be installed in the terminal device or used in conjunction with the terminal device. In this application, the chip system can be composed of chips, or it can include chips and other discrete components.

[0116] To facilitate understanding of the embodiments of this application, a few basic concepts involved in the embodiments of this application will be briefly explained.

[0117] 1. m-sequence: m-sequence is short for longest linear feedback shift register sequence. It is the longest-period sequence generated by a shift register (or shift register) with linear feedback. Generally, the longest period generated by an n-stage linear feedback shift register is equal to (2... n -1). n is an integer greater than 0. Figure 2 shows a schematic diagram of the basic structure of a feedback shift register. Referring to Figure 2, the feedback shift register includes multiple memories (or storage units). A rectangle in Figure 2 represents a memory. The bit data used for initialization (i.e., the initial value) is stored in the memory. New values ​​are generated by the feedback function and added to the memory. Assume that the feedback function performs an XOR operation on all the bits in the memory, i.e. The input is The output sequence is

[0118] The m-sequence is determined by the initial value and the primitive polynomial stored in the linear feedback shift register, where the primitive polynomial corresponds to the structure of the linear feedback shift register. The primitive polynomial f(x) of order n is a polynomial with integer coefficients that satisfies the following condition:

[0119] 1) f(x) is irreducible, that is, it cannot be factored into a polynomial f(x);

[0120] 2) f(x) is divisible by x p +1, p = 2 n-1, where n is the number of stages in the shift register, i.e., the number of memory units;

[0121] 3) f(x) is not divisible by x q +1, here q <p。

[0122] The order of a primitive polynomial is the highest power in the polynomial. Generally, for a binary sequence, consider the primitive polynomial: a i For x ∈ {0,1}, the recurrence relation for f(x) is: For example, f(x) = x 7 The recurrence relation for +x+1 is s(t)+s(t-6)+s(t-7)=0. For binary operations, they are all defined as modulo 2 operations: -1=1 (mod 2), 1+1=0 (mod 2), 1+0=1 (mod 2), 0+0=0 (mod 2). Therefore, the above formula can be transformed into the recurrence relation s(t)=(s(t-6)+s(t-7))mod2. For an m-sequence, m-sequences generated with different initial values ​​correspond to cyclic shifts of sequences generated with other initial values; in other words, m-sequences generated with different initial values ​​are cyclic shifted versions of sequences generated with other initial values.

[0123] 2. Gold Sequences: Gold sequences are pseudo-random sequences, which can be viewed as the result of element-wise XOR operations on two sequences with different primitive polynomials. Gold sequences exhibit good autocorrelation and cross-correlation properties. The large number of gold sequences facilitates the carrying of information.

[0124] 3. Z4 sequence: For a quaternion sequence, consider the primitive polynomial: The recursive formula is: It is important to note that the results of all four arithmetic operations on a quaternion sequence must be modulo 4. The most common quaternion sequence in academia is the Z4 sequence. The period of the Z4 sequence is the same as that of the binary gold sequence of the same length, and the value set is {0,1,2,3}. It can be modulated into a complex signal using quadrature phase shift keying (QPSK). Similar to the gold sequence, the Z4 sequence can be generated using a circular shift register. The generation of the Z4 sequence is similar to that of the m-sequence, except that the Z4 sequence is defined on a quaternion ring of {0,1,2,3}, therefore, addition and subtraction must be modulo 4. The specific recursive formula for the sequence can be found above. In practical use, the Z4 sequence needs to be modulated. Table 1 shows the modulation methods of the Z4 sequence, that is, the modulation methods of the elements in the Z4 sequence.

[0125] Table 1

[0126] The Z4 sequence can be determined based on the initial value and the primitive polynomial. For example, the Z4 sequence can be obtained by substituting the initial value of the Z4 sequence into the recursive formula corresponding to the primitive polynomial of the Z4 sequence. Based on the initial value of length n and the recursive formula corresponding to the primitive polynomial, a sequence of length (2...) can be obtained recursively. n -1) Z4 sequence. The initial value of length n is a quadruple sequence containing n elements. Length (2 n The Z4 sequence of -1) contains (2) n A quaternion sequence with -1 elements.

[0127] 4. Random Access Procedure: The random access procedure is the process by which user equipment (UE) establishes a connection and achieves uplink synchronization with the cell (or network). It is also a necessary step in establishing a radio link between the UE and the cell (e.g., 4G network, 5G network). After the random access is completed, the base station and the UE can perform data interoperation. There are two modes of random access procedure: contention-based random access procedure and non-contention-based random access procedure. Figure 3 is a schematic diagram of the contention-based random access procedure. As shown in Figure 3, the contention-based random access procedure consists of the following steps:

[0128] Step 1: The UE transmits a random access signal on the physical random access channel (PRACH). The random access signal is used to request access to a cell managed by the base station, or in other words, to request access to the base station. The random access signal includes a random access preamble and a preamble index. The random access preamble can be simply referred to as the preamble. The random access preamble is derived based on the preamble sequence. The random access signal can be called Msg1 or the first message in the random access process. Optionally, the UE randomly selects the PRACH and random access preamble corresponding to its coverage level, and then transmits the random access signal on that PRACH. The base station can obtain the random access preamble identifier (RAPID) by detecting the random access preamble.

[0129] Step 2: The base station sends a random access response (RAR) (also known as Msg2) on the physical downlink shared channel (PDSCH). The RAR may carry the UE's RAPID, the temporary cell radio network temporary identifier (TC-RNTI), and the uplink grant (UL grant) for transmission in step 3 (Msg3).

[0130] Step 3: The UE detects the RAR containing its RAPID and sends an RRC connection request (also known as Msg3) based on the UL authorization in the RAR. The RRC connection request is used to request the establishment of an RRC connection with the base station. Msg3 can be scrambled with TC-RNTI.

[0131] Step 4: The base station sends a contention resolution message (also known as Msg4) to the UE on the PDSCH. Optionally, the base station uses TC-RNTI to detect Msg3, allocates time-frequency resources for data transmission based on the service type and capability indication reported by the UE, and sends a contention resolution message to the UE. Step 4 resolves contention and conflicts caused by multiple UEs attempting to use the same random access resource and the same random access preamble. The existing four-step random access procedure includes steps one through four as shown in Figure 3.

[0132] Step 5: When the UE detects Msg4 using TC-RNTI, the RRC connection is established and an RRC connection establishment completion message is sent to the base station.

[0133] 5. Preamble Transmission: In some random access procedures, the preamble uses a ZC sequence and is transmitted using a Discrete Fourier Transform (DFT) extended Orthogonal Frequency Division Multiplexing (OFDM) waveform (DFT-spread OFDM) (DFT-s-OFDM). The ZC sequence generation formula satisfies:

[0134] ZC sequences, based on different cyclic shifts and root indices, enable multiple users to access the same time-frequency resources. u is the root index (also called the root exponent or root value). The cross-correlation between ZC sequences obtained with the same root index is 0, while the cross-correlation between ZC sequences with different root indices is [value missing]. N is the sequence length, i.e., the length of the ZC sequence. LRA The length of the ZC sequence is given. The cross-correlation assays described above do not consider time-domain cyclic shift, or in other words, do not consider time-domain multipath propagation. When using a ZC sequence as the preamble, cyclic shift values ​​are selected at equal intervals in low-speed scenarios. Because the autocorrelation of the ZC sequence is severely affected by frequency offset, a constraint set for the cyclic shift values ​​needs to be set when using a ZC sequence as the preamble in high-speed scenarios.

[0135] One possible preamble transmission procedure is as follows:

[0136] Step 1: The UE parses the System Information Block (SIB) 1 message to obtain the PRACH configuration parameters. These parameters may include the PRACH root sequence index, PRACH subcarrier spacing, and the number of Frequency Domain Random Access Channel occasions (ROs). The PRACH root sequence index is used to determine the starting preamble index for the current cell's 64 preambles. Specifically, the PRACH transmission occasion (RO) requires a preamble set of 64 preambles. If the number of preambles generated by a root index (the available number of cyclic shifts) is less than 64, then the next root index is used to continue generation.

[0137] Step 2: The UE selects the PRACH transmission timing based on the parsed SSB beam index information. At this PRACH transmission timing, it randomly selects any one of the aforementioned preamble sets (the number of elements in this preamble set is not necessarily 64, as the 64 preambles are subdivided according to their intended use; for example, among all preambles used for contention-based random access, the base station can selectively divide them into two groups: Group A and Group B). When the UE triggers random access, it needs to determine the preamble set based on the size of the Msg3 to be transmitted and the path loss. Group B is used for scenarios where Msg3 is large and the path loss is small, while Group A is used for other situations where Group B is not suitable. The threshold parameters for measuring whether Msg3 and the path loss are large or small are not provided by the base station to the UE in the SIB1 information. After determining whether to use set A or B for the preamble, the UE randomly selects a preamble from that set for transmission. For example, the preamble set may be further subdivided based on whether Msg3 is repeated; therefore, the number of preambles in the preamble set determined by the UE will necessarily be less than 64.

[0138] Step 3: Send the preamble using a DFT-s-OFDM waveform.

[0139] One possible preamble transmission process is as follows: The base station acquires the preamble at the corresponding RO and performs precise time synchronization. Since the base station does not know the preamble used by the UE, it needs to traverse all available preambles in the sequence set for cross-correlation detection. The preamble with the largest cross-correlation value corresponds to the one actually transmitted (it should be understood that the synchronization position and the preamble are determined simultaneously, which is a two-dimensional detection).

[0140] The preceding text introduced some terms, concepts, or processes involved in the embodiments of this application. The following text introduces the technical background involved in the embodiments of this application.

[0141] In the random access procedure, the preamble uses a ZC sequence, and the number of preambles in the preamble set determined by the UE is less than or equal to 64. This means that a maximum of 64 UEs can access the system on the same time-frequency resources in the random access procedure. To support UE access in high-speed mobile scenarios, the number of available cyclic shift bits for the preamble needs to be further limited, thus further restricting PRACH capacity and reducing the number of supported multi-user accesses. Since the connection density of next-generation wireless communication systems will increase significantly—for example, the number of UEs such as robots, IoT devices, and tags will increase dramatically—the number of users initiating random access on the same time-frequency resources within the same cell will also increase significantly. Therefore, it is necessary to research high-capacity random access schemes to support larger-scale multi-user access. This application provides a random access scheme that supports larger-scale multi-user access. Furthermore, some random access schemes provided in this application have stronger resistance to frequency offset compared to existing random access schemes, making them suitable for UE access scenarios under both low-speed and high-speed mobile conditions. The main idea of ​​the random access scheme provided in this application is to obtain a set of preamble sequences based on different primitive polynomials, different cyclic shifts and different initial values. The number of candidate preamble sequences in this set is greater than 64, which can support a larger scale of multi-user access, that is, to achieve high-capacity access.

[0142] The communication method and apparatus provided in this application will be further described below with reference to the accompanying drawings. It is understood that this application uses a first communication device and a second communication device as examples of the execution entities in the interactive illustration, but this application does not limit the execution entities in the interactive illustration. Optionally, the first communication device is a terminal device, and the second communication device is an access network device. For example, the method executed by the second communication device in this application can also be implemented by a module (e.g., a circuit, chip, or chip system) in the access network device, or by a logic node, logic module, or software that can implement all or part of the functions of the second communication device. The method executed by the first communication device in this application can also be implemented by a communication module in the terminal device or by a circuit or chip (e.g., a baseband chip, or a system-on-a-chip (SoC) chip containing a baseband chip, or a system-in-package (SIP) chip) in the terminal device responsible for communication functions.

[0143] This application describes the method provided by the first communication device and the second communication device from both sides. However, during the transmission of signals, the first communication device and the second communication device can also forward the signals through other devices, such as forwarding the signals between the first communication device and the second communication device through a forwarding device. This application does not limit other devices besides the first communication device and the second communication device.

[0144] Figure 4 is a flowchart illustrating a communication method provided in an embodiment of this application. As shown in Figure 4, the method includes:

[0145] 401. The first communication device generates a random access signal.

[0146] The random access signal is obtained based on the first sequence. The random access signal can be called the random access message or Msg1, and includes a random access preamble. The first sequence can be a Z4 sequence, a gold sequence, an m-sequence, or other sequences; this application does not limit the specific sequences. The Z4 sequence has superior resistance to frequency offset. A large number of different Z4 sequences can be obtained based on different primitive polynomials, different cyclic shifts, and different initial values. In other words, using a large number of Z4 sequences for random access can achieve large-scale multi-user access. This application describes an embodiment using a Z4 sequence as the first sequence. The set of values ​​for the Z4 sequence is x∈{0,1,2,3}. Modulating the Z4 sequence yields a complex sequence; the modulation method can be found in Table 1 above.

[0147] Optionally, the above random access preamble satisfies the following formula:

[0148] Formula (1) represents the expression for s p,i(n) Perform modulation as shown in Table 1, s p,i (n) represents the modulation symbol obtained by modulating the nth element of the Z4 sequence as shown in Table 1, L RA C represents the sequence length, specifically the length of the Z4 sequence. v This represents the cyclic shift value. p represents the index of the primitive polynomial corresponding to the Z4 sequence. i represents the index of the initial value corresponding to the Z4 sequence. C v =vN cs v = 0, 1, 2, ... N cs Indicates the cyclic shift interval. N cs Greater than or equal to 0. Cyclic shift values ​​are typically selected at equal intervals. The larger the cell radius, the greater N. cs The larger the value, the better. Because the Z4 sequence has superior frequency offset resistance, when the first communication device determines the preamble sequence set based on the primitive polynomial, initial value, and cyclic shift value, it does not need to set a constraint set for the cyclic shift value in high-speed scenarios. Compared to the ZC sequence, the Z4 sequence does not require a constraint set for the cyclic shift value in high-speed scenarios.

[0149] The first sequence is obtained based on the second sequence and a first cyclic shift value, where the first cyclic shift value is an integer greater than or equal to 0. An equivalent description of the first sequence as obtained based on the second sequence and the first cyclic shift value is that the first sequence is any one of some or all cyclic shift versions of the second sequence (including the second sequence). In this application, any cyclic shift version of any sequence includes that arbitrary sequence, which will not be described again below. Another equivalent description of the first sequence as obtained based on the second sequence and the first cyclic shift value is that the first sequence is a sequence in a set of leading sequences that includes at least some or all cyclic shift versions of the second sequence.

[0150] The second sequence is obtained based on the primitive polynomial and / or initial value corresponding to the first index in the first table. The first communication device stores the first table. The first index is an index in the first column of the first table. The first table includes some or all rows from at least two columns of the second table, which include the first and third columns of the second table. An example of the second table is shown in Table 2 below.

[0151] The following description uses the example of a first sequence as one of a set of leading sequences, which includes at least some or all of the cyclically shifted versions of the second sequence. The set of leading sequences can be pre-stored, generated in real-time, or configured or indicated. For example, a first communication device can determine the set of leading sequences (or sequence pool) based on information from a second communication device (e.g., a broadcast message), and then randomly select one from this set to obtain the first sequence.

[0152] Optionally, the number of leading sequences in the leading sequence set is greater than 64, for example, 128, 256, etc.

[0153] Optionally, the leading sequence set may also include some or all cyclically shifted versions of the sequence obtained from the primitive polynomials and / or initial values ​​corresponding to other indices in the first table.

[0154] Table 2

[0155] The primitive polynomial and / or initial value corresponding to the first index in the first table is the primitive polynomial and / or initial value contained in the row containing the first index in the first table. Another example of the second table is shown in Table 3 below. As an example, the first table includes some or all of the rows in Table 3 below.

[0156] Table 3

[0157] Another example from the second table is shown in Table 4 below.

[0158] Table 4

[0159] In this application, [3,1,2] represents the primitive polynomial f(x) = x. 3 +2x 2 +x+3, the primitive polynomial represented by [3,2,3] is f(x)=x 3 +3x 2 +2x+3. Another example of the second table is shown in Table 5 below. As an example, the first table includes some or all of the rows from Table 5 below.

[0160] Table 5

[0161] Another example from the second table is shown in Table 6 below.

[0162] Table 6

[0163] It should be understood that Tables 2 to 6 are partial examples of the second table, not all examples.

[0164] Optionally, each index in the second table corresponds to a combination of a primitive polynomial and an initial value, and the primitive polynomial and initial value corresponding to each index in the second table are not limited. Optionally, different indices in the second table correspond to different primitive polynomials, and the primitive polynomials corresponding to each index in the second table are not limited. Optionally, different indices in the second table correspond to different initial values, and the initial values ​​corresponding to each index in the second table are not limited.

[0165] In one possible design, the method flow in Figure 4 further includes the following operation: before the first communication device generates a random access signal, the second communication device sends a first index, and correspondingly, the first communication device receives the first index. Optionally, the first index is included in a broadcast message, such as SIB1. The first communication device determines a preamble sequence set based on the primitive polynomial and initial value corresponding to the first index. This preamble sequence set includes some or all cyclically shifted versions of the second sequence. In this embodiment, the example of the first communication device needing to determine a preamble sequence set containing s candidate preamble sequences is described, where s is an integer greater than 64. In one possible implementation, the first communication device determines a fifth sequence based on the primitive polynomial and initial value corresponding to the first index; then, it determines some or all cyclically shifted versions of the fifth sequence; if the number of some or all cyclically shifted versions of the fifth sequence is greater than or equal to s, the set of any s sequences among the some or all cyclically shifted versions of the fifth sequence is taken as the preamble sequence set.

[0166] In another possible design, the method flow in Figure 4 further includes the following operation: before the first communication device generates the random access signal, the second communication device sends a second index, and correspondingly, the first communication device receives the second index. Optionally, the second index is included in a broadcast message, such as SIB1. The second index is used to determine the first index. Or, the first index is determined by the second index. Optionally, the initial value corresponding to the second index is different from the initial value corresponding to the first index. For example, the first index is the index in the first table adjacent to the second index, that is, the row in the first table containing the first index and the row containing the second index are adjacent. Optionally, the primitive polynomial corresponding to the second index is different from the primitive polynomial corresponding to the first index.

[0167] In one possible implementation, the first table includes some or all rows of the second table, and the second sequence is obtained based on the primitive polynomial and initial value corresponding to the first index in the first table. One possible implementation of the first communication device generating the random access signal is as follows: the first communication device determines the primitive polynomial and initial value corresponding to the second index from the first table; determines a preamble sequence set based on the primitive polynomial and initial value corresponding to the second index, for example, the number of preamble sequences in the preamble sequence set is greater than 64; randomly selects a sequence from the preamble sequence set to obtain the first sequence; and generates the random access signal based on the first sequence. Optionally, the preamble sequence set includes some or all cyclically shifted versions of the second sequence and some or all cyclically shifted versions of the sequence obtained based on the primitive polynomial and initial value corresponding to the second index.

[0168] In another possible implementation, the first table includes some or all rows from the first and third columns of the second table, and the second sequence is obtained based on the initial value corresponding to the first index in the first table and the primitive polynomial specified in the protocol. One possible implementation of the first communication device generating the random access signal is as follows: the first communication device determines the initial value corresponding to the second index from the first table; and determines the preamble sequence set based on the initial value corresponding to the second index and the primitive polynomial specified in the protocol, for example, the primitive polynomial specified in the protocol is f(x) = x. 3 +2x 2 +x+3 or (x)=x 3 +3x 2 +2x+3; Randomly select a sequence from the preamble sequence set to obtain the first sequence; Generate a random access signal based on the first sequence. Optionally, the preamble sequence set includes some or all cyclically shifted versions of the second sequence (including the second sequence) and some or all cyclically shifted versions of the sequence obtained according to the initial value corresponding to the second index and the primitive polynomial specified in the protocol.

[0169] One possible procedure for the first communication device to determine the set of leading sequences based on the primitive polynomial corresponding to the second index and the initial value is as follows:

[0170] 501. The first communication device determines the fifth sequence and all cyclic shift versions of the fifth sequence based on the primitive polynomial corresponding to the second index and the initial value.

[0171] For ease of description, the method described here takes the determination of all cyclically shifted versions of a sequence (e.g., the fifth sequence and the sixth and seventh sequences described below) after the first communication device determines the sequence based on the primitive polynomials and initial values ​​corresponding to arbitrary indices. In some possible embodiments, after the first communication device determines the sequence (e.g., the fifth sequence and the sixth and seventh sequences described below) based on the primitive polynomials and initial values ​​corresponding to arbitrary indices, it may determine some cyclically shifted versions of the sequence.

[0172] 502. The first communication device determines whether the number of all cyclic shift versions of the fifth sequence is greater than or equal to s, where s is an integer greater than 64. If not, the first communication device executes step 503; if yes, the first communication device executes step 505.

[0173] 503. The first communication device adds all cyclically shifted versions of the fifth sequence to the preamble sequence set. The sequences in the preamble sequence set can be called candidate preamble sequences. Before the first communication device adds all cyclically shifted versions of the fifth sequence to the preamble sequence set, the preamble sequence set is empty.

[0174] 504. The first communication device determines the sixth sequence and all cyclically shifted versions of the sixth sequence based on the primitive polynomial and initial value corresponding to index #1, wherein index #1 is the first index, or index #1 is determined by the second index. The first communication device determines whether the sum of the number of candidate leader sequences in the leader sequence set and the number of all cyclically shifted versions of the sixth sequence is greater than or equal to s.

[0175] If so, the first communication device adds all or part of the cyclically shifted versions of the sixth sequence to the preamble sequence set, such that the number of candidate preamble sequences in the preamble sequence set is s.

[0176] If not, the first communication device adds all cyclically shifted versions of the sixth sequence to the preamble sequence set. The first communication device determines the seventh sequence and all cyclically shifted versions of the seventh sequence based on the primitive polynomial and initial value corresponding to index #2, where index #1 is the first index, determined by the second index, or index #2 is determined by index #1. The first communication device determines whether the sum of the number of candidate preamble sequences in the preamble sequence set and the number of all cyclically shifted versions of the seventh sequence is greater than or equal to s. If yes, no more indices are added; if no, indices are added. Next, the first device can sequentially select other indices, such as index #3, ..., index #m1, where m1 is an integer greater than 1, according to the selected indices, determine the candidate preamble sequences, and finally determine the preamble sequence set.

[0177] 505. The first communication device selects s ​​cyclic shift versions of the fifth sequence and adds them to the preamble sequence set. For example, the first communication device randomly selects s ​​cyclic shift versions of the fifth sequence and adds them to the preamble sequence set. Before the first communication device selects s ​​cyclic shift versions of the fifth sequence and adds them to the preamble sequence set, the preamble sequence set is empty.

[0178] Optionally, the first index is any one of index #1, index #2, ..., index #m1.

[0179] Optionally, the predefined rule is to select one or more indices in the first table that are sorted after the second index and adjacent to the second index, until the number of determined candidate leading sequences is greater than or equal to s. This application does not limit the predefined rule.

[0180] Optionally, the second index, index #1, and index #2 are three adjacent indexes in the first table. For example, referring to Table 2, the second index is (0,0), index #1 is (0,1), and index #2 is (0,2). Another example, referring to Table 2, the second index is (0,128), index #1 is (1,0), and index #2 is (1,1). Yet another example, referring to Table 3, the first index is 10, index #1 is 11, and index #2 is 12.

[0181] Optionally, the predefined rule is to select one or more items from the first table that are sorted after the second index and whose sort value differs from the second index by h, 2h, 3h, ..., where h is an integer greater than 1. For example, referring to Table 2, the second index is (0,1), index #1 is (0,3), and index #2 is (0,5).

[0182] The first communication device determines a set of leading sequences based on the primitive polynomial corresponding to the second index and the initial value, including some or all cyclically shifted versions of the second sequence and some or all cyclically shifted versions of the sequence obtained based on the primitive polynomial corresponding to the second index and the initial value.

[0183] In one possible design, the second sequence is a quaternion sequence, and the first index is (p, i), as shown in Table 2 or Table 4. p indicates the primitive polynomial corresponding to the first index, and i indicates the initial value corresponding to the first index. The primitive polynomial corresponding to the first index, the initial value corresponding to the first index, and the second sequence satisfy the following formula:

[0184] Among them, s p,i (n) represents the nth element of the second sequence, the initial value corresponding to the first index is a four-element sequence, L is the length of the initial value corresponding to the first index, and c p,k This represents the coefficient of the term with power k in the primitive polynomial corresponding to the first index; the initial value v corresponding to the first index. p,i Satisfy the following formula:

[0185] The initial value corresponding to the first index is a decimal value. The mod function is a remainder function, n1 mod n2 represents the remainder after dividing two values, where n1 and n2 are integers, and n2 is not 0. x mod 4 represents the remainder after dividing x by 4. The meaning of the above formulas (2) and (3) is that the second sequence can be obtained recursively based on the primitive polynomial corresponding to the first index and the initial value corresponding to the first index. The process of recursively obtaining the second sequence based on the primitive polynomial corresponding to the first index and the initial value corresponding to the first index can be as follows: According to formula (3), the initial value v corresponding to the first index is... p,i Convert to a four-element sequence of length L, i.e., [s p,i (0), s p,i (1), s p,i (2), ..., s p,i (L-1)]; The quadruple sequence [s p,i (0), s p,i (1), s2 p,i (2), ..., s p,i Substituting (L-1) into formula (2) yields s p,i (L); The quadruple sequence [s] p,i (1), s p,i (2), s p,i (3), ..., s p,i Substituting (L) into formula (2) yields s p,i (L+1); The quadruple sequence [s p,i (2), s p,i (3), s p,i (4), ..., s p,i Substituting (L+1) into formula (2) yields s p,i (L+2); and so on, until s is obtained. p,i (2 L -1); where the second sequence is [s p,i (0), s p,i (1), s p,i (2), ..., s p,i (2 L -1)]. It can be written as

[0186] In another possible design, the second sequence is a quaternion sequence, the primitive polynomial corresponding to the first index, the initial value corresponding to the first index, and the second sequence satisfy formula (2), where s p,i (n) represents the nth element in the second sequence, p indicates the primitive polynomial corresponding to the first index, i indicates the initial value corresponding to the first index, L is an integer greater than 1, and c p,kThis represents the coefficient of the term with power k in the primitive polynomial corresponding to the first index; the initial value v corresponding to the first index. p,i It satisfies formula (3).

[0187] 402. The first communication device sends a random access signal.

[0188] Correspondingly, the second communication device receives the random access signal. As an example, the first communication device transmits the random access signal carrying a preamble based on an OFDM waveform.

[0189] 403. The second communication device determines the first sequence based on the received random access signal.

[0190] The second communication device can detect the received random access signal to determine the first sequence, i.e., the preamble sequence. This application does not limit the implementation method of the second communication device determining the first sequence based on the received random access signal.

[0191] In one possible design, since the second communication device does not know the preamble used by the first communication device, it is necessary to traverse all available preambles in the local preamble sequence set and perform cross-correlation detection with the preambles in the received random access signal. Figure 5 shows a schematic diagram of the process for detecting the received signal. As shown in Figure 5, detecting the received signal (i.e., the preamble in the received random access signal) includes: performing sliding correlation detection between the received signal and the local sequence. Specifically, the local sequence set (i.e., the local preamble sequence set) is traversed, a local sequence is selected, and either the local sequence is oversampled or the received signal is downsampled. Then, the current received signal is obtained by sliding a sampling point within the received signal window, and the correlation value is calculated with the local sequence. This process is repeated to obtain multiple correlation values. The maximum correlation value among these multiple correlation values ​​is used to determine the transmitted preamble (i.e., the first sequence) and the uplink synchronization timing position.

[0192] In one possible design, the received signal can be filtered before performing the aforementioned sliding correlation detection.

[0193] In one possible design, a fast Fourier transform (FFT) can be performed on the received signal and the local sequence, followed by a conjugate dot product in the frequency domain and an inverse fast Fourier transform (IFFT) to obtain the correlation values ​​of all sliding correlation detections, thereby reducing the complexity of the aforementioned sliding detection.

[0194] The method flow in Figure 4 can be some or all of the steps in any existing random access procedure. As an example, the first communication device is a UE, and the second communication device is a base station; step 402 is step 1 in the method flow of Figure 3, and step 403 is step 2 in the method flow of Figure 3. Optionally, the interaction flow between the first communication device and the second communication device also executes steps 3 to 5 in Figure 3. As another example, the first communication device is a UE, and the second communication device is a base station; step 402 is the step of sending MsgA in a two-step random access procedure, where MsgA carries the aforementioned first sequence.

[0195] In this embodiment, the first sequence is randomly selected by the first communication device from a preamble sequence set. Furthermore, any preamble sequences in the preamble sequence set used by the first communication device maintain low cross-correlation. The number of preamble sequences in the preamble sequence set used by the first communication device is greater than 64, for example, 128 or 256. Compared to the prior art, which only supports a maximum of 64 preamble sequences, this allows for larger-scale multi-user access, i.e., high-capacity access, while maintaining low cross-correlation between preamble sequences used within the same cell.

[0196] Figure 6 is a flowchart illustrating another communication method provided in an embodiment of this application. The difference between the method flowchart in Figure 6 and that in Figure 4 lies in the way the first communication device determines the preamble sequence set. In the method flowchart of Figure 4, the first communication device stores the aforementioned first table, and the preamble sequence set used by the first communication device is obtained based on the primitive polynomial and / or initial value corresponding to the index in the first table. In the method flowchart of Figure 6, the preamble sequence set used by the first communication device is obtained based on the first primitive polynomial (indicated by the second communication device) and the initial value in the initial value set. As shown in Figure 6, the method includes:

[0197] 601. The second communication device sends the first instruction information.

[0198] Accordingly, the first communication device receives first indication information. The first indication information is used to indicate the first primitive polynomial. For example, the first indication information is the index of the first primitive polynomial.

[0199] Optionally, the first indication information is carried in a broadcast message, such as SIB1.

[0200] 602. The first communication device sends a random access signal.

[0201] Correspondingly, the second communication device receives a random access signal. The random access signal is obtained based on a third sequence. The third sequence is obtained based on a fourth sequence and a second cyclic shift value, where the second cyclic shift value is an integer greater than or equal to 0. An equivalent description of the third sequence being obtained based on the fourth sequence and the second cyclic shift value is as follows: the third sequence is a sequence in a set of leading sequences that includes some or all cyclic shift versions of the fourth sequence. The following description uses the example of the third sequence being a sequence in a set of leading sequences. The fourth sequence is obtained based on a first primitive polynomial and an initial value from a set of initial values. Any two initial values ​​in the set are the second and third initial values. The second and third initial values ​​satisfy the following condition: the intersection of the sequence obtained based on the first primitive polynomial and the second initial value with the set of all cyclic shift versions of the sequence obtained based on the first primitive polynomial and the third initial value is an empty set.

[0202] Optionally, the fourth sequence is one of M sequences, where the M sequences are obtained based on the first primitive polynomial and the M smallest or largest initial values ​​in the initial value set, where M is an integer greater than 0. For example, the initial values ​​in the initial value set are initially value #1, initially value #2, initially value #3, ..., initially value #M, ... The M sequences are obtained based on the first primitive polynomial and the M smallest initial values ​​in the initial value set, and these M sequences are sequence #1, sequence #2, sequence #3, ..., sequence #M. Sequence #1 is obtained based on the first primitive polynomial and initial value #1, sequence #2 is obtained based on the first primitive polynomial and initial value #2, sequence #3 is obtained based on the first primitive polynomial and initial value #3, ..., sequence #M is obtained based on the first primitive polynomial and initial value #M.

[0203] In one possible design, the initial values ​​in the initial value set are one or more fourth initial values ​​among a plurality of ordered initial values, wherein the fourth initial value satisfies the condition that the intersection of the sequence obtained based on the first primitive polynomial and the fourth initial value with the set of all cyclically shifted version sequences corresponding to the sequence obtained based on the first primitive polynomial and any initial value in the initial value set is an empty set. Optionally, the plurality of ordered initial values ​​are initial values ​​sorted in ascending order, or, alternatively, initial values ​​are initial values ​​sorted in descending order. Optionally, the first indication information is also used to indicate the minimum initial value and / or the maximum initial value among the plurality of ordered initial values. Optionally, the minimum initial value and the maximum initial value are specified by the protocol. For example, the minimum initial value is 1, and the maximum initial value is (4... n -1), n ​​is log2(L RA +1), L RA Indicates the length of the leading sequence. When L... RA When L is 127, n is 7.RA When n is 7, n is 3.

[0204] In one possible implementation, before the first communication device sends the random access signal, it performs the following operations: determining the first primitive polynomial indicated by the first indication information; adding one or more fourth initial values ​​from a plurality of sequentially arranged initial values ​​to the initial value set, the initial value set being initialized to empty, i.e., the initial value set is empty before the addition of one or more fourth initial values, the fourth initial values ​​satisfying the following condition: the intersection of the sequence obtained based on the first primitive polynomial and the fourth initial values ​​with the set of all cyclic shift version sequences corresponding to the sequence obtained based on any initial value in the first primitive polynomial and the initial value set is an empty set. Optionally, after obtaining the initial value set, the first communication device further performs the following operations: determining a preamble sequence set based on the first primitive polynomial and the initial value set, the preamble sequence set including some or all cyclic shift versions of the fourth sequence; randomly selecting a sequence from the preamble sequence set to obtain a third sequence; generating a random access signal based on the third sequence. It is assumed that the initial values ​​in the initial value set are in ascending order as initial value #1, initial value #2, initial value #3, ..., initial value #M, ... Using a similar method, the set of initial values ​​corresponding to any primitive polynomial can be determined. The second table above shows the set of initial values ​​corresponding to two primitive polynomials respectively. For example, referring to Table 2, the set of initial values ​​corresponding to the primitive polynomial [3,1,0,0,2,0,0] includes the initial values ​​corresponding to indices (0,0) to (0,128), and the set of initial values ​​corresponding to the primitive polynomial [3,0,2,0,3,0,0] includes the initial values ​​corresponding to indices (1,0) to (1,128). The number of primitive polynomials in Table 2 is not limited to two; it can include more or fewer primitive polynomials. The set of initial values ​​corresponding to each primitive polynomial in the first table above can be obtained in a similar manner.

[0205] One possible implementation of the first communication device determining the leading sequence set based on the first primitive polynomial and the initial value set is as follows: The first communication device determines the fourth sequence based on the first primitive polynomial and the initial value #1; then, it determines some or all cyclic shift versions of the fourth sequence; if the number of some or all cyclic shift versions of the fourth sequence is less than s; it determines the eighth sequence based on the first primitive polynomial and the initial value #2; then, it determines some or all cyclic shift versions of the eighth sequence; if the sum of the number of some or all cyclic shift versions of the fourth sequence and the number of some or all cyclic shift versions of the eighth sequence is greater than or equal to s, the set of any s sequences in the union of the some or all cyclic shift versions of the fourth sequence and the some or all cyclic shift versions of the eighth sequence is taken as the leading sequence set; if the sum of the number of some or all cyclic shift versions of the fourth sequence and the number of some or all cyclic shift versions of the eighth sequence is less than s, it determines the ninth sequence based on the first primitive polynomial and the initial value #3; then, it determines some or all cyclic shift versions of the ninth sequence, and so on.

[0206] Another possible implementation of the first communication device determining the leading sequence set based on the first primitive polynomial and the initial value set is as follows: The first communication device determines the fourth sequence based on the first primitive polynomial and the initial value #1; then, it determines some or all cyclic shift versions of the fourth sequence; if the number of some or all cyclic shift versions of the fourth sequence is greater than or equal to s, the set of any s sequences among the some or all cyclic shift versions of the fourth sequence is taken as the leading sequence set.

[0207] Optionally, after receiving the random access signal, the second communication device may perform the following operation: the second communication device determines the first sequence based on the received random access signal, see step 403.

[0208] Since the third sequence is obtained based on the fourth sequence and the second cyclic shift value, the preamble sequence set includes at least some or all cyclic shift versions of the fourth sequence (including the fourth sequence). Optionally, the preamble sequence set also includes some or all cyclic shift versions of the sequence obtained based on the first primitive polynomial and other initial values ​​in the initial value set. Therefore, the number of preamble sequences in this preamble sequence set can be set according to actual needs, for example, 128, 256, etc.; compared to the existing technology which only supports a maximum of 64 preamble sequences, this can support a larger scale of multi-user access. Optionally, maintaining low cross-correlation between any preamble sequences in the preamble sequence set used by the first communication device can ensure low cross-correlation between preamble sequences used within the same cell.

[0209] Since the UE may transmit a preamble in high-speed scenarios, the frequency offset resistance of the preamble sequence needs to be guaranteed. The Z4 sequence has superior frequency offset resistance. Frequency offset resistance is generally evaluated using the second peak of the ambiguity function, and the expression for the self-ambiguity function is:

[0210] s represents the sequence, L is the sequence length (without oversampling), τ is the time bias, and its value ranges from τ∈[0:L / 10⁻¹] (considering that the length of the cyclic prefix (CP) is 1 / 10 of the sequence length), f d This is the frequency offset value, and the range of frequency offset considered is f. d ∈[0:L-1]. Among these, a larger second peak in the self-ambiguity function indicates a weaker ability of the sequence to resist frequency offset. It is important to understand that f... d When = 0, A(f) d τ) corresponds to periodic autocorrelation. abs(x) represents the absolute value of x.

[0211] The cross-ambiguity function between different sequences characterizes the cross-correlation between two sequences under the frequency offset condition, and is defined as follows:

[0212] s1 and s2 represent sequences, L is the sequence length (without oversampling), τ is the time bias, and its value ranges from τ∈[0:L / 10⁻¹]. d This is the frequency offset value, and the range of frequency offset considered is f. d ∈[0:L-1]. The larger the second peak of the fuzzy function, the weaker the sequence set's resistance to frequency offset. It is important to understand that f... d When = 0, C(f) d ,τ) corresponds to periodic cross-correlation. Table 7 gives the self / mutual ambiguity functions for different schemes.

[0213] Table 7

[0214] It can be observed that the self / mutual ambiguity function performance of the proposed scheme is close to that of existing schemes that scramble ZC sequences with m-sequences. Compared with m-sequences, the normalized self-ambiguity function's second peak (i.e., the maximum autocorrelation sidelobe) is increased by a factor of 2, the maximum cross-correlation is close to that of m-sequences, and the PAPR is increased by about 0.5 dB. The m-sequence, as a preamble, can be considered the sequence with the best self / mutual ambiguity function performance. However, the m-sequence as a preamble has the problem of not supporting large-scale multi-user access. The random access scheme provided in this application can support a larger scale of multi-user access, and its self / mutual ambiguity function performance is superior to existing schemes that scramble ZC sequences with m-sequences.

[0215] The following describes the communication device provided in the embodiments of this application.

[0216] This application divides the communication device into functional modules according to the above method embodiments. For example, each function can be divided into its own functional modules, or two or more functions can be integrated into one processing module. The integrated modules can be implemented in hardware or as software functional modules. It should be noted that the module division in this application is illustrative and only represents one logical functional division; other division methods may be used in actual implementation. The communication device of the embodiments of this application will be described in detail below with reference to Figures 7 to 9.

[0217] Figure 7 is a schematic diagram of a communication device 70 provided in an embodiment of this application. As shown in Figure 7, the communication device includes a processing module 701 and a transceiver module 702. The transceiver module 702 can implement corresponding communication functions, and the processing module 701 is used to implement corresponding processing functions. For example, the transceiver module 702 can also be called an interface, a communication interface, or a communication module, etc.

[0218] In some embodiments of this application, the communication device can be used to perform the actions performed by the first communication device in the above method embodiments. The transceiver module 702 is used to perform the transmission and reception related operations of the first communication device in the above method embodiments, and the processing module 701 is used to perform the processing related operations of the first communication device in the above method embodiments.

[0219] In some possible embodiments, the processing module 701 is used to generate a random access signal, which is obtained based on a first sequence;

[0220] The transceiver module 702 is used to send random access signals; wherein, the first sequence is obtained based on the second sequence and the first cyclic shift value, the second sequence is obtained based on the primitive polynomial and / or initial value corresponding to the first index in the first table, the first index is an index in the first column of the first table, and the first cyclic shift value is an integer greater than or equal to 0.

[0221] In some other possible embodiments, the transceiver module 702 is configured to receive first indication information, which is used to indicate a first primitive polynomial;

[0222] Processing module 701 is used to generate random access signals;

[0223] The transceiver module 702 is also used to transmit a random access signal, which is obtained based on a third sequence. The third sequence is obtained based on a fourth sequence and a second cyclic shift value. The fourth sequence is obtained based on a first primitive polynomial and an initial value from the initial value set. The second cyclic shift value is an integer greater than or equal to 0. Any two initial values ​​in the initial value set are the second initial value and the third initial value. The second initial value and the third initial value satisfy the following condition: the intersection of the sequence obtained based on the first primitive polynomial and the second initial value with the set of all cyclic shift version sequences corresponding to the sequence obtained based on the first primitive polynomial and the third initial value is an empty set.

[0224] Reusing Figure 7, in some other embodiments of this application, the communication device can be used to perform the actions performed by the second communication device in the above method embodiments. The transceiver module 702 is used to perform the transceiver-related operations of the second communication device in the above method embodiments, and the processing module 701 is used to perform the processing-related operations of the second communication device in the above method embodiments.

[0225] In some possible embodiments, the transceiver module 702 is configured to receive a random access signal, which is obtained based on a first sequence;

[0226] Processing module 701 is used to determine a first sequence based on the received random access signal; wherein the first sequence is obtained according to a second sequence and a first cyclic shift value, the second sequence is obtained according to the primitive polynomial and / or initial value corresponding to the first index in the first table, the first index is an index in the first column of the first table, and the first cyclic shift value is an integer greater than or equal to 0.

[0227] In some other possible embodiments, processing module 701 is used to generate (determine) first indication information;

[0228] The transceiver module 702 is used to send first indication information, which indicates a first primitive polynomial; and to receive a random access signal, which is obtained based on a third sequence, which is obtained based on a fourth sequence and a second cyclic shift value. The fourth sequence is obtained based on the first primitive polynomial and an initial value from the initial value set. The second cyclic shift value is an integer greater than or equal to 0. Any two initial values ​​in the initial value set are the second initial value and the third initial value. The second initial value and the third initial value satisfy the following condition: the intersection of the sequence obtained based on the first primitive polynomial and the second initial value with the set of all cyclic shift version sequences corresponding to the sequence obtained based on the first primitive polynomial and the third initial value is an empty set.

[0229] Optionally, in the above embodiments, the communication device may further include a storage module, which can be used to store instructions and / or data. The processing module 701 can read the instructions and / or data in the storage module so that the communication device can implement the aforementioned method embodiments.

[0230] For details regarding the specific explanations of each term, noun, or step in the above embodiments, please refer to the descriptions in the above method embodiments; they will not be detailed here.

[0231] The specific descriptions of the transceiver module and processing module shown in the above embodiments are merely examples. For the specific functions or execution steps of the transceiver module and processing module, please refer to the above method embodiments, which will not be described in detail here.

[0232] The communication device of the present application embodiments has been described above. The following describes possible product forms of the communication device. Any product possessing the functions of the communication device shown in FIG7 above falls within the protection scope of the present application embodiments. The following description is merely illustrative and does not limit the product form of the communication device of the present application embodiments to this.

[0233] It should be understood that the communication device 70 here is embodied in the form of a functional module. The term "module" here may refer to application-specific integrated circuits (ASICs), electronic circuits, processors (e.g., shared processors, proprietary processors, or group processors) and memories for executing one or more software or firmware programs, combined logic circuits, and / or other suitable components that support the described functions.

[0234] The communication device 70 of each of the above-described schemes has the function of implementing the corresponding steps performed by the communication device (such as the first communication device or the second communication device) in the above-described methods. This function can be implemented by hardware or by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above-described functions; for example, the transceiver module can be replaced by a transceiver (for example, the transmitting unit in the transceiver module can be replaced by a transmitter, and the receiving unit in the transceiver module can be replaced by a receiver), and other units, such as processing modules, can be replaced by processors, which respectively execute the transmission and reception operations and related processing operations in each method embodiment.

[0235] In addition, the transceiver module 702 described above can also be a transceiver circuit (for example, it may include a receiving circuit and a transmitting circuit), and the processing module 701 can be a processing circuit.

[0236] Figure 8 is a schematic diagram of another communication device provided in an embodiment of this application. As shown in Figure 8, the communication device includes one or more processors 820 and transceivers 810.

[0237] In other embodiments of this application, the communication device can be used to execute the steps, methods, or functions executed by the first communication device described above. For example, the processor 820 can be used to execute the functions or steps implemented by the processing module 701 shown in FIG. 7, and the transceiver 810 can be used to execute the functions or steps implemented by the transceiver module 702 shown in FIG. 7. Detailed descriptions of the processor 820 and the transceiver 810 can be found in FIG. 7 or the method embodiments shown above, and will not be elaborated further here.

[0238] In some embodiments of this application, the communication device is used to perform the steps, methods or functions performed by the second communication device described above. For example, the processor 820 can be used to perform the functions or steps implemented by the processing module 701 shown in FIG7, and the transceiver 810 can be used to perform the functions or steps implemented by the transceiver module 702 shown in FIG7.

[0239] In various implementations of the communication device shown in Figure 8, the transceiver may include a receiver for performing a receiving function (or operation) and a transmitter for performing a transmitting function (or operation). The transceiver is also used to communicate with other devices / appliances via a transmission medium.

[0240] Optionally, the communication device may further include one or more memories 830 for storing program instructions and / or data. The memory 830 is coupled to the processor 820. The coupling in this embodiment is an indirect coupling or communication connection between communication devices, units, or modules, and can be electrical, mechanical, or other forms, used for information exchange between the communication devices, units, or modules. The processor 820 may operate in conjunction with the memory 830. The processor 820 may execute program instructions stored in the memory 830. Optionally, at least one of the above-mentioned memories may be included in the processor.

[0241] This application embodiment does not limit the specific connection medium between the transceiver 810, processor 820, and memory 830. In Figure 8, the memory 830, processor 820, and transceiver 810 are connected via a bus 840, which is represented by a thick line. The connection methods between other components are only illustrative and not intended to be limiting. Buses can be categorized as address buses, data buses, control buses, etc. For ease of illustration, only one thick line is used in Figure 8, but this does not indicate that there is only one bus or one type of bus.

[0242] In the embodiments of this application, the processor may be a general-purpose processor, a digital signal processor, an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc., and can implement or execute the various methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor may be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this application can be directly manifested as being executed by a hardware processor, or being executed by a combination of hardware and software modules within the processor.

[0243] In this application embodiment, the memory may include, but is not limited to, non-volatile memory such as hard disk drive (HDD) or solid-state drive (SSD), random access memory (RAM), erasable programmable read-only memory (EPROM), read-only memory (ROM), or compact disc read-only memory (CD-ROM), etc. Memory is any storage medium capable of carrying or storing program code in the form of instructions or data structures, and capable of being read and / or written by a computer (such as the communication device shown in this application), but is not limited to this. The memory in this application embodiment may also be a circuit or any other device capable of implementing storage functions, used to store program instructions and / or data.

[0244] The processor 820 is primarily used for processing communication protocols and data, controlling the entire communication device, executing software programs, and processing software program data. The memory 830 is primarily used for storing software programs and data. The transceiver 810 may include control circuitry and an antenna. The control circuitry is primarily used for converting baseband signals to radio frequency signals and processing radio frequency signals. The antenna is primarily used for transmitting and receiving radio frequency signals in the form of electromagnetic waves. Input / output devices, such as touchscreens, displays, and keyboards, are primarily used for receiving user input data and outputting data to the user.

[0245] When the communication device is powered on, the processor 820 can read the software program in the memory 830, interpret and execute the instructions of the software program, and process the data of the software program. When data needs to be transmitted wirelessly, the processor 820 performs baseband processing on the data to be transmitted and outputs the baseband signal to the radio frequency (RF) circuit. The RF circuit processes the baseband signal and transmits the RF signal outward in the form of electromagnetic waves through the antenna. When data is sent to the communication device, the RF circuit receives the RF signal through the antenna, converts the RF signal into a baseband signal, and outputs the baseband signal to the processor 820. The processor 820 converts the baseband signal into data and processes the data.

[0246] In another implementation, the aforementioned radio frequency circuits and antennas can be set up independently of the processor that performs baseband processing. For example, in a distributed scenario, the radio frequency circuits and antennas can be arranged in a remote manner, independent of the communication device.

[0247] The communication device shown in this application embodiment may also have more components than those in Figure 8, and this application embodiment does not limit this. The methods executed by the processor and transceiver shown above are only examples, and the specific steps executed by the processor and transceiver can be referred to the methods described above.

[0248] In another possible implementation, in the communication device shown in FIG7, the processing module 701 can be one or more logic circuits, and the transceiver module 702 can be an input / output interface, or a communication interface, or an interface circuit, or an interface, etc. Alternatively, the transceiver module 702 can also be a sending module and a receiving module. The sending module can be an output interface, and the receiving module can be an input interface. The sending module and the receiving module are integrated into one module, such as an input / output interface. As shown in FIG9, the communication device shown in FIG9 includes a logic circuit 901 and an interface 902. FIG9 is another structural schematic diagram of the communication device provided in the embodiments of this application. The above-mentioned processing module 701 can be implemented by logic circuit 901, and the transceiver module 702 can be implemented by interface 902. Among them, the logic circuit 901 can be a chip, processing circuit, integrated circuit, or system on chip (SoC) chip, etc., and the interface 902 can be a communication interface, input / output interface, pin, etc. For example, FIG9 uses the above-mentioned communication device as a chip, which includes logic circuit 901 and interface 902.

[0249] In this embodiment, the logic circuit and the interface can also be coupled to each other. The specific connection method of the logic circuit and the interface is not limited in this embodiment. For example, the logic circuit 901 can be used to execute the functions or steps implemented by the processing module 701 shown in FIG. 7, and the interface 902 can be used to execute the functions or steps implemented by the transceiver module 702 shown in FIG. 7. For a detailed description of the logic circuit 901 and the interface 902, please refer to FIG. 7 or the method embodiment shown above, which will not be detailed here.

[0250] The communication device shown in the embodiments of this application can implement the method provided in the embodiments of this application in hardware form, or it can implement the method provided in the embodiments of this application in software form, etc., and the embodiments of this application do not limit it in this way.

[0251] Furthermore, embodiments of this application also provide a communication system, which includes a first communication device and a second communication device, which can be used to execute the methods in any of the foregoing embodiments.

[0252] This application also provides a computer-readable storage medium storing a computer program or instructions that, when run on a computer, cause the computer to perform the methods of the above embodiments.

[0253] This application also provides a computer program product, which includes instructions or a computer program that, when run on a computer, causes the methods in the above embodiments to be executed.

[0254] This application also provides a chip, which includes: a communication interface and a processor; the communication interface is used for signal transmission and reception of the chip; the processor is used to execute computer program instructions, causing a communication device including the chip to perform the methods as described in the above embodiments.

[0255] In the several embodiments provided in this application, it should be understood that the disclosed systems, communication devices, and methods can be implemented in other ways. For example, the communication device embodiments described above are merely illustrative. For instance, the division of modules is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple modules or components may be combined or integrated into another system, or some features may be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed may be indirect coupling or communication connection through some interfaces, communication devices, or modules, or it may be an electrical, mechanical, or other form of connection. Modules described as separate components may or may not be physically separate, and components shown as modules may or may not be physical modules, that is, they may be located in one place or distributed across multiple network modules. Some or all of the modules can be selected according to actual needs to achieve the technical effects of the solutions provided in the embodiments of this application.

[0256] Furthermore, the functional modules in the various embodiments of this application can be integrated into one processing module, or each module can exist physically separately, or two or more modules can be integrated into one module. The integrated modules described above can be implemented in hardware or as software functional modules.

[0257] If the integrated module is implemented as a software functional module and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a readable storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of the various embodiments of this application. The aforementioned readable storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0258] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, etc.) containing computer-usable program code.

[0259] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to this application. It should be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in one or more blocks of the flowchart illustrations and / or one or more blocks of the block diagrams.

[0260] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means that implement the functions specified in one or more flowcharts and / or one or more block diagrams.

[0261] These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process, such that the instructions, which execute on the computer or other programmable apparatus, provide steps for implementing the functions specified in one or more flowcharts and / or one or more block diagrams.

[0262] Obviously, those skilled in the art can make various modifications and variations to this application without departing from the scope of this application. Therefore, if such modifications and variations fall within the scope of the claims of this application and their equivalents, this application also intends to include such modifications and variations.

Claims

1. A communication method, characterized in that, include: A random access signal is generated, which is obtained based on a first sequence; Send the random access signal; Wherein, the first sequence is obtained based on the second sequence and the first cyclic shift value, the second sequence is obtained based on the primitive polynomial and / or initial value corresponding to the first index in the first table, the first index is an index in the first column of the first table; the first cyclic shift value is an integer greater than or equal to 0, and the first table includes some or all rows from at least two columns of the second table, wherein the at least two columns include the first column and the third column of the second table:

2. The method according to claim 1, characterized in that, The method further includes: Receive a second index, the first index being determined by the second index, the initial value corresponding to the first index being different from the initial value corresponding to the second index, or the primitive polynomial corresponding to the first index being different from the primitive polynomial corresponding to the second index.

3. A communication method, characterized in that, include: Receive a random access signal, the random access signal being obtained based on a first sequence; The first sequence is determined based on the received random access signal; Wherein, the first sequence is obtained based on the second sequence and the first cyclic shift value, the second sequence is obtained based on the primitive polynomial and / or initial value corresponding to the first index in the first table, the first index is an index in the first column of the first table; the first cyclic shift value is an integer greater than or equal to 0, and the first table includes some or all rows from at least two columns of the second table, wherein the at least two columns include the first column and the third column of the second table:

4. The method according to claim 3, characterized in that, The method further includes: Send a second index, the first index being determined by the second index, the initial value corresponding to the first index being different from the initial value corresponding to the second index, or the primitive polynomial corresponding to the first index being different from the primitive polynomial corresponding to the second index.

5. The method according to any one of claims 1 to 4, characterized in that, The second sequence is a quaternion sequence, the first index is (p, i), where p indicates the primitive polynomial corresponding to the first index, and i indicates the initial value corresponding to the first index. The primitive polynomial corresponding to the first index, the initial value corresponding to the first index, and the second sequence satisfy the following formula: Among them, s p,i (n) represents the nth element in the second sequence, where L is an integer greater than 1, and c p,k This represents the coefficient of the term with power k in the primitive polynomial corresponding to the first index; the initial value v corresponding to the first index p,i Satisfy the following formula: The initial value corresponding to the first index is a decimal number.

6. A communication method, characterized in that, include: Receive first indication information, the first indication information being used to indicate a first primitive polynomial; A random access signal is sent, the random access signal being obtained based on a third sequence, the third sequence being obtained based on a fourth sequence and a second cyclic shift value, the fourth sequence being obtained based on a first primitive polynomial and an initial value from a set of initial values, the second cyclic shift value being an integer greater than or equal to 0, and any two initial values ​​in the set of initial values ​​being a second initial value and a third initial value, the second initial value and the third initial value satisfying that the intersection of the sequence obtained based on the first primitive polynomial and the second initial value with the set of all cyclic shift version sequences corresponding to the sequence obtained based on the first primitive polynomial and the third initial value is an empty set.

7. The method according to claim 6, characterized in that, The method further includes: One or more fourth initial values ​​from a plurality of sequentially arranged initial values ​​are added to the set of initial values, wherein the fourth initial value satisfies the following condition: the intersection of the sequence obtained based on the first primitive polynomial and the fourth initial value with the set of all cyclically shifted version sequences corresponding to the sequence obtained based on the first primitive polynomial and any initial value in the set of initial values ​​is an empty set.

8. A communication method, characterized in that, include: Send a first indication message, the first indication message being used to indicate a first primitive polynomial; A random access signal is received, the random access signal being obtained based on a third sequence, the third sequence being obtained based on a fourth sequence and a second cyclic shift value, the fourth sequence being obtained based on a first primitive polynomial and an initial value from a set of initial values, the second cyclic shift value being an integer greater than or equal to 0, and any two initial values ​​in the set of initial values ​​being a second initial value and a third initial value, the second initial value and the third initial value satisfying that the intersection of the sequence obtained based on the first primitive polynomial and the second initial value with the set of all cyclic shift version sequences corresponding to the sequence obtained based on the first primitive polynomial and the third initial value is an empty set.

9. The method according to claim 8, characterized in that, The initial values ​​in the initial value set are one or more fourth initial values ​​among a plurality of initial values ​​arranged in order. The fourth initial value satisfies the following condition: the intersection of the sequence obtained based on the first primitive polynomial and the fourth initial value with the set of all cyclically shifted version sequences corresponding to the sequence obtained based on the first primitive polynomial and any initial value in the initial value set is an empty set.

10. The method according to claim 7 or 9, characterized in that, The ordered initial values ​​are either sorted from smallest to largest, or they are sorted from largest to smallest.

11. The method according to claim 10, characterized in that, The first indication information is also used to indicate the minimum initial value and / or the maximum initial value among the plurality of initial values.

12. The method according to any one of claims 6 to 11, characterized in that, The fourth sequence is one of the M sequences, which are obtained based on the first primitive polynomial and the M smallest or largest initial values ​​in the initial value set, where M is an integer greater than 0.

13. A communication device, characterized in that, Includes modules or units for performing the method as described in any one of claims 1-12.

14. A communication device, characterized in that, The device includes a processor coupled to a memory for storing computer programs or instructions, and the processor is configured to execute the computer programs or instructions in the memory, causing the communication device to perform the method as described in any one of claims 1 to 12.

15. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program or instructions that, when executed on a computer, cause the computer to perform the method as described in any one of claims 1 to 12.

16. A computer program product, characterized in that, When the computer program product is run on a computer, it causes the computer to perform the method as described in any one of claims 1 to 12.

Images