A data transmission method, terminal, base station, and storage medium

Abstract

This invention discloses a data transmission method, terminal, base station, and storage medium to address the problem of low PRACH performance in existing novel multiple access technologies. The method includes: determining a bit sequence associated with the PUSCH data to be transmitted; obtaining a first sub-bit sequence and a second sub-bit sequence from the bit sequence according to a first sequence partitioning rule; the first sequence partitioning rule is a rule that divides the bit sequence into two parts; determining the preamble sequence to be used during access from a set of candidate preamble sequences based on the first sub-bit sequence; determining the resources required to transmit the preamble sequence to be used during access from a set of resources used by PRACH for transmitting the preamble sequence based on the second sub-bit sequence; transmitting the preamble sequence to be used during access on the resources required for the preamble sequence to be used during access; and transmitting the PUSCH data after transmitting the preamble sequence to be used during access.

Description

Technical Field

[0001] This invention relates to the field of communications, and in particular to a data transmission method, terminal, base station, and storage medium. Background Technology

[0002] With the rapid development of mobile communication technology, the number of terminals accessing mobile communication networks is increasing exponentially, and in the future, the number of terminals accessing mobile networks per square kilometer may reach tens of millions.

[0003] Such a massive number of terminals will face difficulties accessing the mobile network, and even if they successfully access it, they are prone to resource shortages. For example, in existing technologies, terminals typically use contention-based access to access the mobile network. However, with such a massive number of terminals initially accessing the network, they will be limited by the network's coordination signaling resources and will not be able to use ordinary contention-based access techniques, leading to access difficulties. Assuming that a massive number of terminals have already accessed the mobile network, even if each terminal occupies one Physical Resource Block (PRB) to freely generate data, tens of millions of terminals would still require tens of thousands or even more PRBs, which is far greater than the total number of PRBs in the mobile network. This makes it difficult for terminals to obtain sufficient resources for data transmission.

[0004] In existing technologies, novel multiple access technologies (also known as non-coordinated random access and transmission technologies) are typically used to allow a large number of terminals to access the network. These novel multiple access technologies allow the access process and data transmission process to occur simultaneously, without waiting for successful access before data transmission. This requires the Physical Random Access Channel (PRACH) to be associated with the Physical Uplink Shared Channel (PUSCH), meaning the PRACH needs to carry data information related to the PUSCH (such as the PUSCH CRC checksum). Therefore, the performance of the PUSCH is affected by the performance of the PRACH; the PUSCH can only be solved when the PRACH is resolved, which necessitates that the performance of the PRACH be significantly better than that of the PUSCH.

[0005] Therefore, how to improve the performance of PRACH in new multiple access technologies has become an urgent technical problem to be solved. Summary of the Invention

[0006] This invention provides a data transmission method, terminal, base station, and storage medium to solve the technical problem of low PRACH performance in existing novel multiple access technologies.

[0007] Firstly, to solve the above-mentioned technical problems, the present invention provides a data transmission method with the following technical solution:

[0008] Determine the bit sequence associated with the Physical Uplink Shared Channel (PUSCH) data to be transmitted; according to a first sequence partitioning rule, obtain a first sub-bit sequence and a second sub-bit sequence from the bit sequence; the first sequence partitioning rule is a rule that divides the bit sequence into two parts;

[0009] Based on the first sub-bit sequence, a preamble sequence to be used during access is determined from a set of candidate preamble sequences; and based on the second sub-bit sequence, resources required to transmit the preamble sequence to be used during access are determined from a set of resources used by the Physical Random Access Channel (PRACH) for transmitting preamble sequences.

[0010] The preamble sequence used during access is sent on the resources required for the preamble sequence used during access, and the PUSCH data is sent after the preamble sequence used during access is sent.

[0011] One possible implementation involves determining a bit sequence associated with the Physical Uplink Shared Channel (PUSCH) data to be transmitted, including:

[0012] From the PUSCH data, obtain at least one of the following sequences: the sequence corresponding to the cyclic redundancy check bit, the terminal identifier, and the sequence corresponding to the feature bit in the PUSCH data;

[0013] The at least one sequence is used as a bit sequence associated with the PUSCH data.

[0014] One possible implementation includes the feature bits:

[0015] The first N bits of the PUSCH data; where N is a positive integer;

[0016] Or, the last N bits of the PUSCH data;

[0017] Alternatively, N bits determined from the PUSCH data according to preset rules.

[0018] One possible implementation, the first sequence partitioning rule includes:

[0019] The bit sequence is divided into two parts, which may be continuous or non-contiguous.

[0020] In one possible implementation, the two parts of the sequence are continuous or non-contiguous, and their positions in the bit sequence do not overlap or partially overlap.

[0021] One possible implementation involves determining the preamble sequence of the PUSCH data from a set of candidate preamble sequences based on the first sub-bit sequence, including:

[0022] Convert the first sub-bit sequence into a first decimal number;

[0023] From the set of candidate preamble sequences, a candidate preamble sequence corresponding to the first decimal number is selected as the preamble sequence used during access.

[0024] One possible implementation involves selecting a candidate preamble sequence corresponding to the first decimal number from the candidate preamble sequence set as the preamble sequence used during access, including:

[0025] From the set of candidate preamble sequences, the i-th candidate preamble sequence is selected as the preamble sequence used during access; wherein i is the first decimal number, or is determined based on the first decimal number and the total number of elements contained in the set of candidate preamble sequences.

[0026] One possible implementation is that the resource set consists of at least one of time-domain resources and frequency-domain resources for transmitting the preamble, or consists of time-frequency resources for transmitting the preamble.

[0027] One possible implementation involves determining, based on the second sub-bit sequence, the resources required for transmitting the preamble sequence used during access, from the resource set used for transmitting the preamble sequence via the Physical Random Access Channel (PRACH), when each bit in the second sub-bit sequence is associated with a resource in the resource set, including:

[0028] Determine whether the binary value of each bit in the second sub-bit sequence is a preset value; wherein, the preset value is binary data 0 or 1;

[0029] If the binary value is the preset value, then the resource associated with the corresponding bit in the resource set is used as the resource required for the preamble sequence used during access.

[0030] One possible implementation involves, when each bit sequence of length equal to the second sub-bit sequence is associated with a resource in the resource set, determining, based on the second sub-bit sequence, the resources required for transmitting the preamble sequence used during access from the resource set used by the Physical Random Access Channel (PRACH) for transmitting the preamble sequence, including:

[0031] Convert the second sub-bit sequence into a base 20 number;

[0032] From the resource set, the j-th resource is selected as the resource required for the preamble sequence used during access; wherein, j is the second decimal data, or is determined based on the second decimal number and the total number of resources contained in the resource set.

[0033] In one possible implementation, when the time-frequency resources for transmitting the preamble in the resource set are continuous, based on the second sub-bit sequence, the resources required for transmitting the PUSCH data preamble sequence are determined from the resource set used by the Physical Random Access Channel (PRACH) for transmitting the preamble sequence, including:

[0034] According to the second sequence partitioning rule, the third and fourth sub-bit sequences are obtained from the second sub-bit sequence; wherein, the second sequence partitioning rule is a rule that divides the second sub-bit sequence into two parts;

[0035] Based on the third sub-bit sequence, a first time-domain resource is determined from the time-domain resource set corresponding to the time-frequency resource set; based on the fourth sub-bit sequence, a first frequency-domain resource is determined from the frequency-domain resource set corresponding to the time-frequency resource set.

[0036] The time-frequency resources corresponding to the first time-domain resources and the first frequency-domain resources are used as the resources required for the preamble sequence used during access.

[0037] One possible implementation involves determining a first time-domain resource from the time-domain resource set corresponding to the time-frequency resource set based on each bit in the third sub-bit sequence when each bit in the third sub-bit sequence is associated with a time-domain resource in the time-domain resource set. This includes:

[0038] Determine whether the binary value of each bit in the third sub-bit sequence is a preset value; wherein, the preset value is binary data 0 or 1;

[0039] If the binary value is the preset value, then the time-domain resources associated with the corresponding bit in the time-domain resource set are taken as the first time-domain resource.

[0040] One possible implementation involves determining a first frequency domain resource from the time-frequency resource set based on the third sub-bit sequence when each bit sequence of length equal to the length of the third sub-bit sequence is associated with a time-domain resource in the time-domain resource set. This includes:

[0041] Convert the third sub-bit sequence into a 30-base number;

[0042] From the set of time-domain resources, the x-th time-domain resource is selected as the first time-domain resource; wherein, x is the thirtieth decimal number, or is determined based on the thirtieth decimal number and the total number of time-domain resources contained in the set of time-domain resources.

[0043] One possible implementation involves determining a first frequency domain resource from the frequency domain resource set corresponding to the time-frequency resource set based on each bit in the fourth sub-bit sequence when each bit in the fourth sub-bit sequence is associated with a frequency domain resource in the frequency domain resource set. This includes:

[0044] Determine whether the binary value of each bit in the fourth sub-bit sequence is a preset value; wherein, the preset value is binary data 0 or 1;

[0045] If the binary value is the preset value, then the frequency domain resource associated with the corresponding bit in the frequency domain resource set is taken as the first frequency domain resource.

[0046] One possible implementation involves determining a first frequency domain resource from the frequency domain resource set based on the fourth sub-bit sequence when each bit sequence of length 1 is associated with a frequency domain resource in the frequency domain resource set.

[0047] Convert the fourth sub-bit sequence into a fourth decimal number;

[0048] From the set of frequency domain resources, the y-th frequency domain resource is selected as the first frequency domain resource; wherein, y is the fortieth decimal data, or is determined based on the fortieth decimal number and the total number of frequency domain resources contained in the set of frequency domain resources.

[0049] Secondly, embodiments of the present invention provide a method for data transmission, including:

[0050] Receive the preamble sequence and the Physical Uplink Shared Channel (PUSCH) data;

[0051] Based on the position data of the received preamble sequence in the candidate preamble sequence set, a first sub-bit sequence is determined; and based on the position data of the resource carrying the preamble sequence in the resource set, a second sub-bit sequence is determined.

[0052] After confirming that the preamble sequence is correct, the first sub-bit sequence and the second sub-bit sequence are merged into one sequence according to the first sequence partitioning rule to obtain the bit sequence associated with the PUSCH data; the first sequence partitioning rule is the rule of dividing the bit sequence into two parts;

[0053] The PUSCH data is received using the bit sequence associated with it, the receiving process including descrambling or verifying the PUSCH data.

[0054] One possible implementation involves determining a first sub-bit sequence based on the position data of the received preamble sequence in the candidate preamble sequence set, including:

[0055] The position data of the received preamble sequence in the candidate preamble sequence set is converted into binary data and used as the first sub-bit sequence; wherein, the position data of the received preamble sequence in the candidate preamble sequence set is a decimal number;

[0056] Alternatively, the first sub-bit sequence can be determined based on the position data of the received preamble sequence in the candidate preamble sequence set and the total number of elements contained in the candidate sequence set.

[0057] One possible implementation is that the resource set consists of at least one of time-domain resources and frequency-domain resources for transmitting preambles, or time-frequency resources for transmitting preambles.

[0058] One possible implementation involves determining the second sub-bit sequence based on the position data of the resource carrying the preamble sequence within the resource set when each bit in the second sub-bit sequence is associated with a resource in the resource set, including:

[0059] An initial sequence is constructed by considering whether each of the multiple consecutive resources carries the preamble sequence; wherein, when the preamble sequence is received on the resource, the value of the corresponding bit in the initial sequence is set to a preset value, and when the preamble sequence is not received on the resource, the value of the corresponding bit in the initial sequence is set to the inverted value of the preset value, wherein the preset value is 0 or 1;

[0060] Construct at least one sequence containing the initial sequence and having the stated length as the second sub-bit sequence.

[0061] One possible implementation involves determining the second sub-bit sequence based on the position data of the resource carrying the preamble sequence in the resource set when each bit sequence of length equal to the second sub-bit sequence is associated with a resource in the resource set. This includes:

[0062] The position data of the resource carrying the preamble sequence in the resource set is converted into binary data, which is used as the second sub-bit sequence; wherein, the position data of the resource carrying the preamble sequence in the resource set is a decimal number;

[0063] Alternatively, the second sub-bit sequence can be determined based on the position data of the resource carrying the preamble sequence in the resource set and the total number of elements contained in the resource set.

[0064] One possible implementation, where the time-frequency resources in the resource set are continuous, involves determining the second sub-bit sequence based on the position data of the resources carrying the preamble sequence within the resource set, including:

[0065] The third sub-bit sequence is determined based on the position data of the time-domain resource corresponding to the time-frequency resource carrying the preamble sequence in the time-domain resource set.

[0066] The fourth sub-bit sequence is determined based on the position data of the frequency domain resource corresponding to the time-frequency resource carrying the preamble sequence in the frequency domain resource set;

[0067] According to the second sequence partitioning rule, the third sub-bit sequence and the fourth sub-bit sequence are merged into the second sub-bit sequence; wherein, the second sequence partitioning rule is the rule for dividing the second sub-bit sequence into two parts.

[0068] One possible implementation involves determining the third bit sequence based on the position data of the time-domain resource carrying the preamble sequence within the time-domain resource set, including:

[0069] The position data of the time-domain resource carrying the preamble sequence in the time-domain resource set is converted into binary data and used as the third sub-bit sequence; wherein, the position data of the time-domain resource carrying the preamble sequence in the time-domain resource set is a decimal number;

[0070] Alternatively, the third sub-bit sequence can be determined based on the position data of the time-domain resource carrying the preamble sequence in the time-domain resource set, and the total number of elements contained in the time-domain resource set.

[0071] One possible implementation involves determining the fourth bit sequence based on the position data of the frequency domain resource carrying the preamble sequence within the frequency domain resource set, including:

[0072] The position data of the frequency domain resource carrying the preamble sequence in the frequency domain resource set is converted into binary data and used as the fourth sub-bit sequence; wherein, the position data of the frequency domain resource carrying the preamble sequence in the frequency domain resource set is a decimal number;

[0073] Alternatively, the fourth sub-bit sequence can be determined based on the position data of the frequency domain resources carrying the preamble sequence in the frequency domain resource set, and the total number of elements contained in the frequency domain resource set.

[0074] Thirdly, embodiments of the present invention also provide a terminal, including a memory, a transceiver, and a processor:

[0075] A memory for storing computer programs; a transceiver for sending and receiving data under the control of the processor; and a processor for reading the computer programs from the memory and performing the following operations:

[0076] Determine the bit sequence associated with the Physical Uplink Shared Channel (PUSCH) data to be transmitted; according to a first sequence partitioning rule, obtain a first sub-bit sequence and a second sub-bit sequence from the bit sequence; the first sequence partitioning rule is a rule that divides the bit sequence into two parts;

[0077] Based on the first sub-bit sequence, a preamble sequence to be used during access is determined from a set of candidate preamble sequences; and based on the second sub-bit sequence, resources required to transmit the preamble sequence to be used during access are determined from a set of resources used by the Physical Random Access Channel (PRACH) for transmitting preamble sequences.

[0078] The preamble sequence used during access is sent on the resources required for the preamble sequence used during access, and the PUSCH data is sent after the preamble sequence used during access is sent.

[0079] In one possible implementation, the processor further uses:

[0080] From the PUSCH data, obtain at least one of the following sequences: the sequence corresponding to the cyclic redundancy check bit, the terminal identifier, and the sequence corresponding to the feature bit in the PUSCH data;

[0081] The at least one sequence is used as a bit sequence associated with the PUSCH data.

[0082] One possible implementation includes the feature bits:

[0083] The first N bits of the PUSCH data; where N is a positive integer;

[0084] Or, the last N bits of the PUSCH data;

[0085] Alternatively, N bits determined from the PUSCH data according to preset rules.

[0086] One possible implementation, the first sequence partitioning rule includes:

[0087] The bit sequence is divided into two parts, which may be continuous or non-contiguous.

[0088] In one possible implementation, the two parts of the sequence are continuous or non-contiguous, and their positions in the bit sequence do not overlap or partially overlap.

[0089] In one possible implementation, the processor further uses:

[0090] Convert the first sub-bit sequence into a first decimal number;

[0091] From the set of candidate preamble sequences, a candidate preamble sequence corresponding to the first decimal number is selected as the preamble sequence used during access.

[0092] In one possible implementation, the processor further uses:

[0093] From the set of candidate preamble sequences, the i-th candidate preamble sequence is selected as the preamble sequence used during access; wherein i is the first decimal number, or is determined based on the first decimal number and the total number of elements contained in the set of candidate preamble sequences.

[0094] One possible implementation is that the resource set consists of at least one of time-domain resources and frequency-domain resources for transmitting the preamble, or consists of time-frequency resources for transmitting the preamble.

[0095] In one possible implementation, when each bit in the second sub-bit sequence is associated with a resource in the resource set, the processor further uses:

[0096] Determine whether the binary value of each bit in the second sub-bit sequence is a preset value; wherein, the preset value is binary data 0 or 1;

[0097] If the binary value is the preset value, then the resource associated with the corresponding bit in the resource set is used as the resource required for the preamble sequence used during access.

[0098] In one possible implementation, when each bit sequence of length equal to the length of the second sub-bit sequence is associated with a resource in the resource set, the processor further uses:

[0099] Convert the second sub-bit sequence into a base 20 number;

[0100] From the resource set, the j-th resource is selected as the resource required for the preamble sequence used during access; wherein, j is the second decimal data, or is determined based on the second decimal number and the total number of resources contained in the resource set.

[0101] In one possible implementation, when the time-frequency resources for transmitting the preamble in the resource set are continuous, the processor further uses:

[0102] According to the second sequence partitioning rule, the third and fourth sub-bit sequences are obtained from the second sub-bit sequence; wherein, the second sequence partitioning rule is a rule that divides the second sub-bit sequence into two parts;

[0103] Based on the third sub-bit sequence, a first time-domain resource is determined from the time-domain resource set corresponding to the time-frequency resource set; based on the fourth sub-bit sequence, a first frequency-domain resource is determined from the frequency-domain resource set corresponding to the time-frequency resource set.

[0104] The time-frequency resources corresponding to the first time-domain resources and the first frequency-domain resources are used as the resources required for the preamble sequence used during access.

[0105] In one possible implementation, when each bit in the third sub-bit sequence is associated with a time-domain resource in the time-domain resource set, the processor further uses:

[0106] Determine whether the binary value of each bit in the third sub-bit sequence is a preset value; wherein, the preset value is binary data 0 or 1;

[0107] If the binary value is the preset value, then the time-domain resources associated with the corresponding bit in the time-domain resource set are taken as the first time-domain resource.

