Wireless access method and system for cellular communication cell

Abstract

The embodiment of the invention provides a wireless access method and system for a cellular communication cell, and relates to the technical field of wireless communication. Comprising the steps of obtaining a plurality of first frequency points based on a frequency sweeping operation, and performing descending order arrangement on metric values of the plurality of first frequency points; selecting a plurality of initialized frequency point groups; sequentially storing the first frequency points corresponding to the metric values into the corresponding frequency point groups based on the sequence of the metric values from large to small until all the first frequency points are stored or all the frequency point groups are filled with the first frequency points, so as to obtain an array of target frequency points; based on the array of the target frequency points, scanning the target frequency points in sequence from small column number to large column number; wherein under the condition that the nth column is scanned and the target frequency point is still not scanned, the (n + 1) th column is continuously scanned until the target frequency point is scanned, so that the mobile terminal is accessed to the target frequency point. Through one embodiment of the invention, the problem that the speed of accessing the cellular communication cell by the mobile terminal is low in the prior art is at least solved.

Description

TECHNICAL FIELD

[0001] Embodiments of the present application relate to the technical field of wireless communication, in particular, relate to a cellular communication cell wireless access method and system. BACKGROUND

[0002] With the development of communication technology and the improvement of people's quality of life, the network access speed of communication equipment has become an important factor. In 4G, 5G, 6G and other networks, booting and accessing the network is the first step to achieve communication. The longer the time spent in network access, the longer the user waits. In today's society that values efficiency and instant communication, faster access to communication networks is in line with the development trend of society. Therefore, the control of cellular communication cell access becomes increasingly important.

[0003] The mainstream technology for selecting and accessing a cellular communication cell currently mainly includes: first performing frequency sweeping to obtain the energy of each frequency point, and then performing cell search and subsequent access processing on the frequency points in turn. However, there may be false frequency points in multiple frequency points. False access to false frequency points not only has security risks, but also reduces the speed of mobile terminals accessing cellular communication cells. Therefore, there is a problem of slow speed of mobile terminals accessing cellular communication cells. SUMMARY

[0004] Embodiments of the present application provide a cellular communication cell wireless access method and system to at least solve the problem of slow speed of mobile terminals accessing cellular communication cells in the related art.

[0005] According to an embodiment of the present application, a cellular communication cell wireless access method is provided, comprising:

[0006] obtaining a plurality of first frequency points based on a frequency sweeping operation, and arranging the metric values of the plurality of first frequency points in descending order;

[0007] selecting a plurality of initialized frequency point groups;

[0008] storing the first frequency points corresponding to the metric values in the corresponding frequency point groups in order from large to small based on the metric values, until all the first frequency points are stored or all the frequency point groups are filled with the first frequency points, to obtain an array of target frequency points; wherein in each frequency point group, the first frequency points are sequentially stored from low to high;

[0009] scanning out target frequency points in order from small to large based on the array of target frequency points; wherein in the nth column, the target frequency points are scanned out in order from small to large in the number of rows, and if the target frequency points are not scanned out after scanning the nth column, the (n+1)th column is continued to be scanned until the target frequency points are scanned out, so that the mobile terminal accesses the target frequency points; wherein n is a natural number.

[0010] In one implementation, the first frequency points corresponding to the metric values ​​are sequentially stored into the corresponding frequency point groups based on the descending order of the metric values, until all the first frequency points are stored or all the frequency point groups are filled with the first frequency points, to obtain an array of target frequency points, including:

[0011] Select frequency groups as target frequency groups in ascending order of frequency size;

[0012] Determine whether there is a frequency point in the target frequency point group to determine whether the target frequency point group is an empty frequency point group or a non-empty frequency point group; wherein, if the target frequency point group is an empty frequency point group, the first frequency point is sequentially placed in the target frequency point group from the least significant bit to the most significant bit.

[0013] In one implementation, determining whether a frequency point exists within the target frequency point group to determine whether the target frequency point group is an empty frequency point group or a non-empty frequency point group includes:

[0014] When the target frequency group is not an empty frequency group, the distance between the first frequency point and the first frequency point in the target frequency group is determined, and the number of frequency points that already exist in the target frequency group is determined; wherein, when the distance is within a threshold range and the number is less than the storage capacity of the target frequency group, the first frequency point is sequentially placed in the target frequency group from low to high bits.

[0015] In one embodiment, after sequentially placing the first frequency point into the target frequency point group from least significant bit to most significant bit, the method further includes:

[0016] Determine whether all the initialized frequency point groups have been filled with the first frequency point;

[0017] Determine whether all first frequency points have been traversed;

[0018] Once it is determined that all initialized frequency point groups have been filled with the first frequency points, and that all first frequency points have been traversed, the target frequency points are sequentially scanned based on the array of the target frequency points in ascending order of column number.

[0019] In one implementation, determining whether all the initialized frequency point groups have been filled with the first frequency point includes: if it is determined that there are initialized frequency point groups that have not been filled with the first frequency point, continuing to traverse the next first frequency point.

[0020] In one implementation, determining whether all first frequency points have been traversed includes: if it is determined that not all first frequency points have been traversed, continuing to traverse the next first frequency point.

