Random access method, electronic device, and computer-readable storage medium

Abstract

The present disclosure provides a random access method, comprising: acquiring a first preamble index from a first random access preamble message, and acquiring a first preamble identifier from a received first random access response message, the first random access response message being used for responding to the first random access preamble message; acquiring a target difference value between the first preamble index and the first preamble identifier; when the target difference value satisfies a preset condition, performing numerical value adjustment processing on a first uplink timing advance to obtain a second uplink timing advance, the first uplink timing advance being an uplink timing advance initial value used in the process of sending a random access preamble message; and performing random access processing on the basis of the second uplink timing advance. The present disclosure further provides an electronic device and a computer-readable storage medium.

Description

Random access method, electronic device, and computer-readable storage medium

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims priority to Chinese patent application No. 202311169869.4 filed on September 11, 2023, the contents of which are incorporated herein by reference in their entirety. Technical Field

[0003] The present disclosure relates to, but is not limited to, the field of communication technology, and in particular to a random access method, an electronic device, and a computer-readable storage medium. Background Art

[0004] Random access (RA) is the process by which a user equipment (UE) applies for uplink authorization in the idle or connected state and establishes uplink synchronization with the eNodeB (evolved Node B). A UE that is newly accessed or just powered on can only transmit data and perform other operations after successful random access. Therefore, successful random access is crucial to whether the UE can transmit data or work.

[0005] In the related art, when the UE performs random access, if random access fails, it usually uses a power boosting method to strengthen the transmission of the preamble index (Preambleid) until multiple random access failures occur and the number of failures reaches the maximum number of transmissions of the preamble index, and then reports the random access failure to the protocol stack.

[0006] Public content

[0007] In a first aspect, an embodiment of the present disclosure provides a random access method, including: obtaining a first preamble code index from a first random access preamble message, and obtaining a first preamble code identifier from a received first random access response message, wherein the first random access response message is used to respond to the first random access preamble message; obtaining a target difference between the first preamble code index and the first preamble code identifier; if the target difference meets a preset condition, numerically adjusting a first uplink timing advance to obtain a second uplink timing advance, wherein the first uplink timing advance is an initial value of the uplink timing advance used in the process of sending the random access preamble message; and performing random access processing based on the second uplink timing advance.

[0008] In a second aspect, an embodiment of the present disclosure provides an electronic device, comprising: at least one processor; and a memory on which at least one computer program is stored. When the at least one computer program is executed by the at least one processor, the at least one processor implements the random access method described in the first aspect of the embodiment of the present disclosure.

[0009] In a third aspect, an embodiment of the present disclosure provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program is executed by a processor so that the processor implements the random access method described in the first aspect of the embodiment of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] FIG1 is a flow chart of a random access method provided by an embodiment of the present disclosure;

[0011] FIG2 is a flowchart for determining whether a target difference satisfies a preset condition according to an embodiment of the present disclosure;

[0012] FIG3 is a flow chart of a numerical adjustment process for a timing advance according to an embodiment of the present disclosure;

[0013] FIG4 is a block diagram of an electronic device according to an embodiment of the present disclosure;

[0014] FIG5 is a block diagram of a computer-readable storage medium according to an embodiment of the present disclosure;

[0015] FIG6 is a schematic diagram of random access processing provided by an embodiment of the present disclosure. DETAILED DESCRIPTION

[0016] To enable those skilled in the art to better understand the technical solutions of the present disclosure, the random access method, electronic device, and computer-readable storage medium provided by the embodiments of the present disclosure are described in detail below with reference to the accompanying drawings.

[0017] The present disclosure will be described more fully below with reference to the accompanying drawings, but the embodiments shown may be embodied in different forms, and the present disclosure should not be construed as limited to the embodiments set forth below. These embodiments are provided to make the present disclosure more thorough and complete and to enable those skilled in the art to fully understand the scope of the present disclosure.

[0018] The accompanying drawings of the embodiments of the present disclosure are used to provide a further understanding of the embodiments of the present disclosure and constitute a part of the specification. Together with the detailed embodiments, they are used to explain the present disclosure and do not constitute a limitation of the present disclosure. By describing the detailed embodiments with reference to the accompanying drawings, the above and other features and advantages will become more apparent to those skilled in the art.

