Random access detection methods, network equipment, devices and storage media

Abstract

This application provides a random access detection method, network device, apparatus, and storage medium. The method includes: determining a first detection window with the highest peak power from a first detection window set corresponding to a target root sequence; determining a second detection window that satisfies a first condition based on the peak power and peak position index value of the first detection window; using the set of second detection windows as an updated first detection window set; repeating the steps of determining the first detection window and determining the second detection window n times according to the updated first detection window set; and determining all the first detection windows obtained after n updates and the second detection windows obtained after the nth update as the detection windows corresponding to the target root sequence with terminal access. This application embodiment can effectively reduce false detections, ensure the success rate of random access, and reduce random access processing time and hardware resource consumption compared to existing methods.

Description

Technical Field

[0001] This application relates to the field of wireless communication technology, and in particular to a random access detection method, network device, apparatus, and storage medium. Background Technology

[0002] The Physical Random Access Channel (PRACH) of New Radio (NR) systems uses a cyclically shifted Zadoff-Chu (ZC) sequence as a preamble. For the ZC sequence, when the terminal (or user equipment, UE) moves at a high speed, the Doppler effect is severe, resulting in a significant frequency offset. In this situation, for network equipment (e.g., base stations), upon receiving the preamble, not only will a signal power peak appear within the main detection window, but multiple larger signal power values ​​will also appear to the left and right of the main detection window. The network equipment cannot distinguish whether these larger signal power values ​​represent a sequence access within other detection windows or whether the signal within the main detection window has diffused into other detection windows due to frequency offset, leading to false detections and ultimately causing the random access process to fail.

[0003] To overcome the impact of frequency offset in high-speed terminal operation environments, the 3GPP protocol defines a high-speed PRACH mode. In PRACH high-speed mode, a cyclic shift set suitable for high-speed detection is constructed based on the frequency offset characteristics of the ZC sequence, divided into restricted set A and restricted set B. For restricted set A, the detection of a single preamble uses three detection windows, all belonging to the same preamble, thus eliminating false detections. For restricted set B, five detection windows are used. The restricted sets limit the impact of Doppler frequency shift in high-speed detection.

[0004] However, using restricted sets comes at the cost of sacrificing cell coverage, leading to a significant increase in the number of ZC root sequences required for a single cell. For example, restricted set A and restricted set B require 3 times and 5 times the number of root sequences, respectively, compared to the unrestricted set. Since the number of ZC root sequences is finite, increasing the number of root sequences required for a single cell to avoid cell interference further complicates cell network planning. Simultaneously, the increased number of cell root sequences means that the computational load for correlating subsequent local sequences with the received preamble sequence increases by 3 times and 5 times (taking restricted set A and restricted set B as examples), resulting in longer random access processing times and higher hardware resource consumption.

[0005] Therefore, how to propose a random access detection method to effectively reduce false detections in frequency offset scenarios is an important issue that the industry urgently needs to address. Summary of the Invention

[0006] To address the problems existing in the prior art, embodiments of this application provide a random access detection method, network device, apparatus, and storage medium.

[0007] In a first aspect, embodiments of this application provide a random access detection method, including:

[0008] The first detection window with the largest peak power is determined from the first detection window set corresponding to the target root sequence;

[0009] Based on the peak power and peak position index value of the first detection window, a second detection window that meets the first condition is determined; wherein, the first condition is: the peak power of the detection window is greater than or equal to a first threshold, and the difference between the peak position index value of the detection window and any target position index value is greater than a first preset value, the first threshold is determined based on the peak power of the first detection window, and the target position index value is determined based on the peak position index value of the first detection window;

[0010] The set of the second detection windows is used as the updated first detection window set. Based on the updated first detection window set, the steps of determining the first detection window and determining the second detection window are repeated n times, where n is an integer greater than or equal to 0.

[0011] All the first detection windows obtained after n updates and the second detection windows obtained after the nth update are determined as the detection windows with terminal access corresponding to the target root sequence.

[0012] Optionally, when n is 0, the method for determining the first detection window set corresponding to the target root sequence includes:

[0013] Detection windows with peak power greater than a preset threshold are determined from the detection windows corresponding to the target root sequence, forming the first set of detection windows corresponding to the target root sequence.

[0014] Optionally, determining the first detection window with the largest peak power from the first detection window set corresponding to the target root sequence includes:

[0015] If it is determined that the number of detection windows in the first detection window set corresponding to the target root sequence is greater than 1, then the first detection window with the largest peak power is determined from the first detection window set corresponding to the target root sequence.

[0016] Optionally, the method further includes:

[0017] For any of the n updates, if it is determined that the number of detection windows in the first detection window set corresponding to the target root sequence is less than or equal to 1, then all the first detection windows obtained before the current update and the second detection windows obtained in the previous update are determined as the detection windows with terminal access corresponding to the target root sequence, and the random access detection of the target root sequence ends.

[0018] Optionally, determining a first threshold based on the peak power of the first detection window includes:

[0019] A first threshold is determined based on the peak power of the first detection window and a preset coefficient.

[0020] Optionally, determining the target location index value based on the peak location index value of the first detection window includes:

[0021] Based on the peak position index value of the first detection window, the offset values ​​of 2*N position indices, and the root sequence length of the target root sequence, 2*N target position index values ​​are determined; where N is a preset positive integer value.

[0022] The 2*N position index offset values ​​are determined based on the offset step size and 2*N offset factors. The offset step size is determined based on the physical index of the target root sequence and the root sequence length of the target root sequence. The 2*N offset factors are 2*N integers that are not zero in the range [-N, N].

[0023] Optionally, determining the offset step size based on the physical index of the target root sequence and the root sequence length of the target root sequence includes:

[0024] The first parameter is determined based on the physical index of the target root sequence and the root sequence length of the target root sequence;

[0025] If the first parameter is greater than or equal to 0 and less than the first value, then the offset step size is determined based on the first parameter; or,

[0026] If the first parameter is less than 0, or greater than or equal to the first value, then the offset step size is determined based on the difference between the root sequence length of the target root sequence and the first parameter.

[0027] Wherein, the first value is half the root sequence length of the target root sequence.

[0028] Optionally, the 2*N target location index values ​​are determined by the following formula:

[0029]

[0030] Where, k rootIndicates the index of the target root sequence. This represents the index of the first detection window. This represents any one of the 2*N target location index values. N represents the peak position index value of the first detection window. zc d represents the root sequence length of the target root sequence. u The offset step size is represented by t, the offset factor is represented by t = -N, -N+1, ..., N-1, N, and t ≠ 0, where N is a preset positive integer value.

