# US 12,114,371 B1 · Method and device for node for wireless communication > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,114,371 B1 - Document ID: US12114371B1 - Status: Granted - Kind: B1 - Application number: 18/731,177 - Filed: 2024-05-31 - Granted: 2024-10-08 - Earliest claimed: 2023-06-30 - Assignees: Quectel Wireless Solutions Co., Ltd. - Applicants: Quectel Wireless Solutions Co., Ltd. - Inventors: Ling Lyu; Zheng Zhao; Zhongzhi Yang - Web page: https://patentgrep.com/patent/US12114371B1 ## CPC - H04W 74/0833: Random access procedures, e.g. with 4-step access - H04W 74/0875: {with assigned priorities based access} - H04W 74/0891: {for synchronized access} - H04W 74/006: {in the downlink, i.e. towards the terminal} - H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72) ## Abstract Provided are a method and a device applicable to a node for wireless communication. One example method includes: receiving first information, the first information comprises information indicating X physical random access channel (PRACH) occasions, wherein the X PRACH occasions are mapped to Q PRACH occasion groups, X is a positive integer greater than 1, and Q is a positive integer; and receiving second information, the second information comprises a plurality of candidate values, wherein the X PRACH occasions are mapped to the Q PRACH occasion groups based at least one of a priority of a candidate value associated with a respective PRACH occasion group or a quantity of PRACH occasion groups respectively corresponding to each candidate value of the plurality of candidate values. ## Claims ### Claim 1 A first node for wireless communication, comprising: at least one processor; and one or more memories coupled to the at least one processor and storing programming instructions for execution by the at least one processor to cause the first node to perform operations comprising: receiving first information, the first information comprises information indicating X physical random access channel (PRACH) occasions, wherein the X PRACH occasions are mapped to Q PRACH occasion groups, X is a positive integer greater than 1, and Q is a positive integer; and receiving second information, the second information comprises a plurality of candidate values, wherein the X PRACH occasions are mapped to the Q PRACH occasion groups based at least one of a priority of a candidate value associated with a respective PRACH occasion group or a quantity of PRACH occasion groups respectively corresponding to each candidate value of the plurality of candidate values. ### Claim 2 (depends on 1) The first node according to claim 1, wherein the X PRACH occasions are mapped to the Q PRACH occasion groups according to a descending order of a priority of the candidate value associated with a respective PRACH occasion group, wherein a higher candidate value has a higher priority. ### Claim 3 (depends on 2) The first node according to claim 2, wherein the X PRACH occasions are mapped to the Q PRACH occasion groups further according to a quantity of PRACH occasion groups respectively corresponding to each candidate value of the plurality of candidate values. ### Claim 4 (depends on 1) The first node according to claim 1, wherein the operations further comprise: transmitting a plurality of random access preambles on a first PRACH occasion group using a same spatial filter; wherein the first PRACH occasion group is one of the Q PRACH occasion groups, and each of the plurality of random access preambles is generated based on a same first sequence. ### Claim 5 (depends on 1) The first node according to claim 1, wherein the X PRACH occasions are within a first cycle. ### Claim 6 (depends on 1) The first node according to claim 1, wherein the PRACH occasions in each of the Q PRACH occasion groups are orthogonal to each other in time domain; or the PRACH occasions in each of the Q PRACH occasion groups are related to a same synchronization signal block; or the PRACH occasions in each of the Q PRACH occasion groups are orthogonal to each other in time domain and are related to a same synchronization signal block. ### Claim 7 (depends on 1) The first node according to claim 1, wherein the Q PRACH occasion groups comprises a plurality of PRACH occasion group sub-sets, each PRACH occasion group in the same PRACH occasion group sub-set is associated with a same candidate value. ### Claim 8 (depends on 7) The first node according to claim 7, wherein the plurality of PRACH occasion group sub-sets comprises a first PRACH occasion group sub-set and a second PRACH occasion group sub-set, the first PRACH occasion group sub-set has a first quantity of PRACH occasion groups and is associated with a first candidate value, the second PRACH occasion group sub-set has a second quantity of PRACH occasion groups and is associated with a second candidate value, a ratio between the first quantity and the second quantity is same as a ratio between the second candidate value and the first candidate value. ### Claim 9 (depends on 1) The first node according to claim 1, wherein the X PRACH occasions are mapped to the Q PRACH occasion groups based on one or more of: a quantity of frequency division multiplexed PRACH occasions in a time instance; a quantity of synchronization signal blocks associated with each of the X PRACH occasions; or a quantity of random access preambles corresponding to each of a plurality of synchronization signal blocks associated with the X PRACH occasions. ### Claim 10 (depends on 1) The first node according to claim 1, wherein the operations further comprise: receiving third information, the third information indicates a quantity of PRACH occasion groups corresponding to at least one candidate value of the plurality of candidate values. ### Claim 11 (depends on 1) The first node according to claim 1, wherein a quantity of random access preambles corresponding to at least one candidate value of the plurality of candidate values is used to determine the Q PRACH occasion groups. ### Claim 12 (depends on 1) The first node according to claim 1, wherein at least one PRACH occasion group corresponding to each of the plurality of candidate values is mapped in a first mapping order, and the first mapping order comprises one or more of: an increment order of indexes of random access preambles; an increment order of frequency resources; and an increment order of time resources. ### Claim 13 (depends on 1) The first node according to claim 1, wherein the first information indicates at least one of: a respective quantity of synchronization signal blocks corresponding to each PRACH occasion of the X PRACH occasions; or a quantity of random access preambles corresponding to the synchronization signal blocks corresponding to each PRACH occasion of the X PRACH occasions. ### Claim 14 A method, comprising: receiving first information, the first information comprises information indicating X physical random access channel (PRACH) occasions, wherein the X PRACH occasions are mapped to Q PRACH occasion groups, X is a positive integer greater than 1, and Q is a positive integer; and receiving second information, the second information comprises a plurality of candidate values, wherein the X PRACH occasions are mapped to the Q PRACH occasion groups based at least one of a priority of a candidate value associated with a respective PRACH occasion group or a quantity of PRACH occasion groups respectively corresponding to each candidate value of the plurality of candidate values. ### Claim 15 (depends on 14) The method according to claim 14, wherein the X PRACH occasions are mapped to the Q PRACH occasion groups according to a descending order of a priority of the candidate value associated with a respective PRACH occasion group, wherein a higher candidate value has a higher priority. ### Claim 16 (depends on 15) The method according to claim 15, wherein the X PRACH occasions are mapped to the Q PRACH occasion groups further according to a quantity of PRACH occasion groups respectively corresponding to each candidate value of the plurality of candidate values. ### Claim 17 (depends on 14) The method according to claim 14, further comprising: transmitting a plurality of random access preambles on a first PRACH occasion group using a same spatial filter; wherein the first PRACH occasion group is one of the Q PRACH occasion groups, and each of the plurality of random access preambles is generated based on a same first sequence. ### Claim 18 (depends on 14) The method according to claim 14, wherein the X PRACH occasions are within a first cycle. ### Claim 19 (depends on 14) The method according to claim 14, wherein the PRACH occasions in each of the Q PRACH occasion groups are orthogonal to each other in time domain; or the PRACH occasions in each of the Q PRACH occasion groups are related to a same synchronization signal block; or the PRACH occasions in each of the Q PRACH occasion groups are orthogonal to each other in time domain and are related to a same synchronization signal block. ### Claim 20 One or more non-transitory computer-readable media storing computer instructions, that when executed by one or more processors, cause a computing device to perform operations comprising: receiving first information, the first information comprises information indicating X physical random access channel (PRACH) occasions, wherein the X PRACH occasions are mapped to Q PRACH occasion groups, X is a positive integer greater than 1, and Q is a positive integer; and receiving second information, the second information comprises a plurality of candidate values, wherein the X PRACH occasions are mapped to the Q PRACH occasion groups based at least one of a priority of a candidate value associated with a respective PRACH occasion group or a quantity of PRACH occasion groups respectively corresponding to each candidate value of the plurality of candidate values.