[0021] In one implementation, in the array of target frequency points, each row corresponds to a frequency point group, and each column corresponds to the same position within multiple frequency point groups.

[0022] According to another embodiment of this application, a cellular communication cell wireless access system is provided, comprising:

[0023] The frequency sweep module is used to obtain multiple first frequency points based on the frequency sweep operation, and to sort the metric values ​​of the multiple first frequency points in descending order;

[0024] The initialization module is used to select multiple initialized frequency point groups;

[0025] The grouping module is used to sequentially store the first frequency points corresponding to the measurement values ​​into the corresponding frequency point groups based on the measurement values ​​in descending order, until all the first frequency points are stored or all the frequency point groups are filled with the first frequency points, so as to obtain an array of target frequency points; wherein, in each frequency point group, the first frequency points are sequentially placed from the least significant bit to the most significant bit.

[0026] The access module is used to scan the target frequency points sequentially based on the array of target frequency points in ascending order of column number; wherein, in the nth column, the target frequency points are scanned sequentially in ascending order of row number, and if the target frequency point is not scanned after scanning the nth column, the (n+1)th column is scanned until the target frequency point is scanned, so that the mobile terminal can access the target frequency point; wherein, n is a natural number.

[0027] According to yet another embodiment of this application, a computer-readable storage medium is also provided, wherein a computer program is stored therein, and the computer program is configured to perform the steps in any of the above method embodiments when it is run.

[0028] According to yet another embodiment of this application, an electronic device is also provided, including a memory and a processor, wherein the memory stores a computer program and the processor is configured to run the computer program to perform the steps in any of the above method embodiments.

[0029] According to yet another embodiment of this application, a computer program product is also provided, including computer instructions that, when executed by a processor, implement the steps in any of the above method embodiments.

[0030] One embodiment of this application utilizes the characteristics of limited synchronization signal bandwidth and the fact that only one true frequency exists among several adjacent frequency points, and that the true frequency point has the highest energy. First, multiple first frequency points obtained from frequency scanning are arranged in descending order of metric value. This sorting highlights the advantage of the true frequency point (highest energy), laying the foundation for priority access in the future. Next, multiple initial frequency point groups are selected, and the first frequency points are sequentially stored into each group in descending order of metric value (within each group, the bits are added sequentially from least significant to most significant), forming a target frequency point array. This grouping method improves the cell access priority of the true frequency points. Finally, the target frequency points are scanned sequentially in ascending order of column number and ascending order of row number within each column until a target frequency point is found for mobile terminal access. This scanning method can quickly locate the true frequency point, effectively avoiding access delays caused by mistakenly accessing false frequency points, ultimately improving the speed of mobile terminal access to cellular communication cells. Attached Figure Description

[0031] The accompanying drawings, which are included to provide a further understanding of the embodiments of this application and constitute a part of the embodiments of this application, illustrate exemplary embodiments of this application and, together with their descriptions, serve to explain the embodiments of this application and do not constitute an improper limitation of the embodiments of this application. In the drawings:

[0032] Figure 1 This is a hardware structure block diagram of the cellular communication cell wireless access method according to an embodiment of this application;

[0033] Figure 2 This is a flowchart of a cellular communication cell wireless access method according to an embodiment of this application;

[0034] Figure 3 This is a flowchart of a method for obtaining an array of target frequency points by sequentially storing the first frequency points corresponding to the measurement values ​​into the corresponding frequency point groups in descending order of measurement values, according to an embodiment of this application, until all the first frequency points are stored or all frequency point groups are filled with first frequency points.

[0035] Figure 4 This is a flowchart of a method for determining a target scanning frequency point according to an embodiment of this application;

[0036] Figure 5 This is a structural block diagram of a cellular communication cell wireless access system according to an embodiment of this application;

[0037] Figure 6 This is a flowchart of an example of a cellular communication cell wireless access method according to an embodiment of this application. Detailed Implementation

[0038] The embodiments of this application will be described in detail below with reference to the accompanying drawings and examples. It should be noted that, unless otherwise specified, the embodiments and features described in the embodiments of this application can be combined with each other.

[0039] It should be noted that the terms "first," "second," etc., in the specification, claims, and drawings of the embodiments of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence.