[0031] Optionally, the offset step size is determined by the following formula:

[0032]

[0033] (qu)mod N zc =1;

[0034] Where, d u Let N be the offset step size. zc The root sequence length of the target root sequence is represented by u, the physical index of the target root sequence is represented by q, and q is the first parameter.

[0035] Optionally, the first preset value is 2.

[0036] Secondly, embodiments of this application also provide a network device, including a memory, a transceiver, and a processor:

[0037] 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:

[0038] The first detection window with the largest peak power is determined from the first detection window set corresponding to the target root sequence;

[0039] Based on the peak power and peak position index value of the first detection window, a second detection window that meets the first condition is determined; wherein, the first condition is: the peak power of the detection window is greater than or equal to a first threshold, and the difference between the peak position index value of the detection window and any target position index value is greater than a first preset value, the first threshold is determined based on the peak power of the first detection window, and the target position index value is determined based on the peak position index value of the first detection window;

[0040] The set of the second detection windows is used as the updated first detection window set. Based on the updated first detection window set, the steps of determining the first detection window and determining the second detection window are repeated n times, where n is an integer greater than or equal to 0.

[0041] All the first detection windows obtained after n updates and the second detection windows obtained after the nth update are determined as the detection windows with terminal access corresponding to the target root sequence.

[0042] Optionally, when n is 0, the method for determining the first detection window set corresponding to the target root sequence includes:

[0043] Detection windows with peak power greater than a preset threshold are determined from the detection windows corresponding to the target root sequence, forming the first set of detection windows corresponding to the target root sequence.

[0044] Optionally, determining the first detection window with the largest peak power from the first detection window set corresponding to the target root sequence includes:

[0045] If it is determined that the number of detection windows in the first detection window set corresponding to the target root sequence is greater than 1, then the first detection window with the largest peak power is determined from the first detection window set corresponding to the target root sequence.

[0046] Optionally, the operation further includes:

[0047] For any of the n updates, if it is determined that the number of detection windows in the first detection window set corresponding to the target root sequence is less than or equal to 1, then all the first detection windows obtained before the current update and the second detection windows obtained in the previous update are determined as the detection windows with terminal access corresponding to the target root sequence, and the random access detection of the target root sequence ends.

[0048] Optionally, determining a first threshold based on the peak power of the first detection window includes:

[0049] A first threshold is determined based on the peak power of the first detection window and a preset coefficient.

[0050] Optionally, determining the target location index value based on the peak location index value of the first detection window includes:

[0051] Based on the peak position index value of the first detection window, the offset values ​​of 2*N position indices, and the root sequence length of the target root sequence, 2*N target position index values ​​are determined; where N is a preset positive integer value.

[0052] The 2*N position index offset values ​​are determined based on the offset step size and 2*N offset factors. The offset step size is determined based on the physical index of the target root sequence and the root sequence length of the target root sequence. The 2*N offset factors are 2*N integers that are not zero in the range [-N, N].

[0053] Optionally, determining the offset step size based on the physical index of the target root sequence and the root sequence length of the target root sequence includes:

[0054] The first parameter is determined based on the physical index of the target root sequence and the root sequence length of the target root sequence;

[0055] If the first parameter is greater than or equal to 0 and less than the first value, then the offset step size is determined based on the first parameter; or,

[0056] If the first parameter is less than 0, or greater than or equal to the first value, then the offset step size is determined based on the difference between the root sequence length of the target root sequence and the first parameter.

[0057] Wherein, the first value is half the root sequence length of the target root sequence.

[0058] Optionally, the 2*N target location index values ​​are determined by the following formula:

[0059]

[0060] Where, k root Indicates the index of the target root sequence. This represents the index of the first detection window. This represents any one of the 2*N target location index values. N represents the peak position index value of the first detection window. zc d represents the root sequence length of the target root sequence. u The offset step size is represented by t, the offset factor is represented by t = -N, -N+1, ..., N-1, N, and t ≠ 0, where N is a preset positive integer value.

[0061] Optionally, the offset step size is determined by the following formula:

[0062]

[0063] (qu)mod N zc =1;

[0064] Where, d u Let N be the offset step size. zc The root sequence length of the target root sequence is represented by u, the physical index of the target root sequence is represented by q, and q is the first parameter.

[0065] Optionally, the first preset value is 2.

[0066] Thirdly, embodiments of this application also provide a random access detection device, comprising:

[0067] The first determining unit is used to determine the first detection window with the largest peak power from the first detection window set corresponding to the target root sequence;

[0068] The second determining unit is configured to determine a second detection window that satisfies a first condition based on the peak power and peak position index value of the first detection window; wherein the first condition is: the peak power of the detection window is greater than or equal to a first threshold, and the difference between the peak position index value of the detection window and any target position index value is greater than a first preset value, the first threshold is determined based on the peak power of the first detection window, and the target position index value is determined based on the peak position index value of the first detection window;

[0069] An update unit is used to take the set of the second detection windows as the updated first detection window set, and repeat the steps of determining the first detection window and determining the second detection window n times according to the updated first detection window set, where n is an integer greater than or equal to 0;

[0070] The third determining unit is used to determine all the first detection windows obtained after n updates and the second detection windows obtained after the nth update as the detection windows with terminal access corresponding to the target root sequence.

[0071] Fourthly, embodiments of this application also provide a computer-readable storage medium storing a computer program for causing a computer to perform the steps of the random access detection method described in the first aspect above.

[0072] The random access detection method, network device, apparatus, and storage medium provided in this application determine a second detection window that meets a first condition based on the peak power and peak position of the first detection window. In the random access detection stage, the peaks generated by the target root sequence are distinguished, and the real peaks are correctly screened out, thereby effectively reducing false detections, ensuring the success rate of random access, and reducing random access processing time and hardware resource consumption compared with existing methods. Attached Figure Description

[0073] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0074] Figure 1 It is a ZC sequence power image provided by existing technology for frequency offset scenarios at the network device end;

[0075] Figure 2 This is a schematic diagram of access detection for a restricted set A provided by existing technology;

[0076] Figure 3 This is a flowchart illustrating the random access detection method provided in the embodiments of this application;

[0077] Figure 4 This is a schematic diagram illustrating the implementation of the random access detection method provided in the embodiments of this application;

[0078] Figure 5 This is a schematic diagram of the network device provided in the embodiments of this application;

[0079] Figure 6 This is a schematic diagram of the random access detection device provided in the embodiments of this application. Detailed Implementation

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

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