[0019] The present disclosure may be described with reference to plan views and / or cross-sectional views by way of ideal schematic views of the present disclosure. Therefore, the exemplary illustrations may be modified according to manufacturing techniques and / or tolerances.

[0020] In the absence of conflict, the various embodiments of the present disclosure and the various features therein may be combined with each other.

[0021] The terms used in this disclosure are only used to describe specific embodiments and do not limit the disclosure. As used in this disclosure, the term "and / or" includes any and all combinations of one or more related enumerated items. As used in this disclosure, the singular forms "a" and "the" are also intended to include plural forms, unless the context clearly indicates otherwise. As used in this disclosure, the terms "comprising" and "made of" specify the presence of specific features, wholes, steps, operations, elements and / or components, but do not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or groups thereof.

[0022] Unless otherwise defined, all terms (including technical and scientific terms) used in this disclosure have the same meanings as those commonly understood by those skilled in the art. It will also be understood that terms such as those defined in commonly used dictionaries should be interpreted as having a meaning consistent with their meaning in the context of the relevant art and this disclosure, and will not be interpreted as having an idealized or overly formal meaning unless expressly defined in this disclosure.

[0023] The present disclosure is not limited to the embodiments shown in the drawings, but includes modifications of the configurations formed based on the manufacturing process. Therefore, the regions illustrated in the drawings have schematic properties, and the shapes of the regions shown in the drawings illustrate the specific shapes of the regions of the elements, but are not intended to be limiting.

[0024] Random access (RA) is the process in which a UE applies for uplink authorization in an idle or connected state and establishes uplink synchronization with an eNodeB. Random access is generally divided into competitive random access and non-competitive random access. Competitive random access generally includes four steps: Step 1: The UE sends a random access preamble message, also known as MSG1. The random access preamble message contains a preamble index (Preambleid), also known as a preamble sequence code; Step 2: The eNodeB receives the random access preamble message and sends a random access response message (RAR, Random Access Response), also known as MSG2. In this step, if the preamble identifier (RAPID, Random Access Preamble) in the random response message received by the UE is If the IDentifier) ​​is the same as the PreambleID in MSG1 sent by the UE, the response is successful; then, in step 3, the UE sends an uplink scheduling transmission message, also called MSG3; in step 4, after the UE sends MSG3, the contention resolution timer starts, and the eNodeB uses the C-RNTI on the PDCCH or the UE contention resolution identity IE on the PDSCH to assist the UE in contention resolution. If, before the contention resolution timer expires, the UE receives a contention resolution message sent by the eNodeB, also called MSG4, the contention resolution is considered successful. At this point, the random access process is successful, that is, the UE successfully establishes uplink synchronization with the eNodeB and can perform data transmission and other tasks afterwards.

[0025] It should be noted that, unless otherwise specified, the random access in the random access method provided in the present disclosure generally refers to competitive random access. Of course, in actual implementation, the method can also be applied to non-competitive random access processing, and no special limitation is made here.

[0026] In the random access process, when the RAPID in the MSG2 received by the UE is different from the Preambleid in the MSG1 sent by it, that is, after the RAR matching fails, the UE often only uses the power raising method to strengthen the transmission of the Preambleid until the number of failed retransmissions reaches the maximum number of transmissions of the preamble code index and then reports the random access failure to the protocol stack. However, when the RAR matching fails and the number of failed retransmissions does not reach the maximum number of transmissions, how to adopt an active strategy to improve the RAR matching success rate and thus improve the success rate of random access is not explained in the relevant technology.

[0027] In the random access method provided in the present disclosure, considering that during the random access process, if only a power-raising method is adopted to strengthen the transmission of the PreambleID after an RAR match fails, it is difficult to significantly improve the success rate of the random access process. Therefore, in order to improve the success rate of random access, during the random access process between the UE and the eNodeB, if an RAR match fails, the UE can expand or reduce the uplink boundary by adjusting the uplink timing advance, thereby improving the success rate of random access by improving the RAR match success rate.

[0028] FIG1 is a flowchart of a random access method provided by an embodiment of the present disclosure.

[0029] In a first aspect, referring to FIG. 1 , an embodiment of the present disclosure provides a random access method, which can be applied to a terminal UE and includes steps S1 to S4 .

[0030] S1. Acquire a first preamble index from a first random access preamble message, and acquire a first preamble identifier from a received first random access response message, where the first random access response message is used to respond to the first random access preamble message.

