CN113767709A

CN113767709A - Resource mapping for low latency RACH

Info

Publication number: CN113767709A
Application number: CN201980096028.0A
Authority: CN
Inventors: 张元涛; E·法拉格
Original assignee: Nokia Shanghai Bell Co Ltd; Nokia Solutions and Networks Oy
Current assignee: Nokia Shanghai Bell Co Ltd; Nokia Solutions and Networks Oy
Priority date: 2019-05-03
Filing date: 2019-05-03
Publication date: 2021-12-07
Also published as: WO2020223842A1

Abstract

According to some example embodiments, a method may include generating, by a network entity, at least one interleaving mapping pattern. The method may also include transmitting, by the network entity, at least one interlace mapping pattern to a user equipment. The method may also include receiving, by the network entity, at least one PUSCH according to the at least one determined interlace mapping pattern.

Description

Resource mapping for low latency RACH

Background

The technical field is as follows:

certain example embodiments may relate to a communication system. For example, some example embodiments may relate to preamble transmission.

Description of related art:

the 3GPP Technical Report (TR)38.889 describes 4-and 2-step Random Access Channel (RACH) procedures intended to be supported under new radios of licensed and unlicensed spectrum (NR-U). The 2-step RACH refers to a procedure capable of completing a contention-based RACH (cbra) in two steps as explained below.

Disclosure of Invention

According to some example embodiments, a method may include generating, by a network entity, at least one interleaving mapping pattern. The method may also include transmitting, by the network entity, the at least one interlace mapping pattern to the user equipment. The method may also include receiving, by the network entity, at least one PUSCH according to the determined at least one interleaving mapping pattern.

According to some example embodiments, an apparatus may comprise means for generating at least one interleaving mapping pattern. The apparatus may also include means for transmitting the at least one interlace mapping pattern to a user equipment. The apparatus may also include means for receiving at least one PUSCH according to the at least one determined interlace mapping mode.

According to some example embodiments, an apparatus may include at least one processor and at least one memory including computer program code. The at least one memory and the computer program code may be configured to, with the at least one processor, cause the apparatus at least to generate at least one interlace mapping pattern. The at least one memory and the computer program code may also be configured to, with the at least one processor, cause the apparatus at least to transmit at least one interlace mapping pattern to a user equipment. The at least one memory and the computer program code may also be configured to, with the at least one processor, cause the apparatus at least to receive at least one PUSCH according to the determined at least one interleaving mapping pattern.

According to some example embodiments, a non-transitory computer readable medium may be encoded with instructions that, when executed in hardware, may perform a method. The method may include generating at least one interlace mapping pattern. The method may further include transmitting the at least one interlace mapping pattern to the user equipment. The method may also include receiving at least one PUSCH according to the at least one determined interlace mapping mode.

According to some example embodiments, a computer program product may perform a method. The method may include generating at least one interlace mapping pattern. The method may further include transmitting the at least one interlace mapping pattern to the user equipment. The method may also include receiving at least one PUSCH according to the at least one determined interlace mapping mode.

According to some example embodiments, an apparatus may include circuitry configured to generate at least one interleaving mapping pattern. The circuitry may also transmit the at least one interlace mapping pattern to the user equipment. The circuitry may also receive at least one PUSCH according to the at least one determined interlace mapping mode.

According to some example embodiments, a method may include receiving, by a user equipment, at least one interlace mapping pattern from a network entity. The method may also include determining, by the user equipment, at least one association between the at least one MsgA RA time instance and the at least one MsgA PUSCH time instance at a first level. The method may also include determining, by the user equipment at the second stage, at least one association between the at least one MsgA RA occasion and the at least one MsgA PUSCH occasion. The method may also include transmitting, by the user equipment, the at least one PUSCH according to the at least one determined interleaving mapping pattern. The method may also include determining, by the user equipment, at least one association between at least one MsgA RA preamble within at least one MsgA RA time and/or at least one MsgA PUSCH resource element within at least one MsgA PUSCH resource.

According to some example embodiments, an apparatus may include means for receiving at least one interlace mapping pattern from a network entity. The apparatus may also include means for determining, at a first stage, at least one association between at least one MsgA RA time instance and at least one MsgA PUSCH time instance. The apparatus may also include means for receiving at least one PUSCH according to the at least one determined interlace mapping mode.

According to some example embodiments, an apparatus may include at least one processor and at least one memory including computer program code. The at least one memory and the computer program code may be configured to, with the at least one processor, cause the apparatus at least to generate at least one interlace mapping pattern. The at least one memory and the computer program code may also be configured to, with the at least one processor, cause the apparatus at least to transmit at least one interlace mapping pattern to a user equipment. The at least one memory and the computer program code may also be configured to, with the at least one processor, cause the apparatus at least to receive at least one PUSCH according to at least the at least one determined interlace mapping pattern.