[0082] 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.

[0083] The PRACH of the NR system uses a cyclic shift of the ZC sequence as a preamble. For the ZC sequence, when the terminal moves at a high speed, the Doppler effect is more severe, which will produce a large frequency shift. Figure 1 ZC sequence power images at the network device end in frequency offset scenarios provided by existing technologies, such as Figure 1 As shown, in the frequency offset scenario, after receiving the preamble, the network device will not only have a signal power peak in the main detection window, but also multiple large signal power values ​​on the left and right sides of the main detection window. The network device cannot distinguish whether these multiple large signal power values ​​are due to sequential access in other detection windows or the signal in the main detection window has power diffused into other detection windows due to frequency offset, thus causing false detection and further leading to the failure of the random access process.

[0084] To facilitate a clearer understanding of the technical solutions of the embodiments of this application, the following is a brief introduction to the background knowledge related to random access detection.

[0085] In NR systems, random access technology is a crucial technology for terminal access control, used by terminals for uplink time synchronization. Terminals send cyclically shifted ZC sequences as preambles via PRACH. Network devices detect these preambles and send information such as the detected uplink synchronization advance to the terminal, which then completes uplink synchronization using the received advance. This process involves the network device detecting the preambles sent by the terminal. In NR systems, the ZC sequences used for random access exhibit good autocorrelation; after correlation, they show a peak at the beginning and zero values ​​at other points. A cell requires 64 preambles, obtained through cyclic shifts of the root ZC sequence (also called the ZC root sequence or root sequence). If 64 preambles cannot be generated from a single root ZC sequence, they are generated from subsequent root ZC sequences until 64 are generated. The receiving end only needs to detect each root sequence to obtain all preambles under that root sequence. Different cyclic shifts of the ZC sequence are detected within different detection windows.

[0086] The original ZC sequence x u (s) needs to go through C v The cyclic shift is shown in the following formula:

[0087] x u，v (s)=x u ((s+C v )mod N ZC );

[0088]

[0089] In the formula, x u (s) is the root ZC sequence, x u,v (s) is after C v The leading sequence obtained by cyclic shifting, where u represents the physical index of the root sequence, and N ZC This indicates the length of the ZC sequence.

[0090] In mobile scenarios, the Doppler effect occurs, causing a significant frequency shift in the received signal. The signal received by the network device is y u (s), and the local sequence x u The correlation value R of (s) u (m) is as follows:

[0091]

[0092] in, x represents u The conjugate of (s), Δf is the normalized frequency offset, and when -0.5 < Δf < 0.5, we can obtain from the above equation:

[0093]

[0094] f(m) = |sin(π(um-Δf))| is a periodic function with a period of 1. Since m is an integer, f(m) depends only on the values ​​of u and Δf. Once these two values ​​are determined, f(m) is a constant.

[0095]

[0096] Where um = k N ZC +Δκ, k represents um divided by N ZC The resulting quotient, Δκ, represents um divided by N. ZC The remainder obtained is:

[0097]

[0098] Define d u Equals um mod N ZC The value of m when = 1. As we know from the previous discussion, f(m) is a constant, |R u For g(m) to reach its maximum value, g(m) needs to reach its minimum value, that is, when Δκ=0, at which point m=0, |R u (0) represents the maximum value, i.e., the peak value. When the cyclic shift of the preamble is C... v At that time, the peak occurred at C v At the same time, the original related peak values ​​received will leak to C. v ±λd u At this point, a pseudo-peak is formed (λ is a positive integer), such as... Figure 2 As shown, the false peaks on the left and right sides enter the detection windows of other preambles, thus detecting undetected preambles, leading to false detections. Furthermore, as λ increases, in C... v ±λd u The pseudo-peak power gradually decreases.

[0099] To overcome the impact of frequency offset in high-speed motion environments, the 3GPP protocol defines a high-speed mode for PRACH, but it does not provide a solution for frequency offset in medium- and low-speed scenarios (frequency offset within 0.5 times the subcarrier spacing). In the high-speed mode of PRACH, a cyclic shift set suitable for high-speed detection is constructed based on the frequency offset characteristics of the ZC sequence. It is divided into a restricted set A and a restricted set B. The restricted set can limit the impact of Doppler frequency shift in high-speed detection. Figure 2 A schematic diagram of access detection for a restricted set A provided by existing technology, such as Figure 2 As shown, at the receiving end, for a restricted set A, the detection of a single preamble will be set with 3 detection windows. These 3 detection windows belong to the same preamble, so there will be no false detection problem. For a restricted set B, 5 detection windows will be set.

[0100] While high-speed PRACH mode can be configured in low-to-medium speed motion scenarios, this comes at the cost of sacrificing cell coverage. It significantly increases the number of ZC root sequences required per cell. For example, the number of root sequences required for restricted set A and restricted set B are 3 times and 5 times that of the unrestricted set, respectively. Since the number of ZC root sequences is finite, increasing the number of root sequences required per cell to avoid cell interference further complicates cell network planning. Furthermore, the increased number of cell root sequences means that the computational load for correlating subsequent local sequences with the received preamble sequence increases by 3 times and 5 times (taking restricted set A and restricted set B as examples), resulting in longer random access processing times and higher hardware resource consumption.

[0101] Therefore, in view of the above problems, the embodiments of this application provide a solution that distinguishes the peaks generated by the ZC sequence during the access detection phase, correctly filters out the real peaks, and discards the false peaks, thereby effectively reducing false detections and ensuring the success rate of random access.

[0102] Figure 3 This is a flowchart illustrating the random access detection method provided in an embodiment of this application. This method can be applied to network devices (e.g., base stations), such as... Figure 3 As shown, the method includes the following steps:

[0103] Step 300: Determine the first detection window with the largest peak power from the set of first detection windows corresponding to the target root sequence;

[0104] Specifically, when performing random access detection, the network device can perform random access detection on each root sequence-corresponding detection window (the number of detection windows corresponding to each root sequence can be one or more) to determine that there is a detection window for terminal access in each root sequence-corresponding detection window.

[0105] For a detection window corresponding to a target root sequence, the network device can first determine its corresponding first detection window set, and then determine the first detection window with the largest peak power from this first detection window set. Optionally, when initially performing random access detection, the first detection window set can be a set consisting of all detection windows corresponding to the target root sequence, or it can be obtained by filtering the detection windows corresponding to the target root sequence according to a power detection threshold preset by the system.

[0106] The peak power of the detection window is the maximum value of the signal power appearing within the detection window.

