CN113038586B

CN113038586B - Configuration method of synchronous signal block and electronic equipment

Info

Publication number: CN113038586B
Application number: CN201911360598.4A
Authority: CN
Inventors: 李铁钧; 刘献玲; 王斐
Original assignee: Shanghai Datang Mobile Communications Equipment Co ltd
Current assignee: Shanghai Datang Mobile Communications Equipment Co ltd
Priority date: 2019-12-25
Filing date: 2019-12-25
Publication date: 2023-04-11
Anticipated expiration: 2039-12-25
Also published as: CN113038586A

Abstract

The embodiment of the invention provides a configuration method of a synchronous signal block and electronic equipment, wherein the configuration method comprises the following steps: acquiring network planning parameters, wherein the network planning parameters comprise the number of beams actually sent by a cell synchronization signal block SSB, a Physical Random Access Channel (PRACH) period, the number of random access opportunities (RO) in the PRACH period and the longest waiting time for a terminal to initiate one random access; and determining the SSB number corresponding to the RO according to the network planning parameters. The embodiment of the invention realizes the mapping between the SSB and the RO.

Description

Configuration method of synchronous signal block and electronic equipment

Technical Field

The present invention relates to the field of communications technologies, and in particular, to a method for configuring a synchronization signal block and an electronic device.

Background

A Random Access Channel (RACH) in the 5G system is the same as LTE, and is used for initially accessing or applying for uplink resources, but the 5G system provides more functions and functions to the RACH, for example: each SSB is mapped with a certain set of specific random access occasions (RACH occupancy, RO) according to a certain rule, and through the mapping, the terminal can select an RO resource corresponding to the SSB with the strongest beam when transmitting a Preamble, so that the base station learns the best SSB beam received by the terminal through random access.

However, how to map SSBs and ROs and available preambles on each SSB are newly introduced features in the 5G system, and RACH parameter configuration and Preamble planning in the current 4G system cannot solve the problem.

Disclosure of Invention

The embodiment of the invention provides a configuration method of a synchronous signal block and electronic equipment, which are used for realizing mapping between an SSB (synchronization service bus) and an RO (reverse osmosis).

The embodiment of the invention provides a method for configuring a synchronous signal block, which comprises the following steps:

acquiring network planning parameters, wherein the network planning parameters comprise the number of beams actually sent by a cell synchronization signal block SSB, a Physical Random Access Channel (PRACH) period, the number of random access opportunities (RO) in the PRACH period and the longest waiting time for a terminal to initiate one random access;

and determining the SSB number corresponding to the RO according to the network planning parameters.

The embodiment of the invention provides a configuration device of a synchronous signal block, which comprises:

the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring network planning parameters, and the network planning parameters comprise the beam number actually sent by a cell synchronization signal block SSB, a Physical Random Access Channel (PRACH) period, the number of random access opportunities (RO) in the PRACH period and the longest waiting time for a terminal to initiate one random access;

and the first determining module is used for determining the SSB number corresponding to the RO according to the network planning parameter.

The embodiment of the invention provides electronic equipment, which comprises a memory, a processor and a computer program which is stored on the memory and can run on the processor, wherein the processor realizes the steps of the configuration method of a synchronous signal block when executing the program.

An embodiment of the present invention provides a non-transitory computer readable storage medium, on which a computer program is stored, and the computer program, when executed by a processor, implements the steps of the method for configuring a synchronization signal block.

The configuration method of the synchronization signal block and the electronic device provided by the embodiment of the invention can obtain the mapping of each RO and the SSB number based on a coverage scene, a user access frequency and a user access receptivity by acquiring the network planning parameters and determining the SSB number corresponding to the RO based on the network planning parameters, wherein the network planning parameters comprise the beam number actually sent by the cell SSB, the PRACH period, the number of the ROs in the PRACH period and the longest waiting time for the terminal to initiate one random access, so that the terminal can select the RO resource corresponding to the SSB with the strongest beam when transmitting the preamble through the mapping, and the base station can know the best SSB beam received by the terminal through the random access.

Drawings

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and those skilled in the art can also obtain other drawings according to the drawings without creative efforts.

FIG. 1-1 is a diagram illustrating a mapping relationship between SSB and RO in the prior art;

FIG. 1-2 is a second diagram illustrating the mapping relationship between SSB and RO in the prior art;

FIGS. 1-3 are third diagrams illustrating SSB and RO mapping relationships in the prior art;

FIG. 2 is a flowchart illustrating steps of a method for configuring a synchronization signal block according to an embodiment of the present invention;

FIG. 3 is a flowchart illustrating steps of determining the number of SSBs corresponding to the RO according to the network planning parameters in the embodiment of the present invention;

FIG. 4-1 is a schematic diagram of preamble sequence division when the number of SSBs corresponding to the determined RO is less than or equal to 1 in the embodiment of the present invention;

fig. 4-2 is a schematic diagram of preamble sequence division when the number of SSBs corresponding to the determined RO is greater than 1 in the embodiment of the present invention;

FIGS. 4-3 are schematic diagrams illustrating preamble sequence partitioning according to an embodiment of the present invention;

FIGS. 4-4 are schematic diagrams illustrating the division of preamble sequences according to a second embodiment of the present invention;

FIG. 5 is a block diagram of an apparatus for configuring a synchronization signal block according to an embodiment of the present invention;

fig. 6 is a schematic structural diagram of an electronic device in an embodiment of the invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

In order to match the coverage capability of a data channel and solve the difficulty of vertical coverage, a dynamic narrow beam technology of the broadcast channel is introduced into NR, and the whole cell is covered by adopting a scanning mode, at this time, taking 8 beams as an example, beam 0 refers to SSB0, beam 1 refers to SSB1, and so on, beams SS0 to SSB1 are transmitted on Slot 0, beams SS2 to SSB3 are transmitted on Slot 1, beams SS4 to SSB5 are transmitted on Slot 2, and beams SS6 to SSB7 are transmitted on Slot 3. The 5G SSB narrow beam breaks through the bottleneck of the conventional coverage, and compared with the conventional wide beam coverage, the NR narrow beam coverage performance is further improved, and compared with the LTE Cell Reference Signal (CRS), the coverage of 9dB can be theoretically increased, which is undoubtedly a huge gain of the 5G coverage.

However, a new problem is introduced in the dynamic scanning of the SSB, and the SSB has multiple transmission opportunities in a time domain period and has corresponding numbers, which can respectively correspond to different beams; for the terminal, the terminal has an opportunity to transmit the preamble only when the beam scanning signal of the SSB covers the terminal. When the network receives the preamble of the terminal, it knows the downlink best beam, that is, it knows which wave velocity points to the terminal, so the SSB needs to have a mapping with the preamble, and the preamble can be sent only at the RO, which needs the SSB and the RO to map.

