Methods for nodes used for wireless communications, and apparatus

Abstract

Provided are methods for nodes used for wireless communications, and an apparatus. A first node used for wireless communications comprises: a first receiver, which receives first information, wherein the first information is used for determining X ROs, and the X ROs are mapped to Q ROGs, X being a positive integer greater than 1, and Q being a positive integer; and a second receiver, which receives second information, wherein the second information is used for determining a plurality of candidate numerical values, the number of ROs comprised in any one of the Q ROGs is one of the plurality of candidate numerical values, the plurality of candidate numerical values include a first candidate numerical value and a second candidate numerical value, the larger value among the first candidate numerical value and the second candidate numerical value is preferentially used for the mapping from the X ROs to the Q ROGs, and / or the mapping from the X ROs to the Q ROGs is related to the numbers of ROGs respectively corresponding to the plurality of candidate numerical values.

Description

Method and apparatus in a node for wireless communication Technical Field

[0001] The present application relates to the field of communication technology, and more particularly, to a method and apparatus in a node used for wireless communication. Background Art

[0002] In order to enhance the coverage performance of the physical random access channel (PRACH), some communication systems (such as the new radio (NR) system) introduce a multiple PRACH transmission scheme. In the multiple PRACH transmission scheme, the physical random access channel occasion (PRACH occasion, RO) can be mapped to the physical random access channel occasion group (PRACH occasion group, ROG) so that multiple PRACHs can be sent on the ROG. Then, how to map the RO to the ROG is a problem that needs to be solved. The RO to ROG mapping scheme may affect the resource allocation of the multiple PRACH transmission, or may result in the generation of more isolated ROs, resulting in resource waste.

[0003] Summary of the Invention

[0004] The embodiments of the present application provide a method and apparatus for use in a node for wireless communication. The following describes various aspects of the present application.

[0005] In a first aspect, a first node for wireless communication is provided, comprising: a first receiver configured to receive first information, the first information being used to determine X physical random access channel opportunities, the X physical random access channel opportunities being mapped to Q physical random access channel opportunity groups, where X is a positive integer greater than 1, and Q is a positive integer; and a second receiver configured to receive second information, the second information being used to determine multiple candidate values; the number of physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups being one of the multiple candidate values; the multiple candidate values ​​comprising a first candidate value and a second candidate value, a larger value of the first candidate value and the second candidate value being preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups; and / or the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to the multiple candidate values.

[0006] As an implementation method, the first node also includes: a first transmitter, sending multiple random access preambles on a first physical random access channel opportunity group; wherein the first physical random access channel opportunity group is one of the Q physical random access channel opportunity groups, and a first sequence is used to generate each random access preamble in the multiple random access preambles.

[0007] As an implementation manner, the X physical random access channel opportunities are all located in the first period.

[0008] As an implementation method, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are orthogonal in the time domain; or, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are associated with the same synchronization signal block; or, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are orthogonal in the time domain and are associated with the same synchronization signal block.

[0009] As an implementation manner, the multiple candidate values ​​are used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups in descending order.

[0010] As an implementation method, each timing group subset in the multiple timing group subsets includes Q1 physical random access channel timing groups in the Q physical random access channel timing groups; any candidate value in the multiple candidate values ​​corresponds to at least one physical random access channel timing group in the Q1 physical random access channel timing groups included in each timing group subset in the multiple timing group subsets; the number of physical random access channel timing groups in any two timing group subsets in the multiple timing group subsets corresponding to any candidate value in the multiple candidate values ​​is equal.

[0011] As an implementation manner, the number of physical random access channel opportunity groups in each opportunity group subset of the multiple opportunity group subsets to which the multiple candidate values ​​respectively correspond is in a first ratio.

[0012] As an implementation manner, any one of the multiple opportunity group subsets includes X1 physical random access opportunities among the X physical random access channel opportunities; in each opportunity group subset of the multiple opportunity group subsets, the multiple candidate values ​​are used for mapping the X1 physical random access channel opportunities to the Q1 physical random access channel opportunity groups in descending order.

[0013] As an implementation manner, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to one or more of the following information: the number of frequency-division multiplexed physical random access channel opportunities in a time period; the number of synchronization signal blocks corresponding to any one of the X physical random access channel opportunities; and the number of random access preambles corresponding to any one of the multiple synchronization signal blocks corresponding to the X physical random access channel opportunities.

[0014] As an implementation manner, the first node further includes: a third receiver, receiving third information, where the third information is used to determine the number of physical random access channel opportunity groups corresponding to at least one candidate value among the multiple candidate values.

[0015] As an implementation manner, the number of random access preambles corresponding to at least one candidate value among the multiple candidate values ​​is used to determine the Q physical random access channel opportunity groups.

[0016] As an implementation method, at least one physical random access channel opportunity group corresponding to any candidate value among the multiple candidate values ​​is mapped according to a first mapping order, and the first mapping order includes one or more of the following: an ascending order of random access preamble index; an ascending order of frequency domain resources; an ascending order of time domain resources.

[0017] As an implementation manner, the first information is used to determine the X physical random access channel opportunities, including at least one of the following: the first information is used to determine the number of synchronization signal blocks corresponding to each physical random access channel opportunity in the X physical random access channel opportunities; the first information is used to determine the number of random access preambles corresponding to the synchronization signal block corresponding to each physical random access channel opportunity.

[0018] As an implementation method, any physical random access channel opportunity group among the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, and at least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two physical random access channel opportunity groups among the Q physical random access channel opportunity groups is different.

[0019] As an implementation method, any physical random access channel opportunity group among the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, the Q physical random access channel opportunity groups respectively correspond to multiple random access preambles, and the random access preambles corresponding to at least two physical random access channel opportunity groups in the Q physical random access channel opportunity groups are different.

[0020] In a second aspect, a second node used for wireless communication is provided, comprising: a second transmitter, transmitting first information, the first information being used to determine X physical random access channel opportunities, the X physical random access channel opportunities being mapped to Q physical random access channel opportunity groups, where X is a positive integer greater than 1, and Q is a positive integer; and a third transmitter, transmitting second information, the second information being used to determine multiple candidate values; the number of physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups being one of the multiple candidate values; the multiple candidate values ​​comprising a first candidate value and a second candidate value, the larger of the first candidate value and the second candidate value being preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups; and / or the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to the multiple candidate values.

[0021] As an implementation method, the second node also includes: a fourth receiver, receiving multiple random access preambles, wherein the multiple random access preambles are sent on a first physical random access channel opportunity group; wherein the first physical random access channel opportunity group is one of the Q physical random access channel opportunity groups, and the first sequence is used to generate each random access preamble in the multiple random access preambles.

[0022] As an implementation manner, the X physical random access channel opportunities are all located in the first period.

[0023] As an implementation method, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are orthogonal in the time domain; or, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are associated with the same synchronization signal block; or, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are orthogonal in the time domain and associated with the same synchronization signal block.

[0024] As an implementation manner, the multiple candidate values ​​are used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups in descending order.

[0025] As an implementation method, each timing group subset in the multiple timing group subsets includes Q1 physical random access channel timing groups in the Q physical random access channel timing groups; any candidate value in the multiple candidate values ​​corresponds to at least one physical random access channel timing group in the Q1 physical random access channel timing groups included in each timing group subset in the multiple timing group subsets; the number of physical random access channel timing groups in any two timing group subsets in the multiple timing group subsets corresponding to any candidate value in the multiple candidate values ​​is equal.

[0026] As an implementation manner, the number of physical random access channel opportunity groups in each opportunity group subset of the multiple opportunity group subsets to which the multiple candidate values ​​respectively correspond is in a first ratio.

[0027] As an implementation manner, any one of the multiple opportunity group subsets includes X1 physical random access channel opportunities among the X physical random access channel opportunities; in each opportunity group subset of the multiple opportunity group subsets, the multiple candidate values ​​are used for mapping the X1 physical random access channel opportunities to the Q1 physical random access channel opportunity groups in descending order.

[0028] As an implementation manner, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to one or more of the following information: the number of frequency-division multiplexed physical random access channel opportunities in a time period; the number of synchronization signal blocks corresponding to any one of the X physical random access channel opportunities; and the number of random access preambles corresponding to any one of the multiple synchronization signal blocks corresponding to the X physical random access channel opportunities.

[0029] As an implementation manner, the second node further includes: a fourth transmitter, sending third information, where the third information is used to determine the number of physical random access channel opportunity groups corresponding to at least one candidate value among the multiple candidate values.

[0030] As an implementation manner, the number of random access preambles corresponding to at least one candidate value among the multiple candidate values ​​is used to determine the Q physical random access channel opportunity groups.

[0031] As an implementation method, at least one physical random access channel opportunity group corresponding to any candidate value among the multiple candidate values ​​is mapped according to a first mapping order, and the first mapping order includes one or more of the following: an ascending order of random access preamble index; an ascending order of frequency domain resources; an ascending order of time domain resources.

[0032] As an implementation manner, the first information is used to determine the X physical random access channel opportunities, including at least one of the following: the first information is used to determine the number of synchronization signal blocks corresponding to each physical random access channel opportunity in the X physical random access channel opportunities; the first information is used to determine the number of random access preambles corresponding to the synchronization signal block corresponding to each physical random access channel opportunity.

[0033] As an implementation method, any physical random access channel opportunity group among the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, and at least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two physical random access channel opportunity groups among the Q physical random access channel opportunity groups is different.

[0034] As an implementation method, any physical random access channel opportunity group among the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, the Q physical random access channel opportunity groups respectively correspond to multiple random access preambles, and the random access preambles corresponding to at least two physical random access channel opportunity groups in the Q physical random access channel opportunity groups are different.

[0035] According to a third aspect, a method is provided for use in a first node of wireless communication, comprising: receiving first information, the first information being used to determine X physical random access channel opportunities, the X physical random access channel opportunities being mapped to Q physical random access channel opportunity groups, where X is a positive integer greater than 1 and Q is a positive integer; and receiving second information, the second information being used to determine multiple candidate values; the number of physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups being one of the multiple candidate values; wherein the multiple candidate values ​​include a first candidate value and a second candidate value, a larger value of the first candidate value and the second candidate value being preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups; and / or, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to the multiple candidate values.

[0036] As an implementation method, the method also includes: sending multiple random access preambles on a first physical random access channel opportunity group; wherein the first physical random access channel opportunity group is one of the Q physical random access channel opportunity groups, and a first sequence is used to generate each random access preamble in the multiple random access preambles.

[0037] As an implementation manner, the X physical random access channel opportunities are all located in the first period.

[0038] As an implementation method, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are orthogonal in the time domain; or, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are associated with the same synchronization signal block; or, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are orthogonal in the time domain and are associated with the same synchronization signal block.

[0039] As an implementation manner, the multiple candidate values ​​are used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups in descending order.

[0040] As an implementation method, each timing group subset in the multiple timing group subsets includes Q1 physical random access channel timing groups in the Q physical random access channel timing groups; any candidate value in the multiple candidate values ​​corresponds to at least one physical random access channel timing group in the Q1 physical random access channel timing groups included in each timing group subset in the multiple timing group subsets; the number of physical random access channel timing groups in any two timing group subsets in the multiple timing group subsets corresponding to any candidate value in the multiple candidate values ​​is equal.

[0041] As an implementation manner, the number of physical random access channel opportunity groups in each opportunity group subset of the multiple opportunity group subsets to which the multiple candidate values ​​respectively correspond is in a first ratio.

[0042] As an implementation manner, any one of the multiple opportunity group subsets includes X1 physical random access opportunities among the X physical random access channel opportunities; in each opportunity group subset of the multiple opportunity group subsets, the multiple candidate values ​​are used for mapping the X1 physical random access channel opportunities to the Q1 physical random access channel opportunity groups in descending order.

[0043] As an implementation manner, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to one or more of the following information: the number of frequency-division multiplexed physical random access channel opportunities in a time period; the number of synchronization signal blocks corresponding to any one of the X physical random access channel opportunities; and the number of random access preambles corresponding to any one of the multiple synchronization signal blocks corresponding to the X physical random access channel opportunities.

[0044] As an implementation manner, the method further includes: receiving third information, where the third information is used to determine the number of physical random access channel opportunity groups corresponding to at least one candidate value among the multiple candidate values.

[0045] As an implementation manner, the number of random access preambles corresponding to at least one candidate value among the multiple candidate values ​​is used to determine the Q physical random access channel opportunity groups.

[0046] As an implementation method, at least one physical random access channel opportunity group corresponding to any candidate value among the multiple candidate values ​​is mapped according to a first mapping order, and the first mapping order includes one or more of the following: an ascending order of random access preamble index; an ascending order of frequency domain resources; an ascending order of time domain resources.

[0047] As an implementation manner, the first information is used to determine the X physical random access channel opportunities, including at least one of the following: the first information is used to determine the number of synchronization signal blocks corresponding to each physical random access channel opportunity in the X physical random access channel opportunities; the first information is used to determine the number of random access preambles corresponding to the synchronization signal block corresponding to each physical random access channel opportunity.

[0048] As an implementation method, any physical random access channel opportunity group among the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, and at least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two physical random access channel opportunity groups among the Q physical random access channel opportunity groups is different.

[0049] As an implementation method, any physical random access channel opportunity group among the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, the Q physical random access channel opportunity groups respectively correspond to multiple random access preambles, and the random access preambles corresponding to at least two physical random access channel opportunity groups in the Q physical random access channel opportunity groups are different.

[0050] In a fourth aspect, a method is provided for a second node used in wireless communication, comprising: sending first information, the first information being used to determine X physical random access channel opportunities, the X physical random access channel opportunities being mapped to Q physical random access channel opportunity groups, where X is a positive integer greater than 1, and Q is a positive integer; sending second information, the second information being used to determine multiple candidate values; the number of physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups being one of the multiple candidate values; wherein the multiple candidate values ​​include a first candidate value and a second candidate value, the larger of the first candidate value and the second candidate value being preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups; and / or, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to the multiple candidate values.

[0051] As an implementation, the method further includes: receiving multiple random access preambles, wherein the multiple random access preambles are sent on a first physical random access channel opportunity group; wherein the first physical random access channel opportunity group is one of the Q physical random access channel opportunity groups, and a first sequence is used to generate each random access preamble in the multiple random access preambles.

[0052] As an implementation manner, the X physical random access channel opportunities are all located in the first period.

[0053] As an implementation method, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are orthogonal in the time domain; or, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are associated with the same synchronization signal block; or, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are orthogonal in the time domain and associated with the same synchronization signal block.

[0054] As an implementation manner, the multiple candidate values ​​are used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups in descending order.

[0055] As an implementation method, each timing group subset in the multiple timing group subsets includes Q1 physical random access channel timing groups in the Q physical random access channel timing groups; any candidate value in the multiple candidate values ​​corresponds to at least one physical random access channel timing group in the Q1 physical random access channel timing groups included in each timing group subset in the multiple timing group subsets; the number of physical random access channel timing groups in any two timing group subsets in the multiple timing group subsets corresponding to any candidate value in the multiple candidate values ​​is equal.

[0056] As an implementation manner, the number of physical random access channel opportunity groups in each opportunity group subset of the multiple opportunity group subsets to which the multiple candidate values ​​respectively correspond is in a first ratio.

[0057] As an implementation manner, any one of the multiple opportunity group subsets includes X1 physical random access channel opportunities among the X physical random access channel opportunities; in each opportunity group subset of the multiple opportunity group subsets, the multiple candidate values ​​are used for mapping the X1 physical random access channel opportunities to the Q1 physical random access channel opportunity groups in descending order.

[0058] As an implementation manner, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to one or more of the following information: the number of frequency-division multiplexed physical random access channel opportunities in a time period; the number of synchronization signal blocks corresponding to any one of the X physical random access channel opportunities; and the number of random access preambles corresponding to any one of the multiple synchronization signal blocks corresponding to the X physical random access channel opportunities.

[0059] As an implementation manner, the method further includes: sending third information, where the third information is used to determine the number of physical random access channel opportunity groups corresponding to at least one candidate value among the multiple candidate values.

[0060] As an implementation manner, the number of random access preambles corresponding to at least one candidate value among the multiple candidate values ​​is used to determine the Q physical random access channel opportunity groups.

[0061] As an implementation method, at least one physical random access channel opportunity group corresponding to any candidate value among the multiple candidate values ​​is mapped according to a first mapping order, and the first mapping order includes one or more of the following: an ascending order of random access preamble index; an ascending order of frequency domain resources; an ascending order of time domain resources.

[0062] As an implementation manner, the first information is used to determine the X physical random access channel opportunities, including at least one of the following: the first information is used to determine the number of synchronization signal blocks corresponding to each physical random access channel opportunity in the X physical random access channel opportunities; the first information is used to determine the number of random access preambles corresponding to the synchronization signal block corresponding to each physical random access channel opportunity.

[0063] As an implementation method, any physical random access channel opportunity group among the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, and at least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two physical random access channel opportunity groups among the Q physical random access channel opportunity groups is different.