[0108] In one possible implementation, when each bit sequence of length equal to the length of the third sub-bit sequence is associated with a time-domain resource in the time-domain resource set, the processor further uses:

[0109] Convert the third sub-bit sequence into a 30-base number;

[0110] From the set of time-domain resources, the x-th time-domain resource is selected as the first time-domain resource; wherein, x is the thirtieth decimal number, or is determined based on the thirtieth decimal number and the total number of time-domain resources contained in the set of time-domain resources.

[0111] In one possible implementation, when each bit in the fourth sub-bit sequence is associated with a frequency domain resource in the frequency domain resource set, the processor further uses:

[0112] Determine whether the binary value of each bit in the fourth sub-bit sequence is a preset value; wherein, the preset value is binary data 0 or 1;

[0113] If the binary value is the preset value, then the frequency domain resource associated with the corresponding bit in the frequency domain resource set is taken as the first frequency domain resource.

[0114] In one possible implementation, when each bit sequence of length equal to the length of the fourth sub-bit sequence is associated with a frequency domain resource in the frequency domain resource set, the processor further uses:

[0115] Convert the fourth sub-bit sequence into a fourth decimal number;

[0116] From the set of frequency domain resources, the y-th frequency domain resource is selected as the first frequency domain resource; wherein, y is the fortieth decimal data, or is determined based on the fortieth decimal number and the total number of frequency domain resources contained in the set of frequency domain resources.

[0117] Fourthly, embodiments of the present invention provide a base station, including a memory, a transceiver, and a processor:

[0118] A memory for storing computer programs; a transceiver for sending and receiving data under the control of the processor; and a processor for reading the computer programs from the memory and performing the following operations:

[0119] Receive the preamble sequence and the Physical Uplink Shared Channel (PUSCH) data;

[0120] Based on the position data of the received preamble sequence in the candidate preamble sequence set, a first sub-bit sequence is determined; and based on the position data of the resource carrying the preamble sequence in the resource set, a second sub-bit sequence is determined.

[0121] After confirming that the preamble sequence is correct, the first sub-bit sequence and the second sub-bit sequence are merged into one sequence according to the first sequence partitioning rule to obtain the bit sequence associated with the PUSCH data; the first sequence partitioning rule is the rule of dividing the bit sequence into two parts;

[0122] The PUSCH data is received using the bit sequence associated with it, the receiving process including descrambling or verifying the PUSCH data.

[0123] In one possible implementation, the processor further uses:

[0124] The position data of the received preamble sequence in the candidate preamble sequence set is converted into binary data and used as the first sub-bit sequence; wherein, the position data of the received preamble sequence in the candidate preamble sequence set is a decimal number;

[0125] Alternatively, the first sub-bit sequence can be determined based on the position data of the received preamble sequence in the candidate preamble sequence set and the total number of elements contained in the candidate sequence set.

[0126] One possible implementation is that the resource set consists of at least one of time-domain resources and frequency-domain resources for transmitting preambles, or time-frequency resources for transmitting preambles.

[0127] In one possible implementation, when each bit in the second sub-bit sequence is associated with a resource in the resource set, the processor further uses:

[0128] An initial sequence is constructed by considering whether each of the multiple consecutive resources carries the preamble sequence; wherein, when the preamble sequence is received on the resource, the value of the corresponding bit in the initial sequence is set to a preset value, and when the preamble sequence is not received on the resource, the value of the corresponding bit in the initial sequence is set to the inverted value of the preset value, wherein the preset value is 0 or 1;

[0129] Construct at least one sequence containing the initial sequence and having the stated length as the second sub-bit sequence.

[0130] In one possible implementation, when each bit sequence of length equal to the length of the second sub-bit sequence is associated with a resource in the resource set, the processor further uses:

[0131] The position data of the resource carrying the preamble sequence in the resource set is converted into binary data, which is used as the second sub-bit sequence; wherein, the position data of the resource carrying the preamble sequence in the resource set is a decimal number;

[0132] Alternatively, the second sub-bit sequence can be determined based on the position data of the resource carrying the preamble sequence in the resource set and the total number of elements contained in the resource set.

[0133] In one possible implementation, when the time-frequency resources in the resource set are continuous, the processor further uses:

[0134] The third sub-bit sequence is determined based on the position data of the time-domain resource corresponding to the time-frequency resource carrying the preamble sequence in the time-domain resource set.

[0135] The fourth sub-bit sequence is determined based on the position data of the frequency domain resource corresponding to the time-frequency resource carrying the preamble sequence in the frequency domain resource set;

[0136] According to the second sequence partitioning rule, the third sub-bit sequence and the fourth sub-bit sequence are merged into the second sub-bit sequence; wherein, the second sequence partitioning rule is the rule for dividing the second sub-bit sequence into two parts.

[0137] In one possible implementation, the processor further uses:

[0138] The position data of the time-domain resource carrying the preamble sequence in the time-domain resource set is converted into binary data and used as the third sub-bit sequence; wherein, the position data of the time-domain resource carrying the preamble sequence in the time-domain resource set is a decimal number;

[0139] Alternatively, the third sub-bit sequence can be determined based on the position data of the time-domain resource carrying the preamble sequence in the time-domain resource set, and the total number of elements contained in the time-domain resource set.

[0140] In one possible implementation, the processor further uses:

[0141] The position data of the frequency domain resource carrying the preamble sequence in the frequency domain resource set is converted into binary data and used as the fourth sub-bit sequence; wherein, the position data of the frequency domain resource carrying the preamble sequence in the frequency domain resource set is a decimal number;

[0142] Alternatively, the fourth sub-bit sequence can be determined based on the position data of the frequency domain resources carrying the preamble sequence in the frequency domain resource set, and the total number of elements contained in the frequency domain resource set.

[0143] Fifthly, embodiments of the present invention provide a terminal, including:

[0144] A partitioning unit is used to determine the bit sequence associated with the Physical Uplink Shared Channel (PUSCH) data to be transmitted; and to obtain a first sub-bit sequence and a second sub-bit sequence from the bit sequence according to a first sequence partitioning rule; the first sequence partitioning rule is a rule that divides the bit sequence into two parts.

[0145] The determining unit is configured to determine, based on the first sub-bit sequence, a preamble sequence to be used during access from a set of candidate preamble sequences; and, based on the second sub-bit sequence, determine the resources required to transmit the preamble sequence to be used during access from a set of resources used by the Physical Random Access Channel (PRACH) for transmitting the preamble sequence.

[0146] The transmitting unit is configured to transmit the preamble sequence used during access on the resources required for the preamble sequence used during access, and to transmit the PUSCH data after transmitting the preamble sequence used during access.

[0147] In one possible implementation, the partitioning unit is further configured to:

[0148] From the PUSCH data, obtain at least one of the following sequences: the sequence corresponding to the cyclic redundancy check bit, the terminal identifier, and the sequence corresponding to the feature bit in the PUSCH data;

[0149] The at least one sequence is used as a bit sequence associated with the PUSCH data.

[0150] One possible implementation includes the feature bits:

[0151] The first N bits of the PUSCH data; where N is a positive integer;

[0152] Or, the last N bits of the PUSCH data;

[0153] Alternatively, N bits determined from the PUSCH data according to preset rules.

[0154] One possible implementation, the first sequence partitioning rule includes:

[0155] The bit sequence is divided into two parts, which may be continuous or non-contiguous.

[0156] In one possible implementation, the two parts of the sequence are continuous or non-contiguous, and their positions in the bit sequence do not overlap or partially overlap.

[0157] In one possible implementation, the determining unit is further configured to:

[0158] Convert the first sub-bit sequence into a first decimal number;

[0159] From the set of candidate preamble sequences, a candidate preamble sequence corresponding to the first decimal number is selected as the preamble sequence used during access.

[0160] In one possible implementation, the determining unit is further configured to:

[0161] From the set of candidate preamble sequences, the i-th candidate preamble sequence is selected as the preamble sequence used during access; wherein i is the first decimal number, or is determined based on the first decimal number and the total number of elements contained in the set of candidate preamble sequences.

[0162] One possible implementation is that the resource set consists of at least one of time-domain resources and frequency-domain resources for transmitting the preamble, or consists of time-frequency resources for transmitting the preamble.

[0163] In one possible implementation, when each bit in the second sub-bit sequence is associated with a resource in the resource set, the determining unit is further configured to:

[0164] Determine whether the binary value of each bit in the second sub-bit sequence is a preset value; wherein, the preset value is binary data 0 or 1;

[0165] If the binary value is the preset value, then the resource associated with the corresponding bit in the resource set is used as the resource required for the preamble sequence used during access.

[0166] In one possible implementation, when each bit sequence of length equal to the length of the second sub-bit sequence is associated with a resource in the resource set, the determining unit is further configured to:

[0167] Convert the second sub-bit sequence into a base 20 number;

[0168] From the resource set, the j-th resource is selected as the resource required for the preamble sequence used during access; wherein, j is the second decimal data, or is determined based on the second decimal number and the total number of resources contained in the resource set.

[0169] In one possible implementation, when the time-frequency resources for transmitting the preamble in the resource set are continuous, the determining unit is further configured to:

[0170] According to the second sequence partitioning rule, the third and fourth sub-bit sequences are obtained from the second sub-bit sequence; wherein, the second sequence partitioning rule is a rule that divides the second sub-bit sequence into two parts;

[0171] Based on the third sub-bit sequence, a first time-domain resource is determined from the time-domain resource set corresponding to the time-frequency resource set; based on the fourth sub-bit sequence, a first frequency-domain resource is determined from the frequency-domain resource set corresponding to the time-frequency resource set.

[0172] The time-frequency resources corresponding to the first time-domain resources and the first frequency-domain resources are used as the resources required for the preamble sequence used during access.

[0173] In one possible implementation, when each bit in the third sub-bit sequence is associated with a time-domain resource in the time-domain resource set, the determining unit is further configured to:

[0174] Determine whether the binary value of each bit in the third sub-bit sequence is a preset value; wherein, the preset value is binary data 0 or 1;

[0175] If the binary value is the preset value, then the time-domain resources associated with the corresponding bit in the time-domain resource set are taken as the first time-domain resource.

[0176] In one possible implementation, when each bit sequence of length equal to the length of the third sub-bit sequence is associated with a time-domain resource in the time-domain resource set, the determining unit is further configured to:

[0177] Convert the third sub-bit sequence into a 30-base number;

[0178] From the set of time-domain resources, the x-th time-domain resource is selected as the first time-domain resource; wherein, x is the thirtieth decimal number, or is determined based on the thirtieth decimal number and the total number of time-domain resources contained in the set of time-domain resources.

[0179] In one possible implementation, when each bit in the fourth sub-bit sequence is associated with a frequency domain resource in the frequency domain resource set, the determining unit is further configured to:

[0180] Determine whether the binary value of each bit in the fourth sub-bit sequence is a preset value; wherein, the preset value is binary data 0 or 1;

[0181] If the binary value is the preset value, then the frequency domain resource associated with the corresponding bit in the frequency domain resource set is taken as the first frequency domain resource.

[0182] In one possible implementation, when each bit sequence of length equal to the length of the fourth sub-bit sequence is associated with a frequency domain resource in the frequency domain resource set, the determining unit is further configured to:

[0183] Convert the fourth sub-bit sequence into a fourth decimal number;

[0184] From the set of frequency domain resources, the y-th frequency domain resource is selected as the first frequency domain resource; wherein, y is the fortieth decimal data, or is determined based on the fortieth decimal number and the total number of frequency domain resources contained in the set of frequency domain resources.

[0185] Sixthly, embodiments of the present invention provide a base station, comprising:

[0186] The receiving unit is used to receive the preamble sequence and the Physical Uplink Shared Channel (PUSCH) data.

[0187] The determining unit is configured to determine a first sub-bit sequence based on the position data of the received preamble sequence in a set of candidate preamble sequences; and to determine a second sub-bit sequence based on the position data of the resource carrying the preamble sequence in a set of resources.

[0188] The merging unit is used to merge the first sub-bit sequence and the second sub-bit sequence into one sequence according to the first sequence partitioning rule after determining that the preamble sequence is correct, so as to obtain the bit sequence associated with the PUSCH data; the first sequence partitioning rule is the rule of dividing the bit sequence into two parts.

[0189] A processing unit is configured to receive and process the PUSCH data using the bit sequence associated with the PUSCH data, the receiving and processing including descrambling or verifying the PUSCH data.

[0190] In one possible implementation, the determining unit is further configured to:

[0191] The position data of the received preamble sequence in the candidate preamble sequence set is converted into binary data and used as the first sub-bit sequence; wherein, the position data of the received preamble sequence in the candidate preamble sequence set is a decimal number;

[0192] Alternatively, the first sub-bit sequence can be determined based on the position data of the received preamble sequence in the candidate preamble sequence set and the total number of elements contained in the candidate sequence set.

[0193] One possible implementation is that the resource set consists of at least one of time-domain resources and frequency-domain resources for transmitting preambles, or time-frequency resources for transmitting preambles.

[0194] In one possible implementation, when each bit in the second sub-bit sequence is associated with a resource in the resource set, the determining unit is further configured to:

[0195] An initial sequence is constructed by considering whether each of the multiple consecutive resources carries the preamble sequence; wherein, when the preamble sequence is received on the resource, the value of the corresponding bit in the initial sequence is set to a preset value, and when the preamble sequence is not received on the resource, the value of the corresponding bit in the initial sequence is set to the inverted value of the preset value, wherein the preset value is 0 or 1;

[0196] Construct at least one sequence containing the initial sequence and having the stated length as the second sub-bit sequence.

[0197] In one possible implementation, when each bit sequence of length equal to the length of the second sub-bit sequence is associated with a resource in the resource set, the determining unit is further configured to:

[0198] The position data of the resource carrying the preamble sequence in the resource set is converted into binary data, which is used as the second sub-bit sequence; wherein, the position data of the resource carrying the preamble sequence in the resource set is a decimal number;

[0199] Alternatively, the second sub-bit sequence can be determined based on the position data of the resource carrying the preamble sequence in the resource set and the total number of elements contained in the resource set.

[0200] In one possible implementation, when the time-frequency resources in the resource set are continuous, the determining unit is further configured to:

[0201] The third sub-bit sequence is determined based on the position data of the time-domain resource corresponding to the time-frequency resource carrying the preamble sequence in the time-domain resource set.

[0202] The fourth sub-bit sequence is determined based on the position data of the frequency domain resource corresponding to the time-frequency resource carrying the preamble sequence in the frequency domain resource set;

[0203] According to the second sequence partitioning rule, the third sub-bit sequence and the fourth sub-bit sequence are merged into the second sub-bit sequence; wherein, the second sequence partitioning rule is the rule for dividing the second sub-bit sequence into two parts.

[0204] In one possible implementation, the determining unit is further configured to:

[0205] The position data of the time-domain resource carrying the preamble sequence in the time-domain resource set is converted into binary data and used as the third sub-bit sequence; wherein, the position data of the time-domain resource carrying the preamble sequence in the time-domain resource set is a decimal number;

[0206] Alternatively, the third sub-bit sequence can be determined based on the position data of the time-domain resource carrying the preamble sequence in the time-domain resource set, and the total number of elements contained in the time-domain resource set.

[0207] In one possible implementation, the determining unit is further configured to:

[0208] The position data of the frequency domain resource carrying the preamble sequence in the frequency domain resource set is converted into binary data and used as the fourth sub-bit sequence; wherein, the position data of the frequency domain resource carrying the preamble sequence in the frequency domain resource set is a decimal number;

[0209] Alternatively, the fourth sub-bit sequence can be determined based on the position data of the frequency domain resources carrying the preamble sequence in the frequency domain resource set, and the total number of elements contained in the frequency domain resource set.

[0210] In a seventh aspect, embodiments of the present invention also provide a processor-readable storage medium storing a computer program for causing the processor to perform the method as described in the first or second aspect.

[0211] Through the technical solutions in one or more of the above embodiments of the present invention, the embodiments of the present invention have at least the following technical effects:

[0212] In the embodiments provided by this invention, after determining the bit sequence associated with PUSCH data, the bit sequence is divided into a first sub-bit sequence and a second sub-bit sequence according to a first sequence partitioning rule. Then, based on the first sub-bit sequence, the preamble sequence used for access is determined from the candidate preamble sequence set. And, based on the second sub-bit sequence, the resources required to send the preamble sequence used for access are determined from the resource set used for transmitting the preamble sequence in PRACH. The preamble sequence used for access is sent on the resources required for the preamble sequence used for access, and after sending the preamble sequence used for access, PUSCH data is sent. This allows some data information in the bit sequence associated with PUSCH data to be carried by the resources used for sending the preamble sequence, thereby reducing the information carried by the preamble sequence and thus reducing the number of sequences in the candidate preamble sequence set. This reduces the complexity of preamble sequence detection and improves the detection capability of PRACH. Attached Figure Description

[0213] Figure 1 A schematic diagram of four long PRACH Preamble formats with a sequence length of 839;

[0214] Figure 2 This is a schematic diagram of a PRACH Preamble format with a length of 139.

[0215] Figure 3 This is a block diagram illustrating the principle of non-coordinated random access and transmission technologies.

[0216] Figure 4 A flowchart of a data transmission method on the terminal side provided in an embodiment of the present invention;

[0217] Figure 5 This is a schematic diagram illustrating the division of a bit sequence associated with PUSCH data to be transmitted into two consecutive sequences, as provided in an embodiment of the present invention.

[0218] Figure 6 This is a schematic diagram illustrating the division of a bit sequence associated with PUSCH data to be transmitted into two non-contiguous parts, as provided in an embodiment of the present invention.

[0219] Figure 7This is a schematic diagram of a time-domain resource set provided in an embodiment of the present invention;

[0220] Figure 8 This is a schematic diagram of the frequency domain resource set provided in an embodiment of the present invention;

[0221] Figure 9 This is a schematic diagram of a time-frequency resource set for transmitting preambles provided in an embodiment of the present invention;

[0222] Figure 10 A schematic diagram of a time-frequency resource set provided in an embodiment of the present invention;

[0223] Figure 11 A flowchart of a data transmission method on the base station side provided in an embodiment of the present invention;

[0224] Figure 12 A schematic diagram illustrating the merging of the first sub-bit sequence and the second sub-bit sequence provided in an embodiment of the present invention;

[0225] Figure 13 This is a schematic diagram of the structure of a terminal provided in an embodiment of the present invention;

[0226] Figure 14 This is a schematic diagram of the structure of a base station provided in an embodiment of the present invention;

[0227] Figure 15 This is a schematic diagram of another terminal structure provided in an embodiment of the present invention;

[0228] Figure 16 This is a schematic diagram of another base station structure provided in an embodiment of the present invention. Detailed Implementation

