Wireless communication method and device for physical random access channel, and computer readable medium

Abstract

A wireless communication method is disclosed. A wireless communication method includes: determining a synchronization signal block (SSB) for a RACH procedure; and determining an RO set according to the determined SSB to transmit the PRACH for at least two times. Another method of wireless communication includes receiving at least two PRACHs from a user equipment (UE), where the PRACHs are transmitted on an RO set determined by the UE according to a synchronization signal block (SSB) for a RACH procedure; and transmitting a response message in response to the PRACH.

Description

Technical Field

[0001] The present disclosure generally relates to PRACH transmission, and more particularly, to PRACH transmission for random access or handover procedures. Background Art

[0002] Wireless communication technology is a key component of an increasingly interconnected global communication network. Wireless communication relies on precisely allocated time and frequency resources for transmitting and receiving wireless signals. The PRACH (Physical Random Access Channel) is used by a user equipment (UE) to request uplink allocation from a base station (BS). In the physical channel during an initial random access (RA) or handover procedure, the PRACH is a potential coverage bottleneck channel. Summary of the Invention

[0003] This summary is a brief description of certain aspects of the present disclosure. It is not intended to limit the scope of the present disclosure.

[0004] According to one or more embodiments of the present disclosure, a wireless communication method is disclosed. The method includes: determining a synchronization signal block (SSB) for a RACH process; and determining a RO set according to the determined SSB to transmit the PRACH at least twice.

[0005] According to one or more embodiments of the present disclosure, a wireless communication method is disclosed. The method includes: receiving at least twice the PRACH from a user equipment (UE), where the PRACH is transmitted on a RO set determined by the UE according to a synchronization signal block (SSB) for a RACH process; and transmitting a response message in response to the PRACH.

[0006] Another embodiment of the present disclosure provides a wireless communication device, including a memory storing one or more programs and a processor, the processor being electrically coupled to the memory and configured to implement one or more programs to execute any method or step or a combination thereof in the present disclosure.

[0007] Another embodiment of the present disclosure provides a non - transitory computer - readable storage medium storing one or more programs, the one or more programs being configured to cause execution of any method or step or a combination thereof in the present disclosure when executed by a processor.

[0008] The above and other aspects and their implementations are described in more detail in the drawings, the description, and the claims. Brief Description of the Drawings

[0009] Various exemplary embodiments of the present disclosure are described in detail below with reference to the following drawings. The drawings are provided for illustrative purposes only and depict only the exemplary embodiments of the present disclosure to facilitate understanding of the present disclosure. Therefore, the drawings should not be considered as limiting the breadth, scope, or applicability of the present disclosure. It should be noted that these drawings are not necessarily drawn to scale for clarity and ease of illustration.

[0010] Figure 1 An exemplary wireless communication system is shown, which is capable of implementing the methods and / or steps in the present disclosure;

[0011] Figure 2 The RACH procedure is illustrated;

[0012] Figures 3 to 8 The RO arrangement according to an embodiment of the present disclosure is illustrated; and

[0013] Figure 9 The RO selection performed by the UE for PRACH transmission is shown. Detailed Description of the Invention

[0014] Figure 1 A block diagram of an exemplary wireless communication system 150 according to some embodiments of the present disclosure is illustrated. The system 150 may perform various methods / steps disclosed in the present disclosure. The system 150 may include components and elements configured to support operational features that need not be described in detail herein.

[0015] The system 150 may include a base station (BS) 102 and a user equipment (UE) 104. The BS 102 includes a BS transceiver or transceiver module 152, a BS antenna system 154, a BS memory or memory module 156, a BS processor or processor module 158, and a network interface 160. The components of the BS 102 may be electrically coupled and communicate with each other via a data communication bus 180 as needed. Similarly, the UE 104 includes a UE transceiver or transceiver module 162, a UE antenna system 164, a UE memory or memory module 166, a UE processor or processor module 168, and an I / O interface 169. The components of the UE 104 may be electrically coupled and communicate with each other via a data communication bus 190 as needed. The BS 102 communicates with the UE 104 via a communication channel 192, which may be any wireless channel or other medium known in the art suitable for data transmission as described herein.

[0016] As understood by those of ordinary skill in the art, the system 150 may further include in addition to Figure 1Any number of modules outside the module shown. Those of ordinary skill in the art will understand that the various illustrative blocks, modules, circuits, and processing logics described in connection with the embodiments disclosed herein can be implemented in hardware, computer-readable software, firmware, or any practical combination thereof. To clearly illustrate this interchangeability and compatibility of hardware, firmware, and software, the various illustrative components, blocks, modules, circuits, and steps are generally described in terms of their functions. Whether this function is implemented as hardware, firmware, or software depends on the particular application and the design constraints imposed on the overall system. Persons familiar with the concepts described herein can implement this function in a suitable manner for each particular application, but such implementation decisions should not be construed as limiting the scope of the present disclosure.

[0017] The wireless transmission from the transmit antenna of UE 104 (for convenience, referred to in the singular but may include multiple antennas) to the receive antenna of BS 102 (for convenience, referred to in the singular but may include multiple antennas) is referred to as an uplink (UL) transmission, and the wireless transmission from the transmit antenna of BS 102 to the receive antenna of UE 104 is referred to as a downlink (DL) transmission. According to some embodiments, the UE transceiver 162 can be referred to herein as an "uplink" transceiver 162, which includes an RF transmitter and receiver circuit each coupled to the UE antenna 164. A duplex switch (not shown) can alternatively couple the uplink transmitter or receiver to the uplink antenna in a time-division duplex manner. Similarly, according to some embodiments, the BS transceiver 152 can be referred to herein as a "downlink" transceiver 152, which includes an RF transmitter and receiver circuit each coupled to the antenna array 154. The downlink duplex switch can alternatively couple the downlink transmitter or receiver to the downlink antenna array 154 in a time-division duplex manner. The operations of the two transceivers 152 and 162 are coordinated in time such that while the downlink transmitter is coupled to the downlink antenna array 154, the uplink receiver is coupled to the uplink UE antenna 164 for receiving transmissions on the wireless communication channel 192. There may be a tight synchronization timing with only a minimum guard time between changes in the duplex direction. The UE transceiver 162 communicates with the BS 102 via the UE antenna 164 through the wireless communication channel 192. The BS transceiver 152 communicates with other BSs (e.g., the second BS 102-2) via the BS antenna 154 of the BS (e.g., the first BS 102) through the wireless communication channel 192. The wireless communication channel 196 can be any wireless channel or other medium known in the art suitable for direct communication between BSs.

[0018] UE transceiver 162 and BS transceiver 152 are configured to communicate via a wireless data communication channel 192 and cooperate with a suitably configured RF antenna device 154 / 164 capable of supporting a specific wireless communication protocol and modulation scheme. In some exemplary embodiments, UE transceiver 162 and BS transceiver 152 are configured to support industry standards such as Long-Term Evolution (LTE) and 5G standards (e.g., NR). However, it should be understood that the present invention need not be limited in application to specific standards and related protocols. Instead, UE transceiver 162 and BS transceiver 152 may be configured to support alternative or additional wireless data communication protocols, including future standards or variants thereof.