In the 5G system, when the corresponding SSB number (SSB-per-rach-event) on each RO and the number of Contention Based preambles (SSB, n) on each SSB are determined, it may be determined that the mapping relationship between the SSB and the RO is as shown in fig. 1-1, fig. 1-2, and fig. 1-3, respectively. In FIG. 1-1, when SSB-per-rach-event is 1/8,n is 56, one SSB maps to 8 ROs, each of which has a contention-based preamble (CB preamble) of 0-55; in FIG. 1-2, when SSB-per-rach-occusion is 1,n is 56, one SSB maps to 1 RO, and CB preambles on each RO are 0-55, respectively; in FIGS. 1-3, when SSB-per-rach-occasion is 2,n is 28, two SSBs are mapped to 1 RO, and CB preambles corresponding to SSB0-SSB1 and SSB2-SSB3 are 0-27 and 30-57, respectively. It can be seen from the above that SSB-per-RACH-occast and n determine the actual mapping relationship between SSB and RO, and these two parameters correspond to parameters SSB-perRACH-occupancy and CB-preambles Perssb of RACH in the protocol; in addition, for SSB-per-rach-occasion < =1, the Preamble corresponding to each SSB is relatively simple, and the range of available CB preambles on each SSB is completely the same, but when SSB-per-rach-occasion > 1, the available CB preambles on each SSB mapping the same RO are completely different.

Based on the configuration method of SSB-per-RACH-occasion and n (how SSB and RACH are mapped) and how Preamble available on each SSB is divided, RACH parameter configuration and Preamble division in the current 4G system are not involved, so that the problem cannot be solved. To this end, the present invention proposes the following embodiments to implement the mapping of SSB and RO.

As shown in fig. 2, which is a flowchart illustrating steps of a method for configuring a synchronization signal block according to an embodiment of the present invention, the mapping method includes the following steps:

step 201: and acquiring network planning parameters.

In this step, specifically, when configuring the SSB, the network planning parameters need to be obtained first.

Specifically, the network planning parameter may be obtained based on a cell coverage scenario and user experience, and may include a beam number actually sent by a cell SSB, a Physical Random Access Channel (PRACH) period, a number of ROs in the PRACH period, and a longest waiting time for a terminal to initiate a random access.

The number of beams actually sent by the cell SSB may be determined based on a cell coverage scenario, the PRACH period and the number of ROs in the PRACH period may be determined based on a user access frequency of the cell PRACH, and a maximum waiting time for the terminal to initiate a random access may be determined based on a user experience value.

Step 202: and determining the SSB number corresponding to the RO according to the network planning parameters.

In this step, specifically, after the network planning parameter is obtained, the SSB number corresponding to the RO may be determined according to the network planning parameter.

Thus, by acquiring network planning parameters, determining the number of SSBs corresponding to the ROs according to the network planning parameters, and based on the fact that the network planning parameters include the number of beams actually sent by the SSBs of the cell, the PRACH period, the number of ROs in the PRACH period, and the longest waiting time for the terminal to initiate one random access, mapping between each RO and the number of SSBs is obtained based on the coverage scene, the user access frequency and the user access receptivity, so that the terminal can select the RO resource corresponding to the SSB with the strongest beam when transmitting the preamble through the mapping, and the base station can know the best SSB beam received by the terminal through the random access.

In addition, as shown in fig. 3, when determining the SSB number corresponding to the RO according to the network planning parameter, the method may include the following steps:

step 301: and acquiring all values of the SSB number corresponding to the RO.

In this step, the number of SSBs corresponding to the RO may be referred to in the protocol specification, which includes eight values, i.e., 1/8, 1/4, 1/2, 1, 2, 4, 8, and 16.

In this case, the eight values may be determined as all the values of the SSB number corresponding to the RO.

Step 302: and determining the available value of the SSB number corresponding to the RO from all the values based on the beam number actually sent by the cell SSB.

In this step, specifically, after all the values of the SSB number corresponding to the RO are obtained, the available value of the SSB number corresponding to the RO may be determined from all the values based on the number of beams actually sent by the cell SSB.

At this time, when determining the available value, all the values may be traversed in sequence, and for each traversed value, it is determined whether the value is less than or equal to the number of beams actually sent by the cell SSB, and when the value is less than or equal to the number of beams actually sent by the cell SSB, the value is determined as the available value.

Thus, all the available values can be obtained from all the values by adopting the mode. At this point, all available values obtained may be recorded in the first set.

Step 303: and determining all candidate values of the number of SSBs corresponding to the RO from all the determined available values based on the number of beams actually sent by the cell SSB, the PRACH period, the number of ROs in the PRACH period and the longest waiting time for the terminal to initiate one random access.

In this step, specifically, after all available values of the number of SSBs corresponding to the RO are obtained, all candidate values of the number of SSBs corresponding to the RO may be determined from all the determined available values based on the number of beams actually transmitted by the cell SSB, the PRACH period, the number of ROs in the PRACH period, and the maximum waiting time for the terminal to initiate one random access.

At this time, when all candidate values of the number of SSBs corresponding to the RO are determined from all the determined available values based on the number of beams actually transmitted by the cell SSB, the PRACH period, the number of ROs in the PRACH period, and the longest waiting time for the terminal to initiate a random access, a mapping period between the SSB corresponding to the available value and the PRACH may be determined for each available value according to the number of beams actually transmitted by the cell SSB, the PRACH period, and the number of ROs in the PRACH period; then judging whether the mapping period between the SSB and the PRACH corresponding to the available value is less than or equal to the product of a preset coefficient and the longest waiting time for the terminal to initiate one random access; and finally, when the mapping period between the SSB and the PRACH corresponding to the available value is less than or equal to the product, determining the available value as a candidate value.

Specifically, the preset coefficient may be 1/10, that is, when a mapping period between the SSB and the PRACH corresponding to the available value is less than or equal to 1/10 of the longest waiting time for the terminal to initiate one random access, the available value may be determined as a candidate value.

It should be noted that, of course, the specific value of the preset coefficient is not specifically limited herein.

Thus, in the manner described above, all candidate values can be derived from all available values. At this time, all the resulting candidate values may be recorded in the second set.

Of course, when determining the mapping period between the SSB and the PRACH corresponding to each available value according to the number of beams actually transmitted by the cell SSB, the PRACH period, and the number of ROs in the PRACH period, for each available value, the mapping period between the SSB and the PRACH corresponding to the available value may be determined based on the following formula:

AP＝N _SSB ×T _PRACH /(P _SSB ×NRT _PRACH )；

wherein, the AP represents a mapping period between the SSB and the PRACH corresponding to the available value, N _SSB Represents the number of beams, T, actually transmitted by the cell SSB _PRACH Indicates the PRACH period, P _SSB Representing said available value, NRT _PRACH And the number of the ROs in the PRACH period is represented.

Specifically, the mapping period indicates a PRACH period in a time domain required after all SSB blocks are mapped to an RO.