[0031] In the random access method provided in the present disclosure, the first random access preamble message, i.e., the first MSG1, is a preamble message including a first preamble code index sent by the UE to the eNodeB when performing random access processing with the eNodeB; the first random access response message, i.e., the first MSG2, is a response message including a first preamble code identifier sent by the eNodeB and received by the UE after sending the first MSG1.

[0032] S2. Obtain a target difference between the first preamble index and the first preamble identifier.

[0033] S3. When the target difference satisfies a preset condition, numerically adjust the first uplink timing advance to obtain a second uplink timing advance, where the first uplink timing advance is an initial value of the uplink timing advance used in sending the random access preamble message.

[0034] S4. Perform random access processing based on the second uplink timing advance.

[0035] The first uplink timing advance is the default timing advance used when the UE sends MSG1; the second uplink timing advance may be a timing advance adapted to the current communication scenario obtained by numerically adjusting the first uplink timing advance.

[0036] The target difference value may be used to determine whether the first preamble index and the first preamble identifier match.

[0037] In the random access method provided by the present disclosure, whether the preamble code index and the preamble code identifier match refers to whether the preamble code index and the preamble code identifier are the same. If the difference between the preamble code index and the preamble code identifier is 0, it means that the two match. In this case, the UE can perform subsequent processing, that is, send a scheduling transmission message MSG3 and receive a conflict resolution message MSG4 sent by the eNodeB. If the difference between the two is not 0, it means that the two do not match. In this case, the UE often needs to resend MSG1 until the number of failed retransmissions reaches the maximum number of transmissions.

[0038] Timing Advance (TA) is the time in advance that the UE sends instructions. During wireless communications, signals are typically delayed in spatial transmission. For example, when UE1 communicates with the eNodeB, if UE1 simultaneously moves away from the eNodeB, the signal will typically arrive at the eNodeB later and later. This delay causes the signal from UE1 received by the eNodeB in the current timeslot to overlap with the next timeslot in which the base station receives the signal from another UE2, causing inter-symbol interference. Therefore, when communicating between the UE and the eNodeB, the eNodeB typically detects the arrival time of the UE's signal and sends a command to the UE on the downlink channel, instructing the UE to send its signal in advance. This time is the TA.

[0039] In the random access method provided by the present disclosure, the target difference meeting the preset condition may include: the target difference is not 0; when the target difference is not 0, it usually means that the PreambleID in the MSG1 sent by the UE does not match the RAPID in the received MSG2. In this case, the UE needs to resend the MSG1. In the related art, in order to improve the matching success rate, the power is often increased to strengthen the transmission of the PreambleID. In the random access method provided by the present disclosure, considering that in the matching process of the PreambleID and the RAPID, the matching is actually performed within the uplink boundary range, therefore, as long as the PreambleID falls within the uplink boundary, Both can be successfully matched with RAPID. However, in the actual network deployment process, there may be unreasonable situations, which may cause the uplink boundary to exceed the cell range, resulting in a mismatch between Preambleid and RAPID. For this reason, the random access method provided by the present disclosure adjusts the uplink timing advance of the UE to expand or reduce the uplink boundary when the Preambleid in MSG1 does not match the RAPID in the received MSG2, thereby increasing or reducing the time for the signal sent by the UE to reach the eNodeB, thereby avoiding inter-code interference and improving the matching success rate between the Preambleid in MSG1 and the RAPID in the received MSG2.

[0040] It should be noted that this is only an example. In actual implementation, the preset conditions can also be set as needed and are not specifically limited here.

[0041] It can be seen that in the random access method provided by the embodiment of the present disclosure, when the target difference between the first preamble code index in the sent first random access preamble message and the first preamble code identifier in the received first random access response message meets the preset condition, that is, when the random access matching failure is determined based on the target difference, the initially used first uplink timing advance (TA, Timing Advance) is adjusted to expand or narrow the uplink boundary, and random access processing is performed based on the adjusted second uplink timing advance, thereby avoiding random access RAR matching failure and improving the success rate of random access.

[0042] 2 , in some embodiments, in the above step S3 , when the target difference satisfies a preset condition, numerically adjusting the first uplink timing advance to obtain the second uplink timing advance includes: step S311 and step S312 .

[0043] Step S311: Obtain a historical difference corresponding to the target difference, where the historical difference is the difference between the preamble index in the random access preamble message sent in n consecutive moments before the current moment and the preamble identifier in the corresponding random access response message received, and n is a positive integer.