[0107] Step 301: Based on the peak power and peak position index value of the first detection window, determine the second detection window that meets the first condition; wherein, the first condition is: the peak power of the detection window is greater than or equal to a first threshold, and the difference between the peak position index value of the detection window and any target position index value is greater than a first preset value, the first threshold is determined based on the peak power of the first detection window, and the target position index value is determined based on the peak position index value of the first detection window;

[0108] Specifically, frequency offset will cause the main peak power to leak into C. v ±λd u At a certain point, a spurious peak is formed. When the frequency offset is within 0.5 times the subcarrier spacing, the power of the main peak is the largest. Based on this condition, any other peak with a power less than that of the main peak could be a spurious peak. If this peak and the main peak satisfy a distance λd... u If the peak is not related to the random access detection, it can be identified as a spurious peak and discarded during random access detection.

[0109] Based on the above analysis, after determining the first detection window, the network device can determine a second detection window that meets the first condition based on the peak power and peak location index value (i.e., the location index value corresponding to the peak power) of the first detection window. The first condition can be: the peak power of the detection window is greater than or equal to a first threshold, and the difference between the peak location index value of the detection window and any target location index value is greater than a first preset value. Optionally, the first preset value can be 2.

[0110] The aforementioned first threshold is a power detection threshold, which can be determined based on the peak power of the first detection window. Optionally, the first threshold can be determined based on the peak power of the first detection window and a preset coefficient. For example, the peak power of the first detection window can be multiplied by the preset coefficient, and the result can be used as the first threshold.

[0111] The aforementioned target location index value is the location index value of the target location. There can be multiple target locations, so there can also be multiple target location index values. These multiple target location index values ​​can be determined based on the peak location index value of the first detection window.

[0112] Optionally, determining the target location index value based on the peak location index value of the first detection window includes:

[0113] Based on the peak position index value of the first detection window, the offset values ​​of 2*N position indices, and the root sequence length of the target root sequence, 2*N target position index values ​​are determined; where N is a preset positive integer value.

[0114] The 2*N position index offset values ​​are determined based on the offset step size and 2*N offset factors. The offset step size is determined based on the physical index of the target root sequence and the root sequence length of the target root sequence. The 2*N offset factors are 2*N integers that are not zero in the range [-N, N].

[0115] Specifically, frequency offset will cause the main peak power to leak into C. v ±λd u At this point, a false peak is formed. Therefore, based on the peak position of the first detection window, 2*N positions where the main peak power of the first detection window may leak (i.e., positions where false peaks may form) can be determined. It can be understood that these positions are symmetrically distributed with respect to the peak position of the first detection window and are always an even number. The position index values ​​of these 2*N positions are the target position index values. If the difference between the peak position index value of a certain detection window and any target position index value is greater than the first preset value, it can be judged that the probability of the main peak of the signal power in the detection window being a false peak is low.

[0116] Specifically, the offset step size can be determined first based on the physical index and root sequence length of the target root sequence. Then, based on the set value of N (i.e., determining how many target positions need to be detected), 2*N integers in the range [-N, N] that are not zero can be determined as 2*N offset factors. Finally, 2*N position index offset values ​​are determined based on the offset step size and the 2*N offset factors. For example, the offset step size can be multiplied by each offset factor to obtain 2*N position index offset values.

[0117] Then, based on the peak position index value of the first detection window, the offset values ​​of 2*N position indices, and the root sequence length of the target root sequence, the 2*N target position index values ​​can be determined.

[0118] Alternatively, the 2*N target location index values ​​can be determined using the following formula:

[0119]

[0120] Where, k root Indicates the index of the target root sequence. This indicates the index of the first detection window. This represents any one of 2*N target location index values. N represents the peak position index value of the first detection window. zc d represents the root sequence length of the target root sequence. u The offset step size is represented by t, which represents the offset factor. t = -N, -N+1, ..., N-1, N, and t ≠ 0. N is a preset positive integer value.

[0121] Optionally, the method for determining the offset step size, based on the physical index of the target root sequence and the root sequence length of the target root sequence, may include:

[0122] The first parameter is determined based on the physical index of the target root sequence and the root sequence length of the target root sequence;

[0123] If the first parameter is greater than or equal to 0 and less than the first value, then the offset step size is determined based on the first parameter; or,

[0124] If the first parameter is less than 0, or greater than or equal to the first value, the offset step size is determined based on the difference between the root sequence length of the target root sequence and the first parameter.

[0125] The first value is half the length of the root sequence of the target root sequence.

[0126] Specifically, when determining the offset step size, the first parameter can be determined first based on the physical index of the target root sequence and the root sequence length of the target root sequence. Then, the offset step size can be determined based on whether the value of the first parameter is within a preset range.

[0127] For example, if the first parameter is greater than or equal to 0 and less than the first value, the offset step size can be determined directly based on the first parameter, such as using the value of the first parameter as the offset step size.

[0128] For example, if the first parameter is less than 0, or greater than or equal to the first value, the offset step size can be determined based on the difference between the root sequence length of the target root sequence and the first parameter. For instance, the difference between the root sequence length of the target root sequence and the first parameter can be used as the offset step size.

[0129] The first value can be half the length of the root sequence of the target root sequence.

[0130] Alternatively, the offset step size can be determined by the following formula:

[0131]

[0132] (qu)mod N zc =1;

[0133] Where, d u N is the offset step size. zc The root sequence length of the target root sequence is represented by , u represents the physical index of the target root sequence, and q is the first parameter.

[0134] Therefore, based on the first condition, the detection windows with lower peak power in the first detection window set, and / or the detection windows whose peak positions and the peak positions of the first detection windows satisfy a specific distance relationship, can be judged as detection windows with false peaks. The second detection window that satisfies the first condition (i.e., the peak power of the detection window is greater than or equal to the first threshold, and the difference between the peak position index value of the detection window and any target position index value is greater than the first preset value) can be judged as a detection window that may have terminal access.

[0135] Step 302: Use the set of the second detection windows as the updated set of the first detection windows. Based on the updated set of the first detection windows, repeat the steps of determining the first detection window and determining the second detection window n times, where n is an integer greater than or equal to 0.

[0136] Specifically, since the main peak of the signal power in each detection window may leak into other detection windows to form a false peak, the second detection window, determined based on the peak power and peak position index value of the first detection window, may still contain false peaks formed by power leakage from the main peak of other detection windows.