Step 304: based on all the determined candidate values, a target value of the number of SSBs corresponding to the RO is determined.

In this step, specifically, after all the candidate values are determined, the target value of the number of SSBs corresponding to the RO may be determined based on all the determined candidate values.

At this time, the target value of the number of SSBs corresponding to the RO may be determined by any one of the following manners:

first, the candidate value corresponding to the maximum mapping period among all candidate values is determined as a target value.

Therefore, the candidate value which enables the mapping period to be the maximum in all the candidate values is selected as the target value, and the access collision probability can be lower.

Secondly, the candidate value corresponding to the minimum mapping period in all the candidate values is determined as the target value.

Therefore, the candidate value which enables the mapping period to be the minimum in all the candidate values is selected as the target value, and the waiting time for the user to initiate one-time random access is short.

Thirdly, determining the middle value of all the candidate values as the target value.

Therefore, the intermediate value in all the candidate values is selected as the target value, and the compromise between the waiting time for initiating the random access by the user and the access collision probability is realized.

Of course, it should be noted that, when there is no intermediate value in all the candidate values, the candidate value closest to the intermediate value may be determined as the target value, and this is not limited herein.

In this way, the configuration of the number of SSBs corresponding to the RO is realized through the above steps, so that the mapping between the RO and the number of SSBs is realized.

Furthermore, after the number of SSBs corresponding to the RO is determined according to the network planning parameter, the number of contention-based preambles on the SSBs may also be determined according to the number of SSBs corresponding to the determined RO; and then, determining the division mode of the preamble on the SSB according to the number of the contention-based preambles on the SSB, thereby realizing the full utilization of the preamble resources and avoiding the waste of the preamble resources.

Specifically, when determining the number of preambles on the SSB based on contention and the division manner of the preambles on the SSB, different determination manners may be distinguished according to whether the SSB corresponding to the determined RO is less than or equal to 1, and the following description will be made for two cases, respectively, when the SSB corresponding to the determined RO is less than or equal to 1 and when the number of SSBs corresponding to the determined RO is greater than 1.

In the first case, when the SSB corresponding to the determined RO is less than or equal to 1:

specifically, the network planning parameters further include a minimum number of preambles reserved for non-random access on the SSB and a minimum number of non-contention preambles on the SSB.

In this case, when determining the number of preambles on the SSB based on contention based on the number of SSBs corresponding to the determined RO, the method may include the steps of:

step A1: and when the number of the SSBs corresponding to the determined RO is less than or equal to 1, determining the maximum possible value of the number of the preambles based on the competition on the SSB according to the minimum number of the preambles reserved for the non-random access on the SSB and the minimum number of the non-competition preambles on the SSB.

In this step, specifically, when determining the maximum possible value of the contention-based preamble number on the SSB according to the minimum number of preambles reserved for non-random access on the SSB and the minimum number of non-contention preambles on the SSB, the maximum possible value may be calculated according to the minimum number of preambles reserved for non-random access on the SSB and the minimum number of non-contention preambles on the SSB by using the following formula:

V＝64-N _othersmin -N _CFRAmin ；

wherein V represents the maximum possible value, N _othersmin Indicating the minimum number of preambles reserved for non-random access on the SSB, N _CFRAmin Represents a minimum number of non-competing preambles on the SSB.

Step A2: and determining the number of preambles based on the competition on the SSB according to the maximum possible value.

In this step, specifically, after the maximum possible value is determined, when the contention-based preamble on the SSB is determined according to the maximum possible value, a first selected value having a smallest difference with the maximum possible value and no greater than the maximum possible value may be selected from the first preset set [4, 64] having a step size of 4, and the first selected value is determined as the contention-based preamble on the SSB.

In addition, specifically, the first preset set [4, 64] with a step size of 4 can be represented as [4, 64] step4, that is, the values in the first preset set include 4, 8, 12, 16.. 64, and so on.

For example, assuming that the maximum possible value of the contention-based preamble on the SSB is 61, and at this time, since 61 is not included in the first preset set, the value 60 closest to 61 in the set may be determined as the first selected value, that is, as the contention-based preamble on the SSB.

In this way, the number of contention-based preambles on the SSBs is determined when the number of SSBs corresponding to the RO is less than or equal to 1, and configuration of the number of contention-based preambles is achieved.

In this case, when determining the division scheme of the preambles on the SSB based on the number of preambles on the SSB based on contention, any one of the following division schemes may be determined:

firstly, a front derivative reserved for non-random access on an SSB is calculated through a first formula;

the first formula is: n is a radical of _others ＝64-n-N _CFRAmin ；

Secondly, calculating the number of the non-competitive preambles on the SSB through a second formula;

the second formula is: n is a radical of hydrogen _CFRA ＝64-n-N _othersmin ；

Wherein, N _others Indicating the number of preambles reserved on the SSB for non-random access, N _CFRA Denotes the number of non-contention preambles on the SSB, N denotes the number of contention-based preambles on the SSB, N _CFRAmin Represents the minimum number of non-competing preambles on the SSB, N _othersmin Indicating the minimum number of preambles on the SSB reserved for non-random access.

I.e. if the maximum possible value of the contention-based preamble on the SSB does not belong to the first predetermined set 4, 64]step4, the redundant preamble can be adjusted to N according to the SR preamble requirement and the non-contention preamble requirement _others Or N _CFRA I.e. the redundant preamble can be adjusted to SR (i.e. 64-N-N is adjusted to _CFRAmin As N _others ) Or adjust the redundant preamble to the non-contention access preamble (i.e., N) _CFRA ＝64-n-N _othersmin As N _CFRA )。

In addition, it should be noted that in this case, the preamble sequence on each SSB is the same, i.e., the range of the preamble sequence based on contention based random access on each SSB can be determined to be [0,n-1]](ii) a And determining the starting value of the leader sequence based on non-competitive random access on each SSB to be N, and the sequence length to be N _CFRA I.e. starting from the number N, N being consecutive _CFRA Each preamble is a preamble sequence based on non-contention random access. Of course, the other preambles are the last N of the 64 preambles at this time _others And (4) respectively.

At this time, the preamble division manner in this case can be seen as shown in fig. 4-1. In FIG. 4-1, SSB0 through SSBN _SSB The initial values of the corresponding preambles are all 0, CBRA is n preamble sequences based on competitive random access on each SSB, and CFRA is a preamble sequence based on non-competitive random access on each SSB; in addition, others remove CBRA and other preambles N after CFRA out of 64 preambles _others 。

In the second case, when the SSB corresponding to the determined RO is greater than 1:

In this case, when determining the number of preambles on the SSBs based on contention based on the number of SSBs corresponding to the determined RO, the method may include the steps of:

step B1: and when the number of SSBs corresponding to the determined RO is larger than 1, grouping the SSBs based on the number of SSBs corresponding to the determined RO, and determining the number of groups.