[0229] In this embodiment of the invention, the term "and / or" describes the relationship between associated objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, or B existing alone. The character " / " generally indicates that the preceding and following associated objects have an "or" relationship.

[0230] In the embodiments of this application, the term "multiple" refers to two or more, and other quantifiers are similar.

[0231] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of this application, and not all of the embodiments. Based on the embodiments of this application, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of this application.

[0232] The technical solutions provided in this application can be applied to various systems, especially 5G systems. For example, applicable systems include Global System for Mobile Communication (GSM), Code Division Multiple Access (CDMA), Wideband Code Division Multiple Access (WCDMA) General Packet Radio Service (GPRS), Long Term Evolution (LTE), LTE Frequency Division Duplex (FDD), LTE Time Division Duplex (TDD), Long Term Evolution Advanced (LTE-A), Universal Mobile Telecommunication System (UMTS), Worldwide Interoperability for Microwave Access (WiMAX), and 5G New Radio (NR). All of these systems include terminal equipment and network equipment. The systems may also include a core network component, such as Evolved Packet System (EPS) and 5G system (5GS).

[0233] The terminal devices involved in the embodiments of this application can be devices that provide voice and / or data connectivity to users, handheld devices with wireless connectivity, or other processing devices connected to a wireless modem. The names of the terminal devices may differ in different systems; for example, in a 5G system, a terminal device can be called User Equipment (UE). Wireless terminal devices can communicate with one or more core networks (CNs) via a Radio Access Network (RAN). Wireless terminal devices can be mobile terminal devices, such as mobile phones (or "cellular" phones) and computers with mobile terminal devices, for example, portable, pocket-sized, handheld, computer-embedded, or vehicle-mounted mobile devices that exchange voice and / or data with the RAN. Examples include Personal Communication Service (PCS) phones, cordless phones, Session Initiated Protocol (SIP) phones, Wireless Local Loop (WLL) stations, and Personal Digital Assistants (PDAs). Wireless terminal equipment can also be referred to as a system, subscriber unit, subscriber station, mobile station, mobile station, remote station, access point, remote terminal, access terminal, user terminal, user agent, or user device, but is not limited to these terms in the embodiments of this application.

[0234] The network device involved in this application embodiment can be a base station, which may include multiple cells providing services to terminals. Depending on the specific application, a base station may also be called an access point, or a device in an access network that communicates with a wireless terminal device through one or more sectors on the air interface, or other names. The network device can be used to exchange received air frames with Internet Protocol (IP) packets, acting as a router between the wireless terminal device and the rest of the access network, where the rest of the access network may include an Internet Protocol (IP) communication network. The network device can also coordinate the attribute management of the air interface. For example, the network equipment involved in the embodiments of this application can be a base transceiver station (BTS) in a Global System for Mobile communications (GSM) or Code Division Multiple Access (CDMA), a NodeB in a Wide-band Code Division Multiple Access (WCDMA) system, an evolved Node B (eNB or e-NodeB) in a long term evolution (LTE) system, a 5G base station (gNB) in a next generation system, a Home evolved Node B (HeNB), a relay node, a femto, a pico, etc., and is not limited in the embodiments of this application. In some network structures, the network equipment may include centralized unit (CU) nodes and distributed unit (DU) nodes, and the centralized unit and distributed unit may be geographically separated.

[0235] To enable those skilled in the art to fully understand this solution, the following introduction to the related technologies will be provided before formally describing the solution:

[0236] I. PRACH transmission scheme in NR.

[0237] NR supports four long random access preamble formats with a length of 839 and nine short preamble formats with a length of 139. Table 1 shows the four long preamble formats with a sequence length of 839.

[0238] Table 1

[0239]

[0240] Table 1 shows the subcarrier spacing, time length, CP length, restricted set, and application scenarios for four Preamble formats with a sequence length of 839. Among them, L... RA Δf represents the length of the Preamble sequence. RA N represents the sub-carrier space (SCS) of the preamble sequence. u Indicates the duration of the Preamble sequence. N represents the duration of the cyclic prefix (CP). u and The unit is Tc = 1 / (Δf) max ·N f ), Δf max =480×10 3 H z N f =4096, k=T s / T c =64, where Ts = 1 / (Δf) ref ·N f,ref ), Δf ref =15×10 3 Hz, N f,ref =2048. Compared to PRACH Preamble format 0, PRACH Preamble format 1 has a longer CP and a longer duration, achieving a coverage range of 100km. PRACH Preamble format 3 uses a larger SCS to support high-speed mobile scenarios. The guard time (GT) is not explicitly given in Table 1, but is implicitly included in the PRACH Preamble format by aligning the time slot containing the PRACH Preamble with other time slots based on a 1ms boundary.

[0241] Please see Figure 1This diagram illustrates four long PRACH Preamble formats with a sequence length of 839. Preamble formats 0, 1, 2, and 3 each contain a Preamble sequence corresponding to an Orthogonal Frequency Division Multiplexing (OFDM) symbol. It supports two SCS (Sequence Size Tables) of 1.25 kHz and 5 kHz, and two cyclic shift-restricted sets: Restriction Type A and Restriction Type B. The maximum frequency shift ranges supported by Restriction Type A and Restriction Type B are SCS and 2SCS, respectively. The set corresponding to Restriction Type A is suitable for ordinary mobile scenarios, with a corresponding Doppler frequency shift within SCS; the set corresponding to Restriction Type B is applied to ultra-high-speed scenarios, with a corresponding Doppler frequency shift between SCS and 2SCS.

[0242] Please refer to Table 2, which shows nine short PRACH Preamble formats with a sequence length of 139. (Δf) RA =15×2 μ kHz, u = {0, 1, 2, 3}).

[0243] Table 2

[0244]

[0245]

[0246] Table 2 lists the 139-sequence preamble sequence for the 6GHz band, smaller cell coverage, and scenarios where base stations use multi-beam scanning; it supports four SCSs: 15kHz, 30kHz, 60kHz, and 120kHz. Because the SCS is not less than 15kHz, restricted sets are not supported. Table 2 defines the subcarrier spacing, CP length, sequence length, and application scenarios for nine independent preamble formats (A1, A2, A3, B1, B2, B3, B4, C0, and C2). The meanings of the parameters are the same as in Table 1. In PRACH time-frequency resource configuration, to utilize time-frequency resources more efficiently and reduce signaling overhead, the preamble formats A1, A2, A3, B1, B4, C0, and C2 in Table 2 are configured and used individually. B2 and B3 can only be combined with A2 and A3 to form A2 / B2 and A3 / B3, respectively. B1 can be configured and used individually or combined with A1 to form A1 / B1. Therefore, for a Preamble format of length 139, a total of 10 system-configurable Preamble formats are supported: A1, A2, A3, B1, B4, A1 / B1, A2 / B2, A3 / B3, C0, and C2. Based on the ratio of the number of OFDM symbols in a time slot (14 symbols) to the number of OFDM symbols in a Preamble format, the maximum random access opportunities (ROs) for the Preamble formats A1, A2, A3, B1, B4, A1 / B1, A2 / B2, A3 / B3, C0, and C2 in a time slot are 6, 3, 2, 7, 1, 7, 3, 2, 7, and 2, respectively. Taking the A1 / B1 format as an example, A1 occupies the first 12 OFDM symbols of a time slot, and B1 occupies the last 2 OFDM symbols. Figure 2 The image shows a schematic diagram of a PRACHPreamble format with a length of 139.

[0247] II. Non-coordinated random access and transmission technologies.

[0248] Uncoordinated random access and transmission techniques are characterized by achieving both random access and multiple access simultaneously without network coordination. Specifically, the lack of network coordination means that the network does not need to verify the terminal's access identity or schedule transmission resources. Please refer to [link to relevant documentation]. Figure 3 This is a block diagram illustrating the principle of non-coordinated random access and transmission technology.

[0249] Figure 3 In this context, the additional bits are generated from the information bits, such as the last A bits of the information bits, or the cyclic redundancy check bits of the information bits. The information bits can be user identity information and user data information.

[0250] The terminal generates additional bits based on the information bits, and generates control information 1 and control information 2 based on the information bits. It encodes the information bits using control information 1, and generates a data sequence using control information 2 and the encoded information bits. At the same time, it encodes and maps the additional bits to generate a preamble sequence. Finally, it frames and sends the preamble sequence and data sequence according to the period until the maximum number of times the data sequence is sent is reached, or it receives confirmation information from the base station indicating that the network has correctly received the information bits, or the network broadcasts a message to stop access transmission.

[0251] Non-coordinated random access and transmission technology is a fusion and upgrade of random access technology and multiple access transmission technology. It no longer treats initial access and data transmission as two independent processes, but merges them into one process to support the access and transmission of a large number of terminals, reduce latency, and improve the success rate of access and transmission.

[0252] The significance of non-coordinated random access and transport technologies:

[0253] (1) By combining the transmission and processing of user identity information and user data information, the dynamic coordination on the network side is simplified, the number of users accessing the network is effectively increased, and it is suitable for the access and transmission of massive terminals.

[0254] (2) By integrating the initial access and data transmission processes, the receiving end can simultaneously obtain user identity information and user data information, shortening the transmission delay and making it suitable for burst transmission of small packet data.

[0255] (3) By using enhanced unequal diversity transmission technology, unequal diversity transmission can be achieved for different user sets, effectively improving the success rate of access and transmission, which is beneficial for the access and transmission of high-priority user sets.

[0256] Currently, non-coordinated random access and transmission technologies for 6G eliminate most of the coordination between the terminal and the network, supporting scenarios with a massive number of terminals. However, in non-coordinated random access and transmission technologies, PRACH is associated with PUSCH, and the preamble sequence of PRACH carries part of the PUSCH data information. Existing PRACH transmission schemes in NR do not support this approach. If a single preamble sequence carries all associated PUSCH information, the number of elements in the required preamble sequence candidate set is enormous, leading to poor PRACH detection performance.

[0257] Furthermore, in non-coordinated random access and transmission technologies, the access process and data transmission process occur simultaneously, rather than waiting until access is successful before data transmission. Therefore, PUSCH performance is affected by PRACH performance; PUSCH can only be solved when PRACH is resolved. This places high demands on PRACH performance, requiring PRACH performance to be significantly better than PUSCH performance. Poor PRACH performance, in turn, negatively impacts PUSCH performance. Therefore, improving PRACH performance in non-coordinated random access and transmission technologies is crucial.

[0258] To address the aforementioned issues, embodiments of this application provide a data transmission method, terminal, base station, and storage medium to resolve the technical problem of low PRACH performance in existing novel multiple access technologies.

[0259] The method and apparatus are based on the same concept of the application. Since the methods and apparatus solve problems in similar ways, the implementation of the apparatus and methods can refer to each other, and the repeated parts will not be described again.

[0260] Please refer to Figure 4 This invention provides a data transmission method applied to a terminal, and the processing procedure of the method is as follows.

[0261] Step 401: Determine the bit sequence associated with the Physical Uplink Shared Channel (PUSCH) data to be transmitted; according to the first sequence partitioning rule, obtain the first sub-bit sequence and the second sub-bit sequence from the bit sequence; the first sequence partitioning rule is the rule of dividing the bit sequence into two parts.

[0262] The bit sequence associated with PUSCH data can be any one or any combination of the following: the cyclic redundancy check (CRC) bit of PUSCH, the terminal identifier of the user terminal, or the feature bits in the PUSCH data.

[0263] One possible implementation is to determine the bit sequence associated with the Physical Uplink Shared Channel (PUSCH) data to be transmitted, which can be done in the following way:

[0264] From the PUSCH data, obtain at least one sequence from the sequence corresponding to the cyclic redundancy check bit, the terminal identifier, and the sequence corresponding to the feature bit in the PUSCH data; use the at least one sequence as the bit sequence associated with the PUSCH data.

[0265] The feature bits in the PUSCH data mentioned above can be the first N bits of the PUSCH data, where N is a positive integer; or the last N bits of the PUSCH data; or N bits determined from the PUSCH data according to a preset rule.

[0266] If the CRC check bit sequence of the PUSCH data to be sent is 1101000001101010, the CRC check bit sequence can be obtained from the PUSCH data to be sent and used as the bit sequence associated with the PUSCH data to be sent; or, if the terminal identifier sequence of the user terminal carried in the PUSCH data to be sent is 10000011010100, the terminal identifier sequence can be obtained from the PUSCH data to be sent and used as the bit sequence associated with the PUSCH data to be sent; or, the sequence composed of the CRC check bit and the terminal identifier can be obtained from the PUSCH data to be sent and used as the bit sequence associated with the PUSCH data to be sent; or, the sequence corresponding to the characteristic bits (such as the first N bits or the last N bits) in the PUSCH data to be sent, or the sequence corresponding to the N bits determined from the PUSCH data to be sent according to preset rules (such as a bit selection pattern), can be used as the bit sequence associated with the PUSCH data to be sent.

[0267] After determining the bit sequence associated with the PUSCH data to be sent, the first sub-bit sequence and the second sub-bit sequence can be obtained from the bit sequence associated with the PUSCH data to be sent according to the first sequence partitioning rule.

[0268] The first sequence partitioning rule includes dividing the bit sequence into two continuous or non-contiguous sequences. These two continuous or non-contiguous sequences do not overlap or only partially overlap in their positions within the bit sequence associated with the PUSCH data to be transmitted. The lengths of the first and second sub-bit sequences may be equal or unequal.

[0269] For example, see Figure 5 and Figure 6 , Figure 5 This is a schematic diagram illustrating the division of the bit sequence associated with the PUSCH data to be transmitted into two consecutive sequences, as provided in an embodiment of the present invention. Figure 6 This is a schematic diagram of dividing the bit sequence associated with the PUSCH data to be sent into two non-contiguous sequences, as provided in an embodiment of the present invention. It is assumed that the length of the bit sequence associated with the PUSCH data to be sent is 16, that is, there are 16 bits (0 to 15). This bit sequence associated with the PUSCH data to be sent is 1110010110000110.

[0270] If the first sequence partitioning rule is to divide the bit sequence associated with the PUSCH data to be transmitted into two consecutive sequences, then 1110010110000110 can be divided into two consecutive, non-overlapping sequences, such as... Figure 5 As shown in ①, it is divided into a first sub-bit sequence (11100101) and a second sub-bit sequence (10000110) of equal length, or as shown in ①. Figure 5 As shown in ②, the sequence is divided into a first sub-bit sequence (1110010) and a second sub-bit sequence (110000110) of unequal length; 1110010110000110 can be divided into two consecutive overlapping sequences, as shown in ②. Figure 5 As shown in ③, it is divided into a first sub-bit sequence (111001011) and a second sub-bit sequence (110000110) of equal length, or as shown in ③. Figure 5 As shown in ④, it is divided into a first sub-bit sequence (1110010110) and a second sub-bit sequence (110000110) of equal length.

[0271] If the first sequence partitioning rule divides the bit sequence associated with the PUSCH data to be transmitted into two non-contiguous sequences, then 1110010110000110 can be divided into two non-contiguous, non-overlapping sequences, such as... Figure 6 As shown in ①, it is divided into a first sub-bit sequence (10110010) and a second sub-bit sequence (11001001) of equal length, or as shown in ①. Figure 6 As shown in ②, the sequence is divided into a first sub-bit sequence (1001110010) and a second sub-bit sequence (110001) of unequal length; 1110010110000110 can be divided into two consecutive parts with overlap, as shown in ②. Figure 6 As shown in ③, it is divided into a first sub-bit sequence (101110010) and a second sub-bit sequence (110011001) of equal length, or as shown in ③. Figure 6 As shown in ④, it is divided into a first sub-bit sequence (1001110010) and a second sub-bit sequence (1101001) of equal length.

[0272] After obtaining the first sub-bit sequence and the second sub-bit sequence, step 402 can be executed.

[0273] Step 402: Based on the first sub-bit sequence, determine the preamble sequence to be used during access from the candidate preamble sequence set; and based on the second sub-bit sequence, determine the resources required to send the preamble sequence to be used during access from the resource set of the Physical Random Access Channel (PRACH) used for transmitting the preamble sequence.

[0274] Step 403: Send the preamble sequence used during access on the resources required for the preamble sequence used during access, and after sending the preamble sequence used during access, send PUSCH data.

[0275] In step 402, the sequence with a length equal to the length of the first sub-bit sequence corresponds one-to-one with the candidate preamble in the candidate preamble sequence set.

[0276] The preamble sequence for PUSCH data can be determined from the set of candidate preamble sequences based on the first sub-bit sequence, which can be achieved in the following way:

[0277] Convert the first sub-bit sequence into a first decimal number; select the candidate preamble sequence corresponding to the first decimal number from the candidate preamble sequence set as the preamble sequence to be used during access.

[0278] Selecting the candidate preamble sequence corresponding to the first decimal number from the candidate preamble sequence set as the preamble sequence to be used during access can be achieved in the following way:

[0279] From the set of candidate preamble sequences, the i-th candidate preamble sequence is selected as the preamble sequence to be used during access; where i is a decimal number, determined based on the decimal data and the total number of elements in the candidate preamble sequence set. Typically, the total number of elements in the candidate preamble set is 2-1. a , where 'a' is the total number of bits contained in the first sub-bit sequence (which is also the length of the first sub-bit sequence).

[0280] When i is determined based on the first decimal data and the total number of elements contained in the candidate preamble sequence set, i can be calculated using the following formula:

[0281] i = (k1 + x1) mod 2 a +y1 (1);

[0282] Where k1 is the first decimal number, a is the total number of bits in the first sub-bit sequence, and x1 and y1 are offset values, which can be set to constants. For example, setting both to constants 0 indicates no offset, setting x1 to 1 indicates an offset of 1 from k1 (i.e., k1+1), and setting y1 to 2 indicates (k1+1) mod 2. a Offset 2.

[0283] For example, assuming the first sub-bit sequence is 00010011 (occupying 8 bits), there are 2 sequences of length 8. 8 =256, the total number of elements in the candidate preamble set is 2. 8=256, meaning the candidate preamble set includes candidate preamble sequence 1 to candidate preamble sequence 256, which correspond one-to-one with 256 sequences of length 8. Convert 00010011 to decimal to get 19 (i.e., the first decimal number). Select the 19th candidate preamble sequence (i.e., candidate preamble sequence 19) in the candidate preamble set as the preamble sequence used when the terminal accesses the system.

[0284] Alternatively, i can be determined according to formula (1) (assuming x1 is 1 and y1 is 0), i = (19+1) mod 256 = 5, that is, the 5th candidate preamble sequence is selected from the candidate preamble sequence set as the preamble sequence used when the terminal accesses.