[0064] As an implementation method, any physical random access channel opportunity group among the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, the Q physical random access channel opportunity groups respectively correspond to multiple random access preambles, and the random access preambles corresponding to at least two physical random access channel opportunity groups in the Q physical random access channel opportunity groups are different.

[0065] In a fifth aspect, a first node used for wireless communication is provided, comprising a transceiver, a memory, and a processor, wherein the memory is used to store programs, and the processor is used to call the programs in the memory and control the transceiver to receive or send signals so that the first node executes the method described in any implementation method of the third aspect.

[0066] In the sixth aspect, a second node used for wireless communication is provided, comprising a transceiver, a memory and a processor, wherein the memory is used to store programs, the processor is used to call the programs in the memory and control the transceiver to receive or send signals so that the second node executes the method described in any implementation method of the fourth aspect.

[0067] In a seventh aspect, an embodiment of the present application provides a communication system, the system including the first node and / or the second node described above. In another possible design, the system may also include other devices that interact with the first node or the second node in the solution provided in the embodiment of the present application.

[0068] In an eighth aspect, an embodiment of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and the computer program enables a computer to execute part or all of the steps in the methods of the above aspects.

[0069] In a ninth aspect, embodiments of the present application provide a computer program product, wherein the computer program product includes a non-transitory computer-readable storage medium storing a computer program, wherein the computer program is operable to cause a computer to perform some or all of the steps of the methods described in each of the above aspects. In some implementations, the computer program product may be a software installation package.

[0070] In a tenth aspect, an embodiment of the present application provides a computer program, which can be operated to enable a computer to execute part or all of the steps in the methods of the above aspects.

[0071] In the eleventh aspect, an embodiment of the present application provides a chip, which includes a memory and a processor. The processor can call and run a computer program from the memory to implement some or all of the steps described in the methods of the above aspects.

[0072] In the embodiment of the present application, the larger value among the multiple candidate values ​​is preferentially used for mapping physical random access channel opportunities to physical random access channel opportunity groups, and / or the number of physical random access channel opportunity groups corresponding to the multiple candidate values ​​is used for mapping physical random access channel opportunities to physical random access channel opportunity groups. Consideration of the above factors is conducive to optimizing the mapping scheme of physical random access channel opportunities to physical random access channel opportunity groups, and is conducive to reducing or avoiding the generation of isolated physical random access channel opportunities.

[0073] The technical solution of the embodiment of the present application is conducive to reducing resource waste.

[0074] The technical solutions of the embodiments of the present application are conducive to optimizing resource allocation for complex PRACH transmission.

[0075] The technical solutions of the embodiments of the present application are conducive to improving the performance gain of complex PRACH transmission and increasing coverage.

[0076] The technical solution of the embodiment of the present application is conducive to reducing random access delay and improving random access resource utilization efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0077] FIG1 is a diagram illustrating an example of a system architecture of a wireless communication system to which embodiments of the present application may be applied.

[0078] FIG2 is a diagram showing an example of mapping from RO to ROG.

[0079] FIG3 is another example diagram of mapping from RO to ROG.

[0080] FIG4 is another example diagram of mapping from RO to ROG.

[0081] FIG5 is a schematic flow chart of a method in a node used for wireless communication provided in an embodiment of the present application.

[0082] FIG6 is an example diagram of an implementation method of RO to ROG mapping provided in an embodiment of the present application.

[0083] FIG7 is an example diagram of another implementation of RO to ROG mapping provided in an embodiment of the present application.

[0084] FIG8 is a flowchart of a method in a node used for wireless communication provided by another embodiment of the present application.

[0085] FIG9 is a schematic flow chart of a method in a node used for wireless communication provided in yet another embodiment of the present application.

[0086] FIG10 is a schematic flow chart of a method in a node used for wireless communication provided in yet another embodiment of the present application.

[0087] FIG11 is a schematic structural diagram of a node used for wireless communication provided in an embodiment of the present application.

[0088] FIG12 is a schematic structural diagram of a node used for wireless communication provided in another embodiment of the present application.

[0089] FIG13 is a schematic structural diagram of the device provided in an embodiment of the present application.

[0090] FIG14 is a schematic diagram of the hardware modules of the communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0091] Communication system architecture

[0092] FIG1 is a diagram illustrating an exemplary system architecture of a wireless communication system 100 to which embodiments of the present application may be applied. The wireless communication system 100 may include a network device 110 and a user device 120. The network device 110 may be a device that communicates with the user device 120. The network device 110 may provide communication coverage for a specific geographic area and may communicate with the user device 120 located within the coverage area.

[0093] FIG1 exemplarily shows a network device and two user devices. Optionally, the wireless communication system 100 may include multiple network devices and each network device may include another number of user devices within its coverage area, which is not limited in the embodiments of the present application.

[0094] Optionally, the wireless communication system 100 may further include other network entities such as a network controller and a mobility management entity, which is not limited in the embodiment of the present application.

[0095] It should be understood that the technical solutions of the embodiments of the present application can be applied to various communication systems, such as: fifth generation (5G) system or new radio (NR), long term evolution (LTE) system, LTE frequency division duplex (FDD) system, LTE time division duplex (TDD), etc. The technical solutions provided in this application can also be applied to future communication systems, such as the sixth generation mobile communication system, satellite communication system, etc.

[0096] It should be understood that although the technical solutions of the embodiments of the present application can be used for random access, the technical solutions of the embodiments of the present application can also be used for beam failure recovery. Furthermore, the technical solutions of the embodiments of the present application can be used for the Type-1 random access procedure, and the technical solutions of the embodiments of the present application can also be used for the Type-2 random access procedure. Furthermore, the technical solutions of the embodiments of the present application can be used with the Uu interface, and the technical solutions of the embodiments of the present application can also be used with the PC5 interface. Furthermore, the technical solutions of the embodiments of the present application can be used for single-carrier communication, and the technical solutions of the embodiments of the present application can also be used for multi-carrier communication. Furthermore, the technical solutions of the embodiments of the present application can be used for multi-antenna communication, and the technical solutions of the embodiments of the present application can also be used for single-antenna communication. Furthermore, the technical solutions of the embodiments of the present application can be used in user equipment and base station scenarios, but the technical solutions of the embodiments of the present application are also applicable to vehicle-to-everything (V2X) scenarios, user equipment and relay, and relay and base station communication scenarios, achieving similar technical effects in user equipment and base station scenarios. Furthermore, the technical solutions of the embodiments of the present application can be applied to various communication scenarios, such as enhanced mobile broadband (eMBB), ultra-reliable and low-latency communication (URLLC), and massive machine type communication (mMTC). Furthermore, adopting a unified solution for different scenarios can also help reduce hardware complexity and costs.

[0097] The user equipment in the embodiments of the present application may also be referred to as a terminal device, an access terminal, a user unit, a user station, a mobile station, a mobile station (MS), a mobile terminal (MT), a remote station, a remote terminal, a mobile device, a user terminal, a terminal, a wireless communication device, a user agent, or a user device. The user equipment in the embodiments of the present application may refer to a device that provides voice and / or data connectivity to a user and can be used to connect people, objects, and machines, such as a handheld device with wireless connection function, a vehicle-mounted device, etc. The user equipment in the embodiments of the present application can be a mobile phone, a tablet computer, a laptop computer, a PDA, a mobile internet device (MID), a wearable device, a virtual reality (VR) device, an augmented reality (AR) device, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in remote medical surgery, a wireless terminal in a smart grid, a wireless terminal in transportation safety, a wireless terminal in a smart city, a wireless terminal in a smart home, etc. Optionally, the UE can be used to act as a base station. For example, the UE can act as a scheduling entity that provides sidelink signals between UEs in V2X or D2D, etc. For example, a cellular phone and a car communicate with each other using sidelink signals. The cellular phone and smart home devices communicate without relaying the communication signal through the base station.

[0098] The network device in the embodiments of the present application may be a device for communicating with a user equipment, and may also be referred to as an access network device or a radio access network device. For example, the network device may be a base station. The network device in the embodiments of the present application may refer to a radio access network (RAN) node (or device) that connects the user equipment to a wireless network. A base station can broadly cover various names as follows, or be replaced with the following names, such as: NodeB, evolved NodeB (eNB), next generation NodeB (gNB), relay station, access point, transmission point (TRP), transmission point (TP), master station MeNB, secondary station SeNB, multi-standard radio (MSR) node, home base station, network controller, access node, wireless node, access point (AP), transmission node, transceiver node, baseband unit (BBU), remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), central unit (CU), distributed unit (DU), positioning node, etc. A base station can be a macro base station, a micro base station, a relay node, a donor node or the like, or a combination thereof. A base station can also refer to a communication module, modem or chip used to be set in the aforementioned device or apparatus. The base station can also be a mobile switching center and a device that performs base station functions in device-to-device D2D, vehicle-to-everything (V2X), and machine-to-machine (M2M) communications, a network-side device in a 6G network, or a device that performs base station functions in future communication systems. The base station can support networks with the same or different access technologies. The embodiments of this application do not limit the specific technology and specific device form used by the network equipment.

[0099] Base stations can be fixed or mobile. For example, a helicopter or drone can be configured to act as a mobile base station, and one or more cells can move based on the location of the mobile base station. In other examples, a helicopter or drone can be configured to act as a device that communicates with another base station.

[0100] In some deployments, the network device in the embodiments of the present application may refer to a CU or a DU, or the network device may include a CU and a DU. The gNB may also include an AAU.

[0101] The network equipment and user equipment can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; can also be deployed on the water; can also be deployed in the air on aircraft, balloons, and satellites. The embodiments of this application do not limit the scenarios in which the network equipment and user equipment are located.

[0102] It should be understood that all or part of the functions of the communication device in this application can also be implemented through software functions running on hardware, or through virtualization functions instantiated on a platform (such as a cloud platform).

[0103] Coverage enhancement of PRACH transmission

[0104] The coverage performance of a communication system (e.g., a NR system) is an important factor that operators need to consider when commercially deploying communication networks. This is because the coverage performance of a communication system directly affects the service quality of the communication system and the operator's costs, such as the operator's capital expenditure (CAPEX) and operating expense (OPEX).

[0105] The coverage performance of a communication system varies depending on the frequency band in which it operates. For example, compared to LTE, NR systems operate at higher frequencies (e.g., millimeter wave bands), resulting in greater path loss and, consequently, poorer coverage. Therefore, as communication systems support increasingly higher frequency bands, enhancing coverage becomes a pressing issue.

[0106] In most actual deployment scenarios, uplink coverage is a bottleneck for enhancing communication system coverage, as user equipment capabilities are weaker than those of network equipment. However, with the advancement of communication technology, uplink traffic is increasing in emerging vertical use cases, such as video uploading. In scenarios with high uplink traffic, enhancing uplink coverage is a challenge that needs further resolution.

[0107] In related technologies, coverage enhancement solutions already exist for certain uplink channels. For example, NR Release 17 (Rel-17) has designed coverage enhancement solutions for the physical uplink shared channel (PUSCH), the physical uplink control channel (PUCCH), and message 3 (Msg3) in the random access procedure.

[0108] However, Rel-17 did not design a coverage enhancement solution for PRACH. However, PRACH transmission (PRACH transmission) performance is very important for many processes such as initial access and beam failure recovery. Therefore, it is also very important to enhance PRACH coverage. Based on this, Rel-18 formally established the "further NR coverage enhancements" work item (WI) through the 3rd Generation Partnership Project (3GPP) RP-221858. Among them, enhancing the coverage performance of PRACH transmission is one of the important topics of this work item.

[0109] As a possible implementation method, multiple PRACH transmissions can be used to enhance the coverage of PRACH transmission. That is to say, the coverage enhancement of PRACH transmission can be achieved by repeated transmission of PRACH (for example, sending a random access preamble in PRACH multiple times). It should be noted that, in the present application, multiple PRACH transmissions can also be replaced by multiple PRACH transmissions, multiple PRACH transmissions, multiple PRACH transmissions, PRACH repeated transmissions, type 3 random access procedure (type-3 random access procedure) and other terms, and the embodiments of the present application are not limited to this. That is to say, the multiple PRACH transmissions mentioned in the present application can be replaced by at least one of multiple PRACH transmissions, multiple PRACH transmissions, multiple PRACH transmissions, multiple PRACH transmissions, PRACH repeated transmissions, and type-3 random access procedure.

[0110] As an embodiment, the multiple PRACH transmission is for a random access attempt (RACH attempt). That is, in a random access attempt, a multiple PRACH transmission solution (eg, sending preambles on PRACH multiple times) can be used to enhance PRACH coverage.

[0111] In the embodiment of the present application, complex PRACH transmission may refer to complex PRACH transmission using the same beam, or may refer to complex PRACH transmission using different beams. Taking complex PRACH transmission using the same beam as an example, complex PRACH transmission using the same beam can achieve performance gain, and therefore can be used as a feasible PRACH coverage enhancement solution. The 3GPP radio access network (RAN) 1#110bis-e meeting has reached an agreement: at least PRACH opportunities (or RACH opportunities) in different time periods (time instances, or time points, time instances, etc.) can be used for complex PRACH transmission using the same beam. In other words, ROG can be used for complex PRACH transmission using the same beam.

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

[0113] Physical random access channel opportunity group

[0114] In some scenarios, ROG is introduced to indicate a set of multiple physical random access channel occasions (PRACH occasion, RO), so ROG can also be called "RO set". The embodiment of the present application does not limit the name of ROG. For the convenience of description, the embodiment of the present application is introduced based on ROG. The embodiment of the present application does not limit the name of the physical random access channel occasion. For example, the physical random access channel occasion can also be called a random access occasion, or it can also be called a transmission occasion, etc. For the convenience of description, the embodiment of the present application is described based on the physical random access channel occasion. The physical random access channel occasion and the random access occasion mentioned in the embodiment of the present application can be replaced with each other.

[0115] As an embodiment, ROG may be used for complex PRACH transmission using the same beam.

[0116] As an embodiment, the ROG may include ROs corresponding to multiple PRACHs transmitted using the same beam.

[0117] As an example, some conferences (eg, 3GPP RAN1) have agreed to introduce ROG as a resource for multiple PRACH transmission. A ROG may include multiple valid ROs, for example, a ROG may include multiple valid ROs that do not overlap in time domain.