[0040] The methods and embodiments provided in this application can be executed on a mobile terminal or similar computing device. Taking running on a mobile terminal as an example, Figure 1 This is a hardware structure block diagram of the cellular communication cell wireless access method according to an embodiment of this application, as shown below. Figure 1 As shown, a hardware board may include one or more ( Figure 1 Only one is shown in the diagram. A processor 12 (which may include, but is not limited to, a microprocessor MCU or programmable logic device, etc.) and a memory 14 for storing data are also shown. The mobile terminal may further include a transmission device 16 for communication functions and an input / output device 18. Those skilled in the art will understand that... Figure 1 The structure shown is for illustrative purposes only and does not limit the structure of the mobile terminal described above. For example, the mobile terminal may also include components that are more... Figure 1 The more or fewer components shown, or having the same Figure 1 The different configurations shown.

[0041] The memory 14 can be used to store computer programs, such as application software programs and modules, like the computer program corresponding to the cellular communication cell wireless access method in this embodiment. The processor 12 executes various functional applications and implements the above-described methods by running the computer programs stored in the memory 14. The memory 14 may include high-speed random access memory and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory 14 may further include memory remotely located relative to the processor 12, and these remote memories can be connected to the mobile terminal via a network. Examples of such networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

[0042] The transmission device 16 is used to receive or send data via a network. Specific examples of the network described above may include a wireless network provided by a telecommunications provider. In one example, the transmission device 16 includes a Network Interface Controller (NIC), which can connect to other network devices via a base station to communicate with the Internet. In another example, the transmission device 16 may be a Radio Frequency (RF) module used for wireless communication with the Internet.

[0043] This application provides a method for wireless access in a cellular communication cell. Figure 2 This is a flowchart of a cellular communication cell wireless access method according to an embodiment of this application, such as... Figure 2 As shown, the process includes:

[0044] Step S201: Based on the frequency sweep operation, multiple first frequency points are obtained, and the metric values ​​of the multiple first frequency points are sorted in descending order;

[0045] In one exemplary implementation, for example, the mobile terminal (smartphone, tablet, etc.) first performs a full-band frequency sweep, collecting all detectable first frequency points within the coverage area. Then, it extracts the metric value of each first frequency point (this metric value can characterize core communication indicators such as frequency point signal energy and signal-to-noise ratio) through a preset algorithm, and sorts all first frequency points in descending order according to the metric value from high to low. Through this technical solution, all accessible candidate frequency points are first screened out, and then frequency points with better signal quality (probably the real frequency points) are prioritized through sorting, initially filtering out low-quality frequency points, and establishing a basic sorting basis for subsequent accurate screening of real frequency points.

[0046] Step S202: Select multiple initialized frequency point groups;

[0047] In one exemplary implementation, for example, based on the mobile terminal's hardware storage capacity and preset frequency point grouping rules, a fixed number of blank frequency point groups are selected and initialized. Each frequency point group has a pre-set maximum storage capacity and frequency point storage order rules. Through this technical solution, a carrier for frequency point classification and storage is established, providing a standardized grouping framework for the subsequent orderly classification of frequency points with different measurement values, avoiding the low scanning efficiency caused by chaotic frequency point storage.

[0048] Step S203: Based on the metric values ​​in descending order, store the first frequency points corresponding to the metric values ​​into the corresponding frequency point groups in sequence until all the first frequency points are stored or all frequency point groups are filled with first frequency points, so as to obtain the array of target frequency points; wherein, in each frequency point group, the first frequency points are placed in sequence from the least significant bit to the most significant bit.

[0049] In one exemplary implementation, for example, the first frequency points are sequentially allocated to the initialized frequency point groups according to the descending order of the metric values ​​obtained in step S201. During allocation, the target frequency point group is selected first according to the frequency point group number from smallest to largest. If it is a blank frequency point group, the frequency points are directly stored from the lowest bit to the highest bit. If it is a non-empty frequency point group, it is first determined whether the distance between the currently selected first frequency point and the first frequency point in the currently selected non-empty frequency point group is within the threshold range, and whether the storage quantity in the currently selected non-empty frequency point group is not full. If the conditions are met, the frequency points are stored until all first frequency points are allocated or the frequency point groups are completely filled, ultimately forming a target frequency point array with row-corresponding frequency point groups and column-corresponding frequency point groups at the same position. Through this technical solution, the height metric value frequency points are distributed to the lower bits of different frequency point groups, allowing the real frequency points to form an orderly distribution in the array (the row and column numbers of the real frequency points in the target frequency point array are as early as possible). At the same time, the grouping rules avoid excessively large frequency band spans in the same group, improving the targeting of subsequent scans.

[0050] Step S204: Based on the array of target frequency points, the target frequency points are scanned sequentially in ascending order of column number; wherein, in the nth column, the target frequency points are scanned sequentially in ascending order of row number. If the target frequency point is not scanned after scanning the nth column, the (n+1)th column is scanned until the target frequency point is scanned, so that the mobile terminal can access the target frequency point; wherein, n is a natural number.

[0051] In one implementation, in the array of target frequency points, each row corresponds to a frequency point group, and each column corresponds to the same position within multiple frequency point groups.

[0052] In one exemplary implementation, for example, the column number of the target frequency array is used as the scanning priority from smallest to largest. Within the same column, frequency points are checked one by one in ascending order of row number to determine if they are truly accessible. If no usable frequency point is found in the current column, the scan continues to the next column until the target frequency point is located and the mobile terminal access is completed. This technical solution prioritizes scanning the low-order height-value frequency points in each frequency point group, significantly shortening the time to locate the real frequency point, reducing invalid detection of false frequency points, and directly reducing access latency.

[0053] Through steps S201 to S204, the limited bandwidth of the synchronization signal and the fact that only one true frequency exists among several adjacent frequency points, and that the true frequency point has the highest energy, are utilized. First, the multiple first frequency points obtained from the frequency sweep are arranged in descending order of their metric values. This sorting highlights the advantage of the true frequency point (highest energy), laying the foundation for priority access in the future. Next, multiple initial frequency point groups are selected, and the first frequency points are sequentially stored into each group in descending order of their metric values ​​(within each group, the bits are added sequentially from the least significant bit to the most significant bit), forming a target frequency point array. This grouping method improves the cell access priority of the true frequency points. Finally, the target frequency points are scanned sequentially in ascending order of column number and ascending order of row number within each column until a target frequency point is found for mobile terminal access. This scanning method can quickly locate the true frequency point, effectively avoiding access delays caused by mistakenly accessing false frequency points, ultimately improving the speed of mobile terminal access to cellular communication cells.

[0054] Figure 3 This is a flowchart illustrating a method for obtaining an array of target frequency points by sequentially storing the first frequency points corresponding to the metric values ​​in descending order according to embodiments of this application, until all first frequency points are stored or all frequency point groups are filled with first frequency points. Figure 3 As shown, in one implementation, the first frequency points corresponding to the metric values ​​are sequentially stored into the corresponding frequency point groups based on the metric values ​​in descending order, until all the first frequency points are stored or all frequency point groups are filled with first frequency points, to obtain an array of target frequency points, including:

[0055] Step S301: Select frequency point groups as target frequency point groups in ascending order;

[0056] In one exemplary implementation, for example, the initialized frequency point groups are pre-numbered, such as frequency point group 0, frequency point group 1, and frequency point group 2. Then, according to the ascending order of the frequency point group numbers, one frequency point group is selected sequentially as the target frequency point group for the current frequency point to be stored, awaiting subsequent frequency point storage judgment. This technical solution sets a unified and orderly selection rule for frequency point allocation, with a higher probability that the target frequency point exists in the earlier frequency point group, avoiding the randomness of frequency point group selection that leads to chaotic frequency point distribution, and ensuring the standardization and consistency of the subsequent frequency point storage process.

[0057] Step S301: Determine whether there is a frequency point in the target frequency point group to determine whether the target frequency point group is an empty frequency point group or a non-empty frequency point group; wherein, if the target frequency point group is an empty frequency point group, the first frequency point is sequentially placed in the target frequency point group from low bit to high bit.

[0058] In one exemplary implementation, for example, after selecting a target frequency group, it is first checked whether there is any stored frequency data in the storage area of ​​the frequency group, thereby determining whether it is an empty frequency group or a non-empty frequency group. If it is determined to be an empty frequency group, a bit order rule from low to high is adopted, and the first frequency to be allocated is preferentially stored in the low storage position of the frequency group. Through this technical solution, the accurate determination of the frequency group status is first completed, establishing a basic frequency storage starting point for empty frequency groups. At the same time, the bit order rule provides a unified bit order standard for the subsequent orderly stacking of frequency points and array formation.

[0059] Through steps S301 to S302, the former establishes a framework for frequency point allocation through ordered group selection, while the latter completes the initial frequency point filling of empty frequency point groups and the sequential filling of subsequent frequency points through state determination and fixed bit order. The combination of the two not only ensures the regularity of frequency point group selection, but also establishes a unified execution benchmark for the storage of frequency points in subsequent non-empty frequency point groups. At the same time, through the storage logic from low bit to high bit, it lays the foundation for column alignment of the target frequency point array, ensuring that frequency points can be retrieved in a unified dimension during subsequent array scanning, thereby improving the efficiency and orderliness of overall frequency point grouping.

[0060] In one implementation, determining whether a frequency point exists within the target frequency point group to determine whether the target frequency point group is an empty frequency point group or a non-empty frequency point group includes: if the target frequency point group is a non-empty frequency point group, determining the distance between the first frequency point and the first frequency point within the target frequency point group, and determining the number of frequency points already existing within the target frequency point group; wherein, if the distance is within a threshold range and the number is less than the storage capacity of the target frequency point group, the first frequency point is sequentially placed into the target frequency point group from the least significant bit to the most significant bit.

[0061] In one exemplary implementation, for example, three frequency point groups have been initialized, and the maximum storage capacity of each frequency point group is three frequency points. The frequency point spacing threshold is set to 10MHz. When processing a first frequency point (2495MHz) after sorting the metric values, if the selected target frequency point group is a non-empty frequency point group (e.g., the group has already stored frequency point A (2500MHz) and frequency point B (2505MHz)), the spacing between the first frequency point and the first frequency point in the group is first calculated (|2495MHz-2500MHz|=5MHz). Then, the number of stored frequency points (2) is counted. If it is determined that the spacing of 5MHz is within the threshold range of 10MHz and the number of stored points 2 is less than the storage capacity of 3, the current first frequency point is stored in the third position of the frequency point group according to the rule from low to high bits. Therefore, this technical solution, through dual verification of frequency spacing and storage quantity, ensures that the frequency bands within the same frequency group are concentrated and their number is controllable. This reduces the search priority of false frequencies (for example, given two far apart real frequencies A and B, where the power of real frequency A is 10dB greater than that of real frequency B, the power of real frequency A reported during frequency sweep and the power of the two adjacent frequencies of real frequency A (false frequencies C and D) are both greater than the power of real frequency B). After grouping, real frequency A, false frequency C, and false frequency D can be... In group 0, the indices of spurious frequency points C and D are k=1 and k=2 respectively. The real frequency point B is the first in group 1, with an index k=0. By fixing k and traversing groups first, the priority of the real frequency point B is increased (higher than spurious frequencies C and D), preventing frequency group storage overload. Simultaneously, it ensures that high-value frequencies are filled in an orderly manner according to rules, laying a crucial grouping foundation for forming a regular target frequency array and efficient column scanning, further improving the retrieval efficiency of real frequencies.

[0062] Figure 4 This is a flowchart of a method for determining a target scanning frequency point according to an embodiment of this application, such as... Figure 4 As shown, in one embodiment, after sequentially placing the first frequency point into the target frequency point group from low to high bits, the method further includes:

[0063] Step S401: Determine whether all initialized frequency point groups have been filled with the first frequency point;

[0064] In one exemplary implementation, for example, a fixed storage capacity is pre-set for each initial frequency point group (e.g., a maximum of 3 frequency points per group). After completing the storage operation of a first frequency point, the storage status of all frequency point groups is traversed, and the number of stored frequency points in each frequency point group is checked one by one to see if it has reached the preset capacity limit, thereby determining whether all frequency point groups are completely full. This technical solution monitors the storage saturation of frequency point groups in real time, providing crucial storage status information for deciding whether to continue allocating frequency points, avoiding storage chaos caused by frequency point group overload, and ensuring the orderly progress of the frequency point grouping process.

[0065] Step S402: Determine whether all first frequency points have been traversed;

[0066] In one exemplary implementation, for example, a statistical list of the total number of first frequency points obtained from frequency scanning and a count identifier of the allocated frequency points are established. After each frequency point is stored, the allocated count is compared with the total number of frequency points to determine whether all first frequency points have been traversed. This technical solution accurately controls the overall progress of frequency point allocation, prevents the problem of frequency point omission or duplicate allocation, and ensures that all candidate frequency points can participate in grouping according to the rules, thus providing a guarantee for the formation of a complete target frequency point array.

[0067] Step S403: After determining that all initialized frequency point groups have been filled with the first frequency points and that all first frequency points have been traversed, the target frequency points are sequentially scanned based on the array of target frequency points in ascending order of column number.

[0068] In one exemplary implementation, for example, when both conditions are met simultaneously—"all frequency groups are full" and "all first frequency points have been traversed"—the target frequency scanning process is triggered. The existing target frequency array is retrieved, and the frequency points at each location are sequentially checked for accessibility in ascending order of column number and row number within the same column, until the target frequency point is found and mobile terminal access is completed. This technical solution sets precise trigger conditions for the frequency scanning process, ensuring that the scanning phase only begins after all frequency grouping is complete. This avoids scanning logic confusion caused by incomplete grouping and improves the retrieval efficiency of actual frequency points through predetermined scanning rules.

[0069] Through the above steps S401 to S403, step S401 forms a dual verification from the storage capacity dimension and step S402 forms a dual verification from the frequency point allocation progress dimension. Step S403 accurately triggers scanning based on the result of passing the dual verification. The combination of the three ensures the integrity and standardization of frequency point grouping, and realizes the seamless connection between the grouping process and the scanning process. It avoids the access efficiency loss caused by early scanning or delayed scanning, and at the same time ensures the integrity of the target frequency point array. This lays a solid foundation for efficient location of real frequency points and improvement of mobile terminal network access speed.

[0070] In one implementation, determining whether all initialized frequency point groups have been filled with the first frequency point includes: if it is determined that there are initialized frequency point groups that have not been filled with the first frequency point, continuing to traverse the next first frequency point.

[0071] In one exemplary implementation, for example, three initial frequency point groups are pre-set, with each group having a maximum storage capacity of three first frequency points. After completing the storage operation of one first frequency point, the system iterates through the storage status of all frequency point groups. For instance, if it detects that frequency point group 0 has stored three frequency points (reaching the capacity limit), frequency point group 1 has only stored one frequency point, and frequency point group 2 has only stored two frequency points, it determines that there are frequency point groups that are not fully occupied. Furthermore, if there are still first frequency points that have not been fully traversed, the next first frequency point that has not yet been allocated after frequency scanning and sorting is retrieved, and the target frequency point group is matched and stored according to the frequency point group selection and storage rules. By adopting this technical solution, it can be ensured that all first frequency points can be grouped according to the rules as much as possible, avoiding premature termination of the frequency point allocation process due to some frequency point groups not being fully occupied. This ensures that the target frequency point array can include more candidate frequency points, while maintaining the continuity and integrity of frequency point allocation. This provides more comprehensive frequency point data support for subsequent rapid location of real frequency points through column scanning, further improving the efficiency and success rate of mobile terminals accessing cellular communication cells.

[0072] In one implementation, determining whether all first frequency points have been traversed includes: if it is determined that not all first frequency points have been traversed, continuing to traverse the next first frequency point.

[0073] In one exemplary implementation, for example, the total number of first frequency points after frequency scanning and sorting is counted first, for example, a total of 10 first frequency points are obtained and marked as frequency points 0 to 9 in descending order of metric value. At the same time, a counter for the allocated frequency points is set with an initial value of 0. The counter value is incremented by 1 for each frequency point successfully stored in the frequency point group. When a frequency point (such as frequency point 3) is stored, the counter value (4 at this time) is compared with the total number (10). It is determined that not all first frequency points have been traversed. Then, the next frequency point (i.e., frequency point 4) of the current frequency point is retrieved from the sorting queue, and the grouping operation of the frequency point is completed according to the process of frequency point group selection, status judgment, and rule storage. By adopting this technical solution, it can be ensured that all candidate first frequency points can participate in grouping according to the priority of the metric value, avoiding the omission of high-value frequency points due to premature termination of frequency point traversal, ensuring that the target frequency point array can cover a sufficient number of high-quality candidate frequency points, providing more sufficient data support for subsequent column scanning to quickly locate the real accessible frequency points, while maintaining the integrity and orderliness of the frequency point grouping process, further improving the efficiency and success rate of mobile terminals accessing cellular communication cells.

[0074] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods according to the above embodiments can be implemented by adding necessary general-purpose hardware platforms with the aid of software. Of course, they can also be implemented using hardware, but in many cases, the former is a better implementation method. Based on this understanding, the technical solutions of the embodiments of this application, in essence or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) and includes several instructions to cause a terminal device (which may be a mobile phone, computer, server, or network device, etc.) to execute the methods described in the various embodiments of the embodiments of this application.