[0137] To more accurately determine the detection windows with terminal access and eliminate false peaks, this embodiment of the application can perform multiple detections. After determining the second detection window for the first time, the set of second detection windows can be used as an updated first detection window set. Then, based on the updated first detection window set, the steps of determining the first and second detection windows are repeated. That is, the first detection window with the largest peak power is determined from the updated first detection window set. Then, based on the peak power and peak position index value of the first detection window, the second detection window that meets the first condition is determined. Afterwards, the set of determined second detection windows can continue to be used as an updated first detection window set, and the steps of determining the first and second detection windows can be repeated continuously until a termination condition is met, such as the number of updates reaching a preset number, or the number of second detection windows being less than or equal to 1, etc.

[0138] It should be noted that when n is 0, that is, the initial first detection window set, the determination method can be: determine the detection windows with peak power greater than a preset threshold from the detection windows corresponding to the target root sequence, and form the first detection window set corresponding to the target root sequence.

[0139] For example, the system can preset a power detection threshold, and form an initial first detection window set by detecting windows whose peak power is greater than the preset power detection threshold. Based on the initial first detection window set, the first detection window and the second detection window are determined for the first time. After obtaining the second detection window, the set formed by the second detection window is used as the updated first detection window set, and the above steps of determining the first detection window and determining the second detection window are repeated.

[0140] Step 303: Determine all the first detection windows obtained after n updates and the second detection windows obtained after the nth update as the detection windows with terminal access corresponding to the target root sequence.

[0141] Specifically, each time the steps of determining the first detection window and determining the second detection window are repeated, a first detection window and several second detection windows will be determined (the number of second detection windows may be less than or equal to 1 or greater than 1). The first detection window can determine that a terminal has been connected, and the several second detection windows can further determine whether a terminal has been connected by continuing to repeat the above steps of determining the first detection window and determining the second detection window.

[0142] Therefore, based on the loop termination condition, after repeating the steps of determining the first detection window and determining the second detection window n times, all the first detection windows obtained from n updates (i.e., repeating the steps of determining the first detection window and determining the second detection window n times) and the second detection window obtained after the nth update can be determined as the detection windows with terminal access corresponding to the target root sequence.

[0143] The random access detection method provided in this application determines a second detection window that meets a first condition based on the peak power and peak position of the first detection window. During the random access detection stage, it distinguishes the peaks generated by the target root sequence and correctly filters out the real peaks, thereby effectively reducing false detections and ensuring the success rate of random access. Compared with existing methods, it can reduce random access processing time and reduce hardware resource consumption.

[0144] Optionally, the first detection window with the largest peak power is determined from the first detection window set corresponding to the target root sequence, including:

[0145] If it is determined that the number of detection windows in the first detection window set corresponding to the target root sequence is greater than 1, then the first detection window with the largest peak power is determined from the first detection window set corresponding to the target root sequence.

[0146] Specifically, after determining the first detection window set corresponding to the target root sequence, the number of detection windows in the first detection window set can be judged first. If the number of detection windows in the first detection window set is greater than 1, the steps of determining the first detection window and the second detection window can be further executed to further detect the detection windows in the first detection window set.

[0147] Optionally, the method further includes:

[0148] For any of the n updates, if it is determined that the number of detection windows in the first detection window set corresponding to the target root sequence is less than or equal to 1, then all the first detection windows obtained before the current update and the second detection windows obtained in the previous update are determined as the detection windows with terminal access corresponding to the target root sequence, and the random access detection of the target root sequence ends.

[0149] Specifically, when repeating the step of determining the first detection window and the second detection window n times, if for a certain update (including the 0th update), before determining the first detection window, it is determined that the number of detection windows in the first detection window set is less than or equal to 1, then all the first detection windows obtained before this update and the second detection window obtained in the previous update can be determined as the detection windows with terminal access corresponding to the target root sequence, and the random access detection of the target root sequence can be ended. This avoids continuing to execute the step of determining the first detection window and the second detection window, which can further reduce the random access processing time and reduce hardware resource overhead.

[0150] Figure 4 This is a schematic diagram illustrating the implementation of the random access detection method provided in the embodiments of this application, as shown below. Figure 4 As shown, the method mainly includes the following steps:

[0151] Step 400: Determine the peak power and the location of the peak power in each detection window.

[0152] Specifically: Find the k-th... root The k-th root sequence preamble The maximum power value in each detection window is denoted as... The maximum value is at the k-th root The position index on the root sequence is denoted as

[0153] Step 401: Connect the detection result label to each detection window on the root sequence.

[0154] Specifically: if the kth root The k-th root sequence preamble The peak power in each detection window satisfies: but otherwise Where P d The detection threshold is set by the system. This represents the set of markers for the detection results of the detection window on the root sequence.

[0155] Step 402: Determine the number of detection windows that have passed the detection threshold on each root sequence.

[0156] Specifically: if the kth root The number of detection windows that have passed the detection threshold on the root sequence is greater than 1, that is, in the set If the number of occurrences is greater than 1, then all items labeled as in the root sequence... Find the peak power value within the detection window and denote it as... And order The specific value of α is determined by the system design. The index of the detection window is denoted as

[0157] Step 403, record. Position on the root sequence Simultaneously calculate the following 2*N positions:

[0158]

[0159]

[0160] t = -N, -N+1, ..., N-1, N, and t≠0;

[0161] in, It represents any one of 2*N positions, where N zc Indicates the kth root The length of the root sequence of the k-th root sequence, u represents the length of the root sequence of the k-th root sequence. root The physical index of the root sequence, q, is obtained by (qu) mod N. zc =1.

[0162] Step 404, if the k-th root The k-th root sequence preamble The peak power in each detection window satisfies: Then let

[0163] Step 405, set the kth... root On the root sequence The peak position in the detection window is compared with the 2*N positions calculated in step 403. If the following conditions are met:

[0164]

[0165] but

[0166] Step 406: Repeat steps 402 to 405.

[0167] Step 407, Finally all and The corresponding detection window is the detection window that is considered to have a terminal connected.

[0168] The methods and apparatuses provided in the various embodiments of this application are based on the same concept. Since the methods and apparatuses solve problems in similar ways, the implementations of the apparatuses and methods can refer to each other, and repeated details will not be repeated.

[0169] Figure 5 This is a schematic diagram of the network device provided in the embodiments of this application, such as... Figure 5 As shown, the network device includes a memory 520, a transceiver 510, and a processor 500; wherein the processor 500 and the memory 520 can also be physically arranged separately.

[0170] The memory 520 is used to store computer programs; the transceiver 510 is used to send and receive data under the control of the processor 500.

[0171] Specifically, the transceiver 510 is used to receive and send data under the control of the processor 500.