In this step, specifically, when determining the number of packets by grouping SSBs based on the number of SSBs corresponding to the determined RO, the number of packets may be determined by grouping SSBs based on the number of SSBs corresponding to the determined RO by the following formula:

N1＝N _SSB /V _SSB ；

wherein N1 represents the number of packets, N _SSB Indicates the number of beams, V, actually transmitted by the cell SSB _SSB Indicating the number of SSBs corresponding to the determined RO.

I.e. can start from SSB0 at packet time, every V _SSB A group of consecutive SSBs, divided into N _SSB /V _SSB And (4) grouping. Now assume that the J-th SSB belongs to [0,N ] _SSB -1]And J and V _SSB If the ratio is J and the remainder is m, the jth SSB is the mth of the jth group.

And step B2: and aiming at each SSB in each group of SSBs, determining the number of usable preambles of the SSBs according to the number of the SSBs corresponding to the determined RO and the minimum number of the preambles reserved for non-random access on the SSBs.

In this step, specifically, when determining the number of preambles available for SSBs according to the number of SSBs corresponding to the determined RO and the minimum number of preambles reserved for non-random access on the SSBs for each SSB in each group of SSBs, the total number of preambles available for each group of SSBs may be determined by the following formula; then, for each SSB in each group of SSBs, calculating the number of usable preambles for the SSBs according to the total number of usable preambles for each group of SSBs by using the following formula:

wherein the content of the first and second substances,

represents the total number of available preambles, N, for each set of SSBs _othersmin Represents a minimum number, V, of preambles on the SSB reserved for non-random access _SSB Represents the number of SSBs corresponding to the determined RO, and N2 represents the number of preambles available for each SSB.

Of course, the symbols used herein should be construed as

Indicating rounding down, i.e. </or>

Is expressed by taking less than or equal to (64-N) within the symbol _othersmin )/V _SSB Is the largest integer of (a).

I.e. the number of preambles available to each SSB in the group can be determined in the manner described above.

And step B3: and determining the number of the preambles based on the competition on the SSB according to the number of the available preambles of the SSB and the minimum number of the non-competition preambles on the SSB.

In this step, specifically, when determining the number of preambles on the SSB based on contention according to the number of available preambles on the SSB and the minimum number of non-contention preambles on the SSB, a difference between the number of available preambles on the SSB and the minimum number of non-contention preambles on the SSB may be calculated first, and the difference is determined as a possible value of the number of preambles on the SSB based on contention.

At this time, after calculating the possible value of the contention-based preamble number on the SSB, the contention-based preamble number on the SSB may be determined for the SSB number corresponding to the determined RO, where:

when the SSB number corresponding to the determined RO is 2, selecting a second selected value which has the smallest difference with the possible value and is not larger than the possible value from a second preset set [4, 32] with the step length of 4, and determining the second selected value as the competition-based leader number on the SSB;

when the SSB number corresponding to the determined RO is 4, selecting a third selected value which has the smallest difference with the possible value and is not larger than the possible value from a third preset set [1, 16] with the step length of 1, and determining the third selected value as the competition-based leader number on the SSB;

when the number of SSBs corresponding to the determined RO is 8, selecting a fourth selected value which has the smallest difference with the possible values and is not greater than the possible values from a fourth preset set [1,8] with the step size of 1, and determining the fourth selected value as the competition-based leader number on the SSBs;

and when the number of SSBs corresponding to the determined RO is 16, selecting a fifth selected value which has the smallest difference with the possible values and is not greater than the possible values from a fifth preset set [1,4] with the step size of 1, and determining the fifth selected value as the competition-based preamble number on the SSBs.

In this way, the number of preambles based on contention on the SSB is determined when the number of SSBs corresponding to the RO is greater than 1, and the configuration of the number of preambles based on contention is realized.

In addition, in this case, when determining the dividing manner of the preambles on the SSB according to the number of the contention-based preambles on the SSB, the number of the non-contention preambles on the SSB may be calculated by the following third formula according to the number of the contention-based preambles on the SSB and the total number of the preambles available for the group in which the SSB is located; and/or the presence of a gas in the gas,

according to the total number of the available preambles of the group where the SSB is located, calculating to obtain a front derivative reserved for non-random access on the SSB through a fourth formula;

wherein the third formula is:

the fourth formula is:

N _CFRA indicates the number of non-competing preambles on the SSB, N _others Indicating the number of preambles reserved on the SSB for non-random access,

indicates the total number of preambles available for the group in which the SSB is located, and n indicates the number of contention-based preambles on the SSB.

Of course, it should be noted that the starting value of the contention-based preamble sequence on the mth SSB in each set of SSBs can also be determined as

The length of the leader sequence is n; wherein the value range of m is [0,V _SSB -1](ii) a And determining the start value of the non-competing leader sequence on the mth SSB as->

The length of the leader sequence is N _CFRA 。

I.e. the m-th SSB preamble sequence in any set of SSBs from

At the beginning, n consecutive preambles are the preambles based on contention on the SSB, m is the second SSB in a group, and the value is 0, 1 _SSB -1; from

At first, N is continued _CFRA Each preamble is a non-contention preamble on the SSB. In addition, the remaining preambles of the 64 preambles are the last N _others 。

Of course, when there are multiple SSBs, regardless of the group number of each SSB group, the preamble sequence on the mth SSB in the group is the same (i.e. the preamble is completely the same if the group number is the same, and is not related to the SSB belonging to the several SSBs), i.e. the preamble used by the 1 st SSB in the 0 th group, the 1 st group, and the M th group is the same, and the preamble used by the 2 nd SSB of all the groups is also the same.

At this time, the preamble division manner in this case can be seen as shown in fig. 4-2. In fig. 4-2, for convenience of illustration, the SSB number corresponding to the determined RO is denoted as M. Assuming that the first set of SSBs includes SSBs 0 through SSBs (M-1), SSB0 corresponds to a leader sequence with an initial value of 0, and CBRA SSB0 is a contention-based leader sequence on SSB0, CFRA SSB0 is a non-contention-based leader sequence on SSB 0; similarly, CBRA SSB (M-1) is a contention-based leader sequence on SSB (M-1), and CFRA SSB (M-1) is a non-contention leader sequence on CFRA SSB (M-1); the last set of SSBs comprises SSBs (N) _SSB -M) to SSB (N) _SSB -1), the labeling method of the preamble sequences on CBRA and CFRA on each SSB in the last group is the same as that in the first group, and will not be described herein again, and if there is a redundant preamble, it can be others.

The above embodiments are explained below by specific examples.

The first embodiment is as follows:

specifically, the first step: assume that the network planning parameters obtained from the network planning and user experience are as shown in the following table:

network planning parameter classification	Network planning parameter values
		Number of beams N actually transmitted by cell SSB _SSB	1 is provided with
PRACH period T _PRACH	2 frames
		Number NRT of ROs in PRACH period _PRACH	2 are provided with