[0044] Step S312: When the target difference is the same as the historical difference and the value of n+1 is greater than or equal to a preset threshold, a numerical adjustment process is performed on the first uplink timing advance to obtain a second uplink timing advance.

[0045] Taking into account that occasional factors in the communication process may also cause the Preambleid in MSG1 to fail to match the received RAPID in MSG2, therefore, in order to improve the matching success rate, in this embodiment, the preset condition may also be: the historical difference between the Preambleid in MSG1 retransmitted n times continuously before the moment and the received corresponding RAPID in MSG2 is the same as the target difference, and the value of n+1 is greater than or equal to a preset threshold, which may be, for example, 3.

[0046] In this embodiment, in order to improve the matching success rate and eliminate the interference of accidental factors, the UE can continuously retransmit MSG1 a preset number of times, for example, 3 times of MSG1, and in the process of the 3 retransmissions, the difference between the Preambleid in the sent MSG1 and the RAPID in the received corresponding MSG2 is the same value. It is determined that the uplink timing advance is not set reasonably and causes the matching failure. In this case, it can be considered to directly perform a numerical adjustment process on the first uplink timing advance to obtain a second uplink timing advance.

[0047] For example, assuming that when MSG1 is sent for the first time, Preambleid=42, and RAPID in the received MSG2=44; when MSG1 is sent for the second time, Preambleid=5, and RAPID in the received MSG2=6; when MSG1 is sent for the third time, Preambleid=32, and RAPID in the received MSG2=33; when MSG1 is sent for the fourth time, Preambleid=24, and RAPID in the received MSG2=25; then, when the preset threshold is 3 times, considering that the difference between Preambleid and RAPID is 2 when MSG1 is sent for the first time, the difference between Preambleid and RAPID is 1 when MSG1 is sent for the second, third, and fourth time. Therefore, after MSG1 is sent for the fourth time and the corresponding MSG2 is received, before MSG1 is sent for the fifth time, the initially used uplink timing advance can be numerically adjusted, and MSG1 is sent for the fifth time based on the obtained second uplink timing advance, so as to improve the success rate of random access processing by improving the RAR matching success rate.

[0048] In some embodiments, referring to FIG. 3 , in step S3 , the step of performing numerical adjustment on the first uplink timing advance to obtain the second uplink timing advance may include steps S321 to S323 .

[0049] Step S321: Obtain a first adjustment value, and obtain a target step value, where the first adjustment value includes a value obtained during the numerical adjustment process at a first moment, where the first moment is a moment corresponding to a moment of receiving a second random access response message, where the second random access response message is used to respond to a second random access preamble message, and the second random access preamble message is a preamble message sent at a previous moment.

[0050] Step S322: Obtain a second adjustment value according to the first adjustment value and the target step value.

[0051] Step S323: Obtain a second uplink timing advance according to the first uplink timing advance and the second adjustment value.

[0052] CtrlFixTa(i) represents a first adjustment value, which may be an adjustment value of the timing advance used in the i-th random access process. CtrlFixTa(i+1) represents a second adjustment value, which may be an adjustment value of the timing advance to be used in the i+1-th random access process. That is, the first adjustment value is an adjustment value of the timing advance used at the previous moment, that is, the last time MSG1 was sent. The second adjustment value is an adjustment value of the timing advance used by MSG1 to be sent at the current moment.

[0053] It is understandable that the initial value of the first adjustment value may be 0, or may be set as required, which is not particularly limited here.

[0054] With FixTaStep representing the target step value, according to the above steps S321 to S323 , the second adjustment value can be obtained by the following formula 1: CtrlFixTa(i+1)=CtrlFixTa(i)+FixTaStep(1).

[0055] In actual implementation, the target step value can be set as needed. For example, the target step value can be a preset value of 10, which is not specifically limited here.

[0056] In some embodiments, in step S321, obtaining the target step value may include: obtaining a first length of a preamble sequence in a first random access preamble message, a cyclic shift value corresponding to the preamble sequence, and a second length of a ZC sequence corresponding to the preamble sequence; and obtaining a target step value based on the first length, the cyclic shift value, and the second length.

[0057] Taking into account that when the target step value is a fixed value, the uplink boundary may be adjusted too large or too small due to unreasonable setting of the adjustment value, thereby causing matching failure. For this reason, the target step value can be set according to the relevant parameters of the preamble code sequence to be sent during the random access processing.

