Automatic planning method and system for RACH root sequence of 6G cell

Abstract

The invention discloses a 6G cell RACH root sequence automatic planning method and a 6G cell RACH root sequence automatic planning system, belongs to the technical field of mobile communication network planning, and aims to solve the technical problems that the success rate of cell random access is reduced, access delay is increased, signaling retransmission is increased, the network performance is influenced, and the network performance is influenced due to unreasonable planning of RACH root sequences in early-stage base station opening deployment. The adopted technical scheme is as follows: information acquisition and calculation: acquiring information of all base stations or cells in a region where a base station to be deployed is located and detailed information of the base station or cell to be deployed, and calculating distances to all base stations or cells in the region where the base station to be deployed is located according to the detailed information of the base station or cell to be deployed; and sequence selection: according to all specified RACH root sequences and the planning of an operator on the RACH root sequences, customizing and selecting an optimal sequence of the RACH root sequences.

Description

Technical Field

[0001] The present invention relates to the technical field of mobile communication network planning, and specifically to a method and system for automatically planning 6G cell RACH root sequences. Background Art

[0002] In a wireless communication system, as the core channel for the initial access of a UE, the preamble of RACH is generated by a ZC sequence, and the allocation of the sequence index (Root Index) directly affects the random access performance of the network. According to the 3GPP TS 38.211 specification, the long preamble (NZC = 839) and the short preamble (NZC = 139) respectively correspond to 838 and 138 available root sequences. With the popularization of ultra-dense networking (UDN), the cell density has increased exponentially, and the limited root sequence resources face the following challenges:

[0003] ① Root sequence reuse conflict: Due to geographical coverage overlap or frequency point reuse between adjacent cells, the same root sequence is repeatedly allocated, resulting in phase ambiguity of UE access requests.

[0004] ② Zero-correlation zone (ZCZ) failure: In an environment with high multipath delay spread, when the cyclic shift interval is insufficient, the cross-correlation of the preambles increases, reducing the success rate of base station detection.

[0005] ③ Network planning complexity: Traditional manual planning relies on empirical rules, which are difficult to cope with dynamic topology changes, and has defects such as a long planning cycle and high operation and maintenance costs.

[0006] Existing technical solutions mainly adopt a passive optimization mode of "deployment - detection - adjustment", and its limitations are: Lag: Conflict detection needs to be implemented after the base station goes online, and it is impossible to preventively avoid interference;

[0007] ① Local optimum: The adjustment of the root sequence based on the perspective of a single cell lacks global resource coordination;

[0008] ③ Rigid rules: The operator-defined frequency isolation strategy (N + 4 or N + 8 rule) is not fully integrated. Summary of the Invention

[0009] The technical task of the present invention is to provide a method and system for automatically planning 6G cell RACH root sequences to solve the problem that the unreasonable planning of RACH root sequences in the early stage of base station commissioning deployment leads to a decrease in the success rate of cell random access, an increase in access delay, and an increase in signaling retransmission, thereby affecting network performance.

[0010] The technical task of the present invention is achieved in the following manner. A method for automatic planning of 6G cell RACH root sequences is as follows:

[0011] Information collection and calculation: Collect information of all base stations or cells in the area where the base station to be deployed is located, as well as detailed information of the base station or cell to be deployed, and calculate the distances to all base stations or cells in the area where the base station to be deployed is located according to the detailed information of the base station or cell to be deployed;

[0012] Sequential selection: Customize the preferred order of selecting RACH root sequences according to all specified RACH root sequences and the operator's planning of RACH root sequences.

[0013] Preferably, the information collection and calculation are as follows:

[0014] Obtain the frequencies, longitude and latitude, and azimuth angles of the antennas of all base stations or cells in the area where the base station to be deployed is located, and save them in data table A;

[0015] Collect the frequencies, longitude and latitude, azimuth angles, and neighboring cell ranges of the base station or cell to be deployed, and save them in data table B;

[0016] Calculate the distances to all obtained cells respectively according to the longitude and latitude and azimuth angles of the base station or cell to be deployed, and save them in data table A;