[0285] In the embodiments provided by this invention, the resource set used by RACH to transmit the preamble sequence consists of at least one of time-domain resources and frequency-domain resources used for transmitting the preamble, or it consists of time-frequency resources used for transmitting the preamble. The aforementioned time-domain resources, frequency-domain resources, and time-frequency resources used for transmitting the preamble can all be referred to as the preamble transmission occasion (TO). A frequency-domain resource can be a resource element (RE). The resource set composed of time-domain resources used for transmitting the preamble is called the time-domain resource set, the resource set composed of frequency-domain resources used for transmitting the preamble is called the frequency-domain resource set, and the resource set composed of time-frequency resources used for transmitting the preamble is called the time-frequency resource set.

[0286] The unit of a temporal resource set can be a time slot, subframe, or frame, etc. For example, a deca-ary resource set could be 1 frame, 1 time slot, 5 subframes, etc. The temporal resources corresponding to multiple preamble sequences in the temporal resource set can be continuous or non-contiguous. The lengths of the temporal resources carrying each preamble sequence can be equal or unequal, such as... Figure 7 The diagram shown is a schematic diagram of the time-domain resource set provided in an embodiment of the present invention. Figure 7 The diagram shows A) that the time-domain resources of multiple preamble sequences are continuous, and B) that the time-domain resources of multiple preamble sequences are discontinuous.

[0287] The unit of a frequency domain resource set can be a base block (RB), subcarrier, etc., such as a frequency domain resource set containing 30 RBs or 1024 subcarriers. The frequency domain resources corresponding to multiple preamble sequences in the frequency domain resource set can be continuous or discontinuous. The lengths of the frequency domain resources carrying each preamble sequence can be equal or unequal. Figure 8 The diagram shows a frequency domain resource set provided in an embodiment of the present invention. Figure 8 The diagram shows A) the frequency domain resources of multiple preamble sequences are continuous, and the frequency domain resources of multiple preamble sequences are discontinuous.

[0288] Please see Figure 9 This is a schematic diagram of a time-frequency resource set for transmitting preambles provided in an embodiment of the present invention. Figure 9 The time-frequency resource RE is shown in the figure. 11 ~RE 55 If RE 11 RE 22 RE 34 RE 43 RE 51 RE 53 These can be used to transmit preambles; multiple non-contiguous time-frequency resources constitute a time-frequency resource set; if REs are among them... 11 RE 22 RE 31 RE 12 RE 22 RE 32 RE 13 RE 23 RE 33 These consecutive time-frequency resources can be used to send preambles, and constitute a time-frequency resource set. Within the time-frequency resource set, these resources can be renumbered, such as renaming the time-frequency resource set {RE}. 11 RE 22 RE 34 RE 43 RE 51 RE 53 The time-frequency resources in the set {RE} are numbered sequentially from 1 to 6. 11 RE 22 RE 31 RE 12 RE 22 RE 32 RE 13 RE 23 RE 33 The time-frequency resources in} are numbered sequentially from 1 to 9.

[0289] One possible implementation is that, when each bit in the second sub-bit sequence is associated with a resource in the resource set, the resources required for transmitting the preamble sequence are determined from the resource set used by the Physical Random Access Channel (PRACH) for transmitting the preamble sequence, based on the second sub-bit sequence. This can be achieved in the following way:

[0290] Determine whether the binary value of each bit in the second sub-bit sequence is a preset value; where the preset value is binary data 0 or 1; if the binary value is a preset value, then the resource associated with the corresponding bit in the resource set is used as the resource required for the preamble sequence used during access.

[0291] For example, when each bit in the second sub-bit sequence is associated with a resource in the resource set (i.e., the bits in the second sub-bit sequence correspond one-to-one with the resources in the resource set), assuming the second sub-bit sequence is 00101001 and the resource set contains a total of 8 elements.

[0292] If the above resource set is a time-domain resource set, and the preset value is binary data 1, it can be determined that the binary values ​​corresponding to the 3rd, 5th, and 8th bits in the second sub-bit sequence are all the preset value 1. Therefore, the time-domain resources associated with the 3rd, 5th, and 8th bits in the second sub-bit sequence are selected from the time-domain resource set to carry the preamble sequence used by the terminal during access (i.e., the preamble sequence is repeatedly sent 3 times). The preamble sequence used by the terminal during access is sent to the base station on the above 3 time-frequency resources respectively. After sending the preamble sequence used during access, the PUSCH data to be sent is sent. For the base station; when the preset value is binary data 0, it can be determined that the binary values ​​corresponding to the 1st, 2nd, 4th, 6th, and 7th bits in the second sub-bit sequence are all the preset value 0. Therefore, the time-domain resources associated with the 1st, 2nd, 4th, 6th, and 7th bits in the second sub-bit sequence are selected from the time-domain resource set to carry the preamble sequence used by the terminal for access (i.e., the preamble sequence is repeatedly sent 5 times). The preamble sequence used by the terminal for access is sent to the base station on the above 5 time-frequency resources respectively. After sending the preamble sequence used for access, the PUSCH data to be sent is sent to the base station.

[0293] If the aforementioned resource set is a frequency domain resource set, and the preset value is binary data 1, it can be determined that the binary values ​​corresponding to the 3rd, 5th, and 8th bits in the second sub-bit sequence are all the preset value 1. Therefore, the frequency domain resources associated with the 3rd, 5th, and 8th bits in the second sub-bit sequence are selected from the frequency domain resource set to carry the preamble sequence used by the terminal during access (i.e., the preamble sequence is repeatedly sent 3 times). The preamble sequence used by the terminal during access is sent to the base station on the aforementioned 3 frequency domain resources. After sending the preamble sequence used during access, the PUSCH data to be sent is sent. For the base station; when the preset value is binary data 0, it can be determined that the binary values ​​corresponding to the 1st, 2nd, 4th, 6th, and 7th bits in the second sub-bit sequence are all the preset value 0. Therefore, the frequency domain resources associated with the 1st, 2nd, 4th, 6th, and 7th bits in the second sub-bit sequence are selected from the frequency domain resource set to carry the preamble sequence used by the terminal for access (i.e., the preamble sequence is repeatedly sent 5 times). The preamble sequence used by the terminal for access is sent to the base station on the above 5 frequency domain resources respectively. After sending the preamble sequence used for access, the PUSCH data to be sent is sent to the base station.

[0294] If the above resource set is a time-frequency resource set, and the preset value is binary data 1, it can be determined that the binary values ​​corresponding to the 3rd, 5th, and 8th bits in the second sub-bit sequence are all the preset value 1. Therefore, the time-frequency resources associated with the 3rd, 5th, and 8th bits in the second sub-bit sequence are selected from the time-frequency resource set to carry the preamble sequence used by the terminal during access (i.e., the preamble sequence is repeatedly sent 3 times). The preamble sequence used by the terminal during access is sent to the base station on the above 3 time-frequency resources respectively. After sending the preamble sequence used during access, the PUSCH data to be sent is sent. For the base station; when the preset value is binary data 0, it can be determined that the binary values ​​corresponding to the 1st, 2nd, 4th, 6th, and 7th bits in the second sub-bit sequence are all the preset value 0. Therefore, the time-frequency resources associated with the 1st, 2nd, 4th, 6th, and 7th bits in the second sub-bit sequence are selected from the time-frequency resource set to carry the preamble sequence used by the terminal for access (i.e., the preamble sequence is repeatedly sent 5 times). The preamble sequence used by the terminal for access is sent to the base station on the above 5 time-frequency resources respectively. After sending the preamble sequence used for access, the PUSCH data to be sent is sent to the base station.

[0295] One possible implementation is that when each bit sequence of length 1 is associated with a resource in the resource set, the resources required for transmitting the preamble sequence are determined from the resource set used by the Physical Random Access Channel (PRACH) for transmitting the preamble sequence based on the second sub-bit sequence. This can be achieved in the following way:

[0296] Convert the second sub-bit sequence into a decimal number; select the j-th resource from the resource set as the resource required for the preamble sequence used during access; where j is a decimal number, or determined based on the decimal number and the total number of resources contained in the resource set.

[0297] When j is determined based on a decimal number and the total number of elements in the resource set, j can be calculated using the following formula:

[0298] j = (k² + x²) mod 2 b +y2 (2);

[0299] Where k2 is the 20th decimal number, b is the total number of bits in the second sub-bit sequence, and x2 and y2 are offset values, which can be set to constants. For example, setting both to constants 0 indicates no offset, setting x2 to 1 indicates an offset of 1 from k2 (i.e., k2+1), and setting y2 to 2 indicates (k2+1) mod 2. b Offset 2.

[0300] For example, when each bit sequence of length 3 is associated with a resource in the resource set (i.e., multiple bit sequences of length 3 correspond one-to-one with resources in the resource set), assuming the length of the second sub-bit sequence is 3, then a bit sequence of length 3 can be associated with 2. 3 = 8 resources are associated, that is, the set of bit sequences with a length equal to the length of the second sub-bit sequence (3) includes the 8 bit sequences [000, 001…111], and these 8 bit sequences can correspond one-to-one with the 8 resources in the resource set.

[0301] If the resource set is a time-domain resource set, convert 011 to decimal to obtain the second decimal number 3. The third time-domain resource can be selected from the time-domain resource set to carry the preamble sequence used when the terminal accesses the network. The preamble sequence used when the terminal accesses the network is sent to the base station on the third time-domain resource. After sending the preamble sequence used when accessing the network, the PUSCH data to be sent is sent to the base station. Alternatively, the above formula (2) can be used to determine a time-domain resource from the time-domain resource set to carry the preamble sequence used when the terminal accesses the network. For example, assuming x2 = 2 and y2 = 1, according to the above formula (2), j = (3 + 2) mod 8 + 1 = 6 can be determined. The sixth time-domain resource can be selected from the time-domain resource set to carry the preamble sequence used when the terminal accesses the network and sent to the base station. The preamble sequence used when the terminal accesses the network is sent on the sixth time-domain resource. After sending the preamble sequence used when accessing the network, the PUSCH data to be sent is sent to the base station.

[0302] If the resource set is a frequency domain resource set, convert 011 to decimal to obtain the second decimal number 3. The third frequency domain resource can be selected from the frequency domain resource set to carry the preamble sequence used when the terminal accesses the network. The preamble sequence used when the terminal accesses the network is sent to the base station on the third frequency domain resource. After sending the preamble sequence used when accessing the network, the PUSCH data to be sent is sent to the base station. Alternatively, the above formula (2) can be used to determine a frequency domain resource from the frequency domain resource set to carry the preamble sequence used when the terminal accesses the network. For example, assuming x2 = 2 and y2 = 1, according to the above formula (2), j = (3 + 2) mod 8 + 1 = 6 can be determined. The sixth frequency domain resource can be selected from the frequency domain resource set to carry the preamble sequence used when the terminal accesses the network. The preamble sequence used when the terminal accesses the network is sent to the base station on the sixth frequency domain resource. After sending the preamble sequence used when accessing the network, the PUSCH data to be sent is sent to the base station.

[0303] If the resource set is a time-frequency resource set, convert 011 to decimal to obtain the second decimal number 3. The third time-frequency resource can be selected from the time-frequency resource set. The preamble sequence used by the terminal during access is sent to the base station on the third time-frequency resource. After sending the preamble sequence used during access, the PUSCH data to be sent is sent to the base station. Alternatively, the above formula (2) can be used to determine the timing of sending a time-frequency resource from the time-frequency resource set and send the preamble sequence used by the terminal during access. For example, assuming x2 = 2 and y2 = 1, according to the above formula (2), j = (3 + 2) mod 8 + 1 = 6 can be determined. The preamble sequence used by the terminal during access is selected from the time-frequency resource set and sent on the sixth frequency domain resource. The preamble sequence used by the terminal during access is sent to the base station on the sixth time-frequency resource. After sending the preamble sequence used during access, the PUSCH data to be sent is sent to the base station.

[0304] In one possible implementation, when the time-frequency resources for transmitting the preamble in the resource set are continuous, the resources required for transmitting the PUSCH data preamble sequence are determined from the resource set used for transmitting the preamble sequence in the Physical Random Access Channel (PRACH) based on the second sub-bit sequence. This can also be achieved in the following ways:

[0305] According to the second sequence partitioning rule, the third and fourth sub-bit sequences are obtained from the second sub-bit sequence; wherein, the second sequence partitioning rule is a rule that divides the second sub-bit sequence into two parts; based on the third sub-bit sequence, the first time-domain resource is determined from the time-domain resource set corresponding to the time-frequency resource set; based on the fourth sub-bit sequence, the first frequency-domain resource is determined from the frequency-domain resource set corresponding to the time-frequency resource set; the time-frequency resources corresponding to the first time-domain resource and the first frequency-domain resource are used as the resources required for the preamble sequence used during access.

[0306] The second sequence partitioning rule is similar to the first sequence partitioning rule. The resulting third and fourth sub-bit sequences have similar positional relationships to the first and second sub-bit sequences, so they will not be described again here.

[0307] For example, see Figure 10 This is a schematic diagram of a time-frequency resource set provided in an embodiment of the present invention. Figure 10 The intermediate time-frequency resource set (including P×Q time-frequency resources: RE) 11 ~RE PQ The corresponding time-domain resource set includes time-domain resource 1 to time-domain resource Q, and the corresponding frequency-domain resource set includes frequency-domain resource 1 to frequency-domain resource P. Assuming the second sub-bit sequence is 00101001, the second sequence is divided into two continuous, non-overlapping, and equal-length parts. This yields the third sub-bit sequence 0010 and the fourth sub-bit sequence 1001. Based on the third sub-bit sequence 0010, the second time-domain resource (i.e., time-domain resource 2) can be determined as the first time-domain resource. Based on the fourth sub-bit sequence 1001, the ninth frequency-domain resource (i.e., frequency-domain resource 9) can be determined as the first frequency-domain resource. Furthermore, the time-frequency resources (RE) corresponding to frequency-domain resource 9 and time-domain resource 2 are then combined. 29 This serves as a resource required for the preamble sequence used by the terminal during access, allowing the terminal to utilize time-frequency resources (REs). 29 The system sends the preamble sequence used during access to the base station, and after sending the preamble sequence, it sends PUSCH data to the base station.

[0308] One possible implementation is that when each bit in the third sub-bit sequence is associated with a time-domain resource in the time-domain resource set, the first time-domain resource is determined from the time-domain resource set corresponding to the time-frequency resource set based on the third sub-bit sequence. This can be achieved in the following way:

[0309] Determine whether the binary value of each bit in the third sub-bit sequence is a preset value; where the preset value is binary data 0 or 1; if the binary value is a preset value, then the time domain resource associated with the corresponding bit in the time domain resource set is taken as the first time domain resource.

[0310] For example, if the third sub-bit sequence is 0010, and the four bits of the third sub-bit sequence correspond one-to-one with the four time-domain resources in the time-domain resource set, and the preset value is 1, then only the binary data corresponding to the third bit is 1. Therefore, the time-domain resource associated with the third bit in the time-domain resource set can be used as the first time-domain resource.

[0311] For example, if the third sub-bit sequence is 0110, and the four bits of the third sub-bit sequence correspond one-to-one with the four time-domain resources in the time-domain resource set, with a preset value of 1, then only the binary data corresponding to the second and third bits is 1. Therefore, the time-domain resources in the time-domain resource set that are associated with the second and third bits can be regarded as the first time-domain resources (i.e., there are 2 first time-domain resources).

[0312] One possible implementation is that when each bit sequence of length three is associated with a time-domain resource in the time-domain resource set, the first frequency-domain resource is determined from the time-domain resource set corresponding to the time-frequency resource set based on the third bit sequence. This can be achieved in the following way:

[0313] Convert the third sub-bit sequence into a base-30 number; select the x-th time-domain resource from the time-domain resource set as the first time-domain resource; where x is base-30 data, or determined based on the base-30 number and the total number of time-domain resources contained in the time-domain resource set.

[0314] When x is determined based on the decimal number and the total number of time-domain resources contained in the time-domain resource set, it can be calculated using the following formula:

[0315] x = (k³ + x³) mod 2 b1 +y3 (3);

[0316] Where k3 is the 30th decimal number, b1 is the total number of bits in the third sub-bit sequence, and x3 and y3 are offset values, which can be set to constants. For example, setting both to 0 indicates no offset, setting x3 to 1 indicates an offset of 1 from k3 (i.e., k3+1), and setting y3 to 2 indicates (k3+1) mod 2. b1Offset 2.

[0317] For example, when each bit sequence of length 3 is associated with a time-domain resource in the time-domain resource set (i.e., multiple bit sequences of length 3 correspond one-to-one with time-domain resources in the time-domain resource set), assuming the third bit sequence is 011, then the length of the third bit sequence is 3, and a bit sequence of length 3 can be associated with 2 3 = 8 resources are associated, that is, the set of bit sequences with a length equal to the length of the third sub-bit sequence (3) includes the 8 bit sequences [000, 001…111], and these 8 bit sequences can be associated one-to-one with the 8 resources in the resource set. If x3 = 1 and y3 = 0, then according to the above formula (3), x = (3+1)mod8+0 = 2 can be calculated, that is, the second time domain resource is selected from the time domain resource set corresponding to the time frequency resource set as the first time domain resource.

[0318] One possible implementation is that when each bit in the fourth sub-bit sequence is associated with a frequency domain resource in the frequency domain resource set, the first frequency domain resource is determined from the frequency domain resource set corresponding to the time-frequency resource set based on the fourth sub-bit sequence. This can be achieved in the following way:

[0319] Determine whether the binary value of each bit in the fourth sub-bit sequence is a preset value; where the preset value is binary data 0 or 1; if the binary value is a preset value, then the frequency domain resource associated with the corresponding bit in the frequency domain resource set is taken as the first frequency domain resource.

[0320] For example, if the fourth sub-bit sequence is 0010, and the four bits of the fourth sub-bit sequence correspond one-to-one with the four frequency domain resources in the frequency domain resource set, and the preset value is 1, then only the binary data corresponding to the third bit is 1. Therefore, the frequency domain resource associated with the third bit in the frequency domain resource set can be used as the first frequency domain resource.

[0321] For example, if the fourth sub-bit sequence is 0110, and the four bits of the third sub-bit sequence correspond one-to-one with the four frequency domain resources in the frequency domain resource set, with a preset value of 1, then only the binary data corresponding to the second and third bits is 1. Therefore, the frequency domain resources in the frequency domain resource set that are associated with the second and third bits can be used as the first frequency domain resources (i.e., there are 2 first frequency domain resources).

[0322] When the preset value is 0, the above two embodiments can be used as a reference, and will not be repeated here.

[0323] One possible implementation involves determining a first frequency domain resource from the frequency domain resource set based on the fourth sub-bit sequence when each bit sequence of length four is associated with a frequency domain resource in the frequency domain resource set.

[0324] Convert the fourth sub-bit sequence into a base-40 number; select the y-th frequency domain resource from the frequency domain resource set as the first frequency domain resource; where y is base-40 data, or determined based on the base-40 number and the total number of frequency domain resources contained in the frequency domain resource set.

[0325] When determining y based on the 40th base number and the total number of time-domain resources contained in the time-domain resource set, it can be calculated using the following formula:

[0326] y = (k⁴ + x⁴) mod 2 b2 +y4 (4);

[0327] Where k4 is the 30th decimal number, b2 is the total number of bits in the third sub-bit sequence, and x4 and y4 are offset values, which can be set to constants. For example, setting both to 0 indicates no offset, setting x4 to 1 indicates an offset of 1 from k4 (i.e., k4+1), and setting y4 to 2 indicates (k4+1) mod 2. b2 Offset 2.

[0328] For example, when each bit sequence of length 4 is associated with a frequency resource in the frequency resource set (i.e., multiple bit sequences of length 4 are associated with one frequency resource in the frequency resource set), assuming the fourth bit sequence is 011, then the length of the fourth bit sequence is 3, and a bit sequence of length 3 of the fourth bit sequence can be associated with 2 3 = 8 resources are associated, that is, the set of bit sequences with a length equal to the length of the fourth sub-bit sequence (3) includes the 8 bit sequences [000, 001…111], and these 8 bit sequences can be associated one-to-one with the 8 resources in the resource set. If x4 = 1 and y4 = 0, then according to the above formula (4), y = (3+1)mod8+0 = 2 can be calculated, that is, the second frequency domain resource is selected from the frequency domain resource set corresponding to the time-frequency resource set as the first frequency domain resource.

[0329] The above-mentioned schemes for determining the first time domain resources and the first frequency domain resources can be combined arbitrarily to form four schemes for determining the time and frequency resources required for the preamble sequence used when the terminal accesses the terminal. The four combination methods will not be described in detail here.

[0330] In the embodiments provided by this invention, after determining the bit sequence associated with PUSCH data, the bit sequence is divided into a first sub-bit sequence and a second sub-bit sequence according to a first sequence partitioning rule. Then, based on the first sub-bit sequence, the preamble sequence used for access is determined from the candidate preamble sequence set. And, based on the second sub-bit sequence, the resources required to send the preamble sequence used for access are determined from the resource set used for transmitting the preamble sequence in PRACH. The preamble sequence used for access is sent on the resources required for the preamble sequence used for access, and after sending the preamble sequence used for access, PUSCH data is sent. This allows some data information in the bit sequence associated with PUSCH data to be carried by the resources used for sending the preamble sequence, thereby reducing the information carried by the preamble sequence and thus reducing the number of sequences in the candidate preamble sequence set. This reduces the complexity of preamble sequence detection and improves the detection capability of PRACH.

[0331] To enable those skilled in the art to fully understand this solution, several specific embodiments are provided below:

[0332] Example 1

[0333] Assuming the resource set is a time-domain resource set, the bit sequence associated with the PUSCH data is the CRC check bit of the PUSCH data, and the bit sequence of the CRC check bit of the PUSCH data is 1101000001101010. The first sequence partitioning rule is to divide the bit sequence associated with the PUSCH data into two continuous and non-overlapping parts of equal length.

[0334] The bit sequence (1101000001101010) associated with the PUSCH data is divided into a first sub-bit sequence (11010000) and a second sub-bit sequence (01101010).

[0335] The preamble sequence used by the terminal to access the base station can be determined from the candidate preamble sequence set based on the first sub-bit sequence. This can be achieved through the following two schemes: Scheme 1: Convert the first sub-bit sequence (11010000) into the first decimal number (208), and then select the candidate preamble sequence from the candidate preamble sequence set (containing 2... 8 =256 candidate preamble sequences) select the 208th candidate preamble sequence as the preamble sequence used by the terminal when accessing the base station; Scheme 2, convert the first sub-bit sequence (11010000) into the first decimal number (208), and the data calculated according to formula (1) is 13, from the candidate preamble sequence set (containing 2 8 The 13th candidate preamble sequence is selected from 256 candidate preamble sequences as the preamble sequence used by the terminal when accessing the base station.

[0336] Based on the second sub-bit sequence (01101010), the time-domain resources carrying the aforementioned preamble sequence are determined from the time-domain set. There are three schemes: Scheme 1: If the bits in the second sub-bit sequence correspond one-to-one with the time-domain resources in the time-domain resource set, and the preset value is 1, then the time-domain resources in the time-domain resource set corresponding to the bit values ​​of 1 in the second sub-bit sequence are used as the time-domain resources carrying the aforementioned preamble sequence; Scheme 2: The second sub-bit sequence (01101010) is converted to a first decimal number (106), and the time-domain resources (containing 2...) are used to determine the time-domain resources carrying the aforementioned preamble sequence. 8 =256 time-domain resources) select the 106th time-domain resource as the time-domain resource to carry the above preamble sequence; Scheme 3, convert the second sub-bit sequence (01101010) into the first decimal number (106), and the data calculated according to formula (2) is 53, from the time-domain resource set (containing 2 8 =256 time-domain resources) select the 53rd time-domain resource as the time-domain resource to carry the above preamble sequence.

[0337] It should be noted that the above resource set can also be a frequency domain resource set or a time-frequency resource set, and the processing method is similar, so it will not be described in detail here.

[0338] After the terminal determines the preamble sequence used when accessing the base station and the resources carrying the preamble sequence through the above method, it sends the preamble sequence on the corresponding resources, and after sending the preamble sequence, it sends the PUSCH data to be sent.

[0339] Example 2

[0340] Assume the resource set is Figure 10 The time-frequency resource set shown can be used to transmit a preamble sequence. The bit sequence associated with the PUSCH data is the CRC check bit of the PUSCH data. The bit sequence of the CRC check bit of the PUSCH data is 1101000001101010. The first sequence division rule is to divide the bit sequence associated with the PUSCH data into two continuous and non-overlapping parts of equal length.

[0341] The bit sequence (1101000001101010) associated with the PUSCH data is divided into a first sub-bit sequence (11010000) and a second sub-bit sequence (01101010).