Drawings

For a proper understanding of the present disclosure, reference should be made to the accompanying drawings, in which:

fig. 1(a) illustrates an example of a 4-step RACH procedure, according to some example embodiments.

Fig. 1(b) illustrates an example of a 2-step RACH procedure in accordance with some example embodiments.

Fig. 2 illustrates an example of a mapping between synchronization signal blocks and physical random access channels, according to some example embodiments.

Fig. 3 illustrates an example of MsgA physical uplink shared channel resources associated with an MsgA wireless access occasion, according to some example embodiments.

Fig. 4 illustrates an example of a signaling diagram in accordance with some example embodiments.

Fig. 5 illustrates an example of mapping radio access occasions and preamble sets to physical uplink shared channel resources, according to some example embodiments.

Fig. 6 illustrates another example of mapping radio access occasions and preamble sets to physical uplink shared channel resources, in accordance with certain example embodiments.

Fig. 7 illustrates another example of mapping radio access occasions and preamble sets to physical uplink shared channel resources, in accordance with certain example embodiments.

Fig. 8 illustrates an example of a method performed by a network entity, according to some example embodiments.

Fig. 9 illustrates an example of a method performed by a user equipment, according to some example embodiments.

FIG. 10 illustrates an example of a system according to some example embodiments.

Fig. 11 illustrates an example of mapping a preamble associated with an SSB within an RO to a PUSCH occasion, according to some example embodiments.

Detailed Description

In contrast to the conventional 4-step random access procedure (RACH), 3GPP RAN #82 proposes a random access procedure. This includes, for example, MsgA transmitted from a user equipment to a base station (such as a gNB). The base station may then respond to the user equipment with MsgB. As an example, fig. 1(a) illustrates basic steps of a 4-step RACH procedure, and fig. 1(b) illustrates basic steps of a 2-step RACH procedure. The 2-step RACH procedure provides lower signaling overhead and lower delay, which is preferable for New Radio (NR) usage scenarios, such as ultra-reliable low-latency communication (URLLC) and enhanced mobile broadband (eMBB).

3GPP RP-182894 discusses that 2-step RACH can be used for all Radio Resource Control (RRC), while the trigger for 4-step RACH can also be applied to 2-step RACH, except for Beam Failure Recovery (BFR). Thus, the 2-step RACH may be used for RRC state transition from RRC IDLE/RRC INACTIVE to RRC CONNECTED and Uplink (UL) synchronization re-establishment for RRC CONNECTED.

MsgA in 2-step RACH may include a preamble sequence and a data block. For example, a preamble sequence is transmitted in a configured PRACH resource (such as an RA opportunity). The UE may randomly select a preamble sequence from a pool of sequences to inform the base station of the requirements for access to the network. In addition, the data block is transmitted in the configured MsgA PUSCH resource. For example, it may include an RRC setup request, a scheduling request, or a data payload, depending on the usage scenario. In addition, the MsgB in the second step may be transmitted from the base station to the user equipment. It may be transmitted based on the base station's schedule and may include the equivalent of Msg2 and Msg4 in a 4-step RACH.

The 5G NR defines the mapping between SSBs and PRACH preambles and occasions. The mapping rules may start with a preamble followed by frequency, time and time slots. Fig. 2 illustrates an example of how 8 SSBs may be mapped to a series of RA occasions, where each box in the PRACH represents an RA occasion.

The UE may determine the best SSB through measurement when accessing the network, and the best SSB may correspond to the best downlink beam. The UE may then determine RA occasions associated with such SSBs for PRACH preamble transmissions by predefined mapping rules. The mapping scheme ensures that the PRACH can be received from the best receive beam.

For msgA, the base station may need to configure resources for PRACH preamble and msgA PUSCH. The resource configuration may be similar to that of the conventional 4-step RACH. Specifically, the time instance configured for msgA preamble transmission is the msgA RA time instance. MsgA RA time instances refer to time instances in a 2-step RA preamble transmission, where one RA time instance includes at least one MsgA RA opportunity according to at least one configuration. The MsgA RA occasion may be a time-frequency resource for at least one MsgA preamble transmission. For one msgA RA time instance, the base station may configure one or more RA occasions. The time instance of the resource containing msgA PUSCH is the msgA PUSCH time instance. The msgA PUSCH time instance may comprise a time instance of a 2-step RA, wherein one PUSCH time instance comprises at least one PUSCH resource based on at least one configuration. The MsgA PUSCH resources may include at least one time-frequency resource for MsgA PUSCH transmission. For one msgA PUSCH time instance, the base station may configure one or more msgA PUSCH resources. The msgA RA time instance and the msgA PUSCH time instance may be interrelated. Further, the at least one MsgA PUSCH resource (time-frequency resource) may comprise at least one PUSCH resource element, wherein the PUSCH resource element may correspond to the at least one DMRS port and/or the at least one DMRS sequence. Fig. 3 illustrates an example in which msgA RA time instances and msgA PUSCH time instances are combined together. PUSCH transmission in a 2-step RACH msgA may be contention-based. When two or more UEs transmit msgA PUSCH in the same resource element at the same time, interference may be generated and msgA PUSCH detection performance may be degraded.