[0118] As an example, it is also discussed in some meetings (e.g., 3GPP RAN1#110bis-e) that ROs in different time instances can be used for complex PRACH transmission using the same beam. In other words, multiple ROs in a ROG can be located in different time instances.

[0119] As an embodiment, for a specific number of PRACH transmissions, a ROG includes a valid RO, which helps the specific number of PRACHs to be transmitted through the valid RO.

[0120] As an embodiment, all ROs in a ROG can be associated with the same synchronization signal block (or synchronization signal / physical broadcast channel block, SS / PBCH block, SSB). For the sake of simplicity, the synchronization signal block or synchronization signal / physical broadcast channel block will be referred to as SSB in the future, which can be replaced with SS / PBCH block at will.

[0121] As an embodiment, all ROs in a ROG may be associated with one SSB. As an embodiment, all ROs in a ROG may be associated with multiple SSBs, and the multiple SSBs associated with each RO in the ROG are the same.

[0122] As described above, the number of PRACH transmissions configured for a complex PRACH transmission may include multiple values. In this case, multiple complex PRACH transmissions with different numbers of PRACH transmissions can be distinguished by independent preambles in independent ROs and / or shared ROs. In other words, if a complex PRACH transmission is configured with multiple ROG sizes, multiple PRACH transmissions corresponding to different ROG sizes can be distinguished by independent preambles in independent ROs and / or shared ROs.

[0123] As an embodiment, for multiple PRACH transmissions distinguished by independent preambles in shared ROs, the legacy SSB-to-RO mapping rule may be reused. As an embodiment, only ROs mapped to SSBs in a single PRACH transmission may be used for multiple PRACH transmissions. For example, for multiple PRACH transmissions distinguished by independent preambles in shared ROs, the legacy SSB-to-RO mapping rule may be reused, and only ROs mapped to SSBs in a single PRACH transmission may be used for multiple PRACH transmissions.

[0124] As an embodiment, for complex PRACH transmission distinguished by independent ROs, a new SSB to ROG mapping rule may be introduced, or the traditional SSB to RO mapping rule may be reused.

[0125] Therefore, if we consider reusing the traditional SSB to RO mapping rules, how to map the RO to the ROG after completing the SSB to RO mapping is a problem that needs to be solved. In other words, how to determine (or configure) the ROG after completing the SSB to RO mapping is a problem that needs to be solved.

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

[0127] Figure 2 shows an example diagram of a RO to ROG mapping scheme. When the number of ROs frequency-division multiplexed in a time period 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, that is, RO#0 corresponds to SSBs 0 to 7, RO#1 corresponds to SSBs 8 to 15, RO#2 corresponds to SSBs 16 to 23, and so on. In this case, considering that all ROs in a ROG are associated with the same SSB and the ROs in a ROG are in different time periods, see Figure 2, RO#1, RO#9, and RO#17 can be mapped to the same ROG. For example, if the ROG size is 2, RO#1 and RO#9 can be mapped to the same ROG; if the ROG size is 4, RO#1, RO#9, RO#17, and RO#25 (RO#25 is not shown in the figure) can be mapped to the same ROG.

[0128] As an example, the ROs in a determined ROG may be discontinuous. That is, one or more ROs may be separated from the ROs in a ROG. Taking Figure 2 as an example, when the ROG includes RO#1 and RO#9, RO#1 and RO#9 are discontinuous, that is, RO#3, RO#5, and RO#7 are separated from RO#1 and RO#9.

[0129] Figure 3 shows an example of another RO to ROG mapping scheme. When the number of frequency-division multiplexed ROs in a time period is 2 and the number of SSBs corresponding to a Meige RO is 1 / 8, the SSB to RO mapping scheme is as shown in Figure 3, i.e., RO#0 to RO#7 all correspond to SSB 0, RO#8 to RO#15 all correspond to SSB 1, and so on. In this case, considering that all ROs in a ROG are associated with the same SSB and the ROs in a ROG are in different time periods, as shown in Figure 3, RO#1, RO#3, RO#5, and RO#7 can be mapped to the same ROG. For example, if the ROG size is 2, RO#1 and RO#3 can be mapped to the same ROG; if the ROG size is 4, RO#1, RO#3, RO#5, and RO#7 can be mapped to the same ROG.

[0130] As an example, the ROs in a determined ROG can be continuous. That is, the ROs in a ROG can be separated by no other ROs. Taking Figure 3 as an example, if the ROG includes RO#1, RO#3, RO#5, and RO#7, RO#1, RO#3, RO#5, and RO#7 are continuous.

[0131] As can be seen from the foregoing description, any one or more of a variety of factors may affect the RO to ROG mapping scheme. Therefore, how to determine the RO to ROG mapping scheme is particularly important. For example, considering that the size of a ROG may be one of three sizes: 2 ROs, 4 ROs, and 8 ROs, and the ROs in a ROG are in different time periods, different ROG determination methods may generate isolated RO(s) (Orphan RO(s)). These isolated RO(s) may not be used for complex PRACH transmission, resulting in resource waste. In some embodiments, under different parameter configurations, the number of isolated RO(s) generated may be different, resulting in different degrees of resource waste. In addition, the RO to ROG mapping scheme may affect the resource allocation of complex PRACH transmission. For ease of understanding, this issue is described in more detail below in conjunction with Figure 4.

[0132] As shown in Figure 4, this example requires mapping ROs to three different ROG sizes: 2 ROs, 4 ROs, and 8 ROs. In this example, it is assumed that a random access attempt consists of three PRACH time slots. As can be seen from the example in Figure 4, after mapping ROGs with a ROG size of 2 ROs and a ROG size of 4 ROs, there are not enough remaining ROs to map to a ROG size of 8 ROs. Therefore, the remaining ROs will not be mapped to a ROG size of 8 ROs, resulting in the remaining ROs becoming orphaned ROs.

[0133] To address the above issues, embodiments of the present application provide a method and apparatus for use in a wireless communication node, which facilitates optimizing the RO to ROG mapping scheme, or reduces or avoids the generation of isolated ROs, thereby reducing resource waste. The technical solutions of the embodiments of the present application are described below.

[0134] The present application can be applied to a scenario of multiple PRACH transmission, that is, it can be applied to a scenario of using multiple PRACH repeated transmissions to achieve PRACH coverage enhancement.

[0135] The present application can be applied to various random access procedures. As an embodiment, the present application can be applied to a four-step random access procedure, or in other words, can be applied to a random access procedure type-1. As an embodiment, the present application can be applied to a two-step random access procedure, or in other words, can be applied to a random access procedure type-2. As another embodiment, the present application can be applied to a random access procedure corresponding to a multiple PRACH transmission, or in other words, can be applied to a random access procedure type-3.

[0136] The present application can be applied to random access procedures initiated by different triggering methods. As an embodiment, the present application can be applied to a random access procedure triggered by a PDCCH order. As another embodiment, the present application can be applied to a random access procedure triggered by a medium access control (MAC) entity. As yet another embodiment, the present application can be applied to a random access procedure triggered by a radio resource control (RRC) event.

[0137] As an embodiment, the complex PRACH transmission mentioned in this application may refer to complex PRACH transmission using the same beam, so as to obtain a signal-to-noise ratio (SNR) gain by repeatedly transmitting multiple PRACHs on the same beam.

[0138] As an embodiment, the complex PRACH transmission mentioned in the present application may refer to complex PRACH transmission using different beams, so as to obtain diversity gain by repeatedly transmitting multiple PRACHs on different beams.

[0139] As an embodiment, the present application mainly considers reusing the traditional SSB to RO mapping rules, and designs a RO to ROG mapping scheme (mapping rules) based on this. It should be noted that the present application mainly considers but is not limited to reusing the traditional SSB to RO mapping rules.

[0140] The methods and devices provided in this application are illustrated below through multiple embodiments or examples. It should be understood that, unless there is a conflict, the embodiments and features in the embodiments in the first node of this application can be applied to the second node, and vice versa. Unless there is a conflict, the embodiments and features in the embodiments of this application can be combined with each other in any way.

[0141] Figure 5 is a flow chart of a method provided by a node for wireless communication according to an embodiment of the present application. The method shown in Figure 5 is described from the perspective of the interaction between a first node and a second node. The first node and the second node are briefly introduced below.

[0142] As an embodiment, the first node may be any type of node capable of performing RO to ROG mapping in the communication system.

[0143] As an embodiment, the first node may be a user equipment. For example, the first node may be the user equipment 120 shown in FIG1 .

[0144] As an embodiment, the first node may be a network-controlled repeater (NCR).

[0145] As an embodiment, the first node may be a relay, such as a relay terminal.

[0146] As an embodiment, the first node may include one or more receivers. For example, the first node may include one receiver, and the one receiver may receive multiple types of information, signaling, or data. Alternatively, the first node may include multiple receivers, and the multiple receivers may respectively receive different types of information, signaling, or data.

[0147] As a sub-embodiment of the above embodiment, the first node may include a first receiver and a second receiver.

[0148] As an embodiment, the first node may include a transmitter. For example, the first node may also include a first transmitter.

[0149] As an embodiment, the second node may be a node that sends the first information and / or the second information in the communication system.

[0150] As an embodiment, the second node may be a base station.

[0151] As an embodiment, the second node may be a network control relay.

[0152] As an embodiment, the second node may be a relay, such as a relay terminal.

[0153] As an embodiment, the second node may include one or more transmitters. For example, the second node may include a second transmitter and a third transmitter.

[0154] As an embodiment, the second node may include a fourth receiver.

[0155] The method shown in Figure 5 is introduced below. Referring to Figure 5 , the method shown in Figure 5 may include step S510 and step S520.

[0156] In step S510 , the first node receives first information.

[0157] As an embodiment, the first information is used to determine X physical random access channel opportunities, where X is a positive integer greater than 1. In other words, the first information is used to determine multiple physical random access channel opportunities.

[0158] As an embodiment, the first information is used to indicate X physical random access channel opportunities.

[0159] The embodiment of the present application does not limit the implementation manner in which the first information is used to determine the X physical random access channel opportunities. As an embodiment, the first information being used to determine the X physical random access channel opportunities includes at least one of the following: the first information being used to determine the number of synchronization signal blocks corresponding to each physical random access channel opportunity in the X physical random access channel opportunities; or the first information being used to determine the number of random access preambles corresponding to the synchronization signal block corresponding to each physical random access channel opportunity.

[0160] As a sub-embodiment of the above embodiment, the first information is used to determine the number of synchronization signal blocks corresponding to each physical random access channel opportunity in the X physical random access channel opportunities.

[0161] As a sub-embodiment of the above embodiment, the first information is used to determine the number of random access preambles corresponding to the synchronization signal block corresponding to each physical random access channel opportunity in the X physical random access channel opportunities.

[0162] As a sub-embodiment of the above embodiment, the first information is used to determine the number of synchronization signal blocks corresponding to each physical random access channel opportunity in the X physical random access channel opportunities and the number of random access preambles corresponding to each synchronization signal block.

[0163] As an embodiment, the number of random access preambles corresponding to the synchronization signal block may include: the number of contention-based random access preambles corresponding to the synchronization signal block. For example, the first information being used to determine the number of random access preambles corresponding to the synchronization signal block corresponding to each physical random access channel opportunity may include: the first information being used to determine the number of contention-based random access preambles corresponding to the synchronization signal block corresponding to each physical random access channel opportunity.

[0164] The embodiment of the present application does not limit the content contained in the first information. As an embodiment, the first information may indicate the number of synchronization signal blocks corresponding to each physical random access channel opportunity in the X physical random access channel opportunities, for example, using the ssb-perRACH-Occasion parameter to indicate the number of synchronization signal blocks corresponding to each physical random access channel opportunity in the X physical random access channel opportunities. As another embodiment, the first information may indicate the number of synchronization signal blocks corresponding to each physical random access channel opportunity in the X physical random access channel opportunities and the number of random access preambles corresponding to each synchronization signal block, for example, using the CB-PreamblesPerSSB parameter to indicate the number of random access preambles corresponding to each synchronization signal block.

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

[0166] As an embodiment, for the introduction of the ssb-perRACH-OccasionAndCB-PreamblesPerSSB parameter, please refer to the introduction of 3GPP TS38.331.

[0167] As an embodiment, the first information is received by the first node through the first receiver.

[0168] As an embodiment, the first information is sent by the second node to the first node. For example, the first information is sent by a network device or other node to the first node.

[0169] As an embodiment, the first information is sent via high-layer signaling or higher-layer signaling. For example, the first information is sent via RRC layer signaling or MAC layer signaling.

[0170] As an embodiment, the first information is used by the first node to determine X physical random access channel opportunities.

[0171] As an embodiment, the X physical random access channel opportunities are mapped to Q physical random access channel opportunity groups, where Q is a positive integer. In other words, the X physical random access channel opportunities are mapped to one or more physical random access channel opportunity groups. That is, in this embodiment of the present application, multiple physical random access channel opportunities can be mapped to one or more physical random access channel opportunity groups.

[0172] As an embodiment, the X physical random access channel opportunities are mapped by the first node to Q physical random access channel opportunity groups.

[0173] As an embodiment, the X physical random access channel opportunities are mapped by the second node to Q physical random access channel opportunity groups.

[0174] As an embodiment, each of the Q physical random access channel opportunity groups includes at least one physical random access channel opportunity. In other words, any physical random access channel opportunity group in the Q physical random access channel opportunity groups includes at least one physical random access channel opportunity.

[0175] As an embodiment, each physical random access channel opportunity group in the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities.

[0176] As an embodiment, each physical random access channel opportunity group in the Q physical random access channel opportunity groups includes at least one physical random access channel opportunity in the X physical random access channel opportunities.

[0177] As a sub-embodiment of the above embodiment, one of the Q physical random access channel opportunity groups includes one of the X physical random access channel opportunities. The one physical random access channel opportunity group is any one of the Q physical random access channel opportunity groups. The one physical random access channel opportunity is any one of the X physical random access channel opportunities.

[0178] As a sub-embodiment of the above embodiment, one physical random access channel opportunity group among the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities among the X physical random access channel opportunities. The one physical random access channel opportunity group is any one physical random access channel opportunity among the Q physical random access channel opportunity groups. The multiple physical random access channel opportunities are any multiple physical random access channel opportunities among the X physical random access channel opportunities.

[0179] As an embodiment, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are orthogonal in the time domain. In other words, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups do not overlap in the time domain. In other words, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are time-division multiplexing (TDM).

[0180] As an embodiment, the fact that a plurality of physical random access channel opportunities are orthogonal in the time domain can be understood as that any two physical random access channel opportunities among the plurality of physical random access channel opportunities are distributed at different time instances.

[0181] As an embodiment, any one of the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, and at least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two physical random access channel opportunity groups among the Q physical random access channel opportunity groups is different.

[0182] As an embodiment, any one of the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, the Q physical random access channel opportunity groups respectively correspond to multiple random access preambles, and the random access preambles corresponding to at least two physical random access channel opportunity groups in the Q physical random access channel opportunity groups are different.

[0183] In one embodiment, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are associated with the same synchronization signal block. In other words, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are associated with the same synchronization signal block.

[0184] As an embodiment, the multiple physical random access channel opportunities included in any physical random access channel opportunity group among the Q physical random access channel opportunity groups are orthogonal in the time domain and are associated with the same synchronization signal block.

[0185] In one embodiment, at least two different physical random access channel opportunity groups among the Q physical random access channel opportunity groups include different numbers of physical random access channel opportunities. For example, the Q physical random access channel opportunity groups include a first physical random access channel opportunity group and a second physical random access channel opportunity group, and the number of physical random access channel opportunities included in the first physical random access channel opportunity group is different from the number of physical random access channel opportunities included in the second physical random access channel opportunity group.

[0186] In one embodiment, at least two different physical random access channel opportunity groups among the Q physical random access channel opportunity groups include the same number of physical random access channel opportunities. For example, the Q physical random access channel opportunity groups include a first physical random access channel opportunity group and a second physical random access channel opportunity group, and the number of physical random access channel opportunities included in the first physical random access channel opportunity group is the same as the number of physical random access channel opportunities included in the second physical random access channel opportunity group.

[0187] As an embodiment, the number of physical random access channel opportunities included in some of the physical random access channel opportunity groups in the Q physical random access channel opportunity groups is the same.

[0188] As an embodiment, the number of physical random access channel opportunities included in some physical random access channel opportunities in the Q physical random access channel opportunity groups is different.

[0189] In one embodiment, each of the X physical random access channel opportunities is mapped to one of the Q physical random access channel opportunity groups. That is, after the X physical random access channel opportunities are mapped to the Q physical random access channel opportunity groups, no isolated physical random access channel opportunities are generated. In other words, after the X physical random access channel opportunities are mapped to the Q physical random access channel opportunity groups, all of the X physical random access channel opportunities can be used for multiple PRACH transmissions.

[0190] As an embodiment, at least one physical random access channel opportunity among the X physical random access channel opportunities is mapped to one physical random access channel opportunity group among the Q physical random access channel opportunity groups.

[0191] In one embodiment, at least one of the X physical random access channel opportunities is not mapped to any physical random access channel opportunity group in the Q physical random access channel opportunity groups. That is, after the X physical random access channel opportunities are mapped to the Q physical random access channel opportunity groups, isolated physical random access channel opportunities are generated. In other words, after the X physical random access channel opportunities are mapped to the Q physical random access channel opportunity groups, physical random access channel opportunities among the X physical random access channel opportunities that are not mapped to any physical random access channel opportunity group in the Q physical random access channel opportunity groups cannot be used for multiple PRACH transmissions.

[0192] As an embodiment, the Q physical random access channel opportunity groups may be used for multiple PRACH transmissions. For example, the Q physical random access channel opportunity groups may be used by the first node for multiple PRACH transmissions.

[0193] As an embodiment, a physical random access channel opportunity included in any one of the Q physical random access channel opportunity groups may be used for multiple PRACH transmissions. In other words, multiple PRACH transmissions may be performed on a physical random access channel opportunity included in any one of the Q physical random access channel opportunity groups.

[0194] As an embodiment, the multiple PRACH transmission corresponds to a random access attempt.

[0195] As an embodiment, the multiple PRACH transmission is used for one random access attempt.

[0196] As an embodiment, the multiple PRACH transmission includes sending multiple random access preambles respectively on the one random access attempt.

[0197] As an embodiment, multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups may be used to send multiple random access preambles.

[0198] In step S520, the first node receives the second information.

[0199] As an embodiment, the second information is used to determine a plurality of candidate values.

[0200] As an embodiment, the second information is used to indicate a plurality of candidate values.

[0201] As an embodiment, the multiple candidate values ​​may include or be replaced by at least one of the following: multiple ROG sizes, multiple candidate values ​​of the number of PRACHs in a complex PRACH transmission. That is, as an embodiment, 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 ​​of the number of PRACHs in a complex PRACH transmission.

[0202] As an embodiment, the second information is received by the first node through the second receiver.

[0203] As an embodiment, the second information is sent by the second node to the first node. For example, the second information is sent by a network device or other node to the second node.

[0204] As an embodiment, the second information is sent via physical layer, high layer signaling or higher layer signaling. For example, the second information is sent via physical layer (PHY) layer signaling, RRC layer signaling or MAC layer signaling.

[0205] As a sub-embodiment of the above embodiment, the PHY layer signaling may include or be replaced by at least one of the following: downlink control information (DCI), physical broadcast channel (PBCH), and demodulation reference signal (DMRS).

[0206] As an embodiment, the second information is used by the first node to determine multiple candidate values.

[0207] As an embodiment, any candidate value among the multiple candidate values ​​is a positive integer.

[0208] As an embodiment, any candidate value among the multiple candidate values ​​is one of {2, 4, 8}.

[0209] As an embodiment, any candidate value among the multiple candidate values ​​is one of {1, 2, 4, 8}.

[0210] As an embodiment, any two candidate values ​​among the multiple candidate values ​​are not equal.

[0211] As an embodiment, the plurality of candidate values ​​include at least two of {2, 4, 8}. For example, the plurality of candidate values ​​include {2, 4}; or, the plurality of candidate values ​​include {2, 8}; or, the plurality of candidate values ​​include {4, 8}; or, the plurality of candidate values ​​include {2, 4, 8}.

[0212] As an embodiment, the plurality of candidate values ​​include at least two of {1, 2, 4, 8}. For example, the plurality of candidate values ​​include {1, 2}; or, the plurality of candidate values ​​include {1, 4}; or, the plurality of candidate values ​​include {1, 2, 4}; or, the plurality of candidate values ​​include {1, 2, 8}; or, the plurality of candidate values ​​include {1, 2, 4, 8}, and so on.

[0213] As an embodiment, the first candidate value is the maximum value among the multiple candidate values, or the first candidate value is the largest ROG size among multiple ROG sizes.

[0214] As an example, if the multiple candidate values ​​include 2 and 4, the first candidate value is 4. As another example, if the multiple candidate values ​​include 2 and 8, the first candidate value is 8. As yet another example, if the multiple candidate values ​​include 4 and 8, the first candidate value is 8. As yet another example, if the multiple candidate values ​​include 2, 4, and 8, the first candidate value is 8.

[0215] As an embodiment, the number of physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups is one of the multiple candidate values. Taking the multiple candidate values ​​including at least two of {1, 2, 4, 8} as an example, assuming that the multiple candidate values ​​include {2, 4}, the number of physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups is one of {2, 4}; assuming that the multiple candidate values ​​include {2, 4, 8}, the number of physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups is one of {2, 4, 8}; and so on.

[0216] In one embodiment, the number of physical random access channel opportunities included in a physical random access channel opportunity group corresponding to any candidate value among the multiple candidate values ​​is the candidate value. In other words, the number of physical random access channel opportunities included in each physical random access channel opportunity group in at least one physical random access channel opportunity group corresponding to any candidate value among the multiple candidate values ​​is equal to the candidate value.

[0217] As an embodiment, the first candidate value is any candidate value among the multiple candidate values, and the number of physical random access channel opportunities included in the physical random access channel opportunity group corresponding to the first candidate value is (equal to) the first candidate value.

[0218] As an embodiment, the first candidate value is any candidate value among the multiple candidate values, the first candidate value corresponds to a physical random access channel opportunity group, and the number of physical random access channel opportunities included in the physical random access channel opportunity group corresponding to the first candidate value is the first candidate value.

[0219] As an embodiment, the first candidate value is any candidate value among the multiple candidate values, the first candidate value corresponds to multiple physical random access channel opportunity groups, and the number of physical random access channel opportunities included in any physical random access channel opportunity group among the multiple physical random access channel opportunity groups corresponding to the first candidate value is the first candidate value.

[0220] As an embodiment, the first candidate value is any candidate value among the multiple candidate values, the first candidate value corresponds to at least one physical random access channel opportunity group, and the number of physical random access channel opportunities included in any physical random access channel opportunity group in the at least one physical random access channel opportunity group corresponding to the first candidate value is the first candidate value.

[0221] The embodiment of the present application does not limit the execution order of step S510 and step S520. For example, step S510 can be executed before step S520, after step S520, or simultaneously with step S520.

[0222] In an embodiment of the present application, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups may be related to multiple factors (parameters), for example, one or more of the following factors: the multiple candidate values; the number of physical random access channel opportunity groups corresponding to the multiple candidate values, etc.

[0223] As an embodiment, the multiple candidate values ​​include a first candidate value and a second candidate value, and the larger value of the first candidate value and the second candidate value is preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups; and / or, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to the multiple candidate values ​​respectively.

[0224] In one embodiment, the larger value of the first candidate value and the second candidate value is preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups. In other words, the physical random access channel opportunity group corresponding to the larger value of the first candidate value and the second candidate value is preferentially determined.

[0225] As an embodiment, when the first candidate value and the second candidate value represent different ROG sizes, the mapping of the X physical random access channel opportunities to the physical random access channel opportunity group with a larger ROG size is completed first, or the physical random access channel opportunity group with a larger ROG size is determined first.

[0226] As an example, the first candidate value is 2, the second candidate value is 4, and the candidate value 4 is preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups, or in other words, the physical random access channel opportunity group corresponding to the candidate value 4 is preferentially determined, or in other words, the mapping of the X physical random access channel opportunities to the physical random access channel opportunity group with an ROG size of 4 is preferentially completed, or in other words, the physical random access channel opportunity group with an ROG size of 4 is preferentially determined.

[0227] In one embodiment, a larger value among the multiple candidate values ​​is preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups. In other words, the physical random access channel opportunity group corresponding to the larger value among the multiple candidate values ​​is preferentially determined.

[0228] As an example, the multiple candidate values ​​include {4, 8}, and the candidate value 8 is preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups, or in other words, the physical random access channel opportunity group corresponding to the candidate value 8 is preferentially determined, or in other words, the mapping of the X physical random access channel opportunities to the physical random access channel opportunity group with an ROG size of 8 is preferentially completed, or in other words, the physical random access channel opportunity group with an ROG size of 8 is preferentially determined.

[0229] As another example, the multiple candidate values ​​include {2, 4, 8}, and completing the mapping of the X physical random access channel opportunities to the physical random access channel opportunity groups corresponding to candidate values ​​4 and / or 8 has a higher priority than completing the mapping of the X physical random access channel opportunities to the physical random access channel opportunity group corresponding to candidate value 2; completing the mapping of the X physical random access channel opportunities to the physical random access channel opportunity group corresponding to candidate value 8 has a higher priority than completing the mapping of the X physical random access channel opportunities to the physical random access channel opportunity group corresponding to candidate value 4. In other words, completing the mapping of the X physical random access channel opportunities to physical random access channel opportunity groups with ROG sizes of 4 and / or 8 has a higher priority than completing the mapping of the X physical random access channel opportunities to a physical random access channel opportunity group with ROG size of 2; and completing the mapping of the X physical random access channel opportunities to a physical random access channel opportunity group with ROG size of 8 has a higher priority than completing the mapping of the X physical random access channel opportunities to a physical random access channel opportunity group with ROG size of 4.

[0230] As an embodiment, the multiple candidate values ​​are used in descending order for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups.

[0231] As an embodiment, the Q physical random access channel opportunity groups are determined in descending order of the multiple candidate values.

[0232] As an embodiment, when the communication system is configured with multiple ROG sizes, the multiple ROG sizes are used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups in descending order.

[0233] As an embodiment, when the communication system is configured with multiple ROG sizes, the Q physical random access channel opportunity groups are determined in descending order of the multiple ROG sizes.

[0234] As an example, the multiple candidate values ​​include {2, 4, 8}, and the candidate value 8 is preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups, followed by the candidate value 4 for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups, and finally, the candidate value 2 is used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups. In other words, the multiple candidate values ​​include {2, 4, 8}, and preferentially complete the mapping of the X physical random access channel opportunities to the physical random access channel opportunity groups with an ROG size of 8, followed by the mapping of the X physical random access channel opportunities to the physical random access channel opportunity groups with an ROG size of 4, and finally, complete the mapping of the X physical random access channel opportunities to the physical random access channel opportunity groups with an ROG size of 2. In other words, the multiple candidate values ​​include {2, 4, 8}, and the physical random access channel opportunity group with an ROG size of 8 is determined first, followed by the physical random access channel opportunity group with an ROG size of 4, and finally the physical random access channel opportunity group with an ROG size of 2.

[0235] As another example, the multiple candidate values ​​include {1, 2, 4}, candidate value 4 is preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups, followed by candidate value 2 for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups, and finally candidate value 1 is used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups. In other words, the multiple candidate values ​​include {1, 2, 4}, preferentially completing the mapping of the X physical random access channel opportunities to a physical random access channel opportunity group with an ROG size of 4, followed by completing the mapping of the X physical random access channel opportunities to a physical random access channel opportunity group with an ROG size of 2, and finally completing the mapping of the X physical random access channel opportunities to a physical random access channel opportunity group with an ROG size of 1. In other words, the multiple candidate values ​​include {1, 2, 4}, and the physical random access channel opportunity group with an ROG size of 4 is determined first, followed by the physical random access channel opportunity group with an ROG size of 2, and finally the physical random access channel opportunity group with an ROG size of 1.

[0236] In one embodiment, the maximum value among the multiple candidate values ​​is preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups. In other words, the physical random access channel opportunity group corresponding to the maximum value among the multiple candidate values ​​is preferentially determined.

[0237] As an embodiment, when the multiple candidate values ​​represent different ROG sizes, the mapping of the X physical random access channel opportunities to the physical random access channel opportunity group with the largest ROG size is completed first, or the physical random access channel opportunity group with the largest ROG size is determined first.

[0238] As an example, when the multiple candidate values ​​include {2, 4, 8}, the candidate value 8 is preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups, or the physical random access channel opportunity group corresponding to the candidate value 8 is preferentially determined, or the mapping of the X physical random access channel opportunities to physical random access channel opportunities with an ROG size of 8 is preferentially completed, or the physical random access channel opportunity group with an ROG size of 8 is preferentially determined.

[0239] As another example, when the multiple candidate values ​​include {1, 2, 4}, the candidate value 4 is preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups, or the physical random access channel opportunity group corresponding to the candidate value 4 is preferentially determined, or the mapping of the X physical random access channel opportunities to physical random access channel opportunities with an ROG size of 4 is preferentially completed, or the physical random access channel opportunity group with an ROG size of 4 is preferentially determined.

[0240] Since larger candidate values ​​(larger ROGs) require more non-overlapping physical random access channel opportunities in the time domain and have stricter requirements on physical random access channel opportunities, when mapping physical random access channel opportunities to physical random access channel opportunity groups, prioritizing the mapping corresponding to larger candidate values ​​before satisfying the mapping corresponding to smaller candidate values ​​can minimize isolated physical random access channel opportunities and improve resource utilization efficiency. In other words, when mapping physical random access channel opportunities to physical random access channel opportunity groups, prioritizing the mapping corresponding to larger ROGs before satisfying the mapping corresponding to smaller ROGs can minimize isolated physical random access channel opportunities and improve resource utilization efficiency.

[0241] As an embodiment, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to the multiple candidate values.

[0242] As an embodiment, the multiple candidate values ​​include a first candidate value and a second candidate value, and the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to the first candidate value and the number of physical random access channel opportunity groups corresponding to the second candidate value.

[0243] As an embodiment, the multiple candidate values ​​include a first candidate value, a second candidate value, and a third candidate value, and the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to the first candidate value, the number of physical random access channel opportunity groups corresponding to the second candidate value, and the number of physical random access channel opportunity groups corresponding to the third candidate value.

[0244] However, the embodiment of the present application is not limited to this. The multiple candidate values ​​may include 3 or more candidate values, and the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to each candidate value in the multiple candidate values.

[0245] As an embodiment, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to multiple ROG sizes.

[0246] As an embodiment, the multiple ROG sizes include a first ROG size and a second ROG size, and the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to the first ROG size and the number of physical random access channel opportunity groups corresponding to the second ROG size.

[0247] As an embodiment, the multiple ROG sizes include a first ROG size, a second ROG size, and a third ROG size, and the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to the first ROG size, the number of physical random access channel opportunity groups corresponding to the second ROG size, and the number of physical random access channel opportunity groups corresponding to the third ROG size.

[0248] However, the embodiments of the present application are not limited to this. The multiple ROG sizes may include 3 or more ROG sizes, and the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to each ROG size in the multiple ROG sizes.

[0249] As an example, the multiple candidate values ​​include {2, 4}, and the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to the candidate value 2 and the number of physical random access channel opportunity groups corresponding to the candidate value 4. In other words, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups with an ROG size of 2 and the number of physical random access channel opportunity groups with an ROG size of 4.

[0250] As another example, the multiple candidate values ​​include {2, 4, 8}, and the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to the candidate value 2, the number of physical random access channel opportunity groups corresponding to the candidate value 4, and the number of physical random access channel opportunity groups corresponding to the candidate value 8. In other words, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups with an ROG size of 2, the number of physical random access channel opportunity groups with an ROG size of 4, and the number of physical random access channel opportunity groups with an ROG size of 8.

[0251] In one embodiment, each opportunity group subset in the plurality of opportunity group subsets includes Q1 physical random access channel opportunity groups in the Q physical random access channel opportunity groups. That is, in one embodiment, the Q physical random access channel opportunity groups may be divided into a plurality of opportunity group subsets, and each opportunity group subset in the plurality of opportunity group subsets includes at least one physical random access channel opportunity group in the Q physical random access channel opportunity groups.

[0252] In one embodiment, any candidate value among the multiple candidate values ​​corresponds to at least one physical random access channel opportunity group among the Q1 physical random access channel opportunity groups included in each opportunity group subset in the multiple opportunity group subsets. That is, for each opportunity group subset in the multiple opportunity group subsets, any candidate value among the multiple candidate values ​​corresponds to at least one physical random access channel opportunity group in the opportunity group subset.

[0253] As an embodiment, each timing group subset in the multiple timing group subsets includes Q1 physical random access channel timing groups in the Q physical random access channel timing groups; any candidate value in the multiple candidate values ​​corresponds to at least one physical random access channel timing group in the Q1 physical random access channel timing groups included in each timing group subset in the multiple timing group subsets; the number of physical random access channel timing groups in any two timing group subsets in the multiple timing group subsets corresponding to any candidate value in the multiple candidate values ​​is equal.

[0254] In one embodiment, the multiple candidate values ​​include a first candidate value and a second candidate value, and the multiple 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 physical random access channel opportunity group among the Q1 physical random access channel opportunity groups included in the first opportunity group subset, and the second candidate value corresponds to at least one physical random access channel opportunity group among the Q1 physical random access channel opportunity groups included in the first opportunity group subset. For the second opportunity group subset, the first candidate value corresponds to at least one physical random access channel opportunity group among the Q1 physical random access channel opportunity groups included in the second opportunity group subset, and the second candidate value corresponds to at least one physical random access channel opportunity group among the Q1 physical random access channel opportunity groups included in the second opportunity group subset.

[0255] In one embodiment, the multiple candidate values ​​include a first candidate value, a second candidate value, and a third candidate value, and the multiple 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 physical random access channel opportunity group among the Q1 physical random access channel opportunity groups included in the first opportunity group subset, the second candidate value corresponds to at least one physical random access channel opportunity group among the Q1 physical random access channel opportunity groups included in the first opportunity group subset, and the third candidate value corresponds to at least one physical random access channel opportunity group among the Q1 physical random access channel opportunity groups included in the first opportunity group subset. For the second opportunity group subset, the first candidate value corresponds to at least one physical random access channel opportunity group among the Q1 physical random access channel opportunity groups included in the second opportunity group subset, the second candidate value corresponds to at least one physical random access channel opportunity group among the Q1 physical random access channel opportunity groups included in the second opportunity group subset, and the third candidate value corresponds to at least one physical random access channel opportunity group among the Q1 physical random access channel opportunity groups included in the second opportunity group subset.

[0256] As an embodiment, the number of physical random access channel opportunity groups in at least two opportunity group subsets in the multiple opportunity group subsets corresponding to any candidate value in the multiple candidate values ​​is equal.

[0257] Taking the example that the multiple candidate values ​​include {2, 4}, and the multiple timing group subsets include a first timing group subset, a second timing group subset, and a third timing group subset, the number of physical random access channel timing groups in the first timing group subset corresponding to the candidate value 2 is equal to the number of physical random access channel timing groups in the second timing group subset corresponding to the candidate value 2, and is not equal to the number of physical random access channel timing groups in the third timing group subset corresponding to the candidate value 2; or, the number of physical random access channel timing groups in the first timing group subset corresponding to the candidate value 2 is equal to the number of physical random access channel timing groups in the second timing group subset corresponding to the candidate value 2, and the number of physical random access channel timing groups in the third timing group subset corresponding to the candidate value 2.

[0258] As an embodiment, the numbers of physical random access channel opportunity groups in some opportunity group subsets among the multiple opportunity group subsets corresponding to any candidate values ​​among the multiple candidate values ​​are different.

[0259] As an embodiment, the numbers of physical random access channel opportunity groups in any two opportunity group subsets in the multiple opportunity group subsets corresponding to any candidate value in the multiple candidate values ​​are equal.

[0260] As an embodiment, the first timing group subset and the second timing group subset are respectively any two timing group subsets of the multiple timing group subsets; the number of physical random access channel timing groups in the first timing group subset corresponding to the first candidate value is equal to the number of physical random access channel timing groups in the second timing group subset corresponding to the first candidate value; the number of physical random access channel timing groups in the first timing group subset corresponding to the second candidate value is equal to the number of physical random access channel timing groups in the second timing group subset corresponding to the second candidate value.

[0261] As an example, the multiple candidate values ​​include {2, 4}, the multiple timing group subsets include a first timing group subset and a second timing group subset, the number of physical random access channel timing groups in the first timing group subset corresponding to the candidate value 2 is equal to the number of physical random access channel timing groups in the second timing group subset corresponding to the candidate value 2; the number of physical random access channel timing groups in the first timing group subset corresponding to the candidate value 4 is equal to the number of physical random access channel timing groups in the second timing group subset corresponding to the candidate value 4.

[0262] As another example, the multiple candidate values ​​include {2, 4}, the multiple timing group subsets include a first timing group subset, a second timing group subset, and a third timing group subset, the number of physical random access channel timing groups in the first timing group subset corresponding to the candidate value 2 is equal to the number of physical random access channel timing groups in the second timing group subset corresponding to the candidate value 2, and the number of physical random access channel timing groups in the third timing group subset corresponding to the candidate value 2; the number of physical random access channel timing groups in the first timing group subset corresponding to the candidate value 4 is equal to the number of physical random access channel timing groups in the second timing group subset corresponding to the candidate value 4, and the number of physical random access channel timing groups in the third timing group subset corresponding to the candidate value 4.

[0263] As another example, the multiple candidate values ​​include {2, 4, 8}, the multiple timing group subsets include a first timing group subset, a second timing group subset, and a third timing group subset, the number of physical random access channel timing groups in the first timing group subset corresponding to the candidate value 2 is equal to the number of physical random access channel timing groups in the second timing group subset corresponding to the candidate value 2, and the number of physical random access channel timing groups in the third timing group subset corresponding to the candidate value 2; the number of physical random access channel timing groups in the first timing group subset corresponding to the candidate value 4 is equal to the number of physical random access channel timing groups in the second timing group subset corresponding to the candidate value 4, and the number of physical random access channel timing groups in the third timing group subset corresponding to the candidate value 4; the number of physical random access channel timing groups in the first timing group subset corresponding to the candidate value 8 is equal to the number of physical random access channel timing groups in the second timing group subset corresponding to the candidate value 8, and the number of physical random access channel timing groups in the third timing group subset corresponding to the candidate value 8.

[0264] As an embodiment, at least two of the multiple opportunity group subsets respectively include the same number of physical random access channel opportunity groups.

[0265] As an embodiment, any two opportunity group subsets among the multiple opportunity group subsets respectively include the same number of physical random access channel opportunity groups.

[0266] As an embodiment, the multiple timing group subsets include a first timing group subset and a second timing group subset, and the number of physical random access channel timing groups included in the first timing group subset is equal to the number of physical random access channel timing groups included in the second timing group subset.

[0267] As an embodiment, the multiple timing group subsets include a first timing group subset, a second timing group subset and a third timing group subset, and the number of physical random access channel timing groups included in the first timing group subset is equal to the number of physical random access channel timing groups included in the second timing group subset and the number of physical random access channel timing groups included in the third timing group subset.

[0268] As an embodiment, the number of physical random access channel opportunity groups in each opportunity group subset of the multiple opportunity group subsets to which the multiple candidate values ​​respectively correspond is in a first ratio.

[0269] As an embodiment, the multiple candidate values ​​include a first candidate value and a second candidate value, and the ratio of the number of physical random access channel opportunity groups in each of the multiple opportunity group subsets corresponding to the first candidate value to the number of physical random access channel opportunity groups in each of the multiple opportunity group subsets corresponding to the second candidate value is the first ratio.

[0270] In one embodiment, the multiple candidate values ​​include a first candidate value and a second candidate value, and the multiple opportunity group subsets include a first opportunity group subset and a second opportunity group subset. The ratio of the number of physical random access channel opportunity groups in the first opportunity group subset corresponding to the first candidate value to the number of physical random access channel opportunity groups in the first opportunity group subset corresponding to the second candidate value is the first ratio. The ratio of the number of physical random access channel opportunity groups in the second opportunity group subset corresponding to the first candidate value to the number of physical random access channel opportunity groups in the second opportunity group subset corresponding to the second candidate value is the first ratio.

[0271] As an example, the number of physical random access channel opportunity groups in each of the multiple opportunity group subsets corresponding to the first candidate value is A, and the number of physical random access channel opportunity groups in each of the multiple opportunity group subsets corresponding to the second candidate value is B, then the first ratio can be expressed as A:B.

[0272] As an example, the number of physical random access channel opportunity groups in the first opportunity group subset corresponding to the first candidate value is A1, and the number of physical random access channel opportunity groups in the first opportunity group subset corresponding to the second candidate value is B1, then the first ratio can be expressed as A1:B1; the number of physical random access channel opportunity groups in the second opportunity group subset corresponding to the first candidate value is A2, and the number of physical random access channel opportunity groups in the second opportunity group subset corresponding to the second candidate value is B2, then the first ratio can be expressed as A2:B2; and A1:B1 is equal to A2:B2.

[0273] As an embodiment, the multiple candidate values ​​include a first candidate value, a second candidate value and a third candidate value; the ratio of the number of physical random access channel opportunity groups in each of the multiple opportunity group subsets corresponding to the first candidate value, the number of physical random access channel opportunity groups in each of the multiple opportunity group subsets corresponding to the second candidate value, and the number of physical random access channel opportunity groups in each of the multiple opportunity group subsets corresponding to the third candidate value is the first ratio.

[0274] In one embodiment, the multiple candidate values ​​include a first candidate value, a second candidate value, and a third candidate value, and the multiple opportunity group subsets include a first opportunity group subset and a second opportunity group subset. The ratio of the number of physical random access channel opportunity groups in the first opportunity group subset corresponding to the first candidate value, to the number of physical random access channel opportunity groups in the first opportunity group subset corresponding to the second candidate value, to the number of physical random access channel opportunity groups in the first opportunity group subset corresponding to the third candidate value is the first ratio. The ratio of the number of physical random access channel opportunity groups in the second opportunity group subset corresponding to the first candidate value, to the number of physical random access channel opportunity groups in the second opportunity group subset corresponding to the second candidate value, to the number of physical random access channel opportunity groups in the second opportunity group subset corresponding to the third candidate value is the first ratio.

[0275] As an example, the number of physical random access channel opportunity groups in each of the multiple opportunity group subsets corresponding to the first candidate value is A, the number of physical random access channel opportunity groups in each of the multiple opportunity group subsets corresponding to the second candidate value is B, and the number of physical random access channel opportunity groups in each of the multiple opportunity group subsets corresponding to the third candidate value is C, then the first ratio can be expressed as A:B:C.

[0276] As an example, the number of physical random access channel opportunity groups in the first opportunity group subset corresponding to the first candidate value is A1, the number of physical random access channel opportunity groups in the first opportunity group subset corresponding to the second candidate value is B1, and the number of physical random access channel opportunity groups in the first opportunity group subset corresponding to the third candidate value is C1, then the first ratio can be expressed as A1:B1:C1; the number of physical random access channel opportunity groups in the second opportunity group subset corresponding to the first candidate value is A2, the number of physical random access channel opportunity groups in the second opportunity group subset corresponding to the second candidate value is B2, and the number of physical random access channel opportunity groups in the second opportunity group subset corresponding to the third candidate value is C2, then the first ratio can be expressed as A2:B2:C2; and A1:B1:C1 is equal to A2:B2:C2.

[0277] As an embodiment, the first ratio is fixed.

[0278] As an embodiment, the first ratio is configurable.

[0279] As an embodiment, the first ratio is configured by high-layer signaling or higher-layer signaling. For example, the first ratio is configured by RRC signaling and / or MAC CE signaling.

[0280] As an embodiment, the first ratio is equal to the ratio of the number of physical random channel opportunity groups that need to be determined corresponding to the multiple candidate values.

[0281] As an embodiment, the multiple candidate values ​​include a first candidate value and a second candidate value, and the first ratio is equal to the ratio of the number of physical random channel opportunity groups that need to be determined corresponding to the first candidate value to the number of physical random channel opportunity groups that need to be determined corresponding to the second candidate value.

[0282] As an embodiment, the multiple candidate values ​​include a first candidate value, a second candidate value and a third candidate value, and the first ratio is equal to the ratio of the number of physical random channel opportunity groups that need to be determined corresponding to the first candidate value to the number of physical random channel opportunity groups that need to be determined corresponding to the second candidate value to the number of physical random channel opportunity groups that need to be determined corresponding to the third candidate value.

[0283] As an embodiment, the first ratio is equal to the least common divisor of the number of physical random channel opportunity groups that need to be determined and corresponding to the multiple candidate values.

[0284] As an embodiment, any one of the multiple opportunity group subsets includes X1 physical random access opportunities among the X physical random access channel opportunities; in each opportunity group subset of the multiple opportunity group subsets, the multiple candidate values ​​are used in descending order to map the X1 physical random access channel opportunities to the Q1 physical random access channel opportunity groups.

[0285] As an embodiment, any one of the multiple timing group subsets includes X1 physical random access opportunities among the X physical random access channel opportunities; the multiple candidate values ​​include a first candidate value and a second candidate value, and the first candidate value is greater than the second candidate value; in each timing group subset of the multiple timing group subsets, the mapping of the X1 physical random access channel opportunities corresponding to the first candidate value to the Q1 physical random access channel opportunity group is completed first, and then the mapping of the X1 physical random access channel opportunities corresponding to the second candidate value to the Q1 physical random access channel opportunity group is completed.

[0286] As an embodiment, any timing group subset among the multiple timing group subsets includes X1 physical random access opportunities among the X physical random access channel opportunities; the multiple candidate values ​​include a first candidate value, a second candidate value, and a third candidate value, and the first candidate value > the second candidate value > the third candidate value; in each timing group subset among the multiple timing group subsets, the mapping of the X1 physical random access channel opportunities corresponding to the first candidate value to the Q1 physical random access channel opportunity group is completed first, followed by the mapping of the X1 physical random access channel opportunities corresponding to the second candidate value to the Q1 physical random access channel opportunity group, and finally the mapping of the X1 physical random access channel opportunities corresponding to the third candidate value to the Q1 physical random access channel opportunity group is completed.

[0287] As an embodiment, any one of the multiple opportunity group subsets includes X1 physical random access opportunities among the X physical random access channel opportunities; in each opportunity group subset of the multiple opportunity group subsets, the larger value of the multiple candidate values ​​is preferentially used for mapping the X1 physical random access channel opportunities to the Q1 physical random access channel opportunity groups.

[0288] As an embodiment, any one of the multiple opportunity group subsets includes X1 physical random access opportunities among the X physical random access channel opportunities; in each of the multiple opportunity group subsets, the larger value of the first candidate value and the second candidate value is preferentially used for mapping the X1 physical random access channel opportunities to the Q1 physical random access channel opportunity groups, and the first candidate value and the second candidate value are any two candidate values ​​among the multiple candidate values.

[0289] As an embodiment, any one of the multiple opportunity group subsets includes X1 physical random access opportunities among the X physical random access channel opportunities; in each opportunity group subset of the multiple opportunity group subsets, the maximum value of the multiple candidate values ​​is preferentially used for mapping the X1 physical random access channel opportunities to the Q1 physical random access channel opportunity groups.

[0290] When mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups, determining the mapping of the X1 physical random access channel opportunities in each opportunity group subset to the Q1 physical random access channel opportunity groups in a manner of opportunity group subsets, can ensure that when the first node uses a smaller ROG for complex PRACH transmission, random access resources can be found in different periods, which is beneficial to balancing random access delay and collision probability, or in other words, it is beneficial to reducing random access delay while reducing isolated physical random access channel opportunities.

[0291] The foregoing describes the mapping process of the X physical random access channel opportunities to the Q physical random access channel opportunity groups. The larger value among multiple candidate values ​​can be preferentially used for mapping the physical random access channel opportunities to the physical random access channel opportunity groups, and / or the number of physical random access channel opportunity groups corresponding to the multiple candidate values ​​can be used for mapping the physical random access channel opportunities to the physical random access channel opportunity groups. Consideration of these factors is conducive to optimizing the mapping scheme of physical random access channel opportunities to physical random access channel opportunity groups and is conducive to reducing or avoiding the generation of isolated physical random access channel opportunities; or, the consideration of these factors is conducive to reducing resource waste; or, the consideration of these factors is conducive to optimizing resource allocation for multiple PRACH transmissions; or, the consideration of these factors is conducive to improving the performance gain of multiple PRACH transmissions and increasing coverage; or, the consideration of these factors is conducive to reducing random access delay and improving random access resource utilization efficiency.

[0292] For ease of understanding, specific implementations of mapping two physical random access channel opportunities to physical random access channel opportunity groups are given below in conjunction with FIG. 6 and FIG. 7 .

[0293] Implementation 1: Multiple candidate values ​​are used for RO to ROG mapping in descending order

[0294] Assuming that the multiple candidate values ​​include 2 and 4, in the RO to ROG mapping, X1 physical random access channel opportunity groups corresponding to the candidate value 4 can be determined first, and then the physical random access channel opportunity groups corresponding to the candidate value 2 can be determined. In other words, assuming that the multiple ROG sizes include 2 and 4, in the RO to ROG mapping, X1 physical random access channel opportunity groups with a ROG size of 4 can be determined first, and then the physical random access channel opportunity groups with a ROG size of 2 can be determined.

[0295] Assuming that multiple candidate values ​​include 2, 4, and 8, in the RO to ROG mapping, X1 physical random access channel opportunity groups corresponding to the candidate value 8 can be determined first, then X2 physical random access channel opportunity groups corresponding to the candidate value 4 can be determined, and finally X3 physical random access channel opportunity groups corresponding to the candidate value 2 can be determined. In other words, assuming that multiple ROG sizes include 2, 4, and 8, in the RO to ROG mapping, X1 physical random access channel opportunity groups with a ROG size of 8 can be determined first, then X2 physical random access channel opportunity groups with a ROG size of 4 can be determined, and finally X3 physical random access channel opportunity groups with a ROG size of 2 can be determined.

[0296] As shown in Figure 6, the multiple candidate values ​​in the example of Figure 6 include 2 and 4. According to the descending order of the multiple candidate values, the physical random access channel opportunity group corresponding to the candidate value 4 is first determined, referring to the physical random access channel opportunity group with an ROG size of 4 shown in Figure 6. The physical random access channel opportunity group with an ROG size of 4 includes RO#1, RO#3, RO#9 and RO#11; secondly, the physical random access channel opportunity group corresponding to the candidate value 2 is determined, referring to the physical random access channel opportunity group with an ROG size of 2 shown in Figure 6. The physical random access channel opportunity group with an ROG size of 2 includes RO#17 and RO#19.

[0297] As an embodiment, when multiple candidate values ​​are used in a descending order for the RO to ROG mapping scheme, if the first node (for example, the first node with better channel quality) selects a smaller candidate value (ROG with a smaller size) for complex PRACH transmission, it may cause the available ROG resources to be relatively late, resulting in a larger random access delay for the first node.

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

[0299] For physical random access channel opportunity groups with multiple candidate values ​​(multiple ROG sizes), the physical random access channel opportunity groups corresponding to different candidate values ​​(different ROG sizes) can be determined according to a certain proportional factor (such as the first proportion mentioned above), and the physical random access channel opportunity groups corresponding to the different candidate values ​​are in a subset of opportunity groups.

[0300] As an embodiment, in each opportunity group subset, the physical random access channel opportunity group corresponding to a larger candidate value (larger ROG size) may be determined preferentially.

[0301] As an embodiment, after completing the mapping of the physical random access channel opportunities in one opportunity group subset to the physical random access channel opportunity group, the mapping of the physical random access channel opportunities in the next opportunity group subset to the physical random access channel opportunity group can be performed until the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is completed.

[0302] 7 , the multiple candidate values ​​in the example of FIG7 include 2, 4, and 8. The number of ROGs with an ROG size of 8 to be determined is S1, the number of ROGs with an ROG size of 4 to be determined is S2, and the number of ROGs with an ROG size of 2 to be determined is S3. As an implementation, Y1 ROGs with an ROG size of 8 can be first determined, then Y2 ROGs with an ROG size of 4 can be determined, and finally Y3 ROGs with an ROG size of 2 can be determined according to a certain scaling factor (e.g., number of ROGs with an ROG size of 8: number of ROGs with an ROG size of 4: number of ROGs with an ROG size of 2: = t1:t2:t3); where Y1 = a*t1 and Y1 is not greater than S1, Y2 = a*t2 and Y2 is not greater than S2, and Y3 = a*t3 and Y3 is not greater than S3. First, determine a group of Y1+Y2+Y3 ROGs, and then determine the next group of Y1+Y2+Y3 ROGs. After the remaining ROs cannot satisfy the mapping of a group of Y1+Y2+Y3 ROGs, the remaining ROs are allocated to ROGs of one or two sizes, where t1:t2:t3 can be the lowest common divisor of S1:S2:S3.

[0303] As shown in FIG7 , according to a ratio (a first ratio) of 1:2:8 for the number of ROGs corresponding to multiple candidate values ​​(2, 4, and 8), Y1 ROGs with a ROG size of 8 are first determined (in the example of FIG7 , one ROG with a ROG size of 8 is first determined), then Y2 ROGs with a ROG size of 4 are determined (in the example of FIG7 , two ROGs with a ROG size of 4 are then determined), and finally Y3 ROGs with a ROG size of 2 are determined (in the example of FIG7 , eight ROGs with a ROG size of 2 are then determined). After a group of Y1+Y2+Y3 ROGs is determined, another group of Y1+Y2+Y3 ROGs is determined, and this continues until the remaining ROs no longer satisfy the mapping of the group of Y1+Y2+Y3 ROGs. The remaining ROs are then allocated to ROGs of one or both sizes.

[0304] The mapping scheme provided by Implementation 2 ensures that when the first node uses a smaller ROG for complex PRACH transmission, it can find random access resources in different cycles, thereby balancing random access delay and collision probability. In other words, the mapping scheme provided by Implementation 2 can reduce the random access delay of complex PRACH transmissions occupying smaller ROGs, thereby improving the performance gain of complex PRACH transmissions, increasing coverage, and improving the efficiency of random access resource utilization.

[0305] As an embodiment, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups may be related to other information in addition to the factors described above, which is not limited in this embodiment of the present application.

[0306] As an embodiment, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to one or more of the following information: the number of frequency-division multiplexed physical random access channel opportunities within a time period; the number of synchronization signal blocks corresponding to any physical random access channel opportunity among the X physical random access channel opportunities; and the number of random access preambles corresponding to any synchronization signal block among the multiple synchronization signal blocks corresponding to the X physical random access channel opportunities.

[0307] As a sub-embodiment of the above embodiment, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of frequency-division multiplexed physical random access channel opportunities within a time period. In other words, if the number of frequency-division multiplexed physical random access channel opportunities within a time period is different, the Q physical random access channel opportunity groups ultimately determined may be different.

[0308] As a sub-embodiment of the above embodiment, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of synchronization signal blocks corresponding to any one of the X physical random access channel opportunities. In other words, if the number of synchronization signal blocks corresponding to any one of the X physical random access channel opportunities is different, the Q physical random access channel opportunity groups ultimately determined may be different.

[0309] As a sub-embodiment of the above embodiment, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of random access preambles corresponding to any one synchronization signal block among the multiple synchronization signal blocks corresponding to the X physical random access channel opportunities. That is, if the number of random access preambles corresponding to any one synchronization signal block among the multiple synchronization signal blocks corresponding to the X physical random access channel opportunities is different, the Q physical random access channel opportunity groups finally determined may be different.

[0310] As a sub-embodiment of the above embodiment, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of frequency-division multiplexed physical random access channel opportunities in a time period and the number of synchronization signal blocks corresponding to any physical random access channel opportunity of the X physical random access channel opportunities.

[0311] As a sub-embodiment of the above embodiment, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of frequency-division multiplexed physical random access channel opportunities in a time period, the number of synchronization signal blocks corresponding to any one of the X physical random access channel opportunities, and the number of random access preambles corresponding to any one of the multiple synchronization signal blocks corresponding to the X physical random access channel opportunities.

[0312] As an embodiment, after completing the mapping from RO to ROG, the first node may select one or more of the determined ROGs for random access. This process is described below with reference to FIG8 .

[0313] Figure 8 is a flow chart of a method in a node used for wireless communication provided by another embodiment of the present application. The method shown in Figure 8 is described from the perspective of the interaction between the first node and the second node. The introduction of the first node and the second node can be found in the previous text and will not be repeated here.

[0314] The method shown in FIG. 8 may include steps S810 to S830 .

[0315] In step S810, a first node receives first information, which is used to determine X physical random access channel opportunities.

[0316] In step S820, the first node receives second information, and the second information is used to determine a plurality of candidate values.

[0317] For the relevant introduction of step S810 and step S820, please refer to the detailed introduction of step S510 and step S520 above, which will not be repeated here for the sake of brevity.

[0318] In step S830 , the first node sends a plurality of random access preambles on a first physical random access channel opportunity group.

[0319] As an embodiment, the first node sends multiple random access preambles to the second node on the first physical random access channel opportunity group.

[0320] As an embodiment, at least two random access preambles among the multiple random access preambles are the same.

[0321] As an embodiment, any two random access preambles among the multiple random access preambles are the same. That is, during the multiple PRACH transmission process, the same random access preamble can be repeatedly sent on the first physical random access channel opportunity group to enhance the coverage capability of the PRACH.

[0322] As an embodiment, the first physical random access channel opportunity group is one of the Q physical random access channel opportunity groups. For example, the first physical random access channel opportunity group is any one of the Q physical random access channel opportunity groups.

[0323] As an embodiment, the first physical random access channel opportunity group includes one or more physical random access channel opportunities, and the one or more physical random access channel opportunities included in the first physical random access channel opportunity group are used to send the multiple random access preambles.

[0324] In one embodiment, the first physical random access channel opportunity group includes only one physical random access channel opportunity, and the one physical random access channel opportunity included in the first physical random access channel opportunity group is used to send a random access preamble. In other words, the first physical random access channel opportunity group includes only one physical random access channel opportunity, and the one random access preamble is sent on the one physical random access channel opportunity included in the first physical random access channel opportunity group.

[0325] In one embodiment, the first physical random access channel opportunity group includes multiple physical random access channel opportunities, and the multiple physical random access channel opportunities included in the first physical random access channel opportunity group are used to respectively transmit multiple random access preambles. In other words, the first physical random access channel opportunity group includes multiple physical random access channel opportunities, and multiple random access preambles are respectively transmitted on the multiple physical random access channel opportunities included in the first physical random access channel opportunity group.

[0326] As an embodiment, the first sequence is used to generate the multiple random access preambles. In other words, the multiple random access preambles sent on the first physical random access channel opportunity group are generated using the first sequence.

[0327] The embodiment of the present application does not specifically limit the first sequence for generating the multiple random access preambles. As an embodiment, the first sequence can be some sequences with good mutual correlation and autocorrelation characteristics. Several examples of first sequences are given below.

[0328] In one embodiment, the first sequence is a pseudorandom sequence. In another embodiment, the first sequence is an M sequence. In yet another embodiment, the first sequence is a Gold sequence. However, the present application is not limited thereto. For example, the first sequence may also be one or more of a Kasami sequence, a Barker sequence, a Zadoff-Chu sequence, and the like.

[0329] As an embodiment, the first sequence is a single sequence, for example, the first sequence is an M sequence, or the first sequence is a Gold sequence, etc.

[0330] As an embodiment, the first sequence is a combination of multiple sequences, for example, the first sequence is a combination of a pseudo-random sequence and an M sequence, or the first sequence is a combination of a pseudo-random sequence and a Gold sequence, etc.

[0331] As an embodiment, the X physical random access channel opportunities mentioned above are located in the same period. In other words, the X physical random access channel opportunities are all located in the first period.

[0332] As an embodiment, the first period refers to a mapping period (mapping cycle) of physical random access channel opportunities to physical random access channel opportunity groups.

[0333] As an embodiment, the first period refers to the mapping period of the synchronization signal block to the physical random access channel opportunity.

[0334] As an embodiment, the mapping period of the synchronization signal block to the physical random access channel opportunity and the mapping period of the physical random access channel opportunity to the physical random access channel opportunity group are the same period.

[0335] As an embodiment, the first period refers to an association period for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups.

[0336] As an embodiment, the first period refers to an association period for mapping multiple candidate synchronization signal block indexes to the X physical random access channel opportunities.

[0337] As an embodiment, the association period for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups and the association period for mapping multiple candidate synchronization signal block indices to the X physical random access channel opportunities are the same period.

[0338] As an embodiment, the first period refers to an association pattern period including one or more association periods.

[0339] As an embodiment, the first period refers to the PRACH configuration period.

[0340] As an embodiment, the first period is the minimum value in a set determined by the PRACH configuration period.

[0341] As an embodiment, the set of PRACH configuration period determinations can be referred to Table 1, that is, the value of the first period can be determined according to Table 1.

[0342] Table 1

[0343] As an embodiment, the first cycle starts from frame number 0.

[0344] As an embodiment, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is performed within the first period.

[0345] As an embodiment, the first cycle includes one or more PRACH time slots. Taking the example of the first cycle including multiple PRACH time slots, the first cycle may include any number of 2 or more PRACH time slots.

[0346] As an embodiment, any physical random access channel opportunity among the X physical random access channel opportunities belongs to one of the multiple PRACH time slots included in the first period.

[0347] As an embodiment, the first period includes multiple physical random access channel opportunities.

[0348] As mentioned above, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to the multiple candidate values. The following describes how to determine the number of physical random access channel opportunity groups corresponding to the multiple candidate values.

[0349] Figure 9 is a flow chart of a method in a node used for wireless communication provided by another embodiment of the present application. The method shown in Figure 9 is described from the perspective of the interaction between the first node and the second node. The introduction of the first node and the second node can be found in the previous text and will not be repeated here.

[0350] The method shown in FIG. 9 may include steps S910 to S930 .

[0351] In step S910, a first node receives first information, which is used to determine X physical random access channel opportunities.

[0352] In step S920, the first node receives second information, and the second information is used to determine a plurality of candidate values.

[0353] For the relevant introduction of step S910 and step S920, please refer to the detailed introduction of step S510 and step S520 above, which will not be repeated here for the sake of brevity.

[0354] At step S930, the first node receives third information. The third information is used to determine the number of physical random access channel opportunity groups corresponding to at least one candidate value among the multiple candidate values. Alternatively, the third information is used to determine the number of complex PRACH transmissions corresponding to at least one candidate value among the multiple candidate values.

[0355] As an embodiment, the third information is sent by the second node to the first node.

[0356] As an embodiment, the third information is used to indicate the number of physical random access channel opportunity groups corresponding to at least one candidate value among the multiple candidate values.

[0357] As an embodiment, the third information is used to determine the ratio of the number of physical random access channel opportunity groups in the Q physical random access channel opportunity groups corresponding to the multiple candidate values.

[0358] As an embodiment, the ratio of the number of physical random access channel opportunity groups in the Q physical random access channel opportunity groups corresponding to the multiple candidate values ​​is equal to the first ratio. For the relevant introduction of the first ratio, please refer to the above text and will not be repeated here for the sake of brevity.

[0359] As an embodiment, the third information is used to determine the first ratio.

[0360] As an embodiment, the number of random access preambles corresponding to at least one candidate value among the multiple candidate values ​​is used to determine the Q physical random access channel opportunity groups.

[0361] As an embodiment, the number of random access preambles included in any one of the multiple opportunity group subsets corresponding to at least one candidate value among the multiple candidate values ​​is used to determine the Q physical random access channel opportunity groups.

[0362] As an embodiment, the larger value among the multiple candidate values ​​is preferentially used to determine the Q physical random access channel opportunity groups, and the number of random access preambles corresponding to at least one candidate value among the multiple candidate values ​​is used to determine the Q physical random access channel opportunity groups.

[0363] As an embodiment, the maximum value among the multiple candidate values ​​is preferentially used to determine the Q physical random access channel opportunity groups, and the number of random access preambles corresponding to at least one candidate value among the multiple candidate values ​​is used to determine the Q physical random access channel opportunity groups.

[0364] As an embodiment, the multiple candidate values ​​are used in descending order to determine that the larger value among the multiple candidate values ​​is preferentially used to determine the Q physical random access channel opportunity groups, and the number of random access preambles corresponding to at least one candidate value among the multiple candidate values ​​is used to determine the Q physical random access channel opportunity groups.

[0365] As an embodiment, at least one physical random access channel opportunity group corresponding to any candidate value among the multiple candidate values ​​is mapped according to a first mapping order, and the first mapping order includes one or more of the following: an ascending order of random access preamble index; an ascending order of frequency domain resources; an ascending order of time domain resources.

[0366] As an embodiment, at least one physical random access channel opportunity group corresponding to any candidate value among the multiple candidate values ​​is mapped according to a first mapping order, and the first mapping order includes: first mapping in an ascending order of random access preamble index; then mapping in an ascending order of frequency domain resources; and finally mapping in an ascending order of time domain resources.

[0367] As an embodiment, at least one physical random access channel opportunity group corresponding to the same candidate value is mapped according to the first mapping order.

[0368] As an embodiment, at least one physical random access channel opportunity group corresponding to the same ROG size is mapped according to the first mapping order.

[0369] As an embodiment, after the first node and / or the second node determines the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups, the first node and the second node may subsequently perform random access based on the mapping relationship. For ease of understanding, the following describes the random access process of the first node and the second node using a four-step random access process as an example.

[0370] Figure 10 is a flow chart of a four-step random access process. As shown in Figure 10, the four-step random access process may include steps S1010 to S1040.

[0371] In step S1010 (the first step), the first node sends a random access preamble to the second node. For example, the first node sends multiple random access preambles to the second node on a first physical random access channel opportunity group.

[0372] As an embodiment, the relevant introduction of step S1010 can refer to the relevant introduction of step S830 above.

[0373] As an embodiment, the first node sends multiple random access preambles (also referred to as message 1, Msg1, etc.) to the second node on PRACH resources of the first physical random access channel opportunity group.

[0374] As an embodiment, the first physical random access channel opportunity group is any one physical random access channel opportunity group among the Q physical random access channel opportunity groups.

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

[0376] As an embodiment, the PDCCH may be sent through resources in a Type 1-PDCCH common search space (CSS) on a downlink initial BWP.

[0377] As an embodiment, the PDSCH scheduled by the PDCCH may include a random access response (RAR, also known as message 2, Msg2, etc.) corresponding to the preamble sent by the first node.

[0378] Accordingly, the first node uses the RA-RNTI to detect the PDCCH on the Type 1-PDCCH CSS on the downlink initial BWP. After detecting the PDCCH, the first node determines whether the RAR sent to it by the second node is included based on the PDSCH scheduled by the PDCCH. The RAR may include information such as the uplink grant of Message 3 (Msg3), the timing advance command (TA command), and the temporary cell RNTI (TC-RNTI).

[0379] As an embodiment, the Type 1-PDCCH CSS is configured by the second node through a system message and / or a higher layer parameter.

[0380] In step S1030 (third step), after receiving the RAR, the first node sends message 3 (Msg3) on the uplink resource indicated by the RAR.

[0381] As an embodiment, this step supports HARQ retransmission. That is, if the second node does not correctly receive Msg3, the second node can use the TC-RNTI scrambled PDCCH to schedule the retransmission of Msg3. The PDCCH can carry DCI format 0_0.

[0382] In step S1040 (fourth step), the second node sends a message 4 (Msg4) to the first node, which includes a contention resolution message.

[0383] As an embodiment, this step supports HARQ retransmission. If the first node does not correctly receive Msg4, the second node can use the PDCCH scrambled by TC-RNTI to schedule the retransmission of Msg4. The PDCCH can carry DCI format 1_0. If the first node correctly receives Msg4 and determines that Msg4 is the message of the first node, the random access process of the first node is successful. Otherwise, the random access process fails. The first node needs to initiate the random access process again from the first step.

[0384] The method embodiment of the present application is described in detail above in conjunction with Figures 1 to 10 . The device embodiment of the present application is described in detail below in conjunction with Figures 11 to 14 . It should be understood that the description of the method embodiment corresponds to the description of the device embodiment. Therefore, for parts not described in detail, reference can be made to the above method embodiment.

[0385] FIG11 is a schematic diagram of a node structure used for wireless communication according to an embodiment of the present application. The node 1100 shown in FIG11 can be any of the first nodes described above. The node 1100 can include a first receiver 1110 and a second receiver 1120.

[0386] The first receiver 1110 can be used to receive first information, where the first information is used to determine X physical random access channel opportunities, where the X physical random access channel opportunities are mapped to Q physical random access channel opportunity groups, where X is a positive integer greater than 1, and Q is a positive integer.

[0387] The second receiver 1120 can be used to receive second information, where the second information is used to determine multiple candidate values; the number of physical random access channel opportunities included in any physical random access channel opportunity group among the Q physical random access channel opportunity groups is one of the multiple candidate values; wherein the multiple candidate values ​​include a first candidate value and a second candidate value, and the larger value of the first candidate value and the second candidate value is preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups; and / or, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to the multiple candidate values.

[0388] As an embodiment, the first node also includes: a first transmitter 1130, sending multiple random access preambles on a first physical random access channel opportunity group; wherein the first physical random access channel opportunity group is one of the Q physical random access channel opportunity groups, and a first sequence is used to generate each random access preamble in the multiple random access preambles.

[0389] As an embodiment, the X physical random access channel opportunities are all located in the first period.

[0390] As an embodiment, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are orthogonal in the time domain; or, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are associated with the same synchronization signal block; or, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are orthogonal in the time domain and are associated with the same synchronization signal block.

[0391] As an embodiment, the multiple candidate values ​​are used in descending order for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups.

[0392] As an embodiment, each timing group subset in the multiple timing group subsets includes Q1 physical random access channel timing groups in the Q physical random access channel timing groups; any candidate value in the multiple candidate values ​​corresponds to at least one physical random access channel timing group in the Q1 physical random access channel timing groups included in each timing group subset in the multiple timing group subsets; the number of physical random access channel timing groups in any two timing group subsets in the multiple timing group subsets corresponding to any candidate value in the multiple candidate values ​​is equal.

[0393] As an embodiment, the number of physical random access channel opportunity groups in each opportunity group subset of the multiple opportunity group subsets to which the multiple candidate values ​​respectively correspond is in a first ratio.

[0394] As an embodiment, any one of the multiple opportunity group subsets includes X1 physical random access opportunities among the X physical random access channel opportunities; in each opportunity group subset of the multiple opportunity group subsets, the multiple candidate values ​​are used in descending order to map the X1 physical random access channel opportunities to the Q1 physical random access channel opportunity groups.

[0395] As an embodiment, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to one or more of the following information: the number of frequency-division multiplexed physical random access channel opportunities within a time period; the number of synchronization signal blocks corresponding to any physical random access channel opportunity among the X physical random access channel opportunities; and the number of random access preambles corresponding to any synchronization signal block among the multiple synchronization signal blocks corresponding to the X physical random access channel opportunities.

[0396] As an embodiment, the first node further includes: a third receiver 1140, which receives third information, and the third information is used to determine the number of physical random access channel opportunity groups corresponding to at least one candidate value among the multiple candidate values.

[0397] As an embodiment, the number of random access preambles corresponding to at least one candidate value among the multiple candidate values ​​is used to determine the Q physical random access channel opportunity groups.

[0398] As an embodiment, at least one physical random access channel opportunity group corresponding to any candidate value among the multiple candidate values ​​is mapped according to a first mapping order, and the first mapping order includes one or more of the following: an ascending order of random access preamble index; an ascending order of frequency domain resources; an ascending order of time domain resources.

[0399] As an embodiment, the first information is used to determine the X physical random access channel opportunities, including at least one of the following: the first information is used to determine the number of synchronization signal blocks corresponding to each physical random access channel opportunity in the X physical random access channel opportunities; the first information is used to determine the number of random access preambles corresponding to the synchronization signal block corresponding to each physical random access channel opportunity.

[0400] As an embodiment, any one of the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, and at least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two physical random access channel opportunity groups among the Q physical random access channel opportunity groups is different.

[0401] As an embodiment, any one of the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, the Q physical random access channel opportunity groups respectively correspond to multiple random access preambles, and the random access preambles corresponding to at least two physical random access channel opportunity groups in the Q physical random access channel opportunity groups are different.

[0402] As an embodiment, the first receiver 1110 and the second receiver 1120 may be transceivers 1330. The node 1100 may further include a processor 1310 and a memory 1320, as specifically shown in FIG13 .

[0403] FIG12 is a schematic diagram of a node structure used for wireless communication according to another embodiment of the present application. The node 1200 shown in FIG12 can be any of the second nodes described above. The node 1200 can include a second transmitter 1210 and a third transmitter 1220.

[0404] The second transmitter 1210 can be used to send first information, where the first information is used to determine X physical random access channel opportunities, where the X physical random access channel opportunities are mapped to Q physical random access channel opportunity groups, where X is a positive integer greater than 1, and Q is a positive integer.

[0405] The third transmitter 1220 can be used to send second information, where the second information is used to determine multiple candidate values; the number of physical random access channel opportunities included in any physical random access channel opportunity group among the Q physical random access channel opportunity groups is one of the multiple candidate values; wherein the multiple candidate values ​​include a first candidate value and a second candidate value, and the larger value of the first candidate value and the second candidate value is preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups; and / or, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to the multiple candidate values.

[0406] As an embodiment, the second node also includes: a fourth receiver 1230, receiving multiple random access preambles, wherein the multiple random access preambles are sent on a first physical random access channel opportunity group; wherein the first physical random access channel opportunity group is one of the Q physical random access channel opportunity groups, and the first sequence is used to generate each random access preamble in the multiple random access preambles.

[0407] As an embodiment, the X physical random access channel opportunities are all located in the first period.

[0408] As an embodiment, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are orthogonal in the time domain; or, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are associated with the same synchronization signal block; or, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are orthogonal in the time domain and associated with the same synchronization signal block.

[0409] As an embodiment, the multiple candidate values ​​are used in descending order for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups.

[0410] As an embodiment, each timing group subset in the multiple timing group subsets includes Q1 physical random access channel timing groups in the Q physical random access channel timing groups; any candidate value in the multiple candidate values ​​corresponds to at least one physical random access channel timing group in the Q1 physical random access channel timing groups included in each timing group subset in the multiple timing group subsets; the number of physical random access channel timing groups in any two timing group subsets in the multiple timing group subsets corresponding to any candidate value in the multiple candidate values ​​is equal.

[0411] As an embodiment, the number of physical random access channel opportunity groups in each opportunity group subset of the multiple opportunity group subsets to which the multiple candidate values ​​respectively correspond is in a first ratio.

[0412] As an embodiment, any one of the multiple opportunity group subsets includes X1 physical random access channel opportunities among the X physical random access channel opportunities; in each opportunity group subset of the multiple opportunity group subsets, the multiple candidate values ​​are used in descending order to map the X1 physical random access channel opportunities to the Q1 physical random access channel opportunity groups.

[0413] As an embodiment, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to one or more of the following information: the number of frequency-division multiplexed physical random access channel opportunities within a time period; the number of synchronization signal blocks corresponding to any physical random access channel opportunity among the X physical random access channel opportunities; and the number of random access preambles corresponding to any synchronization signal block among the multiple synchronization signal blocks corresponding to the X physical random access channel opportunities.

[0414] As an embodiment, the second node further includes: a fourth transmitter 1240, which sends third information, and the third information is used to determine the number of physical random access channel opportunity groups corresponding to at least one candidate value among the multiple candidate values.

[0415] As an embodiment, the number of random access preambles corresponding to at least one candidate value among the multiple candidate values ​​is used to determine the Q physical random access channel opportunity groups.

[0416] As an embodiment, at least one physical random access channel opportunity group corresponding to any candidate value among the multiple candidate values ​​is mapped according to a first mapping order, and the first mapping order includes one or more of the following: an ascending order of random access preamble index; an ascending order of frequency domain resources; an ascending order of time domain resources.

[0417] As an embodiment, the first information is used to determine the X physical random access channel opportunities, including at least one of the following: the first information is used to determine the number of synchronization signal blocks corresponding to each physical random access channel opportunity in the X physical random access channel opportunities; the first information is used to determine the number of random access preambles corresponding to the synchronization signal block corresponding to each physical random access channel opportunity.

[0418] As an embodiment, any one of the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, and at least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two physical random access channel opportunity groups among the Q physical random access channel opportunity groups is different.

[0419] As an embodiment, any one of the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, the Q physical random access channel opportunity groups respectively correspond to multiple random access preambles, and the random access preambles corresponding to at least two physical random access channel opportunity groups in the Q physical random access channel opportunity groups are different.

[0420] As an embodiment, the second transmitter 1210 and the third transmitter 1220 may be a transceiver 1330. The node 1200 may further include a processor 1310 and a memory 1320, as specifically shown in FIG13 .

[0421] Figure 13 is a schematic block diagram of a communication device according to an embodiment of the present application. The dashed lines in Figure 13 indicate that the unit or module is optional. Apparatus 1300 may be used to implement the method described in the above method embodiment. Apparatus 1300 may be a chip, user equipment, or network equipment.

[0422] The device 1300 may include one or more processors 1310. The processor 1310 may support the device 1300 to implement the method described in the above method embodiment. The processor 1310 may be a general-purpose processor or a special-purpose processor. For example, the processor may be a central processing unit (CPU). Alternatively, the processor may be another general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware component, etc. The general-purpose processor may be a microprocessor or the processor may be any conventional processor, etc.

[0423] The apparatus 1300 may further include one or more memories 1320. The memories 1320 store programs that can be executed by the processor 1310, causing the processor 1310 to perform the methods described in the above method embodiments. The memories 1320 may be independent of the processor 1310 or integrated into the processor 1310.

[0424] The apparatus 1300 may further include a transceiver 1330. The processor 1310 may communicate with other devices or chips via the transceiver 1330. For example, the processor 1310 may transmit and receive data with other devices or chips via the transceiver 1330.

[0425] Figure 14 is a schematic diagram of the hardware modules of a communication device provided in an embodiment of the present application. Specifically, Figure 14 shows a block diagram of a first communication device 450 and a second communication device 410 communicating with each other in an access network.

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

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

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

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

[0430] During transmission from the first communications device 450 to the second communications device 410, upper layer data packets are provided to the controller / processor 459 at the first communications device 450 using a data source 467. The data source 467 represents all protocol layers above the L2 layer. Similar to the transmission functionality at the second communications device 410 described in the transmission from the second communications device 410 to the first communications device 450, the controller / processor 459 implements header compression, encryption, packet segmentation and reordering, and multiplexing between logical and transport channels, implementing L2 layer functions for both the user plane and the control plane. The controller / processor 459 is also responsible for retransmission of lost packets and signaling to the second communications device 410. The transmit processor 468 performs modulation mapping and channel coding, while the multi-antenna transmit processor 457 performs digital multi-antenna spatial precoding, including codebook-based and non-codebook-based precoding, and beamforming. The transmit processor 468 then modulates the resulting spatial stream into a multi-carrier / single-carrier symbol stream. After analog precoding and beamforming operations in the multi-antenna transmit processor 457, the stream is provided to different antennas 452 via the transmitter 454. Each transmitter 454 first converts the baseband symbol stream provided by the multi-antenna transmit processor 457 into a RF symbol stream before providing it to the antenna 452.

[0431] During transmission from the first communication device 450 to the second communication device 410, the functionality at the second communication device 410 is similar to the reception functionality at the first communication device 450 described for transmission from the second communication device 410 to the first communication device 450. Each receiver 418 receives RF signals via its corresponding antenna 420, converts the received RF signals into baseband signals, and provides the baseband signals to the multi-antenna receive processor 472 and the receive processor 470. The receive processor 470 and the multi-antenna receive processor 472 collectively implement the L1 layer functionality. The controller / processor 475 implements the L2 layer functionality. The controller / processor 475 may be associated with a memory 476 storing program code and data. The memory 476 may be referred to as a computer-readable medium. During transmission from the first communication device 450 to the second communication device 410, the controller / processor 475 provides demultiplexing between transport and logical channels, packet reassembly, decryption, header decompression, and control signal processing to recover upper layer data packets from the first communication device 450. The controller / processor 475 may provide upper layer data packets to the core network or all protocol layers above the L2 layer, and may also provide various control signals to the core network or L3 for L3 processing.

[0432] As an embodiment, the first communication device 450 includes: at least one processor and at least one memory, the at least one memory including computer program code; the at least one memory and the computer program code being configured to be used with the at least one processor, wherein the first communication device 450 at least: receives first information, the first information being used to determine X physical random access channel opportunities, the X physical random access channel opportunities being mapped to Q physical random access channel opportunity groups, where X is a positive integer greater than 1, and Q is a positive integer; receives second information, the second information being used to determine a plurality of candidate values; the number of physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups is one of the plurality of candidate values; the plurality of candidate values ​​including a first candidate value and a second candidate value, the larger of the first candidate value and the second candidate value being preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups; and / or the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to the plurality of candidate values.

[0433] As an embodiment, the first communication device 450 apparatus includes: a memory storing a computer-readable instruction program, wherein the computer-readable instruction program generates actions when executed by at least one processor, the actions including: receiving first information, the first information being used to determine X physical random access channel opportunities, the X physical random access channel opportunities being mapped to Q physical random access channel opportunity groups, where X is a positive integer greater than 1 and Q is a positive integer; receiving second information, the second information being used to determine multiple candidate values; the number of physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups is one of the multiple candidate values; wherein the multiple candidate values ​​include a first candidate value and a second candidate value, the larger value of the first candidate value and the second candidate value being preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups; and / or, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to the multiple candidate values.

[0434] As an embodiment, the first communication device 450 corresponds to the first node in this application.

[0435] As an embodiment, the second communication device 410 corresponds to the second node in this application.

[0436] As an embodiment, the first communication device 450 is an NCR.

[0437] As an embodiment, the first communication device 450 is a wireless repeater.

[0438] As an embodiment, the first communication device 450 is a relay.

[0439] As an embodiment, the first communication device 450 is a user equipment, which can serve as a relay node.

[0440] As an embodiment, the first communication device 450 is a user equipment supporting V2X, which can serve as a relay node.

[0441] As an embodiment, the first communication device 450 is a user equipment supporting D2D, and the user equipment can serve as a relay node.

[0442] As an embodiment, the second communication device 410 is a base station.

[0443] As an embodiment, the antenna 452, the receiver 454, the multi-antenna receiving processor 458, the receiving processor 456, and the controller / processor 459 are used to receive the first information and / or the second information in this application.

[0444] As an embodiment, the antenna 420, the transmitter 418, the multi-antenna transmit processor 471, the transmit processor 416, and the controller / processor 475 are used to send the first information and / or the second information in this application.

[0445] The present application also provides a computer-readable storage medium for storing a program. The computer-readable storage medium can be applied to a terminal or network device provided in the present application, and the program enables a computer to execute the method performed by the terminal or network device in each embodiment of the present application.

[0446] The present application also provides a computer program product. The computer program product includes a program. The computer program product can be applied to a terminal or network device provided in the present application, and the program causes a computer to execute the method performed by the terminal or network device in each embodiment of the present application.

[0447] The embodiments of the present application also provide a computer program. The computer program can be applied to the terminal or network device provided in the embodiments of the present application, and the computer program enables a computer to execute the method performed by the terminal or network device in each embodiment of the present application.

[0448] It should be understood that the terms "system" and "network" in this application can be used interchangeably. In addition, the terms used in this application are only used to explain the specific embodiments of this application and are not intended to limit this application. The terms "first", "second", "third", and "fourth" in the specification and claims of this application and the accompanying drawings are used to distinguish different objects rather than to describe a specific order. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions.

[0449] In the embodiments of this application, the term "indication" may refer to a direct indication, an indirect indication, or an indication of an association. For example, "A indicates B" may refer to a direct indication of B, e.g., B can obtain information through A; it may refer to an indirect indication of B, e.g., A indicates C, e.g., B can obtain information through C; or it may refer to an association between A and B.

[0450] In the embodiment of the present application, "B corresponding to A" means that B is associated with A and 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 B can also be determined based on A and / or other information.

[0451] In the embodiments of the present application, the term "corresponding" may indicate a direct or indirect correspondence between the two, or an association relationship between the two, or a relationship between indication and indication, configuration and configuration, etc.

[0452] In the embodiments of the present application, "pre-defined" or "pre-configured" may be implemented by pre-storing corresponding codes, tables, or other methods that can be used to indicate relevant information in a device (e.g., including a user device and a network device). The present application does not limit the specific implementation method. For example, pre-defined may refer to information defined in a protocol.

[0453] In the embodiments of the present application, the “protocol” may refer to a standard protocol in the communications field, for example, it may include an LTE protocol, an NR protocol, and related protocols used in future communication systems, and the present application does not limit this.

[0454] In the embodiments of this application, the term "and / or" is simply a description of the association relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in this document generally indicates that the related objects are in an "or" relationship.

[0455] In various embodiments of the present application, the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0456] In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0457] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0458] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0459] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the process or function described in the embodiment of the present application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions can be transmitted from one website, computer, server or data center to another website, computer, server or data center via a wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) method. The computer-readable storage medium can be any available medium that can be read by a computer or a data storage device such as a server or data center that includes one or more available media integrated therein. The available medium may be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a digital versatile disc (DVD)), or a semiconductor medium (eg, a solid state disk (SSD)).

