FIRST NODE FOR WIRELESS COMMUNICATION, METHOD FOR A NODE FOR WIRELESS COMMUNICATION AND ONE OR MORE COMPUTER-READABLE NON-TRANSIENT STORAGE MEDIA

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

1 / 103 “FIRST NODE FOR WIRELESS COMMUNICATION, METHOD FOR A NODE FOR WIRELESS COMMUNICATION AND ONE OR MORE COMPUTER-READABLE NON-TRANSIENT STORAGE MEDIA” Technical Field

[001] The embodiments of the present disclosure relate to the field of communication technology and, in particular, to a method and a device applicable to a node for wireless communication. Background of the Invention

[002] To improve the coverage performance of a physical random access channel (PRACH), some communication systems (such as a New Radio (NR) system) introduce the PRACH multiple transmission scheme. In the PRACH multiple transmission scheme, a PRACH occasion (RO) can be mapped to a group of ROs (ROG), so as to transmit a plurality of PRACHs on the ROG. In view of this, how to map an RO to an ROG is a problem to be solved. The RO-to-ROG mapping scheme can influence the allocation of PRACH multiple transmission resources or can lead to a large number of orphaned ROs, resulting in wasted resources. Brief Description of the Invention

[003] The embodiments of this disclosure provide a method and a device applicable to a node for wireless communication. Aspects of this disclosure will be illustrated below.

[004] In a first aspect, a first node for wireless communication is provided, including: a first receiver configured to receive a first piece of information, the first piece of information is used to determine X PRACH occasions, where the X PRACH occasions are mapped to Q groups of PRACH occasions, X is a positive integer greater than 1 and Q is a positive integer; and a second receiver configured to receive Petition 870250075847, dated 08 / 27 / 2025, page 10 / 235 2 / 103 a second piece of information, the second piece of information is used to determine a plurality of candidate values, where the number of PRACH occasions in each of the Q groups of PRACH occasions is a corresponding candidate value of the plurality of candidate values. The plurality of candidate values ​​includes a first candidate value and a second candidate value, and a higher value among the first candidate value and the second candidate value is prioritized for mapping the X PRACH occasions to the Q groups of PRACH occasions; and / or the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to the number of groups of PRACH occasions corresponding respectively to each candidate value of the plurality of candidate values.

[005] In some embodiments, the first node further includes: a first transmitter configured to transmit a plurality of random access preambles in a first group of PRACH occasions. The first group of PRACH occasions is one of the Q groups of PRACH occasions, and a first sequence is used to generate each random access preamble from the plurality of random access preambles.

[006] In some embodiments, the X occasions of PRACH are within a first cycle.

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

[008] In some embodiments, the plurality of candidate values ​​is used, in descending order, for mapping the X Petition 870250075847, dated 08 / 27 / 2025, page 11 / 235 3 / 103 PRACH occasions for the Q groups of PRACH occasions.

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

[010] In some embodiments, the quantity of at least one respective group of PRACH occasions in each subset of groups of occasions of the plurality of subsets of groups of PRACH occasions corresponding to a respective candidate value of the plurality of candidate values ​​corresponds to a value, and the values ​​corresponding to the plurality of candidate values ​​are in a first proportion.

[011] In some embodiments, each subset of occasion groups of the plurality of subsets of PRACH occasion groups includes X1 respective PRACH occasions of the X PRACH occasions, and in each subset of occasion groups of the plurality of subsets of PRACH occasion groups, the plurality of candidate values ​​is used, in descending order, for mapping the X1 respective PRACH occasions to the Q1 respective PRACH occasion groups.

[012] In some embodiments, the mapping of X PRACH occasions to Q groups of PRACH occasions is related to one or more of the following: quantity of PRACH occasions multiplexed by Petition 870250075847, dated 08 / 27 / 2025, page 12 / 235 4 / 103 frequency division in a time instance; number of synchronization signal blocks associated with each of the X PRACH occasions; and number of random access preambles corresponding to each of a plurality of synchronization signal blocks associated with the X PRACH occasions.

[013] In some embodiments, the first node also includes: a third receiver configured to receive a third piece of information used to determine the number of PRACH occasion groups corresponding to at least one candidate value from the plurality of candidate values.

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

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

[016] In some embodiments, each of the Q groups of PRACH occasions includes a respective plurality of PRACH occasions, and at least two groups of PRACH occasions from the Q groups of PRACH occasions include at least one PRACH occasion that differs from each other, respectively.

[017] In some embodiments, each of the Q groups of PRACH occasions includes a corresponding plurality of PRACH occasions, the Q groups of PRACH occasions correspond to a plurality Petition 870250075847, dated 08 / 27 / 2025, page 13 / 235 5 / 103 of random access preambles, and the random access preambles corresponding to at least two of the Q groups of PRACH occasions are different from each other.

[018] In a second aspect, a second node for wireless communication is provided, including: a second transmitter, configured to transmit the first information used to determine the X PRACH occasions, wherein the X PRACH occasions are mapped to the Q groups of PRACH occasions, X is a positive integer greater than 1 and Q is a positive integer; and a third transmitter, configured to transmit a second piece of information used to determine a plurality of candidate values, wherein the number of PRACH occasions in each of the Q groups of PRACH occasions is a corresponding candidate value of the plurality of candidate values.The plurality of candidate values ​​includes a first candidate value and a second candidate value, and the higher value among the first candidate value and the second candidate value is prioritized for mapping the X PRACH occasions to the Q groups of PRACH occasions; and / or the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to the number of groups of PRACH occasions corresponding respectively to each candidate value of the plurality of candidate values.

[019] In some embodiments, the second node further includes: a fourth receiver configured to receive a plurality of random access preambles transmitted in a first group of PRACH occasions. The first group of PRACH occasions is one of the Q groups of PRACH occasions, and a first sequence is used to generate each random access preamble from the plurality of random access preambles.

[020] In some embodiments, the X occasions of PRACH Petition 870250075847, dated 08 / 27 / 2025, page 14 / 235 6 / 103 are within a first cycle.

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

[022] In some embodiments, the plurality of candidate values ​​is used, in descending order, for mapping the X PRACH occasions to the Q groups of PRACH occasions.

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

[024] In some embodiments, the quantity of at least one respective group of PRACH occasions in each subset of groups of occasions of the plurality of subsets of groups of PRACH occasions corresponding to a respective candidate value of the plurality of candidate values ​​corresponds to a value, and the values ​​corresponding to the plurality of candidate values ​​are in a first proportion. Petition 870250075847, dated 08 / 27 / 2025, page 15 / 235 7 / 103

[025] In some embodiments, each subset of occasion groups of the plurality of subsets of PRACH occasion groups includes X1 respective PRACH occasions of the X PRACH occasions, and in each subset of occasion groups of the plurality of subsets of PRACH occasion groups, the plurality of candidate values ​​is used, in descending order, for mapping the X1 respective PRACH occasions to the Q1 respective PRACH occasion groups.

[026] In some embodiments, the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to one or more of the following: the number of frequency-division multiplexed PRACH occasions in a time instance; the number of synchronization signal blocks associated with each of the X PRACH occasions; and the number of random access preambles corresponding to each of a plurality of synchronization signal blocks associated with the X PRACH occasions.

[027] In some embodiments, the second node also includes: a fourth transmitter, configured to transmit the third piece of information used to determine the number of PRACH occasion groups corresponding to at least one candidate value from the plurality of candidate values.

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

[029] In some embodiments, at least one group of PRACH occasions corresponding to each of the plurality of candidate values ​​is mapped to a first mapping order, and the first mapping order includes one or more of: an increment order of Petition 870250075847, dated 08 / 27 / 2025, page 16 / 235 8 / 103 random access preamble indices, a frequency resource increment order, and a time resource increment order.

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

[031] In some embodiments, each of the Q groups of PRACH occasions includes a respective plurality of PRACH occasions, and at least two groups of PRACH occasions from the Q groups of PRACH occasions include at least one PRACH occasion that differs from each other, respectively.

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

[033] In a third aspect, a method for wireless communication applicable to a first node is provided, including: receiving a first piece of information used to determine X PRACH occasions, where the X PRACH occasions are mapped to Q groups of PRACH occasions, X is a positive integer greater than 1 and Q is a positive integer; and receiving a second piece of information used to determine a plurality of candidate values, where the number of PRACH occasions in each of the Q groups of PRACH occasions is a corresponding candidate value of the plurality of candidate values. The plurality of candidate values ​​includes a Petition 870250075847, dated 08 / 27 / 2025, page 17 / 235 9 / 103 first candidate value and a second candidate value, and a higher value among the first candidate value and the second candidate value is prioritized for mapping the X PRACH occasions to the Q groups of PRACH occasions; and / or the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to the number of groups of PRACH occasions corresponding respectively to each candidate value of the plurality of candidate values.

[034] In some embodiments, the method further includes: transmitting a plurality of random access preambles in a first group of PRACH occasions. The first group of PRACH occasions is one of the Q groups of PRACH occasions, and a first sequence is used to generate each random access preamble from the plurality of random access preambles.

[035] In some embodiments, the X occasions of PRACH are within a first cycle.

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

[037] In some embodiments, the plurality of candidate values ​​is used, in descending order, for mapping the X PRACH occasions to the Q groups of PRACH occasions.

[038] In some embodiments, each subset of occasion groups of a plurality of subsets of PRACH occasion groups includes Q1 respective PRACH occasion groups of the Q groups Petition 870250075847, dated 08 / 27 / 2025, page 18 / 235 10 / 103 of PRACH occasions, each of the plurality of candidate values ​​corresponds to at least one respective group of PRACH occasions from the Q1 respective groups of PRACH occasions in each subset of groups of occasions from the plurality of subsets of groups of PRACH occasions, and any two subsets of groups of occasions from the plurality of subsets of groups of PRACH occasions corresponding to any of the plurality of candidate values ​​have the same number of groups of PRACH occasions.

[039] In some embodiments, the quantity of at least one respective group of PRACH occasions in each subset of groups of occasions of the plurality of subsets of groups of PRACH occasions corresponding to a respective candidate value of the plurality of candidate values ​​corresponds to a value, and the values ​​corresponding to the plurality of candidate values ​​are in a first proportion.

[040] In some embodiments, each subset of occasion groups of the plurality of subsets of PRACH occasion groups includes X1 respective PRACH occasions of the X PRACH occasions, and in each subset of occasion groups of the plurality of subsets of PRACH occasion groups, the plurality of candidate values ​​is used, in descending order, for mapping the X1 respective PRACH occasions to the Q1 respective PRACH occasion groups.

[041] In some embodiments, the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to one or more of the following: the number of frequency-division multiplexed PRACH occasions in a time instance; the number of synchronization signal blocks associated with each of the X PRACH occasions; and the number of random access preambles corresponding to each of a plurality of synchronization signal blocks associated with the X Petition 870250075847, dated 08 / 27 / 2025, page 19 / 235 11 / 103 occasions of PRACH.

[042] In some embodiments, the method also includes: receiving a third piece of information used to determine the number of PRACH occasion groups corresponding to at least one candidate value from the plurality of candidate values.

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

[044] In some embodiments, at least one group of PRACH occasions corresponding to each of the plurality of candidate values ​​is mapped into a first mapping order, and the first mapping order includes one or more of: an increment order of random access preamble indices, an increment order of frequency features, and an increment order of time features.

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

[046] In some embodiments, each of the Q groups of PRACH occasions includes a respective plurality of PRACH occasions, and at least two groups of PRACH occasions from the Q groups of PRACH occasions include at least one PRACH occasion that differs from each other, respectively.

[047] In some embodiments, each of the Q groups of PRACH occasions includes a respective plurality of occasions Petition 870250075847, dated 08 / 27 / 2025, page 20 / 235 12 / 103 PRACH, the Q groups of PRACH occasions correspond to a plurality of random access preambles, and the random access preambles corresponding to at least two of the Q groups of PRACH occasions are different from each other.

[048] In a fourth aspect, a method is provided for wireless communication applicable to a second node, including: transmitting the first information used to determine the X PRACH occasions, wherein the X PRACH occasions are mapped to the Q groups of PRACH occasions, X is a positive integer greater than 1 and Q is a positive integer; and transmitting a second piece of information used to determine a plurality of candidate values, wherein the quantity of PRACH occasions in each of the Q groups of PRACH occasions is a corresponding candidate value of the plurality of candidate values.The plurality of candidate values ​​includes a first candidate value and a second candidate value, and the higher value among the first candidate value and the second candidate value is prioritized for mapping the X PRACH occasions to the Q groups of PRACH occasions; and / or the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to the number of groups of PRACH occasions corresponding respectively to each candidate value of the plurality of candidate values.

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

[050] In some embodiments, the X occasions of PRACH are within a first cycle. Petition 870250075847, dated 08 / 27 / 2025, page 21 / 235 13 / 103

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

[052] In some embodiments, the plurality of candidate values ​​is used, in descending order, for mapping the X PRACH occasions to the Q groups of PRACH occasions.

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

[054] In some embodiments, the quantity of at least one respective group of PRACH occasions in each subset of groups of occasions of the plurality of subsets of groups of PRACH occasions corresponding to a respective candidate value of the plurality of candidate values ​​corresponds to a value, and the values ​​corresponding to the plurality of candidate values ​​are in a first proportion.

[055] In some embodiments, each subset of Petition 870250075847, dated 08 / 27 / 2025, page 22 / 235 14 / 103 groups of occasions of the plurality of subsets of PRACH occasion groups includes X1 respective PRACH occasions of the X PRACH occasions, and in each subset of groups of occasions of the plurality of subsets of PRACH occasion groups, the plurality of candidate values ​​is used, in descending order, for mapping the X1 respective PRACH occasions to the Q1 respective groups of PRACH occasions.

[056] In some embodiments, the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to one or more of the following: the number of frequency-division multiplexed PRACH occasions in a time instance; the number of synchronization signal blocks associated with each of the X PRACH occasions; and the number of random access preambles corresponding to each of a plurality of synchronization signal blocks associated with the X PRACH occasions.

[057] In some embodiments, the method also includes: transmitting a third piece of information used to determine the number of PRACH occasion groups corresponding to at least one candidate value from the plurality of candidate values.

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

[059] In some embodiments, at least one group of PRACH occasions corresponding to each of the plurality of candidate values ​​is mapped into a first mapping order, and the first mapping order includes one or more of: an increment order of random access preamble indices, an increment order of frequency features, and an increment order of time features. Petition 870250075847, dated 08 / 27 / 2025, page 23 / 235 15 / 103

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

[061] In some embodiments, each of the Q groups of PRACH occasions includes a respective plurality of PRACH occasions, and at least two groups of PRACH occasions from the Q groups of PRACH occasions include at least one PRACH occasion that differs from each other, respectively.

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

[063] In a fifth aspect, a first node for wireless communication is provided, including: a transceiver, a memory, and a processor. The memory is configured to store programs, and the processor is configured to call the programs in memory and control the transceiver to receive or transmit signals, causing the first node to execute the method operations, as illustrated in the third aspect.

[064] In a sixth aspect, a second node for wireless communication is provided, including: a transceiver, a memory, and a processor. The memory is configured to store programs, and the processor is configured to call the programs in memory and control the transceiver to receive or transmit signals, causing the second node to execute the Petition 870250075847, dated 08 / 27 / 2025, page 24 / 235 16 / 103 operations of the method, as illustrated in the fourth aspect.

[065] In a seventh aspect, a communication system is provided, including: the first node and / or the second node, as illustrated above. In some embodiments, the communication system may also include other devices that interact with the first node or the second node in the technical solutions provided in the embodiments of this disclosure.

[066] In an eighth aspect, a computer-readable storage medium is provided. The computer-readable storage medium is configured to store computer programs, which cause a computer to perform some or all of the operations of the method, as illustrated in the aspects above.

[067] In a ninth aspect, a computer program product is provided, including: a non-transient, computer-readable storage medium that stores computer programs, which are executable by one or more processors to cause a computer to perform some or all of the method operations, as illustrated in the aspects above. In some embodiments, the computer program product may be a software installation package.