[0075] This application also provides a cellular communication cell wireless access system for implementing the above embodiments and preferred embodiments, and details already described will not be repeated. The term "module" as used below refers to a combination of software and / or hardware that performs a predetermined function. Although the apparatus described in the following embodiments is preferably implemented in software, hardware implementation, or a combination of software and hardware, is also possible and contemplated.

[0076] Figure 5 This is a structural block diagram of a cellular communication cell wireless access system according to an embodiment of this application, such as... Figure 5 As shown, the system includes:

[0077] The frequency sweep module 51 is used to obtain multiple first frequency points based on the frequency sweep operation and to sort the measurement values ​​of the multiple first frequency points in descending order.

[0078] Initialization module 52 is used to select multiple initialized frequency point groups;

[0079] Grouping module 53 is used to sequentially store the first frequency point corresponding to the measurement value into the corresponding frequency point group based on the measurement value in descending order, until all the first frequency points are stored or all frequency point groups are filled with first frequency points, so as to obtain the array of target frequency points; wherein, in each frequency point group, the first frequency point is sequentially placed from the least significant bit to the most significant bit.

[0080] The access module 54 is used to scan the target frequency points sequentially in ascending order of column number based on the array of target frequency points; wherein, in the nth column, the target frequency points are scanned sequentially in ascending order of row number. If the target frequency point is not scanned after scanning the nth column, the (n+1)th column is scanned until the target frequency point is scanned, so that the mobile terminal can access the target frequency point; wherein, n is a natural number.