[0058] The first length of the preamble sequence can use different values ​​according to the format of the preamble sequence. For details, please refer to Table 5.7.1-1 in the TS36.211 protocol; the cyclic shift value corresponding to the preamble sequence is a cyclic shift value generated based on the preamble sequence, and its value can be found in Table 5.7.2.1 in the TS36.211 protocol; the second length of the ZC sequence corresponding to the preamble sequence, its value can be found in Table 5.7.2-2 and Table 5.7.2-3 in the TS36.211 protocol.

[0059] Denote the first length by T_SEQ, denote the cyclic shift value corresponding to the preamble sequence by Ncs, and denote the second length of the ZC sequence corresponding to the preamble sequence by Nzc, then the target step value can be obtained by the following formula 2: FixTaStep=T_SEQ*Ncs / Nzc (2).

[0060] It can be seen that in the random access method provided by the present disclosure, by obtaining the target step value according to the relevant parameters of the preamble code sequence in the actually sent MSG1, the TA adjustment amount calculated based on the target step value can be more adapted to the communication scenario between the UE and the eNodeB, thereby improving the random access success rate by improving the RAR matching success rate.

[0061] In some embodiments, obtaining the target step size value based on the first length, the cyclic shift value, and the second length may include: obtaining a preset step size adjustment parameter, the preset step size adjustment parameter being used to narrow the step size adjustment range; obtaining a first step size value based on the first length, the cyclic shift value, and the second length; and obtaining the target step size value based on the first step size value and the preset step size adjustment parameter.

[0062] In order to avoid the phenomenon that the boundary adjustment becomes farther and farther and the matching cannot be caused due to the step value being set too large during the process of expanding or shrinking the uplink boundary, a preset step adjustment parameter can also be set in the actual processing process. The preset step adjustment parameter can be a fixed value. After the first step value is calculated, the first step value can be reduced based on the preset step adjustment parameter to reduce the step size of each adjustment, thereby reducing the risk and improving the RAR matching success rate.

[0063] The preset step size adjustment parameter is represented by Cstep. In this embodiment, the first step size value can be obtained by solving the above formula 2, and then the first step size value is divided by the preset step size adjustment parameter to obtain the target step size value, that is, the target step size value is still represented by FixTaStep. In this embodiment, the target step size value can be obtained by the following formula 3: FixTaStep = T_SEQ*Ncs / Nzc / Cstep (3).

[0064] In addition, in some embodiments, obtaining the second adjustment value based on the first adjustment value and the target step value includes: obtaining a target sign of the target difference, the target sign is used to indicate whether the target difference is a positive value; and obtaining the second adjustment value based on the first adjustment value, the target step value and the target sign.

[0065] That is, in actual processing, there may be a problem of the upper boundary being set too large or adjusted too large. In this case, the TA adjustment amount, that is, the sign of the second adjustment value, can be set according to the positive or negative value of the target difference. For example, if the target difference is greater than 0, that is, the target difference is positive, then the second adjustment value is set to a positive value. If the target difference is less than 0, that is, the target difference is negative, then the second adjustment value is set to a negative value.

[0066] In some embodiments, before performing numerical adjustment processing on the first uplink timing advance to obtain the second uplink timing advance when the target difference meets the preset condition (step S3), the random access method may further include: obtaining the current number of preamble transmission times; and when the number of preamble transmission times is less than or equal to the preset transmission threshold, performing the numerical adjustment processing on the first uplink timing advance to obtain the second uplink timing advance when the target difference meets the preset condition (step S3).

[0067] The number of preamble transmission times refers to the number of times MSG1 is resent in the event of a matching failure in one random access process.

[0068] That is, to avoid unnecessary processing, before executing the above step S3, you can also obtain the current number of preamble transmission times, and determine whether the current number of preamble transmission times is less than or equal to the preset transmission threshold. If it is less than or equal to the preset transmission threshold, execute step S3. If it is greater than the preset transmission threshold, there is no need to execute step S3. The preset transmission threshold can be, for example, 10, or can be set as needed, and there is no special limitation here.