[0460] The above description is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of this application. Therefore, the scope of protection of this application should be based on the scope of protection of the claims.

Claims

1. A first node used for wireless communication, characterized in that: include: A first receiver receives first information, where the first information is used to determine X physical random access channel opportunities, where the X physical random access channel opportunities are mapped to Q physical random access channel opportunity groups, where X is a positive integer greater than 1, and Q is a positive integer; A second receiver receives second information, wherein the second information is used to determine a plurality of candidate values; the number of physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups is one of the plurality of candidate values; The multiple candidate values ​​include a first candidate value and a second candidate value, and a larger value of the first candidate value and the second candidate value is preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups; and / or, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to the multiple candidate values ​​respectively.

2. The first node according to claim 1, characterized in that: The first node also includes: A first transmitter sends a plurality of random access preambles on a first physical random access channel opportunity group; The first physical random access channel opportunity group is one of the Q physical random access channel opportunity groups, and the first sequence is used to generate each random access preamble in the multiple random access preambles.

3. The first node according to claim 1 or 2, characterized in that: The X physical random access channel opportunities are all located in the first period.

4. The first node according to any one of claims 1 to 3, characterized in that: The multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are orthogonal in the time domain; or, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are associated with the same synchronization signal block; or, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are orthogonal in the time domain and are associated with the same synchronization signal block.