[068] In a tenth aspect, a computer program is provided, which is executable by one or more processors to cause a computer to perform part or all of the operations of the method, as illustrated in the aspects above.

[069] In an eleventh aspect, a chip is provided, including: a memory and at least one processor. The at least one processor is configured to call and execute computer programs from memory in order to implement some or all of the operations of the methods, as illustrated in the aspects above.

[070] In the ways of carrying out this disclosure, values Petition 870250075847, dated 08 / 27 / 2025, page 25 / 235 17 / 103 relatively large candidates from a plurality of candidate values ​​are prioritized for mapping PRACH occasions to PRACH occasion groups, and / or the number of PRACH occasion groups corresponding respectively to each candidate value from the plurality of candidate values ​​is used for mapping PRACH occasions to PRACH occasion groups. Taking the aforementioned factors into account contributes to optimizing the PRACH occasion mapping scheme to PRACH occasion groups, thus reducing or preventing the generation of orphan PRACH occasions.

[071] The technical solutions in accordance with the methods of implementation of this disclosure contribute to the reduction of resource waste.

[072] The technical solutions in accordance with the implementation methods of this disclosure contribute to optimizing the allocation of resources for multiple PRACH transmissions.

[073] The technical solutions in accordance with the embodiments of this disclosure contribute to improving the performance gain of multiple PRACH transmissions and to increasing the coverage range.

[074] The technical solutions, according to the ways in which this disclosure is made, lead to a reduction in random access latency and an improvement in the efficiency of using random access resources. Brief Description of the Figures

[075] Figure 1 is a schematic diagram of the system architecture of a wireless communication system to which the embodiments of the present disclosure are applicable.

[076] Figure 2 is a schematic diagram of the mapping from RO to ROG.

[077] Figure 3 is another schematic diagram of the mapping Petition 870250075847, dated 08 / 27 / 2025, page 26 / 235 18 / 103 from RO to ROG.

[078] Figure 4 is yet another schematic diagram of the mapping from RO to ROG.

[079] Figure 5 is a flowchart of a method applicable to a node for wireless communication provided in some embodiments of the present disclosure.

[080] Figure 6 is a schematic diagram of an implementation of the RO to ROG mapping according to some embodiments of the present disclosure.

[081] Figure 7 is a schematic diagram of another implementation of the RO to ROG mapping according to some embodiments of the present disclosure.

[082] Figure 8 is a flowchart of another method applicable to a node for wireless communication provided in some embodiments of the present disclosure.

[083] Figure 9 is a flowchart of yet another method applicable to a node for wireless communication provided in some embodiments of the present disclosure.

[084] Figure 10 is a flowchart of yet another method applicable to a node for wireless communication provided in some embodiments of the present disclosure.

[085] Figure 11 is a schematic diagram of the structure of a wireless communication node provided in some embodiments of the present disclosure.

[086] Figure 12 is a schematic diagram of the structure of another node for wireless communication provided in some embodiments of the present disclosure.

[087] Figure 13 is a schematic diagram of the structure of a Petition 870250075847, dated 08 / 27 / 2025, page 27 / 235 19 / 103 device provided in some embodiments of this disclosure.

[088] Figure 14 is a schematic diagram of the hardware modules of a communication device provided in some embodiments of the present disclosure. Detailed Description of the Architectural Implementation Methods of a Communication System

[089] Figure 1 is a schematic diagram of the system architecture of a wireless communication system (100) to which the embodiments of the present disclosure are applicable. 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 implements communication between the network device and the user device (120). The network device (110) may provide communication coverage for specific geographic areas and may communicate with the user device (120) located within the coverage area.

[090] Figure 1 illustrates, by way of example, a network device and two user devices. In some embodiments, the wireless communication system (100) may include a plurality of network devices, and the coverage area of ​​each network device may encompass a different number of user devices, which will not be described in detail in the embodiments of this disclosure.

[091] In some embodiments, the wireless communication system (100) may also include other network entities, such as network controllers, mobile management entities and the like, which will not be described in detail in the embodiments of this disclosure.

[092] It should be understood that the technical solutions in the forms of implementation of this disclosure can be applied to various communication systems, such as 5th generation (5G) systems or New Radio (NR) systems. Petition 870250075847, dated 08 / 27 / 2025, page 28 / 235 20 / 103 Long-Term Evolution (LTE) systems, Frequency Division Duplex (FDD) systems, LTE Time Division Duplex (TDD) systems and the like. The technical solutions provided in this disclosure may also be applied to future communication systems, such as sixth-generation mobile communication systems, satellite communication systems and the like.

[093] It should be understood that, although the technical solutions in the embodiments of this disclosure can be used for random access, they can also be used for beam fault recovery. Furthermore, the technical solutions in the embodiments of this disclosure can be used for the Type 1 random access procedure and also for the Type 2 random access procedure. Furthermore, the technical solutions in the embodiments of this disclosure can be used for Uu interfaces and also for PC5 interfaces. Furthermore, the technical solutions in the embodiments of this disclosure can be used for single-carrier communication and also for multi-carrier communication. Furthermore, the technical solutions in the embodiments of this disclosure can be used for multi-antenna communication and also for single-antenna communication.Furthermore, the technical solutions in the embodiments of this disclosure can be applied to the user equipment and base station scenario, and are also applicable to the vehicle-to-everything (V2X) scenario, the communication scenario between user equipment and relay, and the communication scenario between relay and base station, and can achieve technical effects in similar user equipment and base station scenarios. In addition, the technical solutions in the embodiments of this disclosure can be applied to various communication scenarios, such as enhanced mobile broadband (eMBB) scenarios, ultra-reliable low-latency communication (URLLC) scenarios, and massive machine-to-machine communication (mMTC) scenarios. Petition 870250075847, dated 08 / 27 / 2025, page 29 / 235 21 / 103 similar. Furthermore, adopting a unified solution for different scenarios can also help reduce complexity and hardware costs.

[094] User equipment in the embodiments of this disclosure may also be referred to as a terminal device, access terminal, subscriber unit, subscriber station, mobile radio station, mobile station (MS), mobile terminal (MT), remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent, or user device. User equipment in the embodiments of this disclosure may be a device that provides voice and / or data connectivity to a user and may be used for communication between people, objects, and machines, such as portable devices and vehicle-mounted devices that have a wireless connection function.The user equipment in the embodiments of this disclosure may be a mobile phone, a tablet (Pad), a notebook, a palmtop, 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 autonomous driving, a wireless terminal in remote medical surgery, a wireless terminal in a smart power grid, a wireless terminal in transport security, a wireless terminal in a smart city, a wireless terminal in smart homes, and the like. In some embodiments, the UE may function as a base station. For example, the UE may function as a scheduling entity, providing a side link signal between UEs in vehicle-to-everything (V2X) or device-to-device (D2D) communication, or the like.For example, a cell phone and a vehicle communicate using a side-link signal, or a cell phone and a smart home device communicate without relaying a communication signal through a base station. Petition 870250075847, dated 08 / 27 / 2025, page 30 / 235 22 / 103

[095] The network device in the embodiments of this disclosure may be a device for communication with the user's equipment. The network device may also be referred to as an access network device or a radio access network device. For example, the network device may be a base station. The network device in the embodiments of this disclosure may refer to a radio access network (RAN) node (or device) that accesses the user's equipment to a wireless network.The term "base station" can broadly include, or be equivalent to, the following terms: a B node (NodeB), an evolved NodeB (eNB), a next-generation NodeB (gNB), a relay station, an access point, a transmit / receive point (TRP), a transmit point (TP), a master eNodeB (MeNB), a secondary eNodeB (SeNB), a multi-pattern radio node (MSR), a home base station, a network controller, an access node, a wireless node, an access point (AP), a transmit node, a transceiver node, a baseband unit (BBU), a remote radio unit (RRU), an active antenna unit (AAU), a remote radio head (RRH), a central unit (CU), a distributed unit (DU), a positioning node, and similar units. A base station can be a macro base station, a micro base station, a relay node, a donor node, or similar, or a combination thereof.The term "base station" can also refer to a communication module, a modem, or a chip provided in the devices or appliances mentioned above. A base station can also be a mobile switching center, as well as a device that functions as a base station in D2D, V2X, machine-to-machine (M2M) communication, a network-side device in a 6G network, a device that functions as a base station in future communication systems, or similar systems. The base station may support networks with the same or different access technologies. The embodiments of this disclosure are not limited to specific technologies. Petition 870250075847, dated 08 / 27 / 2025, p. 31 / 235 23 / 103 and to the specific equipment types of network devices.

[096] The base station can be a fixed or mobile base station. For example, a helicopter or unmanned aerial vehicle can be configured to function as a mobile base station and one or more cells can move according to the location of the mobile base station. In some other examples, the helicopter or unmanned aerial vehicle can be configured to serve as a communication device with another base station.

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

[098] The network device and user equipment may be deployed on land, including indoor or outdoor environments, portable or vehicle-mounted, or may be deployed on water, or may be deployed on airplanes, balloons, and satellites in the air. The scenarios in which the network device and user equipment are deployed are not limited to the embodiments of this disclosure.

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

[0100] The coverage performance of communication systems (such as NR systems) is an important factor that operators need to consider when deploying commercial communication networks. This is because the coverage performance of communication systems directly influences the quality of service and the costs for operators, such as capital expenditures. Petition 870250075847, dated 08 / 27 / 2025, page 32 / 235 24 / 103 (CAPEX) and operating expenses (OPEX) of operators.

[0101] The coverage performance of communication systems varies depending on the frequency bands in which they operate. For example, compared to LTE systems, NR systems operate in higher frequency bands (such as millimeter wave frequency bands), resulting in greater path loss and therefore relatively lower coverage performance of NR systems. Therefore, as the frequency bands supported by communication systems can become increasingly higher, the question of how to increase the coverage of communication systems has become a problem that needs to be solved.

[0102] In most practical deployment scenarios, due to the weaker capabilities of user equipment compared to network devices, uplink coverage performance is the bottleneck for increasing the coverage of communication systems. With the development of communication technology, the number of uplink services in some emerging vertical use cases is gradually increasing, such as video upload services. In scenarios with many uplink services, how to increase uplink coverage is a problem that needs to be solved.

[0103] In related technologies, there are solutions for increasing the coverage of certain uplinks. For example, version 17 (Rel-17) for NR designed coverage increase schemes for physical uplink shared channel (PUSCH), physical uplink control channel (PUCCH), and message 3 (Msg3) in random access processes.

[0104] However, Rel-17 did not design coverage enhancement schemes for PRACH, but the performance of PRACH transmission (also known as PRACH sending) is crucial for many processes, such as initial access, beam fault recovery, and the like. Therefore, enhancing coverage for PRACH is also very important. With Petition 870250075847, dated 08 / 27 / 2025, page 33 / 235 25 / 103 Based on this, in the 3rd Generation Partnership (3GPP) project RP-221858, Rel-18, the work item (WI) of “further enhancements to NR coverage” is established. In this WI, improving the performance of PRACH transmission coverage is one of the important topics.

[0105] As a possible implementation, multiple PRACH transmissions can be used to enhance PRACH transmission coverage. That is, enhanced PRACH transmission coverage can be achieved by repeatedly transmitting PRACH (such as transmitting random access preambles a plurality of times in PRACH). It should be noted that in the present disclosure, multiple PRACH transmissions may also be replaced by terms such as plurality of PRACH transmissions, multiple PRACH transmissions, multiple PRACH transmissions, PRACH with multiple transmissions, repeated PRACH transmissions, type 3 random access procedure, and the like. The embodiments of the present disclosure are not limited to this.In other words, the multiple PRACH transmissions mentioned in this disclosure may be replaced by at least one of a plurality of PRACH transmissions, multiple PRACH transmissions, multiple PRACH transmissions, PRACH with multiple transmissions, repeated PRACH transmissions, or random access procedure type 3.

[0106] In some embodiments, multiple PRACH transmissions are used for a random access channel (RACH) attempt. That is, in a RACH attempt, a multiple PRACH transmission scheme can be used (such as transmitting preambles a plurality of times in the PRACH) to enhance PRACH coverage.

[0107] In the embodiment of this disclosure, multiple transmissions of PRACH may refer to multiple transmissions of Petition 870250075847, dated 08 / 27 / 2025, page 34 / 235 26 / 103 PRACH using the same beam or multiple PRACH transmissions using different beams. Taking multiple PRACH transmissions using the same beam as an example, multiple PRACH transmissions using the same beam can achieve performance gains and therefore be used as a viable scheme for improving PRACH coverage. Conference 1#110bis-e on the 3GPP Radio Access Network (RAN) reached an agreement that PRACH occasions (or RACH occasions), at least in different time instances (or time points, temporal instances or similar), can be used for multiple PRACH transmissions using the same beam. In other words, ROG can be used for multiple PRACH transmissions using the same beam.

[0108] Furthermore, the number of multiple PRACH transmissions (number of times multiple PRACH transmissions / repetition factor) can also be defined, and the number of PRACH transmissions configured for multiple PRACH transmissions can include a plurality of numerical values. For example, conference RAN1#110bis-e further defined the number of multiple PRACH transmissions using the same beam, which can include at least 2, 4, and 8. That is, a ROG can include 2, 4, or 8 valid ROs. In other words, the size of a ROG can be 2, 4, or 8. The ROG will be illustrated in more detail below. PRACH Occasion Group

[0109] In some scenarios, ROG is introduced to indicate a set that includes a plurality of PRACH occasions (PRACH occasion, RO); therefore, a ROG may also be referred to as a “set of ROs”. The embodiments of this disclosure do not limit the name of ROG. For ease of description, the embodiments of this disclosure are illustrated based on ROG. The embodiments of this disclosure do not limit the name of PRACH occasions; for example, an occasion of Petition 870250075847, dated 08 / 27 / 2025, page 35 / 235 27 / 103 PRACH may also be referred to as a random access occasion, or it may also be referred to as a transmission occasion, etc. For ease of description, the ways in which this disclosure is carried out are illustrated based on PRACH occasions, and the PRACH occasions and the random access occasions mentioned in the ways in which this disclosure is carried out may be interchangeable.

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

[0111] In some embodiments, ROG may include ROs corresponding to a plurality of PRACHs transmitted using the same beam.

[0112] In some embodiments, some conferences (such as 3GPP RAN1) have agreed to introduce ROG as a feature for multiple PRACH transmissions. An ROG may include a plurality of valid ROs; for example, an ROG may include a plurality of valid ROs that do not overlap in the time domain.