Longest waiting time T for terminal to initiate random access _wait	20ms
		Minimum number of preambles reserved for non-random access N _othersmin	1 is provided with
Minimum number of non-competing preambles per SSB N _CFRAmin	2 are provided with

Step two: determining the number of SSBs corresponding to the RO:

when N is present _SSB When the number is 1, the SSB number corresponding to the RO is 1/8, 1/4, 1/2 and 1, and the following conditions are satisfied: number of SSBs for RO < = N _SSB I.e., values in the set of available values are 1/8, 1/4, 1/2, 1.

Then, calculating a mapping period AP between the SSB and the PRACH corresponding to each available value, where AP = N _SSB ×T _PRACH /(P _SSB ×NRT _PRACH )＝1/P _SSB ；

Then go through each available value P in the available value set _SSB Corresponding AP, judging whether AP is less than or equal to T _wait And 10, obtaining values satisfying the formula as 1/2 and 1, namely values in the candidate value set comprise 1/2 and 1.

Finally, the mapping period 1/P can be taken _SSB The minimum value (i.e., the user waiting time is prioritized) is used as the target value of the number of SSBs corresponding to the final RO, i.e., the target value is 1 in this case.

Step three: calculating the number n of preambles and the dividing mode of preamble sequences on each SSB based on the target value:

since the target value is 1, N is the maximum possible value (64-N) _othersmin -N _CFRAmin ) =64-2-1=61; since 61 does not belong to [4, 64]]step4, then choose a value from the set that is less than and closest to 61, so the value of n is 60. Adjusting a preamble number N reserved for non-random access on an SSB _Others Or the number N of non-competing preambles on each SSB _CFRA The value of (c).

To adjust N _Others Take the value of (4-N-N) as an example, the redundant preamble is adjusted to be a scheduling request (SR for short), i.e., (64-N-N) _CFRAmin ) Is determined as N _Others ，N _CFRA No adjustment is carried out; at this time N _Others ＝64-60-2＝2，N _CFRA ＝N _CFRAmin ＝2。

In addition, the preamble sequence on each SSB is the same, and is a contention random access (CBRA) preamble sequence [0, 59]; starting with sequence number 60, 2 consecutive non-contention random access (CFRA) preambles, i.e., [60, 61]. The last two are the other preambles, i.e., [62, 63]; referring specifically to the preamble sequence partitioning in fig. 4-3, the remaining preambles 62 and 63 can be the remaining preambles in fig. 4-3.

Example two:

network planning parameter classification	Network planning parameter values
		Number of beams N actually transmitted by cell SSB _SSB	4 are provided with
PRACH period T _PRACH	2 frames
		Number NRT of ROs in PRACH period _PRACH	2 are provided with
Longest waiting time T for terminal to initiate random access _wait	20ms
		Minimum number of preambles reserved for non-random access N _othersmin	1 is provided with
Minimum number of non-competing preambles per SSB N _CFRAmin	2 are provided with

Step two: determining the number of SSBs corresponding to the RO:

when N is present _SSB When the number is 4, the SSB number corresponding to the RO is 1/8, 1/4, 1/2, 1, 2 and 4, and the following conditions are satisfied: number of SSBs for RO < = N _SSB I.e., values in the set of available values are 1/8, 1/4, 1/2, 1, 2, 4.

Then, calculating a mapping period AP between the SSB and the PRACH corresponding to each available value, where AP = N _SSB ×T _PRACH /(P _SSB ×NRT _PRACH )＝4×2/(P _SSB ×2)＝4/P _SSB ；

Then go through each available value P in the available value set _SSB Corresponding AP, judging whether AP is less than or equal to T _wait And 10, obtaining values satisfying the formula 2 and 4, namely the values in the candidate value set comprise 2 and 4.

Finally, the mapping period 4/P can be taken _SSB Maximum value (i.e. giving priority to access collisions)Probability) as a target value of the number of SSBs corresponding to the final RO, i.e., the target value is 2 in this case.

since the target value is 2, greater than 1, it is illustrated that two SSB beams are mapped to one RO. At this point, the SSBs are grouped first. N is a radical of _SSB At 4, the grouping algorithm is as follows:

starting from SSB0, every two consecutive SSBs form a group which is divided into 2 groups, SSB0-SSB1 form a first group, and SSB2-SSB3 form a second group.

The n configuration and leader sequence partitioning method is as follows:

a) Calculating the number of available preambles for each set of SSBs

And the available front derivatives N2 for each SSB in the set; wherein the content of the first and second substances,

i.e. when the available front derivative N2 for each SSB in the group is 62/2=31,v _SSB A target value indicating the number of SSBs corresponding to the RO.

b) And calculating n:

when V is _SSB When 2, from the set [4, 32]]In step4, one of the nearest (N2-N) values is selected _CFRAmin = 29) as the value of n, n =28.

c) Calculating the number of preambles N reserved for non-random access on SSB _Others The value of (c):

d) Calculating the number N of non-competitive preambles on each SSB _CFRA The value of (c):

N _CFRA ＝N2-n＝31-28＝3。

e) Compute the preamble sequence on each SSB:

referring to fig. 4-4, the preamble sequence on the 0 th SSB in group 1 starts from 0, and 28 consecutive preambles are contention-based preambles on the SSB0, i.e., [0, 27]; starting with the 28 th preamble, the consecutive 3 preambles are non-contended preambles on SSB0, i.e., [28, 30]. The preamble sequence on the 1 st SSB in group 1 starts from 1 × 62/2=31, and the consecutive 28 preambles are contention-based preambles on SSB1, i.e., [31, 58]; starting with the 59 th preamble, the consecutive 3 preambles are non-competing preambles on SSB1, i.e., [59, 61].

Group 2 is fully multiplexed with group 1 preambles:

the leader sequence on the 0 th SSB in the group 2 starts from 0, and the continuous 28 leaders are the contention-based leaders on the SSB0, namely [0, 27]; starting with the 28 th preamble, the consecutive 3 preambles are non-contending preambles on SSB0, i.e., [28, 30]. The preamble sequence on the 1 st SSB in group 2 starts from 1 × 62/2=31, and the consecutive 28 preambles are contention-based preambles on SSB1, i.e., [31, 58]; starting with the 59 th preamble, the consecutive 3 preambles are non-competing preambles on SSB1, i.e., [59, 61].

f) Other leader sequences N _Others : last N of 64 preambles _others One is another leader sequence, i.e. [62, 63]]。

In this way, in this embodiment, the number of SSBs corresponding to the RO is determined based on the network planning parameter, and the contention-based preamble number and the preamble sequence division manner on each SSB are calculated based on the determined number of SSBs corresponding to the RO, so that mapping between the number of SSBs and the RO is achieved, preamble resources are fully utilized, resource waste is avoided, and preamble division on each SSB is performed for 5G multiple SSB beams.