Certain example embodiments described herein may have various benefits and/or advantages. For example, some example embodiments may enable signals from different beams to be transmitted from different UEs in the same resource, thereby reducing interference between data signals and improving the reliability of 2-step RACH. Accordingly, certain example embodiments relate to improvements in computer-related technology, particularly by conserving network resources and reducing power consumption of network entities and/or user equipment located within a network.

Fig. 4 illustrates an example of a signaling diagram showing communication between NE420 and UE 430. NE420 may be similar to NE1010 and UE430 may be similar to UE 1020, both UE 1010 and UE 1020 being illustrated in fig. 10.

In step 401, NE420 may generate at least one interlace mapping pattern. For example, the at least one staggering mapping pattern may include at least one association between at least one msgA RA occasion and at least one PUSCH resource such that signals from separate beams are different in the same resource. Alternatively, the at least one association may be between the at least one preamble and one PUSCH resource element. In some example embodiments, at least one interleaving mapping pattern may be associated with at least one capability of NE420 related to how many beams NE420 may recover from a signal from one MsgA PUSCH resource. The at least one interlace mapping mode may be configured to configure the UE430 for how many RA occasions corresponding to different beams may map to the same MsgA PUSCH resource.

In some example embodiments, the granularity of the at least one interlace mapping mode may be determined according to the number of RA occasions corresponding to different beams that may map to the same MsgA PUSCH resource and/or number of RA occasions. For example, at least one interlace mapping pattern may have a granularity m, where m corresponds to RA occasions k, k + m, k +2m, etc., that map to the same resource.

In various example embodiments, if there are more than 1 MsgA RA time instances in the first level association configured to be associated with the same MsgA PUSCH occasion, at least one of the RA time instances may be numbered sequentially. Then, at least one interleaving mapping pattern may be applied to at least one RA occasion.

In some example embodiments, wherein the K RA occasions are associated with N PUSCH resources in at least one uplink slot corresponding to an MsgA PUSCH time instance, and wherein the NE420 can recover up to P beam signals in a single resource, the number X of preamble sets in each RA occasion is determined to be X N P/K preamble sets, wherein each preamble set has the same number of preambles. Additionally or alternatively, at least one interleaving mapping pattern of P RA occasions may be mapped to the same resource, wherein a gap m of identifiers of RA occasions mapped to the same PUSCH resource may be determined as m ═ K/P. In the case of N ═ K/P, at least one interleaving mapping pattern may be configured such that, for the nth PUSCH resources associated with K + m, K +2m RA occasions, the nth set of preambles from each RA occasion may be mapped to PUSCH resources. The NE may configure at least one of a value P, a value X, a value m, a value N, and/or a value K for the UE. For some parameters, at least one of these values may not be directly configured, but rather determined by other configured parameters, such as the number of RA time instances and the product of the number of RA opportunities and each RA time instance. The mapping pattern may then be determined at the NE and the UE accordingly, so as to have a common understanding of how the interleaving mapping pattern and the preamble set are determined in the NE and the UE.

In certain example embodiments, where the granularity of the interlace mapping mode is greater than 1 and the number of MsgA PUSCH resources is not less than the number of RA occasions, the preambles for each RA occasion may be divided into multiple sets. As an example, at least one interleaving mapping pattern may be configured such that for an nth PUSCH resource associated with the same group of k, k + m, k +2m RA occasions, an nth preamble set from each RA occasion may be mapped to a PUSH resource.

Fig. 5 illustrates an example of a base station capable of receiving PUSCH from 2 different beams simultaneously, where N4 MsgA PUSCH resources are associated with K4 RA occasions, where the mapping of RA occasions and preamble sets to MsgA PUSCH resources is as follows:

PUCCH resource index	RA opportunity indexing	Preamble set index
			Resource
1	RA occasions 1, 3	Preamble set 1
			Resource 2	RA occasions 2, 4	Preamble set 1
Resource 3	RA occasions 1, 3	Preamble set 2
			Resource 4	RA occasions 2, 4	Preamble set 2

Fig. 6 illustrates an example of a base station capable of receiving PUSCH from 2 different beams simultaneously, where N4 MsgA PUSCH resources are associated with K8 RA occasions, where the mapping of RA occasions and preamble sets to MsgA PUSCH resources is as follows:

PUCCH resource index	RA opportunity indexing	Preamble set index
			Resource
1	RA occasions 1, 5	Preamble set 1
			Resource 2	RA occasions 2, 6	Preamble set 1
Resource 3	RA occasions 3, 7	Preamble set 1
			Resource 4	RA occasions 4, 8	Preamble set 1

However, if the base station is configured to recover 4 beam data signals, PUSCH from P4 different beams are received simultaneously, where N4 MsgA PUSCH resources are associated with K8 RA occasions, where the RA occasions and preamble sets are mapped with MsgA PUSCH resources as follows:

PUCCH resource index	RA opportunity indexing	Preamble set index
			Resource
1	RA occasions 1, 3, 5, 7	Preamble set 1
			Resource 2	RA occasions 2, 4, 6, 8	Preamble set 1
Resource 3	RA occasions 1, 3, 5, 7	Preamble set 2
			Resource 4	RA occasions 2, 4, 6, 8	Preamble set 2

Fig. 7 illustrates an example of a base station capable of receiving PUSCH from 2 different beams simultaneously, where N4 MsgA PUSCH resources are associated with K2 RA occasions, where the mapping of RA occasions and preamble sets to MsgA PUSCH resources is as follows:

PUCCH resource index	RA opportunity indexing	Preamble set index
			Resource
1	RA occasions 1, 2	Preamble set 1
			Resource 2	RA occasions 1, 2	Preamble set 2
Resource 3	RA occasions 1, 2	Preamble set 3
			Resource 4	RA occasions 1, 2	Preamble set 4

In step 403, NE420 may transmit at least one interlace mapping pattern to UE 430. In step 405, the UE430 may determine at least one association between at least one MsgA RA time instance and at least one MsgA PUSCH time instance at a first level.

In step 407, the UE430 may determine at least one association between at least one MsgA RA occasion and at least one MsgA PUSCH resource at a second level by configuring the UE430 with at least one of a value P, a value X, a value m, a value N, and/or a value K. In step 409, the UE430 may transmit at least one PUSCH according to the at least one determined interleaving mapping pattern.

Fig. 8 illustrates an example of a method performed by a NE (such as NE1010 in fig. 10). In step 801, the NE may generate at least one interlace mapping pattern. For example, the at least one staggering mapping pattern may include at least one association between at least one msgA RA occasion and at least one PUSCH resource such that signals from separate beams are transmitted from different UEs in the same resource. Alternatively, the at least one association may be between the at least one preamble and one PUSCH resource element. In some example embodiments, the at least one interleaving mapping pattern may be associated with at least one capability of the NE related to how many beams the NE may recover from a signal from one MsgA PUSCH resource. The at least one interlace mapping mode may be configured to configure the UE for how many RA occasions corresponding to different beams may map to the same MsgA PUSCH resource.

In some example embodiments, wherein the K RA occasions are associated with N PUSCH resources in at least one uplink slot corresponding to an MsgA PUSCH time instance, and wherein the NE420 can recover up to P beam signals in a single resource, the number X of preamble sets in each RA occasion is determined to be X N P/K preamble sets, wherein each preamble set has the same number of preambles. Additionally or alternatively, at least one interleaving mapping pattern of P RA occasions may be mapped to the same resource, wherein a gap m of identifiers of RA occasions mapped to the same PUSCH resource may be determined as m ═ K/P. In the case of N ═ K/P, at least one interleaving mapping pattern may be configured such that, for the nth PUSCH resources associated with K + m, K +2m RA occasions, the nth set of preambles from each RA occasion may be mapped to PUSCH resources.

In step 803, the NE may transmit at least one interlace mapping mode to a UE, such as UE 1020 in fig. 10. In step 805, the NE may receive at least one PUSCH according to at least one determined interleaving mapping pattern.

Fig. 9 illustrates an example of a method performed by a UE, such as UE 1020 in fig. 10. In step 901, the UE may receive at least one interlace mapping pattern from a NE (such as NE1010 in fig. 10). For example, the at least one interleaving mapping pattern may comprise at least one association between at least one msgA RA occasion and at least one PUSCH resource and/or at least one association between at least one msgA PRACH preamble and at least one msgA PUSCH resource element, such that signals from separate beams are transmitted from different UEs in the same resource. In some example embodiments, the at least one interleaving mapping pattern may be associated with at least one capability of the NE related to how many beams the NE may recover from a signal from one MsgA PUSCH resource. The at least one interlace mapping mode may be configured to configure the UE430 for how many RA occasions corresponding to different beams may map to the same MsgA PUSCH resource.