[0019] Processor modules 158 and 168 may be implemented or realized using a general-purpose processor, a content-addressable memory, a digital signal processor, an application-specific integrated circuit, a field-programmable gate array, any suitable programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. In this manner, the processor modules may be implemented as a microprocessor, a controller, a microcontroller, a state machine, etc. The processor modules may also be implemented as a combination of computing devices, such as a combination of a digital signal processor and a microprocessor, multiple microprocessors, one or more microprocessors in conjunction with a digital signal processor core, or any other such configuration.

[0020] In addition, the steps of the methods or algorithms described in connection with the embodiments disclosed herein may be embodied directly in hardware, firmware, software modules executed respectively by processor modules 158 and 168, or any practical combination thereof. Memory modules 156 and 166 may be implemented as RAM memory, flash memory, EEPROM memory, registers, ROM memory, EPROM memory, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. In this regard, memory modules 156 and 166 may be respectively coupled to processor modules 158 and 168 such that processor modules 158 and 168 can respectively read information from and write information to memory modules 156 and 166. Memory modules 156 and 166 may also be integrated into their respective processor modules 158 and 168. In some embodiments, memory modules 156 and 166 may each include a cache memory for storing temporary variables or other intermediate information during the execution of instructions to be respectively executed by processor modules 158 and 168. Memory modules 156 and 166 may also each include non-volatile memory for storing instructions to be respectively executed by processor modules 158 and 168.

[0021] The network interface 160 generally represents the hardware, software, firmware, processing logic, and / or other components of the base station 102 that enable two-way communication between the BS transceiver 152 and other network components and communication nodes configured to communicate with the BS 102. For example, the network interface 160 may be configured to support Internet or WiMAX traffic. In a typical non-limiting deployment, the network interface 160 provides an 802.3 Ethernet interface, enabling the BS transceiver 152 to communicate with a traditional Ethernet-based computer network. In this way, the network interface 160 may include a physical interface for connecting to a computer network (e.g., a mobile switching center (MSC)) or one or more core networks for mobile communication. The terms "configured for" or "configured to" used herein with respect to a specified operation or function mean that a device, component, circuit, structure, machine, signal, etc. is physically constructed, programmed, formatted, and / or arranged to perform the specified operation or function. The network interface 160 may allow the BS 102 to communicate with other BSs or CNs via a wired or wireless connection.

[0022] The random access (RACH) procedure establishes a connection between the BS and the UE. For example, there are two types of RACH procedures, the contention-based RACH procedure (CBRA) and the contention-free RACH procedure (CFRA). In the contention-based RACH as Figure 2 shown, there are four messages transmitted between the BS and the UE. The first message is Msg1, which includes a PRACH preamble. For example, the UE may find one or more good (or best) beams during the synchronization process, and the UE may use that beam and attempt the random access procedure by transmitting a RACH preamble (Msg1) on the configured RACH resource (RO, RACH occasion). The preamble may be referred to as a random access preamble Id (RAPID). The second message is the RAR (random access response) sent from the BS to the UE in response to Msg1. The third message is the PUSCH sent from the UE to the BS. The fourth message Msg4 is the contention resolution message from the BS to the UE.

[0023] In the contention-free RACH, the BS will first send a RACH preamble (PRACH) allocation as a preliminary signal, for example, via RRC configuration. Then, the UE will send the first message including the RACH preamble (PRACH). In response, the BS will send a RA response to the UE.

[0024] The transmission of the PRACH has become a bottleneck in this field, and one of the solutions is to implement a PRACH repetition mechanism. Thus, the same or compensated PRACH can be transmitted multiple times. The resource arrangement for PRACH transmission is discussed below in this disclosure. The exemplary embodiments disclosed herein may be applied to, for example, the CBRA or CFRA procedures.

[0025] According to one or more embodiments of the present disclosure, a method of defining a PRACH occasion (RO) set for multiple PRACH transmissions is discussed.

[0026] As described above, PRACH can be transmitted twice or more times to improve transmission quality. There may be more than one RO used to transmit repetitions of PRACH. A group of ROs used for multiple PRACH transmissions can be defined as an RO set. The repetition factor can be used to indicate the number of times a PRACH with repetitions will be transmitted. For example, a repetition factor of 4 means that the PRACH will be transmitted four times (and exemplarily on four ROs). For example, for each PRACH transmission with a repetition factor of N (i.e., with N PRACH repetitions), N ROs can be selected from the RO set. In some examples, the RO set is bound to the repetition factor. In this example, each RO set for a repetition factor of N contains N or more valid ROs. Therefore, the UE can select an RO set, and the UE can also select at least a portion of the ROs for multiple PRACH transmissions.

[0027] In some examples, the number of valid ROs in an RO set may be equal to the corresponding repetition factor of the PRACH. In this case, the UE can select all valid ROs for multiple PRACH transmissions. In some other examples, the number of valid ROs in an RO set is greater than the repetition factor, and the UE can select a portion of the valid ROs according to a predefined rule for multiple PRACH transmissions. For example, the predefined rule may require the UE to select the first few (one or more) valid ROs or the last few (one or more) valid ROs in the RO set.

[0028] There are different methods to define the relationship between a valid RO and a RO set. That is, a valid RO included in a RO set may be determined according to the examples discussed below or a combination thereof.

[0029] Example 1

[0030] According to the time domain resource and frequency domain resource configuration for PRACH transmission, Figure 3The example RO shown can be determined as a valid RO. Then, an example association between the valid RO and the SSB can be established according to some predefined rules. These ROs will be sequentially assigned to different SSBs according to their indexes based on the time slots where the ROs are located. In each specific time slot, the ROs will be assigned in order according to their respective frequency positions. For example, the assignment can be first performed in ascending order of the frequency resource indexes of the ROs that are frequency-division multiplexed (FDMed), so the ROs are associated with the SSBs in order. Secondly, the ROs that are time-division multiplexed (TDMed) within the PRACH time slot are assigned in ascending order of their time resource indexes. Thirdly, the ROs are assigned in ascending order of the indexes of the PRACH time slots. The actual SSB for transmission can be configured through RRC signaling, such as ssb-PositionsInBurst. For example, there are four candidate SSBs, namely SSB0 to SSB3, and the base station can select at least a part of them for transmission, which can be referred to as the actually transmitted SSB. In this example, SSB1, SSB2, and SSB3 are actually transmitted by the base station.

[0031] For example, in Figure 3 , RO1 - RO4 are in the same time slot but different frequency domains. In Figure 3 and the similar figure shown, the horizontal axis represents the time domain and the vertical axis represents the frequency domain. Different blocks indicate PRACH time slots. As Figure 3 shown, RO1 - RO4 will be sequentially associated with SSB1 - SSB3 in order according to their frequency position domains. Therefore, RO1 is associated with SSB1; RO2 is associated with SSB2; RO3 is associated with SSB3; at the end of the first cycle, RO4 is associated with SSB1 again in a new cycle. Then, the association processing can be performed on the ROs in the subsequent time slots where RO5 - RO8 are located. Repeating the same logic, the association between the valid RO and the actually transmitted SSB can be listed in Table 1 below. The valid ROs associated with an SSB can be referred to as the valid RO list. For example, the valid RO list of SSB1 contains RO1, RO4, RO7, RO10, RO13, RO16.

[0032] Table 1