[0342] The preamble sequence used by the terminal to access the base station can be determined from the candidate preamble sequence set based on the first sub-bit sequence. This can be achieved through the following two schemes: Scheme 1: Convert the first sub-bit sequence (11010000) into the first decimal number (208), and then select the candidate preamble sequence from the candidate preamble sequence set (containing 2... 8 =256 candidate preamble sequences) select the 208th candidate preamble sequence as the preamble sequence used by the terminal when accessing the base station; Scheme 2, convert the first sub-bit sequence (11010000) into the first decimal number (208), and the data calculated according to formula (1) is 13, from the candidate preamble sequence set (containing 2 8 The 13th candidate preamble sequence is selected from 256 candidate preamble sequences as the preamble sequence used by the terminal when accessing the base station.

[0343] The time-frequency resources carrying the preamble sequence can be determined from the time-domain set based on the second sub-bit sequence (01101010). This can be achieved by the following method: According to the second sequence partitioning rule (similar to the first sequence partitioning rule), the second sub-bit sequence (01101010) is divided into a third sub-bit sequence (0110) and a fourth sub-bit sequence (1010). The third sub-bit sequence (0110) and the fourth sub-bit sequence (1010) are converted into decimal numbers respectively to obtain a third decimal number (6) and a fourth decimal number (10). The schemes for determining the preamble sequence based on the above third decimal number and fourth decimal number include the following four:

[0344] Option 1: Select the 6th time-domain resource from the time-domain resource set corresponding to the time-frequency resource set as the first time-domain resource, and select the 10th frequency-domain resource from the frequency-domain resource set corresponding to the time-frequency resource set as the first frequency-domain resource. Then, combine the first frequency-domain resource with the time-frequency resource (RE) corresponding to the first time-domain resource. 610 () serves as the time-frequency resource carrying the aforementioned preamble sequence.

[0345] Option 2: Calculate 6 mod 2 according to formula (3). 4 =3, that is, the third time-domain resource is selected from the time-domain resource set corresponding to the time-frequency resource set as the first time-domain resource, and 10 mod 2 is calculated according to formula (4). 4 =1, that is, select the first frequency domain resource from the frequency domain resource set corresponding to the time-frequency resource set as the first frequency domain resource, and combine the first frequency domain resource with the time-frequency resource (RE) corresponding to the first time domain resource. 31 () serves as the time-frequency resource carrying the aforementioned preamble sequence.

[0346] Scheme 3: Select the 6th time-domain resource from the time-domain resource set corresponding to the time-frequency resource set as the first time-domain resource, and calculate 10 mod 2 according to formula (4).4 =1, that is, select the first frequency domain resource from the frequency domain resource set corresponding to the time-frequency resource set as the first frequency domain resource, and combine the first frequency domain resource with the time-frequency resource (RE) corresponding to the first time domain resource. 61 () serves as the time-frequency resource carrying the aforementioned preamble sequence.

[0347] Option 4: Calculate 6 mod 2 according to formula (3). 4 =3, that is, selecting the 3rd time-domain resource from the time-domain resource set corresponding to the time-frequency resource set as the first time-domain resource, and selecting the 10th frequency-domain resource from the frequency-domain resource set corresponding to the time-frequency resource set as the first frequency-domain resource, and then combining the first frequency-domain resource with the time-frequency resource (RE) corresponding to the first time-domain resource. 310 () serves as the time-frequency resource carrying the aforementioned preamble sequence.

[0348] After the terminal determines the preamble sequence used when accessing the base station and the resources carrying the preamble sequence through the above method, it sends the preamble sequence on the corresponding resources, and after sending the preamble sequence, it sends the PUSCH data to be sent.

[0349] It should be noted that in the above embodiments one and two, the offset values ​​(x1 to x4, y1 to y4) in formulas (1) to (4) are all set to 0.

[0350] After introducing the above solutions from the terminal side, the following section will introduce them from the base station side:

[0351] Based on the same inventive concept, embodiments of the present invention provide a data transmission method applied to a base station; please refer to [link to relevant documentation]. Figure 11 The method includes:

[0352] Step 1101: Receive the preamble sequence and the Physical Uplink Shared Channel (PUSCH) data;

[0353] Step 1102: Determine the first sub-bit sequence based on the position data of the received preamble sequence in the candidate preamble sequence set; and determine the second sub-bit sequence based on the position data of the resource carrying the preamble sequence in the resource set.

[0354] For example, by comparing the received preamble sequence one by one with the candidate preamble sequences in the candidate preamble sequence set, the position data of the successfully matched candidate preamble sequence in the candidate preamble sequence set is obtained as 13. Based on this position data 13, the first sub-bit sequence can be determined. Similarly, the second sub-bit sequence can be determined by the position data of the resource carrying the preamble sequence in the resource set.

[0355] One possible implementation is to determine the first sub-bit sequence based on the position data of the received preamble sequence in the candidate preamble sequence set, which can be achieved in the following way:

[0356] The first method involves converting the position data of the received preamble sequence in the candidate preamble sequence set into binary data and using it as the first sub-bit sequence; wherein, the position data of the received preamble sequence in the candidate preamble sequence set is a decimal number.

[0357] For example, suppose the position data of the received preamble sequence in the candidate preamble sequence set is 13, which is 1101 after being converted into binary data. Suppose that the total number of bits in the first sub-bit sequence is known to be 8, then the first sub-bit sequence is 00001101.

[0358] The second method is to determine the first sub-bit sequence based on the position data of the received preamble sequence in the candidate preamble sequence set and the total number of elements contained in the candidate sequence set.

[0359] The method for determining the first sub-bit sequence described above can be deduced from formula (1), and will not be repeated here.

[0360] In the embodiments provided by the present invention, the resource set consists of at least one of time-domain resources and frequency-domain resources for transmitting preambles, or time-frequency resources for transmitting preambles.

[0361] For a description of the aforementioned time-domain resources, frequency-domain resources, and time-frequency resources, please refer to the description on the terminal side; it will not be repeated here.

[0362] One possible implementation is that, when each bit in the second sub-bit sequence is associated with a resource in the resource set, the second sub-bit sequence is determined based on the position data of the resource carrying the preamble sequence in the resource set. This can be achieved in the following way:

[0363] Each of the multiple consecutive resources is constructed as an initial sequence, depending on whether it carries a preamble sequence. When a preamble sequence is received on a resource, the value of the corresponding bit in the initial sequence is set to a preset value. When no preamble sequence is received on a resource, the value of the corresponding bit in the initial sequence is set to the inverted value of the preset value, which is 0 or 1. At least one sequence containing the initial sequence and having a length is constructed as the second sub-bit sequence.

[0364] For example, if the resource set is a time-domain resource set, the base station first receives the preamble sequence sent by the terminal on time-domain resource 3, does not receive the preamble sequence on time-domain resource 4, receives the preamble sequence on time-domain resource 5, receives the preamble sequence on time-domain resource 6, and does not receive the preamble sequence again thereafter. Assuming the value of the bit in the initial sequence corresponding to the received preamble sequence is set to a preset value (assumed to be 1), the initial sequence is 1011. If the length of the second sub-bit sequence is known to be 8, then a sequence containing the initial sequence 1011 can be constructed: 0000 The sequences 1011, 00010110, 00101100, 01011000, 10110000, 11111011, 11110111, 11101111, 11011111, 10111111, 10001011, etc., are all used as second sub-bit sequences. In step 1103, these second sub-bit sequences are merged one by one with the first sub-bit sequences to obtain multiple bit sequences associated with PUSCH data. The correct bit sequence is then determined for processing the received PUSCH data in step 1104.

[0365] One possible implementation is that when each bit sequence of length 1 is associated with a resource in the resource set, the second sub-bit sequence is determined based on the position data of the resource carrying the preamble sequence in the resource set. This can be achieved in the following way:

[0366] The first method involves converting the position data of the resource carrying the preamble sequence in the resource set into binary data, which serves as the second sub-bit sequence. The position data of the resource carrying the preamble sequence in the resource set is a decimal number.

[0367] For example, suppose the position data of the frequency domain resource of the preamble sequence sent by the carrying terminal in the frequency domain resource set is 35, which is 100011 after being converted into binary data. If the total number of bits of the second sub-bit sequence is known to be 8, then the second sub-bit sequence is 00100011.

[0368] The second method involves determining the second sub-bit sequence based on the position data of the resource carrying the preamble sequence within the resource set, and the total number of elements contained in the resource set.

[0369] The above method for determining the second sub-bit sequence can be deduced from formula (2), so it will not be repeated here.

[0370] In one possible implementation, when the time-frequency resources in the resource set are continuous, the second sub-bit sequence is determined based on the position data of the resource carrying the preamble sequence in the resource set. This can be achieved in the following way.

[0371] The third sub-bit sequence is determined based on the position data of the time-domain resources corresponding to the time-frequency resources carrying the preamble sequence in the time-domain resource set; the fourth sub-bit sequence is determined based on the position data of the frequency-domain resources corresponding to the time-frequency resources carrying the preamble sequence in the frequency-domain resource set; the third and fourth bit sequences are merged into the second sub-bit sequence according to the second sequence partitioning rule; wherein, the second sequence partitioning rule is the rule for dividing the second sub-bit sequence into two parts.

[0372] For example, see Figure 10 Assuming the base station receives the preamble sequence sent by the terminal within the time-frequency resource RE 32 Received from above, time-frequency resources RE 32 The corresponding time-domain resource is time-domain resource 3, and the time-frequency resource is RE. 32 The corresponding frequency domain resource is frequency domain resource 2. The base station can compare time domain resource 3 with the time domain resources in the time domain resource set one by one, and determine the position data of the time domain resource that successfully matches time domain resource 3 in the time domain resource set as 3. Then, the third sub-bit sequence can be determined based on this position data 3. Similarly, the position data of frequency domain resource 2 in the frequency domain resource set can be determined as 2, and the fourth sub-bit sequence can be determined based on position data 2.

[0373] One possible implementation is to determine the third sub-bit sequence based on the position data of the time-domain resource corresponding to the time-frequency resource carrying the preamble sequence in the time-domain resource set. This can be achieved in the following way:

[0374] The first method involves converting the position data of the time-domain resource carrying the preamble sequence in the time-domain resource set into binary data and using it as the third sub-bit sequence; wherein, the position data of the time-domain resource carrying the preamble sequence in the time-domain resource set is a decimal number.

[0375] For example, the position data of the time-domain resource carrying the preamble sequence in the time-domain resource set is 3. Assuming that the length of the third sub-bit sequence is 4, the above position data 3 is converted into binary data 11. Since the length of the third sub-bit sequence is 4, the third sub-bit sequence can be determined to be 0011.

[0376] The second method is to determine the third sub-bit sequence based on the position data of the time-domain resource carrying the preamble sequence in the time-domain resource set and the total number of elements contained in the time-domain resource set.

[0377] The third sub-bit sequence can be determined by the inverse operation of formula (3), which will not be elaborated here.

[0378] One possible implementation is to determine the fourth-order bit sequence based on the position data of the frequency domain resource corresponding to the time-frequency resource carrying the preamble sequence in the frequency domain resource set. This can be achieved in the following way:

[0379] The first method involves converting the position data of the frequency domain resource carrying the preamble sequence in the frequency domain resource set into binary data and using it as the fourth sub-bit sequence; wherein, the position data of the frequency domain resource carrying the preamble sequence in the frequency domain resource set is a decimal number.

[0380] For example, if the position data of the frequency domain resource carrying the preamble sequence in the frequency domain resource set is 2, and the length of the fourth sub-bit sequence is 2, then the above position data 2 is converted into binary data 10. Since the length of the fourth sub-bit sequence is 2, the fourth sub-bit sequence is 10.

[0381] Assuming the third sub-bit sequence is determined to be 0011 according to the method described above, if the second sequence partitioning rule is to divide the second sub-bit sequence into a continuous and non-overlapping third sub-bit sequence and a fourth sub-bit sequence, then the third sub-bit sequence 0011 and the fourth sub-bit sequence 10 determined above can be merged into a sequence 001110, and this sequence 001110 can be used as the second sub-bit sequence; if the second sequence partitioning rule is to divide the second sub-bit sequence into a non-continuous (e.g., alternating) and non-overlapping third sub-bit sequence and a fourth sub-bit sequence, then the third sub-bit sequence 0011 and the fourth sub-bit sequence 10 determined above can be merged into a sequence 010011, and this sequence 010011 can be used as the second sub-bit sequence.

[0382] The second method is to determine the fourth sub-bit sequence based on the position data of the frequency domain resource carrying the preamble sequence in the frequency domain resource set, and the total number of elements contained in the frequency domain resource set.

[0383] The fourth sub-bit sequence can be determined by inverse operation of formula (4), which will not be elaborated here.

[0384] After determining the first sub-bit sequence and the second sub-bit sequence according to the method described above, steps 1103 and 1104 can be executed.

[0385] Step 1103: After confirming that the preamble sequence is correct, merge the first sub-bit sequence and the second sub-bit sequence into one sequence according to the first sequence partitioning rule to obtain the bit sequence associated with the PUSCH data; the first sequence partitioning rule is the rule of dividing the bit sequence into two parts.

[0386] Step 1104: Receive the PUSCH data using the bit sequence associated with it. The receiving process includes descrambling or verifying the PUSCH data.

[0387] The base station first needs to determine whether the received preamble sequence is correct. Since determining the correctness of the received preamble sequence is existing technology, it will not be described in detail here. After confirming that the received preamble sequence is correct, the first sub-bit sequence and the second sub-bit sequence are merged according to the first sequence partitioning rule. The merged sequence is the bit sequence associated with the PUSCH data.

[0388] For example, see Figure 12 This is a schematic diagram of merging the first sub-bit sequence and the second sub-bit sequence provided in an embodiment of the present invention. Assuming the first sub-bit sequence is 00101011 and the second sub-bit sequence is 11011001, the first sequence division rule is to divide the bit sequence into a continuous and non-overlapping first sub-bit sequence and a second sub-bit sequence of equal length. Therefore, the first sub-bit sequence 00101011 and the second sub-bit sequence 11011001 can be merged into the sequence 0010101111011001, which is the bit sequence associated with PUSCH data. In this way, the base station can use the bit sequence 0010101111011001 associated with the PUSCH data to process the PUSCH data received from the terminal. If the bit sequence 0010101111011001 associated with the PUSCH data is a CRC checksum, then this bit sequence is used to perform CRC check on the PUSCH data. If the bit sequence 0010101111011001 associated with the PUSCH data is the user's terminal identifier or a characteristic bit in the PUSCH data, this bit sequence can be used to descramble the PUSCH data, etc.

[0389] When the first sequence partitioning rule is Figure 5 or Figure 6 In any of the following cases, the first sub-bit sequence and the second sub-bit sequence can be reverse-merged according to the corresponding method, which will not be elaborated here.

[0390] To enable those skilled in the art to fully understand the above solution, two specific embodiments are provided below:

[0391] Example 3 (corresponding to Example 1)

[0392] Assuming the resource set is a time-domain resource set, the bit sequence associated with the PUSCH data is the CRC check bit of the PUSCH data, and the bit sequence of the CRC check bit of the PUSCH data is 1101000001101010. The first sequence partitioning rule is to divide the bit sequence associated with the PUSCH data into two continuous and non-overlapping parts of equal length.

[0393] The base station receives a preamble sequence sent by the terminal and determines that the resource carrying the preamble sequence is a time-domain resource. By comparing the preamble sequence with each candidate preamble sequence in the candidate preamble sequence set, it determines that a match is successful with the 208th / 13th candidate preamble sequence in the candidate preamble sequence set. Therefore, the position data of the 208th / 13th candidate preamble sequence in the candidate preamble sequence set is obtained as 208 / 13. Based on the position data 208 / 13, the first sub-bit sequence is determined to be 11010000. Simultaneously, by comparing the time-domain resource carrying the preamble sequence with each time-domain resource in the time-domain resource set, the position data of the successfully matched time-domain resource is determined to be 106 / 53. Based on this position data 106 / 53, the second sub-bit sequence is determined to be 01101010. Furthermore, if the second sub-bit sequence is... The bits in the bit sequence correspond one-to-one with the time-domain resources in the time-domain resource set, and have a preset value of 1. Assuming that the base station starts receiving the above preamble sequence at a certain moment (the value of the first bit in the initial sequence is set to 1), the situation of whether the above preamble sequence is received in the next five moments is: received-not received-received-not received-received. After the sixth moment, the above preamble sequence is no longer received. Therefore, the initial sequence can be determined to be 110101. Since the length of the second subsequence is known to be 8, the second sub-bit sequence containing the above initial sequence can be constructed as follows: 00110101, 01110101, 10110101, 11110101, 11010100, 11010101, 11010110, 11010111, 01101010, 11101010, 01101011.

[0394] According to the first sequence partitioning rule, the first sub-bit sequence (11010000) and the second sub-bit sequence (01101010) are merged to obtain the bit sequence (1101000001101010) associated with the received PUSCH data. After confirming that the received preamble is correct, this bit sequence is used to perform CRC check on the received PUSCH data (i.e., reception processing).

[0395] It is important to understand that, in the case where the second sub-bit sequence is determined to include multiple different sequences, each possible sequence is merged with the first sub-bit sequence, and the received PUSCH data is processed. Successful processing indicates that the corresponding second sub-bit sequence is correct.

[0396] Example 4 (corresponding to Example 2)

[0397] Assume the resource set is Figure 10The time-frequency resource set shown can be used to transmit a preamble sequence. The bit sequence associated with the PUSCH data is the CRC check bit of the PUSCH data. The bit sequence of the CRC check bit of the PUSCH data is 1101000001101010. The first sequence division rule is to divide the bit sequence associated with the PUSCH data into two continuous and non-overlapping parts of equal length.

[0398] The base station receives a preamble sequence sent by the terminal and determines that the resource carrying the preamble sequence is a time-domain resource. By comparing this preamble sequence with each candidate preamble sequence in the candidate preamble sequence set, it determines that a successful match is made with the 208th / 13th candidate preamble sequence in the candidate preamble sequence set. Therefore, the position data of the 208th / 13th candidate preamble sequence in the candidate preamble sequence set is obtained as 208 / 13. Based on the position data 208 / 13, the first sub-bit sequence is determined to be 11010000. Simultaneously, by comparing the time-frequency resource carrying the preamble sequence with each time-frequency resource in the time-frequency resource set, the successfully matched time-frequency resource can be determined to be RE. 610 We can determine that the position data of the corresponding time-domain resource in the time-domain resource set is 6, and the position data of the corresponding frequency-domain resource in the frequency-domain resource set is 10. Converting the position data 6 into binary data 110, since the length of the third sub-bit sequence is 4, we can determine that the third sub-bit sequence is 0110. Converting the position data 10 into binary data 1010, we can determine that the fourth sub-bit sequence is 1010. Merging them according to the second sequence division rule into 01101010, we can obtain the second sub-bit sequence as 01101010.

[0399] The first sub-bit sequence (11010000) and the second sub-bit sequence (01101010) are merged into 1101000001101010 according to the first sequence division rule, resulting in the bit sequence (1101000001101010) associated with the received PUSCH data. After confirming that the received large preamble sequence is correct, the received PUSCH data is CRC checked (i.e., reception processing) using the bit sequence (1101000001101010) associated with the received PUSCH data.

[0400] As for other schemes for determining the third and fourth sub-bit sequences, please refer to the previous descriptions, which will not be repeated here.

[0401] like Figure 13 As shown, an embodiment of the present invention provides a terminal including a memory 1301, a transceiver 1302, and a processor 1303.

[0402] Memory 1301 is used to store computer programs; transceiver 1302 is used to send and receive data under the control of processor 1303; processor 1303 is used to read the computer program in memory 1301 and perform the following operations:

[0403] Determine the bit sequence associated with the Physical Uplink Shared Channel (PUSCH) data to be transmitted; according to a first sequence partitioning rule, obtain a first sub-bit sequence and a second sub-bit sequence from the bit sequence; the first sequence partitioning rule is a rule that divides the bit sequence into two parts;

[0404] Based on the first sub-bit sequence, a preamble sequence to be used during access is determined from a set of candidate preamble sequences; and based on the second sub-bit sequence, resources required to transmit the preamble sequence to be used during access are determined from a set of resources used by the Physical Random Access Channel (PRACH) for transmitting preamble sequences.

[0405] The preamble sequence used during access is sent on the resources required for the preamble sequence used during access, and the PUSCH data is sent after the preamble sequence used during access is sent.

[0406] In one possible implementation, the processor 1303 further uses:

[0407] From the PUSCH data, obtain at least one of the following sequences: the sequence corresponding to the cyclic redundancy check bit, the terminal identifier, and the sequence corresponding to the feature bit in the PUSCH data;

[0408] The at least one sequence is used as a bit sequence associated with the PUSCH data.

[0409] One possible implementation includes the feature bits:

[0410] The first N bits of the PUSCH data; where N is a positive integer;

[0411] Or, the last N bits of the PUSCH data;

[0412] Alternatively, N bits determined from the PUSCH data according to preset rules.

[0413] One possible implementation, the first sequence partitioning rule includes:

[0414] The bit sequence is divided into two parts, which may be continuous or non-contiguous.

[0415] In one possible implementation, the two parts of the sequence are continuous or non-contiguous, and their positions in the bit sequence do not overlap or partially overlap.

[0416] In one possible implementation, the processor 1303 further uses:

[0417] Convert the first sub-bit sequence into a first decimal number;

[0418] From the set of candidate preamble sequences, a candidate preamble sequence corresponding to the first decimal number is selected as the preamble sequence used during access.

[0419] In one possible implementation, the processor 1303 further uses:

[0420] From the set of candidate preamble sequences, the i-th candidate preamble sequence is selected as the preamble sequence used during access; wherein i is the first decimal number, or is determined based on the first decimal number and the total number of elements contained in the set of candidate preamble sequences.

[0421] One possible implementation is that the resource set consists of at least one of time-domain resources and frequency-domain resources for transmitting the preamble, or consists of time-frequency resources for transmitting the preamble.

[0422] In one possible implementation, when each bit in the second sub-bit sequence is associated with a resource in the resource set, the processor 1303 further uses:

[0423] Determine whether the binary value of each bit in the second sub-bit sequence is a preset value; wherein, the preset value is binary data 0 or 1;

[0424] If the binary value is the preset value, then the resource associated with the corresponding bit in the resource set is used as the resource required for the preamble sequence used during access.

[0425] In one possible implementation, when each bit sequence of length equal to the length of the second sub-bit sequence is associated with a resource in the resource set, the processor 1303 further uses:

[0426] Convert the second sub-bit sequence into a base 20 number;

[0427] From the resource set, the j-th resource is selected as the resource required for the preamble sequence used during access; wherein, j is the second decimal data, or is determined based on the second decimal number and the total number of resources contained in the resource set.

[0428] In one possible implementation, when the time-frequency resources for transmitting the preamble in the resource set are continuous, the processor 1303 further uses:

[0429] According to the second sequence partitioning rule, the third and fourth sub-bit sequences are obtained from the second sub-bit sequence; wherein, the second sequence partitioning rule is a rule that divides the second sub-bit sequence into two parts;

[0430] Based on the third sub-bit sequence, a first time-domain resource is determined from the time-domain resource set corresponding to the time-frequency resource set; based on the fourth sub-bit sequence, a first frequency-domain resource is determined from the frequency-domain resource set corresponding to the time-frequency resource set.

[0431] The time-frequency resources corresponding to the first time-domain resources and the first frequency-domain resources are used as the resources required for the preamble sequence used during access.

[0432] In one possible implementation, when each bit in the third sub-bit sequence is associated with a time-domain resource in the time-domain resource set, the processor 1303 further uses:

[0433] Determine whether the binary value of each bit in the third sub-bit sequence is a preset value; wherein, the preset value is binary data 0 or 1;

[0434] If the binary value is the preset value, then the time-domain resources associated with the corresponding bit in the time-domain resource set are taken as the first time-domain resource.

[0435] In one possible implementation, when each bit sequence of length equal to the length of the third sub-bit sequence is associated with a time-domain resource in the time-domain resource set, the processor 1303 further uses:

[0436] Convert the third sub-bit sequence into a 30-base number;

[0437] From the set of time-domain resources, the x-th time-domain resource is selected as the first time-domain resource; wherein, x is the thirtieth decimal number, or is determined based on the thirtieth decimal number and the total number of time-domain resources contained in the set of time-domain resources.

[0438] In one possible implementation, when each bit in the fourth sub-bit sequence is associated with a frequency domain resource in the frequency domain resource set, the processor 1303 further uses:

[0439] Determine whether the binary value of each bit in the fourth sub-bit sequence is a preset value; wherein, the preset value is binary data 0 or 1;

[0440] If the binary value is the preset value, then the frequency domain resource associated with the corresponding bit in the frequency domain resource set is taken as the first frequency domain resource.

[0441] In one possible implementation, when each bit sequence of length equal to the length of the fourth sub-bit sequence is associated with a frequency domain resource in the frequency domain resource set, the processor 1303 further uses:

[0442] Convert the fourth sub-bit sequence into a fourth decimal number;

[0443] From the set of frequency domain resources, the y-th frequency domain resource is selected as the first frequency domain resource; wherein, y is the fortieth decimal data, or is determined based on the fortieth decimal number and the total number of frequency domain resources contained in the set of frequency domain resources.

[0444] Transceiver 1302 is used to receive and send data under the control of processor 1303.

[0445] Among them, Figure 13 In this context, the bus architecture can include any number of interconnected buses and bridges, specifically linking various circuits of one or more processors represented by processor 1303 and memory represented by memory 1301 together. The bus architecture can also link various other circuits such as peripheral devices, voltage regulators, and power management circuits, which are well known in the art and therefore will not be described further herein. The bus interface provides an interface. The transceiver 1302 can be multiple elements, including transmitters and receivers, providing a unit for communicating with various other devices over a transmission medium, including wireless channels, wired channels, optical fibers, etc. For different user equipment, the user interface 1304 can also be an interface capable of connecting external or internal devices, including but not limited to keypads, displays, speakers, microphones, joysticks, etc.

[0446] The processor 1303 is responsible for managing the bus architecture and general processing, while the memory 1301 can store the data used by the processor 1303 when performing operations.

[0447] Optionally, the processor 1303 can be a CPU (Central Processing Unit), ASIC (Application Specific Integrated Circuit), FPGA (Field-Programmable Gate Array), or CPLD (Complex Programmable Logic Device), and the processor can also adopt a multi-core architecture.

[0448] The processor executes any of the methods described in the embodiments of this application according to the obtained executable instructions by calling a computer program stored in memory. The processor and memory may also be physically separated.

[0449] Please see Figure 14 A base station provided in an embodiment of the present invention includes a memory 1401, a transceiver 1402, and a processor 1403.

[0450] Memory 1401 is used to store computer programs; transceiver 1402 is used to send and receive data under the control of processor 1403; processor 1403 is used to read the computer program in memory 1401 and perform the following operations:

[0451] Receive the preamble sequence and the Physical Uplink Shared Channel (PUSCH) data;

[0452] Based on the position data of the received preamble sequence in the candidate preamble sequence set, a first sub-bit sequence is determined; and based on the position data of the resource carrying the preamble sequence in the resource set, a second sub-bit sequence is determined.

[0453] After confirming that the preamble sequence is correct, the first sub-bit sequence and the second sub-bit sequence are merged into one sequence according to the first sequence partitioning rule to obtain the bit sequence associated with the PUSCH data; the first sequence partitioning rule is the rule of dividing the bit sequence into two parts;

[0454] The PUSCH data is received using the bit sequence associated with it, the receiving process including descrambling or verifying the PUSCH data.

[0455] In one possible implementation, the processor 1403 further uses:

[0456] The position data of the received preamble sequence in the candidate preamble sequence set is converted into binary data and used as the first sub-bit sequence; wherein, the position data of the received preamble sequence in the candidate preamble sequence set is a decimal number;

[0457] Alternatively, the first sub-bit sequence can be determined based on the position data of the received preamble sequence in the candidate preamble sequence set and the total number of elements contained in the candidate sequence set.

[0458] One possible implementation is that the resource set consists of at least one of time-domain resources and frequency-domain resources for transmitting preambles, or time-frequency resources for transmitting preambles.

[0459] In one possible implementation, when each bit in the second sub-bit sequence is associated with a resource in the resource set, the processor 1403 further uses:

[0460] An initial sequence is constructed by considering whether each of the multiple consecutive resources carries the preamble sequence; wherein, when the preamble sequence is received on the resource, the value of the corresponding bit in the initial sequence is set to a preset value, and when the preamble sequence is not received on the resource, the value of the corresponding bit in the initial sequence is set to the inverted value of the preset value, wherein the preset value is 0 or 1;

[0461] Construct at least one sequence containing the initial sequence and having the stated length as the second sub-bit sequence.

[0462] In one possible implementation, when each bit sequence of length equal to the length of the second sub-bit sequence is associated with a resource in the resource set, the processor 1403 further uses:

[0463] The position data of the resource carrying the preamble sequence in the resource set is converted into binary data, which is used as the second sub-bit sequence; wherein, the position data of the resource carrying the preamble sequence in the resource set is a decimal number;

[0464] Alternatively, the second sub-bit sequence can be determined based on the position data of the resource carrying the preamble sequence in the resource set and the total number of elements contained in the resource set.

[0465] In one possible implementation, when the time-frequency resources in the resource set are continuous, the processor 1403 further uses:

[0466] The third sub-bit sequence is determined based on the position data of the time-domain resource corresponding to the time-frequency resource carrying the preamble sequence in the time-domain resource set.

[0467] The fourth sub-bit sequence is determined based on the position data of the frequency domain resource corresponding to the time-frequency resource carrying the preamble sequence in the frequency domain resource set;

[0468] According to the second sequence partitioning rule, the third sub-bit sequence and the fourth sub-bit sequence are merged into the second sub-bit sequence; wherein, the second sequence partitioning rule is the rule for dividing the second sub-bit sequence into two parts.

[0469] In one possible implementation, the processor 1403 further uses:

[0470] The position data of the time-domain resource carrying the preamble sequence in the time-domain resource set is converted into binary data and used as the third sub-bit sequence; wherein, the position data of the time-domain resource carrying the preamble sequence in the time-domain resource set is a decimal number;

[0471] Alternatively, the third sub-bit sequence can be determined based on the position data of the time-domain resource carrying the preamble sequence in the time-domain resource set, and the total number of elements contained in the time-domain resource set.

[0472] In one possible implementation, the processor 1403 further uses:

[0473] The position data of the frequency domain resource carrying the preamble sequence in the frequency domain resource set is converted into binary data and used as the fourth sub-bit sequence; wherein, the position data of the frequency domain resource carrying the preamble sequence in the frequency domain resource set is a decimal number;

[0474] Alternatively, the fourth sub-bit sequence can be determined based on the position data of the frequency domain resources carrying the preamble sequence in the frequency domain resource set, and the total number of elements contained in the frequency domain resource set.

[0475] Transceiver 1402 is used to receive and send data under the control of processor 1403.

[0476] Among them, Figure 14 In this context, the bus architecture can include any number of interconnected buses and bridges, specifically linking various circuits together, represented by one or more processors (processor 1403) and memory (memory 1401). The bus architecture can also link together various other circuits such as peripheral devices, voltage regulators, and power management circuits, which are well known in the art and therefore will not be described further herein. The bus interface provides an interface. The transceiver 1402 can be multiple elements, including transmitters and receivers, providing a unit for communicating with various other devices over transmission media, including wireless channels, wired channels, optical fibers, etc. The processor 1403 is responsible for managing the bus architecture and general processing, and the memory 1401 can store data used by the processor 1403 during operation.

[0477] The processor 1403 can be a central processing unit (CPU), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or a complex programmable logic device (CPLD). The processor can also adopt a multi-core architecture.

[0478] It should be noted that the apparatus provided in this embodiment of the invention can implement all the method steps implemented in the above method embodiment and can achieve the same technical effect. Therefore, the parts and beneficial effects that are the same as those in the method embodiment will not be described in detail here.

[0479] Based on the same inventive concept, one embodiment of the present invention provides a terminal. Specific implementation methods for the data transmission method of this terminal can be found in the description of the terminal-side method embodiment section; repeated details will not be repeated here. Figure 15 The terminal includes:

[0480] The partitioning unit 1501 is used to determine the bit sequence associated with the Physical Uplink Shared Channel (PUSCH) data to be transmitted; and to obtain a first sub-bit sequence and a second sub-bit sequence from the bit sequence according to a first sequence partitioning rule; the first sequence partitioning rule is a rule that divides the bit sequence into two parts.

[0481] The determining unit 1502 is configured to determine, based on the first sub-bit sequence, a preamble sequence to be used during access from a set of candidate preamble sequences; and, based on the second sub-bit sequence, determine the resources required to transmit the preamble sequence to be used during access from a set of resources used by the Physical Random Access Channel (PRACH) for transmitting the preamble sequence.

[0482] The sending unit 1503 is configured to send the preamble sequence used during access on the resources required by the preamble sequence used during access, and send the PUSCH data after sending the preamble sequence used during access.

[0483] In one possible implementation, the partitioning unit 1501 is further configured to:

[0484] From the PUSCH data, obtain at least one of the following sequences: the sequence corresponding to the cyclic redundancy check bit, the terminal identifier, and the sequence corresponding to the feature bit in the PUSCH data;

[0485] The at least one sequence is used as a bit sequence associated with the PUSCH data.

[0486] One possible implementation includes the feature bits:

[0487] The first N bits of the PUSCH data; where N is a positive integer;

[0488] Or, the last N bits of the PUSCH data;

[0489] Alternatively, N bits determined from the PUSCH data according to preset rules.

[0490] One possible implementation, the first sequence partitioning rule includes:

[0491] The bit sequence is divided into two parts, which may be continuous or non-contiguous.

[0492] In one possible implementation, the two parts of the sequence are continuous or non-contiguous, and their positions in the bit sequence do not overlap or partially overlap.

[0493] In one possible implementation, the determining unit 1502 is further configured to:

[0494] Convert the first sub-bit sequence into a first decimal number;

[0495] From the set of candidate preamble sequences, a candidate preamble sequence corresponding to the first decimal number is selected as the preamble sequence used during access.

[0496] In one possible implementation, the determining unit 1502 is further configured to:

[0497] From the set of candidate preamble sequences, the i-th candidate preamble sequence is selected as the preamble sequence used during access; wherein i is the first decimal number, or is determined based on the first decimal number and the total number of elements contained in the set of candidate preamble sequences.

[0498] One possible implementation is that the resource set consists of at least one of time-domain resources and frequency-domain resources for transmitting the preamble, or consists of time-frequency resources for transmitting the preamble.

[0499] In one possible implementation, when each bit in the second sub-bit sequence is associated with a resource in the resource set, the determining unit 1502 is further configured to:

[0500] Determine whether the binary value of each bit in the second sub-bit sequence is a preset value; wherein, the preset value is binary data 0 or 1;

[0501] If the binary value is the preset value, then the resource associated with the corresponding bit in the resource set is used as the resource required for the preamble sequence used during access.

[0502] In one possible implementation, when each bit sequence of length equal to the length of the second sub-bit sequence is associated with a resource in the resource set, the determining unit 1502 is further configured to:

[0503] Convert the second sub-bit sequence into a base 20 number;

[0504] From the resource set, the j-th resource is selected as the resource required for the preamble sequence used during access; wherein, j is the second decimal data, or is determined based on the second decimal number and the total number of resources contained in the resource set.

[0505] In one possible implementation, when the time-frequency resources for transmitting the preamble in the resource set are continuous, the determining unit 1502 is further configured to:

[0506] According to the second sequence partitioning rule, the third and fourth sub-bit sequences are obtained from the second sub-bit sequence; wherein, the second sequence partitioning rule is a rule that divides the second sub-bit sequence into two parts;

[0507] Based on the third sub-bit sequence, a first time-domain resource is determined from the time-domain resource set corresponding to the time-frequency resource set; based on the fourth sub-bit sequence, a first frequency-domain resource is determined from the frequency-domain resource set corresponding to the time-frequency resource set.

[0508] The time-frequency resources corresponding to the first time-domain resources and the first frequency-domain resources are used as the resources required for the preamble sequence used during access.

[0509] In one possible implementation, when each bit in the third sub-bit sequence is associated with a time-domain resource in the time-domain resource set, the determining unit 1502 is further configured to:

[0510] Determine whether the binary value of each bit in the third sub-bit sequence is a preset value; wherein, the preset value is binary data 0 or 1;

[0511] If the binary value is the preset value, then the time-domain resources associated with the corresponding bit in the time-domain resource set are taken as the first time-domain resource.

[0512] In one possible implementation, when each bit sequence of length equal to the length of the third sub-bit sequence is associated with a time-domain resource in the time-domain resource set, the determining unit 1502 is further configured to:

[0513] Convert the third sub-bit sequence into a 30-base number;

[0514] From the set of time-domain resources, the x-th time-domain resource is selected as the first time-domain resource; wherein, x is the thirtieth decimal number, or is determined based on the thirtieth decimal number and the total number of time-domain resources contained in the set of time-domain resources.

[0515] In one possible implementation, when each bit in the fourth sub-bit sequence is associated with a frequency domain resource in the frequency domain resource set, the determining unit 1502 is further configured to:

[0516] Determine whether the binary value of each bit in the fourth sub-bit sequence is a preset value; wherein, the preset value is binary data 0 or 1;

[0517] If the binary value is the preset value, then the frequency domain resource associated with the corresponding bit in the frequency domain resource set is taken as the first frequency domain resource.

[0518] In one possible implementation, when each bit sequence of length equal to the length of the fourth sub-bit sequence is associated with a frequency domain resource in the frequency domain resource set, the determining unit 1502 is further configured to:

[0519] Convert the fourth sub-bit sequence into a fourth decimal number;

[0520] From the set of frequency domain resources, the y-th frequency domain resource is selected as the first frequency domain resource; wherein, y is the fortieth decimal data, or is determined based on the fortieth decimal number and the total number of frequency domain resources contained in the set of frequency domain resources.

[0521] Based on the same inventive concept, one embodiment of the present invention provides a base station. Specific implementation methods for the data transmission method of this base station can be found in the description of the base station-side method embodiment section; repeated details will not be repeated here. Figure 16 The base station includes:

[0522] The receiving unit 1601 is used to receive the preamble sequence and the Physical Uplink Shared Channel (PUSCH) data;

[0523] The determining unit 1602 is configured to determine a first sub-bit sequence based on the position data of the received preamble sequence in the candidate preamble sequence set; and to determine a second sub-bit sequence based on the position data of the resource carrying the preamble sequence in the resource set.

[0524] The merging unit 1603 is used to merge the first sub-bit sequence and the second sub-bit sequence into one sequence according to the first sequence partitioning rule after determining that the preamble sequence is correct, so as to obtain the bit sequence associated with the PUSCH data; the first sequence partitioning rule is the rule of dividing the bit sequence into two parts.

[0525] Processing unit 1604 is configured to receive and process the PUSCH data using the bit sequence associated with the PUSCH data, the receiving and processing including descrambling or verifying the PUSCH data.

[0526] In one possible implementation, the determining unit 1602 is further configured to:

[0527] The position data of the received preamble sequence in the candidate preamble sequence set is converted into binary data and used as the first sub-bit sequence; wherein, the position data of the received preamble sequence in the candidate preamble sequence set is a decimal number;

[0528] Alternatively, the first sub-bit sequence can be determined based on the position data of the received preamble sequence in the candidate preamble sequence set and the total number of elements contained in the candidate sequence set.

[0529] One possible implementation is that the resource set consists of at least one of time-domain resources and frequency-domain resources for transmitting preambles, or time-frequency resources for transmitting preambles.

[0530] In one possible implementation, when each bit in the second sub-bit sequence is associated with a resource in the resource set, the determining unit 1602 is further configured to:

[0531] An initial sequence is constructed by considering whether each of the multiple consecutive resources carries the preamble sequence; wherein, when the preamble sequence is received on the resource, the value of the corresponding bit in the initial sequence is set to a preset value, and when the preamble sequence is not received on the resource, the value of the corresponding bit in the initial sequence is set to the inverted value of the preset value, wherein the preset value is 0 or 1;

[0532] Construct at least one sequence containing the initial sequence and having the stated length as the second sub-bit sequence.

[0533] In one possible implementation, when each bit sequence of length equal to the length of the second sub-bit sequence is associated with a resource in the resource set, the determining unit 1602 is further configured to:

[0534] The position data of the resource carrying the preamble sequence in the resource set is converted into binary data, which is used as the second sub-bit sequence; wherein, the position data of the resource carrying the preamble sequence in the resource set is a decimal number;

[0535] Alternatively, the second sub-bit sequence can be determined based on the position data of the resource carrying the preamble sequence in the resource set and the total number of elements contained in the resource set.

[0536] In one possible implementation, when the time-frequency resources in the resource set are continuous, the determining unit 1602 is further configured to:

[0537] The third sub-bit sequence is determined based on the position data of the time-domain resource corresponding to the time-frequency resource carrying the preamble sequence in the time-domain resource set.

[0538] The fourth sub-bit sequence is determined based on the position data of the frequency domain resource corresponding to the time-frequency resource carrying the preamble sequence in the frequency domain resource set;

[0539] According to the second sequence partitioning rule, the third sub-bit sequence and the fourth sub-bit sequence are merged into the second sub-bit sequence; wherein, the second sequence partitioning rule is the rule for dividing the second sub-bit sequence into two parts.

[0540] In one possible implementation, the determining unit 1602 is further configured to:

[0541] The position data of the time-domain resource carrying the preamble sequence in the time-domain resource set is converted into binary data and used as the third sub-bit sequence; wherein, the position data of the time-domain resource carrying the preamble sequence in the time-domain resource set is a decimal number;

[0542] Alternatively, the third sub-bit sequence can be determined based on the position data of the time-domain resource carrying the preamble sequence in the time-domain resource set, and the total number of elements contained in the time-domain resource set.

[0543] In one possible implementation, the determining unit 1602 is further configured to:

[0544] The position data of the frequency domain resource carrying the preamble sequence in the frequency domain resource set is converted into binary data and used as the fourth sub-bit sequence; wherein, the position data of the frequency domain resource carrying the preamble sequence in the frequency domain resource set is a decimal number;

[0545] Alternatively, the fourth sub-bit sequence can be determined based on the position data of the frequency domain resources carrying the preamble sequence in the frequency domain resource set, and the total number of elements contained in the frequency domain resource set.

[0546] It should be noted that the division of units in the embodiments of this application is illustrative and only represents one logical functional division. In actual implementation, other division methods may be used. Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated units described above can be implemented in hardware or as software functional units.

[0547] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a processor-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 storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) or processor to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned 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.