In some example embodiments, wherein the K RA occasions are associated with N PUSCH resources in at least one uplink slot corresponding to an MsgA PUSCH time instance, and wherein the NE420 can recover up to P beam signals in a single resource, the number X of preamble sets in each RA occasion is determined to be X N P/K preamble sets, wherein each preamble set has the same number of preambles. Additionally or alternatively, at least one interleaving mapping pattern of P RA occasions may be mapped to the same resource, wherein a gap m of identifiers of RA occasions mapped to the same PUSCH resource may be determined as m ═ K/P. In the case of N ═ K/P, at least one interleaving mapping mode may be configured such that, for the nth PUSCH resources associated with K + m, K +2m RA occasions, the nth set of preambles from each RA occasion may be mapped to PUSCH resources.

In step 903, the UE may determine at least one association between at least one MsgA RA time instance and at least one MsgA PUSCH time instance at a first level. In step 905, the UE may determine at least one association between at least one MsgA RA occasion and at least one MsgA PUSCH resource at a second level. In step 907, the UE may determine at least one association between the at least one preamble and the at least one PUSCH resource element at a third level. In step 909, the UE may transmit at least one PUSCH according to the at least one determined interlace mapping mode.

In some embodiments, support may be provided for one-to-one and many-to-one mapping between each RO and the preamble in the associated PUSCH resource element. In particular, a configurable number of preambles (including one or more) may be mapped to one PUSCH resource element. With one-to-one mapping, PUSCH resource reservation may be high, as each preamble may require a separate PUSCH resource element. E.g., 64 SSBs, each RO may contain a preamble associated with 4 SSBs. In this case, there may be a total of 16 ROs covering all 64 SSBs. Since each RO contains 64 preambles, there are 1024 preambles in total. Alternatively, in case of one-to-one mapping, the total number of required PUSCH resource elements is 1024 PUSCH resource elements. If there are 8 PUSCH resource elements per PUSCH occasion, the number of PUSCH occasions is 128. If there are 16 PUSCH resource elements per PUSCH occasion, the number of PUSCH occasions is 64. In both cases, the PUSCH resource reservation is rather high.

In the case of many-to-one mapping, multiple preambles (e.g., P preambles) may be mapped to the same PUSCH resource element. Using the example in paragraph [0059], where P ═ 4, if there are 8 PUSCH resource elements per PUSCH, the number of PUSCH occasions is 32. The number of PUSCH occasions is 16 if there are 16 PUSCH resource elements per PUSCH occasion. With many-to-one mapping, the number P of preambles mapped to the same PUSCH resource element may be a configurable value, where P ═ 1 is a special case corresponding to one-to-one mapping of preambles and PUSCH resource elements.

With regard to many-to-one mapping, if multiple preambles are mapped to the same PUSCH resource element, and if more than one such preamble is transmitted, the PUSCH resources corresponding to the transmitted preambles may interfere with each other, resulting in decoding errors. To reduce interference between PUSCH transmissions corresponding to preambles mapped to the same PUSCH resource element, spatial separation between PUSCH transmissions may be utilized as this minimizes the interference each PUSCH transmission causes on other PUSCH transmissions on the same resource.

Preambles corresponding to different SSBs and/or different ROs may be mapped to the same PUSCH resource element. Since the PUSCH transmission for each preamble corresponds to a different SSB beam direction, the PUSCH transmissions may be spatially separated in the receiver and may be decoded with minimal interference with each other.

Fig. 11 illustrates an example with 2 PRACH occasions and 4 PUSCH occasions. There are 64 preambles per PRACH opportunity and 2 SSBs mapped to PRACH opportunities. There are 8 PUSCH resource elements per PUSCH opportunity. There are a total of 4 SSBs on 2 ROs, each with 32 preambles. The preambles of each SSB are divided into 4 groups of 8 preambles each. Each group is mapped to a different PUSCH occasion, where each preamble in a group is mapped to a PUSCH resource element. In this example, there are 128 preambles and 32 PUSCH resource elements in total, each PUSCH resource element having 4 preambles mapped to different SSBs associated with it.

In various embodiments, preambles corresponding to different SSBs and/or ROs may be mapped to the same PUSCH resource element. In the example, there are K ROs, and each RO has K1 preambles. Thus, the total number of available preambles is K × K1. Further, with respect to the N PUSCH occasions, there are N1 PUSCH resource elements each. Thus, the total number of available resource units is N × N1. In addition, P ═ (K × K1)/(N × N1), where P may be an integer, such as P preambles mapped to the same PUSCH resource element. Preambles on all ROs may be numbered sequentially from 0, 1, … …, K … …, K1-1. The PUSCH resource elements on all PUSCH occasions may be numbered sequentially from 0, 1, … …, N … …, N × N1-1.