[0033] Actually transmitted SSB Associated valid RO list SSB1 RO1, RO4, RO7, RO10, RO13, RO16 SSB2 RO2, RO5, RO8, RO11, RO14 SSB3 RO3, RO6, RO9, RO12, RO15

[0034] To form an RO set with repeated PRACH transmissions, if valid ROs satisfy one or more of the following conditions to form an RO set, an RO set can be obtained by selecting N valid ROs from the associated list of valid ROs, where N is the repetition factor of the RO set. The UE and / or BS can perform all or some of the steps disclosed herein to form an RO set. Referring to Table 1, the selection of valid ROs for the RO set starts from the RO with the lower index, and if one or more of the following conditions are met, valid ROs can be selected for the same RO set:

[0035] Condition 1: The valid RO is associated with the same SSB;

[0036] Condition 2: The valid ROs are in different time domain positions; and / or

[0037] Condition 3: The valid ROs have the same frequency domain position.

[0038] Once ROs are selected for a specific RO set, the selected ROs can be excluded from the list of candidates for the remainder of the RO set. Thus, the selected ROs will not be selected from another RO set.

[0039] The above selection steps can be repeatedly executed to select one or more subsequent RO sets until the remaining valid RO(s) in the associated list of valid ROs cannot form a new candidate RO set for PRACH transmission. That is, the RO set for transmitting PRACH will satisfy one or more of the above Conditions 1 - 3.

[0040] For example, assume that the repetition factor or the number of valid ROs in the RO set is 2. For SSB1, the associated list of valid ROs contains {RO1, RO4, RO7, RO10, RO13, RO16}, as shown in Table 1. RO1 and RO13 can be selected first because they satisfy all the above conditions to form an RO set. RO1 and RO13 will be excluded from the candidate list to form the remaining RO set. Then, RO4 and RO16 can be selected by repeatedly executing the above method to form another RO set. The remaining valid ROs in the list are RO7 and RO10 of SSB1. They cannot form an RO set because they do not satisfy the conditions (because they do not have the same frequency domain).

[0041] In another example, if after performing the above process, the number of remaining valid ROs in the list is still greater than or equal to the repetition factor, the first N remaining valid ROs can form another RO set until the number of remaining valid ROs in the list is less than the repetition factor.

[0042] In some examples, the conditions for selecting eligible ROs for an RO set may include only Condition 1 and Condition 2. Then, RO1 and RO7 can be selected to form an RO set. Then RO4 and RO10 can be selected to form another RO set. Finally, the remaining valid ROs cannot form an RO set because they do not meet the conditions.

[0043] Example 2

[0044] Alternatively or additionally, Figure 4 the shown ROs can be determined as valid ROs. As Figure 4 shown, these valid ROs can first be divided into different RO sets. For example, assume that the repetition factor or the number of valid ROs in an RO set is 2, and the number of ROs in the RO set is determined based on the repetition factor. Then, two consecutive TDM-ed valid ROs are defined as an RO set. For example, two ROs located in the same frequency domain and in two closest time slots can be associated together to form an RO set. Note that there may be a time slot gap between the two time slots of the associated ROs. Then, the RO sets can first be classified or sorted in ascending order according to the corresponding frequency positions that are to provide indexes for the RO sets to be FDM-ed (frequency domain multiplexed). Second, the RO sets can be classified or sorted in ascending order of the time resource indexes of the RO sets that are TDM-ed (time domain multiplexed). That is, the RO sets on the overlapping time domain (such as Figure 4 RO set1 to RO set4 in) will be indexed in order according to their frequency positions. Then, the RO sets at subsequent time domain positions (such as RO set5 to RO set8) can be indexed in order in the same way starting from the index after the last index of the RO sets in the previous time slot.

[0045] Alternatively or additionally, as Figure 5 shown, another indexing method can be implemented. Here, the RO sets can first be sorted in ascending order of the time resource indexes of the RO sets that are TDM-ed. Second, the RO sets can be sorted in ascending order of the frequency resource indexes of the RO sets that are FDM-ed. For example, as Figure 5 shown, the RO sets in the same frequency domain (such as RO set1 and RO set2) can first be indexed according to their time domain positions. Then, the RO sets at the next frequency position (RO set3 and RO set4) are indexed in order according to the time domain positions. Repeating the same method, the remaining RO sets (RO set5 to RO set8) can be indexed.

[0046] After grouping and indexing the valid ROs, the indexed RO sets can be associated with the SSBs in sequence according to their indexes (RO set1 to RO set8). For example, as shown in Table 2 below, RO set1 is associated with SSB0; then RO set2 is associated with SSB1; RO set3 is associated with SSB3; RO set4 is associated with SSB0 again, and so on. It is assumed here that the actually transmitted SSBs are SSB0, SSB1, and SSB3.

[0047] Table 2

[0048] Actually transmitted SSB Associated RO set list SSB0 RO set1, RO set4, RO set7 SSB1 RO set2, RO set5, RO set8 SSB3 RO set3, RO set6

[0049] Example 3

[0050] According to one or more embodiments, an RO set can be obtained by adding one or more additional ROs and grouping the additional ROs with the existing ROs to form an RO set. In addition, the RO set can be associated with an SSB that is associated with the existing ROs in the RO set.

[0051] For example, Figure 6 The shown RO1 to RO8 can be existing ROs (such as regular ROs without repetition for PRACH transmission). These valid ROs can have their associated SSBs. For example, Table 3 shows an exemplary association between the SSBs and ROs (RO1 to RO8) used for transmitting PRACH. For example, RO1, RO4, and RO7 are associated with SSB0.

[0052] Table 3

[0053] Actually transmitted SSB Associated RO list SSB0 RO1, RO4, RO7 SSB1 RO2, RO5, RO8 SSB3 RO3, RO6

[0054] To obtain an RO set for PRACH transmission with repetition, a certain number of additional ROs can be introduced. As Figure 7 shown, at the next time slot of the existing ROs, each existing RO is added with an additional RO (filled with a slash pattern). The added additional ROs can have the same frequency position but have different time slots from the existing ROs associated with the corresponding additional ROs. In this case, assuming the repetition factor or number of valid ROs in the RO set is 2, for each valid RO configured by signaling, one additional RO can be introduced to form an RO set. For another example, if the repetition factor or number of valid ROs in an RO set is 4, then for each configured valid RO, there can be three additionally introduced ROs; then, the RO set will be formed by three additional ROs and one configured valid RO. Therefore, the number of ROs to be introduced is determined according to the repetition factor and / or number of ROs in the RO set.

[0055] Additionally or alternatively, the time-frequency resources of additional ROs can be obtained based on the time-frequency resources of the configured existing ROs. For example, the time-frequency resources of the added ROs can be determined by shifting the time-frequency resources of the existing ROs in the time domain or the frequency domain. As Figure 7 shown, the time-frequency resources of additional ROs are obtained by shifting the time-frequency resources of the configured ROs by one time unit. This time unit can be one or more time slots, sub-frames, half-frames, frames, or milliseconds.