[0081] In one implementation, in the array of target frequency points, each row corresponds to a frequency point group, and each column corresponds to the same position within multiple frequency point groups.

[0082] By adopting the above technical solution, the characteristics of the synchronization signal having limited bandwidth, only one true frequency point existing among several adjacent frequency points, and the true frequency point having the highest energy are utilized. The frequency scanning module 51 performs a frequency scanning operation to obtain multiple first frequency points and arranges the frequency points in descending order of their metric values ​​to highlight the priority of the real frequency points with the highest energy, laying the foundation for subsequent accurate screening. Then, the initialization module 52 selects multiple initialized frequency point groups to build a standardized carrier for frequency point classification and storage. Subsequently, the grouping module 53 stores the first frequency points sequentially into the corresponding frequency point groups in descending order of their metric values ​​(stored from low to high byte within the group) until all frequency points are stored or the frequency point groups are full, forming a target frequency point array. This grouping method further improves the access priority of real frequency points and avoids interference from false frequency points. Finally, the access module 54 scans the target frequency point array in ascending order of column number and ascending order of row number within the same column until the real target frequency point is located and access is completed. This scanning logic can quickly lock high-priority real frequency points, significantly reduce invalid detection of false frequency points, effectively solve the network access delay problem caused by mistaken access to false frequency points in traditional technologies, and ultimately improve the speed of mobile terminal access to cellular communication cells.