5. The first node according to any one of claims 1 to 4, characterized in that: The multiple candidate values ​​are used in descending order for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups.

6. The first node according to any one of claims 1 to 5, characterized in that: Each timing group subset in the multiple timing group subsets includes Q1 physical random access channel timing groups among the Q physical random access channel timing groups; any candidate value among the multiple candidate values ​​corresponds to at least one physical random access channel timing group among the Q1 physical random access channel timing groups included in each timing group subset in the multiple timing group subsets; the numbers of physical random access channel timing groups in any two timing group subsets in the multiple timing group subsets corresponding to any candidate value among the multiple candidate values ​​are equal.

7. The first node according to claim 6, characterized in that: The number of physical random access channel opportunity groups in each of the plurality of opportunity group subsets to which the plurality of candidate values ​​respectively correspond is in a first ratio.

8. The first node according to claim 6 or 7, characterized in that: Any one of the multiple opportunity group subsets includes X1 physical random access opportunities among the X physical random access channel opportunities; in each opportunity group subset of the multiple opportunity group subsets, the multiple candidate values ​​are used for mapping the X1 physical random access channel opportunities to the Q1 physical random access channel opportunity groups in descending order.

9. The first node according to any one of claims 1 to 8, characterized in that: The mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to one or more of the following information: The number of frequency division multiplexed physical random access channel opportunities in a time period; the number of synchronization signal blocks corresponding to any one of the X physical random access channel opportunities; and The number of random access preambles corresponding to any synchronization signal block in the multiple synchronization signal blocks corresponding to the X physical random access channel opportunities.