In an example, to determine PUSCH resource elements for preamble k, consider m ═ mod (k, N × N1), where preambles are separated by N × N1 indices with the same value of m. N rev _ digits (m), where N × N1 is a power of 2, and N is the reverse order bit of m. If N1 is not a power of 2, it is decomposed into prime components, and the value of m is expressed in terms of the number of bits (digit) of these prime components, starting with the smallest prime as the least significant digit. For example, if N × N1 ═ 12 ═ 3 × 2^2, then m is represented as a 3-digit number, the first digit takes on the

values

0, 1, the second digit takes on the

values

0, 1, and the third digit takes on the

values

0, 1, 2. For example, 9 may be denoted as 201(═ 2 × 4+0 × 2+1 × 1). The reverse digit is (102 ═ 1 × 6+0 × 3+2 × 1 ═ 8). This alternative is just to continuously consider the mapping of preambles without considering the ROs in which they are located.

In an example, K1/N (average) preambles in the same RO or (mapped to the same SSB in the RO) may be mapped to different PUSCH occasions. The preamble may then be mapped consecutively to different PUSCH resource elements in the same PUSCH occasion. For example, the mapping rule of the preamble k1 with the PUSCH occasion n and the PUSCH resource element n1 in the RO k may be:

where frac (x) is a fractional portion of x. These equations may distribute the preambles in each RO as evenly as possible between PUSCH occasions.

In an embodiment, there may be L SSBs per RO (L > 1). For mapping purposes, the preamble of each SSB may be mapped to a PUSCH occasion. The same equation as that of paragraph [0066] can be used, where K1 is replaced by K1/L and K is replaced by K x L. k is the SSB number, where SSBs are numbered sequentially on all ROs, and k1 is the preamble number in an SSB starting from index 0 in each SSB.

As described above, fig. 11 illustrates 2 PRACH occasions and 4 PUSCH occasions. There are 64 preambles per PRACH opportunity and 2 SSBs mapped to PRACH opportunities. There are 8 PUSCH resource elements per PUSCH opportunity. There are a total of 4 SSBs on 2 ROs, each with 32 preambles. The preambles of each SSB are divided into 4 groups of 8 preambles each. Each group is mapped to a different PUSCH occasion, where each preamble in a group is mapped to a PUSCH resource element. In this example, there are 128 preambles and 32 PUSCH resource elements in total, each as 4 preambles mapped to different SSBs associated with it.

In some embodiments, where a set of M consecutive preambles is mapped to the same PUSCH resource unit, K1 is replaced by floor (K1/M) and K1 is replaced by K1/M, and the equations of paragraph [0066] can be reused. In various embodiments, a set of M consecutive preambles therein are all mapped to the same PUSCH resource element. Each RO has L SSBs (L > 1). In this case, K1 is replaced by floor (K1/M), K1 ═ K1/(M × L) and K ═ K × L, and the equation of paragraph [0066] is reused. k is the SSB number, and k1 is the preamble group number of each SSB in the SSB starting from index 0 (the preamble group has M preambles and is mapped to a PUSCH resource element).

FIG. 10 illustrates an example of a system according to some example embodiments. In an example embodiment, the system may include a plurality of devices, such as, for example, a network entity 1010 and/or a user device 1020.

The network entity 1010 may be one or more base stations, such as a millimeter wave antenna, an evolved node b (enb) or 5G or a new radio node b (gnb), a serving gateway, a server, and/or any other access node or combination thereof. Further, the network entity 1010 and/or the user equipment 1020 may be one or more citizen wide radio service devices (CBSDs).

User device 1020 may include one or more mobile devices such as a mobile phone, a smart phone, a Personal Digital Assistant (PDA), a tablet computer or portable media player, a digital camera, a pocket video camera, a video game, a navigation unit such as a Global Positioning System (GPS) device, a desktop or laptop computer, a single location device such as a sensor or smart meter, or any combination thereof.

One or more of these devices may include at least one processor, indicated as 1011 and 1021, respectively.

Processors

1011 and 1021 may be embodied by any computing or data processing device, such as a Central Processing Unit (CPU), Application Specific Integrated Circuit (ASIC), or comparable device. The processor may be implemented as a single controller or as multiple controllers or processors.

At least one memory may be provided in one or more of the devices indicated as 1012 and 1022. The memory may be fixed or removable. The memory may include computer program instructions or computer code contained therein.

Memories

1012 and 1022 may independently be any suitable storage device, such as a non-transitory computer-readable medium. A Hard Disk Drive (HDD), Random Access Memory (RAM), flash memory, or other suitable memory may be used. The memory may be combined as a processor on a single integrated circuit or may be separate from one or more processors. Furthermore, the computer program instructions stored in the memory and processable by the processor may be computer program code in any suitable form, such as a compiled or interpreted computer program written in any suitable programming language. The memory may be removable or non-removable.

