Method and device for a node for wireless communication - Patents.com

Abstract

Provided are methods and devices applicable to a node for wireless communication, the first node for wireless communication comprising: a first receiver configured to receive first information used to determine X ROs, the X ROs mapped to Q PROGs, where X is a positive integer greater than 1 and Q is a positive integer; and a second receiver configured to receive second information used to determine a plurality of candidate values, the number of ROs in each of the Q ROGs being a corresponding candidate value of the plurality of candidate values. The plurality of candidate values includes a first candidate value and a second candidate value, and a larger one of the first candidate value and the second candidate value is prioritized for mapping the X ROs to the Q ROGs and / or the mapping of the X ROs to the Q ROGs is related to a respective number of ROGs corresponding to each candidate value of the plurality of candidate values.

Description

[Technical Field]

[0001] TECHNICAL FIELD Embodiments of the present disclosure relate to the field of communication technologies, and more particularly to methods and devices applicable to nodes for wireless communication. [Background technology]

[0002] To improve the coverage performance of the Physical Random Access Channel (PRACH), some communication systems (e.g., New Radio (NR) systems) have introduced a multiple PRACH transmission scheme. In the multiple PRACH transmission scheme, a PRACH occasion (RO) can be mapped to an ROG (Redirection Group) to transmit multiple PRACHs on the ROG. Given this situation, how to map an RO to an ROG becomes a problem to be solved. The RO-to-ROG mapping scheme may affect resource allocation for multiple PRACH transmissions or cause a large number of orphan ROs, resulting in resource waste. Summary of the Invention [Problem to be solved by the invention]

[0003]

[0010] Embodiments of the present disclosure provide methods and devices applicable to nodes for wireless communication. Aspects of the present disclosure are exemplified below. [Means for solving the problem]

[0004] In a first aspect, a first node for wireless communication is provided, including: a first receiver configured to receive first information, the first information used to determine X PRACH opportunities, the X PRACH opportunities mapped to Q PRACH opportunity groups, where X is a positive integer greater than 1 and Q is a positive integer; and a second receiver configured to receive second information, the second information used to determine a plurality of candidate values, the number of PRACH opportunities in each of the Q PRACH opportunity groups being a corresponding candidate value of the plurality of candidate values. The plurality of candidate values include a first candidate value and a second candidate value, a larger one of the first candidate value and the second candidate value being prioritized for mapping the X PRACH opportunities to the Q PRACH opportunity groups, and / or the mapping of the X PRACH opportunities to the Q PRACH opportunity groups being related to the number of PRACH opportunity groups corresponding to each candidate value of the plurality of candidate values.

[0005] In some embodiments, the first node further includes a first transmitter configured to transmit a plurality of random access preambles on a first PRACH opportunity group, the first PRACH opportunity group being one of the Q PRACH opportunity groups, and the first sequence being used to generate each random access preamble of the plurality of random access preambles.

[0006] In some embodiments, the X PRACH opportunities are in the first cycle.

[0007] In some embodiments, the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain, or the PRACH opportunities in each of the Q PRACH opportunity groups are associated with the same synchronization signal block, or the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain and associated with the same synchronization signal block.

[0008] In some embodiments, the multiple candidate values are used in descending order for mapping the X PRACH opportunities to the Q PRACH opportunity groups.

[0009] In some embodiments, each opportunity group subset of the plurality of PRACH opportunity group subsets includes Q1 respective PRACH opportunity groups of the Q PRACH opportunity groups, each of the plurality of candidate values corresponds to at least one respective PRACH opportunity group of the Q1 respective PRACH opportunity groups in each opportunity group subset of the plurality of PRACH opportunity group subsets, and any two opportunity group subsets of the plurality of PRACH opportunity group subsets corresponding to any one of the plurality of candidate values have the same number of PRACH opportunity groups.

[0010] In some embodiments, the number of at least one respective PRACH opportunity group in each opportunity group subset of the plurality of PRACH opportunity group subsets corresponding to one respective candidate value of the plurality of candidate values corresponds to a value, and the values corresponding to the plurality of candidate values are values in a first proportion.

[0011] In some embodiments, each opportunity group subset of the plurality of PRACH opportunity group subsets includes X1 respective PRACH opportunities of the X PRACH opportunities, and in each opportunity group subset of the plurality of PRACH opportunity group subsets, the plurality of candidate values are used in descending order to map the X1 respective PRACH opportunities to Q1 respective PRACH opportunity groups.

[0012] In some embodiments, the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to one or more of the number of frequency division multiplexing PRACH opportunities in the time instance, the number of synchronization signal blocks associated with each of the X PRACH opportunities, and the number of random access preambles corresponding to each of the synchronization signal blocks associated with the X PRACH opportunities.

[0013] In some embodiments, the first node further includes a third receiver configured to receive third information used to determine a number of PRACH opportunity groups corresponding to at least one candidate value among the plurality of candidate values.

[0014] In some embodiments, the number of random access preambles corresponding to at least one candidate value of the plurality of candidate values is used to determine the Q PRACH opportunity groups.

[0015] In some embodiments, the first information is used to determine at least one of: a respective number of synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities; and a number of random access preambles corresponding to the synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities.

[0016] In some embodiments, each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, and at least two of the Q PRACH opportunity groups each include at least one PRACH opportunity that is different from each other.

[0017] In some embodiments, each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, the Q PRACH opportunity groups correspond to a plurality of random access preambles, and the random access preambles corresponding to at least two of the Q PRACH opportunity groups are different from each other.

[0018] In a second aspect, a second node for wireless communication is provided, comprising: a second transmitter configured to transmit first information used to determine X PRACH opportunities, where the X PRACH opportunities are mapped to Q PRACH opportunity groups, where X is a positive integer greater than 1 and Q is a positive integer; and a third transmitter configured to transmit second information used to determine a plurality of candidate values, where the number of PRACH opportunities in each of the Q PRACH opportunity groups is a corresponding candidate value of the plurality of candidate values. The plurality of candidate values comprises a first candidate value and a second candidate value, where a larger one of the first candidate value and the second candidate value is prioritized for mapping the X PRACH opportunities to the Q PRACH opportunity groups, and / or the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of PRACH opportunity groups corresponding to each candidate value of the plurality of candidate values.

[0019] In some embodiments, the second node further includes a fourth receiver configured to receive a plurality of random access preambles transmitted on a first PRACH opportunity group, the first PRACH opportunity group being one of the Q PRACH opportunity groups, and the first sequence being used to generate each random access preamble of the plurality of random access preambles.

[0020] In some embodiments, the X PRACH opportunities are in the first cycle.

[0021] In some embodiments, the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain, or the PRACH opportunities in each of the Q PRACH opportunity groups are associated with the same synchronization signal block, or the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain and associated with the same synchronization signal block.

[0022] In some embodiments, the multiple candidate values are used in descending order for mapping the X PRACH opportunities to the Q PRACH opportunity groups.

[0023] In some embodiments, each opportunity group subset of the plurality of PRACH opportunity group subsets includes Q1 respective PRACH opportunity groups of the Q PRACH opportunity groups, each of the plurality of candidate values corresponds to at least one respective PRACH opportunity group of the Q1 respective PRACH opportunity groups in each opportunity group subset of the plurality of PRACH opportunity group subsets, and any two opportunity group subsets of the plurality of PRACH opportunity group subsets corresponding to any one of the plurality of candidate values have the same number of PRACH opportunity groups.

[0024] In some embodiments, the number of at least one respective PRACH opportunity group in each opportunity group subset of the plurality of PRACH opportunity group subsets corresponding to one respective candidate value of the plurality of candidate values corresponds to a value, and the values corresponding to the plurality of candidate values are values in a first proportion.

[0025] In some embodiments, each opportunity group subset of the plurality of PRACH opportunity group subsets includes X1 respective PRACH opportunities of the X PRACH opportunities, and in each opportunity group subset of the plurality of PRACH opportunity group subsets, the plurality of candidate values are used in descending order to map the X1 respective PRACH opportunities to Q1 respective PRACH opportunity groups.

[0026] In some embodiments, the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to one or more of the number of frequency division multiplexing PRACH opportunities in the time instance, the number of synchronization signal blocks associated with each of the X PRACH opportunities, and the number of random access preambles corresponding to each of the synchronization signal blocks associated with the X PRACH opportunities.

[0027] In some embodiments, the second node further includes a fourth transmitter configured to transmit third information used to determine a number of PRACH opportunity groups corresponding to at least one candidate value among the plurality of candidate values.

[0028] In some embodiments, the number of random access preambles corresponding to at least one candidate value of the plurality of candidate values is used to determine the Q PRACH opportunity groups.

[0029] In some embodiments, at least one PRACH opportunity group corresponding to each of the plurality of candidate values is mapped in a first mapping order, the first mapping order including one or more of an increment order of random access preamble indices, an increment order of frequency resources, and an increment order of time resources.

[0030] In some embodiments, the first information is used to determine at least one of: a respective number of synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities; and a number of random access preambles corresponding to the synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities.

[0031] In some embodiments, each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, and at least two of the Q PRACH opportunity groups each include at least one PRACH opportunity that is different from each other.

[0032] In some embodiments, each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, the Q PRACH opportunity groups correspond to a plurality of random access preambles, and the random access preambles corresponding to at least two of the Q PRACH opportunity groups are different from each other.

[0033] In a third aspect, a method applicable to a first node for wireless communication is provided, the method including: receiving first information used to determine X PRACH opportunities, where the X PRACH opportunities are mapped to Q PRACH opportunity groups, where X is a positive integer greater than 1 and Q is a positive integer; and receiving second information used to determine a plurality of candidate values, where a number of PRACH opportunities in each of the Q PRACH opportunity groups is a corresponding candidate value of the plurality of candidate values. The plurality of candidate values includes a first candidate value and a second candidate value, where a larger one of the first candidate value and the second candidate value is prioritized for mapping the X PRACH opportunities to the Q PRACH opportunity groups, and / or the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of PRACH opportunity groups corresponding to each candidate value of the plurality of candidate values.

[0034] In some embodiments, the method further includes transmitting a plurality of random access preambles on a first PRACH opportunity group, the first PRACH opportunity group being one of the Q PRACH opportunity groups, and the first sequence being used to generate each random access preamble of the plurality of random access preambles.

[0035] In some embodiments, the X PRACH opportunities are in the first cycle.

[0036] In some embodiments, the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain, or the PRACH opportunities in each of the Q PRACH opportunity groups are associated with the same synchronization signal block, or the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain and associated with the same synchronization signal block.

[0037] In some embodiments, the multiple candidate values are used in descending order for mapping the X PRACH opportunities to the Q PRACH opportunity groups.

[0038] In some embodiments, each opportunity group subset of the plurality of PRACH opportunity group subsets includes Q1 respective PRACH opportunity groups of the Q PRACH opportunity groups, each of the plurality of candidate values corresponds to at least one respective PRACH opportunity group of the Q1 respective PRACH opportunity groups in each opportunity group subset of the plurality of PRACH opportunity group subsets, and any two opportunity group subsets of the plurality of PRACH opportunity group subsets corresponding to any one of the plurality of candidate values have the same number of PRACH opportunity groups.

[0039] In some embodiments, the number of at least one respective PRACH opportunity group in each opportunity group subset of the plurality of PRACH opportunity group subsets corresponding to one respective candidate value of the plurality of candidate values corresponds to a value, and the values corresponding to the plurality of candidate values are values in a first proportion.

[0040] In some embodiments, each opportunity group subset of the plurality of PRACH opportunity group subsets includes X1 respective PRACH opportunities of the X PRACH opportunities, and in each opportunity group subset of the plurality of PRACH opportunity group subsets, the plurality of candidate values are used in descending order to map the X1 respective PRACH opportunities to Q1 respective PRACH opportunity groups.

[0041] In some embodiments, the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to one or more of the number of frequency division multiplexing PRACH opportunities in the time instance, the number of synchronization signal blocks associated with each of the X PRACH opportunities, and the number of random access preambles corresponding to each of the synchronization signal blocks associated with the X PRACH opportunities.

[0042] In some embodiments, the method further includes receiving third information used to determine a number of PRACH opportunity groups corresponding to at least one candidate value of the plurality of candidate values.

[0043] In some embodiments, the number of random access preambles corresponding to at least one candidate value of the plurality of candidate values is used to determine the Q PRACH opportunity groups.

[0044] In some embodiments, at least one PRACH opportunity group corresponding to each of the plurality of candidate values is mapped in a first mapping order, the first mapping order including one or more of an increment order of random access preamble indices, an increment order of frequency resources, and an increment order of time resources.

[0045] In some embodiments, the first information is used to determine at least one of: a respective number of synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities; and a number of random access preambles corresponding to the synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities.

[0046] In some embodiments, each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, and at least two of the Q PRACH opportunity groups each include at least one PRACH opportunity that is different from each other.

[0047] In some embodiments, each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, the Q PRACH opportunity groups correspond to a plurality of random access preambles, and the random access preambles corresponding to at least two of the Q PRACH opportunity groups are different from each other.

[0048] In a fourth aspect, a method applicable to a second node is provided for wireless communication, comprising: transmitting first information used to determine X PRACH opportunities, where the X PRACH opportunities are mapped to Q PRACH opportunity groups, where X is a positive integer greater than 1 and Q is a positive integer; and transmitting second information used to determine a plurality of candidate values, where a number of PRACH opportunities in each of the Q PRACH opportunity groups is a corresponding candidate value of the plurality of candidate values. The plurality of candidate values comprises a first candidate value and a second candidate value, where a larger one of the first candidate value and the second candidate value is prioritized for mapping the X PRACH opportunities to the Q PRACH opportunity groups, and / or the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of PRACH opportunity groups corresponding to each candidate value of the plurality of candidate values.

[0049] In some embodiments, the method further includes receiving a plurality of random access preambles transmitted on a first PRACH opportunity group, the first PRACH opportunity group being one of the Q PRACH opportunity groups, and the first sequence being used to generate each random access preamble of the plurality of random access preambles.

[0050] In some embodiments, the X PRACH opportunities are in the first cycle.

[0051] In some embodiments, the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain, or the PRACH opportunities in each of the Q PRACH opportunity groups are associated with the same synchronization signal block, or the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain and associated with the same synchronization signal block.

[0052] In some embodiments, the multiple candidate values are used in descending order for mapping the X PRACH opportunities to the Q PRACH opportunity groups.

[0053] In some embodiments, each opportunity group subset of the plurality of PRACH opportunity group subsets includes Q1 respective PRACH opportunity groups of the Q PRACH opportunity groups, each of the plurality of candidate values corresponds to at least one respective PRACH opportunity group of the Q1 respective PRACH opportunity groups in each opportunity group subset of the plurality of PRACH opportunity group subsets, and any two opportunity group subsets of the plurality of PRACH opportunity group subsets corresponding to any one of the plurality of candidate values have the same number of PRACH opportunity groups.

[0054] In some embodiments, the number of at least one respective PRACH opportunity group in each opportunity group subset of the plurality of PRACH opportunity group subsets corresponding to one respective candidate value of the plurality of candidate values corresponds to a value, and the values corresponding to the plurality of candidate values are values in a first proportion.

[0055] In some embodiments, each opportunity group subset of the plurality of PRACH opportunity group subsets includes X1 respective PRACH opportunities of the X PRACH opportunities, and in each opportunity group subset of the plurality of PRACH opportunity group subsets, the plurality of candidate values are used in descending order to map the X1 respective PRACH opportunities to Q1 respective PRACH opportunity groups.

[0056] In some embodiments, the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to one or more of the number of frequency division multiplexing PRACH opportunities in the time instance, the number of synchronization signal blocks associated with each of the X PRACH opportunities, and the number of random access preambles corresponding to each of the synchronization signal blocks associated with the X PRACH opportunities.

[0057] In some embodiments, the method further includes transmitting third information used to determine a number of PRACH opportunity groups corresponding to at least one candidate value of the plurality of candidate values.

[0058] In some embodiments, the number of random access preambles corresponding to at least one candidate value of the plurality of candidate values is used to determine the Q PRACH opportunity groups.

[0059] In some embodiments, at least one PRACH opportunity group corresponding to each of the plurality of candidate values is mapped in a first mapping order, the first mapping order including one or more of an increment order of random access preamble indices, an increment order of frequency resources, and an increment order of time resources.

[0060] In some embodiments, the first information is used to determine at least one of: a respective number of synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities; and a number of random access preambles corresponding to the synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities.

[0061] In some embodiments, each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, and at least two of the Q PRACH opportunity groups each include at least one PRACH opportunity that is different from each other.

[0062] In some embodiments, each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, the Q PRACH opportunity groups correspond to a plurality of random access preambles, and the random access preambles corresponding to at least two of the Q PRACH opportunity groups are different from each other.

[0063] In a fifth aspect, a first node for wireless communication is provided, comprising a transceiver, a memory, and a processor, wherein the memory is configured to store a program, and the processor is configured to invoke the program in the memory to control the transceiver to receive or transmit signals and cause the first node to perform the operations of the method illustrated in the third aspect.

[0064] In a sixth aspect, a second node for wireless communication is provided, comprising a transceiver, a memory, and a processor, wherein the memory is configured to store a program, and the processor is configured to invoke the program in the memory to control the transceiver to receive or transmit signals and cause the second node to perform the operations of the method illustrated in the fourth aspect.

[0065] In a seventh aspect, a communication system is provided, which includes the first node and / or the second node as exemplified above. In some embodiments, the communication system may further include other devices that interact with the first node or the second node in the technical solutions provided in the embodiments of the present disclosure.

[0066] In an eighth aspect, a computer-readable storage medium is provided, the computer-readable storage medium being configured to store a computer program that causes a computer to perform some or all of the operations of the method as exemplified in the above aspects.

[0067] In a ninth aspect, a computer program product is provided, which includes a non-transitory computer-readable storage medium storing a computer program and which is executable by one or more processors to cause a computer to perform some or all of the operations of the methods as exemplified in the above aspects. In some embodiments, the computer program product may be a software installation package.

[0068] In a tenth aspect, there is provided a computer program executable by one or more processors to cause a computer to perform some or all of the operations of the methods as exemplified in the above aspects.

[0069] In an eleventh aspect, a chip is provided, comprising a memory and at least one processor, the at least one processor configured to retrieve and execute a computer program from the memory to implement some or all of the operations of a method as exemplified in the above aspects.

[0070] In an embodiment of the present disclosure, relatively larger candidate values among the plurality of candidate values are prioritized for mapping PRACH opportunities to PRACH opportunity groups, and / or the number of PRACH opportunity groups corresponding to each candidate value among the plurality of candidate values is used for mapping PRACH opportunities to PRACH opportunity groups. By considering the above factors, this contributes to optimizing the mapping scheme of PRACH opportunities to PRACH opportunity groups, thereby reducing or preventing the generation of orphan PRACH opportunities.

[0071] The technical solutions according to the embodiments of the present disclosure contribute to reducing resource waste.

[0072] The technical solutions according to the embodiments of the present disclosure contribute to optimizing resource allocation for multiple PRACH transmissions.

[0073] The technical solutions according to the embodiments of the present disclosure contribute to improving the performance enhancement and widening the coverage range of multiple PRACH transmission.

[0074] The technical solutions according to the embodiments of the present disclosure contribute to reducing random access delay and improving the utilization efficiency of random access resources. [Brief explanation of the drawings]

[0075] [Figure 1] 1 is a schematic diagram of a system architecture of a wireless communication system to which embodiments of the present disclosure are applicable; [Figure 2] FIG. 1 is a schematic diagram of a mapping of ROs to ROGs. [Figure 3] FIG. 10 is another schematic diagram of mapping of ROs to ROGs. [Figure 4] FIG. 10 is yet another schematic diagram of the mapping of ROs to ROGs. [Figure 5] 1 is a flowchart of a method applicable to a node for wireless communication provided in some embodiments of the present disclosure. [Figure 6] 1 is a schematic diagram of an implementation of mapping of ROs to ROGs according to some embodiments of the present disclosure. FIG. [Figure 7] FIG. 10 is a schematic diagram of another implementation of mapping of ROs to ROGs according to some embodiments of the present disclosure. [Figure 8] 10 is a flowchart of another method applicable to a node for wireless communication provided in some embodiments of the present disclosure. [Figure 9] 10 is a flowchart of yet another method applicable to a node for wireless communication provided in some embodiments of the present disclosure. [Figure 10] 10 is a flowchart of yet another method applicable to a node for wireless communication provided in some embodiments of the present disclosure. [Figure 11] FIG. 1 is a schematic diagram of a node structure for wireless communication provided in some embodiments of the present disclosure. [Figure 12] FIG. 10 is a schematic diagram of the structure of another node for wireless communication provided in some embodiments of the present disclosure. [Figure 13] 1 is a schematic diagram of the structure of a device provided in some embodiments of the present disclosure. [Figure 14] 1 is a schematic diagram of hardware modules of a communication device provided in some embodiments of the present disclosure. DETAILED DESCRIPTION OF THE INVENTION

[0076] Communication System Architecture 1 is a schematic diagram of a system architecture of a wireless communication system 100 to which embodiments of the present disclosure are applicable. The wireless communication system 100 may include a network device 110 and a user equipment 120. The network device 110 may be a device that facilitates communication between the network device and the user equipment 120. The network device 110 may provide communication coverage for a particular geographic area and may communicate with the user equipment 120 located within its coverage area.

[0077] 1 illustrates one network device and two user equipments for illustrative purposes. In some embodiments, the wireless communication system 100 includes multiple network devices, and the coverage area of each network device may cover other numbers of user equipments, which are not described in detail in the embodiments of the present disclosure.

[0078] In some embodiments, the wireless communication system 100 may further include other network entities such as a network controller, a mobile management entity, and the like, which are not described in detail in the embodiments of the present disclosure.

[0079] It should be understood that the technical solutions in the embodiments of the present disclosure may be applied to various communication systems, such as a fifth generation (5G) system or a new radio (NR) system, a long term evolution (LTE) system, a frequency division duplex (FDD) system, a LTE time division duplex (LTE-TDD) system, and the like. The technical solutions provided in the present disclosure may also be applied to future communication systems, such as a sixth generation mobile communication system, a satellite communication system, and the like.

[0080] It should be understood that the technical solutions in the embodiments of the present disclosure can be used for random access, but can also be used for beam failure recovery. Furthermore, the technical solutions in the embodiments of the present disclosure can be used for Type-1 random access procedures, and can also be used for Type-2 random access procedures. Furthermore, the technical solutions in the embodiments of the present disclosure can be used for the Uu interface, and can also be used for the PC5 interface. Furthermore, the technical solutions in the embodiments of the present disclosure can be used for single-carrier communication, and can also be used for multi-carrier communication. Furthermore, the technical solutions in the embodiments of the present disclosure can be used for multi-antenna communication, and can also be used for single-antenna communication. Furthermore, the technical solutions in the embodiments of the present disclosure can be applied to scenarios of user equipment and base stations, and can also be applied to vehicle-to-everything (V2X) scenarios, communication scenarios between user equipment and repeaters, and communication scenarios between repeaters and base stations, and can achieve technical effects in similar scenarios of user equipment and base stations. Furthermore, the technical solutions in the embodiments of the present disclosure may be applied to various communication scenarios, such as an enhanced mobile broadband (eMBB) scenario, an ultra-reliable low-latency communication (URLLC) scenario, a massive machine-type communication (mMTC) scenario, and the like. Furthermore, adopting a unified solution for different scenarios can also help reduce hardware complexity and costs.

[0081] In embodiments of the present disclosure, user equipment may also be referred to as a terminal device, access terminal, subscriber unit, subscriber station, mobile radio station, mobile station (MS), mobile terminal (MT), remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent, or user device. User equipment in embodiments of the present disclosure may be a device that provides voice and / or data connectivity to a user and may be used for communication between people, objects, and machines, such as handheld devices and in-vehicle devices with wireless connectivity. In embodiments of the present disclosure, user equipment may be a mobile phone, tablet computer (Pad), laptop, palmtop computer, mobile internet device (MID), wearable device, virtual reality (VR) device, augmented reality (AR) device, wireless terminal in industrial control, wireless terminal in autonomous driving, wireless terminal in remote medical surgery, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, wireless terminal in smart home, and the like. In some embodiments, a UE may function as a base station. For example, a UE may act as a scheduling entity that provides sidelink signals between UEs in vehicle-to-everything (V2X) or device-to-device (D2D) communications, or the like, such as when a mobile phone and a vehicle communicate with each other using sidelink signals, or a mobile phone and a smart home device communicate with each other without relaying communication signals through a base station.

[0082] A network device in an embodiment of the present disclosure may be a device for communicating with user equipment. The network device may also be referred to as an access network device or a radio access network device. For example, the network device may be a base station. The network device in an embodiment of the present disclosure may refer to a Radio Access Network (RAN) node (or device) that allows user equipment to access a wireless network. A base station may broadly include or be equivalent to various terms such as a NodeB (NodeB), evolved NodeB (eNB), next generation NodeB (gNB), relay station, access point, transmission reception point (TRP), transmission point (TP), master eNodeB (MeNB), secondary eNodeB (SeNB), multi-standard radio (MSR) node, home base station, network controller, access node, wireless node, access point (AP), transmission node, transceiver node, baseband unit (BBU), remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), centralized unit (CU), distributed unit (DU), positioning node, and the like. A base station may be a macro base station, a micro base station, a relay node, a donor node, or the like, or a combination thereof. A base station may also refer to a communication module, modem, or chip provided in the above-mentioned device or apparatus. A base station may also be a mobile switching center, a device functioning as a base station in D2D, V2X, machine-to-machine (M2M) communications, a network-side device in a 6G network, a device functioning as a base station in a future communication system, or the like. A base station may support networks having the same or different access technologies. Embodiments of the present disclosure are not limited to a specific technology and a specific equipment form of a network device.

[0083] The base station may be a fixed base station or a mobile base station. For example, a helicopter or a drone may be configured to function as a mobile base station, and one or more cells may move with the deployment of the mobile base station. In some other examples, a helicopter or a drone may be configured to act as a device for communicating with another base station.

[0084] In some deployments, the network device in the embodiments of the present disclosure may refer to a CU or a DU, or the network device includes both a CU and a DU. A gNB may also include an AAU.

[0085] The network devices and user equipment may be deployed on land, including indoors or outdoors, handheld or vehicle-mounted, or on water, or in the air, on aircraft, balloons, and satellites. The scenarios in which the network devices and user equipment are deployed are not limited in the embodiments of the present disclosure.

[0086] It should be understood that all or part of the functionality of the communication device in this disclosure may be implemented by software functions running on hardware or by virtualization functions instantiated on a platform (such as a cloud platform).

[0087] Extended coverage of PRACH transmissions The coverage performance of a communication system (e.g., an NR system) is an important factor that operators need to consider when deploying a commercial communication network, because it directly affects the service quality of the communication system and the operator's costs, such as the operator's capital expenditures (CAPEX) and operating expenses (OPEX).

[0088] The coverage performance of a communication system varies depending on the frequency band in which the communication system operates. For example, compared with an LTE system, an NR system operates in a higher frequency band (e.g., a millimeter wave frequency band), which results in a larger path loss and therefore a relatively poorer coverage performance for the NR system. Therefore, as the frequency band supported by a communication system may become increasingly higher, how to extend the coverage of the communication system has become a problem that needs to be solved.

[0089] In most practical deployment scenarios, due to the low capabilities of user equipment compared with network devices, uplink coverage performance is the bottleneck in extending the coverage of a communication system. With the development of communication technology, the amount of uplink services in some specific emerging vertical use cases, such as video upload services, is gradually increasing. In scenarios with many uplink services, how to extend uplink coverage is a problem that needs to be further solved.

[0090] In related technologies, there have been several uplink solutions for coverage extension so far. For example, Release 17 (Rel-17) for NR designs a coverage extension scheme for the Physical Uplink Shared Channel (PUSCH), the Physical Uplink Control Channel (PUCCH), and Message 3 (Msg3) in the random access process.

[0091] Although Rel-17 does not design a coverage enhancement scheme for the PRACH, the performance of PRACH transmission (also called PRACH transmission) is crucial for many processes, such as initial access, beam failure recovery, and similar. Therefore, coverage enhancement for the PRACH is also very important. Based on this, the 3rd Generation Partnership Project (3GPP) RP-221858, Rel-18, has formulated a work item (WI) called "further NR coverage enhancements." In this WI, extending the coverage performance of PRACH transmission is one of the key topics.

[0092] As a possible implementation, multiple PRACH transmissions may be used to extend the coverage of PRACH transmissions. That is, the coverage extension of PRACH transmissions may be achieved by repeated transmission of PRACH (e.g., by transmitting a random access preamble in the PRACH multiple times). Note that in the present disclosure, multiple PRACH transmissions may be replaced with terms such as multiple PRACH transmissions, multiple PRACH transmissions, multiple PRACH transmissions, multiple PRACH transmissions, repeated PRACH transmissions, Type-3 random access procedure, and similar terms, and the embodiments of the present disclosure are not limited thereto. That is, multiple PRACH transmissions described in the present disclosure may be replaced with at least one of multiple PRACH transmissions, multiple PRACH transmissions, multiple PRACH transmissions, multiple PRACH transmissions, multiple PRACH transmissions, repeated PRACH transmissions, or Type-3 random access procedure.

[0093] In some embodiments, multiple PRACH transmissions are used for a random access channel (RACH) attempt, i.e., in a RACH attempt, a multiple PRACH transmission scheme may be used to extend the PRACH coverage (e.g., transmitting a preamble multiple times on the PRACH).

[0094] In the embodiments of the present disclosure, multiple PRACH transmissions may refer to multiple PRACH transmissions using the same beam or multiple PRACH transmissions using different beams. Taking multiple PRACH transmissions using the same beam as an example, multiple PRACH transmissions using the same beam can provide improved performance and thus can be used as a feasible PRACH coverage extension scheme. In the 3GPP Radio Access Network (RAN) 1#110bis-e meeting, it was agreed that PRACH opportunities (also referred to as RACH opportunities) at least different time instances (also referred to as time points, time instances, or the like) can be used for multiple PRACH transmissions using the same beam. In other words, ROG can be used for multiple PRACH transmissions using the same beam.

[0095] In addition, the number of multiple PRACH transmissions (number of multiple PRACH transmissions / repetition factor) may also be defined, and the number of PRACH transmissions configured for multiple PRACH transmissions may include multiple values. For example, the RAN1#110bis-e conference further defines the number of multiple PRACH transmissions using the same beam, which may include at least 2, 4, and 8. That is, the ROG may include 2, 4, or 8 valid ROs. In other words, the size of the ROG may be one of 2, 4, or 8. The ROG is further exemplified below.

[0096] PRACH Opportunity Group In some scenarios, an ROG is introduced to indicate a set including multiple PRACH occasions (ROs), and therefore, the ROG may also be referred to as an "RO set." Embodiments of the present disclosure do not limit the name of the ROG. For ease of explanation, embodiments of the present disclosure are exemplified based on the ROG. Embodiments of the present disclosure do not limit the name of the PRACH occasion; for example, a PRACH occasion may also be referred to as a random access opportunity or a transmission opportunity. For ease of explanation, embodiments of the present disclosure are exemplified based on a PRACH occasion, and the PRACH occasion and the random access occasion described in the embodiments of the present disclosure may be interchangeable.

[0097] In some embodiments, the ROG may be used for multiple PRACH transmissions using the same beam.

[0098] In some embodiments, the ROG may include ROs corresponding to multiple PRACHs transmitted using the same beam.

[0099] In some embodiments, some conferences (e.g., 3GPP RAN1) have agreed to introduce a ROG as a resource for multiple PRACH transmissions. The ROG may include multiple valid ROs, e.g., the ROG may include multiple valid ROs that do not overlap each other in the time domain.

[0100] In some embodiments, it has been discussed in some conferences (e.g., 3GPP RAN1#110bis-e) that ROs at different time instances can be used for multiple PRACH transmissions using the same beam, i.e., multiple ROs in an ROG can be distributed at different time instances.

[0101] In some embodiments, for a particular number of PRACH transmissions, the ROG includes valid ROs, which serve to transmit the particular number of PRACHs through the valid ROs.

[0102] In some embodiments, all ROs in a ROG may be associated with the same synchronization signal block (also referred to as a synchronization signal / physical broadcast channel block, SS / PBCH block, or SSB). For simplicity, the synchronization signal block or synchronization signal / physical broadcast channel block is referred to as an SSB, which may optionally be replaced with an SS / PBCH block.

[0103] In some embodiments, every RO in a ROG may be associated with an SSB. In some embodiments, every RO in a ROG is associated with multiple SSBs, and each RO in a ROG is associated with the same multiple SSBs.

[0104] As mentioned above, the number of PRACH transmissions configured for the multiple PRACH transmission may include multiple values. In this case, multiple PRACH transmissions having different numbers of PRACH transmissions may be distinguished by independent ROs and / or independent preambles in a shared RO. That is, when multiple PRACH transmissions are configured to have multiple ROG sizes, multiple PRACH transmissions corresponding to different ROG sizes may be distinguished by independent ROs and / or independent preambles in the shared RO.

[0105] In some embodiments, for multiple PRACH transmissions distinguished by independent preambles in a shared RO, the legacy SSB-to-RO mapping rules may be reused. In some embodiments, only the ROs that are mapped to SSBs in a single PRACH transmission may be used for the multiple PRACH transmissions. For example, for multiple PRACH transmissions distinguished by independent preambles in a shared RO, the legacy SSB-to-RO mapping rules may be reused, and only the ROs that are mapped to SSBs in a single PRACH transmission may be used for the multiple PRACH transmissions.

[0106] In some embodiments, for multiple PRACH transmissions distinguished by independent ROs, new SSB-to-RO mapping rules may be introduced or legacy SSB-to-RO mapping rules may be reused.

[0107] Then, if the legacy SSB-to-RO mapping rules are reused, how to map the RO to the ROG after the SSB-to-RO mapping becomes a problem that needs to be solved. In other words, how to determine (or configure) the ROG after the SSB-to-RO mapping becomes a problem that needs to be addressed.

[0108] Mapping an RO to an ROG may require consideration of multiple factors. For example, in addition to considering the configured size of the ROG (or the configured number of PRACH transmissions for multiple PRACH transmissions), one or more of the following factors may also be considered: the number of frequency division multiplexed ROs in a time instance, the number of SSBs corresponding to each RO, and the number of contention-based preambles corresponding to each SSB. For ease of understanding, two examples of mapping schemes of ROs to ROGs are presented below with reference to Figures 2 and 3.

[0109] 2 shows an example of a scheme for mapping ROs to ROGs. When the number of frequency division multiplexed ROs at a certain time instance is 2 and the number of SSBs corresponding to each RO is 8, the SSB-to-RO mapping scheme is as shown in FIG. 2, i.e., RO#0 corresponds to SSBs 0-7, RO#1 corresponds to SSBs 8-15, RO#2 corresponds to SSBs 16-23, etc. In this case, considering that all ROs in a ROG are associated with the same SSB and the ROs in a ROG are at different time instances, referring to FIG. 2, RO#1, RO#9, and RO#17 can be mapped to the same ROG. For example, when the size of the ROG is 2, RO#1 and RO#9 can be mapped to the same ROG, and when the size of the ROG is 4, RO#1, RO#9, RO#17, and RO#25 (not shown) can be mapped to the same ROG.

[0110] In some embodiments, the ROs in the determined ROG may be discontinuous, i.e., the ROs in the ROG may be separated by one or more ROs. Taking FIG. 2 as an example, when the ROG includes RO#1 and RO#9, there is discontinuity between RO#1 and RO#9, i.e., RO#1 and RO#9 are separated by RO#3, RO#5, and RO#7.

[0111] 3 shows another example of a scheme for mapping ROs to ROGs. When the number of frequency division multiplexed ROs at a certain time instance is 2 and the number of SSBs corresponding to each RO is 1 / 8, the SSB-to-RO mapping scheme is as shown in FIG. 3, i.e., RO#0 to RO#7 correspond to SSB 0, RO#8 to RO#15 correspond to SSB 1, and so on. In this case, considering that all ROs in a ROG are associated with the same SSB and the ROs in a ROG are at different time instances, referring to FIG. 3, RO#1, RO#3, RO#5, and RO#7 can be mapped to the same ROG. For example, when the size of the ROG is 2, RO#1 and RO#3 can be mapped to the same ROG, and when the size of the ROG is 4, RO#1, RO#3, RO#5, and RO#7 can be mapped to the same ROG.

[0112] In some embodiments, the ROs in the determined ROG may be contiguous, i.e., there may be no ROs between the ROs in the ROG. Taking FIG. 3 as an example, when the ROG includes RO#1, RO#3, RO#5, and RO#7, RO#1, RO#3, RO#5, and RO#7 may be contiguous.

[0113] From the above description, it can be seen that any one or more of multiple factors can affect the mapping scheme of ROs to ROGs. Therefore, determining the mapping scheme of ROs to ROGs is particularly important. For example, considering that the size of an ROG can be one of three sizes, 2 ROs, 4 ROs, or 8 ROs, and that the ROs within an ROG are at different time instances, different ROG determination methods may result in orphan ROs that may not be usable for multiple PRACH transmissions, which may ultimately lead to resource waste. In some embodiments, the number of resulting orphan ROs may vary with different parameter configurations, which may result in different degrees of resource waste. In addition, the mapping scheme of ROs to ROGs may affect resource allocation for multiple PRACH transmissions. For ease of understanding, this issue will be described in more detail below in conjunction with FIG. 4.

[0114] Referring to Figure 4, in this example, ROs need to be mapped to ROGs with three different sizes, namely, 2ROs, 4ROs, and 8ROs. In this example, it is assumed that a random access channel attempt corresponds to three PRACH time slots. From the example in Figure 4, it can be seen that after mapping to ROGs with ROG sizes of 2ROs and 4ROs, the remaining ROs are not enough to be mapped to ROGs with ROG size of 8ROs. Therefore, the remaining ROs are not mapped to ROGs with ROG size of 8ROs, and as a result, the remaining ROs become orphan ROs.

[0115] To address the above problems, the embodiments of the present disclosure provide a method and device applicable to a node for wireless communication, which contributes to optimizing the mapping scheme of ROs to ROGs or reducing or preventing the occurrence of orphan ROs. In this way, resource waste can be reduced. Technical solutions according to the embodiments of the present disclosure are exemplified as follows:

[0116] The present disclosure is applicable to multiple PRACH transmission scenarios, i.e., scenarios using multiple repeated PRACH transmissions to achieve PRACH coverage extension.

[0117] The present disclosure is applicable to various random access processes. In some embodiments, the present disclosure is applicable to a four-step random access process, in other words, a Type-1 random access procedure. In some embodiments, the present disclosure is applicable to a two-step random access process, in other words, a Type-2 random access procedure. In some embodiments, the present disclosure is applicable to a random access process supporting multiple PRACH transmission, in other words, a Type-3 random access procedure.

[0118] The present disclosure is applicable to random access processes initiated by various initiation methods. In some embodiments, the present application is applicable to random access processes initiated by a PDCCH order. In some embodiments, the present application is applicable to random access processes initiated by a medium access control (MAC) entity. In some embodiments, the present application is applicable to random access processes initiated by a radio resource control (RRC) event.

[0119] In some embodiments, multiple PRACH transmissions as described in this disclosure may refer to multiple PRACH transmissions using the same beam to obtain a signal-to-noise ratio (SNR) gain through repeated transmissions of multiple PRACHs performed on the same beam.

[0120] In some embodiments, multiple PRACH transmissions as described in this disclosure may refer to multiple PRACH transmissions using different beams to obtain diversity gain through repeated transmissions of multiple PRACHs performed on different beams.

[0121] In some embodiments, the present disclosure mainly considers reusing legacy SSB to RO mapping rules, and designs an RO to ROG mapping scheme (mapping rule) based on this. It should be noted that the present disclosure mainly considers, but is not limited to, reusing legacy SSB to RO mapping rules.

[0122] The methods and devices provided in the present disclosure are illustrated below using multiple embodiments or examples. It should be understood that, unless inconsistent, features of a first node in an embodiment of the present disclosure can be applied to a second node, and vice versa. Unless inconsistent, features in an embodiment of the present disclosure can be combined with each other in any way.

[0123] 5 is a flowchart of a method applicable to a node for wireless communication provided in some embodiments of the present disclosure. The method shown in FIG. 5 is illustrated in terms of interactions between a first node and a second node. The first node and the second node are briefly illustrated below.

[0124] In some embodiments, the first node may be any type of node in a communication system that is capable of performing mapping of an RO to an ROG.

[0125] In some embodiments, the first node may be a user equipment (UE), for example, the first node may be a user equipment 120 as shown in FIG.

[0126] In some embodiments, the first node may be a network controlled repeater (NCR).

[0127] In some embodiments, the first node may be a relay, for example, a relay terminal.

[0128] In some embodiments, the first node may include one or more receivers. For example, the first node may include a receiver capable of receiving multiple types of information, signaling, or data. Alternatively, the first node may include multiple receivers, each capable of receiving different information, signaling, or data.

[0129] In some embodiments, the first node may include a first receiver and a second receiver.

[0130] In some embodiments, the first node may include a transmitter, for example, the first node may further include a first transmitter.

[0131] In some embodiments, the second node may be a node of a communication system configured to transmit the first and / or second information.

[0132] In some embodiments, the second node may be a base station.

[0133] In some embodiments, the second node may be an NCR.

[0134] In some embodiments, the second node may be a relay, for example, a relay terminal.

[0135] In some embodiments, the second node may include one or more transmitters, for example, the second node may include a second transmitter and a third transmitter.

[0136] In some embodiments, the second node may include a fourth transmitter.

[0137] A method such as that shown in Figure 5 is exemplified below: Referring to Figure 5, the method shown in Figure 5 may include operations S510 and S520.

[0138] At S510, the first node receives the first information.

[0139] In some embodiments, the first information is used to determine X PRACH opportunities, where X is a positive integer greater than 1. In other words, the first information is used to determine multiple PRACH opportunities.

[0140] In some embodiments, the first information is used to indicate the X PRACH opportunities.

[0141] An implementation form for determining the X PRACH opportunities using the first information is not specified in the embodiments of the present disclosure. In some embodiments, the first information is used to determine at least one of the following: a respective number of synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities; and a respective number of random access preambles corresponding to the synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities.

[0142] In some embodiments, the first information is used to determine a respective number of synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities.

[0143] In some embodiments, the first information is used to determine the number of random access preambles corresponding to the synchronization signal block corresponding to each PRACH opportunity among the X PRACH opportunities.

[0144] In some embodiments, the first information is used to determine a respective number of synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities and a number of random access preambles corresponding to each synchronization signal block.

[0145] In some embodiments, the number of random access preambles corresponding to the synchronization signal block may include the number of contention-based random access preambles corresponding to the synchronization signal block. For example, the first information may be used to determine the number of contention-based random access preambles corresponding to the synchronization signal block corresponding to each PRACH opportunity.

[0146] In embodiments of the present disclosure, the content of the first information is not specified. In some embodiments, the first information may indicate the number of synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities. For example, a parameter ssb-perRACH-Occasion is used to indicate the number of synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities. In some other embodiments, the first information may indicate the number of synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities, the number of random access preambles corresponding to each synchronization signal block, and the like. For example, a parameter CB-PreamblesPerSSB is used to indicate the number of random access preambles corresponding to each synchronization signal block.

[0147] In some embodiments, the first information may include a transmission parameter for configuring a synchronization signal block in a communication network (such as a 5G network). For example, the first information may be a parameter ssb-perRACH-OccasionAndCB-PreamblesPerSSB.

[0148] In some embodiments, the relevant introduction to the parameters ssb-perRACH-OccasionAndCB-PreamblesPerSSB may be found in the introduction to 3GPP TS38.331.

[0149] In some embodiments, the first information is received by the first node through a first receiver.

[0150] In some embodiments, the first information is transmitted to the first node by the second node, for example, by a network device or another node.

[0151] In some embodiments, the first information is transmitted through high-level signaling or higher-level signaling, for example, the first information is transmitted through RRC layer signaling or MAC layer signaling.

[0152] In some embodiments, the first information is used by the first node to determine X PRACH opportunities.

[0153] In some embodiments, X PRACH opportunities are mapped to Q PRACH opportunity groups, where Q is a positive integer. In other words, X PRACH opportunities are mapped to one or more PRACH opportunity groups. That is, in embodiments of the present disclosure, multiple PRACH opportunities may be mapped to one or more PRACH opportunity groups.

[0154] In some embodiments, the X PRACH opportunities are mapped by the first node into Q PRACH opportunity groups.

[0155] In some embodiments, the X PRACH opportunities are mapped by the second node into Q PRACH opportunity groups.

[0156] In some embodiments, each of the Q PRACH opportunity groups includes at least one PRACH opportunity, in other words, each of the Q PRACH opportunity groups includes at least one PRACH opportunity.

[0157] In some embodiments, each of the Q PRACH opportunity groups includes multiple PRACH opportunities.

[0158] In some embodiments, each of the Q PRACH opportunity groups includes at least one PRACH opportunity of the X PRACH opportunities.

[0159] In some embodiments, one each of the Q PRACH opportunity groups includes a corresponding PRACH opportunity of the X PRACH opportunities. One each PRACH opportunity group may be any one of the Q PRACH opportunity groups. The corresponding PRACH opportunity may be any one of the X PRACH opportunities.

[0160] In some embodiments, one respective PRACH opportunity group of the Q PRACH opportunity groups includes a corresponding plurality of PRACH opportunities of the X PRACH opportunities. One respective PRACH opportunity group may be any one of the Q PRACH opportunity groups. The corresponding plurality of PRACH opportunities may be any plurality of PRACH opportunities of the X PRACH opportunities.

[0161] In some embodiments, the respective PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain, in other words, the PRACH opportunities in each of the Q PRACH opportunity groups do not overlap one another in the time domain, in other words, the PRACH opportunities in each of the Q PRACH opportunity groups are time division multiplexed (TDM).

[0162] In some embodiments, multiple PRACH opportunities that are orthogonal to one another in the time domain may refer to any two of the multiple PRACH opportunities being distributed at different time instances from one another.

[0163] In some embodiments, each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, and at least two of the Q PRACH opportunity groups each include at least one PRACH opportunity that is different from each other.

[0164] In some embodiments, each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, the Q PRACH opportunity groups correspond to a plurality of random access preambles, and the random access preambles corresponding to at least two of the Q PRACH opportunity groups are different from each other.

[0165] In some embodiments, each of the PRACH opportunities in each of the Q PRACH opportunity groups is associated with the same synchronization signal block, in other words, each of the PRACH opportunities in each of the Q PRACH opportunity groups is associated with the same synchronization signal block.

[0166] In some embodiments, the respective PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain and associated with the same synchronization signal block.

[0167] In some embodiments, at least two of the Q PRACH opportunity groups each include a different number of PRACH opportunities, e.g., the Q PRACH opportunity groups include a first PRACH opportunity group and a second PRACH opportunity group, and the number of PRACH opportunities in the first PRACH opportunity group is different from the number of PRACH opportunities in the second PRACH opportunity group.

[0168] In some embodiments, at least two of the Q PRACH opportunity groups each include the same number of PRACH opportunities, e.g., the Q PRACH opportunity groups include a first PRACH opportunity group and a second PRACH opportunity group, and the number of PRACH opportunities in the first PRACH opportunity group is the same as the number of PRACH opportunities in the second PRACH opportunity group.

[0169] In some embodiments, some PRACH opportunity groups of the Q PRACH opportunity groups each include the same number of PRACH opportunities.

[0170] In some embodiments, some of the Q PRACH opportunity groups each include a different number of PRACH opportunities.

[0171] In some embodiments, each PRACH opportunity among the X PRACH opportunities is mapped to a respective PRACH opportunity group among the Q PRACH opportunity groups. That is, after mapping the X PRACH opportunities to the Q PRACH opportunity groups, no orphan PRACH opportunities are generated. In other words, after mapping the X PRACH opportunities to the Q PRACH opportunity groups, all X PRACH opportunities can be used for multiple PRACH transmissions.

[0172] In some embodiments, at least one PRACH opportunity of the X PRACH opportunities is mapped to a corresponding PRACH opportunity group of the Q PRACH opportunity groups.

[0173] In some embodiments, at least one PRACH opportunity among the X PRACH opportunities is not mapped to any of the Q PRACH opportunity groups. That is, after mapping the X PRACH opportunities to the Q PRACH opportunity groups, an orphan PRACH opportunity is generated. In other words, after mapping the X PRACH opportunities to the Q PRACH opportunity groups, the PRACH opportunity of the X PRACH opportunities that is not mapped to any of the Q PRACH opportunity groups cannot be used for multiple PRACH transmission.

[0174] In some embodiments, Q PRACH opportunity groups may be used for multiple PRACH transmissions, e.g., Q PRACH opportunity groups may be used by the first node for multiple PRACH transmissions.

[0175] In some embodiments, a PRACH opportunity in each of the Q PRACH opportunity groups may be used for multiple PRACH transmissions, in other words, multiple PRACH transmissions may be performed on PRACH opportunities in each of the Q PRACH opportunity groups.

[0176] In some embodiments, the multiple PRACH transmissions correspond to random access channel attempts.

[0177] In some embodiments, multiple PRACH transmissions are used for random access channel attempts.

[0178] In some embodiments, the multiple PRACH transmissions include transmission of multiple random access preambles in a random access channel attempt.

[0179] In some embodiments, multiple PRACH opportunities in each of the Q PRACH opportunity groups may be used to transmit multiple random access preambles.

[0180] At S520, the first node receives the second information.

[0181] In some embodiments, the second information is used to determine a plurality of candidate values.

[0182] In some embodiments, the second information is used to indicate multiple possible values.

[0183] In some embodiments, the plurality of candidate values may include or be replaced by at least one of a plurality of ROG sizes or a plurality of candidate values for the number of PRACHs in a multiple PRACH transmission, i.e., in some embodiments, the second information is used to determine (or indicate) a plurality of ROG sizes, or the second information is used to determine (or indicate) a plurality of candidate values for the number of PRACHs in a multiple PRACH transmission.

[0184] In some embodiments, the second information is received by the first node through a second receiver.

[0185] In some embodiments, the second information is transmitted to the first node by the second node, e.g., the second information is transmitted to the first node by a network device or another node.

[0186] In some embodiments, the second information is transmitted through a physical layer (PHY), high-level signaling, or higher-level signaling, for example, through PHY signaling, RRC layer signaling, or MAC layer signaling.

[0187] In some embodiments, the PHY signaling may include or be replaced by at least one of a Downlink Control Information (DCI), a Physical Broadcast Channel (PBCH), and a Demodulation Reference Signal (DMRS).

[0188] In some embodiments, the second information is used by the first node to determine a plurality of candidate values.

[0189] In some embodiments, each of the plurality of candidate values is a respective positive integer.

[0190] In some embodiments, each of the plurality of candidate values is one of {2, 4, 8}.

[0191] In some embodiments, each of the plurality of candidate values is one of {1, 2, 4, 8}.

[0192] In some embodiments, any two of the plurality of candidate values are different from each other.

[0193] In some embodiments, the plurality of candidate values includes at least two of {2,4,8}. For example, the plurality of candidate values includes {2,4}, or the plurality of candidate values includes {2,8}, or the plurality of candidate values includes {4,8}, or the plurality of candidate values includes {2,4,8}.

[0194] In some embodiments, the plurality of candidate values includes at least two of {1,2,4,8}. For example, the plurality of candidate values includes {1,2}, or the plurality of candidate values includes {1,4}, or the plurality of candidate values includes {1,2,4}, or the plurality of candidate values includes {1,2,8}, or the plurality of candidate values includes {1,2,4,8}, etc.

[0195] In some embodiments, the first candidate value is the maximum value among a plurality of candidate values, or the first candidate value is the maximum ROG size among a plurality of ROG sizes.

[0196] As one example, when the plurality of candidate values includes 2 and 4, the first candidate value is 4. As another example, when the plurality of candidate values includes 2 and 8, the first candidate value is 8. As another example, when the plurality of candidate values includes 4 and 8, the first candidate value is 8. As another example, when the plurality of candidate values includes 2, 4, and 8, the first candidate value is 8.

[0197] In some embodiments, the number of PRACH opportunities in each of the Q PRACH opportunity groups is a corresponding candidate value from a plurality of candidate values. For example, taking the plurality of candidate values including at least two of {1, 2, 4, 8}, when the plurality of candidate values includes {2, 4}, the number of PRACH opportunities in each of the Q PRACH opportunity groups is one of {2, 4}, when the plurality of candidate values includes {2, 4, 8}, the number of PRACH opportunities in each of the Q PRACH opportunity groups is one of {2, 4, 8}, and so on.

[0198] In some embodiments, the number of PRACH opportunities in the PRACH opportunity group corresponding to each one of the plurality of candidate values is equal to the respective candidate value, or in other words, the number of PRACH opportunities in each PRACH opportunity group of the at least one PRACH opportunity group corresponding to each one of the plurality of candidate values is equal to the respective candidate value.

[0199] In some embodiments, the first candidate value is one respective candidate value of the plurality of candidate values, and the number of PRACH opportunities in the PRACH opportunity group corresponding to the first candidate value is (equal to) the first candidate value.

[0200] In some embodiments, the first candidate value is one respective candidate value of a plurality of candidate values, the first candidate value corresponds to one PRACH opportunity group, and the number of PRACH opportunities in one PRACH opportunity group corresponding to the first candidate value is equal to the first candidate value.

[0201] In some embodiments, the first candidate value is one respective candidate value of a plurality of candidate values, the first candidate value corresponds to a plurality of PRACH opportunity groups, and the number of PRACH opportunities in the one respective PRACH opportunity group of the plurality of PRACH opportunity groups corresponding to the first candidate value is equal to the first candidate value.

[0202] In some embodiments, the first candidate value is one respective candidate value of the plurality of candidate values, the first candidate value corresponds to at least one PRACH opportunity group, and the number of PRACH opportunities in one respective PRACH opportunity group of the at least one PRACH opportunity group corresponding to the first candidate value is equal to the first candidate value.

[0203] The order of execution of operations S510 and S520 is not specified in the embodiments of the present disclosure. For example, operation S510 may be executed before operation S520, after operation S520, or simultaneously with operation S520.

[0204] In an embodiment of the present disclosure, the mapping of the X PRACH opportunities to the Q PRACH opportunity groups may be related to multiple factors (parameters) including, for example, one or more of a plurality of candidate values, a number of PRACH opportunity groups corresponding to each candidate value among the plurality of candidate values, and the like.

[0205] In some embodiments, the plurality of candidate values includes a first candidate value and a second candidate value, and a larger one of the first candidate value and the second candidate value is prioritized for mapping the X PRACH opportunities to the Q PRACH opportunity groups, and / or the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of PRACH opportunity groups that respectively correspond to each candidate value among the plurality of candidate values.

[0206] In some embodiments, the larger of the first and second candidate values is prioritized for mapping the X PRACH opportunities to the Q PRACH opportunity groups, in other words, priority is given to determining the PRACH opportunity group corresponding to the larger of the first and second candidate values.

[0207] In some embodiments, the first candidate value and the second candidate value each represent a different ROG size, and the mapping of the X PRACH opportunities to a PRACH opportunity group with a larger ROG size or the determination of a PRACH opportunity group with a larger ROG size is prioritized.

[0208] As an example, the first candidate value is 2, the second candidate value is 4, and the candidate value 4 is prioritized for mapping X PRACH opportunities to Q PRACH opportunity groups. In other words, priority is given to determining a PRACH opportunity group corresponding to candidate value 4. In other words, priority is given to mapping X PRACH opportunities to PRACH opportunity groups with an ROG size of 4. In other words, priority is given to determining a PRACH opportunity group with an ROG size of 4.

[0209] In some embodiments, the larger of the plurality of candidate values is prioritized for mapping the X PRACH opportunities to the Q PRACH opportunity groups, i.e., priority is given to determining the PRACH opportunity group corresponding to the larger of the plurality of candidate values.

[0210] As an example, the plurality of candidate values includes {4, 8}, and the candidate value 8 is prioritized for mapping X PRACH opportunities to Q PRACH opportunity groups. In other words, priority is given to determining a PRACH opportunity group corresponding to the candidate value 8. In other words, priority is given to mapping X PRACH opportunities to PRACH opportunity groups with an ROG size of 8. In other words, priority is given to determining a PRACH opportunity group with an ROG size of 8.

[0211] As another example, the plurality of candidate values includes {2, 4, 8}. Compared with mapping X PRACH opportunities to PRACH opportunity groups corresponding to candidate value 2, mapping X PRACH opportunities to PRACH opportunity groups corresponding to candidate value 4 and / or 8 has a higher priority, and compared with mapping X PRACH opportunities to PRACH opportunity groups corresponding to candidate value 4, mapping X PRACH opportunities to PRACH opportunity groups corresponding to candidate value 8 has a higher priority. In other words, compared with mapping X PRACH opportunities to PRACH opportunity groups with ROG size 2, mapping X PRACH opportunities to PRACH opportunity groups with ROG size 4 and / or 8 has a higher priority, and compared with mapping X PRACH opportunities to PRACH opportunity groups with ROG size 4, mapping X PRACH opportunities to PRACH opportunity groups with ROG size 8 has a higher priority.

[0212] In some embodiments, the multiple candidate values are used in descending order for mapping the X PRACH opportunities to the Q PRACH opportunity groups.

[0213] In some embodiments, the Q PRACH opportunity groups are determined in descending order of the plurality of candidate values.

[0214] In some embodiments, when a communication system is configured to have multiple ROG sizes, the multiple ROG sizes are used in mapping the X PRACH opportunities to the Q PRACH opportunity groups in descending order.

[0215] In some embodiments, when the communication system is configured to have multiple ROG sizes, the Q PRACH opportunity groups are determined in descending order of the multiple ROG sizes.

[0216] As an example, the plurality of candidate values includes {2, 4, 8}. The candidate value 8 is prioritized for mapping X PRACH opportunities to Q PRACH opportunity groups, then the candidate value 4 is used for mapping X PRACH opportunities to Q PRACH opportunity groups, and finally the candidate value 2 is used for mapping X PRACH opportunities to Q PRACH opportunity groups. In other words, the plurality of candidate values includes {2, 4, 8}, and priority is given to mapping X PRACH opportunities to PRACH opportunity groups with an ROG size of 8, then priority is given to mapping X PRACH opportunities to PRACH opportunity groups with an ROG size of 4, and finally priority is given to mapping X PRACH opportunities to PRACH opportunity groups with an ROG size of 2. In other words, the plurality of candidate values includes {2, 4, 8}, and priority is given to determining PRACH opportunity groups with an ROG size of 8, then priority is given to determining PRACH opportunity groups with an ROG size of 4, and finally priority is given to determining PRACH opportunity groups with an ROG size of 2.

[0217] As another example, the plurality of candidate values includes {1, 2, 4}. The candidate value 4 is prioritized for mapping X PRACH opportunities to Q PRACH opportunity groups, then the candidate value 2 is used for mapping X PRACH opportunities to Q PRACH opportunity groups, and finally the candidate value 1 is used for mapping X PRACH opportunities to Q PRACH opportunity groups. In other words, the plurality of candidate values includes {1, 2, 4}, and priority is given to mapping X PRACH opportunities to PRACH opportunity groups with an ROG size of 4, then priority is given to mapping X PRACH opportunities to PRACH opportunity groups with an ROG size of 2, and finally priority is given to mapping X PRACH opportunities to PRACH opportunity groups with an ROG size of 1. In other words, the plurality of candidate values includes {1, 2, 4}, and priority is given to determining PRACH opportunity groups with an ROG size of 4, then priority is given to determining PRACH opportunity groups with an ROG size of 2, and finally priority is given to determining PRACH opportunity groups with an ROG size of 1.

[0218] In some embodiments, the maximum value of the plurality of candidate values is prioritized for mapping the X PRACH opportunities to the Q PRACH opportunity groups, i.e., priority is given to determining the PRACH opportunity group corresponding to the maximum value of the plurality of candidate values.

[0219] In some embodiments, when multiple candidate values represent different ROG sizes, the mapping of the X PRACH opportunities to the PRACH opportunity group with the largest ROG size is prioritized, or the determination of the PRACH opportunity group with the largest ROG size is prioritized.

[0220] As an example, when multiple candidate values include {2, 4, 8}, candidate value 8 is prioritized for mapping X PRACH opportunities to Q PRACH opportunity groups, or priority is given to determining a PRACH opportunity group corresponding to candidate value 8, or priority is given to mapping X PRACH opportunities to PRACH opportunity groups with an ROG size of 8, or priority is given to determining a PRACH opportunity group with an ROG size of 8.

[0221] As another example, when multiple candidate values include {1, 2, 4}, candidate value 4 is prioritized for mapping X PRACH opportunities to Q PRACH opportunity groups, or the determination of a PRACH opportunity group corresponding to candidate value 4 is prioritized, or the mapping of X PRACH opportunities to PRACH opportunity groups with an ROG size of 4 is prioritized, or the determination of a PRACH opportunity group with an ROG size of 4 is prioritized.

[0222] Due to the fact that a larger candidate value (larger ROG size) requires more PRACH opportunities that do not overlap each other in the time domain, the requirements for PRACH opportunities become stricter. Therefore, when mapping PRACH opportunities to PRACH opportunity groups, priority is given to mappings corresponding to larger candidate values, and then mappings corresponding to relatively smaller candidate values are performed. In this way, orphan PRACH opportunities can be minimized and resource utilization efficiency can be improved. In other words, when mapping PRACH opportunities to PRACH opportunity groups, priority is given to mappings corresponding to larger ROG sizes, and then mappings corresponding to relatively smaller ROG sizes are performed. In this way, orphan PRACH opportunities can be minimized and resource utilization efficiency can be improved.

[0223] In some embodiments, the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of PRACH opportunity groups that respectively correspond to each candidate value among the plurality of candidate values.

[0224] In some embodiments, the plurality of candidate values includes a first candidate value and a second candidate value, and the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of PRACH opportunity groups corresponding to the first candidate value and the number of PRACH opportunity groups corresponding to the second candidate value.

[0225] In some embodiments, the plurality of candidate values includes a first candidate value, a second candidate value, and a third candidate value, and the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of PRACH opportunity groups corresponding to the first candidate value, the number of PRACH opportunity groups corresponding to the second candidate value, and the number of PRACH opportunity groups corresponding to the third candidate value.

[0226] Embodiments of the present disclosure are not limited thereto, and the plurality of candidate values may include three or more candidate values, and the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of PRACH opportunity groups that correspond to each candidate value among the plurality of candidate values.

[0227] In some embodiments, the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to a respective number of PRACH opportunity groups having each ROG size among a plurality of ROG sizes.

[0228] In some embodiments, the plurality of ROG sizes includes a first ROG size and a second ROG size, and the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of PRACH opportunity groups having the first ROG size and the number of PRACH opportunity groups having the second ROG size.

[0229] In some embodiments, the plurality of ROG sizes includes a first ROG size, a second ROG size, and a third ROG size, and the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of PRACH opportunity groups having the first ROG size, the number of PRACH opportunity groups having the second ROG size, and the number of PRACH opportunity groups having the third ROG size.

[0230] Embodiments of the present disclosure are not limited thereto, and the multiple ROG sizes may include three or more ROG sizes, and the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the respective numbers of PRACH opportunity groups having each ROG size among the multiple ROG sizes.

[0231] As an example, the plurality of candidate values include {2, 4}, and the mapping of X PRACH opportunities to Q PRACH opportunity groups is related to the number of PRACH opportunity groups corresponding to candidate value 2 and the number of PRACH opportunity groups corresponding to candidate value 4. In other words, the mapping of X PRACH opportunities to Q PRACH opportunity groups is related to the number of PRACH opportunity groups with ROG size 2 and the number of PRACH opportunity groups with ROG size 4.

[0232] As another example, the plurality of candidate values include {2, 4, 8}, and the mapping of X PRACH opportunities to Q PRACH opportunity groups is related to the number of PRACH opportunity groups corresponding to candidate value 2, the number of PRACH opportunity groups corresponding to candidate value 4, and the number of PRACH opportunity groups corresponding to candidate value 8. In other words, the mapping of X PRACH opportunities to Q PRACH opportunity groups is related to the number of PRACH opportunity groups with ROG size 2, the number of PRACH opportunity groups with ROG size 4, and the number of PRACH opportunity groups with ROG size 8.

[0233] In some embodiments, each opportunity group subset of the plurality of PRACH opportunity group subsets includes Q1 respective PRACH opportunity groups of the Q PRACH opportunity groups. In other words, in some embodiments, the Q PRACH opportunity groups may be divided into a plurality of PRACH opportunity group subsets, and each opportunity group subset of the plurality of PRACH opportunity group subsets includes at least one respective PRACH opportunity group of the Q PRACH opportunity groups.

[0234] In some embodiments, each of the plurality of candidate values corresponds to at least one respective PRACH opportunity group of the Q1 respective PRACH opportunity groups in each opportunity group subset of the plurality of PRACH opportunity group subsets, in other words, for one respective opportunity group subset of the plurality of PRACH opportunity group subsets, each of the plurality of candidate values corresponds to at least one respective PRACH opportunity group in the one respective opportunity group subset.

[0235] In some embodiments, each opportunity group subset of the plurality of PRACH opportunity group subsets includes Q1 respective PRACH opportunity groups of the Q PRACH opportunity groups, each of the plurality of candidate values corresponds to at least one respective PRACH opportunity group of the Q1 respective PRACH opportunity groups in each opportunity group subset of the plurality of PRACH opportunity group subsets, and any two opportunity group subsets of the plurality of PRACH opportunity group subsets corresponding to any one of the plurality of candidate values have the same number of PRACH opportunity groups.

[0236] In some embodiments, the plurality of candidate values include a first candidate value and a second candidate value, and the plurality of PRACH opportunity group subsets include a first opportunity group subset and a second opportunity group subset. For the first opportunity group subset, the first candidate value corresponds to at least one PRACH opportunity group of the Q1 PRACH opportunity groups in the first opportunity group subset, and the second candidate value corresponds to at least one PRACH opportunity group of the Q1 PRACH opportunity groups in the first opportunity group subset. For the second opportunity group subset, the first candidate value corresponds to at least one PRACH opportunity group of the Q1 PRACH opportunity groups in the second opportunity group subset, and the second candidate value corresponds to at least one PRACH opportunity group of the Q1 PRACH opportunity groups in the second opportunity group subset.

[0237] In some embodiments, the plurality of candidate values include a first candidate value, a second candidate value, and a third candidate value, and the plurality of PRACH opportunity group subsets include a first opportunity group subset and a second opportunity group subset, where for the first opportunity group subset, the first candidate value corresponds to at least one PRACH opportunity group of the Q1 PRACH opportunity groups in the first opportunity group subset, the second candidate value corresponds to at least one PRACH opportunity group of the Q1 PRACH opportunity groups in the first opportunity group subset, and the third candidate value corresponds to at least one PRACH opportunity group of the Q1 PRACH opportunity groups in the first opportunity group subset. For the second opportunity group subset, the first candidate value corresponds to at least one PRACH opportunity group of the Q1 PRACH opportunity groups in the second opportunity group subset, the second candidate value corresponds to at least one PRACH opportunity group of the Q1 PRACH opportunity groups in the second opportunity group subset, and the third candidate value corresponds to at least one PRACH opportunity group of the Q1 PRACH opportunity groups in the second opportunity group subset.

[0238] In some embodiments, at least two of the plurality of PRACH opportunity group subsets corresponding to any one of the plurality of candidate values have the same number of PRACH opportunity groups.

[0239] As an example, the plurality of candidate values includes {2, 4}, and the plurality of PRACH opportunity group subsets includes a first opportunity group subset, a second opportunity group subset, and a third opportunity group subset. The number of PRACH opportunity groups corresponding to candidate value 2 in the first opportunity group subset is equal to the number of PRACH opportunity groups corresponding to candidate value 2 in the second opportunity group subset, but is not equal to the number of PRACH opportunity groups corresponding to candidate value 2 in the third opportunity group subset. Alternatively, the number of PRACH opportunity groups corresponding to candidate value 2 in the first opportunity group subset is equal to the number of PRACH opportunity groups corresponding to candidate value 2 in the second opportunity group subset and the number of PRACH opportunity groups corresponding to candidate value 2 in the third opportunity group subset.

[0240] In some embodiments, each opportunity group subset of the plurality of PRACH opportunity group subsets corresponding to any one of the plurality of candidate values has a different number of PRACH opportunity groups than the number of PRACH opportunity groups in the remaining opportunity group subsets of the portion of the plurality of PRACH opportunity group subsets.

[0241] In some embodiments, any two opportunity group subsets of the plurality of PRACH opportunity group subsets corresponding to any one of the plurality of candidate values have the same number of PRACH opportunity groups.

[0242] In some embodiments, the first opportunity group subset and the second opportunity group subset are two opportunity group subsets of a plurality of PRACH opportunity group subsets, wherein the number of PRACH opportunity groups in the first opportunity group subset corresponding to the first candidate value is equal to the number of PRACH opportunity groups in the second opportunity group subset corresponding to the first candidate value, and the number of PRACH opportunity groups in the first opportunity group subset corresponding to the second candidate value is equal to the number of PRACH opportunity groups in the second opportunity group subset corresponding to the second candidate value.

[0243] As an example, the plurality of candidate values includes {2, 4}, and the plurality of PRACH opportunity group subsets includes a first opportunity group subset and a second opportunity group subset, where the number of PRACH opportunity groups in the first opportunity group subset corresponding to candidate value 2 is equal to the number of PRACH opportunity groups in the second opportunity group subset corresponding to candidate value 2, and the number of PRACH opportunity groups in the first opportunity group subset corresponding to candidate value 4 is equal to the number of PRACH opportunity groups in the second opportunity group subset corresponding to candidate value 4.

[0244] As another example, the plurality of candidate values includes {2, 4}, and the plurality of PRACH opportunity group subsets includes a first opportunity group subset, a second opportunity group subset, and a third opportunity group subset. The number of PRACH opportunity groups in the first opportunity group subset corresponding to candidate value 2 is equal to the number of PRACH opportunity groups in the second opportunity group subset corresponding to candidate value 2 and the number of PRACH opportunity groups in the third opportunity group subset corresponding to candidate value 2. The number of PRACH opportunity groups in the first opportunity group subset corresponding to candidate value 4 is equal to the number of PRACH opportunity groups in the second opportunity group subset corresponding to candidate value 4 and the number of PRACH opportunity groups in the third opportunity group subset corresponding to candidate value 4.

[0245] As yet another example, the plurality of candidate values includes {2, 4, 8}, and the plurality of PRACH opportunity group subsets includes a first opportunity group subset, a second opportunity group subset, and a third opportunity group subset. The number of PRACH opportunity groups in the first opportunity group subset corresponding to candidate value 2 is equal to the number of PRACH opportunity groups in the second opportunity group subset corresponding to candidate value 2 and the number of PRACH opportunity groups in the third opportunity group subset corresponding to candidate value 2. The number of PRACH opportunity groups in the first opportunity group subset corresponding to candidate value 4 is equal to the number of PRACH opportunity groups in the second opportunity group subset corresponding to candidate value 4 and the number of PRACH opportunity groups in the third opportunity group subset corresponding to candidate value 4. The number of PRACH opportunity groups in the first opportunity group subset corresponding to candidate value 8 is equal to the number of PRACH opportunity groups in the second opportunity group subset corresponding to candidate value 8 and the number of PRACH opportunity groups in the third opportunity group subset corresponding to candidate value 8.

[0246] In some embodiments, at least two opportunity group subsets of the plurality of PRACH opportunity group subsets have the same number of PRACH opportunity groups.

[0247] In some embodiments, any two opportunity group subsets of the plurality of PRACH opportunity group subsets have the same number of PRACH opportunity groups.

[0248] In some embodiments, the plurality of PRACH opportunity group subsets includes a first opportunity group subset and a second opportunity group subset, and the number of PRACH opportunity groups in the first opportunity group subset is equal to the number of PRACH opportunity groups in the second opportunity group subset.

[0249] In some embodiments, the plurality of PRACH opportunity group subsets include a first opportunity group subset, a second opportunity group subset, and a third opportunity group subset, and the number of PRACH opportunity groups in the first opportunity group subset is equal to the number of PRACH opportunity groups in the second opportunity group subset and the number of PRACH opportunity groups in the third opportunity group subset.

[0250] In some embodiments, the number of at least one respective PRACH opportunity group in each opportunity group subset of the plurality of PRACH opportunity group subsets corresponding to one respective candidate value of the plurality of candidate values corresponds to a value, and the values corresponding to the plurality of candidate values are values in a first proportion.

[0251] In some embodiments, the plurality of candidate values includes a first candidate value and a second candidate value, and a ratio of the number of PRACH opportunity groups in each opportunity group subset of the plurality of PRACH opportunity group subsets corresponding to the first candidate value to the number of PRACH opportunity groups in each opportunity group subset of the plurality of PRACH opportunity group subsets corresponding to the second candidate value is a first ratio.

[0252] In some embodiments, the plurality of candidate values includes a first candidate value and a second candidate value, and the plurality of PRACH opportunity group subsets includes a first opportunity group subset and a second opportunity group subset. A ratio of the number of PRACH opportunity groups in the first opportunity group subset corresponding to the first candidate value to the number of PRACH opportunity groups in the first opportunity group subset corresponding to the second candidate value is a first ratio. A ratio of the number of PRACH opportunity groups in the second opportunity group subset corresponding to the first candidate value to the number of PRACH opportunity groups in the second opportunity group subset corresponding to the second candidate value is a first ratio.

[0253] As an example, the number of PRACH opportunity groups in each opportunity group subset among the plurality of PRACH opportunity group subsets corresponding to a first candidate value is A, the number of PRACH opportunity groups in each opportunity group subset among the plurality of PRACH opportunity group subsets corresponding to a second candidate value is B, and the first ratio may be expressed as A:B.

[0254] As an example, the number of PRACH opportunity groups in the first opportunity group subset corresponding to the first candidate value is A1, the number of PRACH opportunity groups in the first opportunity group subset corresponding to the second candidate value is B1, and the first ratio may be expressed as A1:B1. The number of PRACH opportunity groups in the second opportunity group subset corresponding to the first candidate value is A2, the number of PRACH opportunity groups in the second opportunity group subset corresponding to the second candidate value is B2, and the first ratio may be expressed as A2:B2, where A1:B1 is equal to A2:B2.

[0255] In some embodiments, the plurality of candidate values include a first candidate value, a second candidate value, and a third candidate value, and a ratio of the number of PRACH opportunity groups in each opportunity group subset among the plurality of PRACH opportunity group subsets corresponding to the first candidate value to the number of PRACH opportunity groups in each opportunity group subset among the plurality of PRACH opportunity group subsets corresponding to the second candidate value and the number of PRACH opportunity groups in each opportunity group subset among the plurality of PRACH opportunity group subsets corresponding to the third candidate value is a first ratio.

[0256] In some embodiments, the plurality of candidate values include a first candidate value, a second candidate value, and a third candidate value, and the plurality of PRACH opportunity group subsets include a first opportunity group subset and a second opportunity group subset. A ratio of the number of PRACH opportunity groups in the first opportunity group subset corresponding to the first candidate value to the number of PRACH opportunity groups in the first opportunity group subset corresponding to the second candidate value and the number of PRACH opportunity groups in the first opportunity group subset corresponding to the third candidate value is a first ratio. A ratio of the number of PRACH opportunity groups in the second opportunity group subset corresponding to the first candidate value to the number of PRACH opportunity groups in the second opportunity group subset corresponding to the second candidate value and the number of PRACH opportunity groups in the second opportunity group subset corresponding to the third candidate value is a first ratio.

[0257] As an example, the number of PRACH opportunity groups in each opportunity group subset among the plurality of PRACH opportunity group subsets corresponding to a first candidate value is A, the number of PRACH opportunity groups in each opportunity group subset among the plurality of PRACH opportunity group subsets corresponding to a second candidate value is B, the number of PRACH opportunity groups in each opportunity group subset among the plurality of PRACH opportunity group subsets corresponding to a third candidate value is C, and the first ratio may be expressed as A:B:C.

[0258] As an example, the number of PRACH opportunity groups in the first opportunity group subset corresponding to the first candidate value is A1, the number of PRACH opportunity groups in the first opportunity group subset corresponding to the second candidate value is B1, the number of PRACH opportunity groups in the first opportunity group subset corresponding to the third candidate value is C1, and the first ratio may be expressed as A1:B1:C1. The number of PRACH opportunity groups in the second opportunity group subset corresponding to the first candidate value is A2, the number of PRACH opportunity groups in the second opportunity group subset corresponding to the second candidate value is B2, the number of PRACH opportunity groups in the second opportunity group subset corresponding to the third candidate value is C2, and the first ratio may be expressed as A2:B2:C2, and A1:B1:C1 is equal to A2:B2:C2.

[0259] In some embodiments, the first ratio is fixed.

[0260] In some embodiments, the first ratio is configurable.

[0261] In some embodiments, the first rate is configured by high level signaling or higher level signaling, for example, the first rate is configured by RRC signaling and / or MAC CE signaling.

[0262] In some embodiments, the first ratio is a ratio of the number of PRACH opportunity groups to be determined, each corresponding to a plurality of candidate values.

[0263] In some embodiments, the plurality of candidate values includes a first candidate value and a second candidate value, and the first ratio is a ratio of the number of PRACH opportunity groups to be determined corresponding to the first candidate value to the number of PRACH opportunity groups to be determined corresponding to the second candidate value.

[0264] In some embodiments, the plurality of candidate values include a first candidate value, a second candidate value, and a third candidate value, and the first ratio is a ratio of the number of PRACH opportunity groups to be determined corresponding to the first candidate value to the number of PRACH opportunity groups to be determined corresponding to the second candidate value and the number of PRACH opportunity groups to be determined corresponding to the third candidate value.

[0265] In some embodiments, the first ratio is equal to the greatest common divisor of the numbers of PRACH opportunity groups to be determined that correspond to the plurality of candidate values, respectively.

[0266] In some embodiments, each opportunity group subset of the plurality of PRACH opportunity group subsets includes X1 respective PRACH opportunities of the X PRACH opportunities, and in each opportunity group subset of the plurality of PRACH opportunity group subsets, the plurality of candidate values are used in descending order to map the X1 respective PRACH opportunities to Q1 respective PRACH opportunity groups.

[0267] In some embodiments, each opportunity group subset of the plurality of PRACH opportunity group subsets includes X1 respective PRACH opportunities of the X PRACH opportunities, and the plurality of candidate values include a first candidate value and a second candidate value, the first candidate value being greater than the second candidate value. In each opportunity group subset of the plurality of PRACH opportunity group subsets, priority is given to mapping the X1 respective PRACH opportunities corresponding to the first candidate value to the Q1 respective PRACH opportunity groups, followed by mapping the X1 respective PRACH opportunities corresponding to the second candidate value to the Q1 respective PRACH opportunity groups.

[0268] In some embodiments, each opportunity group subset of the plurality of PRACH opportunity group subsets includes X1 respective PRACH opportunities of the X PRACH opportunities, and the plurality of candidate values include a first candidate value, a second candidate value, and a third candidate value, where the first candidate value is greater than the second candidate value and the second candidate value is greater than the third candidate value. In each opportunity group subset of the plurality of PRACH opportunity group subsets, priority is given to mapping the X1 respective PRACH opportunities corresponding to the first candidate value to the Q1 respective PRACH opportunity groups, followed by mapping the X1 respective PRACH opportunities corresponding to the second candidate value to the Q1 respective PRACH opportunity groups, and finally by mapping the X1 respective PRACH opportunities corresponding to the third candidate value to the Q1 respective PRACH opportunity groups.

[0269] In some embodiments, each opportunity group subset of the plurality of PRACH opportunity group subsets includes X1 respective PRACH opportunities of the X PRACH opportunities, and in each opportunity group subset of the plurality of PRACH opportunity group subsets, larger values of the plurality of candidate values are prioritized for mapping the X1 respective PRACH opportunities to the Q1 respective PRACH opportunity groups.

[0270] In some embodiments, each opportunity group subset of the plurality of PRACH opportunity group subsets includes X1 respective PRACH opportunities of the X PRACH opportunities, and in each opportunity group subset of the plurality of PRACH opportunity group subsets, a larger of a first candidate value and a second candidate value is prioritized for mapping the X1 respective PRACH opportunities to the Q1 respective PRACH opportunity groups, where the first candidate value and the second candidate value are two of the plurality of candidate values.

[0271] In some embodiments, each opportunity group subset of the plurality of PRACH opportunity group subsets includes X1 respective PRACH opportunities of the X PRACH opportunities, and in each opportunity group subset of the plurality of PRACH opportunity group subsets, the maximum of the plurality of candidate values is prioritized for mapping the X1 respective PRACH opportunities to the Q1 respective PRACH opportunity groups.

[0272] In the process of mapping X PRACH opportunities to Q PRACH opportunity groups, the mapping of each X1 PRACH opportunity to each Q1 PRACH opportunity group is determined according to the opportunity group subset. In this way, when the first node uses a ROG with a relatively small size for multiple PRACH transmission, it can be ensured that random access resources can be found in different cycles, which contributes to balancing random access delay and collision probability. In other words, it contributes to reducing orphan PRACH opportunities and random access delay.

[0273] The above description illustrates that in the process of mapping X PRACH opportunities to Q PRACH opportunity groups, a larger candidate value among multiple candidate values is prioritized for mapping PRACH opportunities to PRACH opportunity groups, and / or the number of PRACH opportunity groups corresponding to each candidate value is used for mapping PRACH opportunities to PRACH opportunity groups. Taking these factors into consideration can contribute to optimizing the mapping scheme of PRACH opportunities to PRACH opportunity groups, thereby reducing or preventing the generation of orphan PRACH opportunities, or taking these factors into consideration can contribute to reducing resource waste, or taking these factors into consideration can contribute to optimizing resource allocation for multiple PRACH transmissions, or taking these factors into consideration can contribute to improving the performance of multiple PRACH transmissions and expanding the coverage range, or taking these factors into consideration can contribute to reducing random access delay and improving the utilization efficiency of random access resources.

[0274] For ease of understanding, two implementations of mapping PRACH opportunities to PRACH opportunity groups are illustrated below with reference to Figures 6 and 7.

[0275] Implementation 1: Multiple candidate values are used in descending order for mapping from RO to ROG.

[0276] When the multiple candidate values include 2 and 4, in the process of mapping RO to ROG, X1 PRACH opportunity groups corresponding to the candidate value 4 may be determined first, and then X2 PRACH opportunity groups corresponding to the candidate value 2 may be determined. In other words, when the multiple ROG sizes include 2 and 4, in the process of mapping RO to ROG, X1 PRACH opportunity groups with an ROG size of 4 may be determined first, and then X2 PRACH opportunity groups with an ROG size of 2 may be determined.

[0277] When the multiple candidate values include 2, 4, and 8, in the process of mapping RO to ROG, X1 PRACH opportunity groups corresponding to candidate value 8 may be determined first, then X2 PRACH opportunity groups corresponding to candidate value 4 may be determined, and finally X3 PRACH opportunity groups corresponding to candidate value 2 may be determined. In other words, when the multiple ROG sizes include 2, 4, and 8, in the process of mapping RO to ROG, X1 PRACH opportunity groups with ROG size 8 may be determined first, then X2 PRACH opportunity groups with ROG size 4 may be determined, and finally X3 PRACH opportunity groups with ROG size 2 may be determined.

[0278] As shown in Figure 6, in the example shown in Figure 6, the multiple candidate values include 2 and 4 in descending order of the multiple candidate values, and a PRACH opportunity group corresponding to candidate value 4 is determined first. Referring to the PRACH opportunity groups with an ROG size of 4 shown in Figure 6, these PRACH opportunity groups with an ROG size of 4 include RO#1, RO#3, RO#9, and RO#11. Then, a PRACH opportunity group corresponding to candidate value 2 is determined. Referring to the PRACH opportunity groups with an ROG size of 2 shown in Figure 6, these PRACH opportunity groups with an ROG size of 2 include RO#17 and RO#19.

[0279] In some embodiments, when multiple candidate values are used to map ROs to ROGs in descending order, if a first node (such as a first node with good channel quality) selects a relatively small candidate value (ROG with a relatively small size) for multiple PRACH transmissions, the available ROG resources may be positioned backward, resulting in a relatively high random access delay for the first node.

[0280] Implementation 2: In each opportunity group subset, multiple candidate values are used in descending order for mapping from RO to ROG.

[0281] For PRACH opportunity groups corresponding to multiple candidate values (multiple ROG sizes), the PRACH opportunity groups corresponding to different candidate values (different ROG sizes) may be determined according to a certain proportionality factor (such as the first ratio as described above), and the PRACH opportunity groups corresponding to these different candidate values are in the same opportunity group subset.

[0282] In some embodiments, in each opportunity group subset, priority may be given to determining PRACH opportunity groups that correspond to relatively large candidate values (relatively large ROG sizes).

[0283] In some embodiments, after mapping of PRACH opportunities to PRACH opportunity groups in an opportunity group subset, mapping of PRACH opportunities to PRACH opportunity groups in the next opportunity group subset may be performed until mapping of X PRACH opportunities to Q PRACH opportunity groups is completed.

[0284] 7, in the example shown in FIG. 7, the multiple candidate values include 2, 4, and 8, and the number of ROGs to be determined whose ROG size is 8 is S1, the number of ROGs to be determined whose ROG size is 4 is S2, and the number of ROGs to be determined whose ROG size is 2 is S3. In one implementation, according to a certain proportional coefficient (for example, the ratio of the number of ROGs whose ROG size is 8 to the number of ROGs whose ROG size is 4 and the number of ROGs whose ROG size is 2 is t1:t2:t3), Y1 ROGs whose ROG size is 8 are first determined, then Y2 ROGs whose ROG size is 4 are determined, and finally Y3 ROGs whose ROG size is 2 are determined, where Y1=a*t1, Y1 is less than or equal to S1, Y2=a*t2, Y2 is less than or equal to S2, and Y3=a*t3, Y3 is less than or equal to S3. After determining the set of Y1+Y2+Y3 ROGs, the next set of Y1+Y2+Y3 ROGs is determined, and so on, until the remaining ROs cannot meet the requirements for mapping to the set of Y1+Y2+Y3 ROGs. The remaining ROs are then assigned to ROGs with one or two sizes, where t1:t2:t3 can be the greatest common divisor of S1:S2:S3.

[0285] As shown in FIG. 7, the proportional coefficient (first ratio) of the number of ROGs corresponding to the multiple candidate values (2, 4, 8) is 1:2:8. According to this ratio, Y1 ROGs with an ROG size of 8 are first determined (in the example shown in FIG. 7, one ROG with an ROG size of 8 is first determined), then Y2 ROGs with an ROG size of 4 are determined (in the example shown in FIG. 7, two ROGs with an ROG size of 4 are determined), and finally Y3 ROGs with an ROG size of 2 are determined (in the example shown in FIG. 7, eight ROGs with an ROG size of 2 are determined). After determining the set of Y1+Y2+Y3 ROGs, the next set of Y1+Y2+Y3 ROGs is determined until the remaining ROs cannot meet the requirements for mapping to the set of Y1+Y2+Y3 ROGs. Then, the remaining ROs are assigned to ROGs with one or two of the ROG sizes.

[0286] When the mapping scheme provided by Implementation 2 is used, when the first node uses a ROG having a relatively small size for multiple PRACH transmissions, it can be ensured that random access resources can be found in different cycles, thereby balancing the random access delay and the collision probability. In other words, the mapping scheme provided by Implementation 2 can reduce the random access delay of multiple PRACH transmissions that occupy a ROG having a relatively small size, thereby improving the performance enhancement of multiple PRACH transmissions, expanding the coverage range, and improving the utilization efficiency of random access resources.

[0287] In some embodiments, in addition to the elements illustrated above, the mapping of X PRACH opportunities to Q PRACH opportunity groups may involve other information, and embodiments of the present disclosure are not limited thereto. Some other information is illustrated below using examples.

[0288] In some embodiments, the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to one or more of the number of frequency division multiplexing PRACH opportunities in the time instance, the number of synchronization signal blocks associated with each of the X PRACH opportunities, and the number of random access preambles corresponding to each of the synchronization signal blocks associated with the X PRACH opportunities.

[0289] In some embodiments, the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of frequency division multiplexing PRACH opportunities at the time instance, in other words, the determined Q PRACH opportunity groups may change when the number of frequency division multiplexing PRACH opportunities at the time instance changes.

[0290] In some embodiments, the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of synchronization signal blocks associated with each of the X PRACH opportunities. In other words, the determined Q PRACH opportunity groups may change when the number of synchronization signal blocks associated with each of the X PRACH opportunities changes.

[0291] In some embodiments, the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of random access preambles corresponding to each of the plurality of synchronization signal blocks associated with the X PRACH opportunities. In other words, the determined Q PRACH opportunity groups may change when the number of random access preambles corresponding to each of the plurality of synchronization signal blocks associated with the X PRACH opportunities changes.

[0292] In some embodiments, the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of frequency division multiplexing PRACH opportunities in a time instance and the number of synchronization signal blocks associated with each of the X PRACH opportunities.

[0293] In some embodiments, the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of frequency division multiplexing PRACH opportunities in a time instance, the number of synchronization signal blocks associated with each of the X PRACH opportunities, and the number of random access preambles corresponding to each of the multiple synchronization signal blocks associated with the X PRACH opportunities.

[0294] In some embodiments, after performing the RO-to-ROG mapping, the first node may select one or more of the determined ROGs to perform random access. This process is illustrated with reference to Figure 8 below.

[0295] 8 is a flowchart of another method applicable to a node for wireless communication provided in some embodiments of the present disclosure. The method shown in FIG. 8 is illustrated in terms of interactions between a first node and a second node. The first and second nodes have already been illustrated above and will not be repeated here.

[0296] The method as shown in FIG. 8 may include operations S810 through S830.

[0297] At S810, the first node receives first information, which is used to determine X PRACH opportunities.

[0298] At S820, the first node receives second information, which is used to determine a plurality of candidate values.

[0299] For an illustration of operations S810 and S820, see the above illustration of operations S510 and S520, which will not be repeated here for the sake of brevity.

[0300] At S830, the first node transmits multiple random access preambles on a first PRACH opportunity group.

[0301] In some embodiments, the first node transmits multiple random access preambles to the second node on a first PRACH opportunity group.

[0302] In some embodiments, at least two random access preambles of the plurality of random access preambles are identical to one another.

[0303] In some embodiments, any two random access preambles of the plurality of random access preambles are identical to each other. In other words, during multiple PRACH transmissions, the same random access preamble may be repeatedly transmitted on the first PRACH opportunity group, thereby improving the coverage capability of the PRACH.

[0304] In some embodiments, the first PRACH opportunity group is a respective one of the Q PRACH opportunity groups. For example, the first PRACH opportunity group may be any one of the Q PRACH opportunity groups.

[0305] In some embodiments, the first PRACH opportunity group includes one or more PRACH opportunities, and the one or more PRACH opportunities in the first PRACH opportunity group are configured to transmit multiple random access preambles.

[0306] In some embodiments, the first PRACH opportunity group includes only one PRACH opportunity, and the one PRACH opportunity in the first PRACH opportunity group is configured to transmit one random access preamble. In other words, the first PRACH opportunity group includes only one PRACH opportunity, and one random access preamble is transmitted on one PRACH opportunity in the first PRACH opportunity group.

[0307] In some embodiments, the first PRACH opportunity group includes a plurality of PRACH opportunities, and the plurality of PRACH opportunities in the first PRACH opportunity group are configured to transmit a plurality of random access preambles, respectively. In other words, the first PRACH opportunity group includes a plurality of PRACH opportunities, and the plurality of random access preambles are transmitted on the plurality of PRACH opportunities in the first PRACH opportunity group, respectively.

[0308] In some embodiments, the first sequence is used to generate multiple random access preambles, in other words, the multiple random access preambles transmitted on the first PRACH group of opportunities are generated using the first sequence.

[0309] The embodiments of the present disclosure do not specify the first sequence used to generate the multiple random access preambles. In some embodiments, the first sequence may be any sequence with good cross-correlation and autocorrelation properties. The following are some examples of first sequences:

[0310] In some embodiments, the first sequence is a pseudorandom sequence. In some other embodiments, the first sequence is an M sequence. In some other embodiments, the first sequence is a Gold sequence. The present disclosure is not limited thereto, for example, the first sequence can also be one or more of a Kasami sequence, a Barker sequence, a Zadoff-Chu sequence, and the like.

[0311] In some embodiments, the first sequence is a single sequence, e.g., the first sequence is an M sequence, the first sequence is a Gold sequence, or the like.

[0312] In some embodiments, the first sequence is a combination of multiple sequences, for example, the first sequence is a combination of a pseudorandom sequence and an M sequence, a combination of a pseudorandom sequence and a Gold sequence, or a similar combination.

[0313] In some embodiments, the above-mentioned X PRACH opportunities are in the first cycle.

[0314] In some embodiments, the first cycle refers to a mapping cycle for mapping PRACH opportunities to PRACH opportunity groups.

[0315] In some embodiments, the first cycle refers to a mapping cycle for mapping synchronization signal blocks to PRACH opportunities.

[0316] In some embodiments, the mapping cycle for mapping synchronization signal blocks to PRACH opportunities and the mapping cycle for mapping PRACH opportunities to PRACH opportunity groups are the same cycle.

[0317] In some embodiments, the first cycle refers to the associated period for the mapping of X PRACH opportunities to Q PRACH opportunity groups.

[0318] In some embodiments, the first cycle refers to an association period for mapping multiple candidate synchronization signal block indices to X PRACH opportunities.

[0319] In some embodiments, the association period for mapping the X PRACH opportunities to the Q PRACH opportunity groups and the association period for mapping the indices of the multiple candidate synchronization signal blocks to the X PRACH opportunities are the same period.

[0320] In some embodiments, the first cycle refers to an association pattern period that includes one or more association periods.

[0321] In some embodiments, the first cycle refers to a PRACH configuration cycle.

[0322] In some embodiments, the first cycle is the smallest value in the set determined by the PRACH configuration cycle.

[0323] In some embodiments, for the set determined by the PRACH configuration cycle, Table 1 may be referenced, ie, the value of the first cycle may be determined based on Table 1.

[0324] [Table 1]

[0325] In some embodiments, the first cycle starts at frame number 0.

[0326] In some embodiments, the mapping of X PRACH opportunities to Q PRACH opportunity groups is performed in the first cycle.

[0327] In some embodiments, the first cycle includes one or more PRACH time slots. Taking the first cycle including multiple PRACH time slots as an example, the first cycle may include two or more PRACH time slots.

[0328] In some embodiments, each of the X PRACH opportunities is a corresponding PRACH time slot of the plurality of PRACH time slots in the first cycle.

[0329] In some embodiments, the first cycle includes multiple PRACH opportunities.

[0330] As mentioned above, the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of PRACH opportunity groups that correspond to each candidate value among the plurality of candidate values. An example of how to determine the number of PRACH opportunity groups that correspond to each candidate value among the plurality of candidate values is provided below.

[0331] 9 is a flowchart of yet another method applicable to a node for wireless communication provided in some embodiments of the present disclosure. The method shown in FIG. 9 is illustrated in terms of interactions between a first node and a second node. The first and second nodes have already been illustrated above and will not be repeated here.

[0332] The method as shown in FIG. 9 may include operations S910 through S930.

[0333] At S910, the first node receives first information, which is used to determine X PRACH opportunities.

[0334] At S920, the first node receives second information, which is used to determine a plurality of candidate values.

[0335] For an illustration of operations S910 and S920, see the above illustration of operations S510 and S520, which will not be repeated here for the sake of brevity.

[0336] At S930, the first node receives third information, which is used to determine the number of PRACH opportunity groups corresponding to at least one candidate value among the plurality of candidate values. In other words, the third information is used to determine the number of multiple PRACH transmissions corresponding to at least one candidate value among the plurality of candidate values.

[0337] In some embodiments, the third information is transmitted by the second node to the first node.

[0338] In some embodiments, the third information is used to indicate the number of PRACH opportunity groups corresponding to at least one candidate value of the plurality of candidate values.

[0339] In some embodiments, the third information is used to determine a ratio of the number of PRACH opportunity groups among the Q PRACH opportunity groups corresponding to each of the plurality of candidate values.

[0340] In some embodiments, the ratio of the number of PRACH opportunity groups among the Q PRACH opportunity groups corresponding to each of the plurality of candidate values is equal to a first ratio (see above examples of the first ratio, which will not be repeated here for brevity).

[0341] In some embodiments, the third information is used to determine the first ratio.

[0342] In some embodiments, the number of random access preambles corresponding to at least one candidate value of the plurality of candidate values is used to determine the Q PRACH opportunity groups.

[0343] In some embodiments, the number of random access preambles in any one of a plurality of PRACH opportunity group subsets corresponding to at least one candidate value of the plurality of candidate values is used to determine the Q PRACH opportunity groups.

[0344] In some embodiments, relatively larger values of the plurality of candidate values are prioritized for determining the Q PRACH opportunity groups, and the number of random access preambles corresponding to at least one candidate value of the plurality of candidate values is used to determine the Q PRACH opportunity groups.

[0345] In some embodiments, the largest of the plurality of candidate values is prioritized for determining the Q PRACH opportunity groups, and the number of random access preambles corresponding to at least one candidate value of the plurality of candidate values is used to determine the Q PRACH opportunity groups.

[0346] In some embodiments, relatively larger values from the plurality of candidate values are determined in descending order from the plurality of candidate values and prioritized for determining the Q PRACH opportunity groups, and the number of random access preambles corresponding to at least one candidate value from the plurality of candidate values is used to determine the Q PRACH opportunity groups.

[0347] In some embodiments, at least one PRACH opportunity group corresponding to each of the plurality of candidate values is mapped in a first mapping order, the first mapping order including one or more of an increment order of random access preamble indices, an increment order of frequency resources, and an increment order of time resources.

[0348] In some embodiments, the at least one PRACH opportunity group corresponding to each of the plurality of candidate values is mapped in a first mapping order, i.e., the at least one PRACH opportunity group is first mapped in an incremental order of the random access preamble index, then in an incremental order of the frequency resource, and finally in an incremental order of the time resource.

[0349] In some embodiments, at least one PRACH opportunity group corresponding to the same candidate value is mapped in a first mapping order.

[0350] In some embodiments, at least one PRACH opportunity group corresponding to the same ROG size is mapped in a first mapping order.

[0351] In some embodiments, after determining the mapping of the X PRACH opportunities to the Q PRACH opportunity groups, the first node and / or the second node may perform random access based on the mapping relationship. For ease of understanding, the following takes a four-step random access process as an example to illustrate the random access processes of the first node and the second node.

[0352] 10 is a flowchart of a four-step random access process. As shown in FIG. 10, the four-step random access process may include operations S1010 to S1040.

[0353] At S1010 (first operation), the first node transmits a random access preamble to the second node, e.g., the first node transmits multiple random access preambles to the second node on a first PRACH opportunity group.

[0354] In some embodiments, for operation S1010, see the above description of operation S830.

[0355] In some embodiments, the first node transmits multiple random access preambles (also referred to as Message 1, Msg1, etc.) to the second node on PRACH resources of the first PRACH opportunity group.

[0356] In some embodiments, the first PRACH opportunity group is any one of the Q PRACH opportunity groups.

[0357] In S1020 (second operation), after detecting Msg1, the second node transmits a PDCCH scrambled by a random access radio network temporary identifier (RA-RNTI) to the first node.

[0358] In some embodiments, the PDCCH may be transmitted over resources in a Type 1-PDCCH common search space (CSS) on the initial BWP of the downlink.

[0359] In some embodiments, the PDSCH scheduled by this PDCCH may include a random access response (RAR, also referred to as message 2, Msg2, etc.) corresponding to the preamble transmitted by the first node.

[0360] In response, the first node uses the RA-RNTI to detect the PDCCH in the Type1-PDCCH CSS on the downlink initial BWP, and after detecting the PDCCH, determines whether the PDCCH includes an RAR transmitted by the second node to the first node based on the PDSCH scheduled by the PDCCH. The RAR may include information such as an uplink acknowledgement for Message 3 (Msg3), a timing advance command (TA command), a temporary cell RNTI (TC-RNTI), and the like.

[0361] In some embodiments, the Type1-PDCCH CSS is configured by the second node through a system message and / or a high-level parameter.

[0362] At S1030 (third operation), after receiving the RAR, the first node transmits a message 3 (Msg3) on the uplink resource indicated by the RAR.

[0363] In some embodiments, this operation supports HARQ retransmissions, i.e., when the second node does not correctly receive Msg3, the first node can schedule a retransmission of Msg3 using a PDCCH scrambled with TC-RNTI, which PDCCH can carry DCI format 0_0.

[0364] In S1040 (fourth operation), the second node transmits message 4 (Msg4) to the first node, where message 4 includes a conflict resolution message.

[0365] In some embodiments, this operation supports HARQ retransmissions. When the first node does not correctly receive Msg4, the second node can schedule a retransmission of Msg4 using a PDCCH scrambled by the TC-RNTI, which PDCCH can carry DCI format 1_0. When the first node correctly receives Msg4 and confirms that Msg4 is a message intended for the first node, the random access process of the first node is successful; otherwise, the random access process fails and the first node needs to start the random access process again from the first operation.

[0366] Method embodiments of the present disclosure are illustrated in detail above with reference to Figures 1 to 10. Device embodiments of the present disclosure are illustrated in detail below with reference to Figures 11 to 14. It should be understood that the illustrations of method embodiments correspond to the illustrations of device embodiments, and therefore parts not illustrated in detail may refer to the method embodiments described above.

[0367] 11 is a schematic diagram of a node structure for wireless communication provided in some embodiments of the present disclosure. The node 1100 as shown in FIG. 11 may be the first node as illustrated above, and the node 1100 may include a first receiver 1110 and a second receiver 1120.

[0368] The first receiver 1110 may be configured to receive first information, which is used to determine X PRACH opportunities, where the X PRACH opportunities are mapped to Q PRACH opportunity groups, where X is a positive integer greater than 1 and Q is a positive integer.

[0369] The second receiver 1120 may be configured to receive second information, which is used to determine a plurality of candidate values. The number of PRACH opportunities in each of the Q PRACH opportunity groups is a corresponding candidate value of the plurality of candidate values. The plurality of candidate values includes a first candidate value and a second candidate value, and a larger one of the first candidate value and the second candidate value is prioritized for mapping the X PRACH opportunities to the Q PRACH opportunity groups, and / or the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of PRACH opportunity groups corresponding to each candidate value of the plurality of candidate values.

[0370] In some embodiments, the first node further comprises a first transmitter 1130 configured to transmit a plurality of random access preambles on a first PRACH opportunity group, the first PRACH opportunity group being one of the Q PRACH opportunity groups, and the first sequence being used to generate each random access preamble of the plurality of random access preambles.

[0371] In some embodiments, the X PRACH opportunities are in the first cycle.

[0372] In some embodiments, the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain, or the PRACH opportunities in each of the Q PRACH opportunity groups are associated with the same synchronization signal block, or the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain and associated with the same synchronization signal block.

[0373] In some embodiments, the multiple candidate values are used in descending order for mapping the X PRACH opportunities to the Q PRACH opportunity groups.

[0374] In some embodiments, each opportunity group subset of the plurality of PRACH opportunity group subsets includes Q1 respective PRACH opportunity groups of the Q PRACH opportunity groups, each of the plurality of candidate values corresponds to at least one respective PRACH opportunity group of the Q1 respective PRACH opportunity groups in each opportunity group subset of the plurality of PRACH opportunity group subsets, and any two opportunity group subsets of the plurality of PRACH opportunity group subsets corresponding to any one of the plurality of candidate values have the same number of PRACH opportunity groups.

[0375] In some embodiments, the number of at least one respective PRACH opportunity group in each opportunity group subset of the plurality of PRACH opportunity group subsets corresponding to one respective candidate value of the plurality of candidate values corresponds to a value, and the values corresponding to the plurality of candidate values are values in a first proportion.

[0376] In some embodiments, each opportunity group subset of the plurality of PRACH opportunity group subsets includes X1 respective PRACH opportunities of the X PRACH opportunities, and in each opportunity group subset of the plurality of PRACH opportunity group subsets, the plurality of candidate values are used in descending order to map the X1 respective PRACH opportunities to Q1 respective PRACH opportunity groups.

[0377] In some embodiments, the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to one or more of the number of frequency division multiplexing PRACH opportunities in the time instance, the number of synchronization signal blocks associated with each of the X PRACH opportunities, and the number of random access preambles corresponding to each of the synchronization signal blocks associated with the X PRACH opportunities.

[0378] In some embodiments, the first node further includes a third receiver 1140 configured to receive third information used to determine a number of PRACH opportunity groups corresponding to at least one candidate value among the plurality of candidate values.

[0379] In some embodiments, the number of random access preambles corresponding to at least one candidate value of the plurality of candidate values is used to determine the Q PRACH opportunity groups.

[0380] In some embodiments, at least one PRACH opportunity group corresponding to each of the plurality of candidate values is mapped in a first mapping order, the first mapping order including one or more of an increment order of random access preamble indices, an increment order of frequency resources, and an increment order of time resources.

[0381] In some embodiments, the first information is used to determine at least one of: a respective number of synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities; and a number of random access preambles corresponding to the synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities.

[0382] In some embodiments, each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, and at least two of the Q PRACH opportunity groups each include at least one PRACH opportunity that is different from each other.

[0383] In some embodiments, each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, the Q PRACH opportunity groups correspond to a plurality of random access preambles, and the random access preambles corresponding to at least two of the Q PRACH opportunity groups are different from each other.

[0384] In some embodiments, the first receiver 1110 and the second receiver 1120 may be implemented as a transceiver 1330. The node 1100 may further comprise a processor 1310 and a memory 1320, as shown in FIG.

[0385] 12 is a schematic diagram of another node structure for wireless communication provided in some embodiments of the present disclosure. The node 1200 as shown in FIG. 12 is the second node as illustrated above, and the node 1200 may include a second transmitter 1210 and a third transmitter 1220.

[0386] The second transmitter 1210 may be configured to transmit first information used to determine X PRACH opportunities, where the X PRACH opportunities are mapped to Q PRACH opportunity groups, where X is a positive integer greater than 1 and Q is a positive integer.

[0387] The third transmitter 1220 may be configured to transmit second information used to determine the plurality of candidate values. The number of PRACH opportunities in each of the Q PRACH opportunity groups is a corresponding candidate value of the plurality of candidate values. The plurality of candidate values includes a first candidate value and a second candidate value, and a larger one of the first candidate value and the second candidate value is prioritized for mapping the X PRACH opportunities to the Q PRACH opportunity groups, and / or the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of PRACH opportunity groups corresponding to each candidate value of the plurality of candidate values.

[0388] In some embodiments, the second node further comprises a fourth receiver 1230 configured to receive a plurality of random access preambles transmitted on a first PRACH opportunity group, the first PRACH opportunity group being one of the Q PRACH opportunity groups, and the first sequence being used to generate each random access preamble of the plurality of random access preambles.

[0389] In some embodiments, the X PRACH opportunities are in the first cycle.

[0390] In some embodiments, the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain, or the PRACH opportunities in each of the Q PRACH opportunity groups are associated with the same synchronization signal block, or the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain and associated with the same synchronization signal block.

[0391] In some embodiments, the multiple candidate values are used in descending order for mapping the X PRACH opportunities to the Q PRACH opportunity groups.

[0392] In some embodiments, each opportunity group subset of the plurality of PRACH opportunity group subsets includes Q1 respective PRACH opportunity groups of the Q PRACH opportunity groups, each of the plurality of candidate values corresponds to at least one respective PRACH opportunity group of the Q1 respective PRACH opportunity groups in each opportunity group subset of the plurality of PRACH opportunity group subsets, and any two opportunity group subsets of the plurality of PRACH opportunity group subsets corresponding to any one of the plurality of candidate values have the same number of PRACH opportunity groups.

[0393] In some embodiments, the number of at least one respective PRACH opportunity group in each opportunity group subset of the plurality of PRACH opportunity group subsets corresponding to one respective candidate value of the plurality of candidate values corresponds to a value, and the values corresponding to the plurality of candidate values are values in a first proportion.

[0394] In some embodiments, each opportunity group subset of the plurality of PRACH opportunity group subsets includes X1 respective PRACH opportunities of the X PRACH opportunities, and in each opportunity group subset of the plurality of PRACH opportunity group subsets, the plurality of candidate values are used in descending order to map the X1 respective PRACH opportunities to Q1 respective PRACH opportunity groups.

[0395] In some embodiments, the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to one or more of the number of frequency division multiplexing PRACH opportunities in the time instance, the number of synchronization signal blocks associated with each of the X PRACH opportunities, and the number of random access preambles corresponding to each of the synchronization signal blocks associated with the X PRACH opportunities.

[0396] In some embodiments, the second node further includes a fourth transmitter 1240 configured to transmit third information used to determine a number of PRACH opportunity groups corresponding to at least one candidate value among the plurality of candidate values.

[0397] In some embodiments, the number of random access preambles corresponding to at least one candidate value of the plurality of candidate values is used to determine the Q PRACH opportunity groups.

[0398] In some embodiments, at least one PRACH opportunity group corresponding to each of the plurality of candidate values is mapped in a first mapping order, the first mapping order including one or more of an increment order of random access preamble indices, an increment order of frequency resources, and an increment order of time resources.

[0399] In some embodiments, the first information is used to determine at least one of: a respective number of synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities; and a number of random access preambles corresponding to the synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities.

[0400] In some embodiments, each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, and at least two of the Q PRACH opportunity groups each include at least one PRACH opportunity that is different from each other.

[0401] In some embodiments, each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, the Q PRACH opportunity groups correspond to a plurality of random access preambles, and the random access preambles corresponding to at least two of the Q PRACH opportunity groups are different from each other.

[0402] In some embodiments, the second transmitter 1210 and the third transmitter 1220 may be implemented as a transceiver 1330. The node 1200 may further comprise a processor 1310 and a memory 1320 as shown in FIG.

[0403] 13 is a schematic diagram of the structure of a communication device provided in some embodiments of the present disclosure. Dashed lines in FIG. 13 indicate that a unit or module is optional. The device 1300 may be configured to implement a method such as that described in the preceding method embodiments. The device 1300 may be implemented as a chip, user equipment, or a network device.

[0404] The device 1300 may include one or more processors 1310. The one or more processors 1310 may enable the device 1300 to implement methods such as those described in the preceding method embodiments. The one or more processors 1310 may be one or more general-purpose processors or special-purpose processors. For example, the one or more processors may be one or more central processing units (CPUs). Alternatively, the one or more processors may be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs) or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components, or the like. The general-purpose processor may be a microprocessor, or any conventional processor, or the like.

[0405] The device 1300 may further comprise one or more memories 1320. The one or more memories 1320 store programs that may be executed by the one or more processors 1310 to cause the one or more processors 1310 to perform the methods described in the foregoing method embodiments. The one or more memories 1320 may be separate from the one or more processors 1310 or may be integrated into the one or more processors 1310.

[0406] The device 1300 may further include a transceiver 1330. The one or more processors 1310 may communicate with other devices or chips through the transceiver 1330. For example, the one or more processors 1310 may transmit data to and receive data from other devices or chips through the transceiver 1330.

[0407] 14 is a schematic diagram of hardware modules of a communication device provided in some embodiments of the present disclosure. FIG. 14 shows a block diagram of a first communication device 450 and a second communication device 410 communicating with each other in an access network.

[0408] The first communication device 450 comprises a controller / processor 459 , a memory 460 , a data source 467 , a transmit processor 468 , a receive processor 456 , a multi-antenna transmit processor 457 , a multi-antenna receive processor 458 , a transmitter / receiver 454 , and an antenna 452 .

[0409] The second communication device 410 comprises a controller / processor 475 , a memory 476 , a data source 477 , a receive processor 470 , a transmit processor 416 , a multi-antenna receive processor 472 , a multi-antenna transmit processor 471 , a transmitter / receiver 418 , and an antenna 420 .

[0410] During transmission from the second communication device 410 to the first communication device 450, the second communication device 410 provides upper layer data packets from a core network or data source 477 to a controller / processor 475. The core network and data source 477 represent all protocol layers above the L2 layer. The controller / processor 475 implements the functions of the L2 layer. During transmission from the second communication device 410 to the first communication device 450, the controller / processor 475 provides header compression, encryption, packet segmentation and reordering, multiplexing between logical and transmission channels, and wireless resource allocation to the first communication device 450 based on various priority metrics. The controller / processor 475 is also responsible for retransmitting lost packets and signaling to the first communication device 450. The transmit processor 416 and the multi-antenna transmit processor 471 implement various signal processing functions for the L1 layer (i.e., the physical layer). The transmit processor 416 implements coding and interleaving to facilitate forward error correction in the second communication device 410, as well as mapping of signal clusters based on various modulation schemes (e.g., binary phase-shift keying, quadrature phase-shift keying, M-phase-shift keying, M-quadrature amplitude modulation). The multi-antenna transmit processor 471 performs digital spatial precoding (including codebook-based and non-codebook-based precoding) on the coded and modulated symbols and performs beamforming processing to generate one or more spatial streams. The transmit processor 416 then maps each spatial stream to subcarriers, multiplexes the subcarriers with reference signals (e.g., pilots) in the time and / or frequency domains, and then uses an inverse fast Fourier transform to generate physical channels for carrying the time-domain multicarrier symbol streams. The multi-antenna transmit processor 471 then performs simulated precoding / beamforming operations on the time-domain multicarrier symbol streams.Each transmitter 418 converts the baseband multi-carrier symbol stream provided by the multi-antenna transmit processor 471 into an RF stream, which is then provided to a different antenna 420 .

[0411] During transmission from the second communication device 410 to the first communication device 450, each receiver 454 in the first communication device 450 receives a signal through a corresponding antenna 452. Each receiver 454 recovers the information modulated onto the RF carrier and converts the RF stream into a baseband multi-carrier symbol stream, which is provided to a receive processor 456. The receive processor 456 and the multi-antenna receive processor 458 implement various signal processing functions of the L1 layer. The multi-antenna receive processor 458 performs receive analog precoding / beamforming operations on the baseband multi-carrier symbol stream from the receiver 454. The receive processor 456 uses a fast Fourier transform to convert the baseband multi-carrier symbol stream, which has undergone receive analog precoding / beamforming operations, from the time domain to the frequency domain. In the frequency domain, the physical layer data signal and reference signal are demultiplexed by the receive processor 456, the reference signal is used for channel estimation, and the data signal is detected by multiple antennas in the multi-antenna receive processor 458 to recover any spatial streams destined for the first communication device 450. The symbols on each spatial stream are demodulated and recovered in the receive processor 456 to generate soft decisions. The receive processor 456 then decodes and deinterleaves the soft decisions to recover the upper layer data and control signals transmitted by the second communication device 410 on the physical channel. The upper layer data and control signals are then provided to the controller / processor 459, which implements L2 layer functions. The controller / processor 459 may be associated with a memory 460 for storing program codes and data. The memory 460 may be referred to as a computer-readable medium. In transmission from the second communication device 410 to the first communication device 450, the controller / processor 459 provides multiplexing, packet reassembly, decoding, header decompression, and control signal processing between transport and logical channels to recover upper layer data packets from the second communication device 410. The upper layer packets are then provided to all protocol layers above the L2 layer.Various control signals may also be provided to the L3 for processing therein.

[0412] During transmission from the first communication device 450 to the second communication device 410, the first communication device 450 uses a data source 467 to provide upper layer data packets to the controller / processor 459. The data source 467 represents all protocol layers above the L2 layer. Similar to the transmission functions described for the second communication device 410 during transmission from the second communication device 410 to the first communication device 450, the controller / processor 459 implements header compression, ciphering, packet segmentation and reordering, as well as multi-channel multiplexing between logical and transport channels, thereby implementing L2 layer functions for the user plane and control plane. The controller / processor 459 is also responsible for retransmitting lost packets and signaling to the second communication device 410. The transmit processor 468 performs modulation mapping and channel coding processing, and the multi-antenna transmit processor 457 performs digital multi-antenna spatial precoding (including codebook-based precoding and non-codebook-based precoding) and beamforming processing. The transmit processor 468 then modulates the generated spatial streams into multi-carrier / single-carrier symbol streams, which, after simulated precoding / beamforming in the multi-antenna transmit processor 457, are then fed to different antennas 452 through transmitters 454. Each transmitter 454 first converts the baseband symbol streams provided by the multi-antenna transmit processor 457 into RF symbol streams and then feeds them to the antennas 452.

[0413] In a transmission from the first communication device 450 to the second communication device 410, the functions in the second communication device 410 are similar to the receiving functions in the first communication device 450 described in the transmission from the second communication device 410 to the first communication device 450. Each receiver 418 receives an RF signal through its corresponding antenna 420, converts the received RF signal to a baseband signal, and provides the baseband signal to the multi-antenna receive processor 472 and the receive processor 470. The receive processor 470 and the multi-antenna receive processor 472 cooperate to implement the functionality of the L1 layer. The controller / processor 475 implements the functionality of the L2 layer. The controller / processor 475 may be associated with a memory 476 for storing program codes and data. The memory 476 may be referred to as a computer-readable medium. In transmission from the first communication device 450 to the second communication device 410, the controller / processor 475 provides multiplexing, packet reassembly, decoding, header decompression, and control signal processing between transport channels and logical channels to recover upper layer data packets from the first communication device 450. The upper layer data packets from the controller / processor 475 are provided to the core network or all protocol layers above the L2 layer, and various control signals may also be provided to the core network or L3 for processing at L3.

[0414] In some embodiments, the first communication device 450 comprises at least one processor and at least one memory. The at least one memory includes computer program code. The at least one memory and the computer program code are configured for use in conjunction with the at least one processor. The first communication device 450 receives at least first information used to determine X PRACH opportunities, where the X PRACH opportunities are mapped to Q PRACH opportunity groups, where X is a positive integer greater than 1 and Q is a positive integer, and second information used to determine a plurality of candidate values. The number of PRACH opportunities in each of the Q PRACH opportunity groups is a corresponding candidate value of the plurality of candidate values. The plurality of candidate values includes a first candidate value and a second candidate value, and a larger one of the first candidate value and the second candidate value is prioritized for mapping the X PRACH opportunities to the Q PRACH opportunity groups, and / or the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of PRACH opportunity groups corresponding to each candidate value among the plurality of candidate values.

[0415] In some embodiments, the first communications apparatus device 450 comprises a memory for storing a computer-readable program of instructions that, when executed by at least one processor, causes the at least one processor to perform operations including receiving first information used to determine X PRACH opportunities, where the X PRACH opportunities are mapped to Q PRACH opportunity groups, where X is a positive integer greater than 1 and Q is a positive integer, and receiving second information used to determine a plurality of candidate values. The number of PRACH opportunities in each of the Q PRACH opportunity groups is a corresponding candidate value of the plurality of candidate values. The plurality of candidate values includes a first candidate value and a second candidate value, where a larger one of the first candidate value and the second candidate value is prioritized for mapping the X PRACH opportunities to the Q PRACH opportunity groups, and / or the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of PRACH opportunity groups corresponding to each candidate value of the plurality of candidate values.

[0416] In some embodiments, the first communication device 450 corresponds to a first node in the present disclosure.

[0417] In some embodiments, the second communication device 410 corresponds to a second node in the present disclosure.

[0418] In some embodiments, the first communication device 450 is an NCR.

[0419] In some embodiments, the first communication device 450 is a wireless relay station.

[0420] In some embodiments, the first communication device 450 is a repeater.

[0421] In some embodiments, the first communication device 450 is a user equipment, which may function as a relay node.

[0422] In some embodiments, the first communication device 450 is a user equipment that supports V2X, and the user equipment may function as a relay node.

[0423] In some embodiments, the first communication device 450 is a user equipment supporting D2D, and the user equipment may act as a relay node.

[0424] In some embodiments, the second communication device 410 is a base station.

[0425] In some embodiments, the antenna 452, the receiver 454, the multi-antenna receive processor 458, the receive processor 456, and the controller / processor 459 are used to receive the first and / or second information in the present disclosure.

[0426] In some embodiments, the antenna 420, the transmitter 418, the multi-antenna transmit processor 471, the transmit processor 416, and the controller / processor 475 are used to transmit the first and / or second information in this disclosure.

[0427] Some embodiments of the present disclosure further provide a computer-readable storage medium configured to store a program, which may be applicable to a terminal device or a network device provided in the embodiments of the present disclosure, and the program causes a computer to perform the operations of the method performed by the terminal device or the network device in the embodiments of the present disclosure.

[0428] The embodiments of the present disclosure further provide a computer program product including a program, which may be applicable to the terminal device or network device provided in the embodiments of the present disclosure, and the program causes a computer to perform the operations of the method performed by the terminal device or network device in the embodiments of the present disclosure.

[0429] The embodiments of the present disclosure further provide a computer program, which may be applicable to the terminal device or network device provided in the embodiments of the present disclosure, and causes a computer to perform the operations of the method performed by the terminal device or network device in the embodiments of the present disclosure.

[0430] It will be understood that the terms "system" and "network" may be used interchangeably in this disclosure. Additionally, the terms used in this disclosure are used only to describe embodiments of the present disclosure and are not intended to limit the disclosure. Terms such as "first," "second," "third," "fourth," and the like in the description, claims, and drawings of this disclosure are used to distinguish different objects rather than to describe a particular order. Additionally, the terms "comprise" and "have," and any variations thereof, are intended to cover a non-exclusive inclusion.

[0431] In the embodiments of the present disclosure, the phrase "indicate" referred to herein may refer to direct indication, or indirect indication, or may mean that there is an associative relationship. For example, A indicating B may mean that A directly indicates B, e.g., B can be obtained by means of A, or that A indirectly indicates B, e.g., A indicates C, and B can be obtained by means of C, or may mean that there is an associative relationship between A and B.

[0432] In the embodiments of the present disclosure, "B corresponding to A" means that B is related to A and B can be determined based on A. However, it should be understood that determining B based on A does not only mean determining B based on A only, but also that B can instead be determined based on A and / or other information.

[0433] In the embodiments of the present disclosure, the phrase "corresponding" may mean that there is a direct or indirect correspondence between two things, or that there is an association relationship between two things, or that there is a relationship such as showing and shown, or comprising and comprised.

[0434] In an embodiment of the present disclosure, "predefined" or "preconfigured" may be implemented by prestoring a corresponding code, table, or other form that can be used to indicate related information in a device (including, for example, a terminal device and a network device), and the specific implementation form is not limited by the present disclosure. For example, predefined may refer to being defined in a protocol.

[0435] In the embodiments of the present disclosure, "protocol" may refer to standard protocols in the communications field, and may include, for example, LTE protocols, NR protocols, and related protocols applied to future communications systems, but is not limited to these in the present disclosure.

[0436] In embodiments of the present disclosure, the phrase "and / or" is used only to describe an associative relationship between associated objects and indicates that there are three possible relationships. For example, A and / or B may indicate that only A is present, that both A and B are present, and that only B is present. In addition, the character " / " is generally used herein to indicate an "or" relationship between associated objects.

[0437] In the embodiments of the present disclosure, the sequence numbers of the above processes do not mean the execution sequence, and the execution sequence of the processes should be determined according to the functions and internal logic of the processes, and should not be construed as any limitation on the implementation process of the embodiments of the present disclosure.

[0438] In the embodiments provided in the present disclosure, it will be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the described device embodiments are merely examples. For example, the division of units is merely a logical functional division, and other division methods may exist in actual implementations. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not implemented. In addition, the shown or described mutual couplings or direct couplings or communication connections may be implemented by using some interfaces. Indirect couplings or communication connections between devices or units may be implemented in electrical, mechanical, or other forms.

[0439] Units described as separate parts may or may not be physically separate, and parts shown as units may or may not be physical units, may be located in one location or may be distributed over multiple network units, and some or all of the units may be selected according to what is actually needed to achieve the objectives of the solution of the embodiment.

[0440] Additionally, the functional units in the embodiments of the present disclosure may be integrated into one processing unit, or each of the units may exist physically alone, or two or more units may be integrated into one unit.

[0441] All or part of the above-described embodiments may be implemented by using software, hardware, firmware, or any combination thereof. When software is used to implement the embodiments, the above-described embodiments may be implemented entirely or partially in the form of a computer program product. The computer program product comprises one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the procedures or functions according to the embodiments of the present disclosure are generated entirely or partially. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions may be recorded on a computer-readable storage medium or transmitted from a computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions may be transmitted from a website, computer, server, or data center to another website, computer, server, or data center via a wired (such as coaxial cable, optical fiber, and digital subscriber line (DSL)) or wireless (such as infrared, wireless, and microwave) method. The computer-readable storage medium may be any available medium readable by a computer or a data storage device, such as a server or data center formed by integrating one or more available media. The usable medium may be a magnetic medium (e.g., a floppy disk, hard disk, or magnetic tape), an optical medium (e.g., a digital video disk (DVD)), a semiconductor medium (e.g., a solid-state drive (SSD)), or the like.

[0442] The above description is merely a specific implementation of the present disclosure, and the protection scope of the present disclosure is not limited thereto. Any modifications or alternatives that can be easily conceived by those skilled in the art within the scope of the technology disclosed in the present disclosure shall fall within the protection scope of the present disclosure. Therefore, the protection scope of the present disclosure shall be subject to the protection scope of the claims. [Explanation of symbols]

[0443] 1 message 2 Messages 3 Messages 4 Messages 100 Wireless Communication System 110 Network Devices 120 User Equipment 410 Second communication device 416 Transmission Processor 418 Transmitter / Receiver 420 Antenna 450 First communication device 452 Antenna 454 Transmitter / Receiver 456 Receive Processor 457 Multi-Antenna Transmission Processor 458 Multi-Antenna Receive Processor 459 Controller / Processor 460 memory 467 Data Sources 468 Transmission Processor 470 Receive Processor 471 Multi-Antenna Transmission Processor 472 Multi-Antenna Receive Processor 475 Controller / Processor 476 memory 477 Data Sources 1100 nodes 1110 First receiver 1120 Second Receiver 1130 First Transmitter 1140 Third Receiver 1200 nodes 1210 Second Receiver 1220 Third Receiver 1230 Fourth Receiver 1240 Fourth Transmitter 1300 devices 1310 processor 1320 memory 1330 transceiver

Claims

1. A first node for wireless communication, comprising: a first receiver configured to receive first information, the first information being used to determine X Physical Random Access Channel (PRACH) opportunities, the X PRACH opportunities being mapped to Q PRACH opportunity groups, where X is a positive integer greater than 1 and Q is a positive integer; and a second receiver configured to receive second information, the second information being used to determine a plurality of candidate values, and a number of PRACH opportunities included in each of the Q PRACH opportunity groups being a corresponding candidate value of the plurality of candidate values; the plurality of candidate values includes a first candidate value and a second candidate value, and a larger one of the first candidate value and the second candidate value is prioritized for mapping the X PRACH opportunities to the Q PRACH opportunity groups; and / or A first node, wherein the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of PRACH opportunity groups that respectively correspond to each candidate value among the plurality of candidate values.

2. a first transmitter configured to transmit multiple random access preambles on a first PRACH group of opportunities using the same spatial filter; 2. The first node of claim 1, wherein the first PRACH opportunity group is one of the Q PRACH opportunity groups, and a first sequence is used to generate each of the plurality of random access preambles.

3. The first node of claim 1 or claim 2, wherein the X PRACH opportunities are in a first cycle.

4. the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain; or the PRACH opportunities in each of the Q PRACH opportunity groups are associated with the same synchronization signal block; or 4. The first node of claim 1, wherein the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain and associated with the same synchronization signal block.

5. 5. The first node of claim 1, wherein the plurality of candidate values are used in descending order for the mapping of the X PRACH opportunities to the Q PRACH opportunity groups.

6. 6. The first node of claim 1, wherein each of a plurality of PRACH opportunity group subsets includes a respective Q1 PRACH opportunity group of the Q PRACH opportunity groups, each of the plurality of candidate values corresponds to a respective PRACH opportunity group of at least one of the Q1 respective PRACH opportunity groups included in each of the plurality of PRACH opportunity group subsets, and any two of the plurality of PRACH opportunity group subsets corresponding to any one of the plurality of candidate values have the same number of PRACH opportunity groups.

7. 7. The first node of claim 6, wherein the number of the at least one respective PRACH opportunity group included in each of the plurality of PRACH opportunity group subsets corresponding to one respective candidate value of the plurality of candidate values corresponds to a certain value, and the plurality of values corresponding to the plurality of candidate values are values in a first proportion.

8. 8. The first node of claim 6 or claim 7, wherein each of the plurality of PRACH opportunity group subsets includes X1 respective PRACH opportunities of the X PRACH opportunities, and in each of the plurality of PRACH opportunity group subsets, the plurality of candidate values are used in descending order in mapping the X1 respective PRACH opportunities to the Q1 respective PRACH opportunity groups.

9. The mapping of the X PRACH opportunities to the Q PRACH opportunity groups comprises: the number of frequency division multiplexing PRACH opportunities at the time instance; a number of synchronization signal blocks associated with each of the X PRACH opportunities; and a number of random access preambles corresponding to each of a plurality of synchronization signal blocks associated with the X PRACH opportunities; 9. A first node according to any one of claims 1 to 8, which is associated with one or more of:

10. 10. The first node of claim 1, further comprising: a third receiver configured to receive third information, the third information being used to determine a number of PRACH opportunity groups corresponding to at least one candidate value among the plurality of candidate values.

11. 11. The first node according to claim 1, wherein the number of random access preambles corresponding to at least one candidate value among the plurality of candidate values is used to determine the Q PRACH opportunity groups.

12. At least one PRACH opportunity group corresponding to each of the plurality of candidate values is mapped in a first mapping order, the first mapping order comprising: the increment order of the index of the random access preamble, The increment order of the frequency resources, and Time resource increment sequence 12. The first node according to claim 1, comprising one or more of:

13. The first information is a respective number of synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities; and The number of random access preambles corresponding to the synchronization signal block corresponding to each PRACH opportunity among the X PRACH opportunities 13. The first node according to claim 1, which is used to determine at least one of:

14. 14. The first node of claim 1, wherein each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, and wherein at least two of the Q PRACH opportunity groups each include at least one PRACH opportunity that is different from each other.

15. 14. The first node of claim 1, wherein each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, the Q PRACH opportunity groups correspond to a plurality of random access preambles, and the random access preambles corresponding to at least two of the Q PRACH opportunity groups are different from each other.

16. A second node for wireless communication, comprising: a second transmitter configured to transmit first information, the first information being used to determine X PRACH opportunities, the X PRACH opportunities being mapped to Q PRACH opportunity groups, X being a positive integer greater than 1, and Q being a positive integer; and a third transmitter configured to transmit second information, the second information being used to determine a plurality of candidate values, and a number of PRACH opportunities included in each of the Q PRACH opportunity groups being a corresponding candidate value of the plurality of candidate values; the plurality of candidate values includes a first candidate value and a second candidate value, and a larger one of the first candidate value and the second candidate value is prioritized for mapping the X PRACH opportunities to the Q PRACH opportunity groups; and / or A second node, wherein the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of PRACH opportunity groups that respectively correspond to each candidate value among the plurality of candidate values.

17. a fourth receiver configured to receive a plurality of random access preambles transmitted on the first PRACH group of opportunities; 17. The second node of claim 16, wherein the first PRACH opportunity group is one of the Q PRACH opportunity groups, and a first sequence is used to generate each of the plurality of random access preambles.

18. 18. The second node of claim 16 or claim 17, wherein the X PRACH opportunities are within a first cycle.

19. the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain; or the PRACH opportunities in each of the Q PRACH opportunity groups are associated with the same synchronization signal block; or 19. The second node of claim 16, wherein the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain and associated with the same synchronization signal block.

20. 20. The second node of claim 16, wherein the plurality of candidate values are used in descending order for the mapping of the X PRACH opportunities to the Q PRACH opportunity groups.

21. 21. The second node of claim 16, wherein each of a plurality of PRACH opportunity group subsets includes a respective Q1 PRACH opportunity group of the Q PRACH opportunity groups, each of the plurality of candidate values corresponds to a respective PRACH opportunity group of at least one of the Q1 respective PRACH opportunity groups included in each of the plurality of PRACH opportunity group subsets, and any two of the plurality of PRACH opportunity group subsets corresponding to any one of the plurality of candidate values have the same number of PRACH opportunity groups.

22. 22. The second node of claim 21, wherein the number of the at least one respective PRACH opportunity group included in each of the plurality of PRACH opportunity group subsets corresponding to one respective candidate value of the plurality of candidate values corresponds to a certain value, and the plurality of values corresponding to the plurality of candidate values are values in a first proportion.

23. 22. The second node of claim 20 or claim 21, wherein each of the plurality of PRACH opportunity group subsets includes X1 respective PRACH opportunities of the X PRACH opportunities, and in each of the plurality of PRACH opportunity group subsets, the plurality of candidate values are used in descending order in mapping the X1 respective PRACH opportunities to the Q1 respective PRACH opportunity groups.

24. The mapping of the X PRACH opportunities to the Q PRACH opportunity groups comprises: the number of frequency division multiplexing PRACH opportunities at the time instance; a number of synchronization signal blocks associated with each of the X PRACH opportunities; and a number of random access preambles corresponding to each of a plurality of synchronization signal blocks associated with the X PRACH opportunities; 24. A second node according to any one of claims 16 to 23, associated with one or more of:

25. 25. The second node of claim 16, further comprising: a fourth transmitter configured to transmit third information, the third information being used to determine a number of PRACH opportunity groups corresponding to at least one candidate value among the plurality of candidate values.

26. 26. The second node according to claim 16, wherein the number of random access preambles corresponding to at least one candidate value among the plurality of candidate values is used to determine the Q PRACH opportunity groups.

27. At least one PRACH opportunity group corresponding to each of the plurality of candidate values is mapped in a first mapping order, the first mapping order comprising: the increment order of the index of the random access preamble, The increment order of the frequency resources, and Time resource increment sequence 27. The second node according to any one of claims 16 to 26, comprising one or more of:

28. The first information is a respective number of synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities; and The number of random access preambles corresponding to the synchronization signal block corresponding to each PRACH opportunity among the X PRACH opportunities 28. The second node according to any one of claims 16 to 27, used to determine at least one of:

29. 29. The second node of claim 16, wherein each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, and wherein at least two of the Q PRACH opportunity groups each include at least one PRACH opportunity that is different from each other.

30. 29. The second node of claim 16, wherein each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, the Q PRACH opportunity groups correspond to a plurality of random access preambles, and the random access preambles corresponding to at least two of the Q PRACH opportunity groups are different from each other.

31. 1. A method for wireless communication applicable to a first node, comprising: receiving first information, the first information being used to determine X PRACH opportunities, the X PRACH opportunities being mapped to Q PRACH opportunity groups, where X is a positive integer greater than 1 and Q is a positive integer; receiving second information, the second information being used to determine a plurality of candidate values, and a number of PRACH opportunities included in each of the Q PRACH opportunity groups being a corresponding candidate value of the plurality of candidate values; the plurality of candidate values includes a first candidate value and a second candidate value, and a larger one of the first candidate value and the second candidate value is prioritized for mapping the X PRACH opportunities to the Q PRACH opportunity groups; and / or The method, wherein the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of PRACH opportunity groups that respectively correspond to each candidate value among the plurality of candidate values.

32. transmitting a plurality of random access preambles on the first PRACH group of opportunities; 32. The method of claim 31, wherein the first PRACH opportunity group is one of the Q PRACH opportunity groups, and a first sequence is used to generate each of the plurality of random access preambles.

33. 33. The method of claim 31 or claim 32, wherein the X PRACH opportunities are in a first cycle.

34. the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain; or the PRACH opportunities in each of the Q PRACH opportunity groups are associated with the same synchronization signal block; or 34. The method of any one of claims 31 to 33, wherein the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain and associated with the same synchronization signal block.

35. 35. The method of any one of claims 31 to 34, wherein the plurality of candidate values are used in descending order for the mapping of the X PRACH opportunities to the Q PRACH opportunity groups.

36. 36. The method of claim 31, wherein each of a plurality of PRACH opportunity group subsets includes a respective Q1 PRACH opportunity group of the Q PRACH opportunity groups, each of the plurality of candidate values corresponds to a respective PRACH opportunity group of at least one of the Q1 respective PRACH opportunity groups included in each of the plurality of PRACH opportunity group subsets, and any two of the plurality of PRACH opportunity group subsets corresponding to any one of the plurality of candidate values have the same number of PRACH opportunity groups.

37. 37. The method of claim 36, wherein the number of the at least one respective PRACH opportunity group included in each of the plurality of PRACH opportunity group subsets corresponding to one respective candidate value of the plurality of candidate values corresponds to a certain value, and the plurality of values corresponding to the plurality of candidate values are values in a first proportion.

38. 38. The method of claim 36 or 37, wherein each of the plurality of PRACH opportunity group subsets includes X1 respective PRACH opportunities of the X PRACH opportunities, and in each of the plurality of PRACH opportunity group subsets, the plurality of candidate values are used in descending order in mapping the X1 respective PRACH opportunities to the Q1 respective PRACH opportunity groups.

39. The mapping of the X PRACH opportunities to the Q PRACH opportunity groups comprises: the number of frequency division multiplexing PRACH opportunities at the time instance; a number of synchronization signal blocks associated with each of the X PRACH opportunities; and a number of random access preambles corresponding to each of a plurality of synchronization signal blocks associated with the X PRACH opportunities; 39. The method of any one of claims 31 to 38, wherein the method is associated with one or more of:

40. 40. The method of claim 31, further comprising receiving third information, wherein the third information is used to determine a number of PRACH opportunity groups corresponding to at least one candidate value among the plurality of candidate values.

41. 41. The method of claim 31, wherein the number of random access preambles corresponding to at least one candidate value among the plurality of candidate values is used to determine the Q PRACH opportunity groups.

42. At least one PRACH opportunity group corresponding to each of the plurality of candidate values is mapped in a first mapping order, the first mapping order comprising: the increment order of the index of the random access preamble, The increment order of the frequency resources, and Time resource increment sequence 42. The method of any one of claims 31 to 41, comprising one or more of:

43. The first information is a respective number of synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities; and The number of random access preambles corresponding to the synchronization signal block corresponding to each PRACH opportunity among the X PRACH opportunities 43. The method of any one of claims 31 to 42, used to determine at least one of:

44. 44. The method of claim 31, wherein each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, and wherein at least two of the Q PRACH opportunity groups each include at least one PRACH opportunity that is different from each other.

45. 44. The method of claim 31, wherein each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, the Q PRACH opportunity groups correspond to a plurality of random access preambles, and the random access preambles corresponding to at least two of the Q PRACH opportunity groups are different from each other.

46. 1. A method for wireless communication applicable to a second node, comprising: transmitting first information, wherein the first information is used to determine X PRACH opportunities, and the X PRACH opportunities are mapped to Q PRACH opportunity groups, where X is a positive integer greater than 1 and Q is a positive integer; transmitting second information, wherein the second information is used to determine a plurality of candidate values, and the number of PRACH opportunities included in each of the Q PRACH opportunity groups is a corresponding candidate value of the plurality of candidate values; the plurality of candidate values includes a first candidate value and a second candidate value, and a larger one of the first candidate value and the second candidate value is prioritized for mapping the X PRACH opportunities to the Q PRACH opportunity groups; and / or The method, wherein the mapping of the X PRACH opportunities to the Q PRACH opportunity groups is related to the number of PRACH opportunity groups that respectively correspond to each candidate value among the plurality of candidate values.

47. receiving a plurality of random access preambles transmitted on a first PRACH group of opportunities; 47. The method of claim 46, wherein the first PRACH opportunity group is one of the Q PRACH opportunity groups, and a first sequence is used to generate each of the plurality of random access preambles.

48. 48. The method of claim 46 or claim 47, wherein the X PRACH opportunities are in a first cycle.

49. the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain; or the PRACH opportunities in each of the Q PRACH opportunity groups are associated with the same synchronization signal block; or 49. The method of any one of claims 46 to 48, wherein the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to one another in the time domain and associated with the same synchronization signal block.

50. 50. The method of any one of claims 46 to 49, wherein the plurality of candidate values are used in descending order for the mapping of the X PRACH opportunities to the Q PRACH opportunity groups.

51. 51. The method of claim 46, wherein each of a plurality of PRACH opportunity group subsets includes a respective Q1 PRACH opportunity group of the Q PRACH opportunity groups, each of the plurality of candidate values corresponds to a respective PRACH opportunity group of at least one of the Q1 respective PRACH opportunity groups included in each of the plurality of PRACH opportunity group subsets, and any two of the plurality of PRACH opportunity group subsets corresponding to any one of the plurality of candidate values have the same number of PRACH opportunity groups.

52. 52. The method of claim 51, wherein the number of the at least one respective PRACH opportunity group included in each of the plurality of PRACH opportunity group subsets corresponding to one respective candidate value of the plurality of candidate values corresponds to a certain value, and the plurality of values corresponding to the plurality of candidate values are values in a first proportion.

53. 52. The method of claim 50 or claim 51, wherein each of the plurality of PRACH opportunity group subsets includes X1 respective PRACH opportunities of the X PRACH opportunities, and in each of the plurality of PRACH opportunity group subsets, the plurality of candidate values are used in descending order in mapping the X1 respective PRACH opportunities to the Q1 respective PRACH opportunity groups.

54. The mapping of the X PRACH opportunities to the Q PRACH opportunity groups comprises: the number of frequency division multiplexing PRACH opportunities at the time instance; a number of synchronization signal blocks associated with each of the X PRACH opportunities; and a number of random access preambles corresponding to each of a plurality of synchronization signal blocks associated with the X PRACH opportunities; 54. The method of any one of claims 46 to 53, wherein the method is associated with one or more of:

55. 55. The method of claim 46, further comprising transmitting third information, wherein the third information is used to determine a number of PRACH opportunity groups corresponding to at least one candidate value among the plurality of candidate values.

56. 56. The method of any one of claims 46 to 55, wherein the number of random access preambles corresponding to at least one candidate value of the plurality of candidate values is used to determine the Q PRACH opportunity groups.

57. At least one PRACH opportunity group corresponding to each of the plurality of candidate values is mapped in a first mapping order, the first mapping order comprising: the increment order of the index of the random access preamble, The increment order of the frequency resources, and Time resource increment sequence 57. The method of any one of claims 46 to 56, comprising one or more of:

58. The first information is a respective number of synchronization signal blocks corresponding to each PRACH opportunity among the X PRACH opportunities; and The number of random access preambles corresponding to the synchronization signal block corresponding to each PRACH opportunity among the X PRACH opportunities 58. The method of any one of claims 46 to 57, used to determine at least one of:

59. 59. The method of claim 46, wherein each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, and wherein at least two of the Q PRACH opportunity groups each include at least one PRACH opportunity that is different from each other.

60. 59. The method of any one of claims 46 to 58, wherein each of the Q PRACH opportunity groups includes a respective plurality of PRACH opportunities, the Q PRACH opportunity groups correspond to a plurality of random access preambles, and the random access preambles corresponding to at least two of the Q PRACH opportunity groups are different from each other.

61. A node for wireless communication, comprising: a transceiver, a memory, and a processor; 61. A node wherein the memory is configured to store a program, and wherein the processor is configured to invoke the program in the memory and control the transceiver to receive or transmit signals, thereby causing the node to perform operations of the method of any one of claims 31 to 45 or claims 46 to 60.

62. 61. A device comprising a processor, the processor configured to call a program from a memory and cause the device to perform the operations of a method according to any one of claims 31 to 45 or claims 46 to 60.

63. A chip comprising a processor, the processor configured to call a program from a memory and cause a device having the chip to perform the operations of a method according to any one of claims 31 to 45 or claims 46 to 60.

64. 10. A computer readable storage medium configured to store a program, the program configured to cause a computer to perform the operations of the method of any one of claims 31 to 45 or claims 46 to 60.

65. A computer program product comprising a program that causes a computer to perform the operations of the method of any one of claims 31 to 45 or claims 46 to 60.

66. A computer program configured to cause a computer to perform the operations of the method according to any one of claims 31 to 45 or claims 46 to 60.

Images