[0056] Additionally or alternatively, different existing ROs can be combined with different numbers of additional ROs to form RO sets. As Figure 8 shown, for the existing RO1 to RO4, one additional RO is introduced for each of these existing ROs. Then, RO sets 1 to RO sets 4 are formed, and each RO set includes two ROs. Therefore, these ROs can correspond to the case where the repetition factor is equal to 2. For the existing RO5 to RO8, three additional ROs are introduced for each of these existing ROs. Then, RO sets 5 to RO sets 8 are formed by four ROs. Therefore, these ROs can correspond to the case where the repetition factor is equal to 4.

[0057] Different ROs can be obtained through different RRC configurations. Alternatively, all ROs can be obtained via a single RRC configuration, and additional information or rules can be used to distinguish different existing ROs associated with different numbers of additional ROs. For example, the rule can be defined as follows: ROs at different time domain positions can be associated with different repetition factors in the cyclic pattern. In Figure 8 this case, two different repetition factors, such as 2 and 4, are supported in this cell. Then, for the ROs in the first time domain position, i.e., RO 1 to RO 4, they will be associated with the repetition factor 2. For the ROs in the first time domain position, i.e., RO 5 to RO 8, they will be associated with the repetition factor 4. Then, for the ROs in the third time domain position (the time domain position immediately following RO set5 - RO set8), they will be associated with the repetition factor 2 again.

[0058] The association between the RO set and the actually transmitted SSB can follow the association of the pre-existing ROs in the corresponding RO set as shown in Table 4. Therefore, the additional ROs have the same association relationship as the pre-existing ROs in the same RO set. For example, according to the association of the pre-existing RO with SSB0, RO set1 is associated with SSB0.

[0059] Table 4

[0060] Actually transmitted SSB Associated RO set list SSB0 RO set1, RO set4, RO set7 SSB1 RO set2, RO set5, RO set8 SSB3 RO set3, RO set6

[0061] To determine which RO sets can be used for transmitting a PRACH with transmissions, some RO sets with one or more conflicting ROs can be excluded from the candidates. Alternatively or additionally, conflicting ROs can be individually excluded from the candidates for PRACH transmission. An exemplary method is described below.

[0062] In some examples, if at least one RO in an RO set conflicts with another transmission, no RO in that RO set can be used for PRACH transmission. For example, other transmissions that may conflict with PRACH transmission can be at least one of SSB, a control resource set configured for a Type0-PDCCH CSS (common search space) set, PDCCH (physical downlink control channel), PDSCH (physical downlink shared channel), or CSI-RS (channel state information reference signal) reception, DL PRS (downlink positioning reference signal) reception.

[0063] Alternatively or additionally, in some examples, the above exclusion only applies to RO sets corresponding to a PRACH repetition factor equal to or greater than a threshold (such as 2). Thus, for an RO set corresponding to a repetition factor equal to or greater than a threshold (e.g., 2), if at least one RO in the RO set conflicts with another transmission, no RO in that RO set can be used for PRACH transmission. Potential conflicting transmissions have been listed above as examples. The threshold can be predefined between the UE and the BS or configured via RRC (radio resource control) signaling. For a repetition factor equal to or greater than a predefined threshold, one PRACH attempt will occupy too many resources. Therefore, the priority of PRACH transmissions with a relatively large number of repetitions can be appropriately reduced.

[0064] Alternatively or additionally, in some examples, the above exclusion only applies to RO sets corresponding to a PRACH repetition factor equal to or less than a threshold (such as 2). Thus, for an RO set corresponding to a repetition factor equal to or less than a threshold (e.g., 2), if at least one RO in the RO set conflicts with another transmission, no RO in that RO set can be used for PRACH transmission. Potential conflicting transmissions have been listed above as examples. The threshold can be predefined between the UE and the BS or configured via RRC signaling. When the repetition factor is equal to or less than a certain threshold, after one of the ROs conflicts, the remaining resources in that RO set may not be sufficient to meet the performance requirements of PRACH transmission. Therefore, the entire RO set can be discarded.

[0065] Alternatively or additionally, in some examples, conflicting ROs can be excluded individually, and the above exclusion only applies when the conflicting RO in the RO set is not the first RO in its RO set. For example, if the conflicting RO is not the first RO in the RO set and if the conflicting RO conflicts with another transmission, then the conflicting RO cannot be used for PRACH transmission. For the first RO in the RO set, if it conflicts with another transmission, the first RO can still be used for PRACH transmission because the exclusion only applies to the remaining ROs in the RO set (if there are conflicts). That is, the other transmission(s) conflicting with the first RO will be cancelled for transmission or reception operations. Potential conflicting transmissions have been listed above as examples. In these examples, the first RO can be used by a legacy UE for a single PRACH transmission, so the first RO in the RO set can have a higher priority than other ROs.

[0066] Here, the conflict between an RO and another transmission includes, for example, the overlap of at least one symbol or at least one resource element (RE). Alternatively or additionally, the conflict can also include that the time-domain gap between the resources for the RO and the conflicting transmission is less than a predefined threshold. By the above method, the conflict between an RO and another transmission can be effectively managed, thereby improving the overall system efficiency and ensuring that more available resources are used for high-priority uplink services.

[0067] According to one or more embodiments, if the resources of at least one RO in the RO set are indicated as cancelled resources by UL (uplink) cancellation signaling or are indicated as DL (downlink) resources or flexible resources by SFI (slot format indicator), then no RO in the RO set can be used for PRACH transmission. Therefore, the PRACH transmission on this RO set should be cancelled. The UL cancellation signaling can be DCI (downlink control information) format, such as DCI format 2_4, for indicating UL cancellation resources.

[0068] Alternatively or additionally, in some examples, the above exclusion only applies to RO sets corresponding to a repetition factor equal to or greater than a predefined threshold. For an RO set corresponding to a repetition factor equal to or greater than the threshold (e.g., 2), if the resources of at least one RO in the RO set are indicated as cancelled resources by UL cancellation signaling or are indicated as DL resources or flexible resources by SFI, then no RO in the RO set can be used for PRACH transmission. Thus, the PRACH transmission on this RO set can be cancelled. The threshold can be predefined among system providers or configured via RRC signaling. For a repetition factor equal to or greater than the predefined threshold, one PRACH attempt will occupy too many resources. Therefore, the priority of PRACH transmissions with a relatively large number of repetitions can be appropriately reduced.

[0069] Alternatively or additionally, in some examples, the above exclusion only applies to RO sets corresponding to repetition factors equal to or less than a predefined threshold. For an RO set corresponding to a repetition factor equal to or less than a threshold (e.g., 2), if the resources of at least one RO in the RO set are indicated as cancelled resources by UL cancellation signaling or are indicated as DL resources or flexible resources by SFI, then no RO in the RO set can be used for PRACH transmission. Therefore, PRACH transmission on this RO set can be cancelled. The threshold can be predefined among service providers or configured via RRC signaling. When the repetition factor is equal to or less than a certain threshold, after a conflict occurs in one of the ROs, the remaining resources in the RO set may not be sufficient to meet the performance requirements of PRACH transmission. Therefore, the entire RO set can be discarded.

[0070] Alternatively or additionally, if an RO is not the first RO in the RO set and if the resources of this RO are indicated as cancelled resources by UL cancellation signaling or are indicated as DL resources or flexible resources by SFI, then this RO cannot be used for PRACH transmission. In other words, PRACH transmission on this RO can be cancelled. In these examples, the first RO can be used by a legacy UE for a single PRACH transmission, so the first RO in the RO set can have a higher priority than other ROs.