[0083] In one implementation, the grouping module 53 is further configured to:

[0084] Select frequency groups as target frequency groups in ascending order of frequency size;

[0085] Determine whether there is a frequency point in the target frequency point group to determine whether the target frequency point group is an empty frequency point group or a non-empty frequency point group; wherein, if the target frequency point group is an empty frequency point group, the first frequency point is sequentially placed in the target frequency point group from the least significant bit to the most significant bit.

[0086] In one embodiment, the grouping module 53 is further configured to: determine the distance between the first frequency point and the first frequency point in the target frequency point group when the target frequency point group is not an empty frequency point group, and determine the number of frequency points already existing in the target frequency point group; wherein, when the distance is within a threshold range and the number is less than the storage capacity of the target frequency point group, the first frequency point is sequentially placed in the target frequency point group from low to high bits.

[0087] In one implementation, the grouping module 53 is further configured to:

[0088] Determine whether all initialized frequency groups have been filled with the first frequency.

[0089] Determine whether all first frequency points have been traversed;

[0090] Given that all initialized frequency point groups have been filled with the first frequency points, and that all first frequency points have been traversed, the array based on the target frequency points is scanned sequentially in ascending order of column number.

[0091] In one implementation, the grouping module 53 is further configured to: continue traversing the next first frequency point if it is determined that there is an initialized frequency point group that has not been filled with the first frequency point.