[0172] Among them, Figure 5 In this application, the bus architecture can include any number of interconnected buses and bridges, specifically linking various circuits of one or more processors represented by processor 500 and memory represented by memory 520 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 further described herein. The bus interface provides an interface. The transceiver 510 can be multiple elements, including a transmitter and a receiver, providing a unit for communicating with various other devices over a transmission medium, including wireless channels, wired channels, optical fibers, and other transmission media.

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

[0174] The processor 500 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.

[0175] The processor 500 calls a computer program stored in the memory 520 to execute any of the methods provided in the embodiments of this application according to the obtained executable instructions. For example: determining a first detection window with the largest peak power from the first detection window set corresponding to the target root sequence; determining a second detection window that satisfies a first condition based on the peak power and peak position index value of the first detection window; wherein the first condition is: the peak power of the detection window is greater than or equal to a first threshold, and the difference between the peak position index value of the detection window and any target position index value is greater than a first preset value, the first threshold is determined based on the peak power of the first detection window, and the target position index value is determined based on the peak position index value of the first detection window; using the set of second detection windows as an updated first detection window set, repeating the steps of determining the first detection window and determining the second detection window n times according to the updated first detection window set, where n is an integer greater than or equal to 0; determining all the first detection windows obtained after n updates and the second detection windows obtained after the nth update as the detection windows with terminal access corresponding to the target root sequence.

[0176] Optionally, when n is 0, the method for determining the first detection window set corresponding to the target root sequence includes:

[0177] Detection windows with peak power greater than a preset threshold are determined from the detection windows corresponding to the target root sequence, forming the first set of detection windows corresponding to the target root sequence.

[0178] Optionally, the first detection window with the largest peak power is determined from the first detection window set corresponding to the target root sequence, including:

[0179] If it is determined that the number of detection windows in the first detection window set corresponding to the target root sequence is greater than 1, then the first detection window with the largest peak power is determined from the first detection window set corresponding to the target root sequence.

[0180] Optionally, the method further includes:

[0181] For any of the n updates, if it is determined that the number of detection windows in the first detection window set corresponding to the target root sequence is less than or equal to 1, then all the first detection windows obtained before the current update and the second detection windows obtained in the previous update are determined as the detection windows with terminal access corresponding to the target root sequence, and the random access detection of the target root sequence ends.

[0182] Optionally, determining a first threshold based on the peak power of the first detection window includes:

[0183] The first threshold is determined based on the peak power of the first detection window and the preset coefficient.

[0184] Optionally, determining the target location index value based on the peak location index value of the first detection window includes:

[0185] Based on the peak position index value of the first detection window, the offset values ​​of 2*N position indices, and the root sequence length of the target root sequence, 2*N target position index values ​​are determined; where N is a preset positive integer value.

[0186] The 2*N position index offset values ​​are determined based on the offset step size and 2*N offset factors. The offset step size is determined based on the physical index of the target root sequence and the root sequence length of the target root sequence. The 2*N offset factors are 2*N integers that are not zero in the range [-N, N].

[0187] Optionally, the offset step size is determined based on the physical index of the target root sequence and the root sequence length of the target root sequence, including:

[0188] The first parameter is determined based on the physical index of the target root sequence and the root sequence length of the target root sequence;

[0189] If the first parameter is greater than or equal to 0 and less than the first value, then the offset step size is determined based on the first parameter; or,

[0190] If the first parameter is less than 0, or greater than or equal to the first value, the offset step size is determined based on the difference between the root sequence length of the target root sequence and the first parameter.

[0191] The first value is half the length of the root sequence of the target root sequence.

[0192] Optionally, the 2*N target location index values ​​are determined by the following formula:

[0193]

[0194] Where, k root Indicates the index of the target root sequence. This indicates the index of the first detection window. This represents any one of 2*N target location index values. N represents the peak position index value of the first detection window. zc d represents the root sequence length of the target root sequence. u The offset step size is represented by t, which represents the offset factor. t = -N, -N+1, ..., N-1, N, and t ≠ 0. N is a preset positive integer value.

[0195] Alternatively, the offset step size is determined by the following formula:

[0196]

[0197] (qu)mod N zc =1;

[0198] Where, d u N is the offset step size. zc The root sequence length of the target root sequence is represented by , u represents the physical index of the target root sequence, and q is the first parameter.

[0199] Optionally, the first preset value is 2.

[0200] It should be noted that the network device provided in this application embodiment can implement all the method steps implemented in the above method embodiment and can achieve the same technical effect. Here, the parts that are the same as those in the method embodiment and the beneficial effects will not be described in detail.

[0201] Figure 6 This is a schematic diagram of the random access detection device provided in an embodiment of this application. This device can be applied to network devices, such as... Figure 6 As shown, the device includes:

[0202] The first determining unit 600 is used to determine the first detection window with the largest peak power from the first detection window set corresponding to the target root sequence;

[0203] The second determining unit 610 is used to determine a second detection window that satisfies a first condition based on the peak power and peak position index value of the first detection window; wherein the first condition is: the peak power of the detection window is greater than or equal to a first threshold, and the difference between the peak position index value of the detection window and any target position index value is greater than a first preset value, the first threshold is determined based on the peak power of the first detection window, and the target position index value is determined based on the peak position index value of the first detection window;

[0204] The updating unit 620 is used to take the set of the second detection windows as the updated first detection window set, and repeat the steps of determining the first detection window and determining the second detection window n times according to the updated first detection window set, where n is an integer greater than or equal to 0.

[0205] The third determining unit 630 is used to determine all the first detection windows obtained after n updates and the second detection windows obtained after the nth update as the detection windows with terminal access corresponding to the target root sequence.

[0206] Optionally, when n is 0, the method for determining the first detection window set corresponding to the target root sequence includes:

[0207] Detection windows with peak power greater than a preset threshold are determined from the detection windows corresponding to the target root sequence, forming the first set of detection windows corresponding to the target root sequence.

[0208] Optionally, the first detection window with the largest peak power is determined from the first detection window set corresponding to the target root sequence, including:

[0209] If it is determined that the number of detection windows in the first detection window set corresponding to the target root sequence is greater than 1, then the first detection window with the largest peak power is determined from the first detection window set corresponding to the target root sequence.

[0210] Optionally, the first determining unit 600 is also used for:

[0211] For any of the n updates, if it is determined that the number of detection windows in the first detection window set corresponding to the target root sequence is less than or equal to 1, then all the first detection windows obtained before the current update and the second detection windows obtained in the previous update are determined as the detection windows with terminal access corresponding to the target root sequence, and the random access detection of the target root sequence ends.