In addition, as shown in fig. 5, a block diagram of an apparatus for configuring a synchronization signal block in an embodiment of the present invention is shown, where the apparatus includes:

an obtaining module 501, configured to obtain network planning parameters, where the network planning parameters include a number of beams actually sent by a cell synchronization signal block SSB, a PRACH period of a physical random access channel, a number of random access occasions RO in the PRACH period, and a longest waiting time for a terminal to initiate a random access;

a first determining module 502, configured to determine, according to the network planning parameter, an SSB number corresponding to the RO.

Optionally, the first determining module includes:

the acquisition unit is used for acquiring all values of the SSB number corresponding to the RO;

a first determining unit, configured to determine, based on the number of beams actually sent by the cell SSB, all available values of the number of SSBs corresponding to the RO from all values;

a second determining unit, configured to determine, based on the number of beams actually sent by the cell SSB, the PRACH period, the number of ROs in the PRACH period, and the longest waiting time for the terminal to initiate a random access, all candidate values of the number of SSBs corresponding to the ROs from all the determined available values;

and a third determining unit configured to determine a target value of the number of SSBs corresponding to the RO based on all the determined candidate values.

Optionally, the first determining unit is configured to sequentially traverse all the values, and determine, for each traversed value, whether the value is less than or equal to the number of beams actually sent by the cell SSB; and when the value is less than or equal to the number of beams actually sent by the cell SSB, determining the value as an available value.

Optionally, the second determining unit is configured to, for each available value, determine, according to the number of beams actually sent by the cell SSB, the PRACH period, and the number of ROs in the PRACH period, a mapping period between the SSB and the PRACH corresponding to the available value; judging whether the mapping period between the SSB and the PRACH corresponding to the available value is less than or equal to the product of a preset coefficient and the longest waiting time for the terminal to initiate one random access; and when the mapping period between the SSB and the PRACH corresponding to the available value is less than or equal to the product, determining the available value as a candidate value.

Optionally, the second determining unit is configured to, for each available value, determine, according to the number of beams actually transmitted by the cell SSB, the PRACH period, and the number of ROs in the PRACH period, a mapping period between the SSB and the PRACH corresponding to the available value, based on the following formula:

AP＝N _SSB ×T _PRACH /(P _SSB ×NRT _PRACH )；

Optionally, the third determining unit is configured to determine, as the target value, a candidate value corresponding to the maximum mapping period among all candidate values; or, determining the candidate value corresponding to the minimum mapping period in all the candidate values as a target value; alternatively, the median value among all candidate values is determined as the target value.

Optionally, the method further comprises: a second determining module, configured to determine, according to the SSB number corresponding to the determined RO, a contention-based preamble number on the SSB;

and a third determining module, configured to determine a partitioning manner of the preambles on the SSB according to the number of contention-based preambles on the SSB.

Optionally, the network planning parameter further includes a minimum number of preambles reserved for non-random access on the SSB and a minimum number of non-contention preambles on the SSB;

the second determining module is configured to determine, when the number of SSBs corresponding to the determined RO is less than or equal to 1, a maximum possible value of the number of contention-based preambles on the SSB according to the minimum number of preambles reserved for non-random access on the SSB and the minimum number of non-contention preambles on the SSB; and determining the number of preambles based on the competition on the SSB according to the maximum possible value.

Optionally, the second determining module is configured to calculate, according to the minimum number of preambles reserved for non-random access on the SSB and the minimum number of non-contention preambles on the SSB, the maximum possible value by using the following formula: v =64-N _othersmin -N _CFRAmin (ii) a Wherein V represents the maximum possible value, N _othersmin Indicating the minimum number of preambles reserved for non-random access on the SSB, N _CFRAmin Represents the aboveMinimum number of non-competing preambles on the SSB;

selecting a first selected value which has the smallest difference value with the maximum possible value and is not larger than the maximum possible value from a first preset set [4, 64] with the step length of 4; and determining the first selected value as the preamble number based on competition on the SSB.

Optionally, the third determining module is configured to calculate, by using a following first formula, a front derivative reserved on the SSB for the non-random access; or, the number of the non-competitive preambles on the SSB is calculated through the following second formula; wherein the first formula is: n is a radical of hydrogen _others ＝64-n-N _CFRAmin (ii) a The second formula is: n is a radical of hydrogen _CFRA ＝64-n-N _othersmin ；N _others Represents a preamble reserved on the SSB for non-random access, N _CFRA Representing the number of non-contention preambles on said SSB, N representing the number of contention-based preambles on said SSB, N _CFRAmin Represents a minimum number, N, of non-competing preambles on said SSB _othersmin Represents a minimum number of preambles on the SSB reserved for non-random access.

Optionally, the third determining module is configured to determine that the range of the preamble sequence based on contention based random access on each SSB is [0,n-1]](ii) a Determining a starting value of a non-contention based random access preamble sequence on each SSB as N and a sequence length of N _CFRA 。

the second determining module is configured to, when the number of SSBs corresponding to the determined RO is greater than 1, group SSBs based on the number of SSBs corresponding to the determined RO, and determine the number of groups; for each SSB in each group of SSBs, determining the number of usable preambles of each SSB according to the number of SSBs corresponding to the determined RO and the minimum number of preambles reserved for non-random access on the SSB; and for each SSB, determining the number of preambles on the SSB based on contention according to the number of available preambles of the SSB and the minimum number of non-contention preambles on the SSB.

Optionally, the second determining module is configured to, based on the SSB number corresponding to the determined RO, group the SSBs by using the following formula, and determine the group number: n1= N _SSB /V _SSB (ii) a Wherein N1 represents the number of the packets, N _SSB Represents the number of beams, V, actually transmitted by the cell SSB _SSB And representing the SSB number corresponding to the determined RO.

Optionally, the second determining module is configured to, for each group of SSBs, determine, according to the SSB number corresponding to the determined RO and the minimum number of preambles reserved for non-random access on the SSBs, a total number of preambles available for each group of SSBs by using the following formula:

for each SSB in each group of SSBs, calculating the number of the usable preambles of each SSB according to the total number of the usable preambles of each group of SSBs by the following formula:

/>

wherein the content of the first and second substances,

represents the total number of available preambles of each set of SSBs, N _othersmin Represents a minimum number, V, of preambles on the SSB reserved for non-random access _SSB Represents the number of SSBs corresponding to the determined RO, and N2 represents the number of preambles available for each SSB.