[0113] In some embodiments, it has been discussed at some conferences (such as 3GPP RAN1#110bis-e) that ROs in different time instances can be used for multiple PRACH transmissions using the same beam. That is, a plurality of ROs in a ROG can be distributed across different time instances.

[0114] In some embodiments, for a specific number of PRACH transmissions, a ROG includes valid ROs, which helps to transmit the specific number of PRACHs through the valid ROs.

[0115] In some embodiments, all ROs in a ROG may be related to the same synchronization signal block (or referred to as the synchronization signal block / physical transmission channel, SS / PBCH block, SSB). For simplicity, the synchronization signal block or block of Petition 870250075847, dated 08 / 27 / 2025, page 36 / 235 The 28 / 103 synchronization signal / physical transmission channel will be designated SSB, which can be replaced by the SS / PBCH block at will.

[0116] In some embodiments, all ROs in a ROG may be related to an SSB. In some embodiments, all ROs in a ROG may be related to a plurality of SSBs, and each RO in the ROG is related to the same plurality of SSBs.

[0117] As mentioned above, the number of PRACH transmissions configured for multiple PRACH transmissions may include a plurality of numeric values. In this case, a plurality of multiple PRACH transmissions with different numbers of transmissions of PRACH can be differentiated by independent ROs and / or independent preambles in shared ROs. That is, when multiple PRACH transmissions are configured to have a plurality of ROG sizes, the plurality of PRACH transmissions corresponding to the different ROG sizes can be differentiated by independent ROs and / or independent preambles in shared ROs.

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

[0119] In some embodiments, for multiple PRACH transmissions differentiated by independent ROs, new rules of Petition 870250075847, dated 08 / 27 / 2025, page 37 / 235 29 / 103 SSB-RO mapping rules can be introduced, or legacy SSBRO mapping rules can be reused.

[0120] So, if legacy SSB-RO mapping rules are to be reused, how to map ROGs to ROGs after SSB-RO mapping is a problem that needs to be solved. In other words, how to determine (or configure) ROGs after SSB-RO mapping is a problem that needs to be addressed.

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

[0122] Figure 2 shows an example of a mapping scheme from ROs to ROGs. When the number of frequency-division multiplexed ROs in a time instance is 2 and the number of SSBs corresponding to each RO is 8, the SSB-to-RO mapping scheme is as shown in Figure 2, i.e., RO #0 corresponds to SSBs 0-7, RO #1 corresponds to SSBs 8-15, RO #2 corresponds to SSBs 16-23, etc. In this case, considering that all ROs in the ROG are related to the same SSB and that the ROs in a ROG are in different time instances, consulting Figure 2, RO #1, RO #9, and RO #17 can be mapped to the same ROG. For example, when the ROG size is 2, RO #1 and RO #9 can be mapped to the same ROG, and when the ROG size is 2, RO #1 can be mapped to the same ROG. Petition 870250075847, dated 08 / 27 / 2025, page 38 / 235 30 / 103 is 4, RO #1, RO #9, RO #17 and RO #25 (not shown in the drawings) can be mapped to the same ROG.

[0123] In some embodiments, the ROs in a given ROG may be discontinuous. That is, the ROs in a ROG may be separated by one or more ROs. Taking Figure 2 as an example, when the ROG includes RO #1 and RO #9, there is a discontinuity between RO #1 and RO #9, that is, RO #1 and RO #9 are separated by RO #3, RO #5 and RO #7.

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

[0125] In some embodiments, the ROs in a given ROG may be continuous. That is, there may be no other ROs between the ROs in a ROG. Taking Figure 3 as an example, when ROG includes RO #1, RO #3, RO #5 and RO #7, RO #1, RO #3, RO #5 and RO #7 may be continuous.

[0126] From the description above, it can be observed that any one or more of a plurality of factors can influence the mapping scheme from ROs to ROGs. Therefore, it is particularly important Petition 870250075847, dated 08 / 27 / 2025, p. 39 / 235 31 / 103 Determine the RO mapping scheme for ROGs. For example, considering that the size of a ROG can be one of three sizes: 2 ROs, 4 ROs, or 8 ROs, and that the ROs in a ROG are in different time instances, different ROG determination methods may result in orphaned RO(s), which may not be usable for multiple PRACH transmissions, leading to wasted resources. In some embodiments, the resulting amount of orphaned RO(s) may vary with different parameter settings, resulting in varying degrees of wasted resources. Furthermore, the RO mapping scheme for ROGs can influence the allocation of resources for multiple PRACH transmissions. To facilitate understanding, a more detailed description of this issue will be provided below, along with Figure 4.

[0127] Referring to Figure 4, in this example, the ROs need to be mapped to ROGs with three different sizes, namely 2 ROs, 4 ROs, and 8 ROs, respectively. In this example, assume that a random access channel attempt corresponds to 3 PRACH time intervals. From the example in Figure 4, it can be observed that after mapping to the ROGs with ROG sizes of 2 ROs and 4 ROs, the remaining ROs are not sufficient to be mapped to the ROG with an ROG size of 8 ROs. Therefore, the remaining ROs will not be mapped to the ROG with the ROG size of 8 ROs, resulting in the transformation of the remaining ROs into orphan ROs.

[0128] To address the above problem, the embodiments of this disclosure provide a method and a device applicable to a node for wireless communication, which contributes to optimizing the mapping scheme of ROs to ROGs or to reducing or preventing the generation of orphan ROs. In this way, the waste of resources can be reduced. The technical solutions according to the embodiments of this Petition 870250075847, dated 08 / 27 / 2025, p. 40 / 235 32 / 103 disclosure will be illustrated below.

[0129] This disclosure applies to the scenario of multiple PRACH transmissions, i.e., the scenario of using a plurality of repeated PRACH transmissions to achieve increased PRACH coverage.

[0130] This disclosure applies to various random access processes. In some embodiments, this disclosure applies to a four-step random access process, that is, a type 1 random access procedure. In some embodiments, this disclosure applies to a two-step random access process, that is, a type 2 random access procedure. In some embodiments, this disclosure applies to a random access process corresponding to multiple PRACH transmissions, that is, a type 3 random access procedure.

[0131] This disclosure applies to random access processes initiated by various initiation methods. In some embodiments, this application applies to random access processes initiated by PDCCH order. In some embodiments, this application applies to random access processes initiated by medium access control (MAC) entities. In some embodiments, this application applies to random access processes initiated by radio resource control (RRC) events.

[0132] In some embodiments, the multiple PRACH transmissions mentioned in this disclosure may refer to multiple PRACH transmissions using the same beam in order to obtain signal-to-noise ratio (SNR) gain by means of repeated transmissions of a plurality of PRACHs performed on the same beam.

[0133] In some embodiments, the multiple Petition 870250075847, dated 08 / 27 / 2025, page 41 / 235 33 / 103 PRACH transmissions mentioned in this disclosure may refer to multiple PRACH transmissions using different beams in order to gain diversity through repeated transmissions of a plurality of PRACHs performed on different beams.

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

[0135] The methods and devices provided in this disclosure will be illustrated below using a plurality of embodiments or examples. It should be understood that, without conflict, the features of a first node in the embodiments of this disclosure can be applied to a second node and vice versa. Without conflict, the features in the embodiments of this disclosure can be arbitrarily combined with each other.

[0136] Figure 5 is a flowchart of the method applicable to a node for wireless communication provided in some embodiments of the present disclosure. The method, as shown in Figure 5, is illustrated from the perspective of the interaction between the first and second nodes. Below is a brief illustration of the first and second nodes.

[0137] In some embodiments, the first node can be any type of node in the communication system that can perform the mapping of ROs to ROGs.

[0138] In some embodiments, the first node may be a user device. For example, the first node may be user device (120), as shown in Figure 1. Petition 870250075847, dated 08 / 27 / 2025, page 42 / 235 34 / 103

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

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

[0141] In some embodiments, the first node may include one or more receivers. For example, the first node may include a receiver that can receive a plurality of information types, signals, or data. Alternatively, the first node may include a plurality of receivers that can receive different information, signals, or data, respectively.

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

[0143] In some embodiments, the first node may include a transmitter. For example, the first node may also include a first transmitter.

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

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

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

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

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

[0149] In some embodiments, the second node may include a fourth transmitter. Petition 870250075847, dated 08 / 27 / 2025, page 43 / 235 35 / 103

[0150] The method shown in Figure 5 will be illustrated below. See Figure 5. The method shown in Figure 5 may include operations (S510) and (S520).

[0151] In (S510), the first node receives initial information.

[0152] In some embodiments, the first piece of information is used to determine X occasions of PRACH, and X is a positive integer greater than 1. In other words, the first piece of information is used to determine a plurality of occasions of PRACH.

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

[0154] The implementation of determining the X PRACH occasions using the first information is not specified in the embodiments of this disclosure. In some embodiments, the first information is used to determine at least one of: a respective number of synchronization signal blocks corresponding to each PRACH occasion of the X PRACH occasions; and the number of random access preambles corresponding to the synchronization signal blocks corresponding to each PRACH occasion of the X PRACH occasions.

[0155] In some embodiments, the first information is used to determine a respective quantity of synchronization signal blocks corresponding to each PRACH occasion of the X PRACH occasions.

[0156] In some embodiments, the first information is used to determine the respective number of random access preambles corresponding to the synchronization signal blocks corresponding to each PRACH occasion of the X PRACH occasions.

[0157] In some embodiments, the first piece of information is used to determine a respective quantity of signal blocks of Petition 870250075847, dated 08 / 27 / 2025, page 44 / 235 36 / 103 synchronization corresponding to each PRACH occasion of the X PRACH occasions and the number of random access preambles corresponding to each synchronization signal block.

[0158] In some embodiments, the number of random access preambles corresponding to the synchronization signal blocks may include: the number of contention-based random access preambles corresponding to the synchronization signal blocks. For example, the first piece of information can be used to determine: the number of contention-based random access preambles corresponding to the synchronization signal blocks corresponding to each PRACH occasion.

[0159] The content of the first piece of information is not specified in the embodiments of this disclosure. In some embodiments, the first piece of information may indicate the number of synchronization signal blocks corresponding to each PRACH occasion out of X PRACH occasions. For example, an ssb-perRACH-Occasion parameter is used to indicate the number of synchronization signal blocks corresponding to each PRACH occasion out of X PRACH occasions. In some other embodiments, the first piece of information may indicate the number of synchronization signal blocks corresponding to each PRACH occasion out of X PRACH occasions, the number of random access preambles corresponding to each synchronization signal block, and the like. For example, the CBPreamblesPerSSB parameter is used to indicate the number of random access preambles corresponding to each synchronization signal block.

[0160] In some embodiments, the first information may include transmission parameters to configure synchronization signal blocks in a communication network (such as a 5G network). For example, the first information may be the parameter ssb-perRACH-OccasionAndCBPection 870250075847, 08 / 27 / 2025, page 45 / 235 37 / 103 PreamblesPerSSB.

[0161] In some embodiments, the relevant introduction of the ssb-perRACH-OccasionAndCB-PreamblesPerSSB parameter can be found in the 3GPP TS38.331 introduction.

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

[0163] In some embodiments, the first information is transmitted by the second node to the first node. For example, the first information is transmitted by a network device or other nodes to the first node.

[0164] In some embodiments, the first information is transmitted by means of high-level signaling or top-level signaling. For example, the first information is transmitted by means of RRC layer signaling or MAC layer signaling.

[0165] In some embodiments, the first information is used by the first node to determine the X occasions of PRACH.

[0166] In some embodiments, the X occasions of PRACH are mapped to Q groups of occasions of PRACH, and Q is a positive integer. In other words, the X occasions of PRACH are mapped to one or more groups of occasions of PRACH. That is, in the embodiments of the present disclosure, a plurality of occasions of PRACH can be mapped to one or more groups of occasions of PRACH.

[0167] In some embodiments, the X PRACH occasions are mapped, by the first node, to the Q groups of PRACH occasions.

[0168] In some embodiments, the X PRACH occasions are mapped, by the second node, to the Q groups of PRACH occasions.

[0169] In some embodiments, each of the Q groups of PRACH occasions includes at least one PRACH occasion. In others Petition 870250075847, dated 08 / 27 / 2025, page 46 / 235 38 / 103 words, each of the Q groups of PRACH occasions includes at least one PRACH occasion.

[0170] In some embodiments, each of the Q groups of PRACH occasions includes a plurality of PRACH occasions.

[0171] In some embodiments, each of the Q groups of PRACH occasions includes at least one PRACH occasion from the X PRACH occasions.

[0172] In some embodiments, a respective group of PRACH occasions from the Q groups of PRACH occasions includes a corresponding PRACH occasion from the X occasions of PRACH. The respective group of PRACH occasions can be any one of the Q groups of PRACH occasions. The corresponding PRACH occasion can be any one of the X occasions of PRACH.

[0173] In some embodiments, a respective group of PRACH occasions from the Q groups of PRACH occasions includes a corresponding plurality of PRACH occasions from the X occasions of PRACH. The respective group of PRACH occasions can be any of the Q groups of PRACH occasions. The corresponding plurality of PRACH occasions can be any plurality of PRACH occasions from the X occasions of PRACH.

[0174] In some embodiments, the respective plurality of PRACH occasions in each of the Q groups of PRACH occasions are orthogonal to each other in the time domain. In other words, the plurality of PRACH occasions in each of the Q groups of PRACH occasions do not overlap with each other in the time domain. In other words, the plurality of PRACH occasions in each of the Q groups of PRACH occasions are time-division multiplexed (TDM).

[0175] In some embodiments, the plurality of PRACH occasions being orthogonal to each other in the time domain may refer to Petition 870250075847, dated 08 / 27 / 2025, page 47 / 235 39 / 103 fact that any two of the plurality of PRACH occasions are distributed in different time instances from each other.

[0176] In some embodiments, each of the Q groups of PRACH occasions includes a respective plurality of PRACH occasions, and at least two groups of PRACH occasions from the Q groups of PRACH occasions include at least one PRACH occasion that differs from each other, respectively.

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

[0178] In some embodiments, the respective plurality of PRACH occasions in each of the Q groups of PRACH occasions is related to the same synchronization signal block. In other words, the respective plurality of PRACH occasions in each of the Q groups of PRACH occasions is related to an identical synchronization signal block.

[0179] In some embodiments, the respective plurality of PRACH occasions in each of the Q groups of PRACH occasions are orthogonal to each other in the time domain and are related to the same synchronization signal block.

[0180] In some embodiments, at least two groups of PRACH occasions of the Q groups of PRACH occasions include different quantities of PRACH occasions, respectively. For example, the Q groups of PRACH occasions include a first group of PRACH occasions and a second group of PRACH occasions, and the quantity of Petition 870250075847, dated 08 / 27 / 2025, page 48 / 235 40 / 103 PRACH occasions in the first group of PRACH occasions is different from the number of PRACH occasions in the second group of PRACH occasions.

[0181] In some embodiments, at least two groups of PRACH occasions of the Q groups of PRACH occasions include the same number of PRACH occasions, respectively. For example, the Q groups of PRACH occasions include a first group of PRACH occasions and a second group of PRACH occasions, and the number of PRACH occasions in the first group of PRACH occasions is the same as the number of PRACH occasions in the second group of PRACH occasions.

[0182] In some embodiments, some groups of PRACH occasions of the Q groups of PRACH occasions include the same number of PRACH occasions, respectively.

[0183] In some embodiments, some groups of PRACH occasions of the Q groups of PRACH occasions include different quantities of PRACH occasions, respectively.

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

[0185] In some embodiments, at least one PRACH occasion of the X PRACH occasions is mapped to a corresponding PRACH occasion group of the Q PRACH occasion groups.

[0186] In some embodiments, at least one PRACH occasion out of the X PRACH occasions is not mapped to any of the Q Petition 870250075847, dated 08 / 27 / 2025, page 49 / 235 41 / 103 groups of PRACH occasions. That is, after mapping the X PRACH occasions to the Q groups of PRACH occasions, orphaned PRACH occasions are generated. In other words, after mapping the X PRACH occasions to the Q groups of PRACH occasions, the PRACH occasions of the X PRACH occasions that are not mapped to any of the Q groups of PRACH occasions cannot be used for multiple PRACH transmissions.

[0187] In some embodiments, the Q groups of PRACH occasions can be used for multiple PRACH transmissions. For example, the Q groups of PRACH occasions can be used, by the first node, for multiple PRACH transmissions.

[0188] In some embodiments, the PRACH occasions in each of the Q groups of PRACH occasions can be used for the multiple transmissions of PRACH. In other words, the multiple transmissions of PRACH can be realized on the PRACH occasions in each of the Q groups of PRACH occasions.

[0189] In some embodiments, multiple PRACH transmissions correspond to a random access channel attempt.

[0190] In some embodiments, multiple PRACH transmissions are used for a random access channel attempt.

[0191] In some embodiments, multiple PRACH transmissions include transmissions of a plurality of random access preambles in a random access channel attempt.

[0192] In some embodiments, the plurality of PRACH occasions in each of the Q groups of PRACH occasions can be used to convey a plurality of random access preambles. Petition 870250075847, dated 08 / 27 / 2025, page 50 / 235 42 / 103

[0193] In (S520), the first node receives a second piece of information.

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

[0195] In some embodiments, the second piece of information is used to indicate a plurality of candidate values.

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

[0197] In some embodiments, the second piece of information is received by the first node through the second receiver.

[0198] In some embodiments, the second piece of information is transmitted by the second node to the first node. For example, the second piece of information is transmitted by a network device or other nodes to the first node.

[0199] In some embodiments, the second piece of information is transmitted via a physical layer (PHY), high-level signaling, or upper-level signaling. For example, the second piece of information is transmitted via PHY signaling, RRC layer signaling, or MAC layer signaling.

[0200] In some embodiments, the PHY signaling may include or be replaced by at least one of: downlink control information (DCI), physical transmission channel (PBCH), and demodulation reference signal (DMRS). Petition 870250075847, dated 08 / 27 / 2025, page 51 / 235 43 / 103

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

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

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

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

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

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

[0207] In some embodiments, the plurality of candidate values ​​includes at least two of {1, 2, 4, 8}. For example, the plurality of candidate values ​​includes {1, 2}; or the plurality of candidate values ​​includes {1, 4}; or the plurality of candidate values ​​includes {1, 2, 4}; or the plurality of candidate values ​​includes {1, 2, 8}; or the plurality of candidate values ​​includes {1, 2, 4, 8} and the like.

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

[0209] For example, when the plurality of candidate values ​​includes 2 and 4, the first candidate value is 4. For another example, when the plurality of candidate values ​​includes 2 and 8, the first candidate value is 8. For yet another example, when the plurality of candidate values ​​includes 4 and 8, the Petition 870250075847, dated 08 / 27 / 2025, page 52 / 235 44 / 103 The first candidate value is 8. As another example, when the plurality of candidate values ​​includes 2, 4, and 8, the first candidate value is 8.

[0210] In some embodiments, the number of PRACH occasions in each of the Q groups of PRACH occasions is a corresponding candidate value from the plurality of candidate values. Taking as an example the plurality of candidate values ​​including at least two of {1, 2, 4, 8}, when the plurality of candidate values ​​includes {2, 4}, the number of PRACH occasions in each of the Q groups of PRACH occasions is one of {2, 4}; when the plurality of candidate values ​​includes {2, 4, 8}, the number of PRACH occasions in each of the Q groups of PRACH occasions is one of {2, 4, 8}, and so on.

[0211] In some embodiments, the number of PRACH occasions in a group of PRACH occasions corresponding to a respective candidate value of the plurality of candidate values ​​is equal to a respective candidate value. In other words, the number of PRACH occasions in each group of PRACH occasions of at least one group of PRACH occasions corresponding to a respective candidate value of the plurality of candidate values ​​is equal to a respective candidate value.

[0212] In some embodiments, the first candidate value is a respective candidate value among the plurality of candidate values, and the number of PRACH occasions in a group of PRACH occasions corresponding to the first candidate value is (equal to) the first candidate value.

[0213] In some embodiments, the first candidate value is a respective candidate value among the plurality of candidate values, the first candidate value corresponds to a group of PRACH occasions, and the number of PRACH occasions in the group of PRACH occasions corresponding to the first candidate value is equal to the first value. Petition 870250075847, dated 08 / 27 / 2025, page 53 / 235 45 / 103 candidate.

[0214] In some embodiments, the first candidate value is a respective candidate value among the plurality of candidate values, the first candidate value corresponds to a plurality of PRACH occasion groups, and the number of PRACH occasions in a respective PRACH occasion group among the plurality of PRACH occasion groups corresponding to the first candidate value is equal to the first candidate value.

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

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

[0217] In the embodiment of this disclosure, the mapping of the X PRACH occasions to the Q groups of PRACH occasions may be related to a plurality of factors (parameters), for example, with one or more of: the plurality of candidate values, the number of groups of PRACH occasions corresponding respectively to each candidate value of the plurality of candidate values, and the like.

[0218] In some embodiments, the plurality of candidate values ​​includes a first candidate value and a second candidate value, and the higher value among the first candidate value and the second candidate value is prioritized for mapping the X occasions of PRACH to the Q groups of Petition 870250075847, dated 08 / 27 / 2025, page 54 / 235 46 / 103 PRACH occasions; and / or the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to the number of groups of PRACH occasions corresponding respectively to each candidate value of the plurality of candidate values.

[0219] In some embodiments, a higher value among the first candidate value and the second candidate value is prioritized for mapping the X PRACH occasions to the Q groups of PRACH occasions. In other words, determining the group of PRACH occasions corresponding to the higher value among the first candidate value and the second candidate value is prioritized.

[0220] In some embodiments, the first candidate value and the second candidate value represent different ROG sizes, respectively. Mapping the X PRACH occasions to a group of PRACH occasions with a larger ROG size or determining the group of PRACH occasions with the largest ROG size is prioritized.

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

[0222] In some embodiments, a higher value among the plurality of candidate values ​​is prioritized for mapping the X PRACH occasions to the Q groups of PRACH occasions. In other words, the determination of the group of PRACH occasions corresponding to Petition 870250075847, dated 08 / 27 / 2025, page 55 / 235 47 / 103 The highest value among the plurality of candidate values ​​is prioritized.

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

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

[0225] In some embodiments, the plurality of candidate values ​​is used, in descending order, for mapping the X PRACH occasions to the Q groups of PRACH occasions. Petition 870250075847, dated 08 / 27 / 2025, page 56 / 235 48 / 103

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

[0227] In some embodiments, when the communication system is configured with a plurality of ROG sizes, the plurality of ROG sizes is used, in descending order, for mapping the X PRACH occasions to the Q groups of PRACH occasions.

[0228] In some embodiments, when the communication system is configured with a plurality of ROG sizes, the Q groups of PRACH occasions are determined in descending order of the plurality of ROG sizes.

[0229] As an example, the plurality of candidate values ​​includes {2, 4, 8}. The candidate value 8 is prioritized for mapping the X PRACH occasions to the Q groups of PRACH occasions, then the candidate value 4 is used for mapping the X PRACH occasions to the Q groups of PRACH occasions, and finally, the candidate value 2 is used for mapping the X PRACH occasions to the Q groups of PRACH occasions. In other words, the plurality of candidate values ​​includes {2, 4, 8}, the mapping of the X PRACH occasions to the group of PRACH occasions with ROG size of 8 is prioritized, then the mapping of the X PRACH occasions to the group of PRACH occasions with ROG size of 4 is performed, and finally, the mapping of the X PRACH occasions to the group of PRACH occasions with ROG size of 2 is performed.In other words, the plurality of candidate values ​​includes {2, 4, 8}, the determination of the group of PRACH occasions with ROG size of 8 is prioritized, then the group of PRACH occasions with ROG size of 4 is determined, and finally, the group of PRACH occasions with ROG size of 2 is determined. Petition 870250075847, dated 08 / 27 / 2025, page 57 / 235 49 / 103

[0230] As another example, the plurality of candidate values ​​includes {1, 2, 4}. The candidate value 4 is prioritized for mapping the X PRACH occasions to the Q groups of PRACH occasions, then the candidate value 2 is used for mapping the X PRACH occasions to the Q groups of PRACH occasions, and finally the candidate value 1 is used for mapping the X PRACH occasions to the Q groups of PRACH occasions. In other words, the plurality of candidate values ​​includes {1, 2, 4}, the mapping of the X PRACH occasions to the group of PRACH occasions with a ROG size of 4 is prioritized, then the mapping of the X PRACH occasions to the group of PRACH occasions with a ROG size of 2 is performed, and finally the mapping of the X PRACH occasions to the group of PRACH occasions with a ROG size of 1 is performed.In other words, the plurality of candidate values ​​includes {1, 2, 4}, the determination of the group of PRACH occasions with a ROG size of 4 is prioritized, then the group of PRACH occasions with a ROG size of 2 is determined, and finally, the group of PRACH occasions with a ROG size of 1 is determined.

[0231] In some embodiments, a maximum value of the plurality of candidate values ​​is prioritized for mapping the X PRACH occasions to the Q groups of PRACH occasions. In other words, determining the group of PRACH occasions corresponding to the maximum value of the plurality of candidate values ​​is prioritized.

[0232] In some embodiments, when the plurality of candidate values ​​represents various ROG sizes, mapping the X PRACH occasions to the group of PRACH occasions with the largest ROG size is prioritized, or determining the group of PRACH occasions with the largest ROG size is prioritized.

[0233] For example, when the plurality of candidate values Petition 870250075847, dated 08 / 27 / 2025, page 58 / 235 50 / 103 includes {2, 4, 8}, the candidate value 8 is prioritized for mapping the X PRACH occasions to the Q groups of PRACH occasions, or the determination of the group of PRACH occasions corresponding to the candidate value 8 is prioritized, or the mapping of the X PRACH occasions to the group of PRACH occasions with ROG size of 8 is prioritized, or the determination of the group of PRACH occasions with ROG size of 8 is prioritized.

[0234] As another example, when the plurality of candidate values ​​includes {1, 2, 4}, the candidate value 4 is prioritized for mapping the X PRACH occasions to the Q groups of PRACH occasions, or the determination of the group of PRACH occasions corresponding to the candidate value 4 is prioritized, or the mapping of the X PRACH occasions to the group of PRACH occasions with ROG size of 4 is prioritized, or the determination of the group of PRACH occasions with ROG size of 4 is prioritized.

[0235] Because larger candidate values ​​(larger ROG sizes) require more non-overlapping PRACH occasions in the time domain, the requirements for PRACH occasions are more stringent. Therefore, when mapping PRACH occasions to groups of PRACH occasions, the mapping corresponding to the larger candidate values ​​is prioritized, followed by the mapping corresponding to the relatively small candidate values. In this way, orphaned PRACH occasions can be minimized and resource utilization efficiency can be improved. In other words, when mapping PRACH occasions to groups of PRACH occasions, the mapping corresponding to the larger ROG sizes is prioritized, followed by the mapping corresponding to the relatively small ROG sizes. In this way, orphaned PRACH occasions can be minimized and resource utilization efficiency can be improved. Petition 870250075847, dated 08 / 27 / 2025, page 59 / 235 51 / 103 can be improved.

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

[0237] In some embodiments, the plurality of candidate values ​​includes the first candidate value and the second candidate value, and the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to the number of groups of PRACH occasions corresponding to the first candidate value and the number of groups of PRACH occasions corresponding to the second candidate value.

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

[0239] The ways in which this disclosure is made are not limited to this: the plurality of candidate values ​​may include three or more candidate values, and the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to the number of groups of PRACH occasions corresponding respectively to each candidate value of the plurality of candidate values.

[0240] In some embodiments, the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to a respective quantity of groups of PRACH occasions with each Petition 870250075847, dated 08 / 27 / 2025, page 60 / 235 52 / 103 ROG size from a plurality of ROG sizes.

[0241] In some embodiments, the plurality of ROG sizes includes a first ROG size and a second ROG size, and the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to the number of groups of PRACH occasions with the first ROG size and the number of groups of PRACH occasions with the second ROG size.

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

[0243] The ways in which this disclosure is made are not limited to this: the plurality of ROG sizes may include three or more ROG sizes, and the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to a respective number of groups of PRACH occasions with each ROG size of the plurality of ROG sizes.

[0244] As an example, the plurality of candidate values ​​includes {2, 4}, and the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to the number of groups of PRACH occasions corresponding to the candidate value 2 and the number of groups of PRACH occasions corresponding to the candidate value 4. In other words, the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to the number of groups of PRACH occasions with Petition 870250075847, dated 08 / 27 / 2025, page 61 / 235 53 / 103 a ROG size of 2 and the number of PRACH occasion groups with a ROG size of 4.

[0245] As another example, the plurality of candidate values ​​includes {2, 4, 8}, and the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to the number of groups of PRACH occasions corresponding to the candidate value 2, the number of groups of PRACH occasions corresponding to the candidate value 4, and the number of groups of PRACH occasions corresponding to the candidate value 8. In other words, the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to the number of groups of occasions of PRACH with ROG size of 2, to the number of occasion groups of PRACH with ROG size of 4 and the number of occasion groups of PRACH with ROG size of 8.

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

[0247] In some embodiments, each of the plurality of candidate values ​​corresponds to at least one respective group of PRACH occasions of the Q1 respective groups of PRACH occasions in each subset of groups of occasions of the plurality of subsets of groups of PRACH occasions. In other words, for a respective subset of groups of occasions of the plurality of subsets Petition 870250075847, dated 08 / 27 / 2025, page 62 / 235 54 / 103 of PRACH occasion groups, each of the plurality of candidate values ​​corresponds to at least one respective PRACH occasion group in the respective subset of occasion groups.

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

[0249] In some embodiments, the plurality of candidate values ​​includes the first candidate value and the second candidate value, and the plurality of subsets of PRACH occasion groups includes a first subset of occasion groups and a second subset of occasion groups. For the first subset of occasion groups, the first candidate value corresponds to at least one PRACH occasion group from the Q1 PRACH occasion groups in the first subset of occasion groups, and the second candidate value corresponds to at least one PRACH occasion group from the Q1 PRACH occasion groups in the first subset of occasion groups.For the second subset of occasion groups, the first candidate value corresponds to at least one PRACH occasion group from the Q1 PRACH occasion groups in the second subset of occasion groups, and the second candidate value corresponds to at least one PRACH occasion group from the Q1 PRACH occasion groups. Petition 870250075847, dated 08 / 27 / 2025, page 63 / 235 55 / 103 second subset of occasion groups.

[0250] In some embodiments, the plurality of candidate values ​​includes the first candidate value, the second candidate value, and the third candidate value, and the plurality of subsets of PRACH occasion groups includes a first subset of occasion groups and a second subset of occasion groups. For the first subset of occasion groups, the first candidate value corresponds to at least one PRACH occasion group from the Q1 PRACH occasion groups in the first subset of occasion groups, the second candidate value corresponds to at least one PRACH occasion group from the Q1 PRACH occasion groups in the first subset of occasion groups, and the third candidate value corresponds to at least one PRACH occasion group from the Q1 PRACH occasion groups in the first subset of occasion groups.For the second subset of occasion groups, the first candidate value corresponds to at least one PRACH occasion group from the Q1 PRACH occasion groups in the second subset of occasion groups, the second candidate value corresponds to at least one PRACH occasion group from the Q1 PRACH occasion groups in the second subset of occasion groups, and the third candidate value corresponds to at least one PRACH occasion group from the Q1 PRACH occasion groups in the second subset of occasion groups.

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

[0252] As an example, the plurality of candidate values ​​includes {2, 4}, and the plurality of subsets of PRACH occasion groups includes the first subset of occasion groups, the second subset of groups Petition 870250075847, dated 08 / 27 / 2025, p. 64 / 235 56 / 103 of occasions and a third subset of occasion groups. The number of PRACH occasion groups corresponding to candidate value 2 in the first subset of occasion groups is equal to the number of PRACH occasion groups corresponding to candidate value 2 in the second subset of occasion groups, and is not equal to the number of PRACH occasion groups corresponding to candidate value 2 in the third subset of occasion groups. Alternatively, the number of PRACH occasion groups corresponding to candidate value 2 in the first subset of occasion groups is equal to the number of PRACH occasion groups corresponding to candidate value 2 in the second subset of occasion groups, and to the number of PRACH occasion groups corresponding to candidate value 2 in the third subset of occasion groups.

[0253] In some embodiments, each subset of occasion groups of part of the plurality of subsets of PRACH occasion groups corresponding to any one of the plurality of candidate values ​​has a different number of PRACH occasion groups than the number of PRACH occasion groups in the remaining subsets of occasion groups of part of the plurality of subsets of PRACH occasion groups.

[0254] In some embodiments, any two subsets of occasion groups of the plurality of subsets of PRACH occasion groups corresponding to any one of the plurality of candidate values ​​have the same number of PRACH occasion groups.

[0255] In some embodiments, the first subset of occasion groups and the second subset of occasion groups are two subsets of occasion groups of the plurality of subsets of occasion groups of PRACH, the number of occasion groups of PRACH in Petition 870250075847, dated 08 / 27 / 2025, page 65 / 235 57 / 103 The first subset of occasion groups corresponding to the first candidate value is equal to the number of PRACH occasion groups in the second subset of occasion groups corresponding to the first candidate value, and the number of PRACH occasion groups in the first subset of occasion groups corresponding to the second candidate value is equal to the number of PRACH occasion groups in the second subset of occasion groups corresponding to the second candidate value.

[0256] As an example, the plurality of candidate values ​​includes {2, 4}, and the plurality of subsets of PRACH occasion groups includes the first subset of occasion groups and the second subset of occasion groups. The number of PRACH occasion groups in the first subset of occasion groups corresponding to the candidate value 2 is equal to the number of PRACH occasion groups in the second subset of occasion groups corresponding to the candidate value 2, and the number of PRACH occasion groups in the first subset of occasion groups corresponding to the candidate value 4 is equal to the number of PRACH occasion groups in the second subset of occasion groups corresponding to the candidate value 4.

[0257] As another example, the plurality of candidate values ​​includes {2, 4}, and the plurality of subsets of PRACH occasion groups includes the first subset of occasion groups, the second subset of occasion groups, and the third subset of occasion groups. The number of PRACH occasion groups in the first subset of occasion groups corresponding to the candidate value 2 is equal to the number of PRACH occasion groups in the second subset of occasion groups corresponding to the candidate value 2 and the number of PRACH occasion groups in the third subset of occasion groups corresponding to the candidate value 2. The number of PRACH occasion groups in the first Petition 870250075847, dated 08 / 27 / 2025, page 66 / 235 58 / 103, the subset of occasion groups corresponding to candidate value 4, is equal to the number of PRACH occasion groups in the second subset of occasion groups corresponding to candidate value 4 and to the number of PRACH occasion groups in the third subset of occasion groups corresponding to candidate value 4.

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

[0259] In some embodiments, at least two groups of occasions Subsets of the plurality of subsets of groups of occasions of PRACH have the same number of groups of occasions as Petition 870250075847, dated 08 / 27 / 2025, page 67 / 235 59 / 103 PRACH.

[0260] In some embodiments, any two subsets of occasion groups of the plurality of subsets of occasion groups of PRACH have the same number of occasion groups of PRACH.

[0261] In some embodiments, the plurality of subsets of PRACH occasion groups includes the first subset of occasion groups and the second subset of occasion groups, and the number of PRACH occasion groups in the first subset of occasion groups is equal to the number of PRACH occasion groups in the second subset of occasion groups.

[0262] In some embodiments, the plurality of subsets of PRACH occasion groups includes the first subset of occasion groups, the second subset of occasion groups, and the third subset of occasion groups, and the number of PRACH occasion groups in the first subset of occasion groups is equal to the number of PRACH occasion groups in the second subset of occasion groups and the number of PRACH occasion groups in the third subset of occasion groups.

[0263] In some embodiments, the quantity of at least one respective group of PRACH occasions in each subset of groups of occasions of the plurality of subsets of groups of PRACH occasions corresponding to a respective candidate value of the plurality of candidate values ​​corresponds to a value, and the values ​​corresponding to the plurality of candidate values ​​are in a first proportion.

[0264] In some embodiments, the plurality of candidate values ​​includes the first candidate value and the second candidate value, and a ratio between the number of PRACH occasion groups in each Petition 870250075847, dated 08 / 27 / 2025, page 68 / 235 60 / 103 is the subset of groups of occasions of the plurality of subsets of groups of occasions of PRACH corresponding to the first candidate value, and the number of groups of occasions of PRACH in each subset of groups of occasions of the plurality of subsets of groups of occasions of PRACH corresponding to the second candidate value is the first ratio.

[0265] In some embodiments, the plurality of candidate values ​​includes the first candidate value and the second candidate value, and the plurality of subsets of PRACH occasion groups includes the first subset of occasion groups and the second subset of occasion groups. The ratio between the number of PRACH occasion groups in the first subset of occasion groups corresponding to the first candidate value and the number of PRACH occasion groups in the first subset of occasion groups corresponding to the second candidate value is the first proportion. The ratio between the number of PRACH occasion groups in the second subset of occasion groups corresponding to the first candidate value and the number of PRACH occasion groups in the second subset of occasion groups corresponding to the second candidate value is the first proportion.

[0266] For example, the number of PRACH occasion groups in each subset of occasion groups of the plurality of subsets of PRACH occasion groups corresponding to the first candidate value is A, the number of PRACH occasion groups in each subset of occasion groups of the plurality of subsets of PRACH occasion groups corresponding to the second candidate value is B, and the first ratio can be represented as A:B.

[0267] For example, the number of PRACH occasion groups in the first subset of occasion groups corresponding to the first candidate value is A1, the number of PRACH occasion groups Petition 870250075847, dated 08 / 27 / 2025, page 69 / 235 61 / 103 in the first subset of occasion groups corresponding to the second candidate value is B1, and the first ratio can be represented as A1:B1. The number of PRACH occasion groups in the second subset of occasion groups corresponding to the first candidate value is A2, the number of PRACH occasion groups in the second subset of occasion groups corresponding to the second candidate value is B2, the first ratio can be represented as A2:B2 and A1:B1 is equal to A2:B2.

[0268] In some embodiments, the plurality of candidate values ​​includes the first candidate value, the second candidate value, and the third candidate value, and a ratio between the number of PRACH occasion groups in each subset of occasion groups of the plurality of subsets of PRACH occasion groups corresponding to the first candidate value to the number of PRACH occasion groups in each subset of occasion groups of the plurality of subsets of PRACH occasion groups corresponding to the second candidate value and to the number of PRACH occasion groups in each subset of occasion groups of the plurality of subsets of PRACH occasion groups corresponding to the third candidate value is the first ratio.

[0269] In some embodiments, the plurality of candidate values ​​includes the first candidate value, the second candidate value, and the third candidate value, and the plurality of subsets of PRACH occasion groups includes the first subset of occasion groups and the second subset of occasion groups. The ratio between the number of PRACH occasion groups in the first subset of occasion groups corresponding to the first candidate value and the number of PRACH occasion groups in the first subset of occasion groups corresponding to the second candidate value and the number of PRACH occasion groups in the first subset of occasion groups Petition 870250075847, dated 08 / 27 / 2025, page 70 / 235 62 / 103 corresponding to the third candidate value is the first proportion. The ratio between the number of PRACH occasion groups in the second subset of occasion groups corresponding to the first candidate value and the number of PRACH occasion groups in the second subset of occasion groups corresponding to the third candidate value is the first proportion.

[0270] For example, the number of PRACH occasion groups in each subset of occasion groups of the plurality of subsets of PRACH occasion groups corresponding to the first candidate value is A, the number of PRACH occasion groups in each subset of occasion groups of the plurality of subsets of PRACH occasion groups corresponding to the second candidate value is B, the number of PRACH occasion groups in each subset of occasion groups of the plurality of subsets of PRACH occasion groups corresponding to the third candidate value is C, and the first proportion can be represented as A:B:C.

[0271] For example, the number of PRACH occasion groups in the first subset of occasion groups corresponding to the first candidate value is A1, the number of PRACH occasion groups in the first subset of occasion groups corresponding to the second candidate value is B1, the number of PRACH occasion groups in the first subset of occasion groups corresponding to the third candidate value is C1, and the first proportion can be represented as A1:B1:C1. The number of PRACH occasion groups in the second subset of occasion groups corresponding to the first candidate value is A2, the number of PRACH occasion groups in the second subset of occasion groups corresponding to the second candidate value is B2, the number of PRACH occasion groups in the second subset of occasion groups corresponding to the third candidate value is C2, the first Petition 870250075847, dated 08 / 27 / 2025, page 71 / 235 The 63 / 103 ratio can be represented as A2:B2:C2, and A1:B1:C1 is equal to A2:B2:C2.

[0272] In some embodiments, the first proportion is fixed.

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

[0274] In some embodiments, the first ratio is configured by high-level signaling or superior-level signaling. For example, the first ratio is configured by RRC signaling and / or MAC CE signaling.

[0275] In some embodiments, the first proportion is a ratio between the number of groups of PRACH occasions to be determined that correspond to the plurality of candidate values, respectively.

[0276] In some embodiments, the plurality of candidate values ​​includes the first candidate value and the second candidate value, and the first proportion is a ratio between the number of groups of PRACH occasions to be determined, corresponding to the first candidate value, and the number of groups of PRACH occasions to be determined, corresponding to the second candidate value.

[0277] In some embodiments, the plurality of candidate values ​​includes the first candidate value, the second candidate value, and the third candidate value, and the first proportion is a ratio between the number of groups of PRACH occasions to be determined, corresponding to the first candidate value, and the number of groups of PRACH occasions to be determined, corresponding to the second candidate value, and the number of groups of PRACH occasions to be determined, corresponding to the third candidate value. Petition 870250075847, dated 08 / 27 / 2025, page 72 / 235 64 / 103

[0278] In some embodiments, the first proportion is equal to the greatest common divisor of the number of groups of PRACH occasions to be determined, corresponding to the plurality of candidate values, respectively.

[0279] In some embodiments, each subset of occasion groups of the plurality of subsets of PRACH occasion groups includes X1 respective PRACH occasions of the X PRACH occasions, and in each subset of occasion groups of the plurality of subsets of PRACH occasion groups, the plurality of candidate values ​​is used, in descending order, to map the X1 respective PRACH occasions to the Q1 respective PRACH occasion groups.

[0280] In some embodiments, each subset of occasion groups of the plurality of subsets of PRACH occasion groups includes X1 respective PRACH occasions of the X PRACH occasions, the plurality of candidate values ​​includes the first candidate value and the second candidate value, and the first candidate value is greater than the second candidate value. In each subset of occasion groups of the plurality of subsets of PRACH occasion groups, the mapping of the X1 respective PRACH occasions corresponding to the first candidate value to the Q1 respective PRACH occasion groups is prioritized, and then the mapping of the X1 respective PRACH occasions corresponding to the second candidate value to the Q1 respective PRACH occasion groups is performed.

[0281] In some embodiments, each subset of occasion groups of the plurality of subsets of occasion groups of PRACH includes X1 respective PRACH occasions of the X PRACH occasions, the plurality of candidate values ​​includes the first candidate value, the second candidate value and the third candidate value, the first candidate value is greater Petition 870250075847, dated 08 / 27 / 2025, page 73 / 235 65 / 103 that the second candidate value is greater than the third candidate value. In each subset of occasion groups of the plurality of subsets of PRACH occasion groups, the mapping of the respective X1 PRACH occasions corresponding to the first candidate value to the respective Q1 PRACH occasion groups is prioritized, then the mapping of the respective X1 PRACH occasions corresponding to the second candidate value to the respective Q1 PRACH occasion groups is performed, and finally, the mapping of the respective X1 PRACH occasions corresponding to the third candidate value to the respective Q1 PRACH occasion groups is performed.

[0282] In some embodiments, each subset of occasion groups of the plurality of subsets of PRACH occasion groups includes X1 respective PRACH occasions of the X PRACH occasions and, in each subset of occasion groups of the plurality of subsets of PRACH occasion groups, the largest value(s) of the plurality of candidate values ​​is prioritized for mapping the X1 respective PRACH occasions to the Q1 respective PRACH occasion groups.

[0283] In some embodiments, each subset of occasion groups of the plurality of subsets of PRACH occasion groups includes X1 respective PRACH occasions of the X PRACH occasions, and in each subset of occasion groups of the plurality of subsets of PRACH occasion groups, the larger value between the first candidate value and the second candidate value is prioritized for mapping the X1 respective PRACH occasions to the Q1 respective PRACH occasion groups. The first candidate value and the second candidate value are two of the plurality of candidate values.

[0284] In some embodiments, each subset of occasion groups of the plurality of subsets of occasion groups of Petition 870250075847, dated 08 / 27 / 2025, page 74 / 235 66 / 103 PRACH includes X1 respective PRACH occasions from the X PRACH occasions, and in each subset of occasion groups from the plurality of subsets of PRACH occasion groups, the maximum value from the plurality of candidate values ​​is prioritized for mapping the X1 respective PRACH occasions to the Q1 respective PRACH occasion groups.

[0285] In the process of mapping the X PRACH occasions to the Q groups of PRACH occasions, the mapping of the respective X1 PRACH occasions to the respective Q1 groups of PRACH occasions is determined according to the subsets of occasion groups. In this way, it can be ensured that, when the first node uses a relatively small ROG for multiple PRACH transmissions, the random access resources can be found in different cycles, which contributes to the balance between random access delay and collision probability. In other words, it contributes to the reduction of orphaned PRACH occasions and random access delay.

[0286] Previously, it was illustrated that, in the process of mapping the X PRACH occasions to the Q groups of PRACH occasions, a higher value among the plurality of candidates is prioritized for mapping the PRACH occasions to the groups of PRACH occasions, and / or that the number of groups of PRACH occasions corresponding to the plurality of candidate values, respectively, is used for mapping the PRACH occasions to the groups of PRACH occasions. By considering these factors, it is possible to optimize the mapping scheme of PRACH occasions to groups of PRACH occasions, reducing or preventing the generation of orphan PRACH occasions, or considering these factors it is possible to reduce the waste of resources, or considering these factors it is possible to optimize the allocation of resources for multiple PRACH transmissions, or considering these factors it is possible to improve the performance gain of Petition 870250075847, dated 08 / 27 / 2025, page 75 / 235 67 / 103 multiple PRACH transmissions and increase coverage range, or considering these factors, it is possible to reduce random access delay and improve the efficiency of random access resource utilization.

[0287] To facilitate understanding, with reference to Figures 6 and 7, two implementations of the mapping of PRACH occasions to PRACH occasion groups are illustrated below. Implementation One: The plurality of candidate values ​​is used, in a descending order, for mapping ROS to ROGS.

[0288] When the plurality of candidate values ​​includes 2 and 4, in the process of mapping ROs to ROGs, X1 groups of PRACH occasions corresponding to candidate value 4 can be determined first, and then X2 groups of PRACH occasions corresponding to candidate value 2 are determined. In other words, when the plurality of ROG sizes includes 2 and 4, in the process of mapping ROs to ROGs, X1 groups of PRACH occasions with ROG size of 4 can be determined first, and then X2 groups of PRACH occasions with ROG size of 2 are determined.

[0289] When the plurality of candidate values ​​includes 2, 4, and 8, in the process of mapping ROs to ROGs, X1 groups of PRACH occasions corresponding to candidate value 8 can be determined first, then X2 groups of PRACH occasions corresponding to candidate value 4 are determined, and finally X3 groups of PRACH occasions corresponding to candidate value 2 are determined. In other words, when the plurality of ROG sizes includes 2, 4, and 8, in the process of mapping ROs to ROGs, X1 groups of PRACH occasions with ROG size 8 can be determined first, then X2 groups of PRACH occasions with ROG size 4 are determined, and finally X3 groups of PRACH occasions with ROG size 2 are determined. Petition 870250075847, dated 08 / 27 / 2025, page 76 / 235 68 / 103 determined.

[0290] As shown in Figure 6, in the example shown in Figure 6, the plurality of candidate values ​​includes 2 and 4. In descending order of plurality of candidate values, the PRACH occasion groups corresponding to candidate value 4 are determined first. Referring to the PRACH occasion groups with ROG size of 4, shown in Figure 6, these PRACH occasion groups with ROG size of 4 include RO#1, RO#3, RO#9, and RO#11. Next, the PRACH occasion groups corresponding to candidate value 2 are determined. Referring to the PRACH occasion groups with ROG size of 2, shown in Figure 6, these PRACH occasion groups with ROG size of 2 include RO#17 and RO#19.

[0291] In some embodiments, when plurality of candidate values ​​is used for mapping ROs to ROGs in descending order, if the first node (such as the first node with good channel quality) chooses a relatively small candidate value (relatively small ROGs) for multiple PRACH transmissions, this can lead to inverse placement of available ROG resources, resulting in a relatively high random access delay from the first node. Implementation Two: In each subset of occasion groups, the PLURALITY OF CANDIDATE VALUES IS USED, IN DESCENDING ORDER, FOR THE MAPPING OF ROS TO ROGS.

[0292] For the PRACH occasion groups corresponding to the plurality of candidate values ​​(the plurality of ROG sizes), the PRACH occasion 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). The PRACH occasion groups corresponding to these different values Petition 870250075847, dated 08 / 27 / 2025, page 77 / 235 69 out of 103 candidates are in the same subset of occasion groups.