[0548] It should be noted that the apparatus provided in this embodiment of the invention can implement all the method steps implemented in the above method embodiment and can achieve the same technical effect. Therefore, the parts and beneficial effects that are the same as those in the method embodiment will not be described in detail here.

[0549] Based on the same inventive concept, embodiments of the present invention also provide a processor-readable storage medium storing a computer program for causing the processor to execute the data transmission method described above on the terminal side or base station side.

[0550] The processor-readable storage medium can be any available medium or data storage device that the processor can access, including but not limited to magnetic memory (e.g., floppy disk, hard disk, magnetic tape, magneto-optical disk (MO)), optical memory (e.g., CD, DVD, BD, HVD), and semiconductor memory (e.g., ROM, EPROM, EEPROM, non-volatile memory (NAND FLASH), solid-state drive (SSD)).

[0551] 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 implemented on one or more computer-usable storage media (including, but not limited to, disk storage and optical storage) containing computer-usable program code.

[0552] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It will 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-executable instructions. These computer-executable 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, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0553] These processor-executable instructions may also be stored in a processor-readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the processor-readable memory produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0554] These processors can execute instructions that can also be loaded onto a computer or other programmable data processing device, causing a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable device for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0555] Obviously, those skilled in the art can make various modifications and variations to this application without departing from the spirit and 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 method for data transmission, characterized in that, The method includes: Determine the bit sequence associated with the Physical Uplink Shared Channel (PUSCH) data to be transmitted; according to a first sequence partitioning rule, obtain a first sub-bit sequence and a second sub-bit sequence from the bit sequence; the first sequence partitioning rule is a rule that divides the bit sequence into two parts; Based on the first sub-bit sequence, a preamble sequence to be used during access is determined from a set of candidate preamble sequences; and based on the second sub-bit sequence, resources required to transmit the preamble sequence to be used during access are determined from a set of resources used by the Physical Random Access Channel (PRACH) for transmitting preamble sequences. Send the preamble sequence used during access on the resources required for the preamble sequence used during access, and send the PUSCH data after sending the preamble sequence used during access; Determine the bit sequence associated with the Physical Uplink Shared Channel (PUSCH) data to be transmitted, including: From the PUSCH data, obtain at least one of the following sequences: the sequence corresponding to the cyclic redundancy check bit, the terminal identifier, and the sequence corresponding to the feature bit in the PUSCH data; The at least one sequence is used as a bit sequence associated with the PUSCH data; The feature bits include: The first N bits of the PUSCH data; where N is a positive integer; Or, the last N bits of the PUSCH data; Alternatively, N bits determined from the PUSCH data according to preset rules.

2. The method as described in claim 1, characterized in that, The first sequence partitioning rule includes: The bit sequence is divided into two parts, which may be continuous or non-contiguous.

3. The method as described in claim 2, characterized in that, The two parts of the sequence are either continuous or non-contiguous, and their positions in the bit sequence do not overlap or partially overlap.

4. The method as described in claim 1, characterized in that, Based on the first sub-bit sequence, the preamble sequence of the PUSCH data is determined from the candidate preamble sequence set, including: Convert the first sub-bit sequence into a first decimal number; From the set of candidate preamble sequences, a candidate preamble sequence corresponding to the first decimal number is selected as the preamble sequence used during access.

5. The method as described in claim 4, characterized in that, Selecting a candidate preamble sequence corresponding to the first decimal number from the candidate preamble sequence set as the preamble sequence used during access includes: From the set of candidate preamble sequences, the i-th candidate preamble sequence is selected as the preamble sequence used during access; wherein i is the first decimal number, or is determined based on the first decimal number and the total number of elements contained in the set of candidate preamble sequences.

6. The method as described in claim 4, characterized in that, The resource set consists of at least one of time-domain resources and frequency-domain resources for transmitting the preamble, or time-frequency resources for transmitting the preamble.

7. The method as described in claim 6, characterized in that, When each bit in the second sub-bit sequence is associated with a resource in the resource set, based on the second sub-bit sequence, the resources required for transmitting the preamble sequence used during access are determined from the resource set used for transmitting the preamble sequence in the Physical Random Access Channel (PRACH), including: Determine whether the binary value of each bit in the second sub-bit sequence is a preset value; wherein, the preset value is binary data 0 or 1; If the binary value is the preset value, then the resource associated with the corresponding bit in the resource set is used as the resource required for the preamble sequence used during access.

8. The method as described in claim 6, characterized in that, When each bit sequence of length equal to the length of the second sub-bit sequence is associated with a resource in the resource set, based on the second sub-bit sequence, the resources required for transmitting the preamble sequence used during access are determined from the resource set used for transmitting the preamble sequence in the Physical Random Access Channel (PRACH), including: Convert the second sub-bit sequence into a base 20 number; From the resource set, the j-th resource is selected as the resource required for the preamble sequence used during access; wherein, j is the second decimal data, or is determined based on the second decimal number and the total number of resources contained in the resource set.

9. The method as described in claim 6, characterized in that, When the time-frequency resources for transmitting the preamble in the resource set are continuous, based on the second sub-bit sequence, the resources required for transmitting the PUSCH data preamble sequence are determined from the resource set used for transmitting the preamble sequence in the Physical Random Access Channel (PRACH), including: According to the second sequence partitioning rule, the third and fourth sub-bit sequences are obtained from the second sub-bit sequence; wherein, the second sequence partitioning rule is a rule that divides the second sub-bit sequence into two parts; Based on the third sub-bit sequence, a first time-domain resource is determined from the time-domain resource set corresponding to the time-frequency resource; based on the fourth sub-bit sequence, a first frequency-domain resource is determined from the frequency-domain resource set corresponding to the time-frequency resource. The time-frequency resources corresponding to the first time-domain resources and the first frequency-domain resources are used as the resources required for the preamble sequence used during access.

10. The method as described in claim 9, characterized in that, When each bit in the third sub-bit sequence is associated with a time-domain resource in the time-domain resource set, the first time-domain resource is determined from the time-domain resource set corresponding to the time-frequency resource based on the third sub-bit sequence, including: Determine whether the binary value of each bit in the third sub-bit sequence is a preset value; wherein, the preset value is binary data 0 or 1; If the binary value is the preset value, then the time-domain resources associated with the corresponding bit in the time-domain resource set are taken as the first time-domain resource.

11. The method as described in claim 9, characterized in that, When each bit sequence of length equal to the length of the third sub-bit sequence is associated with a time-domain resource in the time-domain resource set, the first frequency-domain resource is determined from the time-frequency resource set based on the third sub-bit sequence, including: Convert the third sub-bit sequence into a 30-base number; From the set of time-domain resources, the x-th time-domain resource is selected as the first time-domain resource; wherein, x is the thirtieth decimal number, or is determined based on the thirtieth decimal number and the total number of time-domain resources contained in the set of time-domain resources.

