Message structure from UE to base station in 2-step random access
By designing the time-frequency array and power slope change scheduling of multiple preambles in the 2-step RACH process, the problems of delay and signaling overhead of the 4-step RACH process are solved, and the communication efficiency and power usage efficiency of UE and gNB are improved. .
Patent Information
- Application Number
- CN202080014824.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Priority Date
- 2019-03-28
- Filing Date
- 2020-02-11
- Publication Date
- 2024-11-19
- Estimated Expiration
- 2040-02-11
AI Technical Summary
The existing 4-step random access channel (RACH) process has large delay and signaling overhead in LTE, which affects the communication efficiency between user equipment (UE) and base station (gNB), especially in the shortage of spectrum. In the case of this, the 2-step RACH process lacks detailed message structure design, resulting in an increase in the probability of data conflicts and error decoding.
The framework adopts a 2-step RACH process, where the first message (MsgA) from the UE to the gNB has data bearing resources, reduces signaling exchanges by mapping to a time-frequency array defined by multiple preambles, and uses power slope change scheduling to schedule from The 2-step RACH process is converted to the 4-step RACH process, reducing power consumption and improving communication efficiency through the reasonable allocation of PRACH and PUSCH resources.
Short delay and reduced signaling overhead are achieved, the power efficiency of the UE is improved, the probability of data collision and error decoding is reduced, and is suitable for spectrum shortened millimeter and centimeter wave bands.
Smart Images