[0293] In some embodiments, in each subset of occasion groups, the determination of PRACH occasion groups corresponding to a relatively large candidate value (a relatively large ROG size) may be prioritized.

[0294] In some embodiments, after mapping PRACH occasions to PRACH occasion groups in a subset of occasion groups, mapping PRACH occasions to PRACH occasion groups in a next subset of occasion groups may be performed, until mapping X PRACH occasions to Q PRACH occasion groups is completed.

[0295] Referring to Figure 7, in the example shown in Figure 7, the plurality of candidate values ​​includes 2, 4, and 8, the number of ROGs to be determined with an ROG size of 8 is S1, the number of ROGs to be determined with an ROG size of 4 is S2, and the number of ROGs to be determined with an ROG size of 2 is S3. As an implementation, according to a certain proportional factor (for example, a ratio between the number of ROGs with ROG size of 8 to the number of ROGs with ROG size of 4 and to the number of ROGs with ROG size of 2 is t1: t2: t3), ROGs Y1 with ROG size of 8 can be determined first, then ROGs Y2 with ROG size of 4 are determined, and lastly ROGs Y3 with ROG size of 2 are determined, where Y1=a * t1 and Y1 is not greater than S1, Y2=a * t2 and Y2 is not greater than S2, Y3=a * t3 and Y3 is not greater than S3.After determining a set of ROGs Y1+Y2+Y3, the next set of ROGs Y1+Y2+Y3 is determined until the remaining ROGs cannot meet the mapping requirement for a set of ROGs Y1+Y2+Y3. Then, the remaining ROGs are assigned to ROGs with one or two sizes, where t1:t2:t3 can be the maximum. Petition 870250075847, dated 08 / 27 / 2025, p. 78 / 235 70 / 103 common divisor of S1 :S2:S3.