Optionally, the second determining module is configured to calculate a difference between the number of preambles available to the SSB and a minimum number of non-contention preambles on the SSB, and determine the difference as a possible value of contention-based preambles on the SSB; when the SSB number corresponding to the determined RO is 2, selecting a second selected value which has the smallest difference with the possible value and is not larger than the possible value from a second preset set [4, 32] with the step length of 4, and determining the second selected value as the competition-based leader number on the SSB; when the number of SSBs corresponding to the determined RO is 4, selecting a third selected value which has the smallest difference with the possible value and is not larger than the possible value from a third preset set [1, 16] with the step length of 1, and determining the third selected value as a competition-based preamble number on the SSBs; when the number of SSBs corresponding to the determined RO is 8, selecting a fourth selected value which has the smallest difference with the possible value and is not greater than the possible value from a fourth preset set [1,8] with the step size of 1, and determining the fourth selected value as the competition-based leader number on the SSBs; and when the SSB number corresponding to the determined RO is 16, selecting a fifth selected value which has the smallest difference with the possible value and is not greater than the possible value from a fifth preset set [1,4] with the step size of 1, and determining the fifth selected value as the competition-based preamble number on the SSB.

Optionally, the third determining module is configured to calculate, according to the number of contention-based preambles on the SSB and the total number of available preambles in the group where the SSB is located, the number of non-contention preambles on the SSB by using a third formula; and/or calculating to obtain a front derivative reserved for non-random access on the SSB through a following fourth formula according to the total number of available preambles of the group where the SSB is located; wherein the third formula is:

the fourth formula is:

N _CFRA represents the number of non-competing preambles on said SSB, N _others Indicating the number of preambles reserved on the SSB for non-random access,

represents the total number of preambles available for the group in which the SSB is located, and n represents the number of contention-based preambles on the SSB.

Optionally, theThe third determining module is configured to determine an initial value of the contention-based preamble sequence on the mth SSB in each set of SSBs as

The length of the leader sequence is n; wherein the value range of m is [0,V _SSB -1](ii) a Determining an onset of a non-competing leader sequence on the mth SSB as ^ er>

The length of the leader sequence is N _CFRA 。

It should be noted that the apparatus provided in this embodiment can implement all the method steps of the above method embodiments and achieve the same technical effects, and the method and the beneficial effects in this embodiment that are the same as those in the method embodiments are not described again.

In addition, as shown in fig. 6, an entity structure schematic diagram of the electronic device provided in the embodiment of the present invention, the electronic device may include: a processor (processor) 610, a communication Interface (Communications Interface) 620, a memory (memory) 630 and a communication bus 640, wherein the processor 610, the communication Interface 620 and the memory 630 communicate with each other via the communication bus 640. The processor 610 may invoke a computer program stored on the memory 630 and executable on the processor 610 to perform the steps of: acquiring network planning parameters, wherein the network planning parameters comprise the number of beams actually sent by a cell synchronization signal block SSB, a Physical Random Access Channel (PRACH) period, the number of random access opportunities (RO) in the PRACH period and the longest waiting time for a terminal to initiate one random access; and determining the SSB number corresponding to the RO according to the network planning parameters.

Optionally, the determining, according to the network planning parameter, the number of SSBs corresponding to the RO includes: acquiring all values of SSB number corresponding to RO; determining all available values of SSB number corresponding to RO from all values based on the number of beams actually sent by the cell SSB; determining all candidate values of SSB number corresponding to RO from all determined available values based on the number of beams actually sent by the cell SSB, PRACH period, number of RO in the PRACH period and the longest waiting time for the terminal to initiate one random access; based on all the determined candidate values, a target value of the number of SSBs corresponding to the RO is determined.

It should be noted that the electronic device provided in this embodiment can implement all the method steps of the above method embodiments and achieve the same technical effects, and the description of the same method and beneficial effects in this embodiment and the method embodiments is omitted here.

In addition, the logic instructions in the memory 630 may be implemented in the form of software functional units and stored in a computer readable storage medium when the logic instructions are sold or used as independent products. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.

Embodiments of the present invention also provide a non-transitory computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the method steps in the above embodiments.

The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.

Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. Based on the understanding, the above technical solutions substantially or otherwise contributing to the prior art may be embodied in the form of a software product, which may be stored in a computer-readable storage medium, such as ROM/RAM, magnetic disk, optical disk, etc., and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method according to the various embodiments or some parts of the embodiments.

Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.

Claims

1. A method for configuring a synchronization signal block, comprising:

2. The method according to claim 1, wherein the determining the number of SSBs corresponding to the RO according to the network planning parameter includes:

acquiring all values of SSB corresponding to RO;

determining all available values of SSB number corresponding to RO from all values based on the number of beams actually sent by the cell SSB;

determining all candidate values of SSB number corresponding to RO from all determined available values based on the number of beams actually sent by the cell SSB, PRACH period, number of RO in the PRACH period and the longest waiting time for the terminal to initiate one random access;

based on all the determined candidate values, a target value of the number of SSBs corresponding to the RO is determined.

3. The method according to claim 2, wherein the determining all available values of the number of SSBs corresponding to the RO from all values based on the number of beams actually transmitted by the cell SSB comprises:

traversing all the values in sequence, and judging whether the value is less than or equal to the number of beams actually sent by the cell SSB or not for each traversed value;

and when the value is less than or equal to the number of beams actually sent by the cell SSB, determining the value as an available value.

4. The method of claim 2, wherein the determining all candidate values of the number of SSBs corresponding to ROs from all the determined available values based on the number of beams actually transmitted by the cell SSB, the PRACH period, the number of ROs in the PRACH period, and the longest waiting time for a random access initiated by the terminal comprises:

for each available value, determining a mapping period between the SSB and the PRACH corresponding to the available value according to the number of beams actually sent by the cell SSB, the PRACH period and the number of ROs in the PRACH period;

judging whether the mapping period between the SSB and the PRACH corresponding to the available value is less than or equal to the product of a preset coefficient and the longest waiting time for the terminal to initiate one random access;

and when the mapping period between the SSB and the PRACH corresponding to the available value is less than or equal to the product, determining the available value as a candidate value.

5. The method for configuring the synchronization signal block according to claim 4, wherein the determining, for each available value, a mapping period between the SSB and the PRACH corresponding to the available value according to the number of beams actually transmitted by the cell SSB, the PRACH period, and the number of ROs in the PRACH period comprises:

for each available value, according to the number of beams actually sent by the cell SSB, the PRACH period, and the number of ROs in the PRACH period, determining a mapping period between the SSB and the PRACH corresponding to the available value based on the following formula:

AP＝N _SSB ×T _PRACH /(P _SSB ×NRT _PRACH )；

6. The method according to claim 4, wherein the determining a target value of the number of SSBs corresponding to the RO based on all the determined candidate values comprises:

determining a candidate value corresponding to the maximum mapping period in all the candidate values as a target value; alternatively, the first and second electrodes may be,

determining a candidate value corresponding to the minimum mapping period in all candidate values as a target value; alternatively, the first and second electrodes may be,

determining the middle value of all candidate values as the target value.

7. The method according to claim 1, wherein after determining the SSB number corresponding to the RO according to the network planning parameter, the method further comprises:

determining the number of competitive-based preambles on the SSBs according to the number of SSBs corresponding to the determined RO;

and determining the division mode of the preamble on the SSB according to the number of the preamble based on the competition on the SSB.