[0212] Optionally, determining a first threshold based on the peak power of the first detection window includes:

[0213] The first threshold is determined based on the peak power of the first detection window and the preset coefficient.

[0214] Optionally, determining the target location index value based on the peak location index value of the first detection window includes:

[0215] Based on the peak position index value of the first detection window, the offset values ​​of 2*N position indices, and the root sequence length of the target root sequence, 2*N target position index values ​​are determined; where N is a preset positive integer value.

[0216] The 2*N position index offset values ​​are determined based on the offset step size and 2*N offset factors. The offset step size is determined based on the physical index of the target root sequence and the root sequence length of the target root sequence. The 2*N offset factors are 2*N integers that are not zero in the range [-N, N].

[0217] Optionally, the offset step size is determined based on the physical index of the target root sequence and the root sequence length of the target root sequence, including:

[0218] The first parameter is determined based on the physical index of the target root sequence and the root sequence length of the target root sequence;

[0219] If the first parameter is greater than or equal to 0 and less than the first value, then the offset step size is determined based on the first parameter; or,

[0220] If the first parameter is less than 0, or greater than or equal to the first value, the offset step size is determined based on the difference between the root sequence length of the target root sequence and the first parameter.

[0221] The first value is half the length of the root sequence of the target root sequence.

[0222] Optionally, the 2*N target location index values ​​are determined by the following formula:

[0223]

[0224] Where, k root Indicates the index of the target root sequence. This indicates the index of the first detection window. This represents any one of 2*N target location index values. N represents the peak position index value of the first detection window. zc d represents the root sequence length of the target root sequence. u The offset step size is represented by t, which represents the offset factor. t = -N, -N+1, ..., N-1, N, and t ≠ 0. N is a preset positive integer value.

[0225] Alternatively, the offset step size is determined by the following formula:

[0226]

[0227] (qu)mod N zc =1;

[0228] Where, d u N is the offset step size. zc The root sequence length of the target root sequence is represented by , u represents the physical index of the target root sequence, and q is the first parameter.

[0229] Optionally, the first preset value is 2.

[0230] 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.

[0231] 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.

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

[0233] On the other hand, embodiments of this application also provide a computer-readable storage medium storing a computer program. The computer program is used to cause a computer to execute the random access detection method provided in the above embodiments, including: determining a first detection window with the largest peak power from a first detection window set corresponding to a target root sequence; determining a second detection window that satisfies a first condition based on the peak power and peak position index value of the first detection window; wherein the first condition is: the peak power of the detection window is greater than or equal to a first threshold, and the difference between the peak position index value of the detection window and any target position index value is greater than a first preset value, the first threshold is determined based on the peak power of the first detection window, and the target position index value is determined based on the peak position index value of the first detection window; using the set of second detection windows as an updated first detection window set, repeating the steps of determining the first detection window and determining the second detection window n times according to the updated first detection window set, where n is an integer greater than or equal to 0; determining all the first detection windows obtained after n updates and the second detection windows obtained after the nth update as detection windows with terminal access corresponding to the target root sequence.

[0234] The computer-readable storage medium can be any available medium or data storage device that a computer can access, including but not limited to magnetic storage (e.g., floppy disks, hard disks, magnetic tapes, magneto-optical disks (MOs), etc.), optical storage (e.g., CDs, DVDs, BDs, HVDs, etc.), and semiconductor storage (e.g., ROMs, EPROMs, EEPROMs, non-volatile memory (NAND flash), solid-state drives (SSDs)).

[0235] 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).

[0236] The terminal involved in the embodiments of this application can be a device that provides voice and / or data connectivity to a user, a handheld device with wireless connectivity, or other processing devices connected to a wireless modem. The name of the terminal may differ in different systems; for example, in a 5G system, the terminal can be called a 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.

[0237] 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.

[0238] Network devices and terminals can each use one or more antennas for Multiple-Input Multiple-Output (MIMO) transmission. MIMO transmission can be Single-User MIMO (SU-MIMO) or Multiple-User MIMO (MU-MIMO). Depending on the configuration and number of antenna combinations, MIMO transmission can be 2D-MIMO, 3D-MIMO, FD-MIMO, or massive-MIMO, and can also be diversity transmission, precoding transmission, or beamforming transmission, etc.

[0239] 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.

[0240] 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.

[0241] 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.

[0242] 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.

[0243] 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 random access detection method, characterized in that, include: The first detection window with the largest peak power is determined from the first detection window set corresponding to the target root sequence; Based on the peak power and peak position index value of the first detection window, a second detection window that meets the first condition is determined; wherein, the first condition is: the peak power of the detection window is greater than or equal to a first threshold, and the difference between the peak position index value of the detection window and any target position index value is greater than a first preset value, the first threshold is determined based on the peak power of the first detection window, and the target position index value is determined based on the peak position index value of the first detection window; The set of the second detection windows is used as the updated first detection window set. Based on the updated first detection window set, the steps of determining the first detection window and determining the second detection window are repeated n times, where n is an integer greater than or equal to 0. All the first detection windows obtained after n updates and the second detection windows obtained after the nth update are determined as the detection windows with terminal access corresponding to the target root sequence.

2. The random access detection method according to claim 1, characterized in that, When n is 0, the method for determining the first detection window set corresponding to the target root sequence includes: Detection windows with peak power greater than a preset threshold are determined from the detection windows corresponding to the target root sequence, forming the first set of detection windows corresponding to the target root sequence.

3. The random access detection method according to claim 1, characterized in that, The step of determining the first detection window with the largest peak power from the first detection window set corresponding to the target root sequence includes: If it is determined that the number of detection windows in the first detection window set corresponding to the target root sequence is greater than 1, then the first detection window with the largest peak power is determined from the first detection window set corresponding to the target root sequence.

4. The random access detection method according to claim 1, characterized in that, The method further includes: For any of the n updates, if it is determined that the number of detection windows in the first detection window set corresponding to the target root sequence is less than or equal to 1, then all the first detection windows obtained before the current update and the second detection windows obtained in the previous update are determined as the detection windows with terminal access corresponding to the target root sequence, and the random access detection of the target root sequence ends.

5. The random access detection method according to claim 1, characterized in that, Determining a first threshold based on the peak power of the first detection window includes: A first threshold is determined based on the peak power of the first detection window and a preset coefficient.

