Communication method and device, storage medium and program product

Abstract

The embodiment of the invention provides a communication method and device, a storage medium and a program product, relates to the technical field of communication, and can expand PRACH (Physical Random Access Channel) resources. The method is applied to a terminal, and comprises: receiving a configuration message, the configuration message being used for indicating a mapping relationship between a downlink signal block and a unit during random access, and the unit during random access comprising a plurality of random access opportunities; and transmitting a random access signal based on the configuration message.

Description

Technical Field

[0001] The present disclosure relates to the field of communication technologies, and in particular, to a communication method, apparatus, storage medium, and program product. Background Art

[0002] With the development of communication technologies, in the fifth-generation mobile communication technology (5G), namely new radio (NR), the requirement for connection density per square kilometer is 1 million terminals. In future wireless communication systems, such as the sixth-generation mobile communication technology (6G), a fully digital society can be achieved through the Internet of Everything, and the requirement for terminal connection density has increased significantly. The requirement for connection density per square kilometer is tens of millions or even up to 1 billion terminals.

[0003] A terminal needs to perform random access through a physical random access channel (PRACH) to connect to the network. Therefore, it is necessary to expand the PRACH resources to solve the problems of PRACH resource conflicts and increased random access delay when a large number of terminals perform random access. How to expand the PRACH resources has become an urgent problem to be solved. Summary of the Invention

[0004] Embodiments of the present disclosure provide a communication method, apparatus, storage medium, and program product, which can expand the PRACH resources.

[0005] On the one hand, a communication method is provided. The method is applied to a terminal and includes: receiving a configuration message, where the configuration message is used to indicate a mapping relationship between a downlink signal block and a random access opportunity group, and the random access opportunity group includes multiple random access opportunities; and transmitting a random access signal based on the configuration message.

[0006] On the other hand, a communication method is provided. The method is applied to a base station and includes: sending a configuration message, where the configuration message is used to indicate a mapping relationship between a downlink signal block and a random access opportunity group, and the random access opportunity group includes multiple random access opportunities; and receiving and responding to a random access signal.

[0007] In another aspect, a communication device is provided, which is applied to a terminal and includes a receiving module and a transmitting module. The receiving module is configured to receive a configuration message, which is used to indicate the mapping relationship between a downlink signal block and a random access opportunity group, and the random access opportunity group includes a plurality of random access opportunities. The transmitting module is configured to transmit a random access signal based on the configuration message.

[0008] In another aspect, a communication device is provided, which is applied to a base station and includes a transmitting module and a receiving module. The transmitting module is configured to transmit a configuration message, which is used to indicate the mapping relationship between a downlink signal block and a random access opportunity group, and the random access opportunity group includes a plurality of random access opportunities. The receiving module is configured to receive and respond to a random access signal.

[0009] In another aspect, a communication device is provided, which includes a memory and a processor. The memory and the processor are coupled. The memory is used to store a computer program. When the processor executes the computer program, the communication method of any of the above embodiments is implemented.

[0010] In another aspect, a computer-readable storage medium is provided, on which computer program instructions are stored. When the computer program instructions are executed by a processor, the communication method of any of the above embodiments is implemented.

[0011] In another aspect, a computer program product is provided, which includes computer program instructions. When the computer program instructions are executed, the communication method of any of the above embodiments is implemented.

[0012] In the embodiments of the present disclosure, a terminal can receive a configuration message for indicating the mapping relationship between a downlink signal block and a random access opportunity group. Further, the terminal can transmit a random access signal according to the configuration message. That is, the random access opportunity group is the time-frequency resource occupied by the random access signal transmitted by the terminal. The terminal randomly selects a preamble sequence as the random access signal and sends it to the base station at each random access opportunity in the random access opportunity group. The more random access opportunities included in the random access opportunity group, the more preamble sequences can be randomly selected from more random access opportunities, or the combination of preamble sequences can be randomly selected from more combinations of preamble sequences. Thus, the capacity of the PRACH resource is larger. Therefore, the expansion of the PRACH resource is achieved. BRIEF DESCRIPTION OF THE DRAWINGS

[0013] In order to more clearly illustrate the technical solutions in the present disclosure, the drawings required for some embodiments of the present disclosure will be briefly introduced below. Obviously, the drawings in the following description are only the drawings of some embodiments of the present disclosure, and those of ordinary skill in the art can also obtain other drawings based on these drawings.

[0014] Figure 1 Schematic diagram of a PRACH format provided by some embodiments of the present disclosure;

[0015] Figure 2 Schematic diagram of a PRACH occasion provided by some embodiments of the present disclosure;

[0016] Figure 3 Schematic diagram of a PRACH signal provided by some embodiments of the present disclosure;

[0017] Figure 4 Schematic diagram of a communication system provided by some embodiments of the present disclosure;

[0018] Figure 5 Schematic diagram of the flowchart of a communication method provided by some embodiments of the present disclosure;

[0019] Figure 6 Schematic diagram of the random access occasions included in a random access occasion group provided by some embodiments of the present disclosure;

[0020] Figure 7 Schematic diagram of the random access occasions included in another random access occasion group provided by some embodiments of the present disclosure;

[0021] Figure 8 Schematic diagram of the random access occasions included in another random access occasion group provided by some embodiments of the present disclosure;

[0022] Figure 9 Schematic diagram of the random access occasions included in another random access occasion group provided by some embodiments of the present disclosure;

[0023] Figure 10 Schematic diagram of the random access occasions included in another random access occasion group provided by some embodiments of the present disclosure;

[0024] Figure 11 Schematic diagram of the flowchart of another communication method provided by some embodiments of the present disclosure;

[0025] Figure 12 Schematic diagram of the flowchart of another communication method provided by some embodiments of the present disclosure;

[0026] Figure 13 Schematic diagram of the flowchart of another communication method provided by some embodiments of the present disclosure;

[0027] Figure 14 Schematic diagram of the flowchart of another communication method provided by some embodiments of the present disclosure;

[0028] Figure 15 Schematic diagram of the SSB corresponding to a random access occasion group provided by some embodiments of the present disclosure;

[0029] Figure 16 Schematic diagram of SSB corresponding to another random access opportunity group provided in some embodiments of the present disclosure;

[0030] Figure 17 Schematic diagram of the preamble sequence included in a PRACH format provided in some embodiments of the present disclosure;

[0031] Figure 18 Schematic diagram of the preamble sequence included in another PRACH format provided in some embodiments of the present disclosure;

[0032] Figure 19 Schematic diagram of the CP included in a PRACH format provided in some embodiments of the present disclosure;

[0033] Figure 20 Schematic diagram of the CP included in another PRACH format provided in some embodiments of the present disclosure;

[0034] Figure 21 Schematic flowchart of another communication method provided in some embodiments of the present disclosure;

[0035] Figure 22 Schematic flowchart of another communication method provided in some embodiments of the present disclosure;

[0036] Figure 23 Structural schematic of a communication device provided in some embodiments of the present disclosure Figure 1 ;

[0037] Figure 24 Structural schematic of a communication device provided in some embodiments of the present disclosure Figure 2 ;

[0038] Figure 25 Structural schematic of a communication device provided in some embodiments of the present disclosure Figure 3 . Detailed implementation manners

[0039] Next, the technical solutions in the present disclosure will be clearly and completely described in conjunction with the accompanying drawings in the present disclosure. Obviously, the described embodiments are only some embodiments of the present disclosure, rather than all embodiments. All other embodiments obtained by those of ordinary skill in the art based on the embodiments in the present disclosure without creative efforts shall fall within the protection scope of the present disclosure.

[0040] It should be noted that in this disclosure, words such as "exemplary" or "for example" are used to indicate examples, illustrations or explanations. Any embodiment or design solution described as "exemplary" or "for example" in this disclosure should not be construed as being more preferred or having more advantages than other embodiments or design solutions. Rather, the use of words such as "exemplary" or "for example" is intended to present relevant concepts in a specific manner.

[0041] Hereinafter, the terms "first" and "second" are only used for descriptive purposes and should not be construed as indicating or implying relative importance or implicitly specifying the quantity of the indicated technical features. Thus, features defined with "first" and "second" may explicitly or implicitly include one or more of such features.

[0042] In the description of this disclosure, unless otherwise specified, " / " means "or". For example, A / B may mean A or B. The "and / or" herein is merely a description of the association relationship of associated objects, indicating that there can be three relationships. For example, A and / or B may mean: A exists alone, A and B exist simultaneously, and B exists alone. In addition, "at least one" means one or more, and "a plurality" means two or more.

[0043] The following introduces the professional terms involved in this disclosure:

[0044] The PRACH format refers to the basic structure of PRACH, and can also be called the random access format or the PRACH preamble format. As Figure 1 shown, the PRACH format generally includes two parts: a cyclic prefix (CP) and a preamble sequence. In the PRACH format, different coverage performances can be obtained by repeating the preamble sequence different numbers of times (for example, Figure 1 the preamble sequence in is repeated 2 times). In addition, since the timing advance of PRACH is 0, in order to prevent PRACH from interfering with other signals, a guard interval is usually reserved after the preamble sequence. The preamble sequence can also be called the PRACH preamble sequence, the PRACH preamble, the preamble or the random access preamble sequence.

[0045] The random access resources of a conventional system are allocated in a cell-specific manner. Each cell independently configures the time domain, frequency domain, and code domain resources for random access. The time-frequency domain resources correspond to the Physical Random Access Channel occasion (RACH occasion, RO), and the code domain resources correspond to the random access preamble sequence. The RO can also be referred to as the random access occasion. Usually, one RO corresponds to the time-frequency resources occupied by transmitting one PRACH format. One or more time domain ROs can be configured within a PRACH configuration period. One or more frequency domain ROs can be frequency-division multiplexed on one time instance (or time domain RO). For example, 1, 2, 4, or 8. As Figure 2 shown, within a PRACH configuration period, 2 ROs are configured in the time domain (which can be understood as 2 time resources that time-domain multiplex ROs). 4 frequency domain ROs are multiplexed on each time domain RO. That is, these 4 frequency domain ROs are located at different frequency domain positions but the same time domain position. That is, the total number of ROs is 8, namely RO0, RO1, RO2, RO3, RO4, RO5, RO6, and RO7. Among them, RO0, RO1, RO2, and RO3 are 4 ROs with the same time domain position but different frequency domain positions, and RO4, RO5, RO6, and RO7 are the other 4 ROs with the same time domain position but different frequency domain positions. Usually, the PRACH configuration includes at least one of the following: PRACH configuration index, PRACH format, PRACH configuration period, PRACH time-frequency resources, mapping parameters (i.e., mapping relationship) between the synchronization signal or physical broadcast channel block (synchronization signal (SS) / physical broadcast channel (PBCH) block, SSB) and the random access occasion, and preamble sequence configuration for random access.

[0046] Introduction to the mapping relationship between the SSB and the random access occasion: One of the important features of NR random access is the introduction of beam processing. Both the base station (e.g., the next generation node B, gNB) and the user equipment (user equipment, UE), i.e., the terminal, have the ability to transmit and receive multiple beams. In NR, the SSB is associated with the beam. The UE can select a specific SSB and use the beam corresponding to the SSB to send a PRACH signal (i.e., the random access signal, or the random access preamble sequence) on one RO. The mapping relationship between the SSB and the RO has been defined in the related art, enabling the base station to determine which SSB the UE has selected by detecting on which RO the UE sends the PRACH signal, so as to determine the transmission beam used by the base station when subsequently sending data (e.g., the random access response msg2 or msg4) to the UE.