[0017] Plan data table C, which is used to record all specified RACH root sequences, that is, from 0 to the MAX maximum value; among them, there are 838 long preambles and 138 short preambles;

[0018] Plan data table D, which is used to record the operator's planning of RACH root sequences, that is, the RACH root sequence usage rules.

[0019] More preferably, the sequential selection is as follows:

[0020] Give priority to using the RACH root sequences that are not used for the frequencies corresponding to the planned cells;

[0021] Secondly, select the RACH root sequences that are farthest from the planned cells.

[0022] More preferably, the priority of using the RACH root sequences that are not used for the frequencies corresponding to the planned cells is as follows:

[0023] Find the RACH root sequences corresponding to all equal frequencies in data table A for the frequencies, take the non-union of the RACH root sequences corresponding to the equal frequencies and record them in data table C;

[0024] Based on the frequency points or longitude and latitude of the base station or cell to be planned in Data Table B, combined with Data Table D, calculate the RACH root sequence rule defined by the operator for the location of the corresponding cell and record it;

[0025] Take the intersection of the RACH root sequence corresponding to the equal frequency points, the result of taking the complement in Data Table C, and the result of the RACH root sequence rule defined by the operator for the location of the corresponding cell, and determine whether the intersection is empty:

[0026] If the intersection is not empty, record and return the output result;

[0027] If the intersection is empty, select the RACH root sequence that is farthest from the planned cell.

[0028] Preferably, secondly, the specific method for selecting the RACH root sequence that is farthest from the planned cell is as follows:

[0029] Find the RACH root sequences corresponding to all equal frequency points in the frequency points of Data Table A and record the RACH root sequences corresponding to all equal frequency points;

[0030] Based on the frequency points or longitude and latitude of the base station or cell to be deployed in Data Table B, combined with Data Table D, calculate the RACH root sequence rule defined by the operator for the location of the corresponding cell and record it;

[0031] Take the intersection of the results of the RACH root sequences corresponding to all equal frequency points and the result of the RACH root sequence rule defined by the operator for the location of the corresponding cell, and sort the intersection in descending order according to the distance saved in Data Table A and record it;

[0032] Find the RACH root sequences corresponding to the range of neighboring cells specified in Data Table B and output the results according to the sorted results of the intersection in descending order according to the distance saved in Data Table A.

[0033] A 6G cell RACH root sequence automatic planning system, the system includes:

[0034] An information collection and calculation unit, used to collect information on all base stations or cells in the area where the base station to be deployed is located and detailed information on the base station or cell to be deployed, and calculate the distances from the base station or cell to be deployed to all base stations or cells in the area where the base station to be deployed is located according to the detailed information on the base station or cell to be deployed;

[0035] A sequential selection unit, used to customize the preferred order of selecting RACH root sequences according to all specified RACH root sequences and the operator's planning of RACH root sequences.

[0036] Preferably, the information collection and calculation unit includes:

[0037] An information acquisition sub-module, which is used to acquire the frequency points, longitude and latitude, and azimuth angles of antennas of all base stations or cells in the area where the base station to be deployed is located, and save them into data table A;

[0038] An information collection sub-module, which is used to collect the frequency points, longitude and latitude, azimuth angles, and neighboring cell ranges of the base station or cell to be deployed, and save them into data table B;

[0039] A distance calculation sub-module, which is used to calculate the distances from the longitude and latitude and azimuth angles of the base station or cell to be deployed to all the acquired cells respectively, and save them into data table A; where, when the base station or cell is deployed, the longitude and latitude and azimuth angles of the corresponding cell will be specified, and the longitude and latitude and azimuth angles of all the already operating cells in the corresponding area will be saved. The distances between the corresponding cell and other cells can be calculated based on the longitude and latitude and azimuth angles;

[0040] Planning module 1, which is used to plan data table C. Data table C is used to record all the specified RACH root sequences, that is, from 0 to the MAX maximum value; among them, there are 838 long preambles and 138 short preambles;

[0041] Planning module 2, which is used to plan data table D. Data table D is used to record the operator's planning of the RACH root sequences, that is, the RACH root sequence usage rules.