6. The random access detection method according to claim 1, characterized in that, Determining the target location index value based on the peak location index value of the first detection window includes: Based on the peak position index value of the first detection window, the offset values ​​of 2*N position indices, and the root sequence length of the target root sequence, 2*N target position index values ​​are determined; where N is a preset positive integer value. The 2*N position index offset values ​​are determined based on the offset step size and 2*N offset factors. The offset step size is determined based on the physical index of the target root sequence and the root sequence length of the target root sequence. The 2*N offset factors are 2*N integers that are not zero in the range [-N, N].

7. The random access detection method according to claim 6, characterized in that, Determining the offset step size based on the physical index of the target root sequence and the root sequence length of the target root sequence includes: The first parameter is determined based on the physical index of the target root sequence and the root sequence length of the target root sequence; If the first parameter is greater than or equal to 0 and less than the first value, then the offset step size is determined based on the first parameter; or, If the first parameter is less than 0, or greater than or equal to the first value, then the offset step size is determined based on the difference between the root sequence length of the target root sequence and the first parameter. Wherein, the first value is half the root sequence length of the target root sequence.

8. The random access detection method according to claim 6, characterized in that, The 2*N target location index values ​​are determined by the following formula: Where, k root Indicates the index of the target root sequence. This represents the index of the first detection window. This represents any one of the 2*N target location index values. N represents the peak position index value of the first detection window. zc d represents the root sequence length of the target root sequence. u The offset step size is represented by t, the offset factor is represented by t = -N, -N+1, ..., N-1, N, and t ≠ 0, where N is a preset positive integer value.

9. The random access detection method according to claim 7, characterized in that, The offset step size is determined by the following formula: (qu)mod N zc =1; Where, d u Let N be the offset step size. zc The root sequence length of the target root sequence is represented by u, the physical index of the target root sequence is represented by q, and q is the first parameter.

10. The random access detection method according to claim 1, characterized in that, The first preset value is 2.

11. A network device, 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: The first detection window with the largest peak power is determined from the first detection window set corresponding to the target root sequence; Based on the peak power and peak position index value of the first detection window, a second detection window that meets the first condition is determined; wherein, the first condition is: the peak power of the detection window is greater than or equal to a first threshold, and the difference between the peak position index value of the detection window and any target position index value is greater than a first preset value, the first threshold is determined based on the peak power of the first detection window, and the target position index value is determined based on the peak position index value of the first detection window; The set of the second detection windows is used as the updated first detection window set. Based on the updated first detection window set, the steps of determining the first detection window and determining the second detection window are repeated n times, where n is an integer greater than or equal to 0. All the first detection windows obtained after n updates and the second detection windows obtained after the nth update are determined as the detection windows with terminal access corresponding to the target root sequence.

12. The network device according to claim 11, characterized in that, When n is 0, the method for determining the first detection window set corresponding to the target root sequence includes: Detection windows with peak power greater than a preset threshold are determined from the detection windows corresponding to the target root sequence, forming the first set of detection windows corresponding to the target root sequence.

13. The network device according to claim 11, characterized in that, The step of determining the first detection window with the largest peak power from the first detection window set corresponding to the target root sequence includes: If it is determined that the number of detection windows in the first detection window set corresponding to the target root sequence is greater than 1, then the first detection window with the largest peak power is determined from the first detection window set corresponding to the target root sequence.

14. The network device according to claim 11, characterized in that, The operation also includes: For any of the n updates, if it is determined that the number of detection windows in the first detection window set corresponding to the target root sequence is less than or equal to 1, then all the first detection windows obtained before the current update and the second detection windows obtained in the previous update are determined as the detection windows with terminal access corresponding to the target root sequence, and the random access detection of the target root sequence ends.

15. The network device according to claim 11, characterized in that, Determining a first threshold based on the peak power of the first detection window includes: A first threshold is determined based on the peak power of the first detection window and a preset coefficient.

16. The network device according to claim 11, characterized in that, Determining the target location index value based on the peak location index value of the first detection window includes: Based on the peak position index value of the first detection window, the offset values ​​of 2*N position indices, and the root sequence length of the target root sequence, 2*N target position index values ​​are determined; where N is a preset positive integer value. The 2*N position index offset values ​​are determined based on the offset step size and 2*N offset factors. The offset step size is determined based on the physical index of the target root sequence and the root sequence length of the target root sequence. The 2*N offset factors are 2*N integers that are not zero in the range [-N, N].

17. The network device according to claim 16, characterized in that, Determining the offset step size based on the physical index of the target root sequence and the root sequence length of the target root sequence includes: The first parameter is determined based on the physical index of the target root sequence and the root sequence length of the target root sequence; If the first parameter is greater than or equal to 0 and less than the first value, then the offset step size is determined based on the first parameter; or, If the first parameter is less than 0, or greater than or equal to the first value, then the offset step size is determined based on the difference between the root sequence length of the target root sequence and the first parameter. Wherein, the first value is half the root sequence length of the target root sequence.

18. The network device according to claim 16, characterized in that, The 2*N target location index values ​​are determined by the following formula: Where, k root Indicates the index of the target root sequence. This represents the index of the first detection window. This represents any one of the 2*N target location index values. N represents the peak position index value of the first detection window. zc d represents the root sequence length of the target root sequence. u The offset step size is represented by t, the offset factor is represented by t = -N, -N+1, ..., N-1, N, and t ≠ 0, where N is a preset positive integer value.

19. The network device according to claim 17, characterized in that, The offset step size is determined by the following formula: (qu)mod N zc =1; Where, d u Let N be the offset step size. zc The root sequence length of the target root sequence is represented by u, the physical index of the target root sequence is represented by q, and q is the first parameter.

20. The network device according to claim 11, characterized in that, The first preset value is 2.

21. A random access detection device, characterized in that, include: The first determining unit is used to determine the first detection window with the largest peak power from the first detection window set corresponding to the target root sequence; The second determining unit is configured to determine a second detection window that satisfies a first condition based on the peak power and peak position index value of the first detection window; wherein the first condition is: the peak power of the detection window is greater than or equal to a first threshold, and the difference between the peak position index value of the detection window and any target position index value is greater than a first preset value, the first threshold is determined based on the peak power of the first detection window, and the target position index value is determined based on the peak position index value of the first detection window; An update unit is used to take the set of the second detection windows as the updated first detection window set, and repeat the steps of determining the first detection window and determining the second detection window n times according to the updated first detection window set, where n is an integer greater than or equal to 0; The third determining unit is used to determine all the first detection windows obtained after n updates and the second detection windows obtained after the nth update as the detection windows with terminal access corresponding to the target root sequence.

22. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that causes a computer to perform the method according to any one of claims 1 to 10.

Images