[0069] For example, if Preamble_Transmission_Counter represents the number of preamble transmissions, its initial value may be set to 1, and before preparing to send MSG1, the value may be incremented by 1. After executing MSG1 once and obtaining the target difference, it may be determined whether Preamble_Transmission_Counter is less than or equal to a preset transmission threshold (PreambleTransMax). If Preamble_Transmission_Counter is less than or equal to PreambleTransMax, step S3 may be executed to determine whether to adjust the value of the uplink timing advance, and retransmit MSG1 based on the second uplink timing advance obtained after the adjustment.

[0070] In some embodiments, in the above-mentioned step S4, the random access processing based on the second uplink timing advance includes: resending a third random access preamble message based on the second uplink timing advance, and receiving a corresponding third random access response message; when the difference between the third preamble code index in the third random access preamble message and the third preamble code identifier in the third random access response message is 0, and the subsequently sent scheduling transmission message and the received conflict resolution message are both decoded successfully, it is determined that the random access processing is successfully completed.

[0071] That is, after obtaining the second uplink timing advance, MSG1 can be resent based on the second uplink timing advance, and MSG2 corresponding to the MSG1 can be received. If, in this transmission, the difference between the Preambleid sent in MSG1 and the RAPID received in the corresponding MSG2 is 0, that is, the two match successfully, then the UE can send MSG3, and, when MSG4 sent by the eNodeB is received and both are decoded successfully, the random access processing is successfully completed.

[0072] It can be understood that in some embodiments, if the difference between the third preamble code index and the third preamble code identifier is not 0, it can be determined whether the difference meets the preset condition. If so, the first uplink time advance can be numerically adjusted to obtain a new second uplink time advance, and MSG1 can be retransmitted and MSG2 can be received again until the match is successful, or, when the current number of preamble transmissions is greater than the preset transmission threshold, it is determined that random access has failed.

[0073] In the second aspect, referring to Figure 4, an embodiment of the present disclosure provides an electronic device, including: at least one processor 101; a memory 102, on which at least one computer program is stored. When the at least one computer program is executed by the at least one processor, the at least one processor implements the random access method described in the first aspect of the embodiment of the present disclosure.

[0074] In some embodiments, the electronic device further includes: at least one or more I / O interfaces 103 connected between the processor and the memory, and configured to implement information interaction between the processor and the memory.

[0075] The processor 101 is a device with data processing capabilities, including but not limited to a central processing unit (CPU); the memory 102 is a device with data storage capabilities, including but not limited to random access memory (RAM, more specifically such as SDRAM, DDR, etc.), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), and flash memory (FLASH); the I / O interface (read-write interface) 103 is connected between the processor 101 and the memory 102, and can realize information exchange between the processor 101 and the memory 102, including but not limited to a data bus (Bus), etc.

[0076] In some implementations, the processor 101 , the memory 102 , and the I / O interface 103 are connected to each other via a bus 104 , and further connected to other components of the computing device.

[0077] In a third aspect, referring to FIG5 , an embodiment of the present disclosure provides a computer-readable storage medium having a computer program stored thereon, which is executed by a processor so that the processor implements the random access method described in the first aspect of the embodiment of the present disclosure.

[0078] In order to enable those skilled in the art to more clearly understand the technical solution provided by the embodiment of the present disclosure, the technical solution provided by the embodiment of the present disclosure is described in detail below with reference to FIG6 through a specific example.

[0079] Example

[0080] As shown in FIG6 , when the UE needs to perform data transmission or other tasks, it first executes step S41 to establish a connection request and initiate random access. In step S41 , the UE initiates random access to the eNodeB according to the actual connection request. The random access may be, for example, contention random access.

[0081] Step S42, initialize the parameters; the parameters involved may include the number of preamble transmissions (Preamble_Transmission_Counter), the cumulative number of differences (RaPIDCount), the target difference (Temp_RaPID) and the historical difference (Temp_K). The number of preamble transmissions can be initialized to 1, and the cumulative number of differences, the target difference and the cumulative number of differences can all be initialized to 0.

[0082] In step S43, the UE sends MSG1, and in step S44, receives MSG2 sent by the eNodeB.

[0083] In step S45, the Preambleid in the first MSG1 and the RAPID in the first MSG2 are obtained. Then, the value of Temp_RaPID is obtained through Temp_RaPID = Preambleid - RAPID. If Temp_RaPID is not equal to 0, it is determined whether Temp_RaPID is the same as Temp_K. If Temp_RaPID is the same as Temp_K, RaPIDCount++ and Preamble_Transmission_Counter++ are executed. If Temp_RaPID is different from Temp_K, Temp_RaPID is assigned to Temp_K, RaPIDCount is set to 1, and Preamble_Transmission_Counter++ is executed. If Temp_RaPID is equal to 0, step S48 is executed.