[0047] The mapping relationship between the SSB and the random access occasion (or the effective random access occasion) can be determined according to the number of SSBs corresponding to each RO (i.e., N') and the number of contention-based preamble sequences corresponding to each SSB (i.e., R'). For example, for a 4-step random access procedure, the base station provides N' and R' for the UE. If N' is less than 1, one SSB is mapped to 1 / N' consecutive ROs, and for each RO, the SSB corresponds to R' consecutive-indexed contention-based preamble sequences starting from index 0. If N is greater than or equal to 1, that is, each RO corresponds to N' SSBs, the SSB with index n (0 ≤ n ≤ N' - 1) corresponds to R' consecutive-indexed contention-based preamble sequences starting from where, is the total number of random access preamble sequences except for the preamble sequences used for other purposes (e.g., system information request). The base station can provide the UE with the total number of random access preamble sequences. If the base station does not provide it, the total number of random access preamble sequences takes the default value.

[0048] The SSB index is mapped to the effective random access occasion in the following order: the preamble sequence index increases within one RO; the frequency-domain resources of the frequency-division multiplexed ROs increase; the time-domain resources of the time-division multiplexed ROs within the PRACH time slot increase; the PRACH time slot increases.

[0049] The mapping period of the SSB to the RO, which can also be referred to as the association period, is related to the PRACH configuration period. For example, the mapping relationship between the PRACH configuration period and the mapping period of the SSB to the RO is shown in Table 1.

[0050] Table 1

[0051] PRACH Configuration Period (milliseconds) Mapping Period (number of configuration periods) 10 {1，2，4，8，16} 20 {1，2，4，8} 40 {1，2，4} 80 {1，2} 160 {1}

[0052] According to the PRACH configuration period, at least M SSBs can be completely mapped to at least one RO within the mapping period at least once. The mapping period starts from radio frame 0 and takes the minimum value among all the mapping periods corresponding to this PRACH configuration period. For example, as shown in Table 1, when the PRACH configuration period is 10 milliseconds, assuming that within one RACH configuration period, at least M SSBs can be completely mapped to at least one RO at least once, the minimum value 1 of the mapping period can be taken. Here, M is the number of SSBs sent by the base station (or cell) within one SSB period, or the number of SSBs sent within one SSB burst. If after the mapping cycle of an integer number of SSBs to the RO within one mapping period, there are still some ROs or PRACH preamble sequences not mapped, these ROs or PRACH preamble sequences will no longer establish a mapping relationship with the SSB.

[0053] With the development of communication technology, the demand for connection density per square kilometer in 6G is more than 10 times that in 5G. Therefore, it is necessary to expand the PRACH resources to solve the problems of PRACH resource conflicts and increased random access delay when a large number of terminals perform random access.

[0054] To solve the above problems, the present disclosure provides a communication method. By combining different preamble sequences as a random access signal (i.e., the random access preamble sequence in msg 1 or msg A), more preamble sequence combinations (or preamble sequence combination indexes) are provided to increase the PRACH capacity. The PRACH signal is the PRACH preamble sequence sent in the first step of the random access process. As Figure 3 shown, the PRACH signal includes preamble sequence 1 (i.e., sequence 1) and preamble sequence 2 (i.e., sequence 2). Assuming that both of these two preamble sequences can be randomly selected from 64 preamble sequences, then there are 64 possible preamble sequence selections for preamble sequence 1 and preamble sequence 2 respectively. The combination of these two preamble sequences has 64 * 64 = 4096 preamble sequence combinations. Different sequence combinations can be regarded as different preamble resources, that is, PRACH resources. Therefore, it is equivalent to expanding the preamble sequences from 64 to 4096, that is, expanding the PRACH resources from 64 to 4096.

[0055] That is to say, if the random access signal includes X1 preamble sequences, and each preamble sequence can be selected from X2 preamble sequences (for example, the random access signal occupies X1 ROs, and each RO can be randomly selected from X2 preamble sequences), then the number of preamble sequence combinations after combining X1 preamble sequences will be the X1th power of X2. The larger the values of X1 and X2, the more the number of preamble sequence combinations after combination, the larger the capacity of the PRACH resources, and the more the number of UEs supporting PRACH multiplexing. In this way, the PRACH capacity can be increased.

[0056] Exemplarily, as Figure 4 shown, it is a schematic diagram of a communication system provided by an embodiment of the present disclosure. The communication system may include: a first node 101 and a second node 102. The first node 101 and the second node 102 may be one or more, and the quantity is not limited.

[0057] Among them, the first node 101 is configured to receive a configuration message from the second node 102 for indicating the mapping relationship between the downlink signal block and the random access opportunity group, and based on the configuration message, transmit a random access signal to the second node 102.

[0058] The second node 102 is configured to send a configuration message indicating the mapping relationship between the downlink signal block and the random access opportunity set to the first node 101, and receive and respond to the random access signal from the first node 101.

[0059] It should be noted that, in the embodiments of the present disclosure, the first node 101 may be a node with terminal functions. For example, it may be one of the following: a terminal, or the terminal function part of a relay node. The terminal function part of the relay node may be a mobile termination (MT) of an integrated access and backhaul (IAB) node, or a terminal function module of a network-controlled repeater mobile termination (NCR-MT), etc.

[0060] A terminal may be a device with wireless transceiver functions. The terminal may be a mobile phone, a tablet computer (Pad), a computer with wireless transceiver functions, a virtual reality (VR) terminal, an augmented reality (AR) terminal, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in remote medical, a wireless terminal in smart grid, a wireless terminal in transportation safety, a wireless terminal in smart city, a wireless terminal in smart home, etc. The application scenarios of the terminal are not limited in the embodiments of the present disclosure. Sometimes, the terminal may also be referred to as a user, a UE, an A-IoT device, an access terminal, a UE unit, a UE station, a mobile station, a mobile unit, a remote station, a transmitter, a remote terminal, a mobile device, a UE terminal, a wireless communication device, a UE agent, or a UE device, etc., which are not limited in the embodiments of the present disclosure.

[0061] The second node 102 may be a node with base station functions. For example, it may be one of the following: a base station, an access point (AP), or the base station function part of a relay node. The base station function part of the relay node may be a distributed unit (DU) of an IAB node, a forwarding function module for a network-controlled repeater (NCR-Fwd), etc.

[0062] The base station can be a base station in Long Term Evolution (LTE), Long Term Evolution Advanced (LTE-A), or an evolved Node B (eNB or eNodeB), a base station device (gNB) in a 5G network, or a base station in a future communication system, etc. The base station can include various macro base stations, micro base stations, home base stations, remote radio heads, reconfigurable intelligent surfaces (RISs), routers, relay stations, transmission and reception points (TRPs), receivers, access points, wireless fidelity (WIFI) devices, and other network-side devices. Sometimes, the base station can also be referred to as a reader / writer for communicating with the terminal, which is not limited in the embodiments of the present disclosure.

[0063] The downlink signal block can be an SSB, a downlink synchronization signal, or any signal associated with a beam. For example, a channel state information reference signal (CSI-RS), a phase-tracking reference signal (PTRS), which is not limited in the embodiments of the present disclosure.

[0064] It should be noted that Figure 4 it is only an exemplary framework diagram, Figure 4 the number of devices included and the names of each device are not restricted.

[0065] The application scenarios of the embodiments of the present disclosure are not limited. The system architecture and service scenarios described in the embodiments of the present disclosure are for more clearly explaining the technical solutions of the embodiments of the present disclosure, and do not constitute a limitation on the technical solutions provided by the embodiments of the present disclosure. Those of ordinary skill in the art can know that with the evolution of the network architecture and the emergence of new service scenarios, the technical solutions provided by the embodiments of the present disclosure are equally applicable to similar technical problems.

[0066] In the following embodiments and examples, the first node 101 is taken as a terminal, the second node 102 is taken as a base station, and the downlink signal block is taken as an SSB to introduce the communication method provided by the present disclosure. If the first node 101 is other device, replace the terminal in the following embodiments and examples with other device; if the second node 102 is other device, replace the base station in the following embodiments and examples with other device; if the downlink signal block is other signal or channel, replace the SSB in the following embodiments and examples with other signal or channel. The embodiments of the present disclosure do not limit this.

[0067] Figure 5 A flowchart of a communication method is shown, as Figure 5 shown. This communication method is applied to a terminal and includes S201 - S202:

[0068] S201. Receive a configuration message.

[0069] Among them, the configuration message is used to indicate the mapping relationship between the downlink signal block and the random access opportunity group, and the random access opportunity group includes multiple random access opportunities.

[0070] In a possible implementation manner, the terminal may receive a configuration message from the base station. The configuration message may also be referred to as a mapping parameter configuration message. The number of downlink signal blocks may be at least one, and the number of random access opportunity groups may be at least one, that is, the configuration message may be used to indicate the mapping relationship between each downlink signal block in at least one downlink signal block and each random access opportunity group in at least one random access opportunity group.

[0071] For example, the number of multiple random access opportunities may be any reasonable number such as 2, 3, etc.

[0072] S202. Transmit a random access signal based on the configuration message.

[0073] In a possible implementation manner, when the terminal needs to initiate random access to the base station, the terminal may select a downlink signal block, and according to the mapping relationship between the downlink signal block and the random access opportunity group indicated by the configuration message, send a random access signal to the base station on the random access opportunity group corresponding to the downlink signal block. In this way, the base station can determine which downlink signal block the terminal has selected by detecting on which random access opportunity group the terminal sends the random access signal, so as to determine the transmit beam used by the base station to send a random access response to the terminal later, that is, the transmit beam corresponding to the downlink signal block, to complete the random access process of the terminal.

[0074] That is to say, the random access opportunity set is the time-frequency resource occupied by the random access signal transmitted by the terminal. The terminal randomly selects a preamble sequence as the random access signal and sends it to the base station at each random access opportunity in the random access opportunity set. The more random access opportunities included in the random access opportunity set, the more preamble sequences can be randomly selected from more random access opportunities, or the more combinations of preamble sequences can be randomly selected from more combinations of preamble sequences. Consequently, the capacity of the PRACH resource is larger, thereby achieving the expansion of the PRACH resource.

[0075] In some embodiments, multiple random access opportunities satisfy at least one of the following: the same frequency-domain resource, the same time-domain resource, including multiple PRACH frequency-domain resources, including multiple PRACH time-domain resources, corresponding to multiple uplink bandwidth parts of the same carrier, corresponding to multiple segments of spectrum of the same virtual carrier, corresponding to multiple carriers.

[0076] In a possible implementation manner, each random access opportunity set in at least one random access opportunity set may include one of the following: N1 random access opportunities with the same frequency-domain resource, N2 random access opportunities with the same time-domain resource, N1*N2 random access opportunities corresponding to N1 PRACH time-domain resources and N2 PRACH frequency-domain resources, N1*N2 random access opportunities corresponding to the intersection of N1 PRACH time-domain resources and N2 PRACH frequency-domain resources. Wherein, a random access opportunity includes one PRACH frequency-domain resource and one PRACH time-domain resource.

[0077] That is to say, the base station and the terminal need to have a consistent understanding of the determination method of the random access opportunities included in the random access opportunity set, so that based on the values of N1 and / or N2, the base station and the terminal can determine the random access opportunity set. The determination method of the random access opportunities included in the random access opportunity set can be predefined or configured by the base station to the terminal. In this disclosure, without ambiguity, the PRACH frequency-domain resource can be abbreviated as the frequency-domain resource. For example, the frequency-domain resource index is the PRACH frequency-domain resource index, and the PRACH time-domain resource can be abbreviated as the time-domain resource.

[0078] In another possible implementation, each random access opportunity set in at least one random access opportunity set may include L random access opportunities, and these L random access opportunities are respectively from L uplink bandwidth parts (BWPs) of the same carrier, or L carriers, or L segments of spectrum corresponding to the same virtual carrier (i.e., the L random access opportunities are respectively located in the L uplink BWPs of the same carrier, or L carriers, or multiple segments of spectrum of the same virtual carrier). The uplink BWP can be an initial uplink BWP or a non-initial uplink BWP. Different uplink BWPs within a carrier can be understood as different frequency resources within a carrier, and the uplink BWP is a segment of frequency resources within the carrier. Similarly, the determination methods of the random access opportunities included in the random access opportunity set by the base station and the terminal need to be understood consistently, so that the base station and the terminal can determine the random access opportunity set based on the value of L.

[0079] Among them, N1, N2, and L can be configured or predefined. For example, the base station can provide N1, N2, and L for the terminal, and N1, N2, and L can be included in the mapping parameter configuration message. Or, the base station provides N1, N2, and L for the terminal separately. If the base station does not provide N1, N2, and L, then N1, N2, and L can adopt default values, or N1, N2, and L can be predefined in the relevant files. Some of the parameters in N1, N2, and L can be configured, and the remaining parameters can be predefined. The present disclosure does not limit this. The available spectrum within a virtual carrier can be continuous or discontinuous, and a virtual carrier includes one or more carriers.

[0080] In one example, when the random access opportunity set includes N1 random access opportunities with the same frequency domain resources, N1 can be an integer greater than or equal to 2. Preferably, N1 is a power of 2. For example, N1 = 2, 4, or 8.

[0081] As Figure 6 shown, the number of randomly accessed opportunities multiplexed in the frequency domain (i.e., frequency) at a time instance (i.e., time instance) is 4. For each randomly accessed opportunity in the frequency domain (i.e., for each frequency domain resource of the randomly accessed opportunities multiplexed in the frequency domain), every two randomly accessed opportunities in the time domain (i.e., time) form a random access opportunity set, that is, the random access opportunity set includes two randomly accessed opportunities with the same frequency domain resources (i.e., N1 = 2).

[0082] Then the number of obtained random access opportunity groups can be 8, namely RO group 0, RO group 1, RO group 2, RO group 3, RO group 4, RO group 5, RO group 6, and RO group 7. RO group 0 includes 2 random access opportunities with the same frequency domain resources, namely RO0 and RO4. RO group 1 includes 2 random access opportunities with the same frequency domain resources, namely RO1 and RO5. RO group 2 includes 2 random access opportunities with the same frequency domain resources, namely RO2 and RO6. RO group 3 includes 2 random access opportunities with the same frequency domain resources, namely RO3 and RO7. RO group 4 includes 2 random access opportunities with the same frequency domain resources, namely RO8 and RO12. RO group 5 includes 2 random access opportunities with the same frequency domain resources, namely RO9 and RO13. RO group 6 includes 2 random access opportunities with the same frequency domain resources, namely RO10 and RO14. RO group 7 includes 2 random access opportunities with the same frequency domain resources, namely RO11 and RO15.

[0083] In yet another example, when the random access opportunity group includes N2 random access opportunities with the same time domain resources, N2 can be an integer greater than or equal to 2. Preferably, N2 is an integer power of 2. For example, N2 = 2, 4, or 8.

[0084] As Figure 7 shown, the number of random access opportunities multiplexed in the frequency domain (i.e., frequency) at a time instance is 4. For each random access opportunity in the time domain, every two random access opportunities in the frequency domain (i.e., time) form a random access opportunity group, that is, the random access opportunity group includes two random access opportunities with the same time domain resources (i.e., N2 = 2).

[0085] Then the number of obtained random access opportunity groups can be 8, namely RO group 0, RO group 1, RO group 2, RO group 3, RO group 4, RO group 5, RO group 6, and RO group 7. RO group 0 includes 2 random access opportunities with the same frequency domain resources, namely RO0 and RO1. RO group 1 includes 2 random access opportunities with the same frequency domain resources, namely RO2 and RO3. RO group 2 includes 2 random access opportunities with the same frequency domain resources, namely RO4 and RO5. RO group 3 includes 2 random access opportunities with the same frequency domain resources, namely RO6 and RO7. RO group 4 includes 2 random access opportunities with the same frequency domain resources, namely RO8 and RO9. RO group 5 includes 2 random access opportunities with the same frequency domain resources, namely RO10 and RO11. RO group 6 includes 2 random access opportunities with the same frequency domain resources, namely RO12 and RO13. RO group 7 includes 2 random access opportunities with the same frequency domain resources, namely RO14 and RO15.

[0086] In yet another example, the random access opportunity set may include N2 random access opportunities with the same time-domain resources, and the N2 random access opportunities respectively come from N2 uplink BWPs (or initial uplink BWP) within the same carrier or N2 frequency spectrum segments of the same virtual carrier. For example, the random access opportunities within N2 uplink BWPs (or initial uplink BWP) within the same carrier or N2 frequency spectrum segments of the same virtual carrier with the same time-domain resources can be divided into random access opportunity sets according to specific rules.

[0087] For example, the specific rule may be that the frequency-domain resource indexes are the same, that is, the random access opportunities with the same time-domain resources and the same frequency-domain resource indexes within N2 uplink BWPs (or initial uplink BWP) within the same carrier or N2 frequency spectrum segments of the same virtual carrier form a random access opportunity set.

[0088] Again, for example, the specific rule may be that the frequency-domain resource indexes satisfy a specific relationship, that is, the random access opportunities with the same time-domain resources and the frequency-domain resource indexes satisfying a specific relationship within N2 uplink BWPs (or initial uplink BWP) within the same carrier or N2 frequency spectrum segments of the same virtual carrier form a random access opportunity set. The specific relationship may be that the frequency-domain resource indexes satisfy a specific functional relationship. For example, the difference between the frequency-domain resource indexes is a preset value.

[0089] Among them, the specific rules and specific relationships can be configured (for example, the base station configures the terminal) or predefined (for example, predefined in relevant documents).

[0090] It should be noted that the introduction of the random access opportunity set including N2 random access opportunities with the same time-domain resources, and the N2 random access opportunities respectively coming from N2 carriers is the same / similar to the introduction of respectively coming from N2 uplink BWPs within the same carrier or N2 frequency spectrum segments of the same virtual carrier. For example, just replace "N2 uplink BWPs within the same carrier or N2 frequency spectrum segments of the same virtual carrier" in the above description with "N2 carriers", and details will not be elaborated here.

[0091] As Figure 8 shown, the N2 random access opportunities with the same time-domain resources in the random access opportunity set respectively come from N2 uplink BWPs within the same carrier or N2 carriers or N2 frequency spectrum segments of the same virtual carrier (for simplicity, Figure 8In the case where the N2-segment spectrum is not shown in the figure, if N2 = 2, the two frequency-domain random access opportunities with the same time-domain resources in the random access opportunity group come from two carriers (carrier 0 and carrier 1 respectively) or from two uplink BWPs within the same carrier (BWP0 and BWP1 respectively). Then, the 8 random access opportunities in carrier 0 or BWP0 respectively form 8 random access opportunity groups with the 8 random access opportunities in carrier 1 or BWP1, namely RO group 0, RO group 1, RO group 2, RO group 3, RO group 4, RO group 5, RO group 6, and RO group 7.

[0092] For example, in the case where the specific rule is that the frequency-domain resource indexes are the same, RO group 0 is composed of RO0 in carrier 0 and RO0 in carrier 1. RO group 1 is composed of RO1 in carrier 0 and RO1 in carrier 1. RO group 2 is composed of RO2 in carrier 0 and RO2 in carrier 1. RO group 3 is composed of RO3 in carrier 0 and RO3 in carrier 1. RO group 4 is composed of RO4 in carrier 0 and RO4 in carrier 1. RO group 5 is composed of RO5 in carrier 0 and RO5 in carrier 1. RO group 6 is composed of RO6 in carrier 0 and RO6 in carrier 1. RO group 7 is composed of RO7 in carrier 0 and RO7 in carrier 1.

[0093] Another example is that in the case where the specific rule is that the frequency-domain resource indexes satisfy a specific relationship, if the preset value is 8, RO group 0 is composed of RO0 in carrier 0 and RO8 in carrier 1, RO group 1 is composed of RO1 in carrier 0 and RO9 in carrier 1, RO group 2 is composed of RO2 in carrier 0 and RO10 in carrier 1, RO group 3 is composed of RO3 in carrier 0 and RO11 in carrier 1, RO group 4 is composed of RO4 in carrier 0 and RO12 in carrier 1, RO group 5 is composed of RO5 in carrier 0 and RO13 in carrier 1, RO group 6 is composed of RO6 in carrier 0 and RO14 in carrier 1, and RO group 7 is composed of RO7 in carrier 0 and RO15 in carrier 1.

[0094] In yet another example, in the case where the random access opportunity group includes N1 PRACH time-domain resources and N1*N2 random access opportunities corresponding to N2 PRACH frequency-domain resources, N1 and N2 can be integers greater than or equal to 2. Preferably, N1 and N2 are integer powers of 2. For example, N1 = 2, 4, or 8, and N2 = 2, 4, or 8.

[0095] Such as Figure 9As shown, the number of random access opportunities multiplexed in the frequency domain (i.e., frequency) at a time instance is 4. The combination of 2*2 = 4 random access opportunities corresponding to the intersection of 2 PRACH time-domain resources and 2 PRACH frequency-domain resources forms a random access opportunity group. That is, the random access opportunity group contains two random access opportunities in the time domain, and two random access opportunities in the frequency domain for each of the two random access opportunities in the time domain (i.e., N1 = 2, N2 = 2), and the random access opportunity group contains 4 random access opportunities.

[0096] Among 16 ROs, 4 random access opportunities form a random access opportunity group. Then, the number of obtained random access opportunity groups is 4, namely RO group 0, RO group 1, RO group 2, and RO group 3. RO group 0 includes 4 ROs corresponding to 2 PRACH time-domain resources (i.e., the PRACH time-domain resources corresponding to RO0 / RO1 / RO2 / RO3, and the PRACH time-domain resources corresponding to RO4 / RO5 / RO6 / RO7) and 2 PRACH frequency-domain resources (i.e., the PRACH frequency-domain resources corresponding to RO0 / RO4 / RO8 / RO12, and the PRACH frequency-domain resources corresponding to RO1 / RO5 / RO9 / RO13), namely RO0, RO1, RO4, RO5. Similarly, RO group 1 includes RO2, RO6, RO3, and RO7. RO group 2 includes RO8, RO12, RO9, and RO13. RO group 3 includes RO10, RO14, RO11, and RO15.

[0097] In another example, a random access opportunity group may contain N1*N2 random access opportunities corresponding to N1 PRACH time-domain resources and N2 PRACH frequency-domain resources, and the N2 random access opportunities on each of the N1 PRACH time-domain resources come from N2 uplink BWPs (or initial uplink BWP) within the same carrier or N2 spectral segments of the same virtual carrier. For example, the random access opportunities within N2 uplink BWPs (or initial uplink BWP) within the same carrier or N2 spectral segments of the same virtual carrier on each of the N1 PRACH time-domain resources can be divided into random access opportunity groups according to specific rules.

[0098] For example, the specific rule may be that the frequency-domain resource indexes are the same, that is, the random access opportunities with the same time-domain resources and the same frequency-domain resource indexes within N2 uplink BWPs (or initial uplink BWP) within the same carrier or N2 spectral segments of the same virtual carrier form a random access opportunity group.

[0099] For another example, the specific rule may be that the frequency-domain resource indexes satisfy a specific relationship, that is, N2 uplink BWPs (or the initial uplink BWP) within the same carrier or N2 time-domain resources within the same virtual carrier have the same time-domain resources and the frequency-domain resource indexes satisfy a specific relationship to form a random access opportunity group. The specific relationship may be that the frequency-domain resource indexes satisfy a specific functional relationship. For example, the difference between the frequency-domain resource indexes is a preset value.

[0100] Among them, the specific rule and the specific relationship can be configured (for example, the base station configures the terminal) or predefined (for example, predefined in relevant documents).

[0101] It should be noted that the introduction of the N1*N2 random access opportunities corresponding to N1 PRACH time-domain resources and N2 PRACH frequency-domain resources, and the N2 random access opportunities on each of the N1 PRACH time-domain resources among the N1 PRACH time-domain resources come from N2 carriers respectively is the same as / similar to the introduction of N2 uplink BWPs within the same carrier or N2 spectra of the same virtual carrier. For example, just replace "N2 uplink BWPs within the same carrier or N2 spectra of the same virtual carrier" in the above description with "N2 carriers", and details will not be elaborated here.

[0102] In a possible implementation, when N2 = 2, the two carriers can be a normal uplink carrier and a supplementary uplink carrier respectively.

[0103] As Figure 10 shown, in the case where the random access opportunity group includes N1*N2 random access opportunities corresponding to N1 PRACH time-domain resources and N2 PRACH frequency-domain resources, and the N2 random access opportunities on each of the N1 PRACH time-domain resources among the N1 PRACH time-domain resources come from N2 uplink BWPs within the same carrier or N2 carriers or N2 spectra of the same virtual carrier (for the sake of simplicity, Figure 10 the N2 spectra are not shown in the figure), if N1 = 2 and N2 = 2, the random access opportunity group includes 2 PRACH time-domain resources, and 2 random access opportunities with the same time-domain resources on each of these 2 PRACH time-domain resources, and the 2 random access opportunities with the same time-domain resources come from 2 uplink BWPs (BWP0 and BWP1 respectively) within the same carrier or 2 carriers (carrier 0 and carrier 1 respectively). Then, the 8 random access opportunities in carrier 0 or BWP0 respectively form 4 random access opportunity groups with the 8 random access opportunities in carrier 1 or BWP1, namely RO group 0, RO group 1, RO group 2, and RO group 3.

[0104] For example, when the specific rule is that the frequency-domain resource indexes are the same, RO group 0 consists of RO0 and RO2 in carrier 0 and RO0 and RO2 in carrier 1 (that is, each RO group contains 2 time-domain ROs and 2 frequency-domain ROs on each time-domain RO, and the 2 frequency-domain ROs come from carrier 0 and carrier 1 respectively). RO group 1 consists of RO1 and RO3 in carrier 0 and RO1 and RO3 in carrier 1. RO group 2 consists of RO4 and RO6 in carrier 0 and RO4 and RO6 in carrier 1. RO group 3 consists of RO5 and RO7 in carrier 0 and RO5 and RO7 in carrier 1.

[0105] For another example, when the specific rule is that the frequency-domain resource indexes satisfy a specific relationship, if the preset value is 8, RO group 0 consists of RO0 and RO2 in carrier 0 and RO8 and RO10 in carrier 1. RO group 1 consists of RO1 and RO3 in carrier 0 and RO9 and RO11 in carrier 1. RO group 2 consists of RO4 and RO6 in carrier 0 and RO12 and RO14 in carrier 1. RO group 3 consists of RO5 and RO7 in carrier 0 and RO13 and RO15 in carrier 1.

[0106] It should be noted that when the PRACH capacity in the RO group is the same (for example, the number of ROs included in the RO group is the same and the number of available preamble sequences in the ROs is also the same), compared with the scheme where the random access opportunity group includes N1*N2 random access opportunities corresponding to N1 PRACH time-domain resources and N2 PRACH frequency-domain resources, and the N2 random access opportunities on each of the N1 PRACH time-domain resources come from N2 uplink BWPs within the same carrier or N2 carriers or N2 segments of the spectrum of the same virtual carrier, the number of PRACH time-domain resources included in the RO group is less, and the random access delay can be smaller.

[0107] Compared with the scheme where the random access opportunity group includes N2 frequency-domain random access opportunities with the same time-domain resources, the random access bandwidth can be smaller and the implementation complexity can be lower. Therefore, N1 and N2 can be configured or predefined according to actual requirements, so as to achieve better performance.

[0108] However, if the random access opportunity group includes a small number of random access opportunities (such as 2), which can meet the PRACH capacity requirements, then the scheme where the random access opportunity group includes N1 random access opportunities with the same frequency-domain resources is a preferred solution, because energy saving of the terminal is crucial for users, and devices with high complexity usually consume more energy.

[0109] In yet another example, the random access occasion group may include L random access occasions, and the L random access occasions respectively come from L uplink BWPs (or initial uplink BWP) within the same carrier or L frequency spectrum segments of the same virtual carrier. For example, the random access occasions within the L uplink BWPs (or initial uplink BWP) within the same carrier or the L frequency spectrum segments of the same virtual carrier may be divided into random access occasion groups according to specific rules.

[0110] For example, the specific rule may be that the time-domain resource index and the frequency-domain resource index of the random access occasion are the same. Another example is that the specific rule may be that the time-domain resource index of the random access occasion satisfies a specific time interval and the frequency-domain resource index satisfies a specific relationship. Another example is that the specific rule may be that the indexes of the random access occasions are the same.

[0111] Among them, the specific rule, the specific relationship, and the specific time interval may be configured (for example, the base station configures the terminal) or predefined (for example, predefined in relevant documents).

[0112] It should be noted that the introduction of the random access occasion group including L random access occasions, and the L random access occasions respectively coming from L carriers is the same / similar to the introduction of the L uplink BWPs within the same carrier or the L frequency spectrum segments of the same virtual carrier. For example, just replace "the L uplink BWPs within the same carrier or the L frequency spectrum segments of the same virtual carrier" in the above description with "L carriers", and details will not be elaborated here.

[0113] In some embodiments, the configuration message includes at least one of the following: the number of downlink signal blocks corresponding to the random access occasion group, the total number of contention-based and non-contention-based random access preamble sequences, the number of preamble sequences used for preamble sequence combination, the number of contention-based preamble sequences corresponding to the downlink signal block, the number of preamble sequence combinations corresponding to the random access occasion group, the number of contention-based preamble sequence combinations corresponding to the downlink signal block.

[0114] In a possible implementation, the configuration message may include at least one of the following: the number of downlink signal blocks corresponding to each random access occasion group in at least one random access occasion group, the total number of contention-based and non-contention-based random access preamble sequences, the number of preamble sequences used for preamble sequence combination, the number of contention-based preamble sequences corresponding to each downlink signal block in at least one downlink signal block, the number of preamble sequence combinations corresponding to each random access occasion group in at least one random access occasion group, the number of contention-based preamble sequence combinations corresponding to each downlink signal block in at least one downlink signal block.

[0115] Optionally, based on the total number of contention-based and non-contention-based random access preamble sequences, which can also be referred to as the total number of preamble sequences corresponding to each RO group, generally does not include random access preamble sequences for other purposes (such as system information requests).

[0116] The number of preamble sequences used for preamble sequence combination can be the number of preamble sequences used for preamble sequence combination corresponding to each RO within the RO group, or the number of preamble sequences used for preamble sequence combination corresponding to each preamble sequence within the RO group, or the number of preamble sequences used for preamble sequence combination corresponding to each preamble sequence within each RO within the RO group.

[0117] For example, if the PRACH format contains one preamble sequence, the number of preamble sequences used for preamble sequence combination can be the number of preamble sequences used for preamble sequence combination corresponding to each RO within the RO group. Or, if the PRACH format contains multiple preamble sequences, the number of preamble sequences used for preamble sequence combination can be the number of preamble sequences used for preamble sequence combination corresponding to each preamble sequence within the RO group.

[0118] The number of contention-based preamble sequences corresponding to the downlink signal block can be the number of contention-based preamble sequences corresponding to each RO within the RO group for each SSB, or the number of contention-based preamble sequences corresponding to each preamble sequence within the RO group for each SSB.

[0119] It should be noted that the configuration methods for the two parameters, namely the number of preamble sequences used for preamble sequence combination and the number of contention-based preamble sequences corresponding to the downlink signal block, are introduced as follows: Configure each random access occasion in the random access occasion group individually. Or, configure the random access occasion group, and this configuration applies to each random access occasion in the random access occasion group. Or, configure each preamble sequence in each random access occasion in the random access occasion group individually. Or, configure the random access occasion group, and this configuration applies to each preamble sequence in each random access occasion in the random access occasion group.

[0120] It should be noted that the communication method provided in this disclosure is applicable to the contention-based random access process. For the contention-based random access process, on each random access occasion in the random access occasion group, the terminal independently selects a random access preamble sequence. Or, for the contention-based random access process, when multiple random access preamble sequences are transmitted on each random access occasion in the random access occasion group, the terminal independently selects each random access preamble sequence in each random access occasion.

[0121] Figure 11 The flowchart shows another communication method, as Figure 11 shown, the method in step S202 specifically includes S301 - S302:

[0122] S301. Determine a mapping relationship based on at least one of the number of downlink signal blocks corresponding to a random access opportunity group, the number of preamble sequence combinations corresponding to a random access opportunity group, and the number of preamble sequence combinations based on contention corresponding to a downlink signal block.

[0123] S302. Transmit a random access signal based on the mapping relationship.

[0124] In a possible implementation, the terminal can determine the mapping relationship between each random access opportunity group in at least one random access opportunity group and each downlink signal block in at least one downlink signal block based on at least one of the number of downlink signal blocks corresponding to each random access opportunity group in at least one random access opportunity group (i.e., the number of SSBs N corresponding to each RO group), the number of preamble sequence combinations corresponding to each random access opportunity group in at least one random access opportunity group (i.e., the total number of preamble sequence combinations N total ) of each random access opportunity group in at least one random access opportunity group, and the number of preamble sequence combinations based on contention corresponding to each downlink signal block in at least one downlink signal block (i.e., the number of preamble sequence combinations based on contention R corresponding to each SSB of each RO group), so as to realize the mapping between the downlink signal block and the random access opportunity group.

[0125] Further, the terminal can transmit a random access signal to the base station according to the mapping relationship between each random access opportunity group in at least one random access opportunity group and each downlink signal block in at least one downlink signal block.

[0126] Figure 12 The flowchart shows another communication method, as Figure 12 shown, the method in step S301 specifically includes S401 or S402:

[0127] S401. When the number of downlink signal blocks corresponding to a random access opportunity group is less than 1, determine the mapping relationship as: for any downlink signal block, map the downlink signal block to 1 / N consecutive random access opportunity groups, and for any random access opportunity group in the 1 / N consecutive random access opportunity groups, the downlink signal block corresponds to R consecutive preamble sequence combinations based on contention.

[0128] That is to say, when the number of downlink signal blocks corresponding to each random access opportunity group in at least one random access opportunity group is less than 1, the terminal can determine the mapping relationship between the random access opportunity group and the downlink signal block as follows: for any one of the at least one downlink signal block, map this downlink signal block to 1 / N consecutive random access opportunity groups in the at least one random access opportunity group, and for any one of the 1 / N consecutive random access opportunity groups, this downlink signal block corresponds to R consecutive contention-based preamble sequence combinations.

[0129] Exemplarily, if N is less than 1, then one SSB is mapped to 1 / N consecutive RO groups, and for each RO group, the SSB corresponds to R consecutive contention-based preamble sequence combinations starting from index 0.

[0130] For example, the number of contention-based preamble sequence combinations corresponding to each SSB is 1024, that is, R is 1024. If N is 1 / 3, then one SSB is mapped to 3 consecutive RO groups, such as RO group 0, RO group 1, and RO group 2, and for each RO group, the SSB corresponds to 1024 consecutive contention-based preamble sequence combinations with indexes from 0 to 1023.

[0131] S402. When the number of downlink signal blocks corresponding to the random access opportunity group is greater than or equal to 1, determine the mapping relationship as follows: for any random access opportunity group, map N downlink signal blocks to the random access opportunity group, and for any one of the N downlink signal blocks, divide the N total preamble sequence combinations corresponding to the random access opportunity group into N parts (or equally divide them into N parts), and the N downlink signal blocks respectively correspond to R consecutive contention-based preamble sequence combinations in the N parts.

[0132] Wherein, N is the number of downlink signal blocks corresponding to the random access opportunity group, R is the number of contention-based preamble sequence combinations corresponding to the downlink signal block, and N total is the number of preamble sequence combinations corresponding to the random access opportunity group.

[0133] That is to say, when the number of downlink signal blocks corresponding to each random access opportunity group in at least one random access opportunity group is greater than or equal to 1, the terminal can determine the mapping relationship between the random access opportunity group and the downlink signal block as follows: for any one of the at least one random access opportunity group, map N downlink signal blocks in the at least one downlink signal block to this random access opportunity group, and divide the N totalThe combination of preamble sequences is divided into N parts (or equally divided into N parts). The nth downlink signal block among the N downlink signal blocks corresponds to R consecutive contention-based preamble sequence combinations in the nth part, where 0 ≤ n ≤ N - 1.

[0134] Exemplarily, if N is greater than or equal to 1, that is, each RO group corresponds to N SSBs, that is, N SSBs are mapped to one RO group, then the SSB with index n (0 ≤ n ≤ N - 1) corresponds to R consecutive index contention-based preamble sequence combinations starting from n·N total / N.

[0135] For example, if an RO group contains two preamble sequences, and these two preamble sequences can be randomly selected from 64 preamble sequences respectively (that is, the number of preamble sequences used for preamble sequence combination is 64, or the total number of contention-based and non-contention-based random access preamble sequences is 64), then the number of preamble sequence combinations corresponding to each RO group is 64 * 64 = 4096, that is, N total is 4096. The base station can also directly configure the number N of preamble sequence combinations corresponding to each RO group for the terminal total . Among them, the number of contention-based preamble sequence combinations corresponding to each SSB is 512.

[0136] If N is 2, then 2 SSBs are mapped to one RO group. The 4096 preamble sequence combinations are divided into 2 parts, with 2048 in each part. The 2 SSBs are SSB0 and SSB1. Then the SSB with index 0 (i.e., SSB0) corresponds to 512 consecutive index contention-based preamble sequence combinations starting from n·N total / N = 1·4096 / 30 (i.e., the first 512), and the SSB with index 1 (i.e., SSB1) corresponds to 512 consecutive index contention-based preamble sequence combinations starting from 2048 (i.e., the first 512 in the second part).

[0137] In another communication method, the method in step S202 above includes steps S303 and S304:

[0138] S303. Determine the mapping relationship based on at least one of the number of downlink signal blocks corresponding to the random access opportunity group, the total number of contention-based and non-contention-based random access preamble sequences, and the number of contention-based preamble sequences corresponding to the downlink signal block.

[0139] S304. Transmit the random access signal based on the mapping relationship.

[0140] In a possible implementation, the terminal may determine the mapping relationship between each random access opportunity group in at least one random access opportunity group and each downlink signal block in at least one downlink signal block based on at least one of the number of downlink signal blocks corresponding to each random access opportunity group in at least one random access opportunity group (i.e., the number of SSBs N corresponding to each RO group), the total number of contention-based and non-contention-based random access preamble sequences (i.e., the total number of preamble sequences N total-seq ), and the number of contention-based preamble sequences corresponding to each downlink signal block in at least one downlink signal block (i.e., the number of contention-based preamble sequences R corresponding to each SSB in each RO group seq ), so as to implement the mapping between the downlink signal block and the random access opportunity group.

[0141] Further, the terminal may transmit a random access signal to the base station according to the mapping relationship between each random access opportunity group in at least one random access opportunity group and each downlink signal block in at least one downlink signal block.

[0142] In another communication method, the method in step S303 above specifically includes S403 or S404:

[0143] S403. When the number of downlink signal blocks corresponding to the random access opportunity group is less than 1, determine the mapping relationship as: for any downlink signal block, map the downlink signal block to 1 / N consecutive random access opportunity groups, and for any random access opportunity group in the 1 / N consecutive random access opportunity groups, in each random access opportunity in the random access opportunity group, the downlink signal block corresponds to R seq consecutive contention-based preamble sequences.

[0144] Exemplarily, if N is less than 1, one SSB is mapped to 1 / N consecutive RO groups, and for each RO group, in each RO in the RO group, the SSB corresponds to R seq consecutive-index contention-based preamble sequences starting from index 0.

[0145] S404. When the number of downlink signal blocks corresponding to the random access opportunity group is greater than or equal to 1, determine the mapping relationship as: for any random access opportunity group, map N downlink signal blocks to the random access opportunity group, and for any downlink signal block in the N downlink signal blocks, divide the N total-seq contention-based and non-contention-based random access preamble sequences into N parts (or equally divide them into N parts), and on each RO in the RO group, the N downlink signal blocks respectively correspond to R seq consecutive contention-based preamble sequences in the N parts.

[0146] Where N is the number of downlink signal blocks corresponding to a random access opportunity group, and R seq is the number of contention-based preamble sequences corresponding to a downlink signal block, and N total-seq is the total number of contention-based and non-contention-based random access preamble sequences, or the total number of preamble sequences corresponding to each random access opportunity group.

[0147] Exemplarily, if N is greater than or equal to 1, that is, each RO group corresponds to N SSBs, that is, N SSBs are mapped to one RO group, then for each RO in the RO group, the SSB with index n (0 ≤ n ≤ N - 1) corresponds to R total-seq consecutive-indexed contention-based preamble sequences starting from n·N seq / N.

[0148] It should be noted that the number of preamble sequence combinations corresponding to an RO group includes the number of contention-based preamble sequence combinations corresponding to the RO group.

[0149] Figure 13 FIG. shows a schematic flowchart of another communication method. As Figure 13 shown, before the above step S202, the method further includes S501:

[0150] S501. Determine the number of preamble sequence combinations corresponding to a random access opportunity group based on at least one of the number of preamble sequences used for preamble sequence combination, the number of preamble sequences included in a random access opportunity, and the number of random access opportunities included in a random access opportunity group.

[0151] That is to say, the parameter of the number of preamble sequence combinations corresponding to a random access opportunity group can be directly included in the configuration message, or can be determined by the terminal according to parameters such as the number of preamble sequences used for preamble sequence combination in the configuration message.

[0152] In a possible implementation, the terminal can determine the number of preamble sequence combinations corresponding to a random access opportunity group based on at least one of the number of preamble sequences used for preamble sequence combination, the number of preamble sequences included in a random access opportunity, and the number of random access opportunities included in a random access opportunity group, which is convenient for the terminal to determine the mapping relationship between the random access opportunity group and the downlink signal block according to the number of preamble sequence combinations corresponding to the random access opportunity group.

[0153] Exemplarily, assume that for different preamble sequences within an RO group, the number of preamble sequences used for preamble sequence combination is the same, both being N3, the number of preamble sequences included in an RO is N4, and the number of ROs included in an RO group is N5. Then the total number of preamble sequence combinations corresponding to each RO group is the N6th power of N3, where N6 is equal to the product of N4 and N5, i.e., N total -N3 N4·N5 . For example, if N3 is 64, N4 is 1, and N5 is 2, then N total = 64 1·2 = 4096.

[0154] It should be noted that the number of preamble sequences included in a random access occasion can be determined according to the PRACH format, and the PRACH format can be configured or predefined.

[0155] In a possible implementation, the index of the preamble sequence combination in each RO group can be determined based on at least one of the number of preamble sequences included in the RO, the number of ROs included in the RO group, and the total number of preamble sequences corresponding to each preamble sequence.

[0156] Exemplarily, an RO includes one preamble sequence (i.e., the PRACH format includes one preamble sequence), and the RO group includes two ROs. Then the index of the preamble sequence combination in the RO group is K*i1 + i2. Wherein, i1 and i2 are respectively the indexes of the preamble sequences on the first RO and the second RO of the RO group, i1 = 0, 1,..., K - 1, i2 = 0, 1,..., K - 1, and K is the total number of preamble sequences corresponding to each preamble sequence. That is, when the terminal sends a random access signal on the RO group, each preamble sequence sent can be selected from K preamble sequences (for example, K = 64, that is, the total number of preamble sequences corresponding to each preamble sequence is 64).

[0157] In a possible implementation, the total number of preamble sequences corresponding to different preamble sequences can also be different.

[0158] Exemplarily, an RO includes one preamble sequence, and the total numbers of preamble sequences corresponding to the preamble sequences on the first RO and the second RO within the RO group are K1 and K2 respectively. Then the index of the preamble sequence combination in the RO group is K2*i1 + i2, where i1 and i2 are respectively the indexes of the preamble sequences on the first RO and the second RO of the RO group, i1 = 0, 1,..., K1 - 1, i2 = 0, 1,..., K2 - 1.

[0159] Figure 14 Shows a schematic flowchart of another communication method, as Figure 14As shown, before the above step S202, the method further includes S601:

[0160] S601. Determine the number of contention-based preamble sequence combinations corresponding to the downlink signal block based on at least one of the number of contention-based preamble sequences corresponding to the downlink signal block, the number of preamble sequences included in the random access occasion, and the number of random access occasions included in the random access occasion group.

[0161] That is to say, the parameter of the number of contention-based preamble sequence combinations corresponding to the downlink signal block can be directly included in the configuration message, or can be determined by the terminal according to parameters such as the number of contention-based preamble sequences corresponding to the downlink signal block in the configuration message.

[0162] In a possible implementation manner, the terminal can determine the number of contention-based preamble sequence combinations corresponding to the downlink signal block based on at least one of the number of contention-based preamble sequences corresponding to the downlink signal block, the number of preamble sequences included in the random access occasion, and the number of random access occasions included in the random access occasion group, which is convenient for the terminal to determine the mapping relationship between the random access occasion group and the downlink signal block according to the number of contention-based preamble sequence combinations corresponding to the downlink signal block.

[0163] Exemplarily, assume that the number of preamble sequences included in the RO is N4, the number of ROs included in the RO group is N5, and the number of contention-based preamble sequences corresponding to each preamble sequence in the RO group is equal, all being N7. Then, for each contention-based preamble sequence combination corresponding to each SSB corresponding to each random access occasion group, the number is equal to the N8th power of N7, where N8 is the product of N4 and N5, that is, R = N7 N4·N5 . For example, if N3 is 32, N4 is 1, and N5 is 2, then R = 32 1·2 = 1024.

[0164] In some embodiments, within the mapping period of the downlink signal block to the random access occasion group, the downlink signal block is at least completely mapped to the random access occasion group once.

[0165] In a possible implementation manner, at least one SSB (i.e., the downlink signal block) is mapped to at least one random access occasion group in the following order: 1. The index of the preamble sequence combination within one RO group increases, or the code domain resource index determined based on the index of the preamble sequence within each RO in one RO group (i.e., the code domain resource index is a function of the index of the preamble sequence within each RO in the RO group) increases; 2. The frequency domain resource of the frequency division multiplexed RO group increases; 3. The time domain resource of the time division multiplexed RO group increases.

[0166] The mapping period for mapping SSBs to RO groups, which can also be referred to as the association period, is related to the PRACH configuration period. For example, the mapping relationship between the PRACH configuration period and the mapping period for mapping SSBs to RO groups is shown in Table 1.

[0167] According to the PRACH configuration period, M SSBs (M is greater than or equal to 1, that is, at least one downlink signal block) can be completely mapped to at least one RO group at least once within the mapping period. The mapping period starts from radio frame 0 and takes the minimum value among all the mapping periods corresponding to this PRACH configuration period. For example, as shown in Table 1, when the PRACH configuration period is 10 milliseconds, assuming that M SSBs are completely mapped to at least one RO group at least once within 3 PRACH configuration periods, the mapping period is 4 because the mapping periods greater than or equal to 3 in Table 1 include 4, 8, and 16, and the minimum value is 4. Here, M is the number of SSBs sent by the base station (or cell) within one SSB period, or the number of SSBs sent within one SSB burst. Each PRACH configuration period corresponds to one or more mapping periods. In this way, the mapping of SSBs to RO groups can be achieved.

[0168] In a possible implementation, if after the mapping cycle of an integer number of SSBs to RO groups within one mapping period, there are still some RO groups or PRACH preamble combinations that have not been mapped, then these RO groups or PRACH preamble combinations will no longer establish a mapping relationship with the SSBs. In addition, all the mapping periods corresponding to the PRACH configuration period can be predefined or configured by the base station to the terminal, or determined according to specific rules, and the value of M can be configured by the base station to the terminal.

[0169] In some embodiments, the mapping pattern period includes one or more mapping periods, and the mapping pattern period causes the pattern of mapping the downlink signal block to the random access occasion group to repeat periodically.

[0170] In a possible implementation, the mapping pattern period can also be referred to as the association pattern period. The base station can perform the mapping of SSBs to RO groups periodically. One mapping pattern period includes one or more mapping periods, and the determination of the mapping pattern period depends on the pattern of the mapping periods of one or more downlink signal blocks mapped to one or more random access occasion groups. The longest time for the pattern to repeat once can be configured or predefined. For example, it can be configured by the base station to the terminal, or predefined as 160 milliseconds.

[0171] In a possible implementation, the RO groups not mapped by SSBs after an integer number of mapping periods are not used for PRACH transmission.

[0172] The following describes the mapping from SSB to a random access occasion group by taking a specific example where a random access occasion group contains N1 random access occasions with the same frequency-domain resources as an example.

[0173] In one example, when the number of SSBs corresponding to each random access occasion group is greater than or equal to 1, as Figure 15 shown, each random access occasion group (i.e., RO group) contains 2 random access occasions on the same frequency-domain resources, and each random access occasion group corresponds to 2 SSBs. Starting from radio frame 0, 8 SSBs are mapped to the RO groups periodically. SSB0 and SSB1 are mapped to RO0 and RO4 (i.e., on RO group 0). SSB2 and SSB3 are mapped to RO1 and RO5 (i.e., on RO group 1). SSB4 and SSB5 are mapped to RO2 and RO6 (i.e., on RO group 2). SSB6 and SSB7 are mapped to RO3 and RO7 (i.e., on RO group 3).

[0174] In another example, when the number of SSBs corresponding to each random access occasion group is less than 1, as Figure 16 shown, each random access occasion group (i.e., RO group) contains 2 random access occasions on the same frequency-domain resources, and each random access occasion group corresponds to 0.5 SSB (i.e., each SSB corresponds to 2 RO groups). Starting from radio frame 0, 8 SSBs are mapped to the RO groups periodically. SSB0 is mapped to RO group 0 and RO group 1. SSB1 is mapped to RO group 2 and RO group 3. SSB2 is mapped to RO group 4 and RO group 5. SSB3 is mapped to RO group 6 and RO group 7. SSB4 is mapped to RO group 8 and RO group 9. SSB5 is mapped to RO group 10 and RO group 11. SSB6 is mapped to RO group 12 and RO group 13. SSB7 is mapped to RO group 14 and RO group 15.

[0175] In yet another example, when each random access occasion group contains one random access occasion (i.e., N1 = 1, N2 = 1), for the above Figure 15 example and Figure 16 example, if the PRACH format contains multiple preamble sequences, each random access occasion group can contain only one random access occasion. The mapping relationship between the SSB and the random access occasion can replace the random access occasion group in the above Figure 15 example and Figure 16 example. That is, the mapping relationship between the SSB and the random access occasion can reuse the mapping relationship between the SSB and the random access occasion in NR.

[0176] In some embodiments, the random access format corresponding to the random access signal includes at least one preamble sequence, and each preamble sequence in the at least one preamble sequence repeats at least once in the random access format.

[0177] That is, different coverage performances can be obtained by repeating the preamble sequence different numbers of times.

[0178] Exemplarily, in the case where the PRACH format includes one preamble sequence and the preamble sequence repeats at least once in the time domain, as Figure 17 shown, the PRACH format includes a CP and a preamble sequence, where the number of repetitions of the preamble sequence is 2 times. A random access occasion refers to the time-frequency resources occupied by transmitting a PRACH format. Figure 17 gives the PRACH resources within a PRACH resource period. The number of time-domain resources of the time-domain multiplexed random access occasions is 2, and the number of frequency-domain resources of the frequency-domain multiplexed random access occasions on each time-domain resource is 2, that is, 2 time-domain resources and 2 frequency-domain resources correspond to 4 ROs. Each RO has a PRACH format including a CP and a preamble sequence that repeats twice. The preamble sequences on different ROs can be randomly selected independently.

[0179] Assume that 2 ROs with the same time-domain resources form an RO group. Then the number of obtained random access occasion groups can be 2, namely RO1 and RO2 form an RO group, and RO3 and RO4 form an RO group.

[0180] In some embodiments, in the random access format (i.e., the PRACH format), the number of repetitions of each preamble sequence is the same.

[0181] Alternatively, the number of repetitions of each preamble sequence is related to the position of each preamble sequence in the random access format.

[0182] Alternatively, the number of repetitions of the first preamble sequence in the at least one preamble sequence is greater than or equal to 1, and the number of repetitions of the other preamble sequences except the first preamble sequence in the at least one preamble sequence is 1.

[0183] In a possible implementation manner, the PRACH format may include multiple preamble sequences, and each preamble sequence in the multiple preamble sequences repeats once or multiple times in the time domain. The number of repetitions of each preamble sequence included in the PRACH format may be the same.

[0184] In a possible implementation, the repetition times of each preamble sequence among the multiple preamble sequences included in the PRACH format can be different, and are related to the position of each preamble sequence in the PRACH format, that is, the repetition times of the preamble sequences in the PRACH format decrease or increase as the time domain increases.

[0185] For example, if the PRACH format includes 4 preamble sequences, and in the order of increasing time domain, the repetition times of these 4 preamble sequences decrease as the time domain increases, then the repetition times of these 4 preamble sequences in the PRACH format can be 4, 2, 2, and 1 respectively.

[0186] For another example, if the PRACH format includes 4 preamble sequences, and in the order of increasing time domain, the repetition times of these 4 preamble sequences increase as the time domain increases, then the repetition times of these 4 preamble sequences can be 1, 2, 2, and 4 respectively.

[0187] In a possible implementation, the repetition times of the first preamble sequence included in the PRACH format are greater than or equal to 1, and the repetition times of other preamble sequences are 1.

[0188] For example, if the PRACH format includes 4 preamble sequences, and in the order of increasing time domain, the repetition times of these 4 preamble sequences are 2, 1, 1, and 1 respectively.

[0189] Exemplarily, as Figure 18 shown, the PRACH format includes two preamble sequences. Among them, each preamble sequence corresponds to a CP, and the repetition times of each preamble sequence are 2. The random access opportunity refers to the time-frequency resources occupied by the PRACH format transmission. Figure 18 The PRACH resources within a PRACH resource period are given in

[0190] . The number of time-domain resources of the time-domain multiplexed random access opportunities is 2, and the number of frequency-domain resources of the frequency-domain multiplexed random access opportunities on each time-domain resource is 2, that is, 2 time-domain resources and 2 frequency-domain resources correspond to 4 ROs. Each RO has a PRACH format including a CP and two preamble sequences, and each preamble sequence is repeated 2 times. The preamble sequences on different ROs can be randomly selected independently.

[0191] In some embodiments, in a random access format (i.e., PRACH format), the first preamble sequence in at least one preamble sequence corresponds to a cyclic prefix, and the other preamble sequences in the at least one preamble sequence except the first preamble sequence do not have a cyclic prefix. It should be noted that the cyclic prefix here comes from the tail of the first preamble sequence.

[0192] Alternatively, all the preamble sequences in at least one preamble sequence correspond to a cyclic prefix, where the cyclic prefix is located before the first preamble sequence in the at least one preamble sequence. It should be noted that the cyclic prefix here comes from the tail of the last preamble sequence in the at least one preamble sequence. That is, the PRACH format corresponds to a cyclic prefix, and the cyclic prefix is before the first preamble sequence in the PRACH format.

[0193] Alternatively, each preamble sequence corresponds to a cyclic prefix.

[0194] Alternatively, for any preamble sequence group in at least one preamble sequence group, the first preamble sequence in the preamble sequence group corresponds to a cyclic prefix, and the other preamble sequences in the preamble sequence group except the first preamble sequence do not have a cyclic prefix. Wherein, the at least one preamble sequence group is obtained by grouping at least one preamble sequence.

[0195] Alternatively, for any preamble sequence group in at least one preamble sequence group, the preamble sequence group corresponds to a cyclic prefix, where the cyclic prefix is located before the first preamble sequence in the preamble sequence group. That is to say, the number of cyclic prefixes corresponding to the PRACH format is equal to the number of preamble sequence groups included in the PRACH format, and the cyclic prefix is located before the first preamble sequence in the preamble sequence group.

[0196] Next, with specific examples, the cyclic prefix of the preamble sequence in the PRACH format will be introduced.

[0197] In one example, as Figure 19As shown, the PRACH format contains M preamble sequences, each preamble sequence is repeated once, and M preamble sequences correspond to one CP. Alternatively, only the first preamble sequence (i.e., Sequence1) among the preamble sequences Sequence1 to SequenceM corresponds to one CP, and the other preamble sequences do not have a CP. Where M is greater than or equal to 2. The advantage of this PRACH format is that it can reduce the CP overhead and has a higher resource utilization rate. The disadvantage is that when the base station detects the preamble, it combines multiple preamble sequences as a long sequence for detection. When the number of preambles that can be selected for each preamble sequence (that is, when the terminal sends a random access signal, each preamble sequence in the PRACH format can independently select one from Y preamble sequences, and here Y is the number of preambles that can be selected for each preamble sequence) is determined, since the number of combinations of preamble sequences is much larger than the sum of the number of preambles that can be selected for each preamble sequence. Therefore, the number of times the base station tries to detect the preamble will increase significantly, resulting in an increase in detection complexity.

[0198] In yet another example, as Figure 20 shown, the PRACH format contains M preamble sequences, each preamble sequence is repeated once, and each preamble sequence among the preamble sequences Sequence1 to SequenceM corresponds to one CP. Where N is greater than or equal to 2. The disadvantage of this PRACH format is that the CP overhead is large and the resource utilization rate is low. The advantage is that the base station can try to detect each preamble sequence separately, and the complexity of PRACH preamble detection is low.

[0199] It should be noted that the above two cyclic prefix schemes each have their own advantages and disadvantages, and a compromise scheme can be selected according to the actual situation. The compromise scheme will be introduced below with examples.

[0200] In yet another example, the PRACH format includes multiple groups of preamble sequences. The first preamble sequence in each group of preamble sequences corresponds to one CP, and the other preamble sequences do not have a CP. Alternatively, each group of preamble sequences corresponds to one CP, and this CP is before the first preamble sequence of the group of preamble sequences.

[0201] For example, the PRACH format contains 4 preamble sequences, which are preamble sequence 1 to preamble sequence 4 in sequence. The preamble sequences are divided into two groups. Among them, sequence group 1 contains preamble sequences 1 and 2, and sequence group 2 contains preamble sequences 3 and 4. Sequence group 1 corresponds to one CP, and this CP is before preamble sequence 1 of sequence group 1. Sequence group 2 corresponds to one CP, and this CP is before the first preamble sequence 3 of sequence group 2.

[0202] In the above embodiments and examples, the random access opportunity may be replaced with a valid random access opportunity, and the random access opportunity group may be replaced with a valid random access opportunity group. A valid random access opportunity group refers to a random access opportunity group composed of valid random access opportunities, that is, all random access opportunities in the valid random access opportunity group are valid. Without conflict, the above embodiments or examples and the features therein may be combined arbitrarily, and the present disclosure does not limit this.

[0203] Figure 21 A flowchart showing another communication method is as shown in Figure 21 As shown, this communication method is applied to a base station and includes S701 - S702:

[0204] S701. Transmit a configuration message.

[0205] Among them, the configuration message is used to indicate the mapping relationship between the downlink signal block and the random access opportunity group, and the random access opportunity group includes multiple random access opportunities.

[0206] In a possible implementation manner, the base station may send a configuration message to the terminal.

[0207] For the introduction of the configuration message, reference may be made to the above embodiment S201, and details are not described herein.

[0208] S702. Receive and respond to the random access signal.

[0209] In a possible implementation manner, the base station may receive the random access signal and detect on which random access opportunity group the terminal sends the random access signal to determine which downlink signal block the terminal has selected, so as to determine the transmit beam used by the base station to send a random access response to the terminal subsequently, that is, the transmit beam corresponding to this downlink signal block, to complete the random access process of the terminal.

[0210] In some embodiments, the multiple random access opportunities satisfy at least one of the following: the same frequency domain resource, the same time domain resource, including multiple PRACH frequency domain resources, including multiple PRACH time domain resources corresponding to multiple uplink bandwidth parts of the same carrier, multiple segments of spectra corresponding to the same virtual carrier, corresponding to multiple carriers.

[0211] For the introduction of the random access opportunity, reference may be made to the above embodiment, and details are not described herein.

[0212] In some embodiments, the configuration message includes at least one of the following: the number of downlink signal blocks corresponding to a random access opportunity group, the total number of contention-based and non-contention-based random access preamble sequences, the number of preamble sequences for preamble sequence combination, the number of contention-based preamble sequences corresponding to a downlink signal block, the number of preamble sequence combinations corresponding to a random access opportunity group, and the number of contention-based preamble sequence combinations corresponding to a downlink signal block.

[0213] For the introduction of the parameters included in the configuration message, reference may be made to the above embodiments and will not be elaborated here.

[0214] In some embodiments, the mapping relationship is determined based on at least one of the number of downlink signal blocks corresponding to a random access opportunity group, the number of preamble sequence combinations corresponding to a random access opportunity group, and the number of contention-based preamble sequence combinations corresponding to a downlink signal block. The mapping relationship is used for transmitting random access signals.

[0215] For the introduction of how to determine the mapping relationship, reference may be made to the above embodiments S301 - S302 and will not be elaborated here.

[0216] In some embodiments, the mapping relationship is determined based on at least one of the number of downlink signal blocks corresponding to a random access opportunity group, the total number of contention-based and non-contention-based random access preamble sequences, and the number of contention-based preamble sequences corresponding to a downlink signal block. The mapping relationship is used for transmitting random access signals.

[0217] For the introduction of how to determine the mapping relationship, reference may be made to the above embodiments S303 - S304 and will not be elaborated here.

[0218] In some embodiments, when the number of downlink signal blocks corresponding to a random access opportunity group is less than 1, the mapping relationship is: for any downlink signal block, map the downlink signal block to 1 / N consecutive random access opportunity groups, and for any random access opportunity group among the 1 / N consecutive random access opportunity groups, the downlink signal block corresponds to R consecutive contention-based preamble sequence combinations.

[0219] Alternatively, when the number of downlink signal blocks corresponding to a random access opportunity group is greater than or equal to 1, the mapping relationship is: for any random access opportunity group, map N downlink signal blocks to the random access opportunity group, and for any downlink signal block among the N downlink signal blocks, divide the N total preamble sequence combinations corresponding to the random access opportunity group into N parts (or equally divide them into N parts), and the N downlink signal blocks respectively correspond to R consecutive contention-based preamble sequence combinations among the N parts.

[0220] Wherein, N is the number of downlink signal blocks corresponding to a random access opportunity group, R is the number of contention-based preamble sequence combinations corresponding to a downlink signal block, and N total is the number of preamble sequence combinations corresponding to a random access opportunity group.

[0221] For the introduction on how to determine the mapping relationship according to the number of downlink signal blocks corresponding to a random access opportunity group, reference can be made to the above embodiments S401 - S402, which will not be elaborated here.

[0222] In some embodiments, when the number of downlink signal blocks corresponding to a random access opportunity group is less than 1, the mapping relationship is: for any downlink signal block, map the downlink signal block to 1 / N consecutive random access opportunity groups, and for any random access opportunity group among the 1 / N consecutive random access opportunity groups, at each random access opportunity in the random access opportunity group, the downlink signal block corresponds to R seq consecutive contention-based preamble sequences.

[0223] Alternatively, when the number of downlink signal blocks corresponding to a random access opportunity group is greater than or equal to 1, the mapping relationship is: for any random access opportunity group, map N downlink signal blocks to the random access opportunity group, and for any downlink signal block among the N downlink signal blocks, divide the N total-seq contention-based and non-contention-based random access preamble sequences into N parts (or equally divide them into N parts), and on each RO in the RO group, the N downlink signal blocks respectively correspond to R seq consecutive contention-based preamble sequences.

[0224] For the introduction on how to determine the mapping relationship according to the number of downlink signal blocks corresponding to a random access opportunity group, reference can be made to the above embodiments S403 - S404, which will not be elaborated here.

[0225] In some embodiments, the number of preamble sequence combinations corresponding to a random access opportunity group is determined based on at least one of the number of preamble sequences used for preamble sequence combination, the number of preamble sequences included in a random access opportunity, and the number of random access opportunities included in a random access opportunity group.

[0226] For the introduction on how to determine the mapping relationship, reference can be made to the above embodiment S501, which will not be elaborated here.

[0227] In some embodiments, the number of contention-based preamble sequence combinations corresponding to a downlink signal block is determined based on at least one of the number of contention-based preamble sequences corresponding to the downlink signal block, the number of preamble sequences included in a random access opportunity, and the number of random access opportunities included in a random access opportunity group.

[0228] For the introduction on how to determine the mapping relationship, reference can be made to the above-mentioned embodiment S601, which will not be elaborated here.

[0229] In some embodiments, within the mapping period in which the downlink signal block is mapped to the random access occasion group, the downlink signal block is mapped to the random access occasion group at least completely once.

[0230] For the introduction on the mapping period, reference can be made to the above-mentioned embodiment, which will not be elaborated here.

[0231] In some embodiments, the mapping pattern period includes one or more mapping periods, and the mapping pattern period causes the mapping pattern in which the downlink signal block is mapped to the random access occasion group to repeat periodically.

[0232] For the introduction on the mapping pattern period, reference can be made to the above-mentioned embodiment, which will not be elaborated here.

[0233] In some embodiments, the random access format corresponding to the random access signal includes at least one preamble sequence, and each preamble sequence in the at least one preamble sequence is repeated at least once in the random access format.

[0234] For the introduction on the preamble sequence in the random access format, reference can be made to the above-mentioned embodiment, which will not be elaborated here.

[0235] In some embodiments, in the random access format (i.e., PRACH format), the repetition times of each preamble sequence are the same.

[0236] Alternatively, the repetition times of each preamble sequence are related to the position of each preamble sequence in the random access format.

[0237] Alternatively, the repetition times of the first preamble sequence in the at least one preamble sequence are greater than or equal to 1, and the repetition times of the other preamble sequences in the at least one preamble sequence except the first preamble sequence are 1.

[0238] For the introduction on the repetition times of the preamble sequence, reference can be made to the above-mentioned embodiment, which will not be elaborated here.

[0239] In some embodiments, the first preamble sequence in the at least one preamble sequence corresponds to a cyclic prefix, and the other preamble sequences in the at least one preamble sequence except the first preamble sequence do not have a cyclic prefix.

[0240] Alternatively, all the preamble sequences in the at least one preamble sequence correspond to a cyclic prefix, where the cyclic prefix is located before the first preamble sequence in the at least one preamble sequence.

[0241] Alternatively, each preamble sequence corresponds to a cyclic prefix.

[0242] Alternatively, for any one of at least one preamble sequence group, the first preamble sequence in the preamble sequence group corresponds to a cyclic prefix, and the other preamble sequences in the preamble sequence group except the first preamble sequence do not have a cyclic prefix. Wherein, the at least one preamble sequence group is obtained by grouping at least one preamble sequence.

[0243] Alternatively, for any one of at least one preamble sequence group, the preamble sequence group corresponds to a cyclic prefix, wherein the cyclic prefix is located before the first preamble sequence in the preamble sequence group.

[0244] For the introduction of the cyclic prefix, reference can be made to the above embodiments and will not be elaborated here.

[0245] Next, taking the interaction between the terminal and the base station as an example, the communication method provided in the above embodiments will be introduced. As Figure 22 shown, it includes:

[0246] S801. The base station sends a configuration message to the terminal. Correspondingly, the terminal receives the configuration message from the base station, so that the terminal can transmit a random access signal to the base station according to the mapping relationship between the downlink signal block and the random access opportunity group indicated by the configuration message.

[0247] S802. The terminal sends a random access signal to the base station. Correspondingly, the base station receives and responds to the random access signal from the terminal, so that the base station can receive the random access signal and send a random access response to the terminal.

[0248] It can be understood that in order to implement the above functions, the communication device includes the corresponding hardware structure and / or software module for executing each function. Those skilled in the art should easily realize that, combined with the algorithm steps of each example described in the embodiments of the present disclosure, the present disclosure can be implemented in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional technicians can use different methods to implement the described functions for each specific application, but such implementation should not be considered to exceed the scope of the present disclosure.

[0249] The embodiments of the present disclosure can divide the communication device into functional modules according to the above method embodiments. For example, each function can correspond to each functional module, or two or more functions can be integrated into one functional module. The above integrated module can be implemented in the form of hardware or software. It should be noted that the division of modules in the embodiments of the present disclosure is illustrative, only a logical function division, and there can be other division methods in actual implementation. Next, taking the example of dividing each function into each functional module as an example for illustration.

[0250] Figure 23 It is a schematic structure of a communication device provided by an embodiment of the present disclosure Figure 1 , and the communication device can be applied to a terminal and execute the above-mentioned Figure 5 shown communication method. As Figure 23 shown, the communication device 1200 includes: a receiving module 1201 and a transmitting module 1202.

[0251] The receiving module 1201 is configured to receive a configuration message, where the configuration message is used to indicate the mapping relationship between a downlink signal block and a random access opportunity group, and the random access opportunity group includes multiple random access opportunities. The transmitting module 1202 is configured to transmit a random access signal based on the configuration message.

[0252] In some embodiments, the multiple random access opportunities satisfy at least one of the following: the same frequency-domain resource, the same time-domain resource, including multiple PRACH frequency-domain resources, including multiple PRACH time-domain resources, corresponding to multiple uplink bandwidth parts of the same carrier, corresponding to multiple segments of spectrum of the same virtual carrier, corresponding to multiple carriers.

[0253] In some embodiments, the configuration message includes at least one of the following: the number of downlink signal blocks corresponding to the random access opportunity group, the total number of contention-based and non-contention-based random access preamble sequences, the number of preamble sequences used for preamble sequence combination, the number of contention-based preamble sequences corresponding to the downlink signal block, the number of preamble sequence combinations corresponding to the random access opportunity group, the number of contention-based preamble sequence combinations corresponding to the downlink signal block.

[0254] In some embodiments, the communication device 1200 further includes: a determining module 1203. The determining module 1203 is configured to determine the mapping relationship based on at least one of the number of downlink signal blocks corresponding to the random access opportunity group, the number of preamble sequence combinations corresponding to the random access opportunity group, and the number of contention-based preamble sequence combinations corresponding to the downlink signal block; or, the determining module 1203 is further configured to determine the mapping relationship based on at least one of the number of downlink signal blocks corresponding to the random access opportunity group, the total number of contention-based and non-contention-based random access preamble sequences, and the number of contention-based preamble sequences corresponding to the downlink signal block. The transmitting module 1202 is further configured to transmit a random access signal based on the mapping relationship.

[0255] In some embodiments, the determining module 1203 is further configured to, when the number of downlink signal blocks corresponding to a random access opportunity group is less than 1, determine the mapping relationship as: for any downlink signal block, map the downlink signal block to 1 / N consecutive random access opportunity groups, and for any one of the 1 / N consecutive random access opportunity groups, the downlink signal block corresponds to R consecutive contention-based preamble sequence combinations. The determining module 1203 is further configured to, when the number of downlink signal blocks corresponding to a random access opportunity group is greater than or equal to 1, determine the mapping relationship as: for any random access opportunity group, map N downlink signal blocks to the random access opportunity group, and for any one of the N downlink signal blocks, divide the N total preamble sequence combinations corresponding to the random access opportunity group into N parts (or equally divide them into N parts), and the N downlink signal blocks respectively correspond to R consecutive contention-based preamble sequence combinations in N parts. Wherein, N is the number of downlink signal blocks corresponding to the random access opportunity group, R is the number of contention-based preamble sequence combinations corresponding to the downlink signal block, and N total is the number of preamble sequence combinations corresponding to the random access opportunity group.

[0256] In some embodiments, the determining module 1203 is further configured to, when the number of downlink signal blocks corresponding to a random access opportunity group is less than 1, determine the mapping relationship as: for any downlink signal block, map the downlink signal block to 1 / N consecutive random access opportunity groups, and for any one of the 1 / N consecutive random access opportunity groups, at each random access opportunity in the random access opportunity group, the downlink signal block corresponds to R seq consecutive contention-based preambles. The determining module 1203 is further configured to, when the number of downlink signal blocks corresponding to a random access opportunity group is greater than or equal to 1, determine the mapping relationship as: for any random access opportunity group, map N downlink signal blocks to the random access opportunity group, and for any one of the N downlink signal blocks, divide the N total-seq contention-based and non-contention-based random access preamble sequences into N parts (or equally divide them into N parts), and at each RO in the RO group, the N downlink signal blocks respectively correspond to R seq consecutive contention-based preamble sequences.

[0257] In some embodiments, the determining module 1203 is further configured to determine the number of preamble sequence combinations corresponding to a random access opportunity group based on at least one of the number of preamble sequences used for preamble sequence combination, the number of preamble sequences included in a random access opportunity, and the number of random access opportunities included in a random access opportunity group.

[0258] In some embodiments, the determining module 1203 is further configured to determine the number of contention-based preamble sequence combinations corresponding to the downlink signal block based on at least one of the number of contention-based preamble sequences corresponding to the downlink signal block, the number of preamble sequences included in the random access opportunity, and the number of random access opportunities included in the random access opportunity group.

[0259] In some embodiments, within the mapping period in which the downlink signal block is mapped to the random access opportunity group, the downlink signal block is at least completely mapped to the random access opportunity group once.

[0260] In some embodiments, the mapping pattern period includes one or more mapping periods, and the mapping pattern period enables the pattern in which the downlink signal block is mapped to the random access opportunity group to repeat periodically.

[0261] In some embodiments, the random access format corresponding to the random access signal includes at least one preamble sequence, and each preamble sequence in the at least one preamble sequence repeats at least once in the random access format.

[0262] In some embodiments, the number of repetitions of each preamble sequence is the same. Alternatively, the number of repetitions of each preamble sequence is related to the position of each preamble sequence in the random access format. Alternatively, the number of repetitions of the first preamble sequence in the at least one preamble sequence is greater than or equal to 1, and the number of repetitions of the other preamble sequences in the at least one preamble sequence except the first preamble sequence is 1.

[0263] In some embodiments, the first preamble sequence in the at least one preamble sequence corresponds to a cyclic prefix, and the other preamble sequences in the at least one preamble sequence except the first preamble sequence do not have a cyclic prefix. Alternatively, all the preamble sequences in the at least one preamble sequence correspond to a cyclic prefix, where the cyclic prefix is located before the first preamble sequence in the at least one preamble sequence. Alternatively, each preamble sequence corresponds to a cyclic prefix. Alternatively, for any preamble sequence group in the at least one preamble sequence group, the first preamble sequence in the preamble sequence group corresponds to a cyclic prefix, and the other preamble sequences in the preamble sequence group except the first preamble sequence do not have a cyclic prefix. Wherein, the at least one preamble sequence group is obtained by grouping the at least one preamble sequence. Alternatively, for any preamble sequence group in the at least one preamble sequence group, the preamble sequence group corresponds to a cyclic prefix, where the cyclic prefix is located before the first preamble sequence in the preamble sequence group.

[0264] Figure 24 It is a schematic structural diagram of a communication device provided by an embodiment of the present disclosure Figure 2 , the communication device 1300 can be applied to a base station and execute the above Figure 21The communication method shown. As Figure 24 shown, the communication device 1300 includes: a sending module 1301 and a receiving module 1302.

[0265] The sending module 1301 is configured to send a configuration message, where the configuration message is used to indicate a mapping relationship between a downlink signal block and a random access opportunity group, and the random access opportunity group includes a plurality of random access opportunities. The receiving module 1302 is configured to receive and respond to a random access signal.

[0266] In some embodiments, the plurality of random access opportunities satisfy at least one of the following: the same frequency-domain resource, the same time-domain resource, including a plurality of PRACH frequency-domain resources, including a plurality of PRACH time-domain resources, corresponding to a plurality of uplink bandwidth parts of the same carrier, corresponding to multiple segments of spectrum of the same virtual carrier, corresponding to a plurality of carriers.

[0267] In some embodiments, the configuration message includes at least one of the following: the number of downlink signal blocks corresponding to the random access opportunity group, the total number of contention-based and non-contention-based random access preamble sequences, the number of preamble sequences used for preamble sequence combination, the number of contention-based preamble sequences corresponding to the downlink signal block, the number of preamble sequence combinations corresponding to the random access opportunity group, the number of contention-based preamble sequence combinations corresponding to the downlink signal block.

[0268] In some embodiments, the mapping relationship is determined based on at least one of the number of downlink signal blocks corresponding to the random access opportunity group, the number of preamble sequence combinations corresponding to the random access opportunity group, and the number of contention-based preamble sequence combinations corresponding to the downlink signal block; the mapping relationship is used to transmit a random access signal.

[0269] In some embodiments, the mapping relationship is determined based on at least one of the number of downlink signal blocks corresponding to the random access opportunity group, the total number of contention-based and non-contention-based random access preamble sequences, and the number of contention-based preamble sequences corresponding to the downlink signal block.

[0270] In some embodiments, when the number of downlink signal blocks corresponding to the random access opportunity group is less than 1, the mapping relationship is: for any downlink signal block, map the downlink signal block to 1 / N consecutive random access opportunity groups, and for any random access opportunity group in the 1 / N consecutive random access opportunity groups, the downlink signal block corresponds to R consecutive contention-based preamble sequence combinations. Alternatively, when the number of downlink signal blocks corresponding to the random access opportunity group is greater than or equal to 1, the mapping relationship is: for any random access opportunity group, map N downlink signal blocks to the random access opportunity group, and for any downlink signal block among the N downlink signal blocks, map the N totalThe combination of preamble sequences is divided into N parts (or equally divided into N parts), and N downlink signal blocks respectively correspond to R consecutive contention-based preamble sequence combinations in the N parts. Wherein, N is the number of downlink signal blocks corresponding to the random access opportunity group, R is the number of contention-based preamble sequence combinations corresponding to the downlink signal block, and N total is the number of preamble sequence combinations corresponding to the random access opportunity group.

[0271] In some embodiments, when the number of downlink signal blocks corresponding to the random access opportunity group is less than 1, the mapping relationship is: for any downlink signal block, the downlink signal block is mapped to 1 / N consecutive random access opportunity groups, and for any random access opportunity group in the 1 / N consecutive random access opportunity groups, in each random access opportunity of the random access opportunity group, the downlink signal block corresponds to R seq consecutive contention-based preamble sequences. Or, when the number of downlink signal blocks corresponding to the random access opportunity group is greater than or equal to 1, the mapping relationship is: for any random access opportunity group, N downlink signal blocks are mapped to the random access opportunity group, and for any downlink signal block in the N downlink signal blocks, the N total-seq contention-based and non-contention random access preamble sequences are divided into N parts (or equally divided into N parts), and on each RO in the RO group, the N downlink signal blocks respectively correspond to R seq consecutive contention-based preamble sequences.

[0272] In some embodiments, the number of preamble sequence combinations corresponding to the random access opportunity group is determined based on at least one of the number of preamble sequences used for preamble sequence combination, the number of preamble sequences included in the random access opportunity, and the number of random access opportunities included in the random access opportunity group.

[0273] In some embodiments, the number of contention-based preamble sequence combinations corresponding to the downlink signal block is determined based on at least one of the number of contention-based preamble sequences corresponding to the downlink signal block, the number of preamble sequences included in the random access opportunity, and the number of random access opportunities included in the random access opportunity group.

[0274] In some embodiments, within the mapping period in which the downlink signal block is mapped to the random access opportunity group, the downlink signal block is at least completely mapped to the random access opportunity group once.

[0275] In some embodiments, the mapping pattern period includes one or more mapping periods, and the mapping pattern period causes the pattern of mapping the downlink signal block to the random access opportunity group to repeat periodically.

[0276] In some embodiments, the random access format corresponding to the random access signal includes at least one preamble sequence, and each preamble sequence in the at least one preamble sequence is repeated at least once in the random access format.

[0277] In some embodiments, the number of repetitions of each preamble sequence is the same. Alternatively, the number of repetitions of each preamble sequence is related to the position of each preamble sequence in the random access format. Alternatively, the number of repetitions of the first preamble sequence in the at least one preamble sequence is greater than or equal to 1, and the number of repetitions of the other preamble sequences in the at least one preamble sequence except the first preamble sequence is 1.

[0278] In some embodiments, the first preamble sequence in the at least one preamble sequence corresponds to a cyclic prefix, and the other preamble sequences in the at least one preamble sequence except the first preamble sequence do not have a cyclic prefix. Alternatively, all the preamble sequences in the at least one preamble sequence correspond to a cyclic prefix, where the cyclic prefix is located before the first preamble sequence in the at least one preamble sequence. Alternatively, each preamble sequence corresponds to a cyclic prefix. Alternatively, for any preamble sequence group in the at least one preamble sequence group, the first preamble sequence in the preamble sequence group corresponds to a cyclic prefix, and the other preamble sequences in the preamble sequence group except the first preamble sequence do not have a cyclic prefix. Wherein, the at least one preamble sequence group is obtained by grouping the at least one preamble sequence. Alternatively, for any preamble sequence group in the at least one preamble sequence group, the preamble sequence group corresponds to a cyclic prefix, where the cyclic prefix is located before the first preamble sequence in the preamble sequence group.

[0279] In the case of implementing the functions of the above integrated module in the form of hardware, embodiments of the present disclosure provide another possible structure of the communication device involved in the above embodiments. As Figure 25 shown, the communication device 1400 includes: a processor 1402, a bus 1404. Optionally, the communication device may further include a memory 1401; in some embodiments, the communication device may further include a communication interface 1403.

[0280] The processor 1402 may be to implement or execute various exemplary logic blocks, modules, and circuits described in connection with the embodiments of the present disclosure. The processor 1402 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field-programmable gate array, or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It may implement or execute various exemplary logic blocks, modules, and circuits described in connection with the embodiments of the present disclosure. The processor 1402 may also be a combination that implements a computing function, such as a combination including one or more microprocessors, a combination of a DSP and a microprocessor, etc.

[0281] A communication interface 1403 for connecting to other devices via a communication network. The communication network may be an Ethernet, a radio access network, a wireless local area network (WLAN), etc.

[0282] The memory 1401 can be a read-only memory (ROM) or other types of static storage devices that can store static information and instructions, a random access memory (RAM) or other types of dynamic storage devices that can store information and instructions, or an electrically erasable programmable read-only memory (EEPROM), a magnetic disk storage medium or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.

[0283] As a possible implementation, the memory 1401 can exist independently of the processor 1402. The memory 1401 can be connected to the processor 1402 via a bus 1404 for storing instructions or program code. When the processor 1402 calls and executes the instructions or program code stored in the memory 1401, the communication method provided by the embodiments of the present disclosure can be implemented.

[0284] In another possible implementation, the memory 1401 can also be integrated with the processor 1402.

[0285] The bus 1404 can be an extended industry standard architecture (EISA) bus, etc. The bus 1404 can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 25 only a thick line is used to represent it in the figure, but it does not mean that there is only one bus or one type of bus.

[0286] Some embodiments of the present disclosure provide a computer-readable storage medium (e.g., a non-transitory computer-readable storage medium). Computer program instructions are stored in the computer-readable storage medium. When the computer program instructions run on a computer, the computer is caused to execute the communication method in any one of the above embodiments.

[0287] Exemplarily, the above computer-readable storage medium may include, but is not limited to: magnetic storage devices (such as hard disks, floppy disks, or magnetic tapes, etc.), optical disks (such as compact disks (CDs), digital versatile disks (DVDs), etc.), smart cards, and flash memory devices (such as erasable programmable read-only memories (EPROMs), cards, sticks, or key drives, etc.). The various computer-readable storage media described in this disclosure may represent one or more devices and / or other machine-readable storage media for storing information. The term "machine-readable storage medium" may include, but is not limited to, wireless channels and various other media capable of storing, containing, and / or carrying instructions and / or data).

[0288] An embodiment of the present disclosure provides a computer program product containing instructions. When the computer program product runs on a computer, it causes the computer to execute the communication method described in any one of the above embodiments.

[0289] As described above, the above are only the specific embodiments of the present disclosure, but the protection scope of the present disclosure is not limited thereto. Any changes or substitutions within the technical scope disclosed in the present disclosure should be covered by the protection scope of the present disclosure. Therefore, the protection scope of the present disclosure should be subject to the protection scope of the claims.

Claims

1. A communication method, characterized in that: Applied to a terminal, the method comprises: receiving a configuration message, the configuration message being used to indicate a mapping relationship between a downlink signal block and a random access opportunity group, the random access opportunity group including a plurality of random access opportunities; Based on the configuration message, a random access signal is transmitted.

2. The method according to claim 1, characterized in that The multiple random access opportunities satisfy at least one of the following: The frequency domain resources are the same; The time domain resources are the same; Contains multiple physical random access channel PRACH frequency domain resources; Contains multiple PRACH time domain resources; Corresponding to multiple uplink bandwidth parts of the same carrier; Multiple spectrum segments corresponding to the same virtual carrier; Corresponding to multiple carriers.

3. The method according to claim 1, characterized in that The configuration message includes at least one of the following: The number of downlink signal blocks corresponding to the random access opportunity group; The number of preamble sequences used for preamble sequence combination; The number of contention-based preamble sequences corresponding to the downlink signal block; The number of preamble sequence combinations corresponding to the random access opportunity group; The number of contention-based preamble code sequence combinations corresponding to the downlink signal block.

4. The method according to claim 3, characterized in that The transmitting a random access signal based on the configuration message includes: Determine the mapping relationship based on at least one of the number of downlink signal blocks corresponding to the random access opportunity group, the number of preamble code sequence combinations corresponding to the random access opportunity group, and the number of contention-based preamble code sequence combinations corresponding to the downlink signal block; Based on the mapping relationship, the random access signal is transmitted.

5. The method according to claim 4, characterized in that The determining the mapping relationship based on at least one of the number of downlink signal blocks corresponding to the random access opportunity group, the number of preamble code sequence combinations corresponding to the random access opportunity group, and the number of contention-based preamble code sequence combinations corresponding to the downlink signal block includes: In a case where the number of downlink signal blocks corresponding to the random access opportunity group is less than 1, determining the mapping relationship as follows: for any downlink signal block, mapping the downlink signal block to 1 / N consecutive random access opportunity groups, and for any random access opportunity group in the 1 / N consecutive random access opportunity groups, the downlink signal block corresponds to R consecutive contention-based preamble code sequence combinations; or, When the number of downlink signal blocks corresponding to the random access opportunity group is greater than or equal to 1, the mapping relationship is determined as follows: for any random access opportunity group, N downlink signal blocks are mapped to the random access opportunity group, and for any downlink signal block in the N downlink signal blocks, the N downlink signal blocks corresponding to the random access opportunity group are mapped to the random access opportunity group. total The preamble code sequence combinations are divided into N parts, and the N downlink signal blocks correspond to R consecutive contention-based preamble code sequence combinations in the N parts respectively; Wherein, N is the number of downlink signal blocks corresponding to the random access opportunity group, R is the number of contention-based preamble code sequence combinations corresponding to the downlink signal block, and N total is the number of preamble code sequence combinations corresponding to the random access opportunity group.

6. The method according to claim 3, characterized in that The method further comprises: The number of preamble sequence combinations corresponding to the random access opportunity group is determined based on at least one of the number of preamble code sequences used for preamble code sequence combination, the number of preamble code sequences included in the random access opportunity, and the number of random access opportunities included in the random access opportunity group.

7. The method according to claim 3, characterized in that The method further comprises: The number of contention-based preamble code sequence combinations corresponding to the downlink signal block is determined based on at least one of the number of contention-based preamble code sequences corresponding to the downlink signal block, the number of preamble code sequences included in the random access opportunities, and the number of random access opportunities included in the random access opportunity group.

8. The method according to claim 1, characterized in that Within a mapping period in which the downlink signal block is mapped to the random access opportunity group, the downlink signal block is completely mapped to the random access opportunity group at least once.

9. The method according to claim 8, characterized in that The mapping pattern period includes one or more mapping periods, and the mapping pattern period enables the mapping of the downlink signal block to the random access opportunity group to repeat in a pattern periodic manner.

10. The method according to claim 1, characterized in that The random access format corresponding to the random access signal includes at least one preamble code sequence, and each preamble code sequence in the at least one preamble code sequence is repeated at least once in the random access format.

11. The method according to claim 10, characterized in that The number of repetitions of each preamble sequence is the same; or, The number of repetitions of each preamble code sequence is related to the position of each preamble code sequence in the random access format; or, The number of repetitions of a first preamble code sequence in the at least one preamble code sequence is greater than or equal to 1, and the number of repetitions of other preamble code sequences in the at least one preamble code sequence except the first preamble code sequence is 1.

12. The method according to claim 10, characterized in that The first preamble sequence in the at least one preamble sequence corresponds to a cyclic prefix, and other preamble sequences in the at least one preamble sequence except the first preamble sequence have no cyclic prefix; or All preamble code sequences in the at least one preamble code sequence correspond to a cyclic prefix, wherein the cyclic prefix is ​​located before the first preamble code sequence in the at least one preamble code sequence; or, Each preamble sequence corresponds to a cyclic prefix; or, For any preamble code sequence group in at least one preamble code sequence group, a first preamble code sequence in the preamble code sequence group corresponds to a cyclic prefix, and other preamble code sequences in the preamble code sequence group except the first preamble code sequence have no cyclic prefix; the at least one preamble code sequence group is obtained by grouping the at least one preamble code sequence; or, For any preamble code sequence group in at least one preamble code sequence group, the preamble code sequence group corresponds to a cyclic prefix, wherein the cyclic prefix is ​​located before the first preamble code sequence in the preamble code sequence group.

13. A communication method, characterized in that: Applied to a base station, the method comprises: Sending a configuration message, where the configuration message is used to indicate a mapping relationship between a downlink signal block and a random access opportunity group, where the random access opportunity group includes a plurality of random access opportunities; Receive and respond to random access signals.

14. The method according to claim 13, characterized in that The multiple random access opportunities satisfy at least one of the following: The frequency domain resources are the same; The time domain resources are the same; Contains multiple physical random access channel PRACH frequency domain resources; Contains multiple PRACH time domain resources; Corresponding to multiple uplink bandwidth parts of the same carrier; Multiple spectrum segments corresponding to the same virtual carrier; Corresponding to multiple carriers.

15. The method according to claim 13, characterized in that The configuration message includes at least one of the following: The number of downlink signal blocks corresponding to the random access opportunity group; The number of preamble sequences used for preamble sequence combination; The number of contention-based preamble sequences corresponding to the downlink signal block; The number of preamble sequence combinations corresponding to the random access opportunity group; The number of contention-based preamble code sequence combinations corresponding to the downlink signal block.

16. The method according to claim 15, characterized in that The mapping relationship is determined based on at least one of the number of downlink signal blocks corresponding to the random access opportunity group, the number of preamble code sequence combinations corresponding to the random access opportunity group, and the number of contention-based preamble code sequence combinations corresponding to the downlink signal block; and the mapping relationship is used to transmit the random access signal.

17. The method according to claim 16, characterized in that In a case where the number of downlink signal blocks corresponding to the random access opportunity group is less than 1, the mapping relationship is: for any downlink signal block, the downlink signal block is mapped to 1 / N consecutive random access opportunity groups, and for any random access opportunity group in the 1 / N consecutive random access opportunity groups, the downlink signal block corresponds to R consecutive contention-based preamble code sequence combinations; or, When the number of downlink signal blocks corresponding to the random access opportunity group is greater than or equal to 1, the mapping relationship is: for any random access opportunity group, N downlink signal blocks are mapped to the random access opportunity group, and for any downlink signal block in the N downlink signal blocks, the N downlink signal blocks corresponding to the random access opportunity group are mapped to the random access opportunity group. total The preamble code sequence combinations are divided into N parts, and the N downlink signal blocks correspond to R consecutive contention-based preamble code sequence combinations in the N parts respectively; Wherein, N is the number of downlink signal blocks corresponding to the random access opportunity group, R is the number of contention-based preamble code sequence combinations corresponding to the downlink signal block, and N total is the number of preamble code sequence combinations corresponding to the random access opportunity group.

18. The method according to claim 15, characterized in that The number of preamble sequence combinations corresponding to the random access opportunity group is determined based on at least one of the number of preamble sequences used for preamble sequence combination, the number of preamble sequences included in the random access opportunity, and the number of random access opportunities included in the random access opportunity group.

19. The method according to claim 15, characterized in that The number of contention-based preamble code sequence combinations corresponding to the downlink signal block is determined based on at least one of the number of contention-based preamble code sequences corresponding to the downlink signal block, the number of preamble code sequences included in the random access opportunity, and the number of random access opportunities included in the random access opportunity group.

20. The method according to claim 13, characterized in that Within a mapping period in which the downlink signal block is mapped to the random access opportunity group, the downlink signal block is completely mapped to the random access opportunity group at least once.

21. The method according to claim 20, characterized in that The mapping pattern period includes one or more mapping periods, and the mapping pattern period enables the mapping pattern of the downlink signal block to be mapped to the random access opportunity group to be repeated periodically.

22. The method according to claim 13, characterized in that The random access format corresponding to the random access signal includes at least one preamble code sequence, and each preamble code sequence in the at least one preamble code sequence is repeated at least once in the random access format.

23. The method according to claim 22, characterized in that The number of repetitions of each preamble sequence is the same; or, The number of repetitions of each preamble code sequence is related to the position of each preamble code sequence in the random access format; or, The number of repetitions of a first preamble code sequence in the at least one preamble code sequence is greater than or equal to 1, and the number of repetitions of other preamble code sequences in the at least one preamble code sequence except the first preamble code sequence is 1.

24. The method according to claim 22, characterized in that The first preamble sequence in the at least one preamble sequence corresponds to a cyclic prefix, and other preamble sequences in the at least one preamble sequence except the first preamble sequence have no cyclic prefix; or All preamble code sequences in the at least one preamble code sequence correspond to a cyclic prefix, wherein the cyclic prefix is ​​located before the first preamble code sequence in the at least one preamble code sequence; or, Each preamble sequence corresponds to a cyclic prefix; or, For any preamble code sequence group in at least one preamble code sequence group, a first preamble code sequence in the preamble code sequence group corresponds to a cyclic prefix, and other preamble code sequences in the preamble code sequence group except the first preamble code sequence have no cyclic prefix; the at least one preamble code sequence group is obtained by grouping the at least one preamble code sequence; or, For any preamble code sequence group in at least one preamble code sequence group, the preamble code sequence group corresponds to a cyclic prefix, wherein the cyclic prefix is ​​located before the first preamble code sequence in the preamble code sequence group.

25. A communication device, characterized in that: include: Memory and processor; Memory and processor coupling; The memory is used to store instructions executable by the processor; When the processor executes the instructions, the method according to any one of claims 1 to 24 is performed.

26. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and when the computer instructions are executed on a computer, the computer is enabled to execute the method according to any one of claims 1 to 24.

27. A computer program product, characterized in that The computer program product comprises computer program instructions which, when executed, implement the method according to any one of claims 1 to 24.

Images