10. The first node according to any one of claims 1 to 9, characterized in that: The first node also includes: A third receiver receives third information, where the third information is used to determine the number of physical random access channel opportunity groups corresponding to at least one candidate value among the multiple candidate values.

11. The first node according to any one of claims 1 to 10, characterized in that: The number of random access preambles corresponding to at least one candidate value among the multiple candidate values ​​is used to determine the Q physical random access channel opportunity groups.

12. The first node according to any one of claims 1 to 11, characterized in that: At least one physical random access channel opportunity group corresponding to any candidate value among the multiple candidate values ​​is mapped according to a first mapping order, and the first mapping order includes one or more of the following: The order of increasing random access preamble index; The order of increasing frequency domain resources; The order of increasing time domain resources.

13. The first node according to any one of claims 1 to 12, characterized in that: The first information is used to determine the X physical random access channel opportunities, including at least one of the following: the first information is used to determine the number of synchronization signal blocks corresponding to each physical random access channel opportunity in the X physical random access channel opportunities; the first information is used to determine the number of random access preambles corresponding to the synchronization signal block corresponding to each physical random access channel opportunity.

14. The first node according to any one of claims 1 to 13, characterized in that: Any one of the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, and at least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two physical random access channel opportunity groups among the Q physical random access channel opportunity groups is different.