Figure CN113455094B_ABST
Abstract
Description
[0001] CROSS-REFERENCE TO RELATED APPLICATIONS
[0002] This application is a non-provisional application of, and claims priority to, U.S. Provisional Patent Application No. 62 / 825,500, filed on March 28, 2019, entitled “STRUCTURE OF MESSAGE FROM USER EQUIPMENT TO BASE STATION IN 2-STEP RANDOM ACCESS”. This application also claims priority to U.S. Provisional Patent Application No. 62 / 806,389, filed on February 15, 2019, entitled “STRUCTURE OF MESSAGE FROM USER EQUIPMENT TO BASE STATION IN 2-STEP RANDOM ACCESS”. Technical Field
[0003] This specification relates to communications. Background Art
[0004] A communication system may be a facility that enables communication between two or more nodes or devices, such as fixed or mobile communication devices. Signals may be carried on wired or wireless carriers.
[0005] An example of a cellular communication system is an architecture standardized by the Third Generation Partnership Project (3GPP). The latest development in this field is generally referred to as the Long Term Evolution (LTE) of the Universal Mobile Telecommunications System (UMTS) radio access technology. E-UTRA (Evolved UMTS Terrestrial Radio Access) is the air interface of the 3GPP's LTE upgrade path for mobile networks. In LTE, a base station or access point (AP) (which is referred to as an enhanced node AP (eNB)) provides radio access within a coverage area or cell. In LTE, a mobile device or mobile station is referred to as a UE (UE). LTE has included many improvements or developments.
[0006] For example, the global bandwidth shortage faced by wireless carriers has promoted the consideration of underutilized millimeter wave (mmWave) spectrum, such as future broadband cellular communication networks. For example, millimeter waves (or extremely high frequencies) can include a frequency range between 30 and 300 gigahertz (GHz). For example, the wavelength of radio waves in this band can be from ten millimeters to one millimeter, so it is called millimeter band or millimeter wave. In the coming years, the number of wireless data may increase significantly. Various technologies have been tried to solve this challenge, including obtaining more spectrum, having a smaller cell size, and using improved technologies that achieve more bits / s / Hz. One factor that can be used to obtain more spectrum is to move to higher frequencies, such as above 6GHz. For the fifth generation wireless system (5G), an access architecture for the deployment of cellular radio equipment using millimeter wave radio spectrum has been proposed. Other example spectrums can also be used, such as centimeter wave (cmWave) radio spectrum (e.g., 3 to 30GHz). Summary of the invention
[0007] According to an example implementation, a method includes: receiving, by a user equipment (UE) from a network, information including power ramping data indicating a power ramping schedule for falling back from a 2-step random access channel (RACH) process to a 4-step RACH process; transmitting, by the UE according to the 2-step RACH process, a first message to a base station (gNB) at a first power value through physical RACH (PRACH) and physical uplink shared channel (PUSCH) resources in time space and frequency space, the first message including a preamble configured to be transmitted through the PRACH and message data configured to be sent through the PUSCH resources, the first power value being a maximum power value that can be used for the 2-step RACH process; generating, by the UE based on the power ramping configuration, a second power value, the second power being an initial power value for the 4-step RACH process; and transmitting, by the UE according to the 4-step RACH process, a second message to the gNB at the second power value through the PUSCH, the second message including the preamble.
[0008] According to an example implementation, an apparatus includes at least a memory and a control circuit system coupled to the memory, the control circuit system being configured to receive information from a network, the information including power ramp data representing a power ramp scheduling for falling back from a 2-step random access channel (RACH) process to a 4-step RACH process; transmit a first message to a base station (gNB) at a first power value through physical RACH (PRACH) and physical uplink shared channel (PUSCH) resources in time space and frequency space according to the 2-step RACH process, the first message including a preamble configured to be transmitted through the PRACH and message data configured to be sent through the PUSCH resources, the first power value being a maximum power value that can be used for the 2-step RACH process; generate a second power value based on the power ramp configuration, the second power being an initial power value for the 4-step RACH process; and transmit a second message to the gNB at the second power value through the PUSCH according to the 4-step RACH process, the second message including the preamble.
[0009] According to an example implementation, an apparatus includes a component for receiving information from a network, the information including power ramp data representing a power ramp scheduling for falling back from a 2-step random access channel (RACH) process to a 4-step RACH process; a component for transmitting a first message to a base station (gNB) at a first power value through physical RACH (PRACH) and physical uplink shared channel (PUSCH) resources in time space and frequency space according to the 2-step RACH process, the first message including a preamble configured to be transmitted through the PRACH and message data configured to be sent through the PUSCH resources, the first power value being a maximum power value that can be used for the 2-step RACH process; a component for generating a second power value based on the power ramp configuration, the second power being an initial power value for the 4-step RACH process; and a component for transmitting a second message to the gNB at a second power value through the PUSCH according to the 4-step RACH process, the second message including the preamble.
[0010] According to an example implementation, a computer program product includes a computer-readable storage medium and stores executable code, which, when executed by at least one data processing device, is configured to cause the at least one data processing device to receive information from a network, the information including power ramp data representing a power ramp scheduling for falling back from a 2-step random access channel (RACH) process to a 4-step RACH process; transmit a first message to a base station (gNB) at a first power value through physical RACH (PRACH) and physical uplink shared channel (PUSCH) resources in time space and frequency space according to the 2-step RACH process, the first message including a preamble configured to be transmitted through the PRACH and message data configured to be sent through the PUSCH resources, the first power value being a maximum power value that can be used for the 2-step RACH process; generate a second power value based on the power ramp configuration, the second power being an initial power value for the 4-step RACH process; and transmit a second message to the gNB at the second power value through the PUSCH according to the 4-step RACH process, the second message including the preamble.
[0011] The details of one or more examples of implementations are set forth in the drawings and the description below. Other features will be apparent from the description and drawings, and from the claims. BRIEF DESCRIPTION OF THE DRAWINGS
[0012] Figure 1A is a block diagram of a wireless network according to an example implementation.
[0013] Figure 1B is a diagram illustrating a 4-step contention-based random access (RACH) procedure according to an example implementation.
[0014] Figure 1C is a diagram illustrating a 2-step RACH procedure according to an example implementation.
[0015] Figure 2 is a diagram illustrating a 2-step RACH procedure with back-off according to an example implementation.
[0016] Figure 3 is a schematic diagram illustrating the data portion of MsgA (i.e., the message from the UE to the gNB) according to an example implementation.
[0017] Figure 4 is a schematic diagram illustrating the structure of MsgA according to an example implementation.
[0018] Figure 5 is a table illustrating allocation of preamble index "i" to time "l" frequency "k" resources according to an example implementation.
[0019] Figure 6is a diagram illustrating 2-step RACH with multiple PUSCH configurations, each configuration having its own preamble space, according to an example implementation.
[0020] Figure 7 is a diagram illustrating 2-step RACH with a common preamble set and different PUSCH configurations according to an example implementation.
[0021] Fig. 8A is a schematic diagram illustrating orthogonal resources of MsgA for different payload sizes according to an example implementation.
[0022] Figure 8B is a schematic diagram illustrating overlapping resources for MsgA of different payload sizes according to an example implementation.
[0023] Fig. 9 is a schematic diagram illustrating PUSCH resource allocation in a basic unit according to an example implementation, wherein a preamble indicates a PUSCH starting position and size.
[0024] Fig.10 is a schematic diagram illustrating PUSCH resource allocation in a basic unit according to an example implementation, wherein a preamble indicates a PUSCH starting position.
[0025] Fig.11 is a flow chart illustrating a method of performing a two-step RACH procedure according to an example implementation.
[0026] Fig.12 is a diagram illustrating power ramp scheduling for falling back from a 2-step RACH procedure to a 4-step RACH procedure according to an example implementation.
[0027] Fig.13 is a schematic diagram illustrating mapping of PRACH opportunities to PUSCH opportunities using two configured semi-static offsets (half of the static offset is in time and the other half is in frequency) according to an example implementation.
[0028] Fig.14 is a diagram illustrating mapping of PRACH opportunities to PUSCH opportunities with PUSCH repetition according to an example implementation.
[0029] Fig.15 is a diagram illustrating mapping of PRACH opportunities to PUSCH opportunities using a frequency-first-time-last mapping rule according to an example implementation, with four preamble groups per PRACH opportunity.
[0030] Fig.16 is a schematic diagram illustrating alternative mapping rules according to an example implementation.
[0031] Fig.17is a flow chart illustrating a method of performing a fallback 4-step RACH procedure according to an example implementation.
[0032] Fig.18 is a block diagram of a node or wireless station (eg, a base station / access point, a relay node, or a mobile station / user equipment) according to an example implementation.
[0033] Specific implementation
[0034] Figure 1A 1 is a block diagram of a wireless network 130 according to an example implementation. In the wireless network 130 of FIG. 1 , user equipment 131, 132, 133, and 135 (also referred to as mobile stations (MS) or user equipment (UE)) can be connected to a base station (BS) 134 (also referred to as an access point (AP), an enhanced node B (eNB), a gNB (which can be a 5G base station), or a network node. At least part of the functionality of an access point (AP), a base station (BS), or an (e) node B (eNB) can also be performed by any node, server, or host that can be operably coupled to a transceiver (such as a remote radio head). BS (or AP) 134 provides wireless coverage within cell 136, including wireless coverage to user equipment 131, 132, 133, and 135. Although only four user equipment are shown as connected to or attached to BS 134, any number of user equipment can be provided. BS 134 is also connected to core network 150 via interface 151. This is just one simple example of a wireless network, and other examples can also be used.
[0035] User equipment (user terminal, user equipment (UE)) may refer to portable computing devices including wireless mobile communication devices operating with or without a subscriber identity module (SIM), including but not limited to the following types of devices: mobile station (MS), mobile phone, cell phone, smart phone, personal digital assistant (PDA), handset, devices using wireless modems (alarm or measurement devices, etc.), such as laptops and / or touch screen computers, tablets, phablets, game consoles, notebooks, and multimedia devices. It should be understood that user equipment may also be almost exclusively uplink-only devices, an example of which is a camera or camcorder that loads images or video clips to a network.
[0036] In LTE (as an example), the core network 150 may be referred to as an evolved packet core (EPC), which may include a mobility management entity (MME) that may handle or assist mobility / handover of user equipment between BSs, one or more gateways that may forward data and control signals between the BSs and a packet data network or the Internet, and other control functions or blocks.
[0037] The various example implementations may be applied to a wide variety of wireless technologies, wireless networks, such as LTE, LTE-A, 5G (New Radio or NR), cmWave and / or mmWave band networks, or any other wireless network or use case. LTE, 5G, cmWave and mmWave band networks are provided as illustrative examples only, and the various example implementations may be applied to any wireless technology / wireless network. The various example implementations may also be applied to a variety of different applications, services, or use cases, such as ultra-reliable low latency communications (URLLC), Internet of Things (IoT), enhanced mobile broadband, massive machine type communications (MMTC), vehicle-to-vehicle (V2V), vehicle-to-device, etc. Each use case or UE type may have its own set of requirements.
[0038] Figure 1B is a schematic diagram illustrating an example of a 4-step contention-based random access (RACH) procedure 100 according to an example implementation. Each step involves the transmission of a message ("Msg1", "Msg2", "Msg3", "Msg4") between the UE and the gNB. Figure 1B As shown, Msg1 includes a preamble (physical RACH or PRACH) transmitted from the UE to the gNB to initiate access to a cell associated with the gNB. Msg2 includes a random access response (RAR) transmitted from the gNB to the UE, which instructs the UE to transmit data according to the schedule. Msg3 includes the payload (data) transmitted from the UE to the gNB according to the schedule. Msg4 includes the output of the contention resolution process, according to which the transmitted data is either confirmed or the data is requested to be retransmitted due to, for example, a decoding error.
[0039] The above 4-step RACH has a certain delay and increases the signaling overhead due to multiple signaling exchanges. A solution to this delay is the 2-step RACH process. Figure 1C was discussed.
[0040] Figure 1C is a schematic diagram illustrating a two-step RACH procedure 110 according to an example implementation. Figure 1C In the two-step RACH procedure 110 shown in FIG. 1 , MsgA combines a preamble signal (Msg1) and a data signal (Msg3), and MsgB combines a random access response (Msg2) and a contention resolution (Msg4).
[0041] However, there is no detailed proposal for the UE to gNB message structure for two-step RACH. For example, it has been proposed that the PRACH preamble and PUSCH in MsgA be time division multiplexed (TDMed). The example implementation has a PRACH opportunity followed by a PUSCH allocation for the data portion of MsgA. However, this results in all data for all preambles being mapped to the same PUSCH allocation and increases the probability of data collisions and erroneous decoding.
[0042] In contrast to the conventional RACH procedure described above, the improved technique includes a framework for 2-step RACH, where the first message (MsgA) from the UE to the gNB has a data-bearing resource (i.e., PUSCH) organized by mapping to a time-frequency array defined by multiple preambles. This 2-step RACH has a shorter latency than the 4-step RACH due to less signaling exchanges. In addition, this 2-step RACH also enables the UE to use lower power due to reduced signaling overhead.
[0043] Figure 2 is a schematic diagram illustrating a 2-step RACH procedure 200 with fallback according to an example implementation. Figure 2 As shown, there is a preliminary step 0, which involves a broadcast signal from the network (e.g., core network 150 in FIG. 1 ). The network broadcasts the 2-step RACH configuration in the remaining minimum system information (RMSI) - system information block 1 (SIB1) because 2-step RACH is the initial access scheme. The 2-step RACH configuration includes a set of preambles and a mapping between the preambles and the schedule by which the UE 210 can transmit data to the gNB 220. Additional details about the mapping will be discussed in detail in the following section. Figures 3 to 5 Give a description.
[0044] like Figure 2 As shown, the generation and transmission of MsgA by UE 210 is divided into two parts, 1a in which a preamble is selected and 1b in which a physical resource for transmitting data is selected.
[0045] In 1a, in some implementations, the preamble is a Zadoff-Chu (ZC) sequence and is transmitted over PRACH (e.g., the 2-step process preamble is a subset of the available PRACH preambles, or there is a random access opportunity (PRACH opportunity) dedicated entirely to the 2-step process). In some implementations, the preamble has another structure in addition to the structure used in PRACH, but this structure is used both for activity detection (for the gNB 220 to detect that a transmission is occurring) and also as a reference symbol for data transmission (for the gNB 220 to estimate the channel so that it can decode the data portion of MsgA).
[0046] In 1b, the UE 210 selects a physical uplink shared channel (PUSCH) resource according to the configuration broadcast by the network in step 0 and according to the UE's 210 own payload requirements. Figures 6 to 10 Described in detail.
[0047] In 2a, gNB 220 transmits MsgB after successfully decoding Msg A to acknowledge MsgA reception, perform contention resolution, and potentially provide any other information associated with the request in Msg A. In 2b, gNB 220 does not successfully decode the data payload of MsgA. In this case, Msg2 (see Figure 1B ) is transmitted, which instructs UE 210 to fall back to the 4-step procedure.
[0048] Figure 3 is a schematic diagram illustrating the data portion 300 of MsgA (i.e., a message from UE 210 to gNB 220) according to an example implementation. In some implementations, as described herein, the preamble is transmitted on a PRACH occasion (RO). In some implementations, another method for preamble construction is followed. In some implementations, the RO can be dedicated to 2-step RACH. In some implementations, the RO is shared with the 2-step RACH.
[0049] In the configuration transmitted by gNB 220 in step 0, there are MAXPreambleIndex (maximum preamble index) preambles for 2-step RACH. Each MAXPreambleIndex preamble of the configuration may be represented by a corresponding preamble index i. Data representing preamble index i is transmitted by gNB 220 in the RO, where 0≤i<MAXPreambleIndex. As discussed with respect to step 1b, preamble index i determines the time, frequency, and DMRS port of the PUSCH resources used for data transmission.
[0050] In the time-frequency grid of time space and frequency space, multiple resources can be used for data transmission according to the preamble index. Each resource in the time-frequency grid has a duration of mPUSCHSym and a range in the frequency domain of nPUSCHPRB, such as Figure 3 The symbol duration and PRB size are given by the digital scheme of the PUSCH used for data transmission.
[0051] Figure 4 is a schematic diagram illustrating a structure 400 of MsgA according to an example implementation.
[0052] like Figure 4 As shown, MsgA PUSCH frequency resource k PUSCH∈{0, 1, ..., n-1}, where n is the number of frequency division multiplexed (FDMed) opportunities for data transmission corresponding to one preamble RO. MsgA PUSCH time resource l PUSCH ∈{0, 1, ...m-1}, where m is the number of TDMed opportunities for data transmission corresponding to one preamble RO. PUSCH resources are continuous in frequency, PUSCH resources can be continuous in time, or can have one symbol gap to accommodate a round-trip delay greater than the cyclic prefix (CP) and avoid interference with subsequent transmissions. In structure 400, in the time domain, the earliest PUSCH resource at the lowest frequency starts Preamble2DataTime (preamble to data time) symbols / slots from the start of the RO used for preamble transmission. In the frequency domain, the PUSCH resource also starts Preamble2DataFreq (preamble to data frequency) physical resource blocks (PRBs) from the start of the RO used for preamble transmission. Preamble2DataTime and Preamble2DataFreq are given by the digital scheme of the PUSCH used for data transmission.
[0053] The allocation of PUSCH time and frequency resources to the i-th preamble is performed as follows. Let A = MAXPreambleIndex mod (m·n), and Also defines:
[0054]
[0055] Then, the time domain resource index is:
[0056]
[0057] And the frequency domain resource index is:
[0058] k PUSCH =a mod n.
[0059] Figure 5 Table 500 is illustrated, which illustrates the allocation of preamble index "i" to time "l" frequency "k" resources according to an example implementation. Figure 5 As shown, the table is generated using the following values: MAXPreambleIndex=64, m=2, n=5.
[0060] like Figure 5As can be seen in , there may be more than one preamble mapped to a PUSCH time and frequency resource. Each such preamble for a specific PUSCH time and frequency resource can be assigned to a demodulation reference signal (DMRS) port of the PUSCH time and frequency resource as follows.
[0061] Let there be nPreamble values assigned to the PUSCH time and frequency resources, the logical preamble index assigned to the PUSCH resource is given by h∈{0, 1, ... nPreamble-1}. Furthermore, let the PUSCH time and frequency resources have nDMRSPorts DMRS ports, where the DMRS port index j∈{0, 1, ... nDMRSPorts-}. Then, the preamble index h is assigned to the DMRS port index j as follows. Let D=nPreamble mod nDMRSPorts, as well as but:
[0062]
[0063] The proposed mapping (including other mappings following the same principle) and the RO dedicated to step 2 are shared with the UE in step 0 via the broadcasted RMSI (SIB1).
[0064] Now that the mapping of preamble to PUSCH time and frequency resources has been defined, PUSCH resource selection based on UE payload is described in this document. Note that there are multiple triggering causes for 2-step RACH. For MsgA, each trigger can have a different size. Even for the same trigger, MsgA may have different sizes for different scenarios. Different MsgA configurations may have different numbers of PRBs nPUSCHPRB and different numbers of OFDM symbols nPUSCHSym. Accordingly, there are different methods for selecting PUSCH resources; these methods are related to Figures 6 to 10 was discussed.
[0065] Figure 6 is a schematic diagram illustrating a 2-step RACH 600 with multiple PUSCH configurations according to an example implementation. Figure 6 As shown, the PRACH preambles are divided into different groups according to the msgA size. These preambles can have a direct mapping to the PUSCH blocks with sufficient number of resources. The preambles of different groups can be in the same RO or in different ROs. Figure 6 A 2-step RACH 600 is shown with two configurations, Group A and Group B. The preamble of the 2-step RACH shares the same PRACH opportunity with the 4-step CBRA preamble. Each MsgA configuration is a different PUSCH configuration.
[0066] In some implementations, triggers occurring more frequently will have less contention space, ie, they will have a higher level of conflict.
[0067] Figure 7 is a diagram illustrating a 2-step RACH 700 with a common preamble set and different PUSCH configurations according to an example implementation. Figure 7 As shown, the PRACH preamble is not partitioned. However, after selecting the preamble, the UE selects a PUSCH block with sufficient number of resources from the pool of available blocks. In some implementations, each preamble is associated with multiple PUSCH blocks, and each PUSCH block has a different resource allocation size. The UE selects a PUSCH block based on the amount of resources it requires. The gNB tries different hypotheses to determine which PUSCH the UE has transmitted.
[0068] Figure 7 An example of an undivided PRACH opportunity is shown. Each preamble index in a PRACH opportunity is Figure 7 The PUSCH resources in each of the three PUSCH configuration areas shown are associated with each other. Each PUSCH configuration is similar to Figure 7 The MsgA data part.
[0069] exist Figure 7 In the illustrated method, there is a more complex decoding because there is no direct mapping between the PRACH preamble and the PUSCH resource. This method either increases the probability of collision for the same PUSCH resource usage or increases the PUSCH resource usage.
[0070] Another approach involves having a single PUSCH resource allocation size. Smaller payloads are then padded or rate matched to fit within the single PUSCH resource allocation size.
[0071] Another approach involves performing resource partitioning by creating a set of “data bearer candidates”, e.g. Figure 5 In some implementations, the configuration divides the resources into resource clusters that allow the UE to transmit uplink data (PUSCH) with a random access message payload. Fig. 8A and Figure 8B discussed in detail.
[0072] Fig. 8A is a schematic diagram illustrating orthogonal resources 800 for MsgA of different payload sizes according to an example implementation. Fig. 8A The resources are shown to be divided into two sets 810 and 820, each set being capable of carrying two different payload sizes. Fig. 8AAs shown, the first X messages are pre-assigned to smaller payloads, while larger payloads (assuming a maximum of Y messages) are reserved for some other physical resources. By knowing the physical resources assigned to the messages and the amount of X and Y messages (and the difference or ratio of payload sizes between X and Y), it is possible to generate an appropriate mapping between payload sizes and resources. An example of this method is about Figure 8B was discussed.
[0073] Figure 8B 8 is a schematic diagram showing overlapping resources 860 and 870 for MsgA of different payload sizes according to an example implementation. Figure 8B In step 0, the UE is allowed to create new "virtual" resources in the physical resources normally reserved for larger payloads to carry messages with low payloads. The grant of temporary use of the resources may be triggered by network signaling via RMSI (SIB1) in step 0.
[0074] In some implementations, the data carrying the candidate is organized as an array of basic units, such as Figure 4 The basic unit is the minimum resource allocation size for MsgA data. When transmitting the data portion of MsgA, the UE allocates one or more basic units based on the configuration of MsgA and the amount of resources required to transmit the MsgA payload. The preamble index is associated with the selected PUSCH resource. There are two alternatives in this scenario, respectively. Fig. 9 and Fig.10 was discussed further.
[0075] Fig. 9 is a schematic diagram illustrating a 2-step RACH PUSCH resource allocation 900 in a basic unit according to an example implementation, wherein the preamble indicates the starting position and size of the PUSCH. That is, the preamble index indicates the starting position of the PUSCH resource (in time and frequency) and the PUSCH resource allocation size (in the number of basic units). Fig. 9 An example is shown where the PUSCH resource can have a size of one or two basic units, and the preamble index indicates the PUSCH resource start position in time and frequency as well as the PUSCH resource size. This alternative reduces the complexity of the gNB receiver as it avoids decoding multiple hypotheses.
[0076] As an example, consider the eight basic resource allocations for MsgA as shown in Figure 8. These resource units are represented by A, B, C, D, E, F, G, H. In this example, the network configures the following possible allocations - 8 single basic resource allocations: A, B, C, D, E, F, G, H and 4 dual resource allocations: AB, CD, EF, GH. There are a total of 12 possible allocations that can be signaled by the preamble. In this example, the preamble space is divided into twelve sets. When a preamble is selected from a set, it points to the PUSCH resource corresponding to that set.
[0077] Fig.10 is a schematic diagram illustrating PUSCH resource allocation in a base unit according to an example implementation, wherein the preamble indicates the PUSCH starting position. That is, the preamble index indicates the starting position (in time and frequency). The UE selects the PUSCH resource size based on the amount of data and the MCS it needs to transmit. The gNB tries multiple decoding hypotheses to find the PUSCH resource size transmitted by the UE.
[0078] As an example, consider Fig.10 The eight basic resource allocations for MsgA shown. These resource units are represented by A, B, C, D, E, F, G, H. In this example, the network configures the following possible allocations - 8 single basic resource allocations: A, B, C, D, E, F, G, H and 4 dual resource allocations: AB, CD, EF, GH. There are a total of 12 possible allocations, however there are only eight possible starting locations. In this example, the preamble space is divided into eight sets corresponding to the starting locations. When the preamble is selected from a set, it points to the starting location of the PUSCH resources corresponding to the set. If the preamble points to a starting location with two possible resource allocations (e.g., A and AB), the network decodes multiple hypotheses to determine the PUSCH resource allocation for the UE to transmit the data portion of MsgA.
[0079] Example 1: Fig.111 is a flow chart illustrating an example method 1100 for performing the improved technique. Operation 1110 includes receiving, by a user equipment (UE), information from a network, the information including (i) a plurality of preambles to be transmitted via a physical random access channel (PRACH), and (ii) a location and size of a physical uplink shared channel (PUSCH) resource in time space and frequency space, through which data is to be transmitted to a base station (gNB); and (iii) mapping information between the preambles and the PUSCH resources; Operation 1120 includes, after receiving the information, performing, by the UE, a preamble selection operation to generate a selected preamble from among the plurality of preambles; Operation 1130 includes performing, by the UE, a PUSCH determination operation to generate a location and size of the PUSCH resource in time space and frequency space, the location and size of the PUSCH resource being based on the selected preamble and / or the number of PUSCH resource elements required to transmit a payload from the UE. Operation 1140 includes generating, by the UE, a single message including the selected preamble and the data. Operation 1150 includes transmitting, by the UE to the gNB, a single message during a time determined by a position of a PUSCH position in time space and frequency space and on a set of frequency groups determined by the position.
[0080] Example 2: An example implementation according to Example 1, wherein each of a plurality of preambles is represented by a corresponding preamble index, wherein each of the positions of a PUSCH resource is represented by a time index and a frequency index, the time index indicating a time, the frequency index indicating a frequency in a set of frequencies, and wherein performing a PUSCH selection operation includes: based on the preamble index, searching for a PRB with a frequency index and an orthogonal frequency division multiplexing (OFDM) symbol with a time index in a plurality of physical resource blocks (PRBs), the frequency index and the time index being generated by a mapping operation.
[0081] Example 3: An example implementation according to Example 2, wherein finding a PRB having a time index and a frequency index resulting from a mapping operation includes: generating a preamble multiplier based on a ratio of a number of preambles in a plurality of preambles to a number of PRBs in a plurality of PRBs.
[0082] Example 4: An example implementation according to Example 3, wherein finding a PRB having a time index and a frequency index generated by a mapping operation further includes: generating a ratio of a preamble index to a preamble multiplier to generate coefficients, the time index and the frequency index being based on a ratio of the coefficients to the number of PRBs in frequency space.
[0083] Example 5: An example implementation according to Example 2, wherein each of the PUSCH resources has a set of demodulation reference signal (DMRS) ports, and wherein the method further comprises: locating the DMRS port corresponding to the preamble index within the found PRB and OFDM symbol.
[0084] Example 6: An example implementation according to Example 5, wherein locating a DMRS port within a found PRB includes: generating a preamble ratio, the preamble ratio being a ratio of the number of preambles corresponding to the found (multiple) PRBs and (multiple) OFDM symbols to the number of DMRS ports of the found PRB.
[0085] Example 7: An example implementation according to Example 6, wherein locating the DMRS port within the found (multiple) PRBs further includes: generating a ratio of a local preamble code index to a preamble code ratio to produce a DMRS port index, the local preamble code index indicating the preamble code within the found PRB.
[0086] Example 8: An example implementation according to Example 1, wherein data defining a preamble and PUSCH resources is arranged on a resource grid having (i) a plurality of time slots corresponding to time and (ii) physical resource blocks (PRBs) associated with corresponding subcarriers of a corresponding plurality of subcarriers corresponding to each of the plurality of time slots.
[0087] Example 9: An example implementation according to Example 8, wherein the preamble is arranged in a first time slot of the resource grid and the PUSCH resources are arranged in a second time slot of the resource grid, the first time slot and the second time slot being adjacent.
[0088] Example 10: An example implementation according to Example 8, wherein the subcarrier spacing of the multiple subcarriers in the first time slot is the same as the subcarrier spacing of the multiple frequency bands in the second time slot.
[0089] Example 11: An example implementation according to Example 1, wherein the preamble and PUSCH resources are arranged on the same time slot of the resource grid.
[0090] Example 12: An example implementation according to Example 1, wherein each preamble of the plurality of preambles is associated with a corresponding group of the plurality of groups based on a size of a payload associated with data to be transmitted with the preamble in a single message.
[0091] Example 13: An example implementation according to Example 12, wherein each preamble of the plurality of preambles associated with one of the plurality of groups belongs to the same random access (RACH) occurrence.
[0092] Example 14: The example implementation of Example 12, wherein each preamble of the plurality of preambles is signaled as a contention-free preamble.
[0093] Example 15: The example implementation according to Example 1, wherein each of the PUSCH resources has a corresponding payload size, and wherein performing the PUSCH selection operation includes selecting the PUSCH resource according to its payload size.
[0094] Example 16: Figure is an example implementation according to Example 1, wherein each of the PUSCH resources has the same payload size.
[0095] Example 17: An example implementation according to Example 16, wherein the size of the payload associated with the data is greater than the size of the payload of each PUSCH resource in the PUSCH resources, and wherein performing the PUSCH selection operation includes: selecting the following multiple PUSCH resources, through which the data is transmitted to the gNB.
[0096] Example 18: An example implementation according to Example 16, wherein the preamble indicates a starting position of the selected PUSCH resource in time space and frequency space.
[0097] Example 19: The example implementation of Example 18, wherein the preamble further indicates a payload size of the selected PUSCH resource.
[0098] Example 20: An example implementation according to Example 1, wherein the method further includes, after transmitting the single message to the gNB, receiving a message from the gNB indicating that the data was not successfully decoded and that a 4-step RACH process will be used to transmit data to the gNB.
[0099] Example 21: An apparatus includes components for performing the method of any of Examples 1 to 20.
[0100] Example 22: A computer program product comprising a non-transitory computer-readable storage medium and storing executable code, which, when executed by at least one data processing device, is configured to cause the at least one data processing device to perform the method of any one of claims 1 to 20.
[0101] 2-step RACH to 4-step RACH fallback process
[0102] When the gNB is unable to receive or recognize the preamble sent by the UE via the PRACH opportunity (RO), the above-mentioned fallback 4-step RACH is used in this article. Fig.12 are described in further detail.
[0103] Here, aspects of the backoff associated with the power ramp procedure are addressed. More specifically, a set of control mechanisms allow the gNB to adjust the thresholds for controlling UE transmissions from a 2-step RACH procedure to a 4-step RACH procedure while still maintaining appropriate settings for transmit power during this transition. This mechanism will allow the UE to smoothly transition to the 4-step procedure without having to start the power ramp from scratch when transitioning to the backoff routine.
[0104] Fig.12 1 is a diagram illustrating a power ramp schedule 1200 for falling back from a 2-step RACH procedure to a 4-step RACH procedure according to an example implementation. The power ramp schedule 1200 includes power ramp schedules 1202 to 1206 for a 2-step RACH procedure and power ramp schedules 1208 to 1210 for falling back to a 4-step RACH procedure.
[0105] The UE receives configuration parameters for the 2-step RACH procedure from the serving gNB. These configuration parameters include: information including power ramp scheduling 1200. In some implementations, this information is provided in system broadcast signaling. In some implementations, this information includes UE or beam specific information.
[0106] In some implementations, the configuration parameters include the initial allowed 2-step power P 2-step-initial (P 2步初始 ) or parameters related to setting the initial transmission power for a 2-step RACH procedure through an open loop algorithm.
[0107] In some implementations, the configuration parameters include a number of allowed 2-step power ramp attempts N before backoff is triggered. 2-step-power (N 2步功率 ) or retransmission attempt N 2-step (N 2步 ).
[0108] In some implementations, the configuration parameters include a number of allowed 4-step backoff power ramp attempts or 4-step backoff retransmission attempts N 4-step-fallback (N 4步回退 ) and preamble TransMax fallback .
[0109] In some implementations, the configuration parameters include a power ramp increase Δ between 2-step power ramp attempts on the same beam. 2-step (Δ 2步 ).
[0110] In some implementations, the configuration parameters include a power ramp increase Δ between 4-step back-off power ramp attempts on the same beam. 4-step-fallback (Δ 4步回退 ).
[0111] In some implementations, the configuration parameters include a starting power for the 4-step backoff power ramp. In some implementations, the same beam used for the 4-step RACH backoff is used as the beam used for the last 2-step RACH transmission. In some implementations, the starting power for the 4-step backoff power ramp is based on the last used 2-step power step Δ specified in the configuration parameters. 2-step-to-4-step-fallback (Δ 2步到4步回退 ). In some implementations, the specific initial power step is similar to the 4-step process P 4-step-fallback (P 4步回退 ). In some implementations, the starting power of the 4-step back-off power ramp is indicated by an open loop configuration for the transmit power.
[0112] In some implementations, the configuration parameters include the power offset Δ between the MsgA preamble and the MsgA data in the 2-step RACH process MsgA_Preamble_Data (Δ MsgA前导码数据 ).
[0113] Fig.12 The 2-step power ramp configuration shown in Figure 1 starts with an initial attempt to send a message to the gNB via RO and PUSCH opportunity (PO). As described above, the UE sends the message data via PO and the preamble via RO. The message data is transmitted via PO with an initial power P 2-step-initial At 1202, the preamble is transmitted. At 1204, the preamble is transmitted by RO with power P 2-step-initial +Δ MsgA_Preamble_Data In some implementations, the initial 2-step power sets the initial transmission power for the 2-step RACH procedure via an open loop algorithm.
[0114] If the gNB cannot decode the MsgA preamble (and therefore cannot detect the MsgA data portion), it does not reply to the UE with MsgB, and the UE continues with the power ramping process 1200. In this case, the UE increases the power level at which it sends messages to the gNB by an amount Δ 2-step The power used to send the message data at 1206 via PO is then P 2-step-initial +Δ 2-step , and the power used to send the preamble through RO is P 2-step-initial +Δ 2-step +Δ MsgA_Preamble_Data .
[0115] In some implementations, the gNB is able to decode the MsgA preamble and MsgA data; the gNB then proceeds with the 2-step process, where MsgB is ultimately sent to the UE. In some implementations, the gNB is able to decode the MsgA preamble, but not the MsgA data; the UE may then retry the power ramping process, or the gNB may dynamically allocate new PUSCH resources for the UE's MsgA transmission.
[0116] Assuming the number of 2-step retransmission attempts does not exceed N 2-step and the number of 2-step power ramp attempts does not exceed N 2-step-power , then when using the same beam, the UE uses the previous power P 2-step-previous +Δ 2-step (P 2步先前 +Δ 2步 ) performs a new MsgA preamble transmission and uses power P 2-step-previous +Δ 2-step +Δ MsgA_Preamble_Data MsgA data transmission is performed. If a different beam is used, the power is not changed, or the next preamble transmission power is reset to P 2-step-initial In some implementations, different beams are used and there is a preamble transmission to increase P 2-step-previous +Δ 2-step .
[0117] This process repeats until a specified endpoint, at which the 2-step RACH process falls back to a 4-step RACH process. In some implementations, the specified endpoint is a number of allowed 2-step power ramp attempts N before the fallback is triggered. 2-step-power Or retransmission attempt N 2-step In some implementations, the specified endpoint is the maximum power allowed for the 2-step RACH procedure.
[0118] When the specified end point is reached, i.e., the RACH procedure transition from the 2-step RACH procedure to the 4-step RACH procedure, the UE adjusts the power to the initial 4-step power P 4-step-fallback In some implementations, the initial 4-step power is specified in information received by the UE. In some implementations, the initial 4-step power is determined based on the power offset Δ specified in the information. 2-step-to-4-step-fallback and was determined.
[0119] UE uses P 4-step-fallback or P 2-step-previous +Δ 2-step-to-4-step-fallback To perform an initial 4-step backoff attempt. In some implementations, the UE uses the same beam for the initial 4-step backoff transmission as the last 2-step transmission.
[0120] If the gNB cannot decode the Msg1 preamble, the gNB does not reply to the UE with Msg2, and the UE continues with the power ramping process 1200 for 4-step backoff. In some implementations, when the number of 4-step backoff power ramping attempts does not exceed N 4-step-fallback And the number of 4-step fallback retransmission attempts does not exceed TransMax fallback When using the same beam, the UE uses power P 4-step-fallback-previous +Δ4-step-fallback (P 4步回退先前 +Δ 4步回退 ) performs a new Msg1 preamble transmission. In some implementations, there is no power change when a different beam is used. In some implementations, the 4-step preamble transmission power is reset to P when a different beam is used. 4-step-fallback or P 2-step-previous +Δ 2-step-to-4-step-fallback In some implementations, when different beams are used, the 4-step preamble transmission power is determined by P 4-step-fallback-previous +Δ 4-step-fallback Given.
[0121] In some implementations, when the number of 4-step back-off power ramp attempts exceeds N 4-step-fallback Or when the allowed number of preamble TransMaxfallback retransmission attempts with 4-step fallback is exceeded, the UE stops the RACH procedure.
[0122] In some implementations, when the gNB detects a 2-step MsgA preamble but does not detect data and indicates to the UE to fall back to 4-step RACH starting from transmission of a 4-step RACH preamble, the UE transmits a 4-step RACH preamble on the same beam and with the same power as a 2-step RACH when the MsgA preamble but no MsgA data was received.
[0123] In some implementations, when the gNB detects a 2-step MsgA preamble but no data, and indicates to the UE to fall back to 4-step RACH from the transmission of 4-step RACH Msg3, the UE transmits Msg3 following the power control command in MsgB, where the power control command is applied to the power of the data portion of MsgA. In some implementations, there is an additional power offset that is semi-statically configured.
[0124] In the following discussion, the 2-step RACH PUSCH resource unit is referred to as a PUSCH opportunity (PO). Fig.13 As shown, the mapping of the PRACH preamble code and PRACH opportunity within a PRACH time slot (or PRACH subframe / 60kHz time slot in FR1 / FR2) to the PUSCH opportunity (i.e., the basic unit) is performed in frequency first and then time, starting with a PUSCH opportunity having a configured time starting from the PRACH time slot (or PRACH subframe / 60kHz time slot in FR1 / FR2) and a frequency offset starting from the first RO in frequency.
[0125] Within a PRACH slot, there are multiple PRACH opportunities (ROs). For example, with preamble format A2, there are three time domain ROs within a PRACH slot. If the product of the duration of the PO and the number of time division multiplexed (TDMed) POs mapped to one RO is greater than the duration of the RO, the offset between the start of each RO and the start of the corresponding PO is based on the position of the RO within the PRACH slot, and each RO has a different time offset for the time relationship between the RO and the PO. The time offset can be fixed in the specification or configured by a higher layer, the latter being preferred because it provides greater flexibility for the network. Similar arguments are supported in the frequency domain when multiple ROs are FDMed (time division multiplexed) in the same time domain RO. Nevertheless, this configuration will increase the configuration overhead because there may be a time offset and a frequency offset for each RO within the PRACH slot.
[0126] In some implementations, to simplify the configuration of the mapping rules between RO and PO, all 2-step RACH ROs within a PRACH slot (or PRACH subframe / 60kHz slot in FR1 / FR2) are mapped to PO before the next occurrence of a 2-step PRACH slot (or PRACH subframe / 60kHz slot in FR1 / FR2). In this case, the network can configure a time domain offset (Preamble2DataTime) between the start of a PRACH slot (or PRACH subframe / 60kHz slot in FR1 / FR2) and the start of the first PUSCH opportunity mapped to the first RO within the PRACH slot (or PRACH subframe / 60kHz slot in FR1 / FR2). The mapping of the preamble groups within the RO to the PO occurs in frequency first and then in time. Therefore, a single semi-static value is used to configure the offset between the start of the PRACH slot (or PRACH subframe / 60kHz slot in FR1 / FR2) containing the 2-step RACH RO and the start of the PUSCH opportunity. Another semi-static value is used to configure the offset in the frequency domain between the start of the first RO in frequency and the start of the PUSCH opportunity in frequency.
[0127] Fig.13 1 is a diagram illustrating a RO to PO mapping 1300 using two configured semi-static offsets (one semi-static offset in time and the other semi-static offset in frequency) according to an example implementation. Fig.13 In the PRACH time slot, there are 6 ROs - R0 to R5. According to the mapping, each PO is mapped to two PUSCH resources. Fig.13In the , there are four frequency slots and three time slots in the PUSCH resource. In each slot corresponding to the PO, the PUSCH associated with the half preamble corresponding to the mapped RO is configured to be sent to the gNB.
[0128] Fig.14 1 is a schematic diagram illustrating a mapping 1400 of PRACH opportunities to PUSCH opportunities with PUSCH repetition according to an example implementation. Fig.14 As shown, there is no frequency offset (i.e., frequency offset = 0), and the time offset is given by the semi-static value Preamble2DataTime. Fig.14 In the , there are four frequency slots and six time slots in the PUSCH resource. In each slot corresponding to the PO, the PUSCH associated with half of the preamble corresponding to the mapped RO is configured to be sent to the gNB, and each half is repeated in time.
[0129] Fig.15 1 is a schematic diagram illustrating a mapping 1500 from PRACH opportunities to PUSCH opportunities using a frequency-first-then-time mapping rule for four preamble groups per RO according to an example implementation. Fig.15 As shown, there is no frequency offset (i.e., frequency offset = 0), and the time offset is given by the semi-static value Preamble2DataTime. Fig.15 In the , there are four frequency slots and six time slots in the PUSCH resource. In each slot corresponding to the PO, the PUSCH associated with one quarter of the preamble corresponding to the mapped RO is configured to be sent to the gNB without duplication in time.
[0130] Fig.16 is a schematic diagram illustrating an alternative mapping rule 1600 according to an example implementation. Fig.16 The alternative mapping rule shown in will have the frequency domain location of the PO based on an offset from the corresponding RO, where the offset depends on the frequency location of the RO. In the time domain, a single semi-static value is used to configure the offset between the start of the PRACH slot (or PRACH subframe / 60kHz slot in FR1 / FR2) containing the 2-step RACH RO and the start of the PUSCH opportunity.
[0131] Fig.17 is a flow chart illustrating a method of performing a fallback 4-step RACH procedure according to an example implementation.
[0132] Example 1: At 1710, the UE receives information from the network, the information including power ramp data, the power ramp data including a power ramp configuration representing a scheme that enables fallback from a 2-step random access channel (RACH) procedure to a 4-step RACH procedure. At 1720, the UE determines a first power value for the 2-step RACH. At 1730, the UE transmits a first message to a base station (gNB) through physical RACH (PRACH) and physical uplink shared channel (PUSCH) resources in time space and frequency space according to the 2-step RACH procedure at a first power value, the first message including a preamble configured to be transmitted through the PRACH and message data configured to be sent through the PUSCH resources. At 1740, the UE generates a second power value based on the power ramp configuration, the second power being an initial power value for the 4-step RACH procedure.
[0133] Example 2: An example implementation according to Example 1, wherein the first power value is greater than the second power value.
[0134] Example 3: An example implementation according to Example 1 or Example 2, wherein the power ramp configuration specifies a threshold number of message transmissions to be attempted in a 2-step RACH procedure before transitioning to a 4-step RACH procedure.
[0135] Example 4: An example according to any one of Examples 1 to 3, wherein the power ramp configuration specifies a threshold power value before transitioning to a 4-step RACH procedure.
[0136] Example 5: An example according to any one of Examples 1 to 4, wherein transmission of a first message to a gNB is performed using a first beam; and wherein transmission of a second message is performed using the first beam.
[0137] Example 6: The example implementation according to Example 5, wherein generating the second power value includes: increasing the power value used for transmission via the first beam to produce the second power value.
[0138] Example 7: An example according to any one of Examples 1 to 6, wherein transmission of the first message to the gNB is performed using a first beam; and wherein transmission of the second message includes sending the second message via a second beam different from the first beam.
[0139] Example 8: An example implementation according to Example 7, wherein sending the second message via the second beam includes using substantially the same power as that transmitted via the first beam.
[0140] Example 9: An example implementation according to Example 7, wherein sending the second message via the second beam includes increasing the power transmitted via the first beam to produce a second power, the second power being based on a power increment in a 2-step RACH scheme.
[0141] Example 10: An example implementation according to Example 7, wherein sending the second message via the second beam includes reducing the power transmitted via the first beam to produce a second power, the second power being substantially equal to the initial power used to start the 2-step RACH process.
[0142] Example 11: An example according to any one of Examples 1 to 10, wherein the information received from the network includes a specified power offset value between a 2-step RACH procedure and a 4-step RACH procedure.
[0143] Example 12: An example according to any one of Examples 1 to 11, wherein the information received from the network includes a specified initial power value for a 4-step RACH procedure.
[0144] Example 13: An example according to any one of Examples 1 to 12, wherein according to a 2-step RACH process, transmitting a first message to the gNB at a first power value through PRACH and PUSCH resources in time space and frequency space includes: sending a preamble through PRACH at a preamble power value; and sending message data through PUSCH resources at a power value offset by a specified amount from the preamble power value, the sum of the preamble power value and the specified amount being equal to the first power value.
[0145] Example 14: According to any one of Examples 1 to 13, it also includes: selecting an RO among multiple PRACH opportunities (ROs) as the PRACH through which the preamble code of the first message is sent, each RO among the multiple ROs corresponds to a corresponding time offset and a corresponding frequency, and the RO is located in the PRACH time slot; and based on the time offset and frequency of the selected RO, mapping the RO to a PO among the multiple POs as a PUSCH resource for the message data through which the first message is sent.
[0146] Example 15: The example implementation of Example 14, wherein mapping of each RO of the plurality of ROs occurs before occurrence of another PRACH slot.
[0147] Example 16: An example according to Example 14 or 15, wherein mapping the PO includes determining a time offset for the PO, the time offset for the PO being between the time offset of the selected RO and the time offset of another PO mapped to the first RO within the PRACH time slot.
[0148] Example 17: An example implementation according to Example 16, wherein a time offset for each of a plurality of POs is determined using a first semi-static value, and wherein the method further includes determining a frequency offset for each of a plurality of POs between a start of a first RO in a frequency space and a start of each of a plurality of POs in a frequency space using a second semi-static value.
[0149] Example 18: An example implementation according to Example 17, wherein mapping of PO is performed first in frequency and then in time.
[0150] Example 19: An example implementation according to Example 16, wherein a frequency offset for each PO in a plurality of POs is determined based on a frequency corresponding to a RO, and wherein a time offset for each PO in a plurality of POs is determined using a first semi-static value to be between a start of a first RO and a start of the plurality of POs in a time domain.
[0151] Example 20: The example implementation of any of example claims 14 to 19, wherein the PO is not available, and in response to the PO being not available, the PO is skipped when mapping the PRACH preamble and the PO to the RO.
[0152] Example 21: The example implementation of Example 3, wherein the first power value for the 2-step RACH procedure is determined based on a threshold number of times message transmission is attempted.
[0153] Example 22: An example according to Example 1, wherein the first power value for the 2-step RACH procedure is determined according to a configuration of the network.
[0154] Example 23: An apparatus comprising components for performing the method of any of Examples 1 to 22.
[0155] Example 24: A computer program product comprising a non-transitory computer-readable storage medium and storing executable code, which when executed by at least one data processing device is configured to cause the at least one data processing device to perform the method of any one of claims 1 to 22.
[0156] Additional example implementations and / or example details are now provided.
[0157] Example abbreviation list:
[0158] 3GPP: Third Generation Partnership Project
[0159] 4G: The fourth generation of mobile communication technology
[0160] 5G: The fifth generation of mobile communication technology
[0161] 5GMM: 5GS Mobility Management
[0162] 5GS: 5G System
[0163] 5GSM: 5GS Session Management
[0164] ACB: Access Class Barred
[0165] AMF: Access and Mobility Management Function
[0166] CSFB: Circuit Switched Fallback
[0167] DM: Device Management
[0168] DN: Data Network
[0169] DNN: Data Network Name
[0170] EHPLMN: Equivalent HPLMN
[0171] eMBB: enhanced mobile broadband
[0172] eNB: Evolved Node B
[0173] EPS: Evolved Packet System
[0174] gNB: Next Generation Node B (uncertain)
[0175] HPLMN belongs to PLMN
[0176] IMS: IP Multimedia Subsystem
[0177] IoT: Internet of Things
[0178] IP: Internet Protocol
[0179] MME: Mobility Management Entity
[0180] MMTel: IMS Multimedia Telephone Service
[0181] NAS: Non-Access Stratum
[0182] NGAP: Next Generation Application Protocol
[0183] NSSAI: Network Slice Selection Assistance Information
[0184] OAM: Operations, Administration and Management
[0185] OMA: Open Mobile Alliance
[0186] OS: Operating System
[0187] PCF: Policy Control Function
[0188] PDU: Protocol Data Unit
[0189] PLMN Public Land Mobile Network
[0190] RAN: Radio Access Network
[0191] RRC: Radio Resource Control
[0192] S-NSSAI: Single NSSAI
[0193] SD: Slice Differentiator
[0194] SMS: Short Message Service
[0195] SMSoNAS: SMS via NAS
[0196] SMSoIP: SMS over IP
[0197] SSAC: Service Specific Access Control
[0198] SST: Slice / Serving Type
[0199] UDM: User Data Management
[0200] UE: User Equipment
[0201] UPF: User Plane Function
[0202] URLLC: Ultra-Reliable Low Latency Communications
[0203] VPLMN: Visited PLMN
[0204] Fig.18 1800 is a block diagram of a wireless station (e.g., AP, BS, eNB, UE, or user equipment) 1800 according to an example implementation. The wireless station 1800 may include, for example, one or two RF (radio frequency) or wireless transceivers 1802A, 1802B, each of which includes a transmitter for transmitting signals and a receiver for receiving signals. The wireless station also includes a processor or control unit / entity (controller) 1804 for executing instructions or software and controlling the transmission and reception of signals, and a memory 1806 for storing data and / or instructions.
[0205] Processor 1804 may also make decisions or determinations, generate frames, packets or messages for transmission, decode received frames or messages for further processing, and other tasks or functions described herein. Processor 1804 may be, for example, a baseband processor that may generate messages, packets, frames or other signals for transmission via wireless transceiver 1802 (1802A or 1802B). Processor 904 may control signals or messages transmitted over a wireless network, and may control the reception of signals or messages via a wireless network (e.g., after downconversion by wireless transceiver 1802), etc. Processor 1804 may be programmable and may be capable of executing software or other instructions stored in a memory or other computer medium to perform the various tasks and functions described above, such as one or more of the tasks or methods described above. Processor 1804 may be (or may include) for example, hardware, programmable logic, a programmable processor that executes software or firmware, and / or any combination of these. Using other terms, for example, processor 1804 and transceiver 1802 together may be considered a wireless transmitter / receiver system.
[0206] In addition, refer to Fig.18 , the controller (or processor) 1808 can execute software and instructions and can provide overall control for the station 1800 and can Fig.18 Other systems not shown provide controls, such as controlling input / output devices (e.g., display, keyboard), and / or may execute software for one or more applications that may be provided on wireless station 1800, such as, for example, an email program, an audio / video application, a word processor, a voice over IP application, or other applications or software.
[0207] Additionally, a storage medium may be provided that includes stored instructions that, when executed by a controller or processor, may cause the processor 1204 or other controller or processor to perform one or more of the functions or tasks described above.
[0208] According to another example implementation, the RF or (multiple) wireless transceiver 1802A / 1802B can receive signals or data and / or transmit or send signals or data. The processor 1804 (and possibly the transceiver 1802A / 1802B) can control the RF or wireless transceiver 1802A or 1802B to receive, send, broadcast or transmit signals or data.
[0209] However, the embodiments are not limited to the systems given as examples, but those skilled in the art may apply the solution to other communication systems. Another example of a suitable communication system is the 5G concept. It is assumed that the network architecture of 5G is very similar to that of LTE-Advanced. 5G may use multiple-input multiple-output (MIMO) antennas, many more base stations or nodes than LTE (the so-called small cell concept), including macro stations operating in cooperation with smaller stations, and may also adopt various radio technologies to obtain better coverage and enhanced data rates.
[0210] It should be understood that future networks are most likely to utilize network function virtualization (NFV), which is a network architecture concept that proposes virtualizing network node functions into "building blocks" or entities that are operably connected or linked together to provide services. A virtualized network function (VNF) may include one or more virtual machines that run computer program code using standard or general-purpose type servers rather than customized hardware. Cloud computing or data storage may also be utilized. In radio communications, this may mean that node operations may be performed at least in part in a server, host, or node that is operably coupled to a remote radio head. Node operations may also be distributed among multiple servers, nodes, or hosts. It should also be understood that the distribution of labor between core network operations and base station operations may be different from LTE, or even non-existent.
[0211] The implementation of the various technologies described herein can be implemented in a digital electronic circuit system, or in computer hardware, firmware, software, or a combination thereof. The implementation can be implemented as a computer program product, i.e., a computer program tangibly implemented in an information carrier (e.g., a machine-readable storage device or a propagation signal) for execution or control of its operation by a data processing device (e.g., a programmable processor, a computer, or multiple computers). The implementation can also be provided on a computer-readable medium or a computer-readable storage medium (which can be a non-transient medium). The implementation of various technologies can also include an implementation provided via a transient signal or media, and / or a program and / or software implementation that can be downloaded via the Internet or (multiple) other networks (wired networks and / or wireless networks). In addition, the implementation can be provided via machine type communication (MTC) or via the Internet of Things (IOT).
[0212] A computer program may be in source code form, object code form or some intermediate form and may be stored in some carrier, distribution medium or computer readable medium, which may be any entity or device capable of carrying the program. These carriers include, for example, recording media, computer memories, read-only memories, optoelectronic and / or electrical carrier signals, telecommunication signals and software distribution packets. Depending on the processing power required, a computer program may be executed in a single electronic digital computer or may be distributed among multiple computers.
[0213] In addition, implementations of the various techniques described herein may use a cyber-physical system (CPS) (a system of collaborative computing elements that control physical entities). CPS can implement and utilize large-scale interconnected ICT devices (sensors, actuators, processors microcontrollers, ...) embedded in physical objects in different locations. Mobile cyber-physical systems are a subcategory of cyber-physical systems, in which the physical systems in question have inherent mobility. Examples of mobile physical systems include mobile robots and electronic devices transported by humans or animals. The rise of the popularity of smartphones has increased interest in the field of mobile cyber-physical systems. Therefore, via one or more of these technologies, various implementations of the techniques described herein may be provided.
[0214] Computer programs (such as the above-mentioned (multiple) computer programs) can be written in any form of programming language (including compiled or interpreted languages) and can be deployed in any form, including as a stand-alone program or module, component, subroutine or other unit or part thereof suitable for use in a computing environment. A computer program can be deployed to be executed on one computer or on multiple computers at one site, or distributed across multiple sites and interconnected by a communication network.
[0215] The method steps may be performed by one or more programmable processors executing a computer program or a portion of a computer program to perform functions by operating on input data and generating output. The method steps may also be performed by, and the apparatus may be implemented as, a special purpose logic circuit (e.g., an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit)).
[0216] For example, processors suitable for executing computer programs include general and special purpose microprocessors, and any one or more processors of any type of digital computer, chip or chipset. Typically, the processor will receive instructions and data from a read-only memory or a random access memory or both. The elements of a computer may include at least one processor for executing instructions and one or more storage devices for storing instructions and data. Typically, a computer may also include or be operatively coupled to one or more mass storage devices for storing data, such as magnetic disks, magneto-optical disks or optical disks, to receive data from the one or more mass storage devices or to transfer data to the two. Information carriers suitable for implementing computer program instructions and data include all forms of non-volatile memory, including, for example, semiconductor memory devices, such as EPROM, EEPROM and flash memory devices; magnetic disks, such as internal hard disks or removable disks; magneto-optical disks; and CD-ROM and CD-ROM optical disks. The processor and memory may be supplemented by or incorporated into a dedicated logic circuit.
[0217] To provide interaction with a user, implementations may be implemented on a computer having a display device (e.g., a cathode ray tube (CRT) or liquid crystal display (LCD) monitor) that displays information to the user and a user interface (e.g., a keyboard and a pointing device, such as a mouse or trackball) through which the user can provide input to the computer. Other types of devices may also be used to provide interaction with a user; for example, feedback provided to the user may be any form of sensory feedback, such as visual feedback, auditory feedback, or tactile feedback; and input from the user (including sound, voice, or tactile input) may be received in any form.
[0218] The implementation may be implemented in a computing system that includes a back-end component (e.g., as a data server) or includes a middleware component (e.g., an application server) or includes a front-end component (e.g., a client computer with a graphical user interface or a network (Web) browser through which the implementation can interact), or any combination of such back-end, middleware, or front-end components. The components may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include local area networks (LANs) and wide area networks (WANs), such as the Internet.
[0219] While certain features of the described implementations have been illustrated as described herein, many modifications, substitutions, changes, and equivalents will now occur to those skilled in the art. It should therefore be understood that the appended claims are intended to cover all such modifications and changes that fall within the true spirit of the various implementations.
Claims
1. A method of communication, comprising: receiving, by a user equipment (UE) from a network, information including power ramp data representing a power ramp configuration for a scheme that enables fallback from a 2-step random access channel (RACH) procedure to a 4-step RACH procedure; determining a first power value for the 2-step RACH procedure; transmitting, by the UE in accordance with the 2-step RACH procedure, a first message to a base station (gNB) at a first power value through a physical RACH (PRACH) and a physical uplink shared channel (PUSCH) resource in time space and frequency space, the first message comprising a preamble configured to be transmitted through the PRACH and message data configured to be sent through the PUSCH resource, wherein transmitting the first message to the gNB in accordance with the 2-step RACH procedure in time space and frequency space through the PRACH and the PUSCH resource at the first power value comprises: sending the preamble through the PRACH at the preamble power value, and sending the message data through the PUSCH resource at a power value offset by a specified amount from the preamble power value, the sum of the preamble power value and the specified amount being equal to the first power value; and A second power value is generated by the UE based on the power ramp configuration, where the second power value is an initial power value for the 4-step RACH process. The method according to claim 1 , wherein the first power value is greater than the second power value.
3. The method of claim 1 or 2, wherein the power ramp configuration specifies a threshold number of message transmissions to be attempted in the 2-step RACH procedure before switching to the 4-step RACH procedure.
4. The method of claim 1 or 2, wherein the power ramp schedule specifies a threshold power value before switching to the 4-step RACH procedure.
5. The method of claim 1 or 2, wherein the transmission of the first message to the gNB is performed using a first beam; and Wherein said transmission of a second message is performed using said first beam.
6. The method of claim 5, wherein generating the second power value comprises: The power value used for transmission via the first beam is increased to produce the second power value.
7. The method of claim 1 or 2, wherein the transmission of the first message to the gNB is performed using a first beam; and Wherein the transmission of the second message comprises sending the second message via a second beam different from the first beam.
8. The method of claim 7, wherein sending the second message via the second beam comprises: Substantially the same power is used as is transmitted via the first beam.
9. The method of claim 7, wherein sending the second message via the second beam comprises: The power transmitted through the first beam is increased to produce the second power, the second power being based on a power increment in the 2-step RACH scheme.
10. The method of claim 7, wherein sending the second message via the second beam comprises: The power transmitted via the first beam is reduced to produce the second power, the second power being substantially equal to an initial power used to start the 2-step RACH procedure.
11. The method according to claim 1 or 2, wherein the information received from the network comprises: A specified power offset value between the 2-step RACH procedure and the 4-step RACH procedure.
12. The method of claim 1 or 2, wherein the information received from the network includes a designated initial power value for the 4-step RACH procedure.
13. The method according to claim 1 or 2, further comprising: selecting a RO among a plurality of PRACH opportunities (ROs) as the PRACH through which the preamble of the first message is transmitted, each RO among the plurality of ROs corresponding to a respective time offset and a respective frequency, the RO being located in a PRACH time slot; as well as Based on the time offset and the frequency of the selected RO, the RO is mapped to a PO among a plurality of PUSCH opportunities PO as the PUSCH resource through which the message data of the first message is transmitted.
14. The method of claim 13, wherein mapping of each RO of the plurality of ROs occurs before occurrence of another PRACH time slot.
15. The method of claim 13, wherein mapping the PO comprises: A time offset for the PO is determined, the time offset for the PO being between the time offset of the selected RO and a time offset of another PO mapped to a first RO within the PRACH slot.
16. The method of claim 15, wherein the time offset for each PO of the plurality of POs is determined using a first semi-static value, and The method further comprises: A second semi-static value is used to determine a frequency offset for each of the plurality of POs between a start of the first RO in frequency space and a start of each of the plurality of POs in frequency space. The method according to claim 16 , wherein the mapping of the PO is performed in frequency first and then in time.
18. The method of claim 15, wherein a frequency offset for each of the plurality of POs is determined based on a frequency to which the RO corresponds, and Wherein a time offset for each PO of the plurality of POs is determined using a first semi-static value to be between a start of the first RO and a start of the plurality of POs in a time domain.
19. The method of claim 13, wherein the PO is unavailable, and In response to the PO being unavailable, the PO is skipped when mapping the PRACH preamble and the PO to the RO.
20. The method of claim 3, wherein the first power value for the 2-step RACH procedure is determined based on the threshold number of times the message transmission is attempted.
21. The method of claim 1, wherein the first power value for the 2-step RACH procedure is determined according to a configuration of the network.
22. An apparatus for communication, comprising: at least one processor; as well as at least one memory including computer program code; The at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus to at least: receiving information from a network, the information comprising power ramp data representing a power ramp configuration for a scheme that enables fallback from a 2-step random access channel (RACH) procedure to a 4-step RACH procedure; determining a first power value for the 2-step RACH procedure; transmitting a first message to a base station (gNB) at a first power value through a physical RACH (PRACH) and a physical uplink shared channel (PUSCH) resource in time space and frequency space according to the 2-step RACH procedure, the first message comprising a preamble configured to be transmitted through the PRACH and message data configured to be sent through the PUSCH resource, wherein transmitting the first message to the gNB at the first power value through the PRACH and the PUSCH resource in time space and frequency space according to the 2-step RACH procedure comprises: sending the preamble through the PRACH at the preamble power value, and sending the message data through the PUSCH resource at a power value offset by a specified amount from the preamble power value, a sum of the preamble power value and the specified amount being equal to the first power value; and A second power value is generated based on the power ramping scheme, the second power value being an initial power value for the 4-step RACH procedure.
23. The apparatus of claim 22, wherein the first power value is greater than the second power value.
24. The apparatus of claim 22 or 23, wherein the power ramp configuration specifies a threshold number of message transmissions to be attempted in the 2-step RACH procedure before transitioning to the 4-step RACH procedure.
25. The apparatus of claim 22 or 23, wherein the power ramp configuration specifies a threshold power value before transitioning to the 4-step RACH procedure.
26. The apparatus of claim 22 or 23, wherein the transmission of the first message to the gNB is performed using a first beam; and Wherein said transmission of a second message is performed using said first beam.
27. The apparatus of claim 26, wherein the control circuitry configured to generate the second power value is further configured to increase the power value used for transmissions via the first beam to produce the second power value.
28. The apparatus of claim 22 or 23, wherein control circuitry is configured to transmit the first message to the gNB using a first beam; and Wherein the control circuitry configured to transmit a second message is further configured to send the second message via a second beam different from the first beam.
29. The apparatus of claim 28, wherein the control circuitry configured to send the second message via the second beam is further configured to use substantially the same power as that transmitted via the first beam.
30. An apparatus according to claim 29, wherein the control circuit system configured to send the second message via the second beam is also configured to: increase the power transmitted via the first beam to produce the second power, and the second power is based on the power increment in the 2-step RACH scheme.
31. An apparatus according to claim 29, wherein the control circuit system configured to send the second message via the second beam is also configured to: reduce the power transmitted via the first beam to produce the second power, which is substantially equal to the initial power used to start the 2-step RACH process.
32. The apparatus of claim 22 or 23, wherein the information received from the network comprises: A specified power offset value between the 2-step RACH procedure and the 4-step RACH procedure.
33. The apparatus of claim 22 or 23, wherein the information received from the network includes a designated initial power value for the 4-step RACH procedure.
34. The apparatus according to claim 22 or 23, further comprising: selecting a RO among a plurality of PRACH opportunities (ROs) as the PRACH through which the preamble of the first message is transmitted, each RO among the plurality of ROs corresponding to a respective time offset and a respective frequency, the RO being located in a PRACH time slot; as well as Based on the time offset and the frequency of the selected RO, the RO is mapped to a PO among a plurality of PUSCH opportunities PO as the PUSCH resource through which the message data of the first message is transmitted.
35. The apparatus of claim 34, wherein mapping of each RO of the plurality of ROs occurs before occurrence of another PRACH slot.
36. The apparatus of claim 34, wherein mapping the PO comprises: A time offset for the PO is determined, the time offset for the PO being between the time offset of the selected RO and a time offset of another PO mapped to a first RO within the PRACH slot.
37. The device according to claim 36, wherein a time offset for each PO of the plurality of POs is determined using a first semi-static value, and Wherein the apparatus is further caused to: determine, using a second semi-static value, a frequency offset for each of the plurality of POs between a start of the first RO in frequency space and a start of each of the plurality of POs in frequency space.
38. The apparatus of claim 37, wherein the mapping of the PO is performed in frequency first and then in time.
39. The apparatus of claim 36, wherein a frequency offset for each of the plurality of POs is determined based on a frequency to which the RO corresponds, and Wherein a time offset for each PO of the plurality of POs is determined using a first semi-static value to be between a start of the first RO and a start of the plurality of POs in a time domain.
40. The apparatus of claim 34, wherein the PO is unavailable, and In response to the PO being unavailable, the PO is skipped when mapping the PRACH preamble and the PO to the RO.
41. The apparatus of claim 24, wherein the first power value for the 2-step RACH procedure is determined based on the threshold number of times the message transmission is attempted.
42. The apparatus of claim 22, wherein the first power value for the 2-step RACH procedure is determined according to a configuration of the network.
43. An apparatus for communication, comprising: means for receiving, by a user equipment (UE), information from a network, the information comprising power ramp data representing a power ramp configuration for a scheme enabling fallback from a 2-step random access channel (RACH) procedure to a 4-step RACH procedure; means for determining a first power value for said 2-step RACH procedure; means for transmitting, by the UE, a first message to a base station (gNB) at a first power value through a physical RACH (PRACH) and a physical uplink shared channel (PUSCH) resource in time space and frequency space according to the 2-step RACH procedure, the first message comprising a preamble configured to be transmitted through the PRACH and message data configured to be sent through the PUSCH resources, wherein transmitting the first message to the gNB at the first power value through the PRACH and the PUSCH resources in time space and frequency space according to the 2-step RACH procedure comprises: sending the preamble through the PRACH at the preamble power value, and sending the message data through the PUSCH resource at a power value offset by a specified amount from the preamble power value, a sum of the preamble power value and the specified amount being equal to the first power value; and means for generating, by the UE, a second power value based on the power ramp configuration, the second power value being an initial power value for the 4-step RACH procedure.
44. The apparatus of claim 43, wherein the first power value is greater than the second power value.
45. The apparatus of claim 43 or 44, wherein the power ramp configuration specifies a threshold number of message transmissions to be attempted in the 2-step RACH procedure before transitioning to the 4-step RACH procedure.
46. The apparatus of claim 43 or 44, wherein the power ramp schedule specifies a threshold power value before transitioning to the 4-step RACH procedure.
47. The apparatus of claim 43 or 44, wherein the means for transmitting the first message to the gNB comprises a first beam; and Wherein said means for transmitting a second message comprises said first beam.
48. The apparatus of claim 47, wherein the means for generating the second power value comprises: The power value used for transmission via the first beam is increased to produce the second power value.
49. The apparatus of claim 43 or 44, wherein the means for transmitting the first message to the gNB comprises a first beam; and Wherein the component for transmitting the second message comprises: Means for transmitting the second message via a second beam different from the first beam.
50. The apparatus of claim 49, wherein the means for transmitting the second message via the second beam comprises: Means for using substantially the same power as that transmitted by said first beam.
51. The apparatus of claim 49, wherein the means for transmitting the second message via the second beam comprises: means for increasing the power transmitted via the first beam to produce the second power, the second power being based on a power increment in the 2-step RACH scheme.
52. The apparatus of claim 49, wherein the means for transmitting the second message via the second beam comprises: means for reducing the power transmitted via the first beam to produce the second power, the second power being substantially equal to an initial power used to start the 2-step RACH procedure.
53. The apparatus of claim 43 or 44, wherein the information received from the network comprises: A specified power offset value between the 2-step RACH procedure and the 4-step RACH procedure.
54. The apparatus of claim 43 or 44, wherein the information received from the network includes a designated initial power value for the 4-step RACH procedure.
55. The apparatus of claim 43 or 44, further comprising: means for selecting a RO of a plurality of PRACH opportunities (ROs) as the PRACH through which the preamble of the first message is transmitted, each RO of the plurality of ROs corresponding to a respective time offset and a respective frequency, the RO being located in a PRACH time slot; as well as A component for mapping the RO to a PO among a plurality of PUSCH opportunities PO as the PUSCH resource through which the message data of the first message is transmitted based on the time offset and the frequency of the selected RO.
56. The apparatus of claim 55, wherein mapping of each RO of the plurality of ROs occurs before occurrence of another PRACH slot.
57. The apparatus of claim 55, wherein the means for mapping the PO comprises: Means for determining a time offset for the PO, the time offset for the PO being between the time offset of the selected RO and a time offset of another PO mapped to a first RO within the PRACH slot.
58. The apparatus of claim 57, wherein the time offset for each of the plurality of POs is determined using a first semi-static value, and The device further comprises: Means for determining, using a second semi-static value, a frequency offset for each of the plurality of POs between a start of the first RO in frequency space and a start of each of the plurality of POs in frequency space.
59. The apparatus of claim 58, wherein the mapping of the PO is performed in frequency first and then in time.
60. The apparatus of claim 57, wherein a frequency offset for each of the plurality of POs is determined based on a frequency to which the RO corresponds, and Wherein a time offset for each PO of the plurality of POs is determined using a first semi-static value to be between a start of the first RO and a start of the plurality of POs in a time domain.
61. The apparatus of claim 55, wherein the PO is unavailable, and The device further comprises: Means for skipping the PO when mapping the PRACH preamble and the PO to the RO in response to the PO being unavailable.
62. The apparatus of claim 46, wherein the first power value for the 2-step RACH procedure is determined based on the threshold number of times the message transmission is attempted.
63. The apparatus of claim 44, wherein the first power value for the 2-step RACH procedure is determined according to a configuration of the network.
64. A computer program product comprising a non-transitory computer-readable storage medium and storing executable code, which, when executed by at least one data processing device, is configured to cause the at least one data processing device to perform the method of any one of claims 1 to 21.
65. An apparatus for communication comprising means for performing the method according to any one of claims 1 to 21.