[0092] In one implementation, the grouping module 53 is further configured to: continue traversing the next first frequency point if it is determined that not all first frequency points have been traversed.

[0093] The above process will be explained with examples below.

[0094] Figure 6 This is a flowchart of an example of a cellular communication cell wireless access method according to an embodiment of this application, such as... Figure 6 As shown:

[0095] First, place the multiple frequency points obtained from the frequency sweep into their corresponding frequency point groups and sort them:

[0096] Step 1: Sort the metrics representing the strength of frequency points in descending order to obtain the sorted metrics. and the corresponding frequency index ,in, Indicates the number of frequency points;

[0097] Step 2: Initialize M space frequency point groups: Each frequency group contains at most P frequency points; initialize the number of non-empty frequency groups: Initialize the number of existing frequency points in the M frequency point groups: Initialize the label of the first frequency point being processed: The first frequency point of each group Frequency point undermark ;

[0098] Step 3: Initialize j ;

[0099] Step 4: Determine if the j-th frequency group is empty (determine...) If it is empty, continue the judgment. ,like ,but After making a judgment Then proceed to step six. If the result is not empty, proceed to the next step.

[0100] Step 5: Determine the positional relationship between the current i-th frequency point and the first frequency point of the j-th frequency point group. If the distance between them is within the threshold range T, and the j-th frequency point group is not full ( If the distance exceeds the threshold range T, proceed to step six; otherwise, if the j-th frequency group is full, proceed to step seven.

[0101] Step 6: Sequentially place the current i-th frequency point into the j-th frequency point group, and Proceed to step nine;

[0102] Step 7: Determine if the j-th frequency group is the last group (determine...) (?), if yes, proceed to the next step; otherwise... And return to step four;

[0103] Step 8: Determine whether all frequency groups have been filled with the first frequency or whether all first frequency groups have been traversed. If yes, proceed to step 10; otherwise, proceed to step 9.

[0104] Step 9: (Iterate through the next first frequency point) and return to step three;

[0105] The next step is to confirm whether to access the cell:

[0106] Step 10: Initialize the label of the current frequency group and the label of the first frequency point in the current frequency group: j k ;

[0107] Step 11: Determine if the current j-th frequency group is empty. If it is not empty, proceed to the next step; otherwise, proceed to the next step. Then proceed to the next step;

[0108] Step 12: Determine whether the kth frequency point (target frequency point) exists in the current j-th frequency point group. If it exists, proceed to the next step; otherwise, proceed to step 15.

[0109] Step 13: Access the cell corresponding to the kth frequency point and proceed to the next step;

[0110] Step 14: Determine whether all frequency groups have been traversed or whether cell access has been successful. If yes, end the process; otherwise, proceed to Step 15.

[0111] Step 15: ,like ,but ,and Return to step eleven.

[0112] It should be noted that the above modules can be implemented by software or hardware. For the latter, they can be implemented in the following ways, but are not limited to: all the above modules are located in the same processor; or, the above modules are located in different processors in any combination.

[0113] This application also provides a computer-readable storage medium storing a computer program configured to execute the steps in any of the above method embodiments when running.

[0114] In one exemplary embodiment, the aforementioned computer-readable storage medium may include, but is not limited to, various media capable of storing computer programs, such as a USB flash drive, read-only memory (ROM), random access memory (RAM), portable hard disk, magnetic disk, or optical disk.

[0115] This application also provides an electronic device including a memory and a processor, wherein the memory stores a computer program and the processor is configured to run the computer program to perform the steps in any of the above method embodiments.

[0116] In one exemplary embodiment, the electronic device may further include a transmission device and an input / output device, wherein the transmission device is connected to the processor and the input / output device is connected to the processor.

[0117] This application also provides a computer program product, including a computer program that, when executed by a processor, implements the steps in any of the above method embodiments.

[0118] Specific examples in the embodiments of this application can be found in the examples described in the above embodiments and exemplary implementations, and will not be repeated here.

[0119] Obviously, those skilled in the art should understand that the modules or steps of the embodiments of this application described above can be implemented using general-purpose computing devices. They can be centralized on a single computing device or distributed across a network of multiple computing devices. They can be implemented using computer-executable program code, and thus can be stored in a storage device for execution by a computing device. In some cases, the steps shown or described can be performed in a different order than those presented here, or they can be fabricated as separate integrated circuit modules, or multiple modules or steps can be fabricated as a single integrated circuit module. Thus, the embodiments of this application are not limited to any particular combination of hardware and software.

[0120] The above description is merely a preferred embodiment of the present application and is not intended to limit the embodiments of the present application. For those skilled in the art, various modifications and variations can be made to the embodiments of the present application. Any modifications, equivalent substitutions, improvements, etc., made within the principles of the embodiments of the present application should be included within the protection scope of the embodiments of the present application.

Claims

1. A method for wireless access in a cellular communication cell, characterized in that, include: Multiple first frequency points are obtained based on the frequency sweep operation, and the metric values ​​of the multiple first frequency points are sorted in descending order; Select multiple initialized frequency point groups; Based on the metric values ​​in descending order, the first frequency points corresponding to the metric values ​​are stored into the corresponding frequency point groups in sequence until all the first frequency points are stored or all the frequency point groups are filled with the first frequency points, so as to obtain the array of target frequency points; wherein, in each frequency point group, the first frequency points are placed in sequence from the least significant bit to the most significant bit. The target frequency points are scanned sequentially in ascending order of column number based on the array of the target frequency points; wherein, in the nth column, the target frequency points are scanned sequentially in ascending order of row number. If the target frequency point is not scanned after scanning the nth column, the (n+1)th column is scanned until the target frequency point is scanned, so that the mobile terminal can access the target frequency point; wherein, n is a natural number.

2. The method according to claim 1, characterized in that, Based on the metric values ​​in descending order, the first frequency points corresponding to the metric values ​​are sequentially stored into the corresponding frequency point groups until all the first frequency points are stored or all the frequency point groups are filled with the first frequency points, to obtain an array of target frequency points, including: Select frequency groups as target frequency groups in ascending order of frequency size; Determine whether there is a frequency point in the target frequency point group to determine whether the target frequency point group is an empty frequency point group or a non-empty frequency point group; wherein, if the target frequency point group is an empty frequency point group, the first frequency point is sequentially placed in the target frequency point group from the least significant bit to the most significant bit.

3. The method according to claim 2, characterized in that, Determining whether a frequency point exists within the target frequency point group, to determine whether the target frequency point group is an empty frequency point group or a non-empty frequency point group, includes: When the target frequency group is not an empty frequency group, the distance between the first frequency point and the first frequency point in the target frequency group is determined, and the number of frequency points that already exist in the target frequency group is determined; wherein, when the distance is within a threshold range and the number is less than the storage capacity of the target frequency group, the first frequency point is sequentially placed in the target frequency group from low to high bits.

4. The method according to claim 3, characterized in that, After placing the first frequency point sequentially from least significant to most significant within the target frequency point group, the method further includes: Determine whether all the initialized frequency point groups have been filled with the first frequency point; Determine whether all first frequency points have been traversed; Once it is determined that all initialized frequency point groups have been filled with the first frequency points, and that all first frequency points have been traversed, the target frequency points are sequentially scanned based on the array of the target frequency points in ascending order of column number.

5. The method according to claim 3, characterized in that, Determine whether all the initialized frequency groups have been filled with the first frequency, including: If it is determined that there is an initialized frequency group that has not been filled with the first frequency, continue to traverse the next first frequency.

6. The method according to claim 3, characterized in that, Determine whether all first frequency points have been traversed, including: If it is determined that not all first frequency points have been traversed, continue traversing the next first frequency point.

7. The method according to claim 1, characterized in that, In the array of target frequency points, each row corresponds to a frequency point group, and each column corresponds to the same position within multiple frequency point groups.

8. A cellular communication cell wireless access system, characterized in that, include: The frequency sweep module is used to obtain multiple first frequency points based on the frequency sweep operation, and to sort the metric values ​​of the multiple first frequency points in descending order; The initialization module is used to select multiple initialized frequency point groups; The grouping module is used to sequentially store the first frequency points corresponding to the measurement values ​​into the corresponding frequency point groups based on the measurement values ​​in descending order, until all the first frequency points are stored or all the frequency point groups are filled with the first frequency points, so as to obtain an array of target frequency points; wherein, in each frequency point group, the first frequency points are sequentially placed from the least significant bit to the most significant bit. The access module is used to scan the target frequency points sequentially based on the array of target frequency points in ascending order of column number; wherein, in the nth column, the target frequency points are scanned sequentially in ascending order of row number, and if the target frequency point is not scanned after scanning the nth column, the (n+1)th column is scanned until the target frequency point is scanned, so that the mobile terminal can access the target frequency point; wherein, n is a natural number.

9. A computer-readable storage medium, characterized in that, The storage medium stores a computer program, wherein the computer program is executed by a processor to perform the method described in any one of claims 1 to 7.

10. An electronic device comprising a memory and a processor, characterized in that, The memory stores a computer program, and the processor is configured to run the computer program to perform the method of any one of claims 1 to 7.

11. A computer program product comprising computer instructions, characterized in that, When the computer instructions are executed by the processor, they implement the method of any one of claims 1 to 7.

Images