The

processors

1011 and 1021 and

memories

1012 and 1022, or a subset thereof, may be configured to provide methods corresponding to the various blocks of fig. 1-9. Although not shown, the device may also include positioning hardware, such as GPS or micro-electro-mechanical systems (MEMS) hardware, which may be used for positioning of the device. Other sensors are also permitted and may be included to determine position, altitude, orientation, etc., such as a barometer, compass, etc.

As shown in fig. 10,

transceivers

1013 and 1023 may be provided, and one or more devices may also include at least one antenna, illustrated as 1014 and 1024, respectively. A device may have many antennas, such as an antenna array configured for multiple-input multiple-output (MIMO) communications or multiple antennas for multiple radio access technologies. Other configurations of these devices may be provided.

Transceivers

1013 and 1023 may be transmitters, receivers, or both transmitters and receivers or units or devices that may be configured for transmission and reception.

The memory and the computer program instructions may be configured, by the processor of the particular apparatus, to cause the hardware device, such as the user equipment, to perform any of the processes described below (see, e.g., fig. 1-9). Thus, in certain example embodiments, a non-transitory computer readable medium may be encoded with computer instructions that, when executed in hardware, perform a process, such as one of the processes described herein. Alternatively, some example embodiments may be implemented entirely in hardware.

In some example embodiments, an apparatus may include circuitry configured to perform any of the processes or functions illustrated in fig. 1-9. For example, the circuitry may be a purely hardware circuit implementation, such as analog and/or digital circuitry. In another example, the circuitry may be a combination of hardware circuitry and software, such as a combination of analog and/or digital hardware circuit(s) and software or firmware and/or a combination of any part of hardware processor(s) and software (including digital signal processor (s)), software, and at least one memory, which work together to cause an apparatus to perform various processes or functions. In yet another example, the circuitry may be hardware circuit(s) and/or processor(s), such as microprocessor(s) or portions of microprocessor(s), including software, such as firmware for operation. Such software may not be present when the operation of the hardware does not require software in the circuitry.

The features, structures, or characteristics of certain example embodiments described throughout this specification may be combined in any suitable manner in one or more example embodiments. For example, throughout this specification, use of the phrases "certain example embodiments," "some example embodiments," "other example embodiments," or other similar language, refers to the fact that a particular feature, structure, or characteristic described in connection with the example embodiments may be included in at least one example embodiment of the present invention. Thus, appearances of the phrases "in certain example embodiments," "in some example embodiments," "in other example embodiments," or other similar language throughout this specification do not necessarily refer to the same group of example embodiments, and the described features, structures, or characteristics may be combined in any suitable manner in one or more example embodiments.

Those of ordinary skill in the art will readily appreciate that certain of the above-described example embodiments may be practiced with hardware elements in different sequences of steps and/or in different configurations than those disclosed. Accordingly, certain modifications, variations, or alternative constructions will be apparent to those skilled in the art, but which are still within the spirit and scope of the invention. Therefore, to ascertain the metes and bounds of the invention, reference should be made to the appended claims.

Part glossary

3GPP third generation partnership project

5G fifth generation wireless system

BSR buffer status report

DL downlink

DMRS demodulation reference signals

gNB 5G base station

GPS global positioning system

NE network entity

NR new radio

Physical Random Access Channel (PRACH)

PUSCH physical uplink shared channel

RA random access

RACH random access channel

RRC radio resource control

Rx receiver

SSB synchronization signal block

Tx transmitter

UE user equipment

UL uplink

URLLC ultra-reliable low-delay communication

Claims

1. A method, comprising:

generating, by a network entity, at least one interlace mapping pattern;

transmitting, by the network entity, the at least one interlace mapping pattern to a user equipment; and

receiving, by the network entity, at least one PUSCH according to the determined at least one interleaving mapping pattern.

2. The method of claim 1, wherein the at least one staggering mapping pattern defines a granularity of RA occasions mapped to the same PUSCH resource and comprises at least one association between at least one msgA RA occasion and at least one PUSCH resource and/or at least one association between at least one preamble and at least one PUSCH resource element, such that the signals from separate beams are transmitted in the same resource from different user equipments.

3. The method according to any one of claims 1 and 2, wherein the at least one interlace mapping pattern is associated with at least one capability of the network entity as to how many beams the network entity can recover from the signal from one MsgA PUSCH resource.

4. The method according to any of claims 1-3, wherein the at least one interlace mapping pattern may be configured to configure the user equipment for how many RA occasions corresponding to different beams are mapped to the same MsgA PUSCH resource.