[0296] As shown in Figure 7, the proportional factor (the first proportion) of the number of ROGs corresponding to the plurality of candidate values ​​(2, 4 and 8) is 1:2:8. According to this proportion, the Y1 ROGs with ROG size of 8 are determined first (in the example shown in Figure 7, 1 ROG with ROG size of 8 is determined first), then the Y2 ROGs with ROG size of 4 are determined (in the example shown in Figure 7, 2 ROGs with ROG size of 4 are determined) and, finally, the Y3 ROGs with ROG size of 2 are determined (in the example shown in Figure 7, 8 ROGs with ROG size of 2 are determined). After determining a set of ROGs Y1+Y2+Y3, the next set of ROGs Y1+Y2+Y3 is determined until the remaining ROGs no longer meet the mapping requirement for a set of ROGs Y1+Y2+Y3. Then, the remaining ROGs are assigned to ROGs that have one or two sizes of the ROG sizes.

[0297] With the mapping scheme provided by Implementation Two, it is possible to ensure that, when the first node uses relatively small-sized ROGs for multiple PRACH transmissions, the random access resources can be found in different cycles, thus balancing the random access delay and the collision probability. In other words, the mapping scheme provided by Implementation Two can reduce the random access delay of multiple PRACH transmissions occupying relatively small-sized ROGs, thus improving the performance gain of multiple PRACH transmissions, increasing the coverage range, and improving the efficiency of random access resource utilization.