[0042] Preferably, the sequential selection unit preferentially uses the RACH root sequences that are not used for the frequency points corresponding to the planned cell, and secondly selects the RACH root sequences that are farthest from the planned cell.

[0043] More preferably, the preferential use of the RACH root sequences that are not used for the frequency points corresponding to the planned cell is as follows:

[0044] Find the RACH root sequences corresponding to all equal frequency points in the frequency points of data table A in data table B, take the non-operation of the RACH root sequences corresponding to the equal frequency points and the data in data table C and record them;

[0045] Calculate and record the RACH root sequence rules customized by the operator according to the frequency points or longitude and latitude of the base station or cell to be planned in data table B in combination with data table D;

[0046] Take the intersection of the result of taking the non-operation of the RACH root sequences corresponding to the equal frequency points and data table C and the result of the RACH root sequence rules customized by the operator where the corresponding cell is located, and judge whether the intersection is empty:

[0047] If the intersection is not empty, record and return the output result;

[0048] If the intersection is empty, select the RACH root sequence that is farthest from the planned cell.

[0049] Preferably, the RACH root sequence farthest from the planned cell is selected next, as follows:

[0050] Find the RACH root sequences corresponding to all equal frequency points in data table B in the frequency points of data table A (interference only exists when the frequencies are the same), and record the RACH root sequences corresponding to all equal frequency points;

[0051] Calculate the location of the corresponding cell according to the frequency points or longitude and latitude of the base station or cell to be deployed in data table B in combination with data table D, which is in line with the operator's custom RACH root sequence rule (in some places, it is stipulated that the root sequences of adjacent cells should have a minimum interval of 4, and in some places, it is stipulated that the adjacent cells should have a minimum interval of 8. From the protocol perspective, as long as they are different, interference can be avoided), and record it;

[0052] Take the intersection of the results of all RACH root sequences corresponding to equal frequency points and the results of the operator's custom RACH root sequence rule where the corresponding cell is located, and sort the intersection in descending order according to the distance saved in data table A and record it;

[0053] Find the RACH root sequences greater than the corresponding RACH root sequences within the neighbor cell range specified in data table B according to the results sorted in descending order of the distance saved in data table A in the intersection, and output the results.

[0054] The 6G cell RACH root sequence automatic planning method and system of the present invention have the following advantages:

[0055] (1) The present invention can automatically plan the available RACH root sequences, and the planned RACH root sequences effectively reduce the problem of communication quality degradation caused by RACH root sequence conflicts;

[0056] (2) The RACH root sequences planned by the present invention can meet the actual wireless network deployment, reducing network performance problems such as reduced random access success rate and increased access delay caused by unreasonable planning of RACH root sequences during the early base station opening and deployment;

[0057] (3) Through joint spatial and frequency domain optimization, the present invention greatly reduces the probability of root sequence conflicts;

[0058] (4) The present invention improves the access performance: The simulation results show that the random access success rate (RSR) is increased by 12% - 18%, and the average access delay is reduced by 35%;

[0059] (5) The present invention supports dynamic topology changes (such as mobile base stations or temporary sites), with a distribution delay of less than 500 ms, enhancing the network's self - adaptability;

[0060] (6) The present invention fully complies with the normative requirements for preamble formats in Section 7.3 of 3GPP TS 38.213, achieving standardized compatibility;

[0061] (7) The method of the present invention is applicable to cell deployment in a massive multiple-input multiple-output (Massive MIMO) scenario, solving problems such as co-frequency interference, preamble collision, and random access channel congestion caused by Zadoff-Chu (ZC) sequence reuse, and meeting the stringent requirements for ultra-reliable low-latency communication (URLLC) in 3GPP Release 16 and subsequent versions;

[0062] (8) By integrating multi-dimensional spatial parameters of the cell to be deployed (including geographical longitude and latitude, antenna radiation direction angle, frequency band resource allocation, and neighboring cell coverage range) with the RACH root sequence reuse strategy defined by the operator, and combining a distributed database and a spatial clustering algorithm, the present invention realizes the intelligent allocation of root sequences; the present invention completes the global optimization of root sequences before base station deployment, effectively avoiding problems such as random access failure of user equipment (UE) caused by sequence conflicts, preamble confusion, and network signaling storms, and significantly improving network planning efficiency and communication reliability; the technical advantages of the present invention are as follows:

[0063] ① A multi-dimensional conflict avoidance mechanism based on the coupling degree of base station (cell) longitude and latitude and frequency points;

[0064] ② A root sequence priority allocation algorithm that supports dynamic neighboring cell interference suppression;

[0065] ③ Standardized root sequence mapping normalization requirements compatible with the 3GPP TS 38.211 protocol. Description of the Drawings

[0066] The present invention will be further described below with reference to the accompanying drawings.

[0067] Appendix Figure 1 is a flowchart of the automatic planning method for the RACH root sequence of a 6G cell. Detailed Embodiments

[0068] The automatic planning method and system for the RACH root sequence of a 6G cell of the present invention will be described in detail below with reference to the accompanying drawings of the specification and specific embodiments.

[0069] Embodiment 1:

[0070] As shown in the appendix Figure 1 This embodiment provides an automatic planning method for the RACH root sequence of a 6G cell, and the method is as follows:

[0071] S1. Information collection and calculation: Collect information of all base stations or cells in the area where the base station to be deployed is located, as well as detailed information of the base station or cell to be deployed, and calculate the distances from the base station or cell to be deployed to all base stations or cells in the area according to the detailed information of the base station or cell to be deployed;

[0072] S2. Sequential selection: Customize the preferred order of selecting RACH root sequences according to all specified RACH root sequences and the operator's planning of RACH root sequences.

[0073] The information collection and calculation in step S1 of this embodiment are specifically as follows:

[0074] S101. Obtain the frequencies, longitude and latitude, and antenna direction angles of all base stations or cells in the area where the base station to be deployed is located, and save them in data table A;

[0075] S102. Collect the frequencies, longitude and latitude, direction angles, and neighbor cell ranges of the base station or cell to be deployed, and save them in data table B;

[0076] S103. Calculate the distances from the longitude and latitude and direction angles of the base station or cell to be deployed to all the obtained cells respectively, and save them in data table A; where, when the base station or cell is deployed, the longitude and latitude and direction angles of the corresponding cell are specified, and the longitude and latitude and direction angles of all the already operating cells in the corresponding area are saved. The distances between the corresponding cells and other cells can be calculated according to the longitude and latitude and direction angles;

[0077] S104. Plan data table C, which is used to record all specified RACH root sequences, that is, from 0 to the MAX maximum value; among them, there are 838 long preambles and 138 short preambles;

[0078] S105. Plan data table D, which is used to record the operator's planning of RACH root sequences, that is, the RACH root sequence usage rules.

[0079] The sequential selection in step S2 of this embodiment is specifically as follows:

[0080] S201. Give priority to using the RACH root sequences that are not used for the frequencies corresponding to the planned cells;

[0081] S202. Secondly, select the RACH root sequence that is farthest from the planned cell.

[0082] The priority to use the RACH root sequences that are not used for the frequencies corresponding to the planned cells in step S201 of this embodiment is specifically as follows:

[0083] S20101. In the frequencies in data table A, find the RACH root sequences corresponding to all equal frequencies in data table B, take the non-union of the RACH root sequences corresponding to the equal frequencies and record them in data table C;

[0084] S20102. Calculate the RACH root sequence rule defined by the operator for the location of the corresponding cell according to the frequency points or longitude and latitude of the base station or cell to be planned in Data Table B in combination with Data Table D, and record it;

[0085] S20103. Take the intersection of the results in step S20101 and the results in step S20102, and determine whether the intersection is empty:

[0086] ① If the intersection is not empty, record and return the output result;

[0087] ② If the intersection is empty, execute step S202.

[0088] In step S202 of this embodiment, the RACH root sequence that is farthest from the planned cell is selected as follows:

[0089] S20201. Find the RACH root sequences corresponding to all equal frequency points (interference only exists when the frequencies are the same) in Data Table A for the frequency points in Data Table B, and record the RACH root sequences corresponding to all equal frequency points;