[0071] By the above method, PRACH transmission on some ROs can be effectively cancelled, thereby improving the overall system efficiency and ensuring that more available resources are used for high-priority uplink services.

[0072] In some cases, the preambles used for the RACH procedure can be differentiated based on the RRC state of the UE. Differentiating random access UEs according to different RRC states is discussed below.

[0073] For contention-based random access (CBRA), UEs in different RRC states (including RRC_IDLE, RRC_INACTIVE, RRC_CONNECTED) can initiate the RACH procedure. When the RO set is used by the UE for repeated PRACH transmissions, the UE in the RRC_CONNECTED state can identify the conflicts between the ROs in the RO set and other transmissions, or indicate to cancel the PRACH on some ROs through UL cancellation signaling. This method can avoid sending PRACHs on some conflicting ROs. However, UEs in the non-RRC_CONNECTED state cannot identify these conflicts. Therefore, the RO resources used by UEs in different RRC connection states may be different. However, during the CBRA procedure, the traditional BS cannot identify whether the UE initiating the procedure is in the RRC_CONNECTED state. Therefore, without information, the BS cannot effectively combine multiple PRACH transmissions.

[0074] As an example, as Figure 9 shown, there can be 8 valid ROs in an RO set, namely RO0 to RO7. For UEs in the RRC_IDLE or RRC_INACTIVE state, the first four valid ROs will be used for multiple PRACH transmissions with a repetition factor of 4 because the UE has not obtained RO conflict information for these states from the BS. On the other hand, for UEs in the RRC_CONNECTED state, the valid RO0, RO1, RO4, and RO6 will be selected by the UE with repeated PRACH transmissions because RO2, RO3, and RO5 cannot be used for transmitting PRACH considering the conflicts with other transmissions or the cancellation by UL cancellation signaling.

[0075] According to one or more embodiments, the BS can avoid miscombining multiple PRACH transmissions by configuring different PRACH transmission sequence resources (e.g., PRACH preambles) for UEs in different RRC states. For example, there can be two or more preamble sets for CBRA; the first preamble set can be configured and used for UEs in the RRC_CONNECTED state, and the second preamble set can be configured and used for UEs in the RRC_IDLE / RRC_INACTIVE state. Therefore, when the BS receives multiple PRACH transmissions in the RO set, to combine the first four ROs, the BS only needs to perform the correlation detection on the four received ROs by using the preamble sequence in the first preamble set. To combine the reception of RO0, RO1, RO4, and RO6, the base station only needs to perform the correlation detection by using the preamble sequence in the second preamble set.

[0076] By the above method, the incorrect combination of BS to RO can be avoided, and the reliability of the base station receiving multiple PRACH transmissions can be improved.

[0077] According to one or more embodiments of the present disclosure, a wireless communication method is disclosed. The method includes: determining, for example by a UE, a synchronization signal block (SSB) for a RACH procedure; and determining, for example by the UE, a set of ROs (PRACH occasions) based on the determined SSB to transmit at least two PRACHs.

[0078] According to one or more embodiments of the present disclosure, a wireless communication method is disclosed. The method includes: receiving, for example by a BS, at least two PRACHs from a user equipment (UE), where the PRACHs are transmitted on a set of ROs determined by the UE based on a synchronization signal block (SSB) for a RACH procedure; and transmitting, for example by the BS, a response message in response to the PRACHs.

[0079] According to one implementation manner of an embodiment of the present disclosure, one or more wireless transmission methods further include receiving a RACH preamble for a RACH procedure from the UE, where the RACH preamble conforms to the radio resource control (RRC) state of the user equipment.

[0080] According to one implementation manner of an embodiment of the present disclosure, one or more wireless transmission methods further include processing the PRACHs transmitted at least twice based on the RACH preamble.

[0081] According to one implementation manner of an embodiment of the present disclosure, the number of ROs in the RO set is equal to the repetition factor of the PRACH.

[0082] According to one implementation manner of an embodiment of the present disclosure, the number of ROs in the RO set is greater than the repetition factor of the PRACH, and the method further includes selecting ROs to be used from the RO set according to the repetition factor of the PRACH.

[0083] According to one implementation manner of an embodiment of the present disclosure, the ROs in the RO set satisfy at least one of the following characteristics: the ROs in the RO set are associated with the determined SSB, the ROs in the RO set are located at different time domain positions, and the ROs in the RO set have the same frequency domain position.

[0084] According to one implementation manner of an embodiment of the present disclosure, the determined RO set is selected from a plurality of candidate ROs, the plurality of candidate ROs are associated with the same SSB, are located at different time domain positions, and are respectively located at the same frequency domain position to form at least one RO set.

[0085] According to an implementation manner of an embodiment of the present disclosure, determining the RO set includes selecting from a plurality of candidate ROs, where the plurality of candidate ROs are associated with the same SSB, located at different time domain positions, and respectively located at the same frequency domain position to form at least one RO set.

[0086] According to an implementation manner of an embodiment of the present disclosure, the determined RO set is selected by the user equipment from at least one candidate RO set.

[0087] According to an implementation manner of an embodiment of the present disclosure, determining the RO set includes the user equipment selecting from at least one candidate RO set.

[0088] According to an implementation manner of an embodiment of the present disclosure, at least one candidate RO set is obtained by the following steps: grouping two or more candidate ROs that are located in the closest time slots and at the same frequency position into one candidate RO set.

[0089] According to an implementation manner of an embodiment of the present disclosure, the wireless communication method further includes obtaining at least one candidate RO set by the following steps, where the steps include grouping two or more candidate ROs that are located in the closest time slots and at the same frequency position into one candidate RO set.

[0090] According to an implementation manner of an embodiment of the present disclosure, the at least one candidate RO set is sorted in a frequency domain first manner.

[0091] According to an implementation manner of an embodiment of the present disclosure, the wireless communication method further includes sorting the at least one candidate RO set in a frequency domain first manner in sequence.

[0092] According to an implementation manner of an embodiment of the present disclosure, the at least one candidate RO set is sorted in a time domain first manner.

[0093] According to an implementation manner of an embodiment of the present disclosure, the wireless communication method further includes sorting the at least one candidate RO set in a time domain first manner in sequence.

[0094] According to an implementation manner of an embodiment of the present disclosure, the at least one candidate RO set is associated with one or more candidate SSBs according to the sorting order of the at least one candidate RO set.

[0095] According to an implementation manner of an embodiment of the present disclosure, the wireless communication method further includes the at least one candidate RO set being associated with one or more candidate SSBs according to the sorting order of the at least one candidate RO set.

[0096] According to one implementation of the embodiments of the present disclosure, the wireless communication method further includes preparing at least one candidate RO set through the following steps, which include: introducing one or more additional candidate ROs to be associated with existing candidate ROs, so as to form at least one candidate RO set; and respectively associating at least one candidate RO set with one or more candidate SSBs according to the association between at least one candidate SSB and one or more existing ROs in each candidate RO set of the at least one candidate RO set.