[0298] In some embodiments, in addition to the factors illustrated above, the mapping of the X occasions of PRACH to the Q groups Petition 870250075847, dated 08 / 27 / 2025, page 79 / 235 The 71 / 103 occurrences of PRACH may be related to other information, but the ways in which this disclosure is made are not limited to this. Below, some other information will be illustrated by way of example.

[0299] In some embodiments, the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to one or more of the following: the number of frequency-division multiplexed PRACH occasions in a time instance; the number of synchronization signal blocks associated with each of the X PRACH occasions; and the number of random access preambles corresponding to each of a plurality of synchronization signal blocks associated with the X PRACH occasions.

[0300] In some embodiments, the mapping of X PRACH occasions to Q groups of PRACH occasions is related to the number of frequency-division multiplexed PRACH occasions in a time instance. In other words, when the number of frequency-division multiplexed PRACH occasions in a time instance varies, the Q groups of PRACH occasions determined may vary.

[0301] In some embodiments, the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to the number of synchronization signal blocks associated with each of the X PRACH occasions. In other words, when the number of synchronization signal blocks associated with each of the X PRACH occasions varies, the Q groups of PRACH occasions determined may vary.

[0302] In some embodiments, the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to the number of random access preambles corresponding to each of a plurality of synchronization signal blocks associated with the X PRACH occasions. In other words, when the number of preambles Petition 870250075847, dated 08 / 27 / 2025, page 80 / 235 72 / 103 random access points corresponding to each of a plurality of synchronization signal blocks associated with the X PRACH occasions vary, the Q groups of PRACH occasions determined may vary.

[0303] In some embodiments, the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to the number of frequency-division multiplexed PRACH occasions at a given instant in time and the number of synchronization signal blocks associated with each of the X PRACH occasions.

[0304] In some embodiments, the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to the number of frequency-division multiplexed PRACH occasions at a given instant in time, the number of synchronization signal blocks associated with each of the X PRACH occasions, and the number of random access preambles corresponding to each of a plurality of synchronization signal blocks associated with the X PRACH occasions.

[0305] In some embodiments, after mapping ROs to ROGs, the first node can select one or more ROGs from among the determined ROGs to perform random access. This process will be illustrated with reference to Figure 8 below.

[0306] Figure 8 is a flowchart of another method applicable to a node for wireless communication provided in some embodiments of the present disclosure. The method shown in Figure 8 is illustrated from the perspective of the interaction between the first and second nodes. The first and second nodes were illustrated above and will not be repeated here.

[0307] The method shown in Figure 8 may include operations (S810) to (S830).

[0308] In (S810), the first node receives the first information. A Petition 870250075847, dated 08 / 27 / 2025, page 81 / 235 73 / 103 The first piece of information is used to determine X occasions of PRACH.

[0309] In (S820), the first node receives the second piece of information. The second piece of information is used to determine a plurality of candidate values.

[0310] For an illustration of operations (S810) and (S820), reference can be made to the illustration above of operations (S510) and (S520). For simplicity, it will not be repeated here.

[0311] In (S830), the first node transmits a plurality of random access preambles in a first group of PRACH occasions.

[0312] In some embodiments, the first node transmits the plurality of random access preambles to a second node in the first group of PRACH occasions.

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

[0314] In some embodiments, any two random access preambles of the plurality of random access preambles are identical to each other. In other words, during multiple PRACH transmissions, identical random access preambles may be transmitted repeatedly in the first group of PRACH occasions in order to enhance the coverage capacity of PRACHs.

[0315] In some embodiments, the first group of PRACH occasions is a respective group of PRACH occasions from the Q groups of PRACH occasions. For example, the first group of PRACH occasions can be any of the Q groups of PRACH occasions.

[0316] In some embodiments, the first group of PRACH occasions includes one or more PRACH occasions, and the one or more PRACH occasions in the first group of PRACH occasions are configured Petition 870250075847, dated 08 / 27 / 2025, page 82 / 235 74 / 103 to transmit the plurality of random access preambles.

[0317] In some embodiments, the first group of PRACH occasions includes only one PRACH occasion, and the single PRACH occasion in the first group of PRACH occasions is configured to transmit a random access preamble. In other words, the first group of PRACH occasions includes only one PRACH occasion, and a random access preamble is transmitted on the single PRACH occasion in the first group of PRACH occasions.

[0318] In some embodiments, the first group of PRACH occasions includes a plurality of PRACH occasions, and the plurality of PRACH occasions in the first group of PRACH occasions is configured to transmit the plurality of random access preambles, respectively. In other words, the first group of PRACH occasions includes the plurality of PRACH occasions, and the plurality of random access preambles is transmitted in the plurality of PRACH occasions in the first group of PRACH occasions, respectively.

[0319] In some embodiments, a first sequence is used to generate the plurality of random access preambles. In other words, the plurality of random access preambles transmitted in the first group of PRACH occasions is generated using the first sequence.

[0320] The embodiments of this disclosure do not specify the first sequence used to generate the plurality of random access preambles. In some embodiments, the first sequence may be composed of several sequences with good cross-correlation and autocorrelation characteristics. Several examples of first sequences are given below.

[0321] In some embodiments, the first sequence is a pseudorandom sequence. In other embodiments, the first Petition 870250075847, dated 08 / 27 / 2025, p. 83 / 235 The 75 / 103 sequence is an M sequence. In other embodiments, the first sequence is a Gold sequence. This disclosure is not limited to this; for example, the first sequence may also be one or more of a Kasami sequence, a Barker sequence, a Zadoff-Chu sequence, and similar sequences.

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

[0323] In some embodiments, the first sequence is a combination of a plurality of sequences. For example, the first sequence is a combination of pseudorandom sequences and M sequences, a combination of pseudorandom sequences and Gold sequences, or similar.

[0324] In some embodiments, the X occasions of PRACH mentioned above are within a first cycle.

[0325] In some embodiments, the first cycle refers to a mapping cycle for mapping PRACH occasions to groups of PRACH occasions.

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

[0327] In some embodiments, the mapping cycle for mapping synchronization signal blocks to PRACH occasions and the mapping cycle for mapping PRACH occasions to groups of PRACH occasions are one and the same cycle.

[0328] In some embodiments, the first cycle refers to a period of association for mapping the X PRACH occasions to the Q groups of PRACH occasions. Petition 870250075847, dated 08 / 27 / 2025, page 84 / 235 76 / 103

[0329] In some embodiments, the first cycle refers to a period of association to map indices of a plurality of candidate synchronization signal blocks to the X occasions of PRACH.

[0330] In some embodiments, the association period for mapping the X PRACH occasions to the Q groups of PRACH occasions and the association period for mapping candidate synchronization signal block plurality indices to the X PRACH occasions are the same period.

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

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

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

[0334] In some embodiments, Table 1 can be consulted for the set determined by the PRACH configuration cycle, i.e., the value of the first cycle can be determined based on Table 1. Table 1 PRACH setup cycle (msec) First cycle (number of PRACH setup cycles) 10 {1,2, 4, 8, 16} 20 {1,2, 4, 8} 40 {1, 2, 4} 80 {1,2} 160 {1}

[0335] In some embodiments, the first cycle begins in frame number 0.

[0336] In some embodiments, the mapping of the X PRACH occasions to the Q groups of PRACH occasions is performed in Petition 870250075847, dated 08 / 27 / 2025, p. 85 / 235 77 / 103 first cycle.

[0337] In some embodiments, the first cycle includes one or more PRACH time intervals. Taking as an example the first cycle which includes a plurality of PRACH time intervals, the first cycle may include 2 or more PRACH time intervals.

[0338] In some embodiments, each of the X occasions of PRACH is a corresponding PRACH time interval of the plurality of PRACH time intervals in the first cycle.

[0339] In some embodiments, the first cycle includes a plurality of PRACH occasions.

[0340] As mentioned above, the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to the number of groups of PRACH occasions corresponding respectively to each candidate value of the plurality of candidate values. The following will illustrate how to determine the number of groups of PRACH occasions corresponding respectively to each candidate value of the plurality of candidate values.

[0341] Figure 9 is a flowchart of another method applicable to a node for wireless communication provided in some embodiments of the present disclosure. The method shown in Figure 9 is illustrated from the perspective of the interaction between the first and second nodes. The first and second nodes were illustrated above and will not be repeated here.

[0342] The method shown in Figure 9 may include operations (S910) to (S930).

[0343] In (S910), the first node receives the first information. The first information is used to determine the X occasions of PRACH.

[0344] In (S920), the first node receives the second piece of information. The second piece of information is used to determine a plurality of values. Petition 870250075847, dated 08 / 27 / 2025, page 86 / 235 78 / 103 candidates.

[0345] For an illustration of operations (S910) and (S920), see the illustration above for operations (S510) and (S520). For simplicity, it will not be repeated here.

[0346] In (S930), the first node receives the third piece of information. The third piece of information is used to determine the number of PRACH occasion groups corresponding to at least one candidate value from the plurality of candidate values. In other words, the third piece of information is used to determine the number of multiple PRACH transmissions corresponding to at least one candidate value from the plurality of candidate values.

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

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

[0349] In some embodiments, the third piece of information is used to determine a ratio between the number of PRACH occasion groups of the Q PRACH occasion groups that correspond to the plurality of candidate values, respectively.

[0350] In some embodiments, the ratio between the number of PRACH occasion groups of the Q PRACH occasion groups that correspond to the plurality of candidate values, respectively, is equal to the first proportion. The illustration above of the first proportion can be consulted. For simplicity, it will not be repeated here.

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

[0352] In some embodiments, the quantity of Petition 870250075847, dated 08 / 27 / 2025, page 87 / 235 79 / 103 random access preambles corresponding to at least one candidate value from the plurality of candidate values ​​is used to determine the Q groups of PRACH occasions.

[0353] In some embodiments, the number of random access preambles in any of the subsets of PRACH occasion groups corresponding to at least one candidate value from the plurality of candidate values ​​is used to determine the Q PRACH occasion groups.

[0354] In some embodiments, the relatively large value(s) of the plurality of candidate values ​​is / are prioritized for determining the PRACH occasion Q groups, and the number of random access preambles corresponding to at least one candidate value of the plurality of candidate values ​​is used to determine the PRACH occasion Q groups.

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

[0356] In some embodiments, the relatively large value(s) of the plurality of candidate values ​​is / are determined from the plurality of candidate values ​​in descending order and is / are prioritized for the determination of the PRACH occasion Q groups, and the number of random access preambles corresponding to at least one candidate value of the plurality of candidate values ​​is used to determine the PRACH occasion Q groups.

[0357] In some embodiments, at least one group of PRACH occasions corresponds to each of the plurality of Petition 870250075847, dated 08 / 27 / 2025, page 88 / 235 80 / 103 candidate values ​​is mapped in a first-order mapping, and the first-order mapping includes one or more of the following: an increment order of random access preamble indices, an increment order of frequency features, and an increment order of time features.

[0358] In some embodiments, the at least one group of PRACH occasions corresponding to each of the plurality of candidate values ​​is mapped in the first mapping order, that is, the at least one group of PRACH occasions is mapped first in an order of increment of random access preamble indices, then it is mapped in an order of increment of frequency features, and finally it is mapped in an order of increment of time features.

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

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

[0361] In some embodiments, after determining the mapping of the X PRACH occasions to the Q groups of PRACH occasions, the first node and / or the second node can perform random access based on the mapping relations. To facilitate understanding, a four-step random access process will be used as an example to illustrate the random access processes of the first and second nodes.

[0362] Figure 10 is a flowchart of the four-step random access process. As shown in Figure 10, the four-step random access process can include operations (S1010) to (S1040).

[0363] In (S1010) (the first operation), the first node transmits Petition 870250075847, dated 08 / 27 / 2025, page 89 / 235 81 / 103 random access preambles to the second node. For example, the first node transmits a plurality of random access preambles to the second node in a first group of PRACH occasions.

[0364] In some embodiments, for operation (S1010), reference may be made to the illustration above for operation (S830).

[0365] In some embodiments, the first node transmits a plurality of random access preambles (also known as message 1, Msg1, etc.) to the second node on the PRACH resources of the first group of PRACH occasions.

[0366] In some embodiments, the first group of PRACH occasions is any of the Q groups of PRACH occasions.

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

[0368] In some embodiments, PDCCH can be transmitted through resources in the PDCCH Type 1 common search space (CSS) on the initial downlink BWP.

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