12. The method as described in claim 10 or 11, characterized in that, When each bit in the fourth sub-bit sequence is associated with a frequency domain resource in the frequency domain resource set, the first frequency domain resource is determined from the frequency domain resource set corresponding to the time-frequency resource based on the fourth sub-bit sequence, including: Determine whether the binary value of each bit in the fourth sub-bit sequence is a preset value; wherein, the preset value is binary data 0 or 1; If the binary value is the preset value, then the frequency domain resource associated with the corresponding bit in the frequency domain resource set is taken as the first frequency domain resource.

13. The method as described in claim 10 or 11, characterized in that, When each bit sequence of length equal to the length of the fourth sub-bit sequence is associated with a frequency domain resource in the frequency domain resource set, the first frequency domain resource is determined from the frequency domain resource set of the time-frequency resources based on the fourth sub-bit sequence, including: Convert the fourth sub-bit sequence into a fourth decimal number; From the frequency domain resource set, the y-th frequency domain resource is selected as the first frequency domain resource; wherein, y is the fortieth decimal data, or is determined based on the fortieth decimal number and the total number of frequency domain resources contained in the frequency domain resource set.

14. A method for data transmission, characterized in that, include: Receive the preamble sequence and the Physical Uplink Shared Channel (PUSCH) data; Based on the position data of the received preamble sequence in the candidate preamble sequence set, a first sub-bit sequence is determined; and based on the position data of the resource carrying the preamble sequence in the resource set, a second sub-bit sequence is determined. After confirming the correctness of the preamble sequence, the first sub-bit sequence and the second sub-bit sequence are merged into one sequence according to the first sequence partitioning rule to obtain the bit sequence associated with the PUSCH data. The first sequence partitioning rule is a rule that divides the bit sequence into two parts. The bit sequence associated with the PUSCH data is at least one of the following sequences obtained by the terminal from the PUSCH data: the sequence corresponding to the cyclic redundancy check bit, the terminal identifier, and the sequence corresponding to the feature bits in the PUSCH data. The feature bits include: the first N bits in the PUSCH data, where N is a positive integer; or the last N bits in the PUSCH data; or N bits determined from the PUSCH data according to a preset rule. The PUSCH data is received using the bit sequence associated with it, the receiving process including descrambling or verifying the PUSCH data.

15. The method as described in claim 14, characterized in that, Based on the position data of the received preamble sequence in the candidate preamble sequence set, the first sub-bit sequence is determined, including: The position data of the received preamble sequence in the candidate preamble sequence set is converted into binary data and used as the first sub-bit sequence; wherein, the position data of the received preamble sequence in the candidate preamble sequence set is a decimal number; Alternatively, the first sub-bit sequence can be determined based on the position data of the received preamble sequence in the candidate preamble sequence set and the total number of elements contained in the candidate preamble sequence set.

16. The method as described in claim 14, characterized in that, The resource set consists of at least one of time-domain resources and frequency-domain resources for transmitting preambles, or time-frequency resources for transmitting preambles.

17. The method as described in claim 16, characterized in that, When each bit in the second sub-bit sequence is associated with a resource in the resource set, the second sub-bit sequence is determined based on the position data of the resource carrying the preamble sequence in the resource set, including: An initial sequence is constructed by considering whether each of the multiple consecutive resources carries the preamble sequence; wherein, when the preamble sequence is received on the resource, the value of the corresponding bit in the initial sequence is set to a preset value, and when the preamble sequence is not received on the resource, the value of the corresponding bit in the initial sequence is set to the inverted value of the preset value, wherein the preset value is 0 or 1; Construct at least one sequence that includes the initial sequence and has the length corresponding to the second sub-bit sequence, as the second sub-bit sequence.

18. The method as described in claim 16, characterized in that, When each bit sequence of length equal to the length of the second sub-bit sequence is associated with a resource in the resource set, the second sub-bit sequence is determined based on the position data of the resource carrying the preamble sequence in the resource set, including: The position data of the resource carrying the preamble sequence in the resource set is converted into binary data, which is used as the second sub-bit sequence; wherein, the position data of the resource carrying the preamble sequence in the resource set is a decimal number; Alternatively, the second sub-bit sequence can be determined based on the position data of the resource carrying the preamble sequence in the resource set and the total number of elements contained in the resource set.

19. The method as described in claim 16, characterized in that, When the time-frequency resources in the resource set are continuous, the second sub-bit sequence is determined based on the position data of the resources carrying the preamble sequence in the resource set, including: The third sub-bit sequence is determined based on the position data of the time-domain resource corresponding to the time-frequency resource carrying the preamble sequence in the time-domain resource set. The fourth sub-bit sequence is determined based on the position data of the frequency domain resource corresponding to the time-frequency resource carrying the preamble sequence in the frequency domain resource set; According to the second sequence partitioning rule, the third sub-bit sequence and the fourth sub-bit sequence are merged into the second sub-bit sequence; wherein, the second sequence partitioning rule is the rule for dividing the second sub-bit sequence into two parts.

20. The method as described in claim 19, characterized in that, The third bit sequence is determined based on the position data of the time-domain resource carrying the preamble sequence in the time-domain resource set, including: The position data of the time-domain resource carrying the preamble sequence in the time-domain resource set is converted into binary data and used as the third sub-bit sequence; wherein, the position data of the time-domain resource carrying the preamble sequence in the time-domain resource set is a decimal number; Alternatively, the third sub-bit sequence can be determined based on the position data of the time-domain resource carrying the preamble sequence in the time-domain resource set, and the total number of elements contained in the time-domain resource set.

21. The method as described in claim 19, characterized in that, Based on the position data of the frequency domain resources carrying the preamble sequence in the frequency domain resource set, the fourth bit sequence is determined, including: The position data of the frequency domain resource carrying the preamble sequence in the frequency domain resource set is converted into binary data and used as the fourth sub-bit sequence; wherein, the position data of the frequency domain resource carrying the preamble sequence in the frequency domain resource set is a decimal number; Alternatively, the fourth sub-bit sequence can be determined based on the position data of the frequency domain resources carrying the preamble sequence in the frequency domain resource set, and the total number of elements contained in the frequency domain resource set.

22. A terminal, characterized in that, Includes memory, transceiver, and processor: A memory for storing computer programs; a transceiver for sending and receiving data under the control of the processor; and a processor for reading the computer programs from the memory and performing the following operations: Determine the bit sequence associated with the Physical Uplink Shared Channel (PUSCH) data to be transmitted; according to a first sequence partitioning rule, obtain a first sub-bit sequence and a second sub-bit sequence from the bit sequence; the first sequence partitioning rule is a rule that divides the bit sequence into two parts; Based on the first sub-bit sequence, a preamble sequence to be used during access is determined from a set of candidate preamble sequences; and based on the second sub-bit sequence, resources required to transmit the preamble sequence to be used during access are determined from a set of resources used by the Physical Random Access Channel (PRACH) for transmitting preamble sequences. Send the preamble sequence used during access on the resources required for the preamble sequence used during access, and send the PUSCH data after sending the preamble sequence used during access; The processor also uses: From the PUSCH data, obtain at least one of the following sequences: the sequence corresponding to the cyclic redundancy check bit, the terminal identifier, and the sequence corresponding to the feature bit in the PUSCH data; The at least one sequence is used as a bit sequence associated with the PUSCH data; The feature bits include: The first N bits of the PUSCH data; where N is a positive integer; Or, the last N bits of the PUSCH data; Alternatively, N bits determined from the PUSCH data according to preset rules.

23. The terminal as described in claim 22, characterized in that, The first sequence partitioning rule includes: The bit sequence is divided into two parts, which may be continuous or non-contiguous.

24. The terminal as described in claim 23, characterized in that, The two parts of the sequence are either continuous or non-contiguous, and their positions in the bit sequence do not overlap or partially overlap.

25. The terminal as described in claim 22, characterized in that, The processor also uses: Convert the first sub-bit sequence into a first decimal number; From the set of candidate preamble sequences, a candidate preamble sequence corresponding to the first decimal number is selected as the preamble sequence used during access.

26. The terminal as described in claim 25, characterized in that, The processor also uses: From the set of candidate preamble sequences, the i-th candidate preamble sequence is selected as the preamble sequence used during access; wherein i is the first decimal number, or is determined based on the first decimal number and the total number of elements contained in the set of candidate preamble sequences.

27. The terminal as described in claim 25, characterized in that, The resource set consists of at least one of time-domain resources and frequency-domain resources for transmitting the preamble, or time-frequency resources for transmitting the preamble.

28. The terminal as described in claim 27, characterized in that, When each bit in the second sub-bit sequence is associated with a resource in the resource set, the processor also uses: Determine whether the binary value of each bit in the second sub-bit sequence is a preset value; wherein, the preset value is binary data 0 or 1; If the binary value is the preset value, then the resource associated with the corresponding bit in the resource set is used as the resource required for the preamble sequence used during access.

29. The terminal as described in claim 27, characterized in that, When each bit sequence of length equal to the length of the second sub-bit sequence is associated with a resource in the resource set, the processor further uses: Convert the second sub-bit sequence into a base 20 number; From the resource set, the j-th resource is selected as the resource required for the preamble sequence used during access; wherein, j is the second decimal data, or is determined based on the second decimal number and the total number of resources contained in the resource set.

30. The terminal as described in claim 27, characterized in that, When the time-frequency resources used for transmitting the preamble in the resource set are continuous, the processor also uses: According to the second sequence partitioning rule, the third and fourth sub-bit sequences are obtained from the second sub-bit sequence; wherein, the second sequence partitioning rule is a rule that divides the second sub-bit sequence into two parts; Based on the third sub-bit sequence, a first time-domain resource is determined from the time-domain resource set corresponding to the time-frequency resource; based on the fourth sub-bit sequence, a first frequency-domain resource is determined from the frequency-domain resource set corresponding to the time-frequency resource. The time-frequency resources corresponding to the first time-domain resources and the first frequency-domain resources are used as the resources required for the preamble sequence used during access.

31. The terminal as described in claim 30, characterized in that, When each bit in the third sub-bit sequence is associated with a time-domain resource in the time-domain resource set, the processor further uses: Determine whether the binary value of each bit in the third sub-bit sequence is a preset value; wherein, the preset value is binary data 0 or 1; If the binary value is the preset value, then the time-domain resources associated with the corresponding bit in the time-domain resource set are taken as the first time-domain resource.

32. The terminal as described in claim 30, characterized in that, When each bit sequence of length equal to the length of the third sub-bit sequence is associated with a time-domain resource in the time-domain resource set, the processor further uses: Convert the third sub-bit sequence into a 30-base number; From the set of time-domain resources, the x-th time-domain resource is selected as the first time-domain resource; wherein, x is the thirtieth decimal number, or is determined based on the thirtieth decimal number and the total number of time-domain resources contained in the set of time-domain resources.

33. The terminal as described in claim 31 or 32, characterized in that, When each bit in the fourth sub-bit sequence is associated with a frequency domain resource in the frequency domain resource set, the processor also uses: Determine whether the binary value of each bit in the fourth sub-bit sequence is a preset value; wherein, the preset value is binary data 0 or 1; If the binary value is the preset value, then the frequency domain resource associated with the corresponding bit in the frequency domain resource set is taken as the first frequency domain resource.

34. The terminal as described in claim 31 or 32, characterized in that, When each bit sequence of length equal to the length of the fourth sub-bit sequence is associated with a frequency domain resource in the frequency domain resource set, the processor further uses: Convert the fourth sub-bit sequence into a fourth decimal number; From the frequency domain resource set, the y-th frequency domain resource is selected as the first frequency domain resource; wherein, y is the fortieth decimal data, or is determined based on the fortieth decimal number and the total number of frequency domain resources contained in the frequency domain resource set.

35. A base station, characterized in that, Includes memory, transceiver, and processor: A memory for storing computer programs; a transceiver for sending and receiving data under the control of the processor; and a processor for reading the computer programs from the memory and performing the following operations: Receive the preamble sequence and the Physical Uplink Shared Channel (PUSCH) data; Based on the position data of the received preamble sequence in the candidate preamble sequence set, a first sub-bit sequence is determined; and based on the position data of the resource carrying the preamble sequence in the resource set, a second sub-bit sequence is determined. After confirming the correctness of the preamble sequence, the first sub-bit sequence and the second sub-bit sequence are merged into one sequence according to the first sequence partitioning rule to obtain the bit sequence associated with the PUSCH data. The first sequence partitioning rule is a rule that divides the bit sequence into two parts. The bit sequence associated with the PUSCH data is at least one of the following sequences obtained by the terminal from the PUSCH data: the sequence corresponding to the cyclic redundancy check bit, the terminal identifier, and the sequence corresponding to the feature bits in the PUSCH data. The feature bits include: the first N bits in the PUSCH data, where N is a positive integer; or the last N bits in the PUSCH data; or N bits determined from the PUSCH data according to a preset rule. The PUSCH data is received using the bit sequence associated with it, the receiving process including descrambling or verifying the PUSCH data.

36. The base station as described in claim 35, characterized in that, The processor also uses: The position data of the received preamble sequence in the candidate preamble sequence set is converted into binary data and used as the first sub-bit sequence; wherein, the position data of the received preamble sequence in the candidate preamble sequence set is a decimal number; Alternatively, the first sub-bit sequence can be determined based on the position data of the received preamble sequence in the candidate preamble sequence set and the total number of elements contained in the candidate preamble sequence set.

37. The base station as described in claim 35, characterized in that, The resource set consists of at least one of time-domain resources and frequency-domain resources for transmitting preambles, or time-frequency resources for transmitting preambles.

38. The base station as described in claim 37, characterized in that, When each bit in the second sub-bit sequence is associated with a resource in the resource set, the processor also uses: An initial sequence is constructed by considering whether each of the multiple consecutive resources carries the preamble sequence; wherein, when the preamble sequence is received on the resource, the value of the corresponding bit in the initial sequence is set to a preset value, and when the preamble sequence is not received on the resource, the value of the corresponding bit in the initial sequence is set to the inverted value of the preset value, wherein the preset value is 0 or 1; Construct at least one sequence that includes the initial sequence and has the length corresponding to the second sub-bit sequence, as the second sub-bit sequence.

39. The base station as described in claim 37, characterized in that, When each bit sequence of length equal to the length of the second sub-bit sequence is associated with a resource in the resource set, the processor further uses: The position data of the resource carrying the preamble sequence in the resource set is converted into binary data, which is used as the second sub-bit sequence; wherein, the position data of the resource carrying the preamble sequence in the resource set is a decimal number; Alternatively, the second sub-bit sequence can be determined based on the position data of the resource carrying the preamble sequence in the resource set and the total number of elements contained in the resource set.

40. The base station as described in claim 37, characterized in that, When the time-frequency resources in the resource set are continuous, the processor also uses: The third sub-bit sequence is determined based on the position data of the time-domain resource corresponding to the time-frequency resource carrying the preamble sequence in the time-domain resource set. The fourth sub-bit sequence is determined based on the position data of the frequency domain resource corresponding to the time-frequency resource carrying the preamble sequence in the frequency domain resource set; According to the second sequence partitioning rule, the third sub-bit sequence and the fourth sub-bit sequence are merged into the second sub-bit sequence; wherein, the second sequence partitioning rule is the rule for dividing the second sub-bit sequence into two parts.

41. The base station as described in claim 40, characterized in that, The processor also uses: The position data of the time-domain resource carrying the preamble sequence in the time-domain resource set is converted into binary data and used as the third sub-bit sequence; wherein, the position data of the time-domain resource carrying the preamble sequence in the time-domain resource set is a decimal number; Alternatively, the third sub-bit sequence can be determined based on the position data of the time-domain resource carrying the preamble sequence in the time-domain resource set, and the total number of elements contained in the time-domain resource set.

42. The base station as described in claim 40, characterized in that, The processor also uses: The position data of the frequency domain resource carrying the preamble sequence in the frequency domain resource set is converted into binary data and used as the fourth sub-bit sequence; wherein, the position data of the frequency domain resource carrying the preamble sequence in the frequency domain resource set is a decimal number; Alternatively, the fourth sub-bit sequence can be determined based on the position data of the frequency domain resources carrying the preamble sequence in the frequency domain resource set, and the total number of elements contained in the frequency domain resource set.

43. A terminal, characterized in that, include: A partitioning unit is used to determine the bit sequence associated with the Physical Uplink Shared Channel (PUSCH) data to be transmitted; and to obtain a first sub-bit sequence and a second sub-bit sequence from the bit sequence according to a first sequence partitioning rule; the first sequence partitioning rule is a rule that divides the bit sequence into two parts. The determining unit is configured to determine, based on the first sub-bit sequence, a preamble sequence to be used during access from a set of candidate preamble sequences; and, based on the second sub-bit sequence, determine the resources required to transmit the preamble sequence to be used during access from a set of resources used by the Physical Random Access Channel (PRACH) for transmitting the preamble sequence. The sending unit is configured to send the preamble sequence used during access on the resources required by the preamble sequence used during access, and send the PUSCH data after sending the preamble sequence used during access; The determining unit is further configured to obtain at least one sequence from the PUSCH data, including the sequence corresponding to the cyclic redundancy check bit, the terminal identifier, and the sequence corresponding to the feature bits in the PUSCH data; and to use the at least one sequence as a bit sequence associated with the PUSCH data; the feature bits include: the first N bits in the PUSCH data, where N is a positive integer; or, the last N bits in the PUSCH data; or, N bits determined from the PUSCH data according to a preset rule.

44. A base station, characterized in that, include: The receiving unit is used to receive the preamble sequence and the Physical Uplink Shared Channel (PUSCH) data. The determining unit is configured to determine a first sub-bit sequence based on the position data of the received preamble sequence in a set of candidate preamble sequences; and to determine a second sub-bit sequence based on the position data of the resource carrying the preamble sequence in a set of resources. The merging unit is used to merge the first sub-bit sequence and the second sub-bit sequence into one sequence according to a first sequence partitioning rule after confirming that the preamble sequence is correct, thereby obtaining a bit sequence associated with the PUSCH data. The first sequence partitioning rule is a rule that divides the bit sequence into two parts. The bit sequence associated with the PUSCH data is at least one of the following sequences obtained by the terminal from the PUSCH data: the sequence corresponding to the cyclic redundancy check (CRC) bit, the terminal identifier, and the sequence corresponding to the feature bits in the PUSCH data. The feature bits include: the first N bits in the PUSCH data, where N is a positive integer; or the last N bits in the PUSCH data; or N bits determined from the PUSCH data according to a preset rule. A processing unit is configured to receive and process the PUSCH data using the bit sequence associated with the PUSCH data, the receiving and processing including descrambling or verifying the PUSCH data.

45. A processor-readable storage medium, characterized in that, The processor-readable storage medium stores a computer program for causing the processor to perform the method according to any one of claims 1 to 21.

Images