[0090] S20202. Calculate the RACH root sequence rule defined by the operator for the location of the corresponding cell according to the frequency points or longitude and latitude of the base station or cell to be deployed in Data Table B in combination with Data Table D (in some places, it is stipulated that the root sequences of adjacent cells should have a minimum interval of 4, and in some places, it is stipulated that the adjacent cells should have a minimum interval of 8. From the perspective of the protocol, as long as they are different, interference can be avoided), and record it;

[0091] S20203. Take the intersection of the results in step S20201 and the results in step S20202, sort the intersection in descending order according to the distances saved in Data Table A, and record it;

[0092] S20204. Find the RACH root sequences greater than the corresponding RACH root sequences in the adjacent cell range specified in Data Table B according to the results in step S20203, and output the results.

[0093] Embodiment 2:

[0094] This embodiment provides a 6G cell RACH root sequence automatic planning system, which includes:

[0095] An information collection and calculation unit, configured to collect information of all base stations or cells in the area where the base station to be deployed is located and detailed information of the base station or cell to be deployed, and calculate the distances from the base station or cell to be deployed to all base stations or cells in the area where the base station to be deployed is located according to the detailed information of the base station or cell to be deployed;

[0096] A sequential selection unit for customizing and selecting the preferred order of RACH root sequences according to all specified RACH root sequences and the operator's planning of RACH root sequences.

[0097] The information collection and calculation unit in this embodiment includes:

[0098] An information acquisition sub-module for acquiring the frequency points, longitude and latitude, and antenna azimuth angles of all base stations or cells in the area where the base station to be deployed is located, and saving them into data table A;

[0099] An information collection sub-module for collecting the frequency points, longitude and latitude, azimuth angles, and neighboring cell ranges of the base station or cell to be deployed, and saving them into data table B;

[0100] A distance calculation sub-module for calculating the distances from the longitude and latitude and azimuth angles of the base station or cell to be deployed to all the acquired cells respectively, and saving them into data table A; wherein, when the base station or cell is deployed, the longitude and latitude and azimuth angles of the corresponding cell are specified, and the longitude and latitude and azimuth angles of all the already operating cells in the corresponding area are saved, and the distances between the corresponding cell and other cells can be calculated according to the longitude and latitude and azimuth angles.

[0101] A planning module 1 for planning data table C, which is used to record all specified RACH root sequences, that is, from 0 to the MAX maximum value; among them, there are 838 long preambles and 138 short preambles.

[0102] A planning module 2 for planning data table D, which is used to record the operator's planning of RACH root sequences, that is, the RACH root sequence usage rules.

[0103] In this embodiment, the sequential selection unit preferentially uses the RACH root sequences not used by the frequency points corresponding to the planned cell, and then selects the RACH root sequence farthest from the planned cell.

[0104] The specific method of preferentially using the RACH root sequences not used by the frequency points corresponding to the planned cell in this embodiment is as follows:

[0105] (1) Find the RACH root sequences corresponding to all equal frequency points in data table B in the frequency points of data table A, take the non-union of the RACH root sequences corresponding to the equal frequency points and record them in data table C;

[0106] (2) Calculate and record the position of the corresponding cell in the RACH root sequence rule customized by the operator according to the frequency point or longitude and latitude of the base station or cell to be planned in data table B in combination with data table D;

[0107] (3) Take the intersection of the RACH root sequences corresponding to equal frequency points, the result of taking the complement in data table C, and the result of the RACH root sequence rule customized by the operator for the location of the corresponding cell, and determine whether the intersection is empty:

[0108] If the intersection is not empty, record and return the output result;

[0109] If the intersection is empty, select the RACH root sequence that is farthest from the planned cell.

[0110] In this embodiment, the specific method of selecting the RACH root sequence that is farthest from the planned cell is as follows:

[0111] ① Find the RACH root sequences corresponding to all equal frequency points in data table A that are equal to the frequency points in data table B (interference only exists when the frequencies are the same), and record the RACH root sequences corresponding to all equal frequency points;