[0097] According to one implementation of the embodiments of the present disclosure, the at least one candidate RO set can be obtained through the following steps, which include: introducing one or more additional candidate ROs to be associated with existing candidate ROs, so as to form at least one candidate RO set; and respectively associating at least one candidate RO set with one or more candidate SSBs according to the association between at least one candidate SSB and one or more existing ROs in each candidate RO set of the at least one candidate RO set.

[0098] According to one implementation of the embodiments of the present disclosure, one or more of the disclosed wireless transmission methods further include excluding a conflicting RO set from the candidate RO sets when at least one RO in the conflicting RO set conflicts with another transmission.

[0099] According to one implementation of the embodiments of the present disclosure, when at least one RO in the conflicting RO set conflicts with another transmission, the conflicting RO set is excluded from the candidate RO sets.

[0100] According to one implementation of the embodiments of the present disclosure, one or more of the disclosed wireless transmission methods further include excluding a conflicting RO set from the candidate RO sets when at least one RO in the conflicting RO set conflicts with another transmission and when the repetition factor of the conflicting RO set is greater than a predetermined number.

[0101] According to one implementation of the embodiments of the present disclosure, when at least one RO in the conflicting RO set conflicts with another transmission and when the repetition factor of the conflicting RO set is greater than a predetermined number, the conflicting RO set is excluded from the candidate RO sets.

[0102] According to one implementation of the embodiments of the present disclosure, one or more of the disclosed wireless transmission methods further include excluding a conflicting RO set from the candidate RO sets when at least one RO in the conflicting RO set conflicts with another transmission and when the repetition factor of the conflicting RO set is equal to or less than a predetermined number.

[0103] According to an implementation manner of an embodiment of the present disclosure, when at least one RO in a conflicting RO set conflicts with another transmission and when the repetition factor of the conflicting RO set is equal to or less than a predetermined number, the conflicting RO set is excluded from the candidate RO set.

[0104] According to an implementation manner of an embodiment of the present disclosure, one or more of the disclosed wireless transmission methods further include excluding a conflicting RO from the candidate ROs when the conflicting RO conflicts with another transmission and the conflicting RO is an RO other than the first RO in its RO set.

[0105] According to an implementation manner of an embodiment of the present disclosure, when a conflicting RO conflicts with another transmission and the conflicting RO is an RO other than the first RO in its RO set, the conflicting RO is excluded from the candidate ROs.

[0106] According to an implementation manner of an embodiment of the present disclosure, one or more of the disclosed wireless transmission methods further include excluding an RO set from the candidate RO set when information indicates that at least one RO in the candidate RO set is a cancelled resource, a downlink resource, or a flexible resource.

[0107] According to an implementation manner of an embodiment of the present disclosure, when information indicates that at least one RO in the candidate RO set is a cancelled resource, a downlink resource, or a flexible resource, the RO set is excluded from the candidate RO set.

[0108] According to an implementation manner of an embodiment of the present disclosure, one or more of the disclosed wireless transmission methods further include excluding an RO set from the candidate RO set when the repetition factor of the conflicting RO set is greater than a predetermined number and when information indicates that at least one RO in the candidate RO set is a cancelled resource, a downlink resource, or a flexible resource.

[0109] According to an implementation manner of an embodiment of the present disclosure, when the repetition factor of the conflicting RO set is greater than a predetermined number and when information indicates that at least one RO in the candidate RO set is a cancelled resource, a downlink resource, or a flexible resource, the RO set is excluded from the candidate RO set.

[0110] According to an implementation manner of an embodiment of the present disclosure, one or more of the disclosed wireless transmission methods further include excluding a candidate RO set from the candidate RO set when the repetition factor of the conflicting RO set is equal to or less than a predetermined number and when information indicates that at least one RO in the candidate RO set is a cancelled resource, a downlink resource, or a flexible resource.

[0111] According to an implementation manner of an embodiment of the present disclosure, when the repetition factor of a conflicting RO set is equal to or less than a predetermined number and when information indicates that at least one RO in the candidate RO set is a cancelled resource, a downlink resource, or a flexible resource, the RO set is excluded from the candidate RO set.

[0112] According to an implementation manner of an embodiment of the present disclosure, one or more of the disclosed wireless transmission methods further include excluding a conflicting RO from candidates when information indicates that at least one RO is a cancelled resource, a downlink resource, or a flexible resource, and at least one RO is an RO other than the first RO in its RO set.

[0113] According to an implementation manner of an embodiment of the present disclosure, when information indicates that at least one RO is a cancelled resource, a downlink resource, or a flexible resource, and at least one RO is an RO other than the first RO in its RO set, the conflicting RO is excluded from the candidates.

[0114] According to an implementation manner of an embodiment of the present disclosure, one or more of the disclosed wireless transmission methods further include transmitting, from a user equipment, a RACH preamble for a RACH procedure, wherein the RACH preamble conforms to a radio resource control (RRC) state of the user equipment.

[0115] According to an implementation manner of an embodiment of the present disclosure, the steps or methods disclosed herein may be performed by one or more wireless communication devices such as a base station or a user equipment.

[0116] According to one or more embodiments of the present invention, a wireless communication device is disclosed. The device includes: a first determination module configured to determine a synchronization signal block (SSB) for a RACH procedure; and a second determination module configured to determine an RO set according to the determined SSB to transmit at least two PRACHs.

[0117] According to one or more embodiments of the present disclosure, a wireless communication device is disclosed. The device includes: a receiving module configured to receive at least two PRACHs from a user equipment (UE), wherein the PRACH is transmitted on an RO set determined by the UE according to a synchronization signal block (SSB) for a RACH procedure; and a transmitting module configured to transmit a response message in response to the PRACH.

[0118] According to one or more embodiments of the present disclosure, the wireless communication device further includes a receiving module configured to receive a RACH preamble for a RACH procedure from the UE, wherein the RACH preamble conforms to a radio resource control (RRC) state of the user equipment.

[0119] According to one or more embodiments of the present disclosure, the wireless communication device further includes a processing module configured to process a PRACH that is transmitted at least twice based on a RACH preamble.

[0120] According to one or more embodiments of the present disclosure, the wireless communication device further includes an exclusion module configured to exclude a conflicting RO set from a candidate RO set when at least one RO in the conflicting RO set conflicts with another transmission.

[0121] According to one or more embodiments of the present disclosure, the wireless communication device further includes an exclusion module configured to exclude a conflicting RO set from a candidate RO set when at least one RO in the conflicting RO set conflicts with another transmission and when a repetition factor of the conflicting RO set is greater than a predetermined number.

[0122] According to one or more embodiments of the present disclosure, the wireless communication device further includes an exclusion module configured to exclude a conflicting RO set from a candidate RO set when at least one RO in the conflicting RO set conflicts with another transmission and when a repetition factor of the conflicting RO set is equal to or less than a predetermined number.

[0123] According to one or more embodiments of the present disclosure, the wireless communication device further includes an exclusion module configured to exclude a conflicting RO from candidate ROs when the conflicting RO conflicts with another transmission and the conflicting RO is an RO other than a first RO in its RO set.

[0124] According to one or more embodiments of the present disclosure, the wireless communication device further includes an exclusion module configured to exclude a RO set from a candidate RO set when information indicates that at least one RO in the candidate RO set is a cancelled resource, a downlink resource, or a flexible resource.