8. The method of claim 7, wherein the network planning parameters further include a minimum number of preambles on the SSB reserved for non-random access and a minimum number of non-contention preambles on the SSB;

the determining, according to the SSB number corresponding to the determined RO, the number of contention-based preambles on the SSB includes:

when the number of SSBs corresponding to the determined RO is less than or equal to 1, determining the maximum possible value of the number of preambles on the SSBs based on contention according to the minimum number of preambles reserved for non-random access on the SSBs and the minimum number of non-contention preambles on the SSBs;

and determining the preamble number based on competition on the SSB according to the maximum possible value.

9. The method of claim 8, wherein the determining a maximum possible value of the contention-based preamble number on the SSB according to the minimum number of preambles reserved for non-random access on the SSB and the minimum number of non-contention preambles on the SSB comprises:

according to the minimum number of the preambles reserved for the non-random access on the SSB and the minimum number of the non-contention preambles on the SSB, calculating to obtain the maximum possible value through the following formula:

V＝64-N _othersmin -N _CFRAmin ；

wherein V represents the maximum possible value, N _othersmin Indicating the minimum number of preambles reserved for non-random access on the SSB, N _CFRAmin Representing a minimum number of non-competing preambles on said SSB;

determining a contention-based preamble number on the SSB according to the maximum possible value includes:

selecting a first selected value which has the smallest difference value with the maximum possible value and is not larger than the maximum possible value from a first preset set [4, 64] with the step length of 4;

and determining the first selected value as the preamble number based on competition on the SSB.

10. The method according to claim 8, wherein the determining the preamble division manner on the SSB according to the contention-based preamble number on the SSB comprises:

calculating to obtain a front derivative reserved for non-random access on the SSB through a first formula; alternatively, the first and second liquid crystal display panels may be,

calculating the number of non-competitive preambles on the SSB by the following second formula;

wherein the first formula is: n is a radical of hydrogen _others ＝64-n-N _CFRAmin ；

The second formula is: n is a radical of _CFRA ＝64-n-N _othersmin ；

N _others Representing a preamble number, N, reserved on the SSB for non-random access _CFRA Representing the number of non-contention preambles on said SSB, N representing the number of contention-based preambles on said SSB, N _CFRAmin Represents a minimum number, N, of non-competing preambles on said SSB _othersmin Represents a minimum number of preambles on the SSB reserved for non-random access.

11. The method of configuring a synchronization signal block according to claim 10, further comprising:

determining the range of the preamble sequence of the contention-based random access on each SSB to be [0,n-1];

determining a starting value of a non-contention based random access preamble sequence on each SSB as N and a sequence length of N _CFRA 。

12. The method of claim 7, wherein the network planning parameters further include a minimum number of preambles reserved for non-random access on the SSB and a minimum number of non-contention preambles on the SSB;

when the number of SSBs corresponding to the determined RO is larger than 1, grouping the SSBs based on the number of SSBs corresponding to the determined RO, and determining the number of groups;

for each SSB in each group of SSBs, determining the number of usable preambles of each SSB according to the number of SSBs corresponding to the determined RO and the minimum number of preambles reserved for non-random access on the SSB;

and for each SSB, determining the number of preambles on the SSB based on contention according to the number of available preambles of the SSB and the minimum number of non-contention preambles on the SSB.

13. The method of claim 12, wherein the determining the number of packets by grouping SSBs based on the number of SSBs corresponding to the determined RO comprises:

grouping SSBs based on the determined number of SSBs corresponding to the RO by the following formula, and determining the number of groups:

N1＝N _SSB /V _SSB ；

wherein N1 represents the number of the packets, N _SSB Indicates the number of beams, V, actually transmitted by the cell SSB _SSB And representing the SSB number corresponding to the determined RO.

14. The method of claim 12, wherein the determining, for each SSB in each set of SSBs, the number of preambles available for each SSB according to the determined number of SSBs corresponding to the RO and the minimum number of preambles reserved for non-random access on the SSB comprises:

and for each group of SSBs, determining the total number of the available preambles of each group of SSBs according to the number of the SSBs corresponding to the determined RO and the minimum number of the preambles reserved for the non-random access on the SSBs by the following formula:

wherein the content of the first and second substances,

15. The method of claim 12, wherein the determining the number of contention-based preambles on the SSBs according to the number of preambles available to the SSBs and the minimum number of non-contention preambles on the SSBs for each SSB comprises:

calculating the difference between the number of the preambles available to the SSB and the minimum number of the non-contention preambles on the SSB, and determining the difference as the possible value of the number of the contention-based preambles on the SSB;

when the SSB number corresponding to the determined RO is 4, selecting a third selected value which has the minimum difference with the possible value and is not greater than the possible value from a third preset set [1, 16] with the step length of 1, and determining the third selected value as a competition-based preamble number on the SSB;

when the number of SSBs corresponding to the determined RO is 8, selecting a fourth selected value which has the smallest difference with the possible value and is not greater than the possible value from a fourth preset set [1,8] with the step size of 1, and determining the fourth selected value as the competition-based leader number on the SSBs;

and when the SSB number corresponding to the determined RO is 16, selecting a fifth selected value which has the smallest difference with the possible value and is not greater than the possible value from a fifth preset set [1,4] with the step size of 1, and determining the fifth selected value as the competition-based preamble number on the SSB.

16. The method of claim 14, wherein the determining the partition of the preambles on the SSB according to the number of contention-based preambles on the SSB comprises:

calculating the number of non-competitive preambles on the SSB according to the number of the contention-based preambles on the SSB and the total number of the usable preambles of the group where the SSB is located through a third formula; and/or the presence of a gas in the gas,

wherein the third formula is:

the fourth formula is:

N _CFRA represents the number of non-competing preambles on said SSB, N _others Representing the number of preambles on the SSB reserved for non-random access,

represents the total number of available preambles of the group in which the SSB is located, and n represents the number of available preambles on the SSBContention-based preamble number.

17. The method of configuring a synchronization signal block of claim 16, further comprising:

determining an initial value of a contention-based leader sequence on the mth SSB in each set of SSBs as

The length of the leader sequence is n; wherein the value range of m is [0,V _SSB -1]；

Determining the start value of the noncompetitive leader sequence on the mth SSB to be

The length of the leader sequence is N _CFRA 。

18. An apparatus for configuring a synchronization signal block, comprising:

an obtaining module, configured to obtain network planning parameters, where the network planning parameters include a beam number actually sent by a cell synchronization signal block SSB, a PRACH period of a physical random access channel, a number of random access opportunities RO in the PRACH period, and a longest waiting time for a terminal to initiate a random access;

19. An electronic device comprising a memory, a processor and a program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the method of configuring a synchronization signal block according to any one of claims 1 to 17 when executing the program.

20. A non-transitory computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method for configuring a synchronization signal block according to any one of claims 1 to 17.