5. The method according to any of claims 1-4, wherein the granularity of the at least one interlace mapping pattern can be determined according to a number of RA occasions corresponding to different beams that are mapped to the same MsgA PUSCH resource and/or the number of RA occasions.

6. The method of any of claims 1-5, wherein the at least one RA occasion within the RA time instances is numbered in order if there are more than 1 MsgA RA time instances in a first level association that are configured to be associated with the same MsgA PUSCH occasion.

7. The method according to any of claims 1-6, wherein K RA occasions are associated with N PUSCH resources in an uplink slot, and wherein the network entity can recover up to P beam signals in a single resource, the number X of preamble sets in each RA occasion being determined as X N P/K preamble sets.

8. The method according to any of claims 1-7, wherein the at least one staggering mapping pattern of P RA occasions maps to the same resources, wherein a gap m for the identifier of the RA occasion that maps to the same PUSCH resource may be determined as m-K/P.

9. The method of any of claims 1-8, wherein the preamble codes for each RA occasion are divided into multiple sets where a granularity of the interlace mapping pattern is greater than 1 and the number of MsgA PUSCH resources is not less than the number of RA occasions.

10. A method, comprising:

receiving, by a user equipment, at least one interlace mapping pattern from a network entity;

determining, by the user equipment, at a first level, at least one association between at least one MsgA RA time instance and at least one MsgA PUSCH time instance;

determining, by the user equipment, at a second stage, at least one association between at least one MsgA RA occasion and at least one MsgA PUSCH resource; and

transmitting, by the user equipment, at least one PUSCH according to the determined at least one interleaving mapping pattern.

11. The method of claim 10, wherein the at least one staggering mapping pattern comprises at least one association between at least one msgA RA occasion and at least one PUSCH resource such that the signals from separate beams are transmitted in the same resource from different user equipments.

12. The method according to any one of claims 10 and 11, wherein the at least one interlace mapping pattern is associated with at least one capability of the network entity regarding how many beams the network entity can recover from the signal from one MsgA PUSCH resource.

13. The method according to any of claims 10-12, wherein the at least one interlace mapping pattern may be configured to configure the user equipment for how many RA occasions corresponding to different beams are mapped to the same MsgA PUSCH resource.

14. The method according to any of claims 10-13, wherein the granularity of the at least one interlace mapping pattern can be determined according to a number of RA occasions corresponding to different beams that are mapped to the same MsgA PUSCH resource and/or the number of RA occasions.

15. The method of any of claims 10-14, wherein the at least one RA occasion within the RA time instances is numbered in order if there are more than 1 MsgA RA time instances configured to be associated with the same MsgA PUSCH occasion in a first level association.

16. The method according to any of claims 10-15, wherein K RA occasions are associated with N PUSCH resources in an uplink slot, and wherein the network entity can recover up to P beam signals in a single resource, the number X of preamble sets in each RA occasion being determined as X N P/K preamble sets.

17. The method according to any of claims 10-16, wherein the at least one staggering mapping pattern of P RA occasions maps to the same resource, wherein the gap m for the identifier of the RA occasion mapped to the same PUSCH resource may be determined as m ═ K/P.

18. The method of any of claims 10-17, wherein the preambles for each RA occasion are divided into multiple sets where the granularity of the interlace mapping mode is greater than 1 and the number of MsgA PUSCH resources is not less than the number of RA occasions.

19. The method according to any of claims 1 to 18, wherein the user equipment is configured for one-to-one and many-to-one mapping between preambles in each RO and associated PUSCH resource elements.

20. The method according to any of claims 1 to 19, wherein a configurable number of at least one preamble is mapped to one PUSCH resource element.

21. The method according to any of claims 1-20, wherein the PUSCH transmission is configured for spatial separation for many-to-one mapping.

22. The method according to any of claims 1 to 21, wherein at least one preamble is mapped to the same PUSCH resource element corresponding to a different SSB and/or a different RO.

23. The method according to any of claims 1-22, wherein at least one PUSCH transmission is spatially separated in the receiver and decoded with minimal mutual interference.

24. The method according to any of claims 1 to 23, wherein at least one set of preambles is mapped to different PUSCH occasions.

25. The method according to any of claims 1 to 24, wherein at least one preamble corresponds to at least one different SSB and/or RO mapped to the same PUSCH resource element.

26. An apparatus configured to perform the process of any one of claims 1 to 25.

27. A non-transitory computer readable medium encoding instructions that, when executed in hardware, perform a process according to any of claims 1-25.

28. An apparatus comprising means for performing a process according to any one of claims 1 to 25.

29. An apparatus comprising circuitry configured to cause the apparatus to perform the processes of any of claims 1-25.

30. A computer program product encoded with instructions for performing a process according to any of claims 1 to 25.