[0112] ② Calculate the location of the corresponding cell in the RACH root sequence rule customized by the operator based on the frequency points or longitude and latitude of the base station or cell to be deployed in data table B combined with data table D (in some places, it is stipulated that the root sequences of adjacent cells should have a minimum interval of 4, and in some places, it is stipulated that the adjacent cells should have a minimum interval of 8. From the perspective of the protocol, as long as they are different, interference can be avoided), and record it;

[0113] ③ Take the intersection of the results of the RACH root sequences corresponding to all equal frequency points and the results of the RACH root sequence rule customized by the operator for the location of the corresponding cell, and sort the intersection in descending order according to the distance saved in data table A and record it;

[0114] ④ Find the RACH root sequences that are greater than the corresponding RACH root sequences in the adjacent cell range specified in data table B according to the results of sorting the intersection in descending order according to the distance saved in data table A, and output the results.

[0115] In this embodiment, by integrating the multi-dimensional space parameters of the cell to be deployed (including geographical longitude and latitude, antenna radiation direction angle, frequency band resource allocation, and adjacent cell coverage range) with the RACH root sequence reuse strategy customized by the operator, combined with the distributed database and the spatial clustering algorithm, the intelligent allocation of the root sequence is realized.

[0116] Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present invention, and are not intended to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: they can still modify the technical solutions recorded in the foregoing embodiments, or perform equivalent replacements on some or all of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the scope of the technical solutions of the embodiments of the present invention.

Claims

1. A 6G cell RACH root sequence automatic planning method, characterized in that: The method is as follows: Information collection and calculation: collect information of all base stations or cells in the area where the base station to be deployed is located and detailed information of the base station or cell to be deployed, and calculate the distance to all base stations or cells in the area where the base station to be deployed is located based on the detailed information of the base station or cell to be deployed; Sequence selection: Customize the preferred order of RACH root sequences based on all specified RACH root sequences and the operator's planning of RACH root sequences.

2. The 6G cell RACH root sequence automatic planning method according to claim 1, characterized in that: The details of information collection and calculation are as follows: Obtain the frequency points, longitude and latitude, and antenna direction angles of all base stations or cells in the area where the base station to be deployed is located, and save them in data table A; Collect the frequency, longitude and latitude, direction angle and neighboring area range of the base station or cell to be deployed, and save them in data table B; Calculate the distances to all acquired cells according to the latitude, longitude and direction angle of the base station or cell to be deployed, and save them in data table A; Planning data table C, data table C is used to record all specified RACH root sequences, i.e., 0 to MAX maximum values; among them, there are 838 for long preamble codes and 138 for short preamble codes; Planning data table D, data table D is used to record the operator's planning of the RACH root sequence, that is, the RACH root sequence usage rules.

3. The 6G cell RACH root sequence automatic planning method according to claim 1 or 2, characterized in that: The order of selection is as follows: Prioritize the use of unused RACH root sequences at the corresponding frequency points in the planned cells; Secondly, select the RACH root sequence that is farthest from the planned cell.

4. The 6G cell RACH root sequence automatic planning method according to claim 3 is characterized in that: The unused RACH root sequences of the corresponding frequency points of the planned cells are given priority as follows: Find the RACH root sequence corresponding to all the equal frequency points in data table B at the frequency point in data table A, negate the RACH root sequence corresponding to the equal frequency point with that in data table C and record them; According to the frequency point or longitude and latitude of the base station or cell to be planned in data table B, combined with data table D, the RACH root sequence rule customized by the operator at the location of the corresponding cell is calculated and recorded; Take the intersection of the RACH root sequence corresponding to the equal frequency point and the result of negating the result in data table C and the result of the RACH root sequence rule customized by the operator where the corresponding cell is located, and determine whether the intersection is empty: If the intersection is not empty, record and return the output result; If the intersection is empty, the RACH root sequence farthest from the planned cell is selected.