[0084] Then, in step S46, it is determined whether the target difference Temp_RaPID meets a preset condition. The preset condition may be: the historical difference between the PreambleID in MSG1 retransmitted n times consecutively before the moment and the RAPID in the corresponding received MSG2 is the same as the target difference, and the value of n+1 is greater than or equal to 3, that is, the difference between the PreambleID in MSG1 sent three times consecutively and the RAPID in the corresponding received MSG2 is the same value.

[0085] If Temp_RaPID does not meet the preset conditions, then steps S43 to S46 are re-executed. If Temp_RaPID meets the preset conditions, that is, Temp_RaPID is the same as Temp_K and RaPIDCount is greater than or equal to 3, then step S47 is executed, that is, the numerical adjustment processing is performed on the initially used first uplink timing advance according to the above formula 1 to obtain a second uplink timing advance. Based on the second uplink timing advance, steps S43 to S47 are re-executed. If the match is successful when Preamble_Transmission_Counter is less than or equal to the preset transmission threshold (PreambleTransMax), then step S48 is executed, that is, the UE sends MSG3. Then, step S49 is executed, that is, the UE receives MSG4 sent by the eNodeB. After successful decoding, the random access process is successfully completed.

[0086] It is understandable that before executing step S46, step S50 can be executed to determine whether Preamble_Transmission_Counter is less than or equal to the preset transmission threshold PreambleTransMax. If Preamble_Transmission_Counter is less than or equal to PreambleTransMax, step S46 is executed. If Preamble_Transmission_Counter is greater than PreambleTransMax, random access fails and the process ends.

[0087] The random access method provided by the embodiment of the present disclosure is illustrated using data obtained from a laboratory simulated base station test. The parameters involved in the test case are as follows: the cell frequency is 38050, the cell ID is 1, AdditionalSpectrumEmission=1, the subframe configuration is 1 and 7, ZeroCorrelZoneConfig=2, PreambleFormat=4, PreambleTransMax=10, and the numerical adjustment of the uplink timing advance is started when the Preambleid differs from the RAPID by a fixed value three times.

[0088] During the test, by querying Table 5.7.2-3 and Table 5.7.2-1 in the TS36.211 protocol, it was found that Ncs = 5 and Nzc = 139 when the target step value is calculated based on the above formula 3. After actual testing, the test data is shown in Table 1 below:

[0089] Table 1

[0090] Since the difference between Preambleid and RAPID is 2 during the first transmission of MSG1, and the difference between Preambleid and RAPID is 1 during the second to fourth transmissions of MSG1, the timing advance can be numerically adjusted after Preamble_Transmission_Counter=4, with the target adjustment step FixTaStep=39 and the initial value of CtrlFixTa being 0. The test shows that when Preamble_Transmission_Counter=6 and CtrlFixTa=-39, Preambleid is the same as RAPID, and RAR matching is successful. Subsequent MSG3 and MSG4 are decoded successfully, and random access is successful.

[0091] Those skilled in the art will appreciate that all or some of the steps and functional modules / units in the apparatus disclosed above may be implemented as software, firmware, hardware, or a suitable combination thereof.

[0092] In hardware implementations, the division between functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed by several physical components in cooperation.

[0093] Some or all of the physical components may be implemented as software executed by a processor (such as a central processing unit (CPU), a digital signal processor, or a microprocessor), or as hardware, or as an integrated circuit, such as an application-specific integrated circuit. Such software may be distributed on a computer-readable medium, which may include computer storage media (or non-transitory media) and communication media (or temporary media). As is well known to those skilled in the art, the term computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer storage media include, but are not limited to, random access memory (RAM, more specifically SDRAM, DDR, etc.), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory (FLASH) or other disk storage; compact disc (CD-ROM), digital versatile disc (DVD) or other optical disc storage; magnetic cassettes, tapes, disk storage or other magnetic storage; any other medium that can be used to store desired information and can be accessed by a computer. Furthermore, as is well known to those skilled in the art, communication media typically embodies computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