15. The first node according to any one of claims 1 to 13, characterized in that: Any one of the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, the Q physical random access channel opportunity groups correspond to multiple random access preambles respectively, and the random access preambles corresponding to at least two physical random access channel opportunity groups of the Q physical random access channel opportunity groups are different.

16. A second node used for wireless communication, characterized in that: include: A second transmitter sends first information, where the first information is used to determine X physical random access channel opportunities, where the X physical random access channel opportunities are mapped to Q physical random access channel opportunity groups, where X is a positive integer greater than 1, and Q is a positive integer; A third transmitter sends second information, where the second information is used to determine a plurality of candidate values; the number of physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups is one of the plurality of candidate values; The multiple candidate values ​​include a first candidate value and a second candidate value, and a larger value of the first candidate value and the second candidate value is preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups; and / or, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to the multiple candidate values ​​respectively.

17. The second node according to claim 16, characterized in that: The second node also includes: a fourth receiver, receiving a plurality of random access preambles, wherein the plurality of random access preambles are sent on a first physical random access channel opportunity group; The first physical random access channel opportunity group is one of the Q physical random access channel opportunity groups, and the first sequence is used to generate each random access preamble in the multiple random access preambles.

18. The second node according to claim 16 or 17, characterized in that: The X physical random access channel opportunities are all located in the first period.