[0125] According to one or more embodiments of the present disclosure, the wireless communication device further includes an exclusion module configured to exclude a RO set from a candidate RO set when a repetition factor of the conflicting RO set is greater than a predetermined number and when information indicates that at least one RO in the candidate RO set is a cancelled resource, a downlink resource, or a flexible resource.

[0126] According to one or more embodiments of the present disclosure, the wireless communication device further includes an exclusion module configured to exclude a RO set from a candidate RO set when a repetition factor of the conflicting RO set is equal to or less than a predetermined number and when information indicates that at least one RO in the candidate RO set is a cancelled resource, a downlink resource, or a flexible resource.

[0127] According to one or more embodiments of the present disclosure, the wireless communication device further includes an exclusion module configured to exclude a conflicting RO from candidate ROs when the information indicates that at least one RO is a cancelled resource, a downlink resource, or a flexible resource, and at least one RO is an RO other than the first RO in its RO set.

[0128] According to one or more embodiments of the present disclosure, the wireless communication device further includes a transmission module configured to transmit a RACH preamble for a RACH procedure from a user equipment, wherein the RACH preamble conforms to the radio resource control (RRC) state of the user equipment.

[0129] Various exemplary embodiments of the present disclosure are described herein with reference to the accompanying drawings so that those of ordinary skill in the art can make and use the present disclosure. The present disclosure is not limited to the exemplary embodiments and applications described and illustrated herein. In addition, the specific order and / or hierarchical structure of the steps in the methods disclosed herein are merely exemplary methods. Based on design preferences, the specific order or hierarchical structure of the steps of the disclosed methods or processes can be rearranged while remaining within the scope of the present disclosure. Therefore, those of ordinary skill in the art should understand that the methods and techniques disclosed herein present various steps or actions in an exemplary order, and unless otherwise explicitly stated, the present disclosure is not limited to the specific order or hierarchical structure presented.

[0130] The present disclosure is intended to cover any possible variations, uses, combinations, or adaptations of the present disclosure that follow the general principles of the present disclosure, including the common general knowledge and conventional technical means in the art, as well as what is not disclosed in this application.

[0131] It should be understood that the present disclosure is not limited to the exact structures or operations shown above and in the drawings, and various modifications and changes can be made without departing from the scope of this application. The scope of this application is only limited by the appended claims.

[0132] The above methods, apparatuses, processes, circuits, and logics can be implemented in many different ways and with many different combinations of hardware and software. For example, all or part of the implementation can be a circuit including an instruction processor or controller such as a central processing unit (CPU), a microcontroller, or a microprocessor; or as an application specific integrated circuit (ASIC), a programmable logic device (PLD), or a field programmable gate array (FPGA); or as a circuit including discrete logic or other circuit components (including analog circuit components, digital circuit components, or both); or any combination thereof. As an example, the circuit can include discrete interconnected hardware components, or can be combined on a single integrated circuit die, distributed among multiple integrated circuit chips, or implemented in a multi-chip module (MCM) of multiple integrated circuit dies in a common package.

[0133] Accordingly, the circuit can store or access instructions for execution, or can implement its functions only in hardware. The instructions can be stored in a tangible storage medium other than a transient signal, such as flash memory, random access memory (RAM), read only memory (ROM), erasable programmable read only memory (EPROM); or stored on a magnetic disk or an optical disk, such as a compact disc read only memory (CDROM), a hard disk drive (HDD), or other magnetic or optical disks; or stored in or on another machine-readable medium. A product such as a computer program product can include a storage medium and instructions stored in or on the medium, and when executed by a circuit in a device, the instructions can cause the device to implement any of the processes described above or shown in the figures.

[0134] These implementations can be distributed. For example, the circuit can include multiple different system components such as multiple processors and memories, and can span multiple distributed processing systems. Parameters, databases, and other data structures can be stored and managed separately, can be incorporated into a single memory or database, can be logically and physically organized in many different ways, and can be implemented in many different ways. Example implementations include linked lists, program variables, hash tables, arrays, records (e.g., database records), objects, and implicit storage mechanisms. The instructions can form part of a single program (e.g., a subroutine or other code segment), can form multiple separate programs, can be distributed among multiple memories and processors, and can be implemented in many different ways. Example implementations include stand-alone programs, and as part of a library, such as a shared library like a dynamic link library (DLL). For example, the library can contain shared data and one or more shared programs that include instructions that, when executed by the circuit, perform any of the processes described above or shown in the figures.

[0135] In some examples, each unit, subunit, and / or module of the system can include a logic component. Each logic component can be hardware or a combination of hardware and software. For example, each logic component can include an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), digital logic circuitry, analog circuitry, a combination of discrete circuits, gates, or any other type of hardware or a combination thereof. Alternatively or additionally, each logic component can include memory hardware, such as a portion of a memory, which for example includes instructions that can be executed by a processor or other processing unit to implement one or more features of the logic component. When any one logic component includes a memory portion that contains instructions that can be executed by a processor, the logic component can include or can not include a processor. In some examples, each logic component can be just a portion of a memory or other physical memory that includes instructions that can be executed by a processor or other processing unit to implement the features of the corresponding logic component, and the logic component does not include any other hardware. Because each logic component includes at least some hardware even if the included hardware includes software, each logic component can be interchangeably referred to as a hardware logic component.

[0136] A second action can be said to be “responsive to” a first action, regardless of whether the second action is directly or indirectly caused by the first action. The second action can occur at a much later time than the first action and still be responsive to the first action. Similarly, even if intermediate actions occur between the first action and the second action, and even if one or more of the intermediate actions directly cause the second action to be executed, the second action can be said to be responsive to the first action. For example, if the first action sets a flag, the second action can be responsive to the first action, and whenever the flag is set, a third action initiates the second action at a later time.

[0137] For purposes of clarification of usage and to give notice to the public, Applicant defines the phrase “ 、 , … and <n>at least one of "or"< / n> 、 、… <n>or at least one of its combinations of "or"< / n> 、 , … and / or <n>", replaces any other implicit definitions in the above or below text. Unless the applicant clearly states otherwise, these phrases refer to one or more elements selected from the group including A, B,..., and N. In other words, the phrases refer to any combination of one or more of the elements A, B,..., or N, including any single element alone, or a combination of that element with one or more other elements, and these other elements may also include other elements not listed in the combination.< / n>

Claims

1. A wireless communication method, comprising: determining a synchronization signal block (SSB) for a RACH procedure; and determining a RO set according to the determined SSB to transmit at least two PRACHs.

2. The method according to claim 1, wherein the number of ROs in the RO set is equal to the repetition factor of the PRACH.

3. The method according to claim 1, wherein the number of ROs in the RO set is greater than the repetition factor of the PRACH, and the method further includes selecting ROs to be used from the RO set according to the repetition factor of the PRACH.

4. The method according to claim 1, wherein the ROs in the RO set satisfy at least one of the following characteristics: the ROs in the RO set are associated with the determined SSB, the ROs in the RO set are located at different time domain positions, and the ROs in the RO set have the same frequency domain position.

5. The method according to claim 1, wherein the determined RO set is selected from a plurality of candidate ROs, the plurality of candidate ROs are associated with the same SSB, located at different time domain positions, and respectively located at the same frequency domain position to form at least one RO set.

6. The method according to claim 1, wherein the determined RO set is selected by a user equipment from at least one candidate RO set.

7. The method according to claim 6, wherein the at least one candidate RO set is obtained by the following steps: grouping two or more candidate ROs located in the closest time slots and at the same frequency position into one candidate RO set.

8. The method according to claim 7, wherein the at least one candidate RO set is sorted in a frequency domain first manner.

9. The method according to claim 7, wherein the at least one candidate RO set is sorted in a time domain first manner.

10. The method according to claim 8 or 9, wherein the at least one candidate RO set is associated with one or more candidate SSBs according to the sorting order of the at least one candidate RO set.

11. The method according to claim 6, wherein the at least one candidate RO set is prepared by the following steps: introducing one or more additional candidate ROs to be associated with existing candidate ROs to form the at least one candidate RO set; and associating the at least one candidate RO set with one or more candidate SSBs respectively according to the association between at least one candidate SSB and one or more existing ROs in each candidate RO set of the at least one candidate RO set.

12. The method according to claim 1, further includes excluding the conflicting RO set from the candidate RO set when at least one RO in the conflicting RO set conflicts with another transmission.

13. The method according to claim 1, further includes excluding the conflicting RO set from the candidate RO set when at least one RO in the conflicting RO set conflicts with another transmission and when the repetition factor of the conflicting RO set is greater than a predetermined number.

14. The method according to claim 1 further includes excluding the set of colliding ROs from the candidate RO set when at least one RO in the set of colliding ROs collides with another transmission and when the repetition factor of the set of colliding ROs is equal to or less than a predetermined number.

15. The method according to claim 1 further includes excluding the colliding RO from the candidate ROs when the colliding RO collides with another transmission and the colliding RO is an RO other than the first RO in its RO set.

16. The method according to claim 1 further includes excluding the RO set from the candidate RO set when information indicates that at least one RO in the candidate RO set is a cancelled resource, a downlink resource, or a flexible resource.

17. The method according to claim 1 further includes excluding the RO set from the candidate RO set when the repetition factor of the set of colliding ROs is greater than a predetermined number and when information indicates that at least one RO in the candidate RO set is a cancelled resource, a downlink resource, or a flexible resource.

18. The method according to claim 1 further includes excluding the RO set from the candidate RO set when the repetition factor of the set of colliding ROs is equal to or less than a predetermined number and when information indicates that at least one RO in the candidate RO set is a cancelled resource, a downlink resource, or a flexible resource.

19. The method according to claim 1 further includes excluding the colliding RO from the candidate ROs when information indicates that at least one RO is a cancelled resource, a downlink resource, or a flexible resource and the at least one RO is an RO other than the first RO in its RO set.

20. The method according to claim 1 further includes transmitting a RACH preamble for the RACH procedure from a user equipment, wherein the RACH preamble conforms to the radio resource control (RRC) state of the user equipment.

21. A wireless communication method comprising: receiving at least two PRACHs from a user equipment (UE), wherein the PRACHs are transmitted on a set of ROs determined by the UE according to a synchronization signal block (SSB) for a RACH procedure; and transmitting a response message in response to the PRACHs.

22. The method according to claim 21 wherein the number of ROs in the set of ROs is equal to the repetition factor of the PRACH.

23. The method according to claim 21 wherein the number of ROs in the set of ROs is greater than the repetition factor of the PRACH, and the method further includes selecting ROs to be used from the set of ROs according to the repetition factor of the PRACA.

24. The method according to claim 21 wherein the ROs in the set of ROs satisfy at least one of the following characteristics: the ROs in the set of ROs are associated with the determined SSB, the ROs in the set of ROs are located at different time domain positions, and the ROs in the set of ROs have the same frequency domain position.

25. The method according to claim 21 wherein The determined RO set is selected from multiple candidate ROs, where the multiple candidate ROs are associated with the same SSB, located at different time domain positions, and respectively located at the same frequency domain position to form at least one RO set.

26. The method according to claim 21, wherein, the determined RO set is selected by the user equipment from at least one candidate RO set.

27. The method according to claim 26, wherein, the at least one candidate RO set is obtained by the steps including: grouping two or more candidate ROs that are located in the closest time slots and at the same frequency position into one candidate RO set.

28. The method according to claim 27, wherein, the at least one candidate RO set is sorted in order in a frequency domain priority manner.

29. The method according to claim 27, wherein, the at least one candidate RO set is sorted in a time domain priority manner.

30. The method according to claim 28 or 29, wherein, the at least one candidate RO set is associated with one or more candidate SSBs according to the sorting order of the at least one candidate RO set.

31. The method according to claim 26, wherein, the at least one candidate RO set is prepared by the steps including: introducing one or more additional candidate ROs to be associated with existing candidate ROs to form the at least one candidate RO set; and respectively associating the at least one candidate RO set with one or more candidate SSBs according to the association between at least one candidate SSB and one or more existing ROs in each candidate RO set of the at least one candidate RO set.

32. The method according to claim 21, further comprising excluding the conflicting RO set from the candidate RO set when at least one RO in the conflicting RO set conflicts with another transmission.

33. The method according to claim 21, further comprising excluding the conflicting RO set from the candidate RO set when at least one RO in the conflicting RO set conflicts with another transmission and when the repetition factor of the conflicting RO set is greater than a predetermined number.

34. The method according to claim 21, further comprising excluding the conflicting RO set from the candidate RO set when at least one RO in the conflicting RO set conflicts with another transmission and when the repetition factor of the conflicting RO set is equal to or less than a predetermined number.

35. The method according to claim 21, further comprising excluding the conflicting RO from the candidate ROs when the conflicting RO conflicts with another transmission and the conflicting RO is an RO other than the first RO in its RO set.

36. The method according to claim 21, further comprising excluding the RO set from the candidate RO set when information indicates that at least one RO in the candidate RO set is a cancelled resource, a downlink resource, or a flexible resource.

37. The method according to claim 21 further includes excluding the RO set from the candidate RO sets when the repetition factor of the conflicting RO set is greater than a predetermined number and when the information indicates that at least one RO in the candidate RO sets is a cancelled resource, a downlink resource, or a flexible resource.

38. The method according to claim 21 further includes excluding the RO set from the candidate RO sets when the repetition factor of the conflicting RO set is equal to or less than a predetermined number and when the information indicates that at least one RO in the candidate RO sets is a cancelled resource, a downlink resource, or a flexible resource.

39. The method according to claim 21 further includes excluding the conflicting RO from the candidate ROs when the information indicates that at least one RO is a cancelled resource, a downlink resource, or a flexible resource, and the at least one RO is an RO other than the first RO in its RO set.

40. The method according to claim 21 further includes receiving a RACH preamble for the RACH procedure from the UE, wherein the RACH preamble conforms to the radio resource control (RRC) state of the user equipment.

41. The method according to claim 40 further includes processing the PRACH that is transmitted at least twice based on the RACH preamble.

42. A wireless communication device includes a memory storing one or more programs and one or more processors electrically coupled to the memory and configured to implement the one or more programs to perform the method according to any one of claims 1 to 41.

43. A non-transitory computer-readable storage medium stores one or more programs configured to, when executed by a processor, cause performance of the method according to any one of claims 1 to 41.

Images