[0094] The present disclosure has disclosed example embodiments, and although specific terms are employed, they are used and should be interpreted only in a general illustrative sense and not for purposes of limitation. In some instances, it will be apparent to those skilled in the art that, unless otherwise expressly stated, features, characteristics, and / or elements described in conjunction with a particular embodiment may be used alone or in combination with features, characteristics, and / or elements described in conjunction with other embodiments. Therefore, it will be understood by those skilled in the art that various changes in form and detail may be made without departing from the scope of the present disclosure as set forth in the appended claims.

Claims

1. A random access method, comprising: Acquire a first preamble index from a first random access preamble message, and acquire a first preamble identifier from a received first random access response message, wherein the first random access response message is used to respond to the first random access preamble message; Obtaining a target difference between the first preamble index and the first preamble identifier; When the target difference satisfies a preset condition, numerically adjusting the first uplink timing advance to obtain a second uplink timing advance, wherein the first uplink timing advance is an initial value of the uplink timing advance used in sending a random access preamble message; Random access processing is performed based on the second uplink timing advance.

2. The method according to claim 1, wherein: The step of numerically adjusting the first uplink timing advance to obtain the second uplink timing advance comprises: Obtaining a first adjustment value, and obtaining a target step value, wherein the first adjustment value includes a value obtained during the value adjustment process at a first moment, the first moment being a moment corresponding to a moment of receiving a second random access response message, the second random access response message being used to respond to a second random access preamble message, and the second random access preamble message being a preamble message sent at a previous moment; Obtaining a second adjustment value according to the first adjustment value and the target step value; The second uplink timing advance is obtained according to the first uplink timing advance and the second adjustment value.

3. The method according to claim 2, wherein: The obtaining of the target step value comprises: Acquire a first length of a preamble sequence in the first random access preamble message, a cyclic shift value corresponding to the preamble sequence, and a second length of a ZC sequence corresponding to the preamble sequence; The target step value is obtained according to the first length, the cyclic shift value and the second length.

4. The method according to claim 3, wherein: The obtaining the target step value according to the first length, the cyclic shift value and the second length comprises: Obtaining a preset step length adjustment parameter, wherein the preset step length adjustment parameter is used to narrow the step length adjustment range; Obtaining a first step length value according to the first length, the cyclic shift value and the second length; The target step value is obtained according to the first step value and the preset step adjustment parameter.

5. The method according to claim 2, wherein: The obtaining of the second adjustment value according to the first adjustment value and the target step value comprises: Obtaining a target sign of the target difference, wherein the target sign is used to indicate whether the target difference is a positive value; The second adjustment value is obtained according to the first adjustment value, the target step value and the target symbol.

6. The method according to claim 1, wherein: When the target difference satisfies a preset condition, performing numerical adjustment processing on the first uplink timing advance to obtain the second uplink timing advance comprises: Obtain a historical difference corresponding to the target difference, wherein the historical difference is a difference between a preamble code index in a random access preamble message sent within n consecutive moments before the current moment and a preamble code identifier in a corresponding random access response message received, where n is a positive integer; When the target difference is the same as the historical difference and the value of n+1 is greater than or equal to a preset threshold, a numerical adjustment process is performed on the first uplink timing advance to obtain a second uplink timing advance.

7. The method according to claim 1, further comprising: Before performing the step of numerically adjusting the first uplink timing advance to obtain the second uplink timing advance when the target difference satisfies a preset condition, obtaining a current number of preamble transmission times; When the number of preamble transmission times is less than or equal to a preset transmission threshold, the step of numerically adjusting the first uplink timing advance to obtain a second uplink timing advance is performed when the target difference meets a preset condition.

8. The method according to claim 1, wherein: The performing random access processing based on the second uplink timing advance includes: resending a third random access preamble message based on the second uplink timing advance, and receiving a corresponding third random access response message; When the difference between the third preamble code index in the third random access preamble message and the third preamble code identifier in the third random access response message is 0, and the subsequently sent scheduling transmission message and the received conflict resolution message are both decoded successfully, it is determined that the random access processing is successfully completed.

9. An electronic device, comprising: at least one processor; A memory having at least one computer program stored thereon, wherein when the at least one computer program is executed by the at least one processor, the at least one processor implements the random access method according to any one of claims 1 to 8.

10. A computer-readable storage medium having a computer program stored thereon, wherein the computer program is executed by a processor so that the processor implements the random access method according to any one of claims 1 to 8.

Images