5. The 6G cell RACH root sequence automatic planning method according to claim 4, characterized in that: Next, select the RACH root sequence farthest from the planned cell as follows: Find the RACH root sequences corresponding to all the equal frequency points in data table B at the frequency point in data table A and record the RACH root sequences corresponding to all the equal frequency points; According to the frequency or longitude and latitude of the base station or cell to be deployed in data table B, combined with data table D, the operator-defined RACH root sequence rule of the corresponding cell location is calculated and recorded; The intersection of the results of the RACH root sequence corresponding to all equal frequency points and the results of the RACH root sequence rule customized by the operator at the corresponding cell location is taken, and the intersection is arranged in descending order according to the distance saved in data table A and recorded; According to the result of the intersection being arranged in descending order according to the distance stored in data table A, the RACH root sequence corresponding to the neighboring cell range greater than that specified in data table B is found and the result is output.

6. A 6G cell RACH root sequence automatic planning system, characterized in that: The system includes: An information collection and calculation unit, used to collect information of all base stations or cells in the area where the base station to be deployed is located and detailed information of the base station or cell to be deployed, and calculate the distance to all base stations or cells in the area where the base station to be deployed is located based on the detailed information of the base station or cell to be deployed; The sequence selection unit is used to customize the preferred sequence of selecting the RACH root sequence according to all specified RACH root sequences and the operator's plan for the RACH root sequence.

7. The 6G cell RACH root sequence automatic planning system according to claim 6, characterized in that: The information collection and calculation unit includes: The information acquisition submodule is used to obtain the frequency points, longitude and latitude of all base stations or cells in the area where the base station to be deployed is located, and the direction angles of the antennas, and save them in the data table A; The information collection submodule is used to collect the frequency, longitude and latitude, direction angle and neighboring area range of the base station or cell to be deployed, and save them in data table B; The distance calculation submodule is used to calculate the distances to all acquired cells according to the latitude, longitude and direction angle of the base station or cell to be deployed, and save them in the data table A; Planning module 1 is used to plan data table C, which is used to record all specified RACH root sequences, i.e., 0 to MAX maximum values; among them, there are 838 for long preamble codes and 138 for short preamble codes; The planning module 2 is used to plan the data table D, and the data table D is used to record the operator's planning of the RACH root sequence, that is, the RACH root sequence usage rules.

8. The 6G cell RACH root sequence automatic planning system according to claim 6, characterized in that: The sequential selection unit preferentially uses the unused RACH root sequence of the corresponding frequency point of the planned cell, and secondly selects the RACH root sequence farthest from the planned cell.

9. The 6G cell RACH root sequence automatic planning system according to claim 8, characterized in that: The unused RACH root sequences of the corresponding frequency points of the planned cells are given priority as follows: Find the RACH root sequence corresponding to all the equal frequency points in data table B at the frequency point in data table A, negate the RACH root sequence corresponding to the equal frequency point with that in data table C and record them; According to the frequency point or longitude and latitude of the base station or cell to be planned in data table B, combined with data table D, the RACH root sequence rule customized by the operator at the location of the corresponding cell is calculated and recorded; Take the intersection of the RACH root sequence corresponding to the equal frequency point and the result of negating the result in data table C and the result of the RACH root sequence rule customized by the operator where the corresponding cell is located, and determine whether the intersection is empty: If the intersection is not empty, record and return the output result; If the intersection is empty, the RACH root sequence farthest from the planned cell is selected.

10. The 6G cell RACH root sequence automatic planning system according to claim 8, characterized in that: Next, select the RACH root sequence farthest from the planned cell as follows: Find the RACH root sequences corresponding to all the equal frequency points in data table B at the frequency point in data table A and record the RACH root sequences corresponding to all the equal frequency points; According to the frequency or longitude and latitude of the base station or cell to be deployed in data table B, combined with data table D, the operator-defined RACH root sequence rule of the corresponding cell location is calculated and recorded; The intersection of the results of the RACH root sequence corresponding to all equal frequency points and the results of the RACH root sequence rule customized by the operator at the corresponding cell location is taken, and the intersection is arranged in descending order according to the distance saved in data table A and recorded; According to the result of the intersection being arranged in descending order according to the distance stored in data table A, the RACH root sequence corresponding to the neighboring cell range greater than that specified in data table B is found and the result is output.

Images