CN117596704A - Random access detection method and device, electronic equipment and storage medium - Google Patents
Random access detection method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN117596704A CN117596704A CN202311552217.9A CN202311552217A CN117596704A CN 117596704 A CN117596704 A CN 117596704A CN 202311552217 A CN202311552217 A CN 202311552217A CN 117596704 A CN117596704 A CN 117596704A
- Authority
- CN
- China
- Prior art keywords
- power
- detection window
- determining
- detection
- fast fourier
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000001514 detection method Methods 0.000 title claims abstract description 159
- 125000004122 cyclic group Chemical group 0.000 claims abstract description 47
- 238000000034 method Methods 0.000 claims abstract description 25
- 238000004590 computer program Methods 0.000 claims description 16
- 230000009466 transformation Effects 0.000 claims description 8
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 238000004891 communication Methods 0.000 description 10
- 238000012545 processing Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 3
- 238000004088 simulation Methods 0.000 description 3
- 230000003993 interaction Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000011521 glass Substances 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000001953 sensory effect Effects 0.000 description 1
- 230000008054 signal transmission Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0833—Random access procedures, e.g. with 4-step access
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/08—Testing, supervising or monitoring using real traffic
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a random access detection method, a device, electronic equipment and a storage medium; the method comprises the following steps: acquiring a cyclic shift value and a sequence length of a preamble sequence and the number of points of inverse fast Fourier transform; determining the number of taps according to the cyclic shift value, the sequence length and the number of points of the inverse fast Fourier transform; whether the preamble is accessed in the detection window is judged according to the number of taps and the power in the detection window, the problem of inaccurate detection result caused by setting fixed tap number to access is solved, the tap number is calculated according to the cyclic shift value and the sequence length of the preamble sequence and the number of points of the inverse fast Fourier transform, whether the preamble is accessed in the detection window is judged according to the tap number and the power in the detection window, the access detection is carried out by dynamically calculating the tap number, and the problem of inaccurate detection result caused by setting fixed tap number to access detection is avoided, so that the accuracy and the reliability of the detection are improved.
Description
Technical Field
The present invention relates to the field of wireless communications technologies, and in particular, to a random access detection method, a device, an electronic apparatus, and a storage medium.
Background
In the existing random access detection method of the wireless communication system, the setting of the tap number of the signal power does not have a quantized formula, and is often set according to an empirical value. In this way, for different scenes, namely, under the conditions of configuring cyclic shift values, IFFT points and preamble sequence lengths adopted by different preamble sequences, the number of taps set according to experience values may be unreasonable, so that the calculated signal power and noise power are not accurate enough, and the accuracy of a detection result is affected.
Disclosure of Invention
The invention provides a random access detection method, a device, electronic equipment and a storage medium, which are used for solving the problem of inaccurate random access detection.
According to an aspect of the present invention, there is provided a random access detection method, including:
acquiring a cyclic shift value and a sequence length of a preamble sequence and the number of points of inverse fast Fourier transform;
determining the number of taps according to the cyclic shift value, the sequence length and the number of points of the inverse fast Fourier transform;
and judging whether a preamble is accessed in the detection window according to the tap number and the power in the detection window.
According to another aspect of the present invention, there is provided a random access detection apparatus including:
the data acquisition module is used for acquiring the cyclic shift value and the sequence length of the preamble sequence and the number of points of the inverse fast Fourier transform;
the tap number determining module is used for determining the tap number according to the cyclic shift value, the sequence length and the number of points of the fast Fourier inverse transformation;
and the access detection module is used for judging whether the preamble is accessed in the detection window according to the tap number and the power in the detection window.
According to another aspect of the present invention, there is provided an electronic apparatus including:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,
the memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the random access detection method according to any one of the embodiments of the present invention.
According to another aspect of the present invention, there is provided a computer readable storage medium storing computer instructions for causing a processor to implement the random access detection method according to any of the embodiments of the present invention when executed.
According to the technical scheme, cyclic shift values and sequence lengths of the preamble sequences and the number of points of the inverse fast Fourier transform are obtained; determining the number of taps according to the cyclic shift value, the sequence length and the number of points of the inverse fast Fourier transform; and whether the preamble is accessed in the detection window is judged according to the number of taps and the power in the detection window, the access detection is carried out by dynamically calculating the number of taps, the problem of inaccurate detection results caused by setting the fixed number of taps to carry out the access detection is avoided, and the accuracy and the reliability of the detection are improved.
It should be understood that the description in this section is not intended to identify key or critical features of the embodiments of the invention or to delineate the scope of the invention. Other features of the present invention will become apparent from the description that follows.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flowchart of a random access detection method according to a first embodiment of the present invention;
fig. 2 is a flowchart of a random access detection method according to a second embodiment of the present invention;
fig. 3 is a schematic structural diagram of a random access detection device according to a third embodiment of the present invention;
fig. 4 is a schematic structural diagram of an electronic device implementing a random access detection method according to an embodiment of the present invention.
Detailed Description
In order that those skilled in the art will better understand the present invention, a technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in which it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present invention without making any inventive effort, shall fall within the scope of the present invention.
It should be noted that the terms "first," "second," and the like in the description and the claims of the present invention and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the invention described herein may be implemented in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
Example 1
Fig. 1 is a flowchart of a random access detection method according to a first embodiment of the present invention, where the method may be performed by a random access detection device, the random access detection device may be implemented in hardware and/or software, and the random access detection device may be configured in an electronic device. As shown in fig. 1, the method includes:
s101, acquiring a cyclic shift value and a sequence length of a preamble sequence, and the number of points of the inverse fast Fourier transform.
In this embodiment, the preamble sequence is a preamble sequence, and the cyclic shift value is a shift value when the preamble sequence is cyclically shifted; the sequence length is the length of the preamble sequence.
When random access detection is performed, the cyclic shift value and the sequence length of the preamble sequence and the number of points of the inverse fast fourier transform are all predetermined values, and the cyclic shift value and the sequence length of the preamble sequence and the number of points of the inverse fast fourier transform can be directly obtained.
S102, determining the number of taps according to the cyclic shift value, the sequence length and the number of points of the inverse fast Fourier transform.
In the present embodiment, the number of taps is used to determine the amount of power as signal power within the detection window.
Determining the size of a detection window after zero padding expansion according to the cyclic shift value, the sequence length and the number of points of the inverse fast Fourier transform; and determining the number of taps in the window after zero padding according to the proportional relation between the size of the window and the signal power.
S103, judging whether a preamble is accessed in the detection window according to the number of taps and the power in the detection window.
In the random access detection process, the detection window generally comprises a plurality of time domain signals, and frequency domain signals can be calculated according to the time domain signals and the reference signals, so that power corresponding to the frequency domain signals is obtained. The number of detection windows is usually multiple, and for each detection window, the method provided by the embodiment of the application can be used for detecting random access.
Determining the power in the detection window, selecting the power representing the signal from the powers according to the number of taps, further determining the power of noise according to the power of the signal, simultaneously determining the peak power, calculating the signal-to-noise ratio according to the power of the noise, and finally judging whether a preamble is accessed in the detection window according to the signal-to-noise ratio.
The embodiment of the invention provides a random access detection method, which is implemented by acquiring a cyclic shift value and a sequence length of a preamble sequence and the number of points of inverse fast Fourier transform; determining the number of taps according to the cyclic shift value, the sequence length and the number of points of the inverse fast Fourier transform; judging whether the preamble is accessed in the detection window according to the tap number and the power in the detection window, solving the problem of inaccurate detection result of random access, calculating the tap number according to the cyclic shift value and the sequence length of the preamble sequence and the number of points of the inverse fast Fourier transform, further judging whether the preamble is accessed in the detection window according to the tap number and the power in the detection window, performing access detection by dynamically calculating the tap number, avoiding the problem of inaccurate detection result caused by setting fixed tap number to perform access detection, and improving the accuracy and reliability of detection.
Example two
Fig. 2 is a flowchart of a random access detection method according to a second embodiment of the present invention, where the embodiment is refined based on the foregoing embodiments. As shown in fig. 2, the method includes:
s201, acquiring a cyclic shift value and a sequence length of a preamble sequence, and the number of points of the inverse fast Fourier transform.
S202, calculating the size of a detection window according to the cyclic shift value, the sequence length and the number of points of the fast Fourier inverse transformation.
And calculating the proportion of zero padding expansion according to the sequence length and the number of points of the fast Fourier inverse transformation, and calculating the size of a detection window according to the proportion and the cyclic shift value. Or, a calculation formula of the size of the detection window is determined in advance, the cyclic shift value, the sequence length and the number of points of the inverse fast Fourier transform are brought into the formula, and the size of the detection window is calculated.
As an optional embodiment of the present embodiment, the size of the detection window is further calculated according to the cyclic shift value, the sequence length and the number of points of the inverse fast fourier transform, and is optimized as:
a1, calculating the ratio of the number of points of the fast Fourier inverse transformation to the sequence length.
Dividing the number of the fast Fourier inverse transformation by the length of the sequence to obtain the ratio of the number of the fast Fourier inverse transformation to the length of the sequence.
A2, determining the product of the ratio and the cyclic shift value as the size of the detection window.
It should be noted that each root sequence is processed in a cyclic manner when preamble detection is performed, so that the concept of a detection window is built on the same root sequence, and the detection window corresponds to a cyclic shift value adopted by the preamble sequence. Since the number of the inverse fast fourier transforms may be different from the sequence length, in general, the number of the inverse fast fourier transforms is 2048 at the maximum, 256 at the minimum, 839 at the maximum, 139 at the minimum, and when the sequence length is different from the number of the inverse fast fourier transforms, zero padding is required to ensure normal processing of the signal, so that the length of the preamble sequence is the same as the number of the inverse fast fourier transforms.
Taking the cyclic shift value as Ncs, the number of points of the inverse fast fourier transform as CorrSize, and the sequence length as Nzc as an example, the size N of the detection window after zero padding expansion (expansion to CorrSize point IFFT) becomes (ncs×corrsize/Nzc), that is, n= (ncs×corrsize/Nzc). If the number of points of the inverse fast fourier transform is the same as the sequence length, zero padding operation is not needed, and the size of the detection window is Ncs, and CorrSize/nzc=1.
S203, determining the number of taps according to the size of the detection window and a preset proportion.
The preset proportion is determined according to the size of the detection window and the duty ratio of the signal power.
In this embodiment, the preset proportion may be predetermined through a test simulation, and simulation is performed in advance according to the sequence length, the number of points of the inverse fast fourier transform, and the cyclic shift value, so as to determine the duty ratio of the signal power in the detection windows with different sizes, and determine the duty ratio as the preset proportion. After changing the sequence length, the number of points of the inverse fast fourier transform or the cyclic shift value, the preset ratio is correspondingly changed. In the embodiment of the application, simulation can be performed in advance according to the length of the unused sequence, the number of points of the inverse fast fourier transform and the cyclic shift value, and the obtained preset proportion is stored. And when the number of taps is determined, inquiring according to the sequence length, the number of points of the inverse fast Fourier transform and the cyclic shift value to obtain a corresponding preset proportion. Multiplying the size of the detection window by a preset proportion, and determining the number of taps according to the product.
As an optional embodiment of the present embodiment, the present optional embodiment further determines the number of taps according to the size of the detection window and the preset ratio, and optimizes to:
b1, calculating the product of the size of the detection window and the preset proportion.
And B2, carrying out rounding operation on the product to obtain the number of taps.
Since the product may be an integer or a non-integer, the product may be directly determined as the number of taps when the product is an integer. When the product is a non-integer, a rounding operation is performed, for example, rounding by rounding, or directly reserving integer digits, etc.; when the product is subjected to rounding operation, the function can be set to perform rounding operation, for example, a round function is set according to the requirement, parameters of the rounding operation are set according to the requirement, the function performs operation according to the parameters, and the obtained operation result is used as the number of taps.
S204, determining the power in the detection window, and determining the peak power according to each power.
And processing the time domain signal in the detection window according to the reference signal, determining the frequency domain signal, and further obtaining the power. The magnitudes of the powers in the detection windows are compared, and the maximum power is determined as the peak power.
In this embodiment, when determining the peak power, the peak position corresponding to the peak power, that is, the index of the peak power in the detection window, may be determined at the same time.
S205, determining the signal power according to the tap number and each power.
And selecting the power corresponding to the signal from the powers according to the tap number, and calculating to obtain the signal power.
As an optional embodiment of the present embodiment, the present optional embodiment further determines the signal power according to the number of taps and each power, and optimizes to:
c1, and sequencing the powers from the higher to the lower.
The power levels are compared, and the powers are sequentially arranged from the top to the bottom. The ordering method may be insert ordering, hill ordering, select ordering, bubble ordering, merge ordering, fast ordering, heap ordering, radix ordering, etc.
And C2, selecting the power with the tap number from the large to the small as the candidate power.
In this embodiment, the candidate power may be specifically understood as a power representing signal transmission.
Taking the number of taps as K as an example, K maximum values are selected from the sorted power, and the selected K powers are used as candidate powers.
And C3, calculating the sum of the candidate powers to obtain the signal power.
Calculating the sum of the candidate powers can be achieved by calling a function, and the sum of the candidate powers is used as the signal power.
S206, calculating the sum of the power in the detection window to obtain the total power, and determining the difference value between the total power and the signal power as the noise power.
Determining all the powers in the detection window, calculating the sum of the powers, and calculating the sum value by calling a function. The sum of the powers is taken as the total power. The difference obtained by subtracting the signal power from the total power is the noise power.
S207, determining the product of the noise power and the threshold value as a target peak power.
In this embodiment, the threshold may be preset, and the threshold may be set according to a requirement for signal quality, where the threshold is a signal-to-noise ratio. The target peak power may be specifically understood as a power value for determining whether the peak power meets the random access requirement. And calculating the product of the noise power and the threshold value, and determining the product as the target peak power.
S208, if the peak power is larger than the target peak power, determining that the preamble is accessed in the detection window.
Comparing the peak power with the target peak power, and if the peak power is larger than the target peak power, determining that a preamble is accessed in the detection window; otherwise, no preamble is accessed in the detection window.
In this embodiment, the steps S207 to S208 may also be: calculating the ratio of peak power to noise power, and if the ratio is greater than a threshold value, determining that a preamble is accessed in a detection window; otherwise, determining that no preamble is accessed in the detection window.
In order to improve the operation efficiency, the present application preferably adopts multiplication to determine whether or not a preamble is accessed in the detection window by determining the magnitude relation between the product of the noise power and the threshold value and the peak power. Division operation is avoided, operation efficiency can be improved, and resources are saved.
As an optional embodiment of the present embodiment, the further optimization of the present optional embodiment includes generating and reporting the detection result.
After judging whether the detection window is accessed with the preamble or not, generating and reporting a detection result, wherein the detection result can be that the preamble is accessed in the detection window and the preamble is not accessed in the detection window. The detection result may be reported to an upper layer application, other devices, etc.
The embodiment of the invention provides a random access detection method, which is characterized in that reasonable tap number serving as signal power is obtained through cyclic shift value and sequence length of a preamble sequence and point self-adaption of inverse fast Fourier transform, the product of the ratio and the cyclic shift value is determined as the size of a detection window by calculating the ratio of the point of the inverse fast Fourier transform to the sequence length, and then the tap number is determined according to the product of the size of the detection window and a preset proportion; the power in the detection window is extracted according to the number of taps, the signal power and the noise power are accurately calculated, whether the preamble is accessed in the detection window is judged, the judgment accuracy is improved, the problem that the random access detection result is inaccurate is solved, the access detection is carried out by dynamically calculating the number of taps, the problem that the detection result is inaccurate due to the fact that the fixed number of taps is set for the access detection is avoided, and the detection accuracy and reliability are effectively improved.
Example III
Fig. 3 is a schematic structural diagram of a random access detection device according to a third embodiment of the present invention. As shown in fig. 3, the apparatus includes: a data acquisition module 31, a tap number determination module 32 and an access detection module 33.
The data acquisition module 31 is configured to acquire a cyclic shift value and a sequence length of the preamble sequence, and a point number of inverse fast fourier transform;
a tap number determining module 32, configured to determine the tap number according to the cyclic shift value, the sequence length and the number of points of the inverse fast fourier transform;
and the access detection module 33 is configured to determine whether a preamble is accessed in the detection window according to the number of taps and the power in the detection window.
The embodiment of the invention provides a device for random access detection, which is used for determining the number of taps according to a cyclic shift value, a sequence length and the number of points of inverse fast Fourier transform; and whether the preamble is accessed in the detection window is judged according to the number of taps and the power in the detection window, the access detection is carried out by dynamically calculating the number of taps, the problem of inaccurate detection results caused by setting the fixed number of taps to carry out the access detection is avoided, and the accuracy and the reliability of the detection are improved.
Optionally, the tap number determination module 32 includes:
a window size determining unit, configured to calculate a size of a detection window according to the cyclic shift value, the sequence length, and the number of points of the inverse fast fourier transform;
the tap number determining unit is used for determining the tap number according to the size of the detection window and a preset proportion;
the preset proportion is determined according to the size of the detection window and the duty ratio of the signal power.
Optionally, the window size determining unit is specifically configured to: calculating the ratio of the number of points of the fast Fourier transform to the length of the sequence; the product of the ratio and the cyclic shift value is determined as the size of a detection window.
Optionally, the tap number determining unit is specifically configured to: calculating the product of the size of the detection window and a preset proportion; and performing rounding operation on the product to obtain the number of taps.
Optionally, the access detection module 33 includes:
the peak power determining unit is used for determining the power in the detection window and determining the peak power according to each power;
a signal power determining unit configured to determine a signal power based on the number of taps and each of the powers;
the noise power determining unit is used for calculating the sum of the powers in the detection window to obtain total power, and determining the difference value between the total power and the signal power as noise power;
a target peak value determining unit configured to determine a product of the noise power and a threshold value as a target peak value power;
and the access detection unit is used for determining that the preamble is accessed in the detection window if the peak power is larger than the target peak power.
Optionally, the signal power determining unit is specifically configured to: and sequencing the power in order from big to small; selecting the power of the tap number as candidate power in the order from big to small; and calculating the sum of the candidate powers to obtain the signal power.
Optionally, the apparatus further comprises:
and the reporting module is used for generating and reporting the detection result.
The random access detection device provided by the embodiment of the invention can execute the random access detection method provided by any embodiment of the invention, and has the corresponding functional modules and beneficial effects of the execution method.
Example IV
Fig. 4 shows a schematic diagram of an electronic device 40 that may be used to implement an embodiment of the invention. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. Electronic equipment may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices (e.g., helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the inventions described and/or claimed herein.
As shown in fig. 4, the electronic device 40 includes at least one processor 41, and a memory communicatively connected to the at least one processor 41, such as a Read Only Memory (ROM) 42, a Random Access Memory (RAM) 43, etc., in which the memory stores a computer program executable by the at least one processor, and the processor 41 may perform various suitable actions and processes according to the computer program stored in the Read Only Memory (ROM) 42 or the computer program loaded from the storage unit 48 into the Random Access Memory (RAM) 43. In the RAM 43, various programs and data required for the operation of the electronic device 40 may also be stored. The processor 41, the ROM 42 and the RAM 43 are connected to each other via a bus 44. An input/output (I/O) interface 45 is also connected to bus 44.
Various components in electronic device 40 are connected to I/O interface 45, including: an input unit 46 such as a keyboard, a mouse, etc.; an output unit 47 such as various types of displays, speakers, and the like; a storage unit 48 such as a magnetic disk, an optical disk, or the like; and a communication unit 49 such as a network card, modem, wireless communication transceiver, etc. The communication unit 49 allows the electronic device 40 to exchange information/data with other devices via a computer network, such as the internet, and/or various telecommunication networks.
The processor 41 may be various general and/or special purpose processing components with processing and computing capabilities. Some examples of processor 41 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various processors running machine learning model algorithms, digital Signal Processors (DSPs), and any suitable processor, controller, microcontroller, etc. The processor 41 performs the various methods and processes described above, such as a random access detection method.
In some embodiments, the random access detection method may be implemented as a computer program tangibly embodied on a computer-readable storage medium, such as the storage unit 48. In some embodiments, part or all of the computer program may be loaded and/or installed onto the electronic device 40 via the ROM 42 and/or the communication unit 49. When the computer program is loaded into the RAM 43 and executed by the processor 41, one or more steps of the random access detection method described above may be performed. Alternatively, in other embodiments, the processor 41 may be configured to perform the random access detection method by any other suitable means (e.g. by means of firmware).
Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuit systems, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems On Chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor, which may be a special purpose or general-purpose programmable processor, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device, and at least one output device.
A computer program for carrying out methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the computer programs, when executed by the processor, cause the functions/acts specified in the flowchart and/or block diagram block or blocks to be implemented. The computer program may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.
In the context of the present invention, a computer-readable storage medium may be a tangible medium that can contain, or store a computer program for use by or in connection with an instruction execution system, apparatus, or device. The computer readable storage medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. Alternatively, the computer readable storage medium may be a machine readable signal medium. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
To provide for interaction with a user, the systems and techniques described here can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) through which a user can provide input to the electronic device. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic input, speech input, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), blockchain networks, and the internet.
The computing system may include clients and servers. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, also called a cloud computing server or a cloud host, and is a host product in a cloud computing service system, so that the defects of high management difficulty and weak service expansibility in the traditional physical hosts and VPS service are overcome.
It should be appreciated that various forms of the flows shown above may be used to reorder, add, or delete steps. For example, the steps described in the present invention may be performed in parallel, sequentially, or in a different order, so long as the desired results of the technical solution of the present invention are achieved, and the present invention is not limited herein.
The above embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives are possible, depending on design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.
Claims (10)
1. A random access detection method, comprising:
acquiring a cyclic shift value and a sequence length of a preamble sequence and the number of points of inverse fast Fourier transform;
determining the number of taps according to the cyclic shift value, the sequence length and the number of points of the inverse fast Fourier transform;
and judging whether a preamble is accessed in the detection window according to the tap number and the power in the detection window.
2. The method of claim 1, wherein the determining the number of taps based on the cyclic shift value, the sequence length, and the number of points of the inverse fast fourier transform comprises:
calculating the size of a detection window according to the cyclic shift value, the sequence length and the number of points of the fast Fourier inverse transformation;
determining the number of taps according to the size of the detection window and a preset proportion;
the preset proportion is determined according to the size of the detection window and the duty ratio of the signal power.
3. The method of claim 2, wherein calculating the size of the detection window based on the cyclic shift value, the sequence length, and the number of points of the inverse fast fourier transform comprises:
calculating the ratio of the number of points of the fast Fourier transform to the length of the sequence;
the product of the ratio and the cyclic shift value is determined as the size of a detection window.
4. The method of claim 2, wherein the determining the number of taps according to the size of the detection window and a preset ratio comprises:
calculating the product of the size of the detection window and a preset proportion;
and performing rounding operation on the product to obtain the number of taps.
5. The method of claim 1, wherein the determining whether there is preamble access in the detection window based on the number of taps in combination with power in the detection window comprises:
determining the power in the detection window, and determining peak power according to each power;
determining signal power according to the tap number and each power;
calculating the sum of the powers in the detection window to obtain total power, and determining the difference value between the total power and the signal power as noise power;
determining the product of the noise power and a threshold value as a target peak power;
and if the peak power is larger than the target peak power, determining that a preamble is accessed in a detection window.
6. The method of claim 5, wherein said determining a signal power based on said number of taps and each of said powers comprises:
and sequencing the power in order from big to small;
selecting the power of the tap number as candidate power in the order from big to small;
and calculating the sum of the candidate powers to obtain the signal power.
7. The method of any one of claims 1-6, further comprising:
and generating and reporting a detection result.
8. A random access detection apparatus, comprising:
the data acquisition module is used for acquiring the cyclic shift value and the sequence length of the preamble sequence and the number of points of the inverse fast Fourier transform;
the tap number determining module is used for determining the tap number according to the cyclic shift value, the sequence length and the number of points of the fast Fourier inverse transformation;
and the access detection module is used for judging whether the preamble is accessed in the detection window according to the tap number and the power in the detection window.
9. An electronic device, the electronic device comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,
the memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the random access detection method of any one of claims 1-7.
10. A computer readable storage medium storing computer instructions for causing a processor to implement the random access detection method of any one of claims 1-7 when executed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311552217.9A CN117596704A (en) | 2023-11-20 | 2023-11-20 | Random access detection method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311552217.9A CN117596704A (en) | 2023-11-20 | 2023-11-20 | Random access detection method and device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117596704A true CN117596704A (en) | 2024-02-23 |
Family
ID=89917638
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311552217.9A Pending CN117596704A (en) | 2023-11-20 | 2023-11-20 | Random access detection method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117596704A (en) |
-
2023
- 2023-11-20 CN CN202311552217.9A patent/CN117596704A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN116225769B (en) | Method, device, equipment and medium for determining root cause of system fault | |
| CN117009283A (en) | Multi-core multi-chip data processing method, device, chip and storage medium | |
| CN117596704A (en) | Random access detection method and device, electronic equipment and storage medium | |
| CN114564149B (en) | Data storage method, device, equipment and storage medium | |
| CN115438007A (en) | File merging method and device, electronic equipment and medium | |
| CN115333715B (en) | Synchronization method, device, communication equipment and medium of narrowband communication system | |
| CN114866437B (en) | Node detection method, device, equipment and medium | |
| CN117150215B (en) | Assessment result determining method and device, electronic equipment and storage medium | |
| CN115373449B (en) | Data processing method, device, equipment and storage medium | |
| CN115292662B (en) | Convolution acceleration operation method and device, electronic equipment and storage medium | |
| CN115098405B (en) | Software product evaluation method and device, electronic equipment and storage medium | |
| CN117827710B (en) | DMA bandwidth determining method, device, equipment and medium based on AI chip | |
| CN116931083A (en) | Determination method of azimuth angle gather division scheme | |
| CN118132909A (en) | Data processing method and device and electronic equipment | |
| CN116523051A (en) | Model mixed-precision reasoning method, device, equipment and storage medium | |
| CN116911466A (en) | Method, device, equipment and medium for determining park construction degree | |
| CN116240714A (en) | Drying method, drying device, electronic equipment and storage medium | |
| CN118137488A (en) | Power consumption prediction method, device, medium and electronic equipment | |
| CN116205321A (en) | Method, device, equipment and storage medium for determining carbon consumption | |
| CN115801163A (en) | Method, device, equipment and medium for synchronizing symbols identified by calling number | |
| CN117687992A (en) | Data migration method, device, equipment and storage medium | |
| CN117271113A (en) | Task execution method, device, electronic equipment and storage medium | |
| CN117974220A (en) | Method, device, equipment and medium for locating and sizing power mutual-aid equipment of power distribution network | |
| CN118152717A (en) | Signal conversion method based on multifunctional sine interpolation structure | |
| CN116304635A (en) | Operation data analysis method, device and equipment of pumped storage equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |