Methods and devices for nodes for wireless communications

Abstract

This provides a method and device applicable to nodes for wireless communication. [Solution] A first node for wireless communication comprises a first receiver configured to receive first information, the first information being used to determine X ROs, the X ROs being 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, the second information being used to determine a plurality of candidate values, where the number of ROs in each of the Q ROGs is a corresponding candidate value of the plurality of candidate values.

Description

Technical Field

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

Background Art

[0002] To improve the coverage performance of the Physical Random Access Channel (PRACH), some communication systems (such as the New Radio (NR) system) have introduced a multiple PRACH transmission scheme. In the multiple PRACH transmission scheme, a PRACH occasion (RO) can be mapped to an RO group (ROG) to transmit multiple PRACHs on the ROG. In view of such a situation, how to map the RO to the ROG becomes a problem to be solved. The mapping scheme from the RO to the ROG may affect the resource allocation of the multiple PRACH transmission or cause a large number of orphan ROs, resulting in wasted resources.

Summary of the Invention

Problems to be Solved by the Invention

[0003] Embodiments of the present disclosure provide methods and devices applicable to nodes for wireless communication. Aspects of the present disclosure are illustrated below.

Means for Solving the Problems

[0004] In a first embodiment, a first node for wireless communication is provided, which includes a first receiver configured to receive first information, the first information being used to determine X PRACH opportunities, the X PRACH opportunities being mapped to Q PRACH occasion 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, where the number of PRACH opportunities in each of the Q PRACH occasion groups is the corresponding candidate value of the plurality of candidate values. The plurality of candidate values ​​include a first candidate value and a second candidate value, the larger of the first and second candidate values ​​being prioritized for the mapping of X PRACH opportunities to Q PRACH occasion groups, and / or the mapping of X PRACH opportunities to Q PRACH occasion groups being related to the number of PRACH occasion groups corresponding to each candidate value among the plurality of candidate values.

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

[0006] In some embodiments, X PRACH opportunities occur within a first cycle.

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

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

[0009] In some embodiments, each opportunity group subset among a plurality of PRACH opportunity group subsets includes Q1 PRACH opportunity groups from Q PRACH opportunity groups, each of the plurality of candidate values ​​corresponds to at least one of the Q1 PRACH opportunity groups in each opportunity group subset among the plurality of PRACH opportunity group subsets, and any two opportunity group subsets among 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 PRACH opportunity groups in each opportunity group subset of a plurality of PRACH opportunity group subsets corresponding to each candidate value among a plurality of candidate values ​​corresponds to a single value, and the value corresponding to the plurality of candidate values ​​is a first proportion value.

[0011] In some embodiments, each opportunity group subset among multiple PRACH opportunity group subsets contains X1 PRACH opportunities, and in each opportunity group subset among multiple PRACH opportunity group subsets, the multiple candidate values ​​are used in descending order to map each of the X1 PRACH opportunities to each of the Q1 PRACH opportunity groups.

[0012] In some embodiments, the mapping of X PRACH opportunities to Q PRACH opportunity groups is related to one or more of the following: the number of frequency-division multiplexed 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.

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

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

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

[0016] In some embodiments, each of the Q PRACH opportunity groups includes each of the multiple 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 each of multiple PRACH opportunities, the Q PRACH opportunity groups correspond to multiple random access preambles, and at least two of the Q PRACH opportunity groups have different random access preambles.

[0018] In a second embodiment, a second node for wireless communication is provided, which includes a second transmitter configured to transmit first information used to determine X PRACH opportunities, where 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 the corresponding candidate value of the plurality of candidate values. The plurality of candidate values ​​include a first candidate value and a second candidate value, where the larger of the first and second candidate values ​​is prioritized for the mapping of X PRACH opportunities to Q PRACH opportunity groups, and / or the mapping of X PRACH opportunities to Q PRACH opportunity groups is related to the number of PRACH opportunity groups corresponding to each candidate value among 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 over the first PRACH opportunity group. The first PRACH opportunity group is one of Q PRACH opportunity groups, and the first sequence is used to generate each of the plurality of random access preambles.

[0020] In some embodiments, X PRACH opportunities occur within a first cycle.

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

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

[0023] In some embodiments, each opportunity group subset among a plurality of PRACH opportunity group subsets includes Q1 PRACH opportunity groups from Q PRACH opportunity groups, each of the plurality of candidate values ​​corresponds to at least one PRACH opportunity group from each of the Q1 PRACH opportunity groups in each opportunity group subset among the plurality of PRACH opportunity group subsets, and any two opportunity group subsets among 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 each PRACH opportunity group in each of the plurality of PRACH opportunity group subsets corresponding to each of the plurality of candidate values corresponds to a certain value, and the values corresponding to the plurality of candidate values are values at a first ratio.

[0025] In some embodiments, each of the plurality of PRACH opportunity group subsets includes X1 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 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 multiplexed PRACH opportunities at 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 plurality of 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 the number of PRACH opportunity groups corresponding to at least one of the plurality of candidate values.

[0028] In some embodiments, the number of random access preambles corresponding to at least one 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 a plurality of candidate values is mapped in a first mapping order, and the first mapping order includes one or more of an incremental order of random access preamble indices, an incremental order of frequency resources, and an incremental order of time resources.

[0030] In some embodiments, the first information is used to determine at least one of the respective number of synchronization signal blocks corresponding to each of the X PRACH opportunities and the number of random access preambles corresponding to the synchronization signal blocks corresponding to each of 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 embodiment, a method applicable to a first node for wireless communication is provided, which includes the steps of receiving first information used to determine X PRACH opportunities, wherein 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, wherein the number of PRACH opportunities in each of the Q PRACH opportunity groups is the corresponding candidate value of the plurality of candidate values. The plurality of candidate values ​​include a first candidate value and a second candidate value, where the larger of the first and second candidate values ​​is prioritized for the mapping of X PRACH opportunities to Q PRACH opportunity groups, and / or the mapping of X PRACH opportunities to Q PRACH opportunity groups is related to the number of PRACH opportunity groups corresponding to each candidate value among the plurality of candidate values.

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

[0035] In some embodiments, X PRACH opportunities occur within a first cycle.

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

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

[0038] In some embodiments, each opportunity group subset among a plurality of PRACH opportunity group subsets includes Q1 PRACH opportunity groups from Q PRACH opportunity groups, each of the plurality of candidate values ​​corresponds to at least one PRACH opportunity group from each of the Q1 PRACH opportunity groups in each opportunity group subset among the plurality of PRACH opportunity group subsets, and any two opportunity group subsets among 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 PRACH opportunity groups in each opportunity group subset of a plurality of PRACH opportunity group subsets corresponding to each candidate value among a plurality of candidate values ​​corresponds to a single value, and the value corresponding to the plurality of candidate values ​​is a first proportion value.

[0040] In some embodiments, each opportunity group subset among multiple PRACH opportunity group subsets contains X1 PRACH opportunities, and in each opportunity group subset among multiple PRACH opportunity group subsets, the multiple candidate values ​​are used in descending order to map each of the X1 PRACH opportunities to each of the Q1 PRACH opportunity groups.

[0041] In some embodiments, the mapping of X PRACH opportunities to Q PRACH opportunity groups is related to one or more of the following: the number of frequency-division multiplexed 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.

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

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

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

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

[0046] In some embodiments, each of the Q PRACH opportunity groups includes each of the multiple 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 each of multiple PRACH opportunities, the Q PRACH opportunity groups correspond to multiple random access preambles, and at least two of the Q PRACH opportunity groups have different random access preambles.

[0048] In a fourth embodiment, a method applicable to a second node for wireless communication is provided, which includes the steps of transmitting a first information used to determine X PRACH opportunities, wherein 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 a second information used to determine a plurality of candidate values, wherein the number of PRACH opportunities in each of the Q PRACH opportunity groups is the corresponding candidate value of the plurality of candidate values. The plurality of candidate values ​​include a first candidate value and a second candidate value, where the larger of the first and second candidate values ​​is prioritized for the mapping of X PRACH opportunities to Q PRACH opportunity groups, and / or the mapping of X PRACH opportunities to Q PRACH opportunity groups is related to the number of PRACH opportunity groups corresponding to each candidate value among the plurality of candidate values.

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

[0050] In some embodiments, X PRACH opportunities occur within a first cycle.

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

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

[0053] In some embodiments, each opportunity group subset among a plurality of PRACH opportunity group subsets includes Q1 PRACH opportunity groups from Q PRACH opportunity groups, each of the plurality of candidate values ​​corresponds to at least one PRACH opportunity group from each of the Q1 PRACH opportunity groups in each opportunity group subset among the plurality of PRACH opportunity group subsets, and any two opportunity group subsets among 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 PRACH opportunity groups in each opportunity group subset of a plurality of PRACH opportunity group subsets corresponding to each candidate value among a plurality of candidate values ​​corresponds to a single value, and the value corresponding to the plurality of candidate values ​​is a first proportion value.

[0055] In some embodiments, each opportunity group subset among multiple PRACH opportunity group subsets contains X1 PRACH opportunities, and in each opportunity group subset among multiple PRACH opportunity group subsets, the multiple candidate values ​​are used in descending order to map each of the X1 PRACH opportunities to each of the Q1 PRACH opportunity groups.

[0056] In some embodiments, the mapping of X PRACH opportunities to Q PRACH opportunity groups is related to one or more of the following: the number of frequency-division multiplexed 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.

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

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

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

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

[0061] In some embodiments, each of the Q PRACH opportunity groups includes each of the multiple 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 each of multiple PRACH opportunities, the Q PRACH opportunity groups correspond to multiple random access preambles, and at least two of the Q PRACH opportunity groups have different random access preambles.

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

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

[0065] In a seventh embodiment, a communication system is provided, which includes a first node and / or a second node, as illustrated 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 solution provided in embodiments of the present disclosure.

[0066] In an eighth embodiment, a computer-readable storage medium is provided. The computer-readable storage medium is configured to store a computer program that causes a computer to perform some or all of the operations in the manner illustrated in the above embodiments.

[0067] In a ninth embodiment, a computer program product is provided, which includes a non-temporary computer-readable storage medium that stores the computer program and is executable by one or more processors to cause the computer to perform some or all of the operations in the manner illustrated in the above embodiments. In some embodiments, the computer program product may be a software installation package.

[0068] In a tenth embodiment, a computer program is provided that is executable by one or more processors to cause a computer to perform some or all of the operations in the manner illustrated in the above embodiments.

[0069] In an eleventh embodiment, a chip is provided which comprises memory and at least one processor. The at least one processor is configured to call and execute a computer program from memory in order to implement some or all of the operation of the manner illustrated in the above embodiment.

[0070] In embodiments of this disclosure, relatively large candidate values ​​among a 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 provided by the embodiments of this disclosure contribute to reducing the waste of resources.

[0072] The technical solutions according to the embodiments of this disclosure contribute to optimizing resource allocation for multiplexed PRACH transmission.

[0073] The technical solutions according to the embodiments of this disclosure contribute to improved performance and expanded coverage range of multiplexed PRACH transmission.

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

[0075] [Figure 1] This is a schematic diagram of the system architecture of a wireless communication system to which embodiments of the present disclosure can be applied. [Figure 2] This is a schematic diagram of the mapping of RO to ROG. [Figure 3] This is another schematic diagram of the mapping of RO to ROG. [Figure 4] This is yet another schematic diagram of the mapping of RO to ROG. [Figure 5] This is a flowchart of a method applicable to a node for wireless communication provided in some embodiments of the present disclosure. [Figure 6] This is a schematic diagram illustrating the implementation of mapping RO to ROG according to some embodiments of this disclosure. [Figure 7] This is a schematic diagram of another implementation of mapping RO to ROG according to some embodiments of the present disclosure. [Figure 8] This is a flowchart of another method applicable to a node for wireless communication provided in some embodiments of the present disclosure. [Figure 9] This is a flowchart of yet another method applicable to a node for wireless communication provided in some embodiments of this disclosure. [Figure 10] This is a flowchart of yet another method applicable to a node for wireless communication provided in some embodiments of the present disclosure. [Figure 11] This is a schematic diagram of the structure of a node for wireless communication provided in some embodiments of the present disclosure. [Figure 12] This is a schematic diagram of the structure of another node for wireless communication provided in some embodiments of the present disclosure. [Figure 13] This is a schematic diagram of the structure of a device provided in some embodiments of the present disclosure. [Figure 14] This is a schematic diagram of a hardware module of a communication device provided in some embodiments of the present disclosure. [Modes for carrying out the invention]

[0076] Communication system architecture Figure 1 is a schematic diagram of the 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 user equipment 120. The network device 110 may be a device that performs communication between the network device and the user equipment 120. The network device 110 can provide communication coverage to a specific geographic area and can communicate with user equipment 120 located within that coverage area.

[0077] Figure 1 illustrates an exemplary network device and two user devices. In some embodiments, the wireless communication system 100 comprises multiple network devices, and the coverage area of ​​each network device may cover a number of other user devices, which are not described in detail in the embodiments of this 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 this disclosure.

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

[0080] The technical solutions in the embodiments of this disclosure may be used for random access, but it is understood that they may also be used for beam fault recovery. Furthermore, the technical solutions in the embodiments of this disclosure may be used for Type-1 random access procedures, and may also be used for Type-2 random access procedures. Furthermore, the technical solutions in the embodiments of this disclosure may be used for Uu interfaces, and may also be used for PC5 interfaces. Furthermore, the technical solutions in the embodiments of this disclosure may be used for single-carrier communications, and may also be used for multi-carrier communications. Furthermore, the technical solutions in the embodiments of this disclosure may be used for multi-antenna communications, and may also be used for single-antenna communications. Furthermore, the technical solutions in the embodiments of this disclosure may be applied to user equipment and base station scenarios, and may 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 user equipment and base station scenarios. Furthermore, the technical solutions in the embodiments of this disclosure can be applied to a variety of communication scenarios, including enhanced mobile broadband (eMBB) scenarios, ultra-high reliability low latency (URLLC) scenarios, massive machine-type communication (mMTC) scenarios, and similar ones. Moreover, adopting a unified solution for different scenarios can help reduce hardware complexity and cost.

[0081] User equipment in embodiments of the Disclosure may also be referred to as terminal devices, access terminals, subscriber units, subscriber stations, mobile radio stations, mobile stations (MS), mobile terminals (MT), remote stations, remote terminals, mobile devices, user terminals, terminals, wireless communication devices, user agents, or user devices. User equipment in embodiments of the 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. User equipment in embodiments of the Disclosure may be mobile phones, tablet computers (Pads), laptop computers, palmtop computers, mobile internet devices (MIDs), wearable devices, virtual reality (VR) devices, augmented reality (AR) devices, wireless terminals in industrial control, wireless terminals in autonomous driving, wireless terminals in telemedicine surgery, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, wireless terminals in smart homes, and similar. In some embodiments, the UE may function as a base station. For example, a UE (Underground User) can function as a scheduling entity providing sidelink signals between UEs in vehicle-to-everything (V2X) communication, device-to-device (D2D) communication, or similar. For instance, a cell phone and a vehicle might communicate with each other using sidelink signals, or a cell phone and a smart home device might communicate with each other without relaying the communication signals through a base station.

[0082] In embodiments of the Disclosure, a network device may be a device for communicating with user equipment. A network device may also be referred to as an access network device or a wireless access network device. For example, a network device may be a base station. In embodiments of the Disclosure, a network device may refer to a wireless access network (RAN) node (or device) that allows user equipment to access a wireless network. A base station broadly includes, or may be equivalent to, a variety of terms such as NodeB, Evolutionary NodeB (eNB), Next Generation NodeB (gNB), relay station, access point, transmission receiving point (TRP), transmission point (TP), master eNodeB (MeNB), secondary eNodeB (SeNB), multistandard 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 similar, or a combination thereof. A base station may also refer to a communication module, modem, or chip located within the aforementioned device or apparatus. A base station may be a mobile switching station, a device functioning as a base station in D2D, V2X, or 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 similar. A base station may support networks having the same or different access technologies. Embodiments of this disclosure are not limited to specific technologies or equipment configurations of network devices.

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

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

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

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

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

[0088] The coverage performance of a communication system varies depending on the frequency band in which it operates. For example, compared to an LTE system, an NR system operates in a higher frequency band (e.g., the millimeter-wave frequency band), resulting in greater path loss and therefore relatively inferior coverage performance. Consequently, as the frequency bands supported by communication systems can gradually increase, how to extend the coverage of communication systems becomes a challenge that needs to be addressed.

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

[0090] In the relevant technologies, there have been several uplink solutions for coverage extension. For example, Release 17 (Rel-17) for NR designs coverage extension schemes for physical uplink shared channels (PUSCH), physical uplink controlled channels (PUCCH), and message 3 (Msg3) in random access processes.

[0091] However, while Rel-17 does not include a coverage enhancement scheme for PRACH, the performance of PRACH transmission (also known as PRACH transmission) is critical to many processes, including initial access, beam fault recovery, and similar processes. Therefore, coverage enhancement for PRACH is also very important. Based on this, the 3rd Generation Partnership Project (3GPP®) RP-221858, Rel-18, has developed a work item (WI) titled "further NR coverage enhancements." In this WI, enhancing the coverage performance of PRACH transmission is one of the key topics.

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

[0093] In some embodiments, multiple PRACH transmissions are used for Random Access Channel (RACH) trials. That is, in a RACH trial, a scheme of multiple PRACH transmissions may be used to extend PRACH coverage (for example, by transmitting a preamble over PRACH multiple times).

[0094] In embodiments of this disclosure, multiplexed PRACH transmission may refer to multiplexed PRACH transmission using the same beam or multiplexed PRACH transmission using different beams. Taking multiplexed PRACH transmission using the same beam as an example, multiplexed PRACH transmission using the same beam can result in performance improvements and can therefore be used as a feasible PRACH coverage extension scheme. At the 3GPP Radio Access Network (RAN) 1#110bis-e meeting, it was agreed that PRACH opportunities (or referred to as PRACH opportunities) at least at different time instances (or referred to as point in time, temporal instances, or similar) may be used for multiplexed PRACH transmission using the same beam. In other words, ROG may be used for multiplexed PRACH transmission using the same beam.

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

[0096] PRACH Opportunity Group In some scenarios, an ROG is introduced to represent a set of multiple PRACH occasions (ROs), and therefore an ROG may also be referred to as an "RO set." Embodiments of this disclosure do not limit the naming of ROGs. For ease of explanation, embodiments of this disclosure are illustrated based on ROGs. Embodiments of this disclosure do not limit the naming of PRACH occasions, 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 this disclosure are illustrated based on PRACH occasions, and PRACH occasions and random access opportunities described in embodiments of this disclosure may be interchangeable.

[0097] In some embodiments, the ROG may be used for multiplexed PRACH transmission 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, several conferences (e.g., 3GPP RAN1) have agreed to introduce ROGs as resources for multiplexed PRACH transmissions. An ROG may include multiple valid ROs; for example, an ROG may include multiple valid ROs that do not overlap with each other in the time domain.

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

[0101] In some embodiments, for a certain number of PRACH transmissions, the ROG includes an active RO, which helps to transmit a certain number of PRACH through the active RO.

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

[0103] In some embodiments, all ROs within an ROG may be associated with an SSB. In some embodiments, all ROs within an ROG may be associated with multiple SSBs, and each RO within an ROG may be associated with the same multiple SSBs.

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

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

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

[0107] Next, if legacy SSB-to-RO mapping rules are reused, the issue that needs to be resolved is how to map ROs to ROGs after SSB-to-RO mapping. In other words, the issue that needs to be addressed is how to determine (or configure) ROGs after SSB-to-RO mapping.

[0108] Mapping ROs to ROGs may require consideration of several factors. For example, in addition to considering the configured size of the ROG (or the configured number of PRACH transmissions for multiplexed 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 competition-based preambles corresponding to each SSB. For ease of understanding, two example RO mapping schemes to ROGs are presented below with reference to Figures 2 and 3.

[0109] Figure 2 shows an example of a scheme for mapping ROs to ROGs. When the number of frequency-division multiplexed ROs in a given 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 Figure 2, i.e., RO#0 corresponds to SSBs 0-7, RO#1 corresponds to SSBs 8-15, RO#2 corresponds to SSBs 16-23, and so on. In this case, all ROs in an ROG are associated with the same SSB, and considering that the ROs within an ROG are in different time instances, referring to Figure 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 are 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 within a determined ROG may be discontinuous. That is, the ROs within an ROG may be separated by one or more ROs. Taking Figure 2 as an example, when the ROG includes RO#1 and RO#9, there is a 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] Figure 3 shows another example of a scheme for mapping ROs to ROGs. When the number of frequency-division multiplexed ROs in a given 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 Figure 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, all ROs in the ROG are associated with the same SSB, and considering that the ROs within the ROG are in different time instances, RO#1, RO#3, RO#5, and RO#7 can be mapped to the same ROG, as can be seen in Figure 3. 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 within a determined ROG may be continuous; that is, there may be no other ROs between ROs within an ROG. Taking Figure 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 continuous.

[0113] From the above explanation, it is clear that any one or more of the multiple factors can influence 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—2RO, 4RO, or 8RO—and that the ROs within an ROG are in different time instances, different ROG determination methods can result in orphan ROs that cannot be used for multiplexed PRACH transmissions, leading to resource waste. In some embodiments, the number of resulting orphan ROs may vary depending on different parameter configurations, and consequently, the degree of resource waste may also vary. In addition, the mapping scheme of ROs to ROGs can influence resource allocation for multiplexed PRACH transmissions. For easier understanding, this issue will be explained in more detail below, along with Figure 4.

[0114] Referring to Figure 4, in this example, the ROs need to be mapped to ROGs of three different sizes: 2RO, 4RO, and 8RO, respectively. This example assumes that trials of the random access channel correspond to three PRACH time slots. From the example in Figure 4, we can see that after mapping to ROGs with ROG sizes of 2RO and 4RO, there are not enough ROs to be mapped to an ROG with ROG size of 8RO. Therefore, the remaining ROs are not mapped to an ROG with ROG size of 8RO, and as a result, the remaining ROs become orphan ROs.

[0115] To address the above issues, embodiments of the present disclosure provide methods and devices applicable to nodes for wireless communications, which contribute to optimizing the RO mapping scheme to ROGs, or reducing or preventing the occurrence of orphan ROs. In this way, resource waste can be reduced. Technical solutions according to embodiments of the present disclosure are illustrated below.

[0116] This disclosure is applicable to multiple PRACH transmission scenarios, i.e., scenarios that use multiple repeated PRACH transmissions to achieve extended PRACH coverage.

[0117] This disclosure is applicable to a variety of random access processes. In some embodiments, this disclosure is applicable to a four-step random access process, in other words, to a Type-1 random access procedure. In some embodiments, this disclosure is applicable to a two-step random access process, in other words, to a Type-2 random access procedure. In some embodiments, this disclosure is applicable to a random access process that supports multiple PRACH transmission, in other words, to a Type-3 random access procedure.

[0118] This disclosure is applicable to random access processes initiated by various initiation methods. In some embodiments, this application is applicable to random access processes initiated by PDCCH sequences. In some embodiments, this application is applicable to random access processes initiated by media access control (MAC) entities. In some embodiments, this application is applicable to random access processes initiated by radio resource control (RRC) events.

[0119] In some embodiments, the multiplexed PRACH transmission described herein may refer to a multiplexed PRACH transmission that uses 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, the multiplexed PRACH transmission described herein may refer to a multiplexed PRACH transmission that uses different beams to obtain diversity gain through repeated transmission of multiple PRACHs performed on different beams.

[0121] In some embodiments, this disclosure primarily considers the reuse of legacy SSB-to-RO mapping rules and designs an RO-to-ROG mapping scheme (mapping rules) based on them. Note that this disclosure primarily considers, but is not limited to, the reuse of legacy SSB-to-RO mapping rules.

[0122] The methods and devices provided in this disclosure are illustrated below using a number of embodiments or examples. It should be understood that, to the extent that they do not contradict each other, the features of a first node in the embodiments of this disclosure may apply to a second node, and vice versa. To the extent that they do not contradict each other, the features in the embodiments of this disclosure may be combined in any way.

[0123] Figure 5 is a flowchart of a method applicable to nodes for wireless communication provided in some embodiments of this disclosure. The method shown in Figure 5 is illustrated in terms of the interaction 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 can perform the mapping of ROs to ROGs.

[0125] In some embodiments, the first node may be a user device. For example, the first node may be a user device 120 as shown in Figure 1.

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

[0127] In some embodiments, the first node may be a repeater, such as a repeater 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 in 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 repeater, such as a repeater 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] The method shown in Figure 5 is illustrated below. Referring to Figure 5, the method shown in Figure 5 may include operations S510 and S520.

[0138] In S510, the first node receives the first piece of information.

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

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

[0141] Implementations for determining X PRACH opportunities using the first information are not specified in the embodiments of this disclosure. In some embodiments, the first information is used to determine at least one of the following: the number of synchronization signal blocks corresponding to each of the X PRACH opportunities, and the number of random access preambles corresponding to the synchronization signal blocks corresponding to each of the X PRACH opportunities.

[0142] In some embodiments, the first information is used to determine the number of synchronization signal blocks corresponding to each PRACH opportunity out of 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 blocks corresponding to each PRACH opportunity out of X PRACH opportunities.

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

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

[0146] In embodiments of this 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 out of X PRACH opportunities. For example, the parameter ssb-perRACH-Occasion is used to indicate the number of synchronization signal blocks corresponding to each PRACH opportunity out of X PRACH opportunities. In some other embodiments, the first information may indicate the number of synchronization signal blocks corresponding to each PRACH opportunity out of X PRACH opportunities, the number of random access preambles corresponding to each synchronization signal block, and similar. For example, the 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 transmission parameters for configuring a synchronous signal block in a communication network (such as a 5G network). For example, the first information may be the parameters ssb-perRACH-OccasionAndCB-PreamblesPerSSB.

[0148] In some embodiments, the relevant introductions for the parameters ssb-perRACH-OccasionAndCB-PreamblesPerSSB may be described in the introductions of 3GPP TS38.331.

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

[0150] In some embodiments, the first information is transmitted to the first node by a second node. For example, the first information is transmitted to the first node by a network device or other 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, X PRACH opportunities are mapped by a first node into Q PRACH opportunity groups.

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

[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 out of X PRACH opportunities.

[0159] In some embodiments, each of the Q PRACH opportunity groups includes a corresponding PRACH opportunity from among X PRACH opportunities. Each of the PRACH opportunity groups 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, each of the Q PRACH opportunity groups includes a corresponding number of PRACH opportunities from among X PRACH opportunities. Each of the Q PRACH opportunity groups may be any one of the Q PRACH opportunity groups. The corresponding number of PRACH opportunities may be any number of PRACH opportunities from among X PRACH opportunities.

[0161] In some embodiments, each of the multiple PRACH opportunities in each of the Q PRACH opportunity groups is orthogonal to each other in the time domain. In other words, the multiple PRACH opportunities in each of the Q PRACH opportunity groups do not overlap with each other in the time domain. In other words, the multiple 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 each other in the time domain may refer to any two of the multiple PRACH opportunities being distributed across different time instances.

[0163] In some embodiments, each of the Q PRACH opportunity groups includes each of the multiple 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 each of multiple PRACH opportunities, the Q PRACH opportunity groups correspond to multiple 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 multiple PRACH opportunities in each of the Q PRACH opportunity groups is associated with the same synchronization signal block. In other words, each of the multiple PRACH opportunities in each of the Q PRACH opportunity groups is associated with the same synchronization signal block.

[0166] In some embodiments, each of the multiple PRACH opportunities in each of the Q PRACH opportunity groups is orthogonal to each other in the time domain and related to the same synchronization signal block.

[0167] In some embodiments, at least two of the Q PRACH opportunity groups each contain a different number of PRACH opportunities. For example, the Q PRACH opportunity groups include a first PRACH opportunity group and a second PRACH opportunity group, where 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 contain the same number of PRACH opportunities. For example, the Q PRACH opportunity groups include a first PRACH opportunity group and a second PRACH opportunity group, where 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 of the Q PRACH opportunity groups each contain the same number of PRACH opportunities.

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

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

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

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

[0174] In some embodiments, Q PRACH opportunity groups may be used for multiplexed PRACH transmission. For example, Q PRACH opportunity groups may be used for multiplexed PRACH transmission by a first node.

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

[0176] In some embodiments, multiplexed PRACH transmission corresponds to random access channel trials.

[0177] In some embodiments, multiplexed PRACH transmission is used for random access channel trials.

[0178] In some embodiments, multiplexed PRACH transmission includes the transmission of multiple random access preambles in a random access channel trial.

[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] In S520, the first node receives the second piece of information.

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

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

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

[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 a second node. For example, the second information is transmitted to the first node by a network device or other node.

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

[0187] In some embodiments, PHY signaling may include, or be replaced by, at least one of downlink control information (DCI), physical broadcast channel (PBCH), or demodulation reference signal (DMRS).

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

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

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

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

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

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

[0194] In some embodiments, the multiple candidate values ​​include at least two of {1,2,4,8}. For example, the multiple candidate values ​​include {1,2}, or the multiple candidate values ​​include {1,4}, or the multiple candidate values ​​include {1,2,4}, or the multiple candidate values ​​include {1,2,8}, or the multiple candidate values ​​include {1,2,4,8}, and so on.

[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 largest ROG size among a plurality of ROG sizes.

[0196] For example, when multiple candidate values ​​include 2 and 4, the first candidate value is 4. As another example, when multiple candidate values ​​include 2 and 8, the first candidate value is 8. As yet another example, when multiple candidate values ​​include 4 and 8, the first candidate value is 8. As yet another example, when multiple candidate values ​​include 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 among a plurality of candidate values. For example, if the plurality of candidate values ​​include at least two of {1, 2, 4, 8}, then when the plurality of candidate values ​​include {2, 4}, the number of PRACH opportunities in each of the Q PRACH opportunity groups is one of {2, 4}, and when the plurality of candidate values ​​include {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 a PRACH opportunity group corresponding to each of the multiple candidate values ​​is equal to the number of each candidate value. In other words, the number of PRACH opportunities in each of the at least one PRACH opportunity group corresponding to each of the multiple candidate values ​​is equal to the number of each candidate value.

[0199] In some embodiments, the first candidate value is one of several 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 of several candidate values, the first and candidate values ​​correspond 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 each of the candidate values ​​among a plurality of candidate values, the first candidate value corresponds to a plurality of PRACH opportunity groups, and the number of PRACH opportunities in each 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 each of a plurality of candidate values, the first candidate value corresponds to at least one PRACH opportunity group, and the number of PRACH opportunities in each of the at least one PRACH opportunity group corresponding to the first candidate value is equal to the first candidate value.

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

[0204] In embodiments of this disclosure, the mapping of X PRACH opportunities to Q PRACH opportunity groups may be related to a plurality of factors (parameters), which may include, for example, a plurality of candidate values, the number of PRACH opportunity groups corresponding to each of the plurality of candidate values, and one or more of the same.

[0205] In some embodiments, the multiple candidate values ​​include a first candidate value and a second candidate value, where the larger of the first and second candidate values ​​is prioritized for mapping X PRACH opportunities to Q PRACH opportunity groups, and / or the mapping of X PRACH opportunities to Q PRACH opportunity groups is related to the number of PRACH opportunity groups corresponding to each candidate value among the multiple candidate values.

[0206] In some embodiments, the larger of the first candidate value and the second candidate value is prioritized for mapping X PRACH opportunities to Q PRACH opportunity groups. In other words, the determination of PRACH opportunity groups corresponding to the larger of the first candidate value and the second candidate value is prioritized.

[0207] In some embodiments, the first candidate value and the second candidate value each represent different ROG sizes. The mapping of 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 preferred.

[0208] For example, the first candidate value is 2, the second candidate value is 4, and candidate value 4 is prioritized for mapping X PRACH opportunities to Q PRACH opportunity groups. In other words, the determination of the PRACH opportunity group corresponding to candidate value 4 takes precedence. In other words, the mapping of X PRACH opportunities to PRACH opportunity groups with an ROG size of 4 takes precedence. In other words, the determination of PRACH opportunity groups with an ROG size of 4 takes precedence.

[0209] In some embodiments, the larger of several candidate values ​​is prioritized for mapping X PRACH opportunities to Q PRACH opportunity groups. In other words, the determination of PRACH opportunity groups corresponding to the larger of several candidate values ​​is prioritized.

[0210] For example, multiple candidate values ​​include {4, 8}, and candidate value 8 is prioritized for mapping X PRACH opportunities to Q PRACH opportunity groups. In other words, the determination of PRACH opportunity groups corresponding to candidate value 8 takes precedence. In other words, the mapping of X PRACH opportunities to PRACH opportunity groups with an ROG size of 8 takes precedence. In other words, the determination of PRACH opportunity groups with an ROG size of 8 takes precedence.

[0211] As another example, multiple candidate values ​​include {2, 4, 8}. Mapping X PRACH opportunities to the PRACH opportunity group corresponding to candidate value 4 and / or 8 has a higher priority than mapping X PRACH opportunities to the PRACH opportunity group corresponding to candidate value 2, and mapping X PRACH opportunities to the PRACH opportunity group corresponding to candidate value 8 has a higher priority than mapping X PRACH opportunities to the PRACH opportunity group corresponding to candidate value 4. In other words, mapping X PRACH opportunities to the PRACH opportunity group with ROG size 4 and / or 8 has a higher priority than mapping X PRACH opportunities to the PRACH opportunity group with ROG size 4, and mapping X PRACH opportunities to the PRACH opportunity group with ROG size 8 has a higher priority than mapping X PRACH opportunities to the PRACH opportunity group with ROG size 4.

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

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

[0214] In some embodiments, when the communication system is configured to have multiple ROG sizes, the multiple ROG sizes are used to map X PRACH opportunities to 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] For example, multiple candidate values ​​include {2,4,8}. Candidate value 8 is prioritized for mapping X PRACH opportunities to Q PRACH opportunity groups, then candidate value 4 is used for mapping X PRACH opportunities to Q PRACH opportunity groups, and finally candidate value 2 is used for mapping X PRACH opportunities to Q PRACH opportunity groups. In other words, multiple candidate values ​​include {2,4,8}, and the mapping of X PRACH opportunities to PRACH opportunity groups with an ROG size of 8 is prioritized, then the mapping of X PRACH opportunities to PRACH opportunity groups with an ROG size of 4 is performed, and finally the mapping of X PRACH opportunities to PRACH opportunity groups with an ROG size of 2 is performed. In other words, multiple candidate values ​​include {2,4,8}, and the determination of PRACH opportunity groups with an ROG size of 8 is prioritized, then the PRACH opportunity groups with an ROG size of 4 are determined, and finally the PRACH opportunity groups with an ROG size of 2 are determined.

[0217] As another example, multiple candidate values ​​include {1,2,4}. Candidate value 4 is prioritized for mapping X PRACH opportunities to Q PRACH opportunity groups, then candidate value 2 is used for mapping X PRACH opportunities to Q PRACH opportunity groups, and finally candidate value 1 is used for mapping X PRACH opportunities to Q PRACH opportunity groups. In other words, multiple candidate values ​​include {1,2,4}, and the mapping of X PRACH opportunities to PRACH opportunity groups with an ROG size of 4 is prioritized, then the mapping of X PRACH opportunities to PRACH opportunity groups with an ROG size of 2 is performed, and finally the mapping of X PRACH opportunities to PRACH opportunity groups with an ROG size of 1 is performed. In other words, multiple candidate values ​​include {1,2,4}, and the determination of PRACH opportunity groups with an ROG size of 4 is prioritized, then the PRACH opportunity groups with an ROG size of 2 are determined, and finally the PRACH opportunity groups with an ROG size of 1 are determined.

[0218] In some embodiments, the maximum value of multiple candidate values ​​is prioritized for mapping X PRACH opportunities to Q PRACH opportunity groups. In other words, the determination of PRACH opportunity groups corresponding to the maximum value of multiple candidate values ​​is prioritized.

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

[0220] For example, when multiple candidate values ​​include {2, 4, 8}, candidate value 8 is prioritized over the mapping of X PRACH opportunities to Q PRACH opportunity groups, or the determination of the PRACH opportunity group corresponding to candidate value 8 is prioritized, or the mapping of X PRACH opportunities to a PRACH opportunity group with an ROG size of 8 is prioritized, or the determination of a PRACH opportunity group with an ROG size of 8 is prioritized.

[0221] As another example, when multiple candidate values ​​include {1, 2, 4}, candidate value 4 is prioritized over the mapping of X PRACH opportunities to Q PRACH opportunity groups, or the determination of the PRACH opportunity group corresponding to candidate value 4 is prioritized, or the mapping of X PRACH opportunities to a PRACH opportunity group 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] The requirements for PRACH opportunities become stricter due to the fact that larger candidate values ​​(larger ROG sizes) require more PRACH opportunities that do not overlap with each other in the time domain. Therefore, when mapping PRACH opportunities to PRACH opportunity groups, mappings corresponding to larger candidate values ​​are preferred, followed by mappings corresponding to relatively smaller candidate values. 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, mappings corresponding to larger ROG sizes are preferred, followed by mappings corresponding to relatively smaller ROG sizes. In this way, orphan PRACH opportunities can be minimized and resource utilization efficiency can be improved.

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

[0224] In some embodiments, the multiple candidate values ​​include a first candidate value and a second candidate value, and the mapping of X PRACH opportunities to 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 multiple candidate values ​​include a first candidate value, a second candidate value, and a third candidate value, and the mapping of X PRACH opportunities to 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 multiple candidate values ​​may include three or more candidate values, and the mapping of X PRACH opportunities to Q PRACH opportunity groups is related to the number of PRACH opportunity groups corresponding to each candidate value among the multiple candidate values.

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

[0228] In some embodiments, the multiple ROG sizes include a first ROG size and a second ROG size, and the mapping of X PRACH opportunities to 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 multiple ROG sizes include a first ROG size, a second ROG size, and a third ROG size, and the mapping of X PRACH opportunities to 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 plurality of ROG sizes may include three or more ROG sizes, and the mapping of X PRACH opportunities to Q PRACH opportunity groups is related to the number of PRACH opportunity groups having each of the plurality of ROG sizes.

[0231] For example, if multiple candidate values ​​include {2,4}, 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 an ROG size of 2 and the number of PRACH opportunity groups with an ROG size of 4.

[0232] As another example, if multiple candidate values ​​include {2, 4, 8}, the mapping of X PRACH opportunities to Q PRACH opportunity groups relates 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 relates to the number of PRACH opportunity groups with an ROG size of 2, the number of PRACH opportunity groups with an ROG size of 4, and the number of PRACH opportunity groups with an ROG size of 8.

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

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

[0235] In some embodiments, each opportunity group subset among a plurality of PRACH opportunity group subsets includes Q1 PRACH opportunity groups from Q PRACH opportunity groups, each of the plurality of candidate values ​​corresponds to at least one PRACH opportunity group from each of the Q1 PRACH opportunity groups in each opportunity group subset among the plurality of PRACH opportunity group subsets, and any two opportunity group subsets among 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 multiple candidate values ​​include a first candidate value and a second candidate value, and the multiple 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 out of Q1 PRACH opportunity groups in the first opportunity group subset, and the second candidate value corresponds to at least one PRACH opportunity group out of 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 out of Q1 PRACH opportunity groups in the second opportunity group subset, and the second candidate value corresponds to at least one PRACH opportunity group out of Q1 PRACH opportunity groups in the second opportunity group subset.

[0237] In some embodiments, the multiple candidate values ​​include a first candidate value, a second candidate value, and a third candidate value, and the multiple 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 out of Q1 PRACH opportunity groups in the first opportunity group subset, the second candidate value corresponds to at least one PRACH opportunity group out of Q1 PRACH opportunity groups in the first opportunity group subset, and the third candidate value corresponds to at least one PRACH opportunity group out of 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 out of Q1 PRACH opportunity groups in the second opportunity group subset, the second candidate value corresponds to at least one PRACH opportunity group out of Q1 PRACH opportunity groups in the second opportunity group subset, and the third candidate value corresponds to at least one PRACH opportunity group out of Q1 PRACH opportunity groups in the second opportunity group subset.

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

[0239] For example, multiple candidate values ​​include {2,4}, and multiple PRACH opportunity group subsets include 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 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 a subset of multiple PRACH opportunity group subsets corresponding to any one of a 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 plurality of PRACH opportunity group subsets.

[0241] In some embodiments, any two opportunity group subsets among a plurality of PRACH opportunity group subsets corresponding to any one of a 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 from a plurality of PRACH opportunity group subsets, where 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] For example, multiple candidate values ​​include {2,4}, and multiple PRACH opportunity group subsets include a first opportunity group subset and a second 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 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, multiple candidate values ​​include {2,4}, and multiple PRACH opportunity group subsets include 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, multiple candidate values ​​include {2, 4, 8}, and multiple PRACH opportunity group subsets include 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 of the multiple PRACH opportunity group subsets have the same number of PRACH opportunity groups.

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

[0248] In some embodiments, a plurality of PRACH opportunity group subsets include a first opportunity group subset and a second opportunity group subset, where 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, a plurality of PRACH opportunity group subsets include a first opportunity group subset, a second opportunity group subset, and a third opportunity group subset, where 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 PRACH opportunity groups in each opportunity group subset of a plurality of PRACH opportunity group subsets corresponding to each candidate value among a plurality of candidate values ​​corresponds to a single value, and the value corresponding to the plurality of candidate values ​​is a first proportion value.

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

[0252] In some embodiments, the multiple candidate values ​​include a first candidate value and a second candidate value, and the multiple PRACH opportunity group subsets include a first opportunity group subset and a second opportunity group subset. The 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. The 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] For example, the number of PRACH opportunity groups in each of the multiple PRACH opportunity group subsets corresponding to the first candidate value is A, and the number of PRACH opportunity groups in each of the multiple PRACH opportunity group subsets corresponding to the second candidate value is B, and the first ratio can be expressed as A:B.

[0254] For example, the number of PRACH opportunity groups in the first opportunity group subset corresponding to the first candidate value is A1, and the number of PRACH opportunity groups in the first opportunity group subset corresponding to the second candidate value is B1, and the first ratio can 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, and the number of PRACH opportunity groups in the second opportunity group subset corresponding to the second candidate value is B2, and the first ratio can be expressed as A2:B2, where A1:B1 is equal to A2:B2.

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

[0256] In some embodiments, the multiple candidate values ​​include a first candidate value, a second candidate value, and a third candidate value, and the multiple PRACH opportunity group subsets include a first opportunity group subset and a second opportunity group subset. The 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. The 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] For example, the number of PRACH opportunity groups in each of the multiple PRACH opportunity group subsets corresponding to the first candidate value is A, the number of PRACH opportunity groups in each of the multiple PRACH opportunity group subsets corresponding to the second candidate value is B, and the number of PRACH opportunity groups in each of the multiple PRACH opportunity group subsets corresponding to the third candidate value is C, and the first ratio can be expressed as A:B:C.

[0258] For 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 number of PRACH opportunity groups in the first opportunity group subset corresponding to the third candidate value is C1, and the first ratio can 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, and the number of PRACH opportunity groups in the second opportunity group subset corresponding to the third candidate value is C2, and the first ratio can be expressed as A2:B2:C2, where A1:B1:C1 is equal to A2:B2:C2.

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

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

[0261] In some embodiments, the first proportion consists of high-level signaling or higher-level signaling. For example, the first proportion consists of RRC signaling and / or MAC CE signaling.

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

[0263] In some embodiments, the multiple candidate values ​​include a first candidate value and a second candidate value, where the first ratio is the 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 multiple candidate values ​​include a first candidate value, a second candidate value, and a third candidate value, where the first ratio is the 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 proportion is equal to the greatest common divisor of the number of PRACH opportunity groups to be determined, each corresponding to a plurality of candidate values.

[0266] In some embodiments, each opportunity group subset among multiple PRACH opportunity group subsets contains X1 PRACH opportunities, and in each opportunity group subset among multiple PRACH opportunity group subsets, the multiple candidate values ​​are used in descending order to map each of the X1 PRACH opportunities to each of the Q1 PRACH opportunity groups.

[0267] In some embodiments, each opportunity group subset among multiple PRACH opportunity group subsets includes X1 PRACH opportunities out of X PRACH opportunities, and the multiple candidate values ​​include a first candidate value and a second candidate value, where the first candidate value is greater than the second candidate value. In each opportunity group subset among multiple PRACH opportunity group subsets, the mapping of each X1 PRACH opportunity to each Q1 PRACH opportunity group corresponding to the first candidate value is prioritized, followed by the mapping of each X1 PRACH opportunity to each Q1 PRACH opportunity group corresponding to the second candidate value.

[0268] In some embodiments, each opportunity group subset among multiple PRACH opportunity group subsets includes X1 PRACH opportunities out of X PRACH opportunities, and the multiple 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 among multiple PRACH opportunity group subsets, the mapping of X1 PRACH opportunities corresponding to the first candidate value to each Q1 PRACH opportunity group is prioritized, followed by the mapping of X1 PRACH opportunities corresponding to the second candidate value to each Q1 PRACH opportunity group, and finally the mapping of X1 PRACH opportunities corresponding to the third candidate value to each Q1 PRACH opportunity group is performed.

[0269] In some embodiments, each opportunity group subset among multiple PRACH opportunity group subsets contains X1 PRACH opportunities, and in each opportunity group subset among multiple PRACH opportunity group subsets, the larger of multiple candidate values ​​is prioritized for mapping X1 PRACH opportunities to each of Q1 PRACH opportunity groups.

[0270] In some embodiments, each opportunity group subset among multiple PRACH opportunity group subsets contains X1 PRACH opportunities from X PRACH opportunities, and in each opportunity group subset among multiple PRACH opportunity group subsets, the larger of the first candidate value and the second candidate value is prioritized for the mapping of X1 PRACH opportunities to each of Q1 PRACH opportunity groups. The first candidate value and the second candidate value are two of multiple candidate values.

[0271] In some embodiments, each opportunity group subset among multiple PRACH opportunity group subsets contains X1 PRACH opportunities, and in each opportunity group subset among multiple PRACH opportunity group subsets, the maximum of multiple candidate values ​​is prioritized for mapping X1 PRACH opportunities to each of Q1 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 an ROG with a relatively small size for multiple PRACH transmissions, it can be guaranteed 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 explanation illustrates that in the process of mapping X PRACH opportunities to Q PRACH opportunity groups, the larger of several candidate values ​​is prioritized for mapping PRACH opportunities to PRACH opportunity groups, and / or the number of PRACH opportunity groups corresponding to each of the several candidate values ​​is used for mapping PRACH opportunities to PRACH opportunity groups. By considering these 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, or by considering these factors contributing to reducing resource waste, or by considering these factors contributing to optimizing resource allocation for multiplexed PRACH transmissions, or by considering these factors contributing to improved performance and expanded coverage of multiplexed PRACH transmissions, or by considering these factors contributing to reduced random access latency and improved utilization efficiency of random access resources.

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

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

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

[0277] When multiple candidate values ​​include 2, 4, and 8, in the process of mapping RO to ROG, one PRACH opportunity group corresponding to candidate value 8 may be determined first, followed by two PRACH opportunity groups corresponding to candidate value 4, and finally three PRACH opportunity groups corresponding to candidate value 2. In other words, when multiple ROG sizes include 2, 4, and 8, in the process of mapping RO to ROG, one PRACH opportunity group with an ROG size of 8 may be determined first, followed by two PRACH opportunity groups with an ROG size of 4, and finally three PRACH opportunity groups with an ROG size of 2.

[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 the PRACH opportunity group corresponding to candidate value 4 is determined first. Referring to the PRACH opportunity group 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. Next, the PRACH opportunity group corresponding to candidate value 2 is determined. Referring to the PRACH opportunity group 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 (an ROG with a relatively small size) for multiple PRACH transmissions, the available ROG resources are positioned further back, which can result in a relatively high random access delay for the first node.

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

[0281] For PRACH opportunity groups that correspond to multiple candidate values ​​(multiple ROG sizes), PRACH opportunity groups corresponding to different candidate values ​​(different ROG sizes) may be determined according to a specific proportionality coefficient (such as the first proportion mentioned above). These PRACH opportunity groups corresponding to different candidate values ​​belong to the same opportunity group subset.

[0282] In some embodiments, within each opportunity group subset, the determination of the PRACH opportunity group corresponding to a relatively large candidate value (relatively large ROG size) may be prioritized.

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

[0284] Referring to Figure 7, in the example shown in Figure 7, the multiple candidate values ​​include 2, 4, and 8, and the number of ROGs to be determined with an ROG size of 8 is S1, the number of ROGs to be determined with an ROG size of 4 is S2, and the number of ROGs to be determined with an ROG size of 2 is S3. In one implementation, according to a certain proportionality coefficient (for example, the ratio of the number of ROGs with an ROG size of 8 to the number of ROGs with an ROG size of 4 and the number of ROGs with an ROG size of 2 is t1:t2:t3), Y1 ROGs with an ROG size of 8 are determined first, then Y2 ROGs with an ROG size of 4 are determined, and finally Y3 ROGs with an ROG size of 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 a set of Y1+Y2+Y3 ROGs, the next set of Y1+Y2+Y3 ROGs is determined until the remaining ROs can no longer satisfy the mapping requirements to a set of Y1+Y2+Y3 ROGs. The remaining ROs are then assigned to ROGs of 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 proportionality coefficients (first ratios) of the number of ROGs corresponding to a plurality of candidate values (2, 4, 8) are 1:2:8. According to this ratio, Y1 ROGs with a ROG size of 8 are first determined (in the example shown in FIG. 7, 1 ROG with a ROG size of 8 is first determined), then Y2 ROGs with a ROG size of 4 are determined (in the example shown in FIG. 7, 2 ROGs with a ROG size of 4 are determined), and finally Y3 ROGs with a ROG size of 2 are determined (in the example shown in FIG. 7, 8 ROGs with a ROG size of 2 are determined). After determining a 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 having one or two of those ROG sizes.

[0286] When the mapping scheme is provided by Implementation Form 2, when the first node uses ROGs having a relatively small size for multiple PRACH transmissions, it can be guaranteed 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 Form 2 reduces the random access delay of multiple PRACH transmissions that occupy ROGs having a relatively small size, thereby improving the performance 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 exemplified above, the mapping of X PRACH opportunities to Q PRACH opportunity groups may be related to other information, and the embodiments of the present disclosure are not limited thereto. Some other information is exemplified below using examples.

[0288] In some embodiments, the mapping of X PRACH opportunities to Q PRACH opportunity groups is related to one or more of the following: the number of frequency-division multiplexed 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.

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

[0290] In some embodiments, the mapping of X PRACH opportunities to 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 as the number of synchronization signal blocks associated with each of the X PRACH opportunities changes.

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

[0292] In some embodiments, the mapping of X PRACH opportunities to Q PRACH opportunity groups is related to the number of frequency-division multiplexed 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 X PRACH opportunities to Q PRACH opportunity groups relates to the number of frequency-division multiplexed 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 a mapping from RO to ROG, 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] Figure 8 is a flowchart of another method applicable to nodes for wireless communication provided in some embodiments of this disclosure. The method shown in Figure 8 is illustrated in terms of the interaction 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 shown in Figure 8 may include operations S810 to S830.

[0297] In S810, the first node receives the first piece of information. This first piece of information is used to determine X PRACH opportunities.

[0298] In S820, the first node receives the second piece of information. This second piece of information is used to determine multiple candidate values.

[0299] For examples of operations S810 and S820, please refer to the examples of operations S510 and S520 above. For simplicity, they will not be repeated here.

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

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

[0302] In some embodiments, at least two of the multiple random access preambles are identical to each other.

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

[0304] In some embodiments, the first PRACH opportunity group is each 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, a first PRACH opportunity group comprises one or more PRACH opportunities, and one or more PRACH opportunities within the first PRACH opportunity group are configured to transmit a plurality of random access preambles.

[0306] In some embodiments, the first PRACH opportunity group includes only one PRACH opportunity, and one PRACH opportunity within 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 within the first PRACH opportunity group.

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

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

[0309] Embodiments of the present disclosure do not specify a first sequence used to generate a plurality of random access preambles. In some embodiments, the first sequence may be some sequences having good cross-correlation and auto-correlation characteristics. The following are some examples of the first sequence.

[0310] In some embodiments, the first sequence is a pseudo-random sequence. In some other embodiments, the first sequence is an M sequence. In some other embodiments, the first sequence is a Gold sequence. This disclosure is not limited thereto, and for example, the first sequence may also be one or more of the Kasami sequence, Barker sequence, Zadoff-Chu sequence, and similar sequences.

[0311] In some embodiments, the first sequence is a single sequence. For example, the first sequence is an M sequence, the first sequence is a Gold sequence, or similar.

[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 X PRACH opportunities described above fall within a 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 a synchronous signal block to a PRACH opportunity.

[0316] In some embodiments, the mapping cycle for mapping a synchronization signal block to a PRACH opportunity and the mapping cycle for mapping a PRACH opportunity to a PRACH opportunity group are the same cycle.

[0317] In some embodiments, the first cycle refers to the period associated with 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 the indices of multiple candidate synchronization signal blocks to X PRACH opportunities.

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

[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 the PRACH configuration cycle.

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

[0323] In some embodiments, Table 1 may be referenced for the set determined by the PRACH configuration cycle, i.e., the values ​​for the first cycle may be determined based on Table 1.

[0324] [Table 1]

[0325] In some embodiments, the first cycle begins with frame number 0.

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

[0327] In some embodiments, the first cycle includes one or more PRACH time slots. Taking a first cycle that includes 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 among a 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 X PRACH opportunities to Q PRACH opportunity groups is related to the number of PRACH opportunity groups corresponding to each candidate value among multiple candidate values. The following illustrates how the number of PRACH opportunity groups corresponding to each candidate value among multiple candidate values ​​is determined.

[0331] Figure 9 is a flowchart of yet another method applicable to nodes for wireless communication provided in some embodiments of this disclosure. The method shown in Figure 9 is illustrated in terms of the interaction 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 shown in Figure 9 may include operations S910 to S930.

[0333] In S910, the first node receives the first piece of information. This first piece of information is used to determine X PRACH opportunities.

[0334] In S920, the first node receives the second piece of information. This second piece of information is used to determine multiple candidate values.

[0335] For examples of operations S910 and S920, please refer to the examples of operations S510 and S520 above. For simplicity, they will not be repeated here.

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

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

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

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

[0340] In some embodiments, the ratio of the number of PRACH opportunity groups out of Q PRACH opportunity groups corresponding to each of several candidate values ​​is equal to a first proportion. See the above example of the first proportion, which will not be repeated here for simplicity.

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

[0342] In some embodiments, the number of random access preambles corresponding to at least one candidate value among a plurality of candidate values ​​is used to determine 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 among a plurality of candidate values ​​is used to determine Q PRACH opportunity groups.

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

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

[0346] In some embodiments, a relatively large value among a plurality of candidate values ​​is determined in descending order from the plurality of candidate values ​​and prioritized for determining Q PRACH opportunity groups, and the number of random access preambles corresponding to at least one of 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 a plurality of candidate values ​​is mapped in a first mapping order, the first mapping order includes one or more of the incremental order of the index of the random access preamble, the incremental order of the frequency resources, and the incremental order of the time resources.

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

[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 X PRACH opportunities to Q PRACH opportunity groups, the first node and / or the second node may perform random access based on the mapping relationships. For ease of understanding, a four-step random access process is used as an example below to illustrate the random access processes of the first and second nodes.

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

[0353] In S1010 (initial operation), the first node transmits a random access preamble to the second node. For example, the first node transmits multiple random access preambles on the first PRACH opportunity group to the second node.

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

[0355] In some embodiments, the first node transmits a number of random access preambles (also known as message 1, Msg1, etc.) to the second node on the PRACH resource 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 the PDCCH, which has been scrambled by the Random Access Radio Network Temporary Identifier (RA-RNTI), to the first node.

[0358] In some embodiments, PDCCH can be transmitted through resources in the Type1-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 (also known as RAR, message 2, Msg2, etc.) corresponding to a preamble transmitted by the first node.

[0360] Accordingly, the first node uses RA-RNTI to detect the PDCCH in Type1-PDCCH CSS on the initial BWP of the downlink, and after detecting the PDCCH, determines whether the PDCCH contains RAR transmitted to the first node by the second node based on the PDSCH scheduled by the PDCCH. RAR may contain information such as uplink acknowledgment for message 3 (Msg3), timing advance commands (TA commands), temporary cell RNTI (TC-RNTI), and similar information.

[0361] In some embodiments, the Type1-PDCCH CSS is comprised of a second node through system messages and / or high-level parameters.

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

[0363] In some embodiments, this operation supports HARQ retransmission. That is, when a second node fails to receive Msg3 correctly, the first node can schedule a retransmission of Msg3 using a PDCCH scrambled by TC-RNTI, which can carry DCI format 0_0.

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

[0365] In some embodiments, this operation supports HARQ retransmission. When the first node fails to receive Msg4 correctly, the second node can schedule a retransmission of Msg4 using a PDCCH scrambled by TC-RNTI, which can carry DCI format 1_0. When the first node successfully receives Msg4 and confirms that Msg4 is a message addressed to the first node, the random access process of the first node succeeds; otherwise, the random access process fails, and the first node must restart the random access process from the first operation.

[0366] Method embodiments of this disclosure are illustrated in detail above with reference to Figures 1 to 10. Device embodiments of this disclosure are illustrated in detail below with reference to Figures 11 to 14. The examples of method embodiments correspond to the examples of device embodiments, and it should be understood that parts not illustrated in detail can be referenced to the method embodiments described above.

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

[0368] A first receiver 1110 may be configured to receive first information, which is used to determine X PRACH opportunities. 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] A 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 the 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 the larger of the first and second candidate values ​​is prioritized for the mapping of X PRACH opportunities to Q PRACH opportunity groups, and / or the mapping of X PRACH opportunities to Q PRACH opportunity groups is related to the number of PRACH opportunity groups corresponding to each candidate value among 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 over a first PRACH opportunity group. The first PRACH opportunity group is one of Q PRACH opportunity groups, and the first sequence is used to generate each random access preamble from the plurality of random access preambles.

[0371] In some embodiments, X PRACH opportunities occur within a first cycle.

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

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

[0374] In some embodiments, each opportunity group subset among a plurality of PRACH opportunity group subsets includes Q1 PRACH opportunity groups from Q PRACH opportunity groups, each of the plurality of candidate values ​​corresponds to at least one PRACH opportunity group from each of the Q1 PRACH opportunity groups in each opportunity group subset among the plurality of PRACH opportunity group subsets, and any two opportunity group subsets among 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 PRACH opportunity groups in each opportunity group subset of a plurality of PRACH opportunity group subsets corresponding to each candidate value among a plurality of candidate values ​​corresponds to a single value, and the value corresponding to the plurality of candidate values ​​is a first proportion value.

[0376] In some embodiments, each opportunity group subset among multiple PRACH opportunity group subsets contains X1 PRACH opportunities, and in each opportunity group subset among multiple PRACH opportunity group subsets, the multiple candidate values ​​are used in descending order to map each of the X1 PRACH opportunities to each of the Q1 PRACH opportunity groups.

[0377] In some embodiments, the mapping of X PRACH opportunities to Q PRACH opportunity groups is related to one or more of the following: the number of frequency-division multiplexed 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.

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

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

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

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

[0382] In some embodiments, each of the Q PRACH opportunity groups includes each of the multiple 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 each of multiple PRACH opportunities, the Q PRACH opportunity groups correspond to multiple 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 memory 1320, as shown in Figure 13.

[0385] Figure 12 is a schematic diagram of the structure of another node for wireless communication provided in some embodiments of the present disclosure. Node 1200, as shown in Figure 12, is a second node as illustrated above, and 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. 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 a plurality of candidate values. The number of PRACH opportunities in each of the Q PRACH opportunity groups is the 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 the larger of the first and second candidate values ​​is prioritized for the mapping of X PRACH opportunities to the Q PRACH opportunity groups, and / or the mapping of 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.

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

[0389] In some embodiments, X PRACH opportunities occur within a first cycle.

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

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

[0392] In some embodiments, each opportunity group subset among a plurality of PRACH opportunity group subsets includes Q1 PRACH opportunity groups from Q PRACH opportunity groups, each of the plurality of candidate values ​​corresponds to at least one PRACH opportunity group from each of the Q1 PRACH opportunity groups in each opportunity group subset among the plurality of PRACH opportunity group subsets, and any two opportunity group subsets among 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 PRACH opportunity groups in each opportunity group subset of a plurality of PRACH opportunity group subsets corresponding to each candidate value among a plurality of candidate values ​​corresponds to a single value, and the value corresponding to the plurality of candidate values ​​is a first proportion value.

[0394] In some embodiments, each opportunity group subset among multiple PRACH opportunity group subsets contains X1 PRACH opportunities, and in each opportunity group subset among multiple PRACH opportunity group subsets, the multiple candidate values ​​are used in descending order to map each of the X1 PRACH opportunities to each of the Q1 PRACH opportunity groups.

[0395] In some embodiments, the mapping of X PRACH opportunities to Q PRACH opportunity groups is related to one or more of the following: the number of frequency-division multiplexed 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.

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

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

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

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

[0400] In some embodiments, each of the Q PRACH opportunity groups includes each of the multiple 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 each of multiple PRACH opportunities, the Q PRACH opportunity groups correspond to multiple 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 transceivers 1330. The node 1200 may further comprise a processor 1310 and memory 1320, as shown in Figure 13.

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

[0404] Device 1300 may include one or more processors 1310. These one or more processors 1310 may enable device 1300 to implement methods such as those described in the above-described method embodiments. The one or more processors 1310 may be one or more general-purpose processors or dedicated processors. For example, one or more processors may be one or more central processing units (CPUs). Alternatively, 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 gates 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. Each of the memories 1320 stores a program that can be executed by one or more processors 1310 to perform the method described in the above-described method embodiment. Each of the memories 1320 may be independent of one or more processors 1310, or may be integrated with one or more processors 1310.

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

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

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

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

[0410] In transmission from the second communication device 410 to the first communication device 450, the second communication device 410 provides the controller / processor 475 with upper-layer data packets from the core network or data source 477. 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. In transmission from the second communication device 410 to the first communication device 450, the controller / processor 475 provides the first communication device 450 with header compression, encryption, packet segmentation and reordering, multiplexing between logical channels and transmission channels, and wireless resource allocation 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 transmission processor 416 and the multi-antenna transmission processor 471 implement various signal processing functions for the L1 layer (i.e., the physical layer). The transmission processor 416 implements coding and interleaving, as well as mapping of signal clusters based on various modulation schemes (e.g., two-phase shift modulation, quadrature phase shift modulation, M-phase shift modulation, M-quadrature amplitude modulation), to facilitate forward missignal correction in the second communication device 410. The multi-antenna transmission processor 471 performs digital spatial precoding (including book-based and non-book-based precoding) on ​​the coded and modulated symbols and performs beamforming to generate one or more spatial streams. The transmission processor 416 then maps each spatial stream to subcarriers, multiplexes the subcarriers with reference signals (such as pilots) in the time domain and / or frequency domain, and then uses the inverse fast Fourier transform to generate physical channels for carrying the time-domain multicarrier symbol stream. Subsequently, the multi-antenna transmission processor 471 performs simulated precoding / beamforming operations on the time-domain multicarrier symbol stream.Each transmitter 418 converts the baseband multi-carrier symbol stream provided by the multi-antenna transmission processor 471 into an RF stream, which is then supplied to different antennas 420.

[0411] In transmission from the second communication device 410 to the first communication device 450, each receiver 454 in the first communication device 450 receives the signal through its corresponding antenna 452. Each receiver 454 reconstructs the information modulated on the RF carrier and converts the RF stream into a baseband multicarrier symbol stream, which is provided to the receiver processor 456. The receiver processor 456 and the multi-antenna receiver processor 458 implement various signal processing functions of the L1 layer. The multi-antenna receiver processor 458 performs a receive analog precoding / beamforming operation on the baseband multicarrier symbol stream from the receiver 454. The receiver processor 456 uses the Fast Fourier Transform to convert the baseband multicarrier symbol stream, which has undergone the receive analog precoding / beamforming operation, from the time domain to the frequency domain. In the frequency domain, the physical layer data signal and reference signal are demultiplexed by the receiving processor 456. The reference signal is used for channel estimation, and the data signal is detected by multiple antennas in the multi-antenna receiving processor 458 to recover any spatial stream destined for the first communication device 450. Symbols on each spatial stream are demodulated and reconstructed by the receiving processor 456 to generate a soft decision. The receiving processor 456 then decodes and deinterleaves the soft decision to reconstruct 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. The controller / processor 459 implements L2 layer functionality. The controller / processor 459 may be associated with memory 460 for storing program code and data. Memory 460 may be referred to as computer-readable media. In transmission from the second communication device 410 to the first communication device 450, the controller / processor 459 provides multiplexing, packet reconstruction, decoding, header decompression, and control signal processing between the transport channel and the logical channel to recover the 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.Furthermore, various control signals can be provided to L3 for processing at L3.

[0412] In transmission from the first communication device 450 to the second communication device 410, the first communication device 450 provides upper-layer data packets to the controller / processor 459 using data source 467. Data source 467 represents all protocol layers above the L2 layer. In transmission from the second communication device 410 to the first communication device 450, similar to the transmission functions described for the second communication device 410, the controller / processor 459 implements header compression, encryption, packet segmentation and reordering, and multi-channel multiplexing between logical channels 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. Transmission processor 468 performs modulation mapping and channel coding, and multi-antenna transmission processor 457 performs digital multi-antenna spatial precoding (including codebook-based and non-codebook-based precoding) and beamforming. Subsequently, the transmission processor 468 modulates the generated spatial stream into multi-carrier / single-carrier symbol streams, which, after simulated precoding / beamforming in the multi-antenna transmission processor 457, are then fed to different antennas 452 through the transmitters 454. Each transmitter 454 first converts the baseband symbol stream supplied by the multi-antenna transmission processor 457 into RF symbol streams, and then feeds them to the antennas 452.

[0413] In the transmission from the first communication device 450 to the second communication device 410, the functions of the second communication device 410 are similar to the receiving functions of 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 into a baseband signal, and provides the baseband signal to the multi-antenna receiving processor 472 and the receiving processor 470. The receiving processor 470 and the multi-antenna receiving processor 472 work together to implement the functions of the L1 layer. The controller / processor 475 implements the functions of the L2 layer. The controller / processor 475 may be associated with a memory 476 for storing program code 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 reconstruction, decoding, header decompression, and control signal processing between the transport channel and the logical channel to reconstruct the 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 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 contains computer program code. The at least one memory and the computer program code are configured to be used in conjunction with the at least one processor. The first communication device 450 receives at least first information used to determine X PRACH opportunities, wherein 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 receives 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. Multiple candidate values ​​include a first candidate value and a second candidate value, and the larger of the first and second candidate values ​​is prioritized for mapping X PRACH opportunities to Q PRACH opportunity groups, and / or the mapping of X PRACH opportunities to Q PRACH opportunity groups is related to the number of PRACH opportunity groups corresponding to each candidate value among the multiple candidate values.

[0415] In some embodiments, the first communication device 450 includes a memory for storing a computer-readable instruction program, which, when executed by at least one processor, causes at least one processor to perform an operation that includes receiving first information used to determine X PRACH opportunities, wherein 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 a plurality of candidate values. The plurality of candidate values ​​includes a first candidate value and a second candidate value, where the larger of the first and second candidate values ​​is prioritized for the mapping of X PRACH opportunities to Q PRACH opportunity groups, and / or the mapping of X PRACH opportunities to Q PRACH opportunity groups is related to the number of PRACH opportunity groups corresponding to each candidate value among the plurality of candidate values.

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

[0417] In some embodiments, the second communication device 410 corresponds to the second node in this 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 device, which may function as a relay node.

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

[0423] In some embodiments, the first communication device 450 is a user device that supports D2D, and the user device can function as a relay node.

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

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

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

[0427] Some embodiments of this disclosure further provide computer-readable storage media configured to store programs. These computer-readable storage media may be applicable to terminal or network devices provided in embodiments of this disclosure, and the programs cause a computer to perform operations in the manner performed by the terminal or network devices in embodiments of this disclosure.

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

[0429] Embodiments of this disclosure further provide computer programs. These computer programs may be applicable to terminal devices or network devices provided in embodiments of this disclosure, and the computer programs cause a computer to perform operations in the manner performed by the terminal devices or network devices in embodiments of this disclosure.

[0430] It will be understood that the terms “system” and “network” may be used interchangeably in this disclosure. In addition, the terms used in this disclosure are used solely to describe embodiments of this disclosure and are not intended to limit this disclosure. The terms “first,” “second,” “third,” “fourth,” and similar terms in the description, claims, and drawings of this disclosure are used to distinguish different subjects rather than to describe a particular order. In addition, the phrases “equip” and “have,” and any variations thereof, are intended to be non-exclusive.

[0431] In embodiments of this disclosure, the phrase “show” as used herein may mean direct reference, indirect reference, or related relationship. For example, A showing B may mean that A directly shows B, for example, that B can be obtained by means of A; or A indirectly shows B, for example, that A shows C, that B can be obtained by means of C; or there may be a related relationship between A and B.

[0432] In embodiments of this disclosure, “B corresponding to A” means that B is related to A and that B can be determined based on A. However, it should be understood that determining B based on A does not mean determining B based solely on A, but rather that B can instead be determined based on A and / or other information.

[0433] In embodiments of this disclosure, the phrase “corresponding” may mean that there is a direct or indirect correspondence between two things, or that there is a relation between two things, or that there is a relationship such as indicating and being indicated, or constituting and being constituted.

[0434] In embodiments of this disclosure, “predefined” or “preconfigured” may be implemented by pre-storing corresponding codes, tables, or other forms that can be used to indicate relevant information within a device (e.g., including terminal devices and network devices), and the specific implementations thereof are not limited in this disclosure. For example, being predefined may mean being defined in a protocol.

[0435] In embodiments of this disclosure, “protocol” may refer to a standard protocol in the field of communications, and may include, but is not limited to, the LTE protocol, the NR protocol, and related protocols applicable to future communications systems.

[0436] In embodiments of this disclosure, the phrase "and / or" is used solely to describe a relationship between the subjects being associated, indicating that there may be three possible relationships. For example, A and / or B may indicate that only A exists, both A and B exist, and only B exists. In addition, the letter " / " generally indicates an "or" relationship between the subjects being associated.

[0437] In embodiments of this disclosure, the number of process sequences described above does not imply an execution sequence. The execution sequence of a process should be determined according to the function and internal logic of the process and should not be construed as any limitation on the implementation process of embodiments of this disclosure.

[0438] In embodiments provided in this disclosure, it will be understood that the disclosed systems, devices, and methods may be implemented in other ways. 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 be possible in actual implementations. For example, multiple units or components may be combined or integrated within another system, or some features may be ignored or not implemented. In addition, the mutual coupling, direct coupling, or communication connection shown or described may be implemented by using some interfaces. Indirect coupling or communication connection 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 place, or may be distributed across multiple network units. Some or all of the units may be selected according to what is actually required to achieve the objectives of the solution of the embodiment.

[0440] In addition, the functional units in the embodiments of the present disclosure may be integrated within a single processing unit, or each of the units may exist physically independently, or two or more units may be integrated within a single unit.

[0441] All or part of the embodiments described above may be implemented using software, hardware, firmware, or any combination thereof. When software is used to implement an embodiment, the embodiments described above 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 onto a computer and executed, the procedures or functions according to the embodiments of this disclosure are generated entirely or partially. The computer may be a general-purpose computer, a dedicated computer, a computer network, or other programmable device. The computer instructions may be recorded on a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by a wired method (such as coaxial cable, optical fiber, and digital subscriber line (DSL)) or a wireless method (such as infrared, wireless, and microwave). The computer-readable storage medium may be any available medium readable by a data storage device, such as a computer, or a server or data center formed by integrating one or more available media. The usable media may be magnetic media (e.g., floppy disks, hard disks, or magnetic tapes), optical media (e.g., digital video discs (DVDs)), semiconductor media (e.g., solid-state drives (SSDs)), or similar media.

[0442] The foregoing description is merely a specific implementation of the Disclosure, but the scope of protection of the Disclosure is not limited thereto. Any modifications or alternatives that a person skilled in the art could easily conceive of within the scope of the technology disclosed herein are within the scope of protection of the Disclosure. Accordingly, the scope of protection of the Disclosure shall be subject to the scope of protection of the claims. [Explanation of Symbols]

[0443] 1 Message 2 messages 3 messages 4 messages 100 Wireless Communication Systems 110 Network Devices 120 User Equipment 410 Second communication device 416 transmission processors 418 Transmitter / Receiver 420 Antenna 450 First communication device 452 Antenna 454 Transmitter / Receiver 456 Receiver Processors 457 Multi-Antenna Transmission Processor 458 Multi-Antenna Receiving Processor 459 Controllers / Processors 460 memory 467 data sources 468 transmission processors 470 Receiver Processors 471 Multi-Antenna Transmission Processor 472 Multi-Antenna Receiving Processor 475 Controllers / Processors 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 The fourth transmitter 1300 devices 1310 Processor 1320 memory 1330 Transceiver

Claims

1. A first node for wireless communication, A first receiver configured to receive first information, the first information is used to determine X physical random access channel (PRACH) opportunities, 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 the first receiver, A second receiver configured to receive second information, the second information being used to determine a plurality of candidate values, the number of PRACH opportunities included in each of the Q PRACH opportunity groups being the corresponding candidate values ​​of the plurality of candidate values, the second receiver comprising The plurality of candidate values ​​include a first candidate value and a second candidate value, and the larger 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 a first node associated with the number of PRACH opportunity groups corresponding to each candidate value among the plurality of candidate values.

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

3. The X PRACH opportunities are the first node according to claim 1 or claim 2, which is in the first cycle.

4. In each of the Q PRACH opportunity groups, the PRACH opportunities are orthogonal to each other in the time domain, or In each of the Q PRACH opportunity groups, the PRACH opportunity is associated with the same synchronization signal block, or The first node according to any one of claims 1 to 3, wherein the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to each other in the time domain and related to the same synchronization signal block.

5. The plurality of candidate values ​​are used in descending order for the mapping of the X PRACH opportunities to the Q PRACH opportunity groups, according to the first node according to any one of claims 1 to 4.

6. The first node according to any one of claims 1 to 5, wherein each of the plurality of PRACH opportunity group subsets includes Q1 PRACH opportunity groups from the Q PRACH opportunity groups, each of the plurality of candidate values ​​corresponds to at least one PRACH opportunity group from the Q1 PRACH opportunity groups contained 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. The first node according to claim 6, wherein the number of each of the at least one PRACH opportunity groups included in each of the plurality of PRACH opportunity group subsets corresponding to each of the plurality of candidate values ​​corresponds to a single value, and the plurality of values ​​corresponding to the plurality of candidate values ​​are values ​​in a first proportion.

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

9. The mapping of the X PRACH opportunities to the Q PRACH opportunity groups is: Number of frequency-division multiplexing 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 aforementioned X PRACH opportunities, A first node according to any one of claims 1 to 8, relating to one or more of the above.

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

11. The number of random access preambles corresponding to at least one candidate value among the plurality of candidate values ​​is the first node according to any one of claims 1 to 10 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, and the first mapping order is Incremental order of the index in the random access preamble, The incremental order of frequency resources, and Incremental order of time resources A first node according to any one of claims 1 to 11, comprising one or more of the above.

13. The first piece of information mentioned above is, The number of synchronization signal blocks corresponding to each of the X PRACH opportunities, and The number of random access preambles corresponding to the synchronization signal block corresponding to each of the X PRACH opportunities A first node according to any one of claims 1 to 12, used to determine at least one of the following.

14. The first node according to any one of claims 1 to 13, wherein each of the Q PRACH opportunity groups includes each of the multiple 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.

15. Each of the Q PRACH opportunity groups comprises each of multiple PRACH opportunities, each of the Q PRACH opportunity groups corresponds 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, the first node according to any one of claims 1 to 13.

16. A second node for wireless communication, A second transmitter configured to transmit first information, wherein the first information is used to determine X PRACH opportunities, 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 the second transmitter A third transmitter configured to transmit second information, the second information being used to determine a plurality of candidate values, the number of PRACH opportunities included in each of the Q PRACH opportunity groups being the corresponding candidate values ​​of the plurality of candidate values, the third transmitter comprising The plurality of candidate values ​​include a first candidate value and a second candidate value, and the larger 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 a second node associated with the number of PRACH opportunity groups corresponding to each candidate value among the multiple candidate values.

17. The system further comprises a fourth receiver configured to receive multiple random access preambles transmitted over a first PRACH opportunity group, The first PRACH opportunity group is one of the Q PRACH opportunity groups, and the first sequence is used to generate each of the plurality of random access preambles for the second node according to claim 16.

18. The X PRACH opportunities are located within the first cycle of the second node according to claim 16 or claim 17.

19. In each of the Q PRACH opportunity groups, the PRACH opportunities are orthogonal to each other in the time domain, or In each of the Q PRACH opportunity groups, the PRACH opportunity is associated with the same synchronization signal block, or The second node according to any one of claims 16 to 18, wherein the PRACH opportunities in each of the Q PRACH opportunity groups are orthogonal to each other in the time domain and related to the same synchronization signal block.

20. The plurality of candidate values ​​are used in descending order for the mapping of the X PRACH opportunities to the Q PRACH opportunity groups, as described in any one of claims 16 to 19, for the second node.

21. A second node according to any one of claims 16 to 20, wherein each of the plurality of PRACH opportunity group subsets includes Q1 PRACH opportunity groups from the Q PRACH opportunity groups, each of the plurality of candidate values ​​corresponds to at least one PRACH opportunity group from the Q1 PRACH opportunity groups contained 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. The second node according to claim 21, wherein the number of each of the at least one PRACH opportunity groups included in each of the plurality of PRACH opportunity group subsets corresponding to each of the plurality of candidate values ​​corresponds to a single value, and the plurality of values ​​corresponding to the plurality of candidate values ​​are values ​​in a first proportion.

23. Each of the plurality of PRACH opportunity group subsets includes each of the X1 PRACH opportunities, and in each of the plurality of PRACH opportunity group subsets, the plurality of candidate values ​​are used in descending order for mapping each of the X1 PRACH opportunities to each of the Q1 PRACH opportunity groups to the second node according to claim 20 or claim 21.

24. The mapping of the X PRACH opportunities to the Q PRACH opportunity groups is: Number of frequency-division multiplexing 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 aforementioned X PRACH opportunities, A second node according to any one of claims 16 to 23, relating to one or more of the above.

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

26. 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 for the second node according to any one of claims 16 to 25.

27. At least one PRACH opportunity group corresponding to each of the plurality of candidate values ​​is mapped in a first mapping order, and the first mapping order is Incremental order of the index in the random access preamble, The incremental order of frequency resources, and Incremental order of time resources A second node according to any one of claims 16 to 26, comprising one or more of the above.

28. The first piece of information mentioned above is, The number of synchronization signal blocks corresponding to each of the X PRACH opportunities, and The number of random access preambles corresponding to the synchronization signal block corresponding to each of the X PRACH opportunities A second node according to any one of claims 16 to 27, used to determine at least one of the following.

29. The second node according to any one of claims 16 to 28, wherein each of the Q PRACH opportunity groups includes each of the multiple 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.

30. Each of the Q PRACH opportunity groups comprises each of the multiple PRACH opportunities, the Q PRACH opportunity groups correspond to multiple random access preambles, and the random access preambles corresponding to at least two of the Q PRACH opportunity groups are different from each other, a second node according to any one of claims 16 to 28.

31. A method for wireless communication applicable to a first node, A step of receiving first information, wherein the first information is used to determine X PRACH opportunities, 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 The step of receiving second information, 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 the corresponding candidate value of the plurality of candidate values, The plurality of candidate values ​​include a first candidate value and a second candidate value, and the larger 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 a method relating the number of PRACH opportunity groups corresponding to each candidate value among the plurality of candidate values.

32. The process further includes the step of transmitting multiple random access preambles on a first PRACH opportunity group, The method according to claim 31, wherein the first PRACH opportunity group is one of the Q PRACH opportunity groups, and the first sequence is used to generate each of the plurality of random access preambles.

33. The method according to claim 31 or claim 32, wherein the X PRACH opportunities are within the first cycle.

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

35. The method according to 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. The method according to any one of claims 31 to 35, wherein each of the plurality of PRACH opportunity group subsets includes Q1 PRACH opportunity groups from the Q PRACH opportunity groups, each of the plurality of candidate values ​​corresponds to at least one PRACH opportunity group from the Q1 PRACH opportunity groups contained 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. The method according to claim 36, wherein the number of each of the at least one PRACH opportunity groups included in each of the plurality of PRACH opportunity group subsets corresponding to each of the plurality of candidate values ​​corresponds to a single value, and the plurality of values ​​corresponding to the plurality of candidate values ​​are values ​​in a first proportion.

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

39. The mapping of the X PRACH opportunities to the Q PRACH opportunity groups is: Number of frequency-division multiplexing 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 aforementioned X PRACH opportunities, The method according to any one of claims 31 to 38, relating to one or more of the above.

40. The method according to any one of claims 31 to 39, further comprising the step of receiving a third information, the third information being used to determine the number of PRACH opportunity groups corresponding to at least one of the plurality of candidate values.

41. The method according to any one of claims 31 to 40, 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, and the first mapping order is Incremental order of the index in the random access preamble, The incremental order of frequency resources, and Incremental order of time resources The method according to any one of claims 31 to 41, comprising one or more of the above.

43. The first piece of information mentioned above is, The number of synchronization signal blocks corresponding to each of the X PRACH opportunities, and The number of random access preambles corresponding to the synchronization signal block corresponding to each of the X PRACH opportunities The method according to any one of claims 31 to 42, used to determine at least one of the following.

44. The method according to any one of claims 31 to 43, wherein each of the Q PRACH opportunity groups comprises a plurality of PRACH opportunities, and at least two of the Q PRACH opportunity groups each comprise at least one PRACH opportunity distinct from one another.

45. The method according to any one of claims 31 to 43, wherein each of the Q PRACH opportunity groups comprises each of multiple PRACH opportunities, the Q PRACH opportunity groups correspond to multiple 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. A method for wireless communication applicable to a second node, A step of transmitting first information, wherein the first information is used to determine X PRACH opportunities, 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 step of transmitting second information, the second information being used to determine a plurality of candidate values, the number of PRACH opportunities included in each of the Q PRACH opportunity groups being the corresponding candidate values ​​of the plurality of candidate values, The plurality of candidate values ​​include a first candidate value and a second candidate value, and the larger 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 a method relating the number of PRACH opportunity groups corresponding to each candidate value among the plurality of candidate values.

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

48. The method according to claim 46 or claim 47, wherein the X PRACH opportunities are within the first cycle.

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

50. The method according to 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. The method according to any one of claims 46 to 50, wherein each of the plurality of PRACH opportunity group subsets includes Q1 PRACH opportunity groups from the Q PRACH opportunity groups, each of the plurality of candidate values ​​corresponds to at least one PRACH opportunity group from the Q1 PRACH opportunity groups contained 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. The method according to claim 51, wherein the number of each of the at least one PRACH opportunity groups included in each of the plurality of PRACH opportunity group subsets corresponding to each of the plurality of candidate values ​​corresponds to a single value, and the plurality of values ​​corresponding to the plurality of candidate values ​​are values ​​in a first proportion.

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

54. The mapping of the X PRACH opportunities to the Q PRACH opportunity groups is: Number of frequency-division multiplexing 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 aforementioned X PRACH opportunities, The method according to any one of claims 46 to 53, relating to one or more of the above.

55. The method according to any one of claims 46 to 54, further comprising the step of transmitting a third information, the third information being used to determine the number of PRACH opportunity groups corresponding to at least one of the plurality of candidate values.

56. The method according to any one of claims 46 to 55, 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.

57. At least one PRACH opportunity group corresponding to each of the plurality of candidate values ​​is mapped in a first mapping order, and the first mapping order is Incremental order of the index in the random access preamble, The incremental order of frequency resources, and Incremental order of time resources The method according to any one of claims 46 to 56, comprising one or more of the above.

58. The first piece of information mentioned above is, The number of synchronization signal blocks corresponding to each of the X PRACH opportunities, and The number of random access preambles corresponding to the synchronization signal block corresponding to each of the X PRACH opportunities The method according to any one of claims 46 to 57, used to determine at least one of the following.

59. The method according to any one of claims 46 to 58, wherein each of the Q PRACH opportunity groups comprises a plurality of PRACH opportunities, and at least two of the Q PRACH opportunity groups each comprise at least one PRACH opportunity distinct from one another.

60. The method according to any one of claims 46 to 58, wherein each of the Q PRACH opportunity groups comprises each of multiple PRACH opportunities, the Q PRACH opportunity groups correspond to multiple 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, Equipped with transceivers, memory, and a processor, The memory is configured to store a program, and the processor is configured to call the program in the memory, control the transceiver to receive or transmit a signal, thereby causing the node to perform the operation according to any one of claims 31 to 45 or 46 to 60.

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

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

64. A computer-readable storage medium configured to store a program, wherein the program is configured to cause a computer to perform an operation according to any one of claims 31 to 45 or 46 to 60.

65. A computer program product comprising a program that causes a computer to perform an operation according to any one of claims 31 to 45 or 46 to 60.

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

Images