19. The second node according to any one of claims 16 to 18, characterized in that: The multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are orthogonal in the time domain; or, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are associated with the same synchronization signal block; or, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are orthogonal in the time domain and are associated with the same synchronization signal block.

20. The second node according to any one of claims 16 to 19, characterized in that: The multiple candidate values ​​are used in descending order for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups.

21. The second node according to any one of claims 16 to 20, characterized in that: Each timing group subset in the multiple timing group subsets includes Q1 physical random access channel timing groups among the Q physical random access channel timing groups; any candidate value among the multiple candidate values ​​corresponds to at least one physical random access channel timing group among the Q1 physical random access channel timing groups included in each timing group subset in the multiple timing group subsets; the numbers of physical random access channel timing groups in any two timing group subsets in the multiple timing group subsets corresponding to any candidate value among the multiple candidate values ​​are equal.

22. The second node according to claim 21, characterized in that: The number of physical random access channel opportunity groups in each of the plurality of opportunity group subsets to which the plurality of candidate values ​​respectively correspond is in a first ratio.

23. The second node according to claim 20 or 21, characterized in that: Any one of the multiple opportunity group subsets includes X1 physical random access channel opportunities among the X physical random access channel opportunities; in each opportunity group subset of the multiple opportunity group subsets, the multiple candidate values ​​are used for mapping the X1 physical random access channel opportunities to the Q1 physical random access channel opportunity groups in descending order.

24. The second node according to any one of claims 16 to 23, characterized in that: The mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to one or more of the following information: The number of frequency division multiplexed physical random access channel opportunities in a time period; the number of synchronization signal blocks corresponding to any one of the X physical random access channel opportunities; and The number of random access preambles corresponding to any synchronization signal block in the multiple synchronization signal blocks corresponding to the X physical random access channel opportunities.

25. The second node according to any one of claims 16 to 24, characterized in that: The second node also includes: The fourth transmitter sends third information, where the third information is used to determine the number of physical random access channel opportunity groups corresponding to at least one candidate value among the multiple candidate values.

26. The second node according to any one of claims 16-25, characterized in that: The number of random access preambles corresponding to at least one candidate value among the multiple candidate values ​​is used to determine the Q physical random access channel opportunity groups.

27. The second node according to any one of claims 16-26, characterized in that: At least one physical random access channel opportunity group corresponding to any candidate value among the multiple candidate values ​​is mapped according to a first mapping order, and the first mapping order includes one or more of the following: The order of increasing random access preamble index; The order of increasing frequency domain resources; The order of increasing time domain resources.

28. The second node according to any one of claims 16-27, characterized in that: The first information is used to determine the X physical random access channel opportunities, including at least one of the following: the first information is used to determine the number of synchronization signal blocks corresponding to each physical random access channel opportunity in the X physical random access channel opportunities; the first information is used to determine the number of random access preambles corresponding to the synchronization signal block corresponding to each physical random access channel opportunity.

29. The second node according to any one of claims 16-28, characterized in that: Any one of the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, and at least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two physical random access channel opportunity groups among the Q physical random access channel opportunity groups is different.

30. The second node according to any one of claims 16-28, characterized in that: Any one of the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, the Q physical random access channel opportunity groups correspond to multiple random access preambles respectively, and the random access preambles corresponding to at least two physical random access channel opportunity groups of the Q physical random access channel opportunity groups are different.

31. A method in a first node for wireless communication, characterized in that: include: receiving first information, where the first information is used to determine X physical random access channel opportunities, where the X physical random access channel opportunities are mapped to Q physical random access channel opportunity groups, where X is a positive integer greater than 1, and Q is a positive integer; receiving second information, where the second information is used to determine a plurality of candidate values; the number of physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups is one of the plurality of candidate values; The multiple candidate values ​​include a first candidate value and a second candidate value, and a larger value of the first candidate value and the second candidate value is preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups; and / or, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to the multiple candidate values ​​respectively.

32. The method according to claim 31, characterized in that The method further comprises: Sending a plurality of random access preambles on a first physical random access channel opportunity group; The first physical random access channel opportunity group is one of the Q physical random access channel opportunity groups, and the first sequence is used to generate each random access preamble in the multiple random access preambles.

33. The method according to claim 31 or 32, characterized in that The X physical random access channel opportunities are all located in the first period.

34. The method according to any one of claims 31 to 33, characterized in that The multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are orthogonal in the time domain; or, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are associated with the same synchronization signal block; or, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are orthogonal in the time domain and are associated with the same synchronization signal block.

35. The method according to any one of claims 31 to 34, characterized in that The multiple candidate values ​​are used in descending order for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups.

36. The method according to any one of claims 31 to 35, characterized in that Each timing group subset in the multiple timing group subsets includes Q1 physical random access channel timing groups among the Q physical random access channel timing groups; any candidate value among the multiple candidate values ​​corresponds to at least one physical random access channel timing group among the Q1 physical random access channel timing groups included in each timing group subset in the multiple timing group subsets; the numbers of physical random access channel timing groups in any two timing group subsets in the multiple timing group subsets corresponding to any candidate value among the multiple candidate values ​​are equal.

37. The method according to claim 36, characterized in that The number of physical random access channel opportunity groups in each of the plurality of opportunity group subsets to which the plurality of candidate values ​​respectively correspond is in a first ratio.

38. The method according to claim 36 or 37, characterized in that Any one of the multiple opportunity group subsets includes X1 physical random access opportunities among the X physical random access channel opportunities; in each opportunity group subset of the multiple opportunity group subsets, the multiple candidate values ​​are used for mapping the X1 physical random access channel opportunities to the Q1 physical random access channel opportunity groups in descending order.

39. The method according to any one of claims 31 to 38, characterized in that The mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to one or more of the following information: The number of frequency division multiplexed physical random access channel opportunities in a time period; the number of synchronization signal blocks corresponding to any one of the X physical random access channel opportunities; and The number of random access preambles corresponding to any synchronization signal block in the multiple synchronization signal blocks corresponding to the X physical random access channel opportunities.

40. The method according to any one of claims 31 to 39, characterized in that The method further comprises: Third information is received, where the third information is used to determine the number of physical random access channel opportunity groups corresponding to at least one candidate value among the multiple candidate values.

41. The method according to any one of claims 31 to 40, characterized in that The number of random access preambles corresponding to at least one candidate value among the multiple candidate values ​​is used to determine the Q physical random access channel opportunity groups.

42. The method according to any one of claims 31 to 41, characterized in that At least one physical random access channel opportunity group corresponding to any candidate value among the multiple candidate values ​​is mapped according to a first mapping order, and the first mapping order includes one or more of the following: The order of increasing random access preamble index; The order of increasing frequency domain resources; The order of increasing time domain resources.

43. The method according to any one of claims 31 to 42, characterized in that The first information is used to determine the X physical random access channel opportunities, including at least one of the following: the first information is used to determine the number of synchronization signal blocks corresponding to each physical random access channel opportunity in the X physical random access channel opportunities; the first information is used to determine the number of random access preambles corresponding to the synchronization signal block corresponding to each physical random access channel opportunity.

44. The method according to any one of claims 31 to 43, characterized in that Any one of the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, and at least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two physical random access channel opportunity groups among the Q physical random access channel opportunity groups is different.

45. The method according to any one of claims 31 to 43, characterized in that Any one of the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, the Q physical random access channel opportunity groups correspond to multiple random access preambles respectively, and the random access preambles corresponding to at least two physical random access channel opportunity groups of the Q physical random access channel opportunity groups are different.

46. ​​A method in a second node for wireless communication, characterized in that: include: Sending first information, where the first information is used to determine X physical random access channel opportunities, where the X physical random access channel opportunities are mapped to Q physical random access channel opportunity groups, where X is a positive integer greater than 1, and Q is a positive integer; sending second information, where the second information is used to determine a plurality of candidate values; the number of physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups is one of the plurality of candidate values; The multiple candidate values ​​include a first candidate value and a second candidate value, and a larger value of the first candidate value and the second candidate value is preferentially used for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups; and / or, the mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to the number of physical random access channel opportunity groups corresponding to the multiple candidate values ​​respectively.

47. The method according to claim 46, characterized in that The method further comprises: receiving a plurality of random access preambles, the plurality of random access preambles being sent on a first physical random access channel opportunity group; The first physical random access channel opportunity group is one of the Q physical random access channel opportunity groups, and the first sequence is used to generate each random access preamble in the multiple random access preambles.

48. The method according to claim 46 or 47, characterized in that The X physical random access channel opportunities are all located in the first period.

49. The method according to any one of claims 46 to 48, characterized in that The multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are orthogonal in the time domain; or, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are associated with the same synchronization signal block; or, the multiple physical random access channel opportunities included in any one of the Q physical random access channel opportunity groups are orthogonal in the time domain and are associated with the same synchronization signal block.

50. The method according to any one of claims 46 to 49, characterized in that The multiple candidate values ​​are used in descending order for mapping the X physical random access channel opportunities to the Q physical random access channel opportunity groups.

51. The method according to any one of claims 46 to 50, characterized in that Each timing group subset in the multiple timing group subsets includes Q1 physical random access channel timing groups among the Q physical random access channel timing groups; any candidate value among the multiple candidate values ​​corresponds to at least one physical random access channel timing group among the Q1 physical random access channel timing groups included in each timing group subset in the multiple timing group subsets; the numbers of physical random access channel timing groups in any two timing group subsets in the multiple timing group subsets corresponding to any candidate value among the multiple candidate values ​​are equal.

52. The method according to claim 51, characterized in that The number of physical random access channel opportunity groups in each of the plurality of opportunity group subsets to which the plurality of candidate values ​​respectively correspond is in a first ratio.

53. The method according to claim 50 or 51, characterized in that Any one of the multiple opportunity group subsets includes X1 physical random access channel opportunities among the X physical random access channel opportunities; in each opportunity group subset of the multiple opportunity group subsets, the multiple candidate values ​​are used for mapping the X1 physical random access channel opportunities to the Q1 physical random access channel opportunity groups in descending order.

54. The method according to any one of claims 46 to 53, characterized in that The mapping of the X physical random access channel opportunities to the Q physical random access channel opportunity groups is related to one or more of the following information: The number of frequency division multiplexed physical random access channel opportunities in a time period; the number of synchronization signal blocks corresponding to any one of the X physical random access channel opportunities; and The number of random access preambles corresponding to any synchronization signal block in the multiple synchronization signal blocks corresponding to the X physical random access channel opportunities.

55. The method according to any one of claims 46 to 54, characterized in that The method further comprises: Sending third information, where the third information is used to determine the number of physical random access channel opportunity groups corresponding to at least one candidate value among the multiple candidate values.

56. The method according to any one of claims 46 to 55, characterized in that The number of random access preambles corresponding to at least one candidate value among the multiple candidate values ​​is used to determine the Q physical random access channel opportunity groups.

57. The method according to any one of claims 46 to 56, characterized in that At least one physical random access channel opportunity group corresponding to any candidate value among the multiple candidate values ​​is mapped according to a first mapping order, and the first mapping order includes one or more of the following: The order of increasing random access preamble index; The order of increasing frequency domain resources; The order of increasing time domain resources.

58. The method according to any one of claims 46 to 57, characterized in that The first information is used to determine the X physical random access channel opportunities, including at least one of the following: the first information is used to determine the number of synchronization signal blocks corresponding to each physical random access channel opportunity in the X physical random access channel opportunities; the first information is used to determine the number of random access preambles corresponding to the synchronization signal block corresponding to each physical random access channel opportunity.

59. The method according to any one of claims 46 to 58, characterized in that Any one of the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, and at least one physical random access channel opportunity among the multiple physical random access channel opportunities included in at least two physical random access channel opportunity groups among the Q physical random access channel opportunity groups is different.

60. The method according to any one of claims 46 to 58, characterized in that Any one of the Q physical random access channel opportunity groups includes multiple physical random access channel opportunities, the Q physical random access channel opportunity groups correspond to multiple random access preambles respectively, and the random access preambles corresponding to at least two physical random access channel opportunity groups of the Q physical random access channel opportunity groups are different.

61. A node used for wireless communication, characterized in that: It comprises a transceiver, a memory and a processor, wherein the memory is used to store a program, and the processor is used to call the program in the memory and control the transceiver to receive or send a signal so that the node executes the method as described in any one of claims 31-45 or 46-60.

62. A device, characterized in that It comprises a processor, which is used to call a program from a memory so that the device executes the method as described in any one of claims 31-45 or 46-60.

63. A chip, characterized in that: It comprises a processor, which is used to call a program from a memory, so that a device equipped with the chip executes a method as described in any one of claims 31-45 or 46-60.

64. A computer-readable storage medium, characterized in that A program is stored thereon, the program causing a computer to execute the method as claimed in any one of claims 31-45 or 46-60.

65. A computer program product, characterized in that It comprises a program which causes a computer to execute the method as claimed in any one of claims 31-45 or 46-60.

66. A computer program, characterized in that The computer program causes a computer to execute the method according to any one of claims 31-45 or 46-60.

Images