[0370] Correspondingly, the first node uses RA-RNTI to detect the PDCCH in the CSS of the Type 1 PDCCH in the initial downlink BWP and determines, after detecting the PDCCH, whether the PDCCH includes the RAR transmitted by the second node to the first node based on the PDSCH scheduled by the PDCCH. The RAR may include information such as uplink authorization for message 3 (Msg3), time advance command (TA command), temporary cell RNTI (TC-RNTI), and the like. Petition 870250075847, dated 08 / 27 / 2025, page 90 / 235 82 / 103

[0371] In some embodiments, CSS Type 1-PDCCH is configured by the second node via system messages and / or high-level parameters.

[0372] In (S1030) (the third operation), after receiving the RAR, the first node transmits message 3 (Msg3) on the uplink resources indicated by the RAR.

[0373] In some embodiments, this operation supports HARQ retransmission. That is, when the second node does not receive Msg3 correctly, the first node can use the TC-RNTI encoded PDCCH to schedule the retransmission of Msg3, and this PDCCH can carry the DCI 0_0 format.

[0374] In (S1040) (the fourth operation), the second node transmits message 4 (Msg4) to the first node, message 4 including a contention resolution message.

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

[0376] The embodiments of the method of this disclosure are illustrated in detail above, with reference to Figures 1 to 10. The embodiments of the device of this disclosure will be illustrated in detail below, with reference to Figures 11 to 14. It should be understood that the illustration of the embodiments of the method corresponds to the illustration of the embodiments of Petition 870250075847, dated 08 / 27 / 2025, page 91 / 235 83 / 103 implementation of the device; therefore, the parts that are not illustrated in detail may refer to embodiments of the method described above.

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

[0378] The first receiver (1110) can be configured to receive a first piece of information, and the first piece of information is used to determine X PRACH occasions. The X PRACH occasions are mapped to Q groups of PRACH occasions, X is a positive integer greater than 1 and Q is a positive integer.

[0379] The second receiver (1120) can be configured to receive a second piece of information, and the second piece of information is used to determine a plurality of candidate values. The number of PRACH occasions in each of the Q groups of PRACH occasions is a corresponding candidate value from the plurality of candidate values. The plurality of candidate values ​​includes a first candidate value and a second candidate value, and the larger value among the first candidate value and the second candidate value is prioritized for mapping the X PRACH occasions to the Q groups of PRACH occasions; and / or the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to the number of groups of PRACH occasions corresponding respectively to each candidate value from the plurality of candidate values.

[0380] In some embodiments, the first node further includes a first transmitter (1130) configured to transmit a plurality of random access preambles in a first group of PRACH occasions. The first group of PRACH occasions is one of the Q groups of occasions of Petition 870250075847, dated 08 / 27 / 2025, page 92 / 235 84 / 103 PRACH, and a first sequence is used to generate each random access preamble from the plurality of random access preambles.

[0381] In some embodiments, the X occasions of PRACH are within a first cycle.

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

[0383] In some embodiments, the plurality of candidate values ​​is used, in descending order, for mapping the X PRACH occasions to the Q groups of PRACH occasions.

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

[0385] In some embodiments, the quantity of at least one respective group of PRACH occasions in each subset of groups of occasions of the plurality of subsets of groups of occasions of Petition 870250075847, dated 08 / 27 / 2025, page 93 / 235 85 / 103 PRACH corresponding to a respective candidate value of the plurality of candidate values ​​corresponds to a value, and the values ​​corresponding to the plurality of candidate values ​​are in a first proportion.

[0386] In some embodiments, each subset of occasion groups of the plurality of subsets of PRACH occasion groups includes X1 respective PRACH occasions of the X PRACH occasions, and in each subset of occasion groups of the plurality of subsets of PRACH occasion groups, the plurality of candidate values ​​is used, in descending order, for mapping the X1 respective PRACH occasions to the Q1 respective PRACH occasion groups.

[0387] In some embodiments, the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to one or more of the following: the number of frequency-division multiplexed PRACH occasions in a time instance; the number of synchronization signal blocks associated with each of the X PRACH occasions; and the number of random access preambles corresponding to each of a plurality of synchronization signal blocks associated with the X PRACH occasions.

[0388] In some embodiments, the first node also includes a third receiver (1140) configured to receive a third piece of information used to determine the number of PRACH occasion groups corresponding to at least one candidate value from the plurality of candidate values.

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

[0390] In some embodiments, at least one group of Petition 870250075847, dated 08 / 27 / 2025, page 94 / 235 86 / 103 instances of PRACH corresponding to each of the plurality of candidate values ​​is mapped in a first mapping order, and the first mapping order includes one or more of: an increment order of random access preamble indices, an increment order of frequency features, and an increment order of time features.

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

[0392] In some embodiments, each of the Q groups of PRACH occasions includes a respective plurality of PRACH occasions, and at least two groups of PRACH occasions from the Q groups of PRACH occasions include at least one PRACH occasion that differs from each other, respectively.

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

[0394] In some embodiments, the first receiver (1110) and the second receiver (1120) can be implemented as a transceiver (1330). The node (1100) can also include a processor (1310) and a memory (1320), as shown in Figure 13.

[0395] Figure 12 is a schematic diagram of the structure of another node for wireless communication, provided in some embodiments. Petition 870250075847, dated 08 / 27 / 2025, page 95 / 235 87 / 103 of this disclosure. Node (1200), as shown in Figure 12, may be the second node, as illustrated above, and node (1200) may include a second transmitter (1210) and a third transmitter (1220).

[0396] The second transmitter (1210) can be configured to transmit the first information used to determine X PRACH occasions. The X PRACH occasions are mapped to Q groups of PRACH occasions, X is a positive integer greater than 1 and Q is a positive integer.

[0397] The third transmitter (1220) can be configured to transmit the second piece of information used to determine a plurality of candidate values. The number of PRACH occasions in each of the Q groups of PRACH occasions is a corresponding candidate value of the plurality of candidate values. The plurality of candidate values ​​includes a first candidate value and a second candidate value, and the higher value among the first candidate value and the second candidate value is prioritized for mapping the X PRACH occasions to the Q groups of PRACH occasions; and / or the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to the number of groups of PRACH occasions corresponding respectively to each candidate value of the plurality of candidate values.

[0398] In some embodiments, the second node further includes a fourth receiver (1230) configured to receive a plurality of random access preambles transmitted in a first group of PRACH occasions. The first group of PRACH occasions is one of the Q groups of PRACH occasions, and a first sequence is used to generate each random access preamble from the plurality of random access preambles.

[0399] In some embodiments, the X occasions of PRACH Petition 870250075847, dated 08 / 27 / 2025, page 96 / 235 88 / 103 are within a first cycle.

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

[0401] In some embodiments, the plurality of candidate values ​​is used, in descending order, for mapping the X PRACH occasions to the Q groups of PRACH occasions.

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

[0403] In some embodiments, the quantity of at least one respective group of PRACH occasions in each subset of groups of occasions of the plurality of subsets of groups of PRACH occasions corresponding to a respective candidate value of the plurality of candidate values ​​corresponds to a value, and the values ​​corresponding to the plurality of candidate values ​​are in a first proportion. Petition 870250075847, dated 08 / 27 / 2025, page 97 / 235 89 / 103

[0404] In some embodiments, each subset of occasion groups of the plurality of subsets of PRACH occasion groups includes X1 respective PRACH occasions of the X PRACH occasions, and in each subset of occasion groups of the plurality of subsets of PRACH occasion groups, the plurality of candidate values ​​is used, in descending order, for mapping the X1 respective PRACH occasions to the Q1 respective PRACH occasion groups.

[0405] In some embodiments, the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to one or more of the following: the number of frequency-division multiplexed PRACH occasions in a time instance; the number of synchronization signal blocks associated with each of the X PRACH occasions; and the number of random access preambles corresponding to each of a plurality of synchronization signal blocks associated with the X PRACH occasions.

[0406] In some embodiments, the second node also includes a fourth transmitter (1240) configured to transmit a third piece of information used to determine the number of PRACH occasion groups corresponding to at least one candidate value from the plurality of candidate values.

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

[0408] In some embodiments, at least one group of PRACH occasions corresponding to each of the plurality of candidate values ​​is mapped to a first mapping order, and the first mapping order includes one or more of: an increment order of Petition 870250075847, dated 08 / 27 / 2025, page 98 / 235 90 / 103 random access preamble indices, a frequency resource increment order, and a time resource increment order.

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

[0410] In some embodiments, each of the Q groups of PRACH occasions includes a respective plurality of PRACH occasions, and at least two groups of PRACH occasions from the Q groups of PRACH occasions include at least one PRACH occasion that differs from each other, respectively.

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

[0412] In some embodiments, the second transmitter (1210) and the third transmitter (1220) can be implemented as a transceiver (1330). The node (1200) can also include a processor (1310) and a memory (1320), as shown in Figure 13.

[0413] Figure 13 is a schematic diagram of the structure of a communication device provided in some embodiments of the present disclosure. The dashed lines in Figure 13 indicate that the units or modules are optional. The device (1300) can be configured to implement the methods described in the method embodiments. Petition 870250075847, dated 08 / 27 / 2025, page 99 / 235 91 / 103 previous. The device (1300) can be implemented as a chip, user equipment or a network device.

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

[0415] The device (1300) may also include one or more memories (1320). The one or more memories (1320) store programs that can be executed by the one or more processors (1310) to cause the one or more processors (1310) to execute the methods described in the previous method embodiments. The one or more memories (1320) may be independent of the one or more processors (1310) or may be integrated into the one or more processors (1310).

[0416] The device (1300) may also include the transceiver (1330). One or more processors (1310) may communicate with other devices or chips by means of the transceiver (1330). For example, one or more processors (1310) may transmit data and receive data from other devices or chips by means of the transceiver (1330).

[0417] Figure 14 is a schematic diagram of the modules of Petition 870250075847, dated 08 / 27 / 2025, pp. 100 / 235 92 / 103 hardware of a communication device provided in some embodiments of the present disclosure. Figure 14 shows block diagrams of a first communication device (450) and a second communication device (410) communicating with each other on the access network.

[0418] The first communication apparatus (450) includes a controller / processor (459), a memory (460), a data source (467), a transmission processor (468), a reception processor (456), a multi-antenna transmission processor (457), a multi-antenna reception processor (458), a transmitter / receiver (454) and an antenna (452).

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

[0420] In the transmission from the second communication device (410) to the first communication device (450), the second communication device (410) provides data packets from the upper layer of the core network or data source (477) to the controller / processor (475). The core network and data source (477) represent all protocol layers above layer L2. The controller / processor (475) implements the functionality of layer L2. In the transmission from the second communication device (410) to the first communication device (450), the controller / processor (475) provides header compression, encryption, packet segmentation and reordering, multiplexing between logical and transport channels, and wireless resource allocation to the first communication device (450) based on various priority metrics. The controller / processor (475) is also responsible for retransmitting lost packets and signaling to the first communication device (450). The Petition 870250075847, dated 08 / 27 / 2025, pp. 101 / 235 The 93 / 103 transmission processor (416) and the multi-antenna transmission processor (471) implement various signal processing functions for the L1 layer (i.e., the physical layer). The transmission processor (416) implements encoding and interleaving to facilitate forward error correction in the second communication device (410), as well as signal cluster mapping based on various modulation schemes (such as binary phase-shift keying, orthogonal phase-shift keying, M-phase-shift keying, and M-orthogonal amplitude modulation). The multi-antenna transmission processor (471) performs digital spatial precoding (including codebook-based precoding and non-codebook-based precoding) on ​​the encoded and modulated symbols, and beamforming processing to generate one or more spatial streams.The transmission processor (416) then maps each spatial stream to subcarriers, multiplexes the subcarriers with a reference signal (such as a pilot) in the time domain and / or frequency domain, and then uses the inverse fast Fourier transform to generate a physical channel to carry multicarrier symbol streams in the time domain. Subsequently, the multiantenna transmission processor (471) performs simulated pre-coding / beamforming operations on the multicarrier symbol streams in the time domain. Each transmitter (418) converts the baseband multicarrier symbol streams provided by the multiantenna transmission processor (471) into RF streams, which are then provided to different antennas (420).

[0421] In the transmission from the second communication device (410) to the first communication device (450), in the first communication device (450), each receiver (454) receives signals through its corresponding antenna (452). Each receiver (454) recovers the information modulated in the RF carriers and converts the RF streams into symbol streams. Petition 870250075847, dated 08 / 27 / 2025, page 102 / 235 94 / 103 baseband multicarrier signals are provided to the receiving processor (456). The receiving processor (456) and the multiantenna receiving processor (458) implement various L1 layer signal processing functions. The multiantenna receiving processor (458) performs analog receive pre-coding / beamforming operations on the baseband multicarrier symbol streams from the receiver (454). The receiving processor (456) uses the fast Fourier transform to convert the baseband multicarrier symbol streams subjected to analog receive pre-coding / beamforming operations from the time domain to the frequency domain.In the frequency domain, the physical layer data signal and the reference signal are demultiplexed by the receiving processor (456), where the reference signal is used for channel estimation, and the data signals are detected by multiple antennas in the multi-antenna receiving processor (458) to recover any spatial stream destined for the first communication device (450). The symbols in each spatial stream are demodulated and recovered in the receiving processor (456), and soft decisions are generated. Subsequently, the receiving processor (456) decodes and deinterleaves the soft decision to recover the upper layer data and control signals transmitted by the second communication device (410) on the physical channels. The upper layer data and control signals are then provided to the controller / processor (459). The controller / processor (459) implements the L2 layer functionality.The controller / processor (459) may be related to the memory (460) for storing program codes and data. The memory (460) may be called a computer-readable storage medium. In the transmission from the second communication device (410) to the first communication device (450), the controller / processor (459) provides multiplexing, packet reassembly, decryption, and decompression. Petition 870250075847, dated 08 / 27 / 2025, page 103 / 235 95 / 103 of headers and control signal processing between the transport channels and the logical channels to retrieve the upper layer data packets from the second communication device (410). Subsequently, the upper layer packets are provided to all protocol layers above layer L2. Various control signals can also be provided to L3 for processing at L3.

[0422] In the transmission from the first communication device (450) to the second communication device (410), in the first communication device (450), the upper layer data packets are provided to the controller / processor (459) using the data source (467). The data source (467) represents all protocol layers above layer L2. Similar to the transmission function described in the second communication device (410), in the transmission from the second communication device (410) to the first communication device (450), the controller / processor (459) implements header compression, encryption, packet segmentation and reordering, as well as multichannel multiplexing between logical channels and transport channels, thus implementing L2 layer functions for the user plane and the control plane. The controller / processor (459) is also responsible for retransmitting lost packets and signaling to the second communication device (410).The transmission processor (468) performs modulation mapping and channel coding processing, and the multi-antenna transmission processor (457) performs multi-antenna digital spatial precoding (including codebook-based precoding and non-codebook-based precoding) and beamforming processing. Subsequently, the transmission processor (468) modulates the generated spatial streams into multi-carrier / single-carrier symbol streams, which, after simulated precoding / beamforming in the multi-antenna transmission processor (457), are then fed to different antennas (452). Petition 870250075847, dated 08 / 27 / 2025, page 104 / 235 96 / 103 via the transmitters (454). Each transmitter (454) first converts the baseband symbol streams provided by the multiantenna transmission processor (457) into RF symbol streams and then provides them to the antennas (452).

[0423] In the transmission from the first communication device (450) to the second communication device (410), the functions of the second communication device (410) are similar to the reception functions of the first communication device (450) described in the transmission from the second communication device (410) to the first communication device (450). Each receiver (418) receives RF signals through its corresponding antenna (420), converts the received RF signals into baseband signals, and provides the baseband signals to the multi-antenna receiving processor (472) and the receiving processor (470). The receiving processor (470) and the multi-antenna receiving processor (472) jointly implement the L1 layer functions. The controller / processor (475) implements the L2 layer functions. The controller / processor (475) may be related to the memory (476) to store program codes and data.Memory (476) can be called a computer-readable storage medium. In transmission from the first communication device (450) to the second communication device (410), the controller / processor (475) provides multiplexing, packet reassembly, decryption, header decompression, and control signal processing between the transport channels and the logical channels to retrieve the data packets from the upper layer of the first communication device (450). The data packets from the upper layer of the controller / processor (475) can be provided to the core network or to all protocol layers above layer L2, and various control signals can also be provided to the core network or to L3 for processing at L3. Petition 870250075847, dated 08 / 27 / 2025, page 105 / 235 97 / 103

[0424] In some embodiments, the first communication apparatus (450) includes at least one processor and at least one memory. The at least one memory includes computer program codes. The at least one memory and the computer program codes are configured to be used in conjunction with the at least one processor. The first communication apparatus (450) receives at least: the first information used to determine X PRACH occasions, where the X PRACH occasions are mapped to Q groups of PRACH occasions, X is a positive integer greater than 1 and Q is a positive integer; and receives the second information used to determine a plurality of candidate values. The number of PRACH occasions in each of the Q groups of PRACH occasions is a corresponding candidate value of the plurality of candidate values.The plurality of candidate values ​​includes a first candidate value and a second candidate value, and the higher value among the first candidate value and the second candidate value is prioritized for mapping the X PRACH occasions to the Q groups of PRACH occasions; and / or the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to the number of groups of PRACH occasions corresponding respectively to each candidate value of the plurality of candidate values.

[0425] In some embodiments, the first communication apparatus (450) includes a memory for storing computer-readable instruction programs which, when executed by at least one processor, cause that processor to perform operations, including: receiving first information used to determine X PRACH occasions, where the X PRACH occasions are mapped to Q groups of PRACH occasions, X is a positive integer greater than 1 and Q is a positive integer; and receiving second information used to Petition 870250075847, dated 08 / 27 / 2025, page 106 / 235 98 / 103 determine a plurality of candidate values. The number of PRACH occasions in each of the Q groups of PRACH occasions is a corresponding candidate value of the plurality of candidate values. The plurality of candidate values ​​includes a first candidate value and a second candidate value, and the higher value among the first candidate value and the second candidate value is prioritized for mapping the X PRACH occasions to the Q groups of PRACH occasions; and / or the mapping of the X PRACH occasions to the Q groups of PRACH occasions is related to the number of groups of PRACH occasions corresponding respectively to each candidate value of the plurality of candidate values.

[0426] In some embodiments, the first communication device (450) corresponds to the first node of the present disclosure.

[0427] In some embodiments, the second communication device (410) corresponds to the second node of the present disclosure.

[0428] In some embodiments, the first communication device (450) is an NCR.

[0429] In some embodiments, the first communication device (450) is a wireless repeater station.

[0430] In some embodiments, the first communication device (450) is a relay.

[0431] In some embodiments, the first communication device (450) is a user device, which can function as a relay node.

[0432] In some embodiments, the first communication device (450) is a V2X-compatible user equipment, and the user equipment can function as a relay node.

[0433] In some embodiments, the first communication device (450) is a D2D-compatible user device, and the Petition 870250075847, dated 08 / 27 / 2025, page 107 / 235 99 / 103 user equipment can function as a relay node.

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

[0435] In some embodiments, 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 and / or second information in this disclosure.

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

[0437] The embodiments of this disclosure further provide a computer-readable storage medium configured to store programs. The computer-readable storage medium may be applicable to the terminal device or network device provided in the embodiments of this disclosure, and the programs cause the computer to perform the operations of the methods performed by the terminal device or network device in the embodiments of this disclosure.

[0438] The embodiments of this disclosure also provide a computer program product, including programs. The computer program product may be applicable to the terminal device or network device provided in the embodiments of this disclosure, and the programs cause the computer to perform the operations of the methods performed by the terminal device or network device in the embodiments of this disclosure.

[0439] The embodiments of this disclosure also provide a computer program. The computer program may be applicable to the terminal device or network device provided in the embodiments of Petition 870250075847, dated 08 / 27 / 2025, page 108 / 235 100 / 103 implementation of this disclosure, and the computer program causes the computer to execute the operations of the methods performed by the terminal device or network device in the embodiments of this disclosure.

[0440] It should be understood that the terms “system” and “network” in this disclosure may be used interchangeably. Furthermore, the terms used in this disclosure are used only to explain the embodiments of this disclosure and are not intended to limit this disclosure. The terms “first,” “second,” “third,” “fourth,” and similar terms in the description, claims, and drawings of this disclosure are used to distinguish different objects rather than to describe a specific order. In addition, the terms “comprises” and “has,” and any variations thereof, are intended to encompass a non-exclusive inclusion.

[0441] In the embodiments of this disclosure, “indicate” as used herein may refer to a direct indication, or it may refer to an indirect indication, or it may mean that there is a relationship of association. For example, A indicates B, which may mean that A indicates B directly, for example, B can be obtained through A; or it may mean that A indicates B indirectly, for example, A indicates C, and B can be obtained through C; or it may mean that there is a relationship of association between A and B.

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

[0443] In the forms of carrying out this disclosure, the term “correspondent” may mean that there is a direct or indirect correspondence between the two, or it may mean that there is a relationship of association. Petition 870250075847, dated 08 / 27 / 2025, page 109 / 235 101 / 103 between the two, or it could mean that there is a relationship like indicating and being indicated, or configuring and being configured.

[0444] In embodiments of this disclosure, “default” or “preconfigured” may be implemented by pre-storing corresponding codes, tables, or other formats that can be used to indicate related information in devices (for example, including terminal devices and network devices), and their specific implementations are not limited in this disclosure. For example, default may refer to defined in protocols.

[0445] In embodiments of this disclosure, the “protocol” may refer to a standard protocol in the field of communications and may include, for example, an LTE protocol, an NR protocol, and a related protocol applied to a future communications system, which is not limited to this disclosure.

[0446] In the embodiments of this disclosure, the term “and / or” is used merely to describe an association relationship between associated objects, indicating that there may be three relationships. For example, A and / or B may indicate that: only A exists, A and B exist, and only B exists. In addition, the character “ / ” here generally indicates an “or” relationship between the associated objects.

[0447] In the embodiments of this disclosure, the number of sequences of the above processes does not mean execution sequences. The execution sequences of the processes must be determined according to the internal functions and logic of the processes and should not be interpreted as any limitation to the implementation processes of the embodiments of this disclosure.

[0448] In the embodiments presented in this disclosure, it should be understood that the system, apparatus and method disclosed Petition 870250075847, dated 08 / 27 / 2025, page 110 / 235 102 / 103 can be implemented in other ways. For example, the embodiments of the devices described are merely illustrative. For instance, the division of units is merely a logical function division, and there may be other ways of division in the actual implementation. For example, a plurality of units or components may be combined or integrated into another system, or some features may be ignored or not implemented. Furthermore, the mutual, direct, or communication couplings shown or discussed may be implemented using some interfaces. Indirect or communication couplings between devices or units may be implemented in electrical, mechanical, or other forms.

[0449] The units described as separate parts may or may not be physically separate, and the parts displayed as units may or may not be physical units, may be located in one position or may be distributed across a plurality of network units. Some or all of the units may be selected according to a real need to achieve the objectives of the embodiments solutions.

[0450] Furthermore, the functional units in the embodiments of this disclosure may be integrated into a processing unit, or each of the units may exist physically in isolation, or two or more units may be integrated into a unit.

[0451] All or some of the foregoing embodiments may be implemented using software, hardware, firmware, or any combination thereof. When software is used to implement embodiments, the foregoing embodiments may be implemented wholly or partially 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 procedures or functions according to Petition 870250075847, dated 08 / 27 / 2025, page 111 / 235 103 / 103 The ways in which this disclosure is made are wholly or partly generated. A computer can be a general-purpose computer, a dedicated computer, a computer network, or other programmable devices. Computer instructions can be stored on a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via a wired connection (such as a coaxial cable, fiber optic cable, and a digital subscriber line (DSL)) or a wireless connection (such as infrared, wireless, and microwave).Computer-readable storage media can be any usable medium that can be read by a computer or a data storage device, such as a server or data center, formed by the integration of one or more usable media. The usable medium can be a magnetic medium (e.g., a floppy disk, a hard disk, or magnetic tape), an optical medium (e.g., a digital video disc (DVD)), a semiconductor medium (e.g., a solid-state drive (SSD)), or similar.

[0452] The foregoing descriptions are merely specific implementations of this disclosure, but the scope of protection of this disclosure is not limited to them. Any variation or substitution easily understood by a person skilled in the art, within the technical scope disclosed in this disclosure, will be covered by the scope of protection of this disclosure. Therefore, the scope of protection of this disclosure will be subject to the scope of protection of the claims. Petition 870250075847, dated 08 / 27 / 2025, page 112 / 235

Claims

1 / 6 Claims 1. FIRST NODE (1100) FOR WIRELESS COMMUNICATION, characterized by comprising: at least one processor (1310); and one or more memories (1320) coupled to at least one processor (1310) and storing instructions for execution by at least one processor (1310) to cause the first node (1100) to perform operations comprising: - receiving (S510, S810, S910) a first piece of information, the first piece of information comprising information indicating X instances of physical random access channel (PRACH), wherein the X PRACH instances are mapped to Q groups of PRACH instances, X is a positive integer greater than 1 and Q is a positive integer;and - receive (S520, S820, S920) a second piece of information, the second piece of information comprises a plurality of candidate values, wherein the X PRACH occasions are mapped to the Q groups of PRACH occasions based on at least one priority of a candidate value associated with a respective group of PRACH occasions or a number of groups of PRACH occasions corresponding respectively to each candidate value of the plurality of candidate values.

2. FIRST NODE (1100), according to claim 1, characterized in that X PRACH occasions are mapped to Q groups of PRACH occasions according to a decreasing order of priority of the candidate value associated with a respective group of PRACH occasions, wherein a higher candidate value has a higher priority.

3. FIRST NODE (1100), according to claim 2, characterized by the X PRACH occasions being mapped to the Q groups of PRACH occasions, further according to a number of groups of Petition 870250075847, dated 08 / 27 / 2025, page 113 / 235 2 / 6 PRACH occasions corresponding respectively to each candidate value of the plurality of candidate values.

4. FIRST NODE (1100), according to claim 1, characterized in that the operations further comprise: transmitting (S830) a plurality of random access preambles in a first group of PRACH occasions using the same spatial filter; wherein the first group of PRACH occasions is one of the Q groups of PRACH occasions, and each of the plurality of random access preambles is generated based on the same first sequence.

5. FIRST NODE (1100), according to claim 1, characterized by the X occasions of PRACH being within a first cycle.

6. FIRST NODE (1100), according to claim 1, characterized in that PRACH occasions in each of the Q groups of PRACH occasions are orthogonal to each other in the time domain; or the PRACH occasions in each of the Q groups of PRACH occasions are related to the same synchronization signal block; or the PRACH occasions in each of the Q groups of PRACH occasions are orthogonal to each other in the time domain and are related to the same synchronization signal block.

7. FIRST NODE (1100), according to claim 1, characterized in that the Q groups of PRACH occasions comprise a plurality of subsets of groups of PRACH occasions, each group of PRACH occasions in the same subset of groups of PRACH occasions is associated with the same candidate value.

8. FIRST NODE (1100), according to claim 7, characterized by the plurality of subsets of PRACH occasion groups comprising a first subset of PRACH occasion groups and a second subset of PRACH occasion groups, the first subset of PRACH occasion groups having a first quantity of PRACH occasion groups and being associated with a first candidate value, the second subset of PRACH occasion groups having a second quantity of PRACH occasion groups and being associated with a second candidate value, and the ratio between the first quantity and the second quantity being the same as the ratio between the second candidate value and the first candidate value.

9. FIRST NODE (1100), according to claim 1, characterized in that X PRACH occasions are mapped to Q groups of PRACH occasions based on one or more of: a number of frequency-division multiplexed PRACH occasions in a time instance; a number of synchronization signal blocks associated with each of the X PRACH occasions; or a number of random access preambles corresponding to each of a plurality of synchronization signal blocks associated with the X PRACH occasions.

10. FIRST NODE (1100), according to claim 1, characterized in that the operations further comprise: receiving (S930) a third piece of information, the third piece of information indicating a number of PRACH occasion groups corresponding to at least one candidate value from the plurality of candidate values.

11. FIRST NODE (1100), according to claim 1, characterized by a number of random access preambles corresponding to at least one candidate value of the plurality of candidate values ​​being used to determine the Q groups of PRACH occasions.

12. FIRST NODE (1100), according to claim 1, Petition 870250075847, dated 27 / 08 / 2025, p. 115 / 235 4 / 6 characterized by at least one group of PRACH occasions corresponding to each of the plurality of candidate values ​​being mapped in a first mapping order, and the first mapping order comprising one or more of: a random access preamble index increment order; a frequency feature increment order; and a time feature increment order.

13. FIRST NODE (1100), according to claim 1, characterized in that the first information indicates at least one of: a respective number of synchronization signal blocks corresponding to each PRACH occasion of the X PRACH occasions; or a number of random access preambles corresponding to the synchronization signal blocks corresponding to each PRACH occasion of the X PRACH occasions.

14. METHOD FOR A NODE FOR WIRELESS COMMUNICATION, characterized by comprising: receiving (S510, S810, S910) a first piece of information, the first piece of information comprising information indicating X instances of physical random access channel (PRACH), wherein the X PRACH instances are mapped to Q groups of PRACH instances, X is a positive integer greater than 1 and Q is a positive integer; and receiving (S520, S820, S920) a second piece of information, the second piece of information comprising a plurality of candidate values, wherein the X PRACH occasions are mapped to the Q groups of PRACH occasions based on at least one of a priority of a candidate value associated with a respective group of PRACH occasions or a number of groups of PRACH occasions corresponding respectively to each value. Petition 870250075847, dated 08 / 27 / 2025, p. 116 / 235 5 / 6 candidate of the plurality of values ​​candidates.

15. METHOD, according to claim 14, characterized in that X PRACH occasions are mapped to Q groups of PRACH occasions according to a decreasing order of priority of the candidate value associated with a respective group of PRACH occasions, wherein a higher candidate value has a higher priority.

16. METHOD, according to claim 15, characterized in that X PRACH occasions are mapped to Q groups of PRACH occasions, further according to a number of groups of PRACH occasions corresponding respectively to each candidate value of the plurality of candidate values.

17. METHOD, according to claim 14, characterized by further comprising: transmitting (S830) a plurality of random access preambles in a first group of PRACH occasions using the same spatial filter; wherein the first group of PRACH occasions is one of the Q groups of PRACH occasions, and each of the plurality of random access preambles is generated based on the same first sequence.

18. METHOD, according to claim 14, characterized by X occasions of PRACH being within a first cycle.

19. METHOD, according to claim 14, characterized in that PRACH occasions in each of the Q groups of PRACH occasions are orthogonal to each other in the time domain; or the PRACH occasions in each of the Q groups of PRACH occasions are related to the same synchronization signal block; or the PRACH occasions in each of the Q groups of PRACH occasions are orthogonal to each other in the time domain and are related to the same synchronization signal block.

20. ONE OR MORE COMPUTER-READABLE NON-TRANSIENTIAL STORAGE MEDIA, characterized by storing instructions that, when executed by one or more processors (1310), cause a computing device to perform operations comprising: receiving (S510, S810, S910) a first piece of information, the first piece of information comprising information indicating X instances of physical random access channel (PRACH), wherein the X PRACH instances are mapped to Q groups of PRACH instances, X is a positive integer greater than 1 and Q is a positive integer;and receive (S520, S820, S920) a second piece of information, the second piece of information comprises a plurality of candidate values, wherein the X PRACH occasions are mapped to the Q groups of PRACH occasions based on at least one priority of a candidate value associated with a respective group of PRACH occasions or a number of groups of PRACH occasions corresponding respectively to each candidate value of the plurality of candidate values. Petition 870250075847, dated 08 / 27 / 2025, pp. 118 / 235;

Images