Random access timeline for reduced capability devices

Abstract

Methods, systems, and devices for wireless communication are described. A first network node may send first information indicating bandwidth capabilities of the first network node and a first random access message to a second network node. The second network node may transmit a second random access message in response to the first random access message and via a number of physical resource blocks (PRBs). The second random access message may indicate a time period for transmission of a third random access message by the first network node in response to the second random access message. The time period may be based on a threshold time period associated with a bandwidth capability of the first network node, and the threshold time period may be based on a number of PRBs via which the second random access message is transmitted.

Description

[0001] Cross-references

[0002] This patent application claims priority to U.S. patent application No. 18 / 164,383, filed by Kwak et al. on February 3, 2023, entitled “RANDOM ACCESSTIMELINE FOR AREDUCED CAPABILITY DEVICE,” which is assigned to the assignee of this application and is expressly incorporated herein by reference. Technical Field

[0003] The following relates to wireless communications related to a timeline for a random access procedure performed by a wireless device with reduced capabilities. Wireless communication systems are widely deployed to provide various types of communication content such as voice, video, packet data, messaging, broadcast, etc. These systems can support communication with multiple users by sharing available system resources (e.g., time, frequency, and power). Examples of such multiple access systems include fourth generation (4G) systems (e.g., long term evolution (LTE) systems, improved LTE (LTE-A) systems, or LTE-A Pro systems) and fifth generation (5G) systems (which may be referred to as new radio (NR) systems). These systems may employ technologies such as code division multiple access (CDMA), time division multiple access (TDMA), frequency division multiple access (FDMA), orthogonal FDMA (OFDMA), or discrete Fourier transform spread orthogonal frequency division multiplexing (DFT-S-OFDM). A wireless multiple access communication system may include one or more base stations, each of which supports wireless communications for a communication device (which may be referred to as a user equipment (UE)). Summary of the Invention

[0004] The described techniques relate to improved methods, systems, devices, and apparatuses for supporting random access timelines for devices with reduced capabilities. For example, the described techniques define an extended time period for a random access procedure to accommodate a network node with reduced capabilities (e.g., a RedCap user equipment (UE) or some other device with reduced capabilities) processing random access messages sent via more physical resource blocks (PRBs) than the network node with reduced capabilities is designed to process per time slot. The network node with reduced capabilities may send first information indicating the bandwidth capabilities of the network node with reduced capabilities to a second network node. For example, the first information may indicate a threshold number of PRBs that the network node with reduced capabilities can process per time slot. The network node with reduced capabilities may send a first random access message (e.g., MsgA, Msg1, or Msg3) to the second network node. The second network node may respond to the first random access message and send a second random access message (e.g., MsgB, Msg2, or Msg4) via a number of PRBs. The second random access message may indicate a time period for the reduced capability network node to transmit a third random access message (e.g., Msg3, preamble retransmission, or feedback message) in response to the second random access message. The time period may be based on (e.g., greater than or equal to) a threshold time period associated with the bandwidth capability of the reduced capability network node, and the threshold time period may be based on the number of PRBs over which the second random access message is transmitted. The reduced capability network node may transmit the third random access message based on the time period. Thus, the time period may accommodate the reduced capability network node processing the second random access message received over the number of PRBs.

[0005] A method for wireless communication at a first network node is described. The method may include receiving first information indicating bandwidth capabilities of a second network node; receiving a first random access message; and sending a second random access message based on the first random access message and via a number of PRBs, the second random access message indicating a time period for transmitting a third random access message by the second network node in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capabilities of the second network node, and wherein the threshold time period is based on the number of PRBs.

[0006] A first network node for wireless communication is described. The first network node may include a memory and at least one processor coupled to the memory. The at least one processor may be configured to: receive first information indicating bandwidth capabilities of a second network node; receive a first random access message; and send a second random access message based on the first random access message and via a number of PRBs, the second random access message indicating a time period for the second network node to transmit a third random access message in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capabilities of the second network node, and wherein the threshold time period is based on the number of PRBs.

[0007] Another apparatus for wireless communication at a first network node is described. The apparatus may include: means for receiving first information indicating bandwidth capabilities of a second network node; means for receiving a first random access message; and means for sending a second random access message based on the first random access message and via a number of PRBs, the second random access message indicating a time period for transmitting a third random access message by the second network node in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capabilities of the second network node, and wherein the threshold time period is based on the number of PRBs.

[0008] A non-transitory computer-readable medium storing code for wireless communication at a first network node is described. The code may include instructions executable by a processor to: receive first information indicating bandwidth capabilities of a second network node; receive a first random access message; and send a second random access message based on the first random access message and via a number of PRBs, the second random access message indicating a time period for the second network node to transmit a third random access message in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capabilities of the second network node, and wherein the threshold time period is based on the number of PRBs.

[0009] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may also include operations, features, means, or instructions for monitoring the third random access message based on the time period.

[0010] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the threshold time period may be based on a first duration and an extension time, the first duration may be based on a processing time associated with the first random access message, and the extension time may be based on the number of PRBs.

[0011] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the number of PRBs of the second random access message may be within a specific PRB number range, and the extension time may be based on the specific PRB number range.

[0012] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the specific PRB number range may be from a set of multiple PRB number ranges within the system bandwidth, and each PRB number range in the set of multiple PRB number ranges corresponds to a corresponding extension time.

[0013] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, one or more ranges in the set of multiple ranges may be defined by a respective maximum number of PRBs and a respective minimum number of PRBs.

[0014] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, each PRB number range in the set of multiple PRB number ranges includes a same number of PRBs, where the same number of PRBs represents a fraction of the total number of PRBs included in the set of multiple PRB number ranges.

[0015] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the extended time may be based on a difference between the number of PRBs of the second random access message and a threshold number.

[0016] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the extension time may be constant based on the number of PRBs of the second random access message being greater than a threshold number.

[0017] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the time period may be based on the threshold time period, and the time period may be greater than or equal to the threshold time period.

[0018] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, sending the second random access message may include operations, features, units, or instructions for sending the second random access message based on the first information and in response to the first random access message, wherein the second random access message may be a random access response (RAR) message indicating the time period and scheduling an uplink message, wherein the time period may be used for transmission of the scheduled uplink message by the second network node, and wherein the third random access message may be the scheduled uplink message.

[0019] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, sending the second random access message may include operations, features, units, or instructions for performing the following operations: sending the second random access message based on the first information and in response to the first random access message, wherein the second random access message may be a RAR message indicating the time period and a random access preamble identifier (ID) associated with the scheduled uplink message, wherein the time period may be used for transmitting a retransmission of a random access preamble by the second network node based on the random access preamble ID being different from the ID of the second network node, and wherein the first random access message may be the random access preamble and the third random access message may be the retransmission of the random access preamble.

[0020] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, sending the second random access message may include operations, features, units, or instructions for sending the second random access message based on the first information and in response to the first random access message, wherein the second random access message may be a RAR message indicating the time period and success of the random access procedure, wherein the time period may be used for transmitting a feedback message by the second network node in response to the RAR message, and wherein the third random access message may be the feedback message.

[0021] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, sending the second random access message may include operations, features, units, or instructions for performing the following operations: sending the second random access message based on the first information and in response to the first random access message, wherein the second random access message may be a downlink contention resolution random access message indicating the time period, wherein the time period may be used for transmitting a feedback message by the second network node in response to the downlink contention resolution random access message, and wherein the third random access message may be the feedback message.

[0022] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the first random access message includes first information indicating the bandwidth capability of the second network node.

[0023] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the bandwidth capability of the second network node includes a reduced capability associated with a threshold number of PRBs processed by the second network node during a time slot.

[0024] A method for wireless communication at a first network node is described. The method may include: sending first information indicating bandwidth capabilities of the first network node; sending a first random access message; receiving a second random access message based on the first random access message and via a number of PRBs, the second random access message indicating a time period for transmission of a third random access message by the first network node in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capabilities of the first network node, and wherein the threshold time period is based on the number of PRBs; and sending the third random access message during a time window based on the time period.

[0025] A first network node for wireless communication is described. The first network node may include a memory and at least one processor coupled to the memory. The at least one processor may be configured to: send first information indicating bandwidth capabilities of the first network node; send a first random access message; receive a second random access message based on the first random access message and via a number of PRBs, the second random access message indicating a time period for transmitting a third random access message by the first network node in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capabilities of the first network node and wherein the threshold time period is based on the number of PRBs; and send the third random access message during a time window based on the time period.

[0026] Another apparatus for wireless communication at a first network node is described. The apparatus may include: means for sending first information indicating bandwidth capabilities of the first network node; means for sending a first random access message; means for receiving a second random access message based on the first random access message and via a number of PRBs, the second random access message indicating a time period for transmitting a third random access message by the first network node in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capabilities of the first network node, and wherein the threshold time period is based on the number of PRBs; and means for sending the third random access message during a time window based on the time period.

[0027] A non-transitory computer-readable medium storing code for wireless communication at a first network node is described. The code may include instructions executable by a processor to: transmit first information indicating bandwidth capabilities of the first network node; transmit a first random access message; receive a second random access message based on the first random access message and via a number of PRBs, the second random access message indicating a time period for transmission of a third random access message by the first network node in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capabilities of the first network node and wherein the threshold time period is based on the number of PRBs; and transmit the third random access message during a time window based on the time period.

[0028] Some examples of the methods, apparatus, and non-transitory computer-readable media described herein may also include operations, features, units, or instructions for determining, based on reception of the second random access message, whether the time period may be greater than the threshold time period associated with the bandwidth capabilities of the first network node, wherein transmission of the third random access message may be based on the time period being greater than the threshold time period.

[0029] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the threshold time period may be based on a first duration and an extension time, the first duration may be based on a processing time associated with the first random access message, and the extension time may be based on the number of PRBs.

[0030] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the number of PRBs of the second random access message may be within a specific PRB number range, and the extension time may be based on the specific PRB number range.

[0031] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the specific PRB number range may be from a set of multiple PRB number ranges within the system bandwidth, and each PRB number range in the set of multiple PRB number ranges corresponds to a corresponding extension time.

[0032] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, one or more ranges in the set of multiple ranges may be defined by a respective maximum number of PRBs and a respective minimum number of PRBs.

[0033] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, each PRB number range in the set of multiple PRB number ranges includes a same number of PRBs, where the same number of PRBs represents a fraction of the total number of PRBs included in the set of multiple PRB number ranges.

[0034] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the extended time may be based on a difference between the number of PRBs of the second random access message and a threshold number.

[0035] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the extension time may be constant based on the number of PRBs of the second random access message being greater than a threshold number.

[0036] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, receiving the second random access message may include operations, features, units, or instructions for performing the following operations: receiving the second random access message based on the first information and in response to the first random access message, wherein the second random access message may be a RAR message indicating the time period and scheduling an uplink message, wherein the time period may be used for transmission of the scheduled uplink message by the first network node, and wherein the third random access message may be the scheduled uplink message.

[0037] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, receiving the second random access message may include operations, features, units, or instructions for performing the following operations: receiving the second random access message based on the first information, wherein the second random access message may be a RAR message indicating the time period and a random access preamble ID associated with the scheduled uplink message, wherein the time period may be used for transmitting a random access preamble by the first network node based on the random access preamble ID being different from an ID of the first network node, and wherein the third random access message may be the random access preamble.

[0038] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, receiving the second random access message may include operations, features, units, or instructions for receiving the second random access message based on the first information and in response to the first random access message, wherein the second random access message may be a RAR message indicating the time period and success of the random access procedure, wherein the time period may be used for transmitting a feedback message by the first network node in response to the RAR message, and wherein the third random access message may be the feedback message.

[0039] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, receiving the second random access message may include operations, features, units, or instructions for performing the following operations: receiving the second random access message based on the first information and in response to the first random access message, wherein the second random access message may be a downlink contention resolution random access message indicating the time period, wherein the time period may be used for transmitting a feedback message by the first network node in response to the downlink contention resolution random access message, and wherein the third random access message may be the feedback message.

[0040] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the first random access message includes first information indicating the bandwidth capability of the first network node.

[0041] In some examples of the methods, apparatus, and non-transitory computer-readable media described herein, the bandwidth capability of the first network node includes a reduced capability associated with a threshold number of PRBs processed by the first network node during a time slot. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] Figure 1

[0014] An example of a wireless communication system supporting random access timelines for reduced capability devices in accordance with one or more aspects of the present disclosure is shown.

[0043] Figure 2

[0014] An example of a wireless communication system supporting random access timelines for reduced capability devices in accordance with one or more aspects of the present disclosure is shown.

[0044] Figure 3A and 3B

[0014] An example of a bandwidth configuration supporting a random access timeline for reduced capability devices in accordance with one or more aspects of the present disclosure is shown.

[0045] Figure 4A and 4B An example of a random access timeline supporting a random access timeline for reduced capability devices in accordance with one or more aspects of the present disclosure is shown.

[0046] Figure 5 An example of a random access timeline supporting a random access timeline for reduced capability devices in accordance with one or more aspects of the present disclosure is shown.

[0047] Figure 6 An example of a random access timeline supporting a random access timeline for reduced capability devices in accordance with one or more aspects of the present disclosure is shown.

[0048] Figure 7 An example of a random access timeline supporting a random access timeline for reduced capability devices in accordance with one or more aspects of the present disclosure is shown.

[0049] Figure 8 An example of a process flow supporting a random access timeline for reduced capability devices in accordance with one or more aspects of the present disclosure is shown.

[0050] Figure 9 and 10 A block diagram illustrating a device supporting a random access timeline for reduced capability devices in accordance with one or more aspects of the present disclosure is shown.

[0051] Figure 11 A block diagram of a communications manager supporting random access timelines for reduced capability devices is shown in accordance with one or more aspects of the present disclosure.

[0052] Figure 12 A diagram illustrating a system including a UE that supports random access timelines for reduced capability devices in accordance with one or more aspects of the present disclosure is shown.

[0053] Figure 13 A diagram illustrating a system including network entities supporting random access timelines for reduced capability devices in accordance with one or more aspects of the present disclosure is shown.

[0054] Figures 14 to 18 A flow chart illustrating a method of supporting random access timelines for reduced capability devices in accordance with one or more aspects of the present disclosure is shown. DETAILED DESCRIPTION

[0055] In some wireless communication systems, a first network node and a second network node (e.g., a user equipment (UE) and a network entity, or some other type of network node) may perform a random access procedure to establish a connection. The procedure may be a two-step or four-step random access procedure. If the first network node is a reduced-capability network node (e.g., an eRedCap UE or some other type of reduced-capability), the first network node may support communications within a given bandwidth, which may be narrower than the radio frequency (RF) bandwidth used for communications with other devices. Due to this reduced capability, the first network node may also be limited in the number of physical resource blocks (PRBs) that the first network node can process during a single timeslot. As an example, some wireless communication systems may provide that reduced-capability devices may be expected to be able to process 25 or fewer PRBs per timeslot (e.g., or some other number of PRBs, where the number of PRBs may vary based on one or more communication parameters, including the subcarrier spacing (SCS) supported by the device). If the first network node receives a downlink random access message via a number of PRBs greater than a threshold number of PRBs, the first network node may spend more time (or timeslots) processing the message. However, the downlink random access message may also indicate a duration during which the first network node is expected to respond. A first network node taking more time to process (and therefore respond to) a downlink random access message may require more time than indicated via the downlink random access message.

[0056] The techniques, systems, and devices described herein define an extended time period for a random access procedure to accommodate a network node with reduced capabilities processing a random access message sent over more PRBs than the network node is designed to process per time slot. A network node with reduced capabilities (a first network node) may indicate to a second network node that it is a network node with reduced capabilities via one or more messages. The first network node may send the first message of the random access procedure (e.g., Msg1 for a four-step random access procedure or MsgA for a two-step random access procedure) after or simultaneously with indicating the reduced capabilities. As part of the random access procedure, the second network node may respond to the initial message from the first network node and may send a random access response (RAR) message over a number of PRBs greater than a threshold number of PRBs supported by the first network node (for processing per time slot). The RAR message may indicate a time period for the first network node to process the RAR message and send a response message. The time period may be determined by the second network node. The time period may be relaxed or extended to account for the expected longer processing time of the first network node based on the indication of reduced capabilities. Therefore, the time period may be determined to be equal to or longer than a threshold time, where the threshold time includes a first duration and an extension time. The first duration may be based on a processing time associated with the first random access message. The extension time may be based on the number of PRBs used by the second network node to send the RAR message. For example, if the number of PRBs exceeds a threshold number that can be processed by the first network node for each timeslot, the extension time may be incrementally changed based on the number of PRBs or may be a constant value.

[0057] The described time period extension can be applied to multiple time periods, not just in response to a RAR message. For example, the described time period extension can be applied between the first network node receiving a RAR and sending an uplink message scheduled by the RAR (e.g., Msg3 in a four-step random access procedure), or between the first network node receiving a RAR and a retransmission of a random access preamble (e.g., Msg1) (if the RAR includes a random access preamble identifier (RAPID) that does not match the ID of the first network node), or between the first network node receiving a RAR indicating a successful two-step random access procedure and sending a feedback message, or between the first network node receiving a downlink contention resolution message (e.g., Msg4 in a four-step random access procedure) and sending the feedback message. Thus, the second network node is able to send a random access message (e.g., a RAR or a downlink contention resolution message) via the increased bandwidth, and the scheduled time window for the first network node to respond to the random access message can be extended or relaxed to provide time for the first network node to process the random access message received via the increased bandwidth.

[0058] Various aspects of the present disclosure are first described in the context of a wireless communication system. Additional aspects are described with reference to bandwidth configurations, random access timelines, and process flows. Aspects of the present disclosure are further illustrated by apparatus diagrams, system diagrams, and flow diagrams relating to random access timelines for reduced-capability devices, and are described with reference to these diagrams.

[0059] Figure 1 An example of a wireless communication system 100 that supports random access timelines for reduced-capability devices in accordance with one or more aspects of the present disclosure is shown. The wireless communication system 100 may include one or more network entities 105, one or more UEs 115, and a core network 130. In some aspects, the wireless communication system 100 may be a Long Term Evolution (LTE) network, an LTE-Advanced (LTE-A) network, an LTE-A Pro network, a New Radio (NR) network, or a network operating according to other systems and radio technologies, including future systems and radio technologies not explicitly mentioned herein.

[0060] The network entities 105 may be dispersed throughout a geographic area to form the wireless communication system 100 and may include devices of different forms or with different capabilities. In various examples, the network entities 105 may be referred to as network elements, mobility elements, radio access network (RAN) nodes, or network devices, among other terms. In some aspects, the network entities 105 and the UEs 115 may communicate wirelessly via one or more communication links 125 (e.g., radio frequency (RF) access links). For example, the network entities 105 may support a coverage area 110 (e.g., a geographic coverage area) over which the UEs 115 and the network entities 105 may establish one or more communication links 125. The coverage area 110 may be an example of a geographic area over which the network entities 105 and the UEs 115 may support transmission of signals according to one or more radio access technologies (RATs).

[0061] UEs 115 may be dispersed throughout the coverage area 110 of the wireless communication system 100, and each UE 115 may be stationary, mobile, or both at different times. UEs 115 may be devices of different forms or with different capabilities. Figure 1 Some example UEs 115 are shown in FIG. The UEs 115 described herein are capable of supporting communications with various types of devices, such as other UEs 115 or network entities 105, such as Figure 1 shown.

[0062] As described herein, a node (which may be referred to as a node, network node, network entity 105, or wireless node) may include, be, or be included in (e.g., be a component of) a base station 140 (e.g., any base station 140 described herein), a UE 115 (e.g., any UE 115 described herein), a network controller, an apparatus, a device, a computing system, an integrated access and backhaul (IAB) node, a distributed unit (DU) 160, a central unit (CU) 165, a remote / radio unit (RU) 170 (which may also be referred to as a remote radio unit (RRU)), and / or another processing entity configured to perform any of the techniques described herein. For example, the network node may be a UE 115. As another example, the network node may be a base station 140 or a network entity 105. As another example, a first network node may be configured to communicate with a second network node or a third network node. In one aspect of this example, the first network node may be a UE 115, the second network node may be a base station 140, and the third network node may be a UE 115. In another aspect of this example, the first network node may be UE 115, the second network node may be base station 140, and the third network node may be base station 140. In other aspects of this example, the first network node, the second network node, and the third network node may differ relative to these examples. Similarly, references to UE 115, base station 140, devices, equipment, computing systems, etc. may include disclosure of UE 115, base station 140, devices, equipment, computing systems, etc. as nodes. For example, a disclosure that UE 115 is configured to receive information from base station 140 also discloses that the first network node is configured to receive information from the second network node. Consistent with the present disclosure, once a specific example is broadened in accordance with the present disclosure (e.g., UE 115 is configured to receive information from base station 140 also discloses that the first network node is configured to receive information from the second network node), the broader example may be interpreted conversely with the narrower example, but in a broad, open manner. In the above example, in which UE 115 is configured to receive information from base station 140, it is also disclosed that the first network node is configured to receive information from a second network node. The first network node can refer to a first UE 115 configured to receive information, a first base station, a first apparatus, a first device, a first computing system, a first group of one or more components, a first processing entity, etc.; and the second network node can refer to a second UE 115, a second base station 140, a second apparatus, a second device, a second computing system, a second group of one or more components, a second processing entity, etc.

[0063] As described herein, the communication of information (e.g., any information, signal, etc.) can be described in various aspects using different terms. Disclosure of one communication term includes disclosure of the other communication terms. For example, a first network node may be described as being configured to send information to a second network node. In this example and consistent with the present disclosure, disclosure that the first network node is configured to send information to the second network node includes disclosure that the first network node is configured to provide, send, output, transmit, or send information to the second network node. Similarly, in this example and consistent with the present disclosure, disclosure that the first network node is configured to send information to the second network node includes disclosure that the second network node is configured to receive, obtain, or decode information provided, sent, output, transmit, or sent by the first network node.

[0064] In some aspects, the network entities 105 can communicate with the core network 130, with each other, or both. For example, the network entities 105 can communicate with the core network 130 via one or more backhaul communication links 120 (e.g., according to S1, N2, N3, or other interface protocols). In some aspects, the network entities 105 can communicate with each other via the backhaul communication links 120 (e.g., according to X2, Xn, or other interface protocols), either directly (e.g., directly between the network entities 105) or indirectly (e.g., via the core network 130). In some aspects, the network entities 105 can communicate with each other via mid-haul communication links 162 (e.g., according to a mid-haul interface protocol) or fronthaul communication links 168 (e.g., according to a fronthaul interface protocol), or any combination thereof. The backhaul communication links 120, mid-haul communication links 162, or fronthaul communication links 168 can be or include one or more wired links (e.g., electrical links, fiber optic links), one or more wireless links (e.g., radio links, wireless optical links), and other examples or various combinations thereof. UE 115 may communicate with core network 130 via communication link 155 .

[0065] One or more of the network entities 105 described herein may include or may be referred to as a base station 140 (e.g., a base transceiver station, a radio base station, an NR base station, an access point, a radio transceiver, a Node B, an evolved Node B (eNB), a next-generation Node B, or a giga-Node B (any of which may be referred to as a gNB), a 5G NB, a next-generation eNB (ng-e NB), a Home Node B, a Home evolved Node B, or other suitable terminology). In some aspects, the network entity 105 (e.g., a base station 140) may be implemented in a converged (e.g., monolithic, standalone) base station architecture, which may be configured to utilize a protocol stack that is physically or logically integrated within a single network entity 105 (e.g., a single RAN node, such as a base station 140).

[0066] In some examples, the network entity 105 can be implemented in a disaggregated architecture (e.g., a disaggregated base station architecture, a disaggregated RAN architecture) that can be configured to utilize protocol stacks that are physically or logically distributed across two or more network entities 105, such as an integrated access backhaul (IAB) network, an open RAN (O-RAN) (e.g., a network configuration sponsored by the O-RAN Alliance), or a virtualized RAN (vRAN) (e.g., a cloud RAN (C-RAN)). For example, the network entity 105 can include one or more of the following: a central unit (CU) 160, a distributed unit (DU) 165, a radio unit (RU) 170, a RAN intelligent controller (RIC) 175 (e.g., a near real-time RIC (near RT RIC), a non-real-time RIC (non-RT RIC)), a service management and orchestration (SMO) 180 system, or any combination thereof. The RU 170 can also be referred to as a radio head, an intelligent radio head, a remote radio head (RRH), a remote radio unit (RRU), or a transmit receive point (TRP). One or more components of the network entity 105 in the disaggregated RAN architecture may be co-located, or one or more components of the network entity 105 may be located in distributed locations (e.g., separate physical locations). In some aspects, one or more network entities 105 of the disaggregated RAN architecture may be implemented as virtual units (e.g., virtual CU (VCU), virtual DU (VDU), virtual RU (VRU)).

[0067] The split of functionality between the CU 160, DU 165, and RU 170 is flexible and can support different functionality depending on which functions (e.g., network layer functions, protocol layer functions, baseband functions, RF functions, and any combination thereof) are performed at the CU 160, DU 165, or RU 170. For example, a functional split of the protocol stack can be employed between the CU 160 and DU 165 such that the CU 160 can support one or more layers of the protocol stack and the DU 165 can support one or more different layers of the protocol stack. In some aspects, the CU 160 can host upper protocol layer (e.g., Layer 3 (L3), Layer 2 (L2)) functionality and signaling (e.g., Radio Resource Control (RRC), Service Data Adaptation Protocol (SDAP), Packet Data Convergence Protocol (PDCP)). The CU 160 may be connected to one or more DUs 165 or RUs 170, and the one or more DUs 165 or RUs 170 may host lower protocol layer functionality and signaling, such as Layer 1 (L1) (e.g., physical (PHY) layer) or L2 (e.g., radio link control (RLC) layer, medium access control (MAC) layer), and may each be at least partially controlled by the CU 160. Additionally or alternatively, a functional split of the protocol stack may be employed between the DU 165 and the RU 170, such that the DU 165 may support one or more layers of the protocol stack and the RU 170 may support one or more different layers of the protocol stack. The DU 165 may support one or more different cells (e.g., via one or more RUs 170). In some cases, the functional split between the CU 160 and the DU 165 or between the DU 165 and the RU 170 can be within the protocol layer (e.g., some functions of the protocol layer can be performed by one of the CU 160, DU 165, or RU 170, while other functions of the protocol layer are performed by a different one of the CU 160, DU 165, or RU 170). The CU 160 can be further functionally split into CU control plane (CU-CP) and CU user plane (CU-UP) functions. The CU 160 can be connected to one or more DUs 165 via mid-range communication links 162 (e.g., F1, F1-c, F1-u), and the DU 165 can be connected to one or more RUs 170 via front-haul communication links 168 (e.g., open front-haul (FH) interface). In some aspects, the mid-range communication link 162 or the front-haul communication link 168 may be implemented according to interfaces (eg, channels) between layers of a protocol stack supported by the respective network entity 105 that communicates via such communication links.

[0068] In a wireless communication system (e.g., wireless communication system 100), the infrastructure and spectrum resources used for wireless access can support wireless backhaul link capabilities to supplement wired backhaul connections, thereby providing an IAB network architecture (e.g., to the core network 130). In some cases, in an IAB network, one or more network entities 105 (e.g., IAB nodes 104) can be partially controlled by each other. One or more IAB nodes 104 can be referred to as a donor entity or IAB donor. One or more DUs 165 or one or more RUs 170 can be partially controlled by one or more CUs 160 associated with a donor network entity 105 (e.g., a donor base station 140). One or more donor network entities 105 (e.g., IAB donors) can communicate with one or more additional network entities 105 (e.g., IAB nodes 104) via supported access and backhaul links (e.g., backhaul communication links 120). The IAB node 104 may include an IAB mobile terminal (IAB-MT) controlled (e.g., scheduled) by the DU 165 of the coupled IAB donor. The IAB-MT may include an independent set of antennas for relaying communications with the UE 115, or may share the same antennas of the IAB node 104 (e.g., the same antennas of the RU 170) for access via the DU 165 of the IAB node 104 (e.g., referred to as a virtual IAB-MT (vIAB-MT)). In some aspects, the IAB node 104 may include a DU 165 that supports communication links with additional entities (e.g., IAB node 104, UE 115) within a relay chain or access network (e.g., downstream). In such cases, one or more components of the disaggregated RAN architecture (e.g., one or more IAB nodes 104 or components of the IAB node 104) may be configured to operate according to the techniques described herein.

[0069] For example, an access network (AN) or RAN may include communications between an access node (e.g., an IAB donor), an IAB node 104, and one or more UEs 115. The IAB donor may facilitate connectivity between the core network 130 and the AN (e.g., via a wired or wireless connection to the core network 130). In other words, the IAB donor may refer to a RAN node that has a wired or wireless connection to the core network 130. The IAB donor may include a CU 160 and at least one DU 165 (e.g., and RU 170), in which case the CU 160 may communicate with the core network 130 via an interface (e.g., a backhaul link). The IAB donor and the IAB node 104 may communicate via the F1 interface according to a protocol that defines signaling messages (e.g., the F1 AP protocol). Additionally or alternatively, the CU 160 may communicate with the core network via an interface (which may be an example of a portion of a backhaul link) and may communicate with other CUs 160 (e.g., CUs 160 associated with alternative IAB donors) via an Xn-C interface (which may be an example of a portion of a backhaul link).

[0070] An IAB node 104 may refer to a RAN node that provides IAB functionality (e.g., access for UE 115, wireless self-backhaul capabilities). A DU 165 may act as a distributed scheduling node toward child nodes associated with the IAB node 104, and an IAB-MT may act as a scheduled node toward a parent node associated with the IAB node 104. That is, an IAB donor may be referred to as a parent node that communicates with one or more child nodes (e.g., an IAB donor may relay transmissions for a UE through one or more other IAB nodes 104). Additionally or alternatively, depending on the relay chain or configuration of the AN, an IAB node 104 may also be referred to as a parent node or child node of other IAB nodes 104. Thus, an IAB-MT entity of an IAB node 104 may provide a Uu interface for child IAB nodes 104 to receive signaling from the parent IAB node 104, and a DU interface (e.g., DU 165) may provide a Uu interface for the parent IAB node 104 to send signals to child IAB nodes 104 or UE 115.

[0071] For example, IAB node 104 can be referred to as a parent node that supports communications for child IAB nodes, or as a child IAB node associated with an IAB donor, or both. The IAB donor can include a CU 160 having a wired or wireless connection to the core network 130 (e.g., backhaul communication link 120) and can act as a parent node for IAB node 104. For example, the DU 165 of the IAB donor can relay transmissions to UE 115 via IAB node 104, or can directly signal transmissions to UE 115, or both. The CU 160 of the IAB donor can signal communication link establishment to IAB node 104 via the F1 interface, and IAB node 104 can schedule transmissions (e.g., transmissions relayed from the IAB donor to UE 115) via the DU 165. That is, data can be relayed to and from IAB node 104 via signaling over the NR Uu interface of the MT to IAB node 104. Communications with the IAB node 104 may be scheduled by the DU 165 of the IAB donor, and communications with the IAB node 104 may be scheduled by the DU 165 of the IAB node 104 .

[0072] In the case of the techniques described herein applied in the context of a disaggregated RAN architecture, one or more components of the disaggregated RAN architecture may be configured to support the random access timeline for reduced-capability devices as described herein. For example, some operations described as being performed by a UE 115 or a network entity 105 (e.g., a base station 140) may additionally or alternatively be performed by one or more components of the disaggregated RAN architecture (e.g., an IAB node 104, a DU 165, a CU 160, a RU 170, a RIC 175, a SMO 180).

[0073] UE 115 may include or may be referred to as a mobile device, a wireless device, a remote device, a handheld device, or a subscriber device, or some other appropriate terminology, where a "device" may also be referred to as a unit, a station, a terminal, or a client, among other examples. UE 115 may also include or may be referred to as a personal electronic device, such as a cellular phone, a personal digital assistant (PDA), a tablet computer, a laptop computer, or a personal computer. In some aspects, UE 115 may include or be referred to as a wireless local loop (WLL) station, an Internet of Things (IoT) device, an Internet of Everything (IoE) device, or a machine type communication (MTC) device, among other examples, which may be implemented in various items such as appliances, or vehicles, meters, and other examples.

[0074] The UE 115 described herein may be able to communicate with various types of devices, such as other UEs 115, which may sometimes act as relays, as well as network entities 105 and network devices, including macro eNBs or gNBs, small cell eNBs or gNBs, or relay base stations, among other examples. Figure 1 as shown) for communication.

[0075] The UE 115 and the network entity 105 can wirelessly communicate with each other via one or more communication links 125 (e.g., access links) using resources associated with one or more carriers. The term "carrier" can refer to a collection of RF spectrum resources with a defined physical layer structure for supporting the communication link 125. For example, a carrier used for the communication link 125 can include a portion of an RF spectrum band (e.g., a bandwidth part (BWP)) that operates according to one or more physical layer channels for a given radio access technology (e.g., LTE, LTE-A, LTE-A Pro, NR). Each physical layer channel can carry acquisition signaling (e.g., synchronization signals, system information), control signaling to coordinate operations for the carrier, user data, or other signaling. The wireless communication system 100 can support communications with the UE 115 using carrier aggregation or multi-carrier operation. Depending on the carrier aggregation configuration, the UE 115 can be configured with multiple downlink component carriers and one or more uplink component carriers. Carrier aggregation can be used with both frequency division duplex (FDD) component carriers and time division duplex (TDD) component carriers. Communication between a network entity 105 and other devices may refer to communication between a device and any portion (e.g., entity, sub-entity) of the network entity 105. For example, when referring to the network entity 105, the terms "sending," "receiving," or "communicating" may refer to any portion of a network entity 105 (e.g., base station 140, CU 160, DU 165, RU 170) of the RAN communicating with another device (e.g., directly or via one or more other network entities 105).

[0076] In some aspects (e.g., in a carrier aggregation configuration), a carrier may also have acquisition signaling or control signaling to coordinate operations with respect to other carriers. A carrier may be associated with a frequency channel (e.g., an Evolved Universal Mobile Telecommunications System Terrestrial Radio Access (E-UTRA) Absolute RF Channel Number (EARFCN)) and may be identified based on a channel grid for discovery by a UE 115. A carrier may operate in a standalone mode, in which case the UE 115 may perform initial acquisition and connection via the carrier, or in a non-standalone mode, in which case a different carrier (e.g., of the same or different radio access technology) is used to anchor the connection.

[0077] The communication links 125 shown in the wireless communication system 100 may include downlink transmissions (e.g., forward link transmissions) from the network entity 105 to the UE 115, uplink transmissions (e.g., return link transmissions) from the UE 115 to the network entity 105, or both, as well as other configurations of transmissions. A carrier may carry downlink or uplink communications (e.g., in FDD mode) or may be configured to carry both downlink and uplink communications (e.g., in TDD mode).

[0078] A carrier may be associated with a particular bandwidth of the RF spectrum, and in some aspects, the carrier bandwidth may be referred to as the "system bandwidth" of the carrier or wireless communication system 100. For example, the carrier bandwidth may be one of a set of bandwidths for carriers of a particular radio access technology (e.g., 1.4, 3, 5, 10, 15, 20, 40, or 80 megahertz (MHz)). Devices of the wireless communication system 100 (e.g., the network entity 105, the UE 115, or both) may have a hardware configuration that supports communications using a particular carrier bandwidth, or may be configurable to support communications using one of the set of carrier bandwidths. In some aspects, the wireless communication system 100 may include a network entity 105 or a UE 115 that supports concurrent communications using carriers associated with multiple carrier bandwidths. In some aspects, each served UE 115 may be configured to operate using a portion (e.g., subband, BWP) or all of the carrier bandwidth.

[0079] The signal waveform transmitted via the carrier may be composed of multiple subcarriers (e.g., using multicarrier modulation (MCM) techniques such as orthogonal frequency division multiplexing (OFDM) or discrete Fourier transform spread OFDM (DFT-S-OFDM)). In a system employing MCM techniques, a resource element may refer to a resource of one symbol period (e.g., the duration of one modulation symbol) and one subcarrier, in which case the symbol period and subcarrier spacing may be inversely related. The number of bits carried by each resource element may depend on the modulation scheme (e.g., the order of the modulation scheme, the coding rate of the modulation scheme, or both), such that a relatively high number of resource elements (e.g., in the transmission duration) and a relatively high order modulation scheme may correspond to a relatively high communication rate. Wireless communication resources may refer to a combination of RF spectrum resources, time resources, and spatial resources (e.g., spatial layers, beams), and the use of multiple spatial resources may increase the data rate or data integrity used for communication with UE 115.

[0080] One or more numerologies for a carrier may be supported, and the numerology may include a subcarrier spacing (Δf) and a cyclic prefix. A carrier may be divided into one or more BWPs having the same or different numerologies. In some aspects, a UE 115 may be configured with multiple BWPs. In some aspects, a single BWP for a carrier may be active at a given time, and communications for the UE 115 may be limited to the one or more active BWPs.

[0081] The basic time unit (which may be referred to as T s =1 / (Δf max ·N f ) seconds sampling period (where Δf max It can indicate the supported subcarrier spacing, and N f The time interval for the network entity 105 or the UE 115 may be expressed as a multiple of a supported discrete Fourier transform (DFT) size. The time intervals of the communication resources may be organized according to radio frames, each having a specified duration (e.g., 10 milliseconds (ms)). Each radio frame may be identified by a system frame number (SFN) (e.g., ranging from 0 to 1023).

[0082] Each frame may include a plurality of consecutively numbered subframes or time slots, and each subframe or time slot may have the same duration. In some aspects, a frame may be divided (e.g., in the time domain) into subframes, and each subframe may be further divided into a number of time slots. Alternatively, each frame may include a variable number of time slots, and the number of time slots may depend on the subcarrier spacing. Each time slot may include a number of symbol periods (e.g., depending on the length of a cyclic prefix added in front of each symbol period). In some wireless communication systems 100, a time slot may be further divided into a plurality of mini-slots associated with one or more symbols. Excluding the cyclic prefix, each symbol period may be associated with one or more (e.g., N) symbol periods. f The duration of a symbol period may depend on the subcarrier spacing or the operating frequency band.

[0083] A subframe, slot, mini-slot, or symbol may be the smallest scheduling unit (e.g., in the time domain) of the wireless communication system 100 and may be referred to as a transmission time interval (TTI). In some aspects, the TTI duration (e.g., the number of symbol periods in a TTI) may be variable. Additionally or alternatively, the smallest scheduling unit of the wireless communication system 100 may be dynamically selected (e.g., in the form of bursts of shortened TTIs (sTTIs)).

[0084] Physical channels may be multiplexed for communication using a carrier according to various techniques. For example, physical control channels and physical data channels may be multiplexed using one or more of time division multiplexing (TDM), frequency division multiplexing (FDM), or hybrid TDM-FDM techniques for signaling via a downlink carrier. A control region (e.g., a control resource set (CORESET)) for a physical control channel may be defined by a set of symbol periods and may extend across the system bandwidth of a carrier or a subset of the system bandwidth. One or more control regions (e.g., CORESETs) may be configured for a group of UEs 115. For example, one or more of the UEs 115 may monitor or search the control region for control information according to one or more search space sets, and each search space set may include one or more control channel candidates at one or more aggregation levels arranged in a cascaded manner. The aggregation level for the control channel candidates may refer to the number of control channel resources (e.g., control channel elements (CCEs)) associated with the coded information for a control information format having a given payload size. The search space sets may include a common search space set configured for transmitting control information to multiple UEs 115 and a UE-specific search space set for transmitting control information to a specific UE 115 .

[0085] The network entity 105 may provide communication coverage via one or more cells (e.g., macro cells, small cells, hotspots, or other types of cells, or any combination thereof). The term "cell" may refer to a logical communication entity used to communicate with the network entity 105 (e.g., using a carrier) and may be associated with an identifier (e.g., a physical cell identifier (PCID), a virtual cell identifier (VCID), or other identifier) ​​used to distinguish between adjacent cells. In some aspects, a cell may also refer to a coverage area 110 or a portion of a coverage area 110 (e.g., a sector) on which a logical communication entity operates. Depending on various factors (such as the capabilities of the network entity 105), such a cell may range from a smaller area (e.g., a structure, a subset of a structure) to a larger area. For example, a cell may be or include a building, a subset of a building, or an external space between or overlapping coverage areas 110, as well as other examples.

[0086] A macro cell typically covers a relatively large geographic area (e.g., a radius of several kilometers) and may allow unrestricted access by UEs 115 that have a service subscription with a network provider that supports the macro cell. Small cells may be associated with a lower-power network entity 105 (e.g., a lower-power base station 140) than a macro cell, and may operate using the same or different (e.g., licensed, unlicensed) frequency band as the macro cell. Small cells may provide unrestricted access to UEs 115 that have a service subscription with the network provider, or may provide restricted access to UEs 115 associated with the small cell (e.g., UEs 115 in a closed subscriber group (CSG), UEs 115 associated with users in a residence or office). A network entity 105 may support one or more cells and may also support communication via one or more cells using one or more component carriers.

[0087] In some aspects, a carrier may support multiple cells, and different cells may be configured according to different protocol types (e.g., MTC, narrowband IoT (NB-IoT), enhanced mobile broadband (eMBB)) that may provide access to different types of devices.

[0088] In some aspects, the network entities 105 (e.g., base stations 140, RUs 170) can be mobile and, therefore, provide communication coverage for mobile coverage areas 110. In some aspects, different coverage areas 110 associated with different technologies can overlap, but the different coverage areas 110 can be supported by the same network entity 105. In some other examples, overlapping coverage areas 110 associated with different technologies can be supported by different network entities 105. The wireless communication system 100 can include, for example, a heterogeneous network in which different types of network entities 105 use the same or different radio access technologies to provide coverage for respective coverage areas 110.

[0089] The wireless communication system 100 may support synchronous or asynchronous operation. For synchronous operation, the network entities 105 (e.g., base stations 140) may have similar frame timing, and transmissions from different network entities 105 may be approximately aligned in time. For asynchronous operation, the network entities 105 may have different frame timing, and in some aspects, transmissions from different network entities 105 may not be aligned in time. The techniques described herein may be used for either synchronous or asynchronous operation.

[0090] Some UEs 115 (e.g., MTC or IoT devices) may be low-cost or low-complexity devices and may provide automated communication between machines (e.g., via machine-to-machine (M2M) communication). M2M communication or MTC may refer to data communication technologies that allow devices to communicate with each other or a network entity 105 (e.g., a base station 140) without human intervention. In some aspects, M2M communication or MTC may include communications from devices that incorporate sensors or meters to measure or capture information and relay such information to a central server or application that utilizes the information or presents it to a human interacting with the application. Some UEs 115 may be designed to collect information or implement automated behavior of machines or other equipment. Examples of applications for MTC devices include smart metering, inventory monitoring, water level monitoring, equipment monitoring, healthcare monitoring, wildlife monitoring, climate and geological event monitoring, fleet management and tracking, remote security sensing, physical access control, and transaction-based service billing.

[0091] Some UEs 115 may be configured to employ a mode of operation that reduces power consumption, such as half-duplex communication (e.g., a mode that supports unidirectional communication via transmission or reception rather than concurrent transmission and reception). In some aspects, half-duplex communication may be performed at a reduced peak rate. Other power conservation techniques for the UE 115 include entering a power-saving deep sleep mode when not participating in active communications, when operating using limited bandwidth (e.g., according to narrowband communication), or a combination of these techniques. For example, some UEs 115 may be configured to operate using a narrowband protocol type that is associated with a defined portion or range (e.g., a set of subcarriers or resource blocks (RBs)) within a carrier, within a guard band of a carrier, or outside of a carrier.

[0092] The wireless communication system 100 can be configured to support ultra-reliable communication or low-latency communication, or various combinations thereof. For example, the wireless communication system 100 can be configured to support ultra-reliable low-latency communication (URLLC). The UE 115 can be designed to support ultra-reliable, low-latency or critical functions. Ultra-reliable communication can include private communication or group communication and can be supported by one or more services (such as push-to-talk, video or data). Support for ultra-reliable, low-latency functions can include prioritization of services, and such services can be used for public safety or general commercial applications. The terms ultra-reliable, low-latency and ultra-reliable low-latency can be used interchangeably in this article.

[0093] In some aspects, a UE 115 may be configured to support direct communications with other UEs 115 via a device-to-device (D2D) communication link 135 (e.g., according to a peer-to-peer (P2P), D2D, or sidelink protocol). In some aspects, one or more UEs 115 of a group performing D2D communications may be within a coverage area 110 of a network entity 105 (e.g., a base station 140, a RU 170), which may support various aspects of such D2D communications as configured by the network entity 105 (e.g., scheduled by the network entity 105). In some aspects, one or more UEs 115 in such a group may be outside of the coverage area 110 of the network entity 105 or may otherwise be unable or not configured to receive transmissions from the network entity 105. In some aspects, groups of UEs 115 communicating via D2D communication may support a one-to-many (1:M) system, where each UE 115 transmits to each of the other UEs 115 in the group. In some aspects, the network entity 105 may facilitate scheduling of resources for the D2D communication. In some other examples, the D2D communication may be performed between the UEs 115 without involving the network entity 105.

[0094] In some systems, the D2D communication link 135 can be an example of a communication channel (such as a sidelink communication channel) between vehicles (e.g., UE 115). In some aspects, vehicles can communicate using vehicle-to-everything (V2X) communication, vehicle-to-vehicle (V2V) communication, or some combination thereof. Vehicles can signal information related to traffic conditions, signal scheduling, weather, safety, emergency situations, or any other information related to the V2X system. In some aspects, vehicles in a V2X system can communicate with roadside infrastructure (such as roadside units) or communicate with a network via one or more network nodes (e.g., network entity 105, base station 140, RU 170) using vehicle-to-network (V2N) communication, or both.

[0095] The core network 130 may provide user authentication, access authorization, tracking, Internet Protocol (IP) connectivity, and other access, routing, or mobility functions. The core network 130 may be an evolved packet core (EPC) or a 5G core (5GC), which may include at least one control plane entity (e.g., a mobility management entity (MME), an access and mobility management function (AMF)) that manages access and mobility, and at least one user plane entity (e.g., a serving gateway (S-GW), a packet data network (PDN) gateway (P-GW), or a user plane function (UPF)) that routes packets to or interconnects with an external network. The control plane entity may manage non-access stratum (NAS) functions, such as mobility, authentication, and bearer management for UEs 115 served by network entities 105 (e.g., base stations 140) associated with the core network 130. User IP packets may be transmitted through the user plane entity, which may provide IP address allocation and other functions. The user plane entity may be connected to an IP service 150 for one or more network operators. IP services 150 may include access to the Internet, an intranet, an IP Multimedia Subsystem (IMS), or packet-switched streaming services.

[0096] The wireless communication system 100 can operate using one or more frequency bands, which can be in the range of 300 MHz to 300 gigahertz (GHz). Typically, the region from 300 MHz to 3 GHz is referred to as the ultra-high frequency (UHF) region or decimeter band because the wavelengths range from approximately one decimeter to one meter in length. UHF waves can be blocked or redirected by buildings and environmental features (which can be referred to as clusters), but the waves can penetrate structures sufficiently for macro cells to provide service to UEs 115 located indoors. Communication using UHF waves can be associated with smaller antennas and shorter distances (e.g., less than 100 kilometers) compared to communication using the smaller frequencies and longer waves of the high frequency (HF) or very high frequency (VHF) portions of the spectrum below 300 MHz.

[0097] The wireless communication system 100 may also operate using a super high frequency (SHF) region that may be in the range of 3 GHz to 30 GHz (also referred to as the centimeter band) or an extremely high frequency (EHF) region (e.g., from 30 GHz to 300 GHz) (also referred to as the millimeter band) using a spectrum. In some aspects, the wireless communication system 100 may support millimeter wave (mmW) communications between the UE 115 and a network entity (e.g., a base station 140, a RU 170), and the EHF antennas of the corresponding devices may be smaller and more closely spaced than UHF antennas. In some aspects, such technology may facilitate the use of antenna arrays within the device. However, the propagation of EHF transmissions may suffer from even greater attenuation and shorter distances than SHF or UHF transmissions. The technology disclosed herein may be employed across transmissions using one or more different frequency regions, and the designated use of frequency bands across these frequency regions may differ depending on the country or regulatory agency.

[0098] The wireless communication system 100 can utilize both licensed and unlicensed RF spectrum bands. For example, the wireless communication system 100 can employ license assisted access (LAA), LTE unlicensed (LTE-U) radio access technology, or NR technology using an unlicensed band (such as the 5 GHz industrial, scientific, and medical (ISM) band). When operating using an unlicensed RF spectrum band, devices (such as the network entity 105 and the UE 115) can employ carrier sensing for conflict detection and avoidance. In some aspects, operations using the unlicensed band can be based on a carrier aggregation configuration of component carriers in combination with operations using a licensed band (e.g., LAA). Operations using the unlicensed spectrum can include downlink transmissions, uplink transmissions, P2P transmissions, or D2D transmissions, among other examples.

[0099] A network entity 105 (e.g., a base station 140, a RU 170) or a UE 115 may be equipped with multiple antennas that may be used to employ techniques such as transmit diversity, receive diversity, multiple-input multiple-output (MIMO) communications, or beamforming. The antennas of the network entity 105 or the UE 115 may be located within one or more antenna arrays or antenna panels that may support MIMO operations or transmit or receive beamforming. For example, one or more base station antennas or antenna arrays may be co-located at an antenna assembly (e.g., an antenna tower). In some aspects, the antennas or antenna arrays associated with the network entity 105 may be located at different geographical locations. The network entity 105 may include an antenna array having a set of rows and columns of antenna ports that the network entity 105 may use to support beamforming for communications with the UE 115. Similarly, the UE 115 may include one or more antenna arrays that may support various MIMO or beamforming operations. Additionally or alternatively, the antenna panels may support RF beamforming for signals transmitted via the antenna ports.

[0100] The network entity 105 or UE 115 can use MIMO communication to take advantage of multipath signal propagation and improve spectral efficiency by sending or receiving multiple signals via different spatial layers. Such techniques may be referred to as spatial multiplexing. For example, a transmitting device may send multiple signals via different antennas or different combinations of antennas. Similarly, a receiving device may receive multiple signals via different antennas or different combinations of antennas. Each of the multiple signals may be referred to as a separate spatial stream and may carry information associated with the same data stream (e.g., the same codeword) or different data streams (e.g., different codewords). Different spatial layers may be associated with different antenna ports for channel measurement and reporting. MIMO techniques include single-user MIMO (SU-MIMO) (where multiple spatial layers are sent to the same receiving device) and multi-user MIMO (MU-MIMO) (where multiple spatial layers are sent to multiple devices).

[0101] Beamforming (which may also be referred to as spatial filtering, directional transmission, or directional reception) is a signal processing technique that can be used at a transmitting device or a receiving device (e.g., a network entity 105, a UE 115) to form or steer an antenna beam (e.g., a transmit beam, a receive beam) along a spatial path between the transmitting device and the receiving device. Beamforming can be achieved by combining signals transmitted via antenna elements of an antenna array so that some signals propagating along a particular orientation relative to the antenna array experience constructive interference, while other signals experience destructive interference. Adjustments to signals transmitted via antenna elements can include the transmitting device or the receiving device applying an amplitude offset, a phase offset, or both to the signals carried by the antenna elements associated with the device. Adjustments associated with each of the antenna elements can be defined by a set of beamforming weights associated with a particular orientation (e.g., relative to the antenna array of the transmitting device or the receiving device, or relative to some other orientation).

[0102] The network entity 105 or the UE 115 may use beam scanning techniques as part of a beamforming operation. For example, the network entity 105 (e.g., base station 140, RU 170) may use multiple antennas or antenna arrays (e.g., antenna panels) to perform beamforming operations for directional communication with the UE 115. The network entity 105 may transmit some signals (e.g., synchronization signals, reference signals, beam selection signals, or other control signals) multiple times along different directions. For example, the network entity 105 may transmit signals according to different sets of beamforming weights associated with different transmission directions. The transmissions along different beam directions may be used (e.g., by a transmitting device (such as the network entity 105) or by a receiving device (such as the UE 115)) to identify a beam direction for subsequent transmission or reception by the network entity 105.

[0103] A transmitting device (e.g., transmitting network entity 105, transmitting UE 115) may transmit some signals (e.g., data signals associated with a particular receiving device (e.g., receiving network entity 105 or receiving UE 115)) along a single beam direction (e.g., a direction associated with the receiving device). In some aspects, the beam direction associated with the transmission along the single beam direction may be determined based on signals transmitted along one or more beam directions. For example, UE 115 may receive one or more of the signals transmitted along different directions by network entity 105 and may report to network entity 105 an indication of the signal received by UE 115 having the highest signal quality or otherwise acceptable signal quality.

[0104] In some aspects, transmissions by a device (e.g., by the network entity 105 or the UE 115) may be performed using multiple beam directions, and the device may use a combination of digital precoding or beamforming to generate a combined beam for transmission (e.g., from the network entity 105 to the UE 115). The UE 115 may report feedback indicating precoding weights used for one or more beam directions, and the feedback may correspond to a configured set of beams across the system bandwidth or one or more subbands. The network entity 105 may send reference signals (e.g., cell-specific reference signals (CRS), channel state information reference signals (CSI-RS)) that may be precoded or not precoded. The UE 115 may provide feedback for beam selection, which may be a precoding matrix indicator (PMI) or codebook-based feedback (e.g., a multi-panel type codebook, a linear combination type codebook, a port selection type codebook). Although these techniques are described with reference to signals sent along one or more directions by a network entity 105 (e.g., base station 140, RU 170), UE 115 may employ similar techniques for sending signals multiple times along different directions (e.g., for identifying a beam direction for subsequent transmission or reception by UE 115) or for sending signals along a single direction (e.g., for sending data to a receiving device).

[0105] When receiving various signals (such as synchronization signals, reference signals, beam selection signals, or other control signals) from a receiving device (e.g., network entity 105), the receiving device (e.g., UE 115) can perform reception operations according to multiple reception configurations (e.g., directional listening). For example, the receiving device can perform reception according to multiple reception directions by receiving via different antenna subarrays, by processing received signals according to different antenna subarrays, by receiving according to different sets of receive beamforming weights applied to signals received at multiple antenna elements of an antenna array (e.g., different sets of directional listening weights), or by processing received signals according to different sets of receive beamforming weights applied to signals received at multiple antenna elements of an antenna array (any of the above operations may be referred to as "listening" according to different reception configurations or reception directions). In some aspects, the receiving device can receive along a single beam direction using a single reception configuration (e.g., when receiving data signals). A single receive configuration may be aligned along a beam direction determined based on listening according to different receive configuration directions (e.g., a beam direction determined to have the highest signal strength, highest signal-to-noise ratio (SNR), or otherwise acceptable signal quality based on listening according to multiple beam directions).

[0106] The wireless communication system 100 can be a packet-based network that operates according to a layered protocol stack. In the user plane, communications at the bearer or PDCP layer can be IP-based. The RLC layer can perform packet segmentation and reassembly for transmission via logical channels. The MAC layer can perform priority handling and multiplexing of logical channels to transport channels. The MAC layer can also implement error detection technology, error correction technology, or both to support retransmission to improve link efficiency. In the control plane, the RRC layer can provide the establishment, configuration, and maintenance of an RRC connection (which supports radio bearers for user plane data) between the UE 115 and the network entity 105 or the core network 130. The PHY layer can map transport channels to physical channels.

[0107] UE 115 and network entity 105 can support retransmission of data to increase the likelihood that the data is successfully received. Hybrid automatic repeat request (HARQ) feedback is a technology for increasing the likelihood of correctly receiving data via a communication link (e.g., communication link 125, D2D communication link 135). HARQ can include a combination of error detection (e.g., using a cyclic redundancy check (CRC)), forward error correction (FEC), and retransmission (e.g., automatic repeat request (ARQ)). HARQ can improve the throughput at the MAC layer under poor radio conditions (e.g., low signal and noise conditions). In some aspects, a device can support same-slot HARQ feedback, in which case the device can provide HARQ feedback for data received via the previous symbol in a specific time slot in the time slot. In some other aspects, the device can provide HARQ feedback in subsequent time slots or according to some other time interval.

[0108] Some devices in the wireless communication system 100 may be reduced-capability devices. Such devices may be associated with various capabilities that are different (e.g., less than) the capabilities of other devices in the wireless communication system 100 to support low-latency and low-complexity use cases (e.g., low-level IoT use cases or other use cases). Reduced-capability devices may be designed to minimize device complexity and reduce device cost by relaxing peak throughput, latency, and reliability requirements, among other examples. Some reduced-capability devices may support reduced bandwidth capabilities, where the bandwidth supported by the reduced-capability devices may be reduced from a baseline system or RF bandwidth. As an example, some UEs 115 may support a first bandwidth (e.g., a 100 MHz bandwidth or system bandwidth), a first level or group of reduced capability UEs 115 (RedCap UEs 115) may support a second bandwidth that is smaller than the first bandwidth (e.g., a 20 MHz BW or some other reduced bandwidth), and a second level or group of reduced capability UEs 115 (e.g., eRedCap UEs 115) may support a third bandwidth that is smaller than the first bandwidth and the second bandwidth (e.g., baseband bandwidth complexity may be reduced by limiting the number of PRBs that the second level or group of reduced capability UEs 115 may process per timeslot).

[0109] A first network node and a second network node in wireless communication system 100 (e.g., UE 115 and network entity 105, or some other type of network node) may perform a random access procedure to establish a connection. This procedure may be a two-step or four-step random access procedure. If the first network node is a reduced-capability network node (e.g., an eRedCap UE 115 or some other type of reduced-capability), the first network node may support communications within a given bandwidth, which may be narrower than the RF bandwidth used to communicate with other devices in the wireless communication system. Due to this reduced capability, the first network node may also be able to process no more than a threshold number of PRBs during a single timeslot. If the first network node receives a downlink random access message via a number of PRBs greater than the threshold number of PRBs, the first network node may spend more time (or timeslots) processing the message. However, the downlink random access message may also indicate a duration during which the first network node is expected to respond. A first network node that takes more time to process (and therefore respond to) the downlink random access message may need more time than indicated by the downlink random access message.

[0110] The techniques, systems, and devices described herein define an extended time period for a random access procedure to accommodate a network node with reduced capabilities processing a random access message sent via more PRBs than the network node with reduced capabilities is designed to process per time slot. A network node with reduced capabilities (a first network node) may send first information indicating the bandwidth capabilities of the first network node to a second network node. For example, the first information may indicate a threshold number of PRBs that the first network node can process per time slot. The first network node may send a first random access message (e.g., MsgA, Msg1, or Msg3) to the second network node. The second network node may respond to the first random access message and send a second random access message (e.g., MsgB, Msg2, or Msg4) via the number of PRBs. The second random access message may indicate a time period for the first network node to transmit a third random access message (e.g., Msg3, a preamble retransmission, or a feedback message) in response to the second random access message. The time period may be based on (e.g., greater than or equal to) a threshold time period associated with the bandwidth capability of the first network node, and the threshold time period may be based on the number of PRBs over which the second random access message is sent. The first network node may send the third random access message based on the time period. Thus, the time period may accommodate the first network node processing the second random access message received over the number of PRBs.

[0111] Figure 2 An example of a wireless communication system 200 supporting random access timelines for devices with reduced capabilities according to one or more aspects of the present disclosure is shown. The wireless communication system 200 may be implemented as described with reference to Figure 1 For example, the wireless communication system 200 may include network nodes 205 and 215, which may be represented as shown in FIG. Figure 1 1. The network node 205 and the network node 215 may each represent an example of a UE 115, a network entity 105, a base station, an IAB node, or some other device. The network node 205 may be within the geographic coverage area 210 and communicate with the network node 215 via a downlink communication link 220-a and an uplink communication link 220-b. The network node 205 and the network node 215 may support an extended time period for the random access procedure to accommodate the network node 215 (e.g., a network node 215 with reduced capabilities) processing random access messages sent via more PRBs than the network node 215 is designed to process for each time slot.

[0112] In some aspects, the bandwidth capability 230 of the network node 215 can be associated with reduced capabilities. For example, based on the bandwidth capability 230, the network node 215 can support communications received via a bandwidth that does not exceed a threshold. That is, to reduce complexity and cost, the number of PRBs that the network node 215 can process for each time slot (or other time period) can be less than a threshold number, which can be referred to as baseband complexity reduction, as described in reference to FIG. Figure 1 In some aspects, the threshold number of PRBs that the network node 215 can process per timeslot can be applied to a subset of communication types (e.g., unicast communications), as described in further detail elsewhere herein, including with reference to FIG. 3 . The network node 215 can send first information 235 to the network node 205 via the uplink communication link 220-b to indicate the bandwidth capabilities 230 of the network node 215. In some aspects, the first information 235 can be sent via a random access message or some other type of uplink message or signaling.

[0113] The network node 215 may send a first random access message 240 to the network node 205 via the uplink communication link 220-b after or simultaneously with sending the first information 235. For example, in some aspects, the first random access message 240 may convey the first information 235. The first random access message 240 may be sent as part of a random access procedure between the network node 205 and the network node 215. The random access procedure may be a two-step or four-step random access procedure. The first random access message 240 may be, for example, a random access preamble (e.g., MsgA in a two-step random access procedure or Msg1 in a four-step random access procedure), an uplink message (e.g., Msg3 in a four-step random access procedure), or some other type of random access message.

[0114] The network node 205 may receive the first information 235 and the first random access message 240 and may send a second random access message 245 via the downlink communication link 220-a in response to the first random access message 240. The second random access message 245 may be, for example, a RAR (e.g., MsgB in a two-step random access procedure or Msg2 in a four-step random access procedure), a downlink contention resolution message (e.g., Msg4 in a four-step random access procedure), or some other type of random access message. The second random access message 245 may indicate a time period 225 associated with sending a third random access message 250 by the network node 215 in response to the second random access message 245. In some cases, the time period 225 may be based on a first duration associated with processing and uplink preparation performed by the network node 215, as described in further detail elsewhere herein, including with reference to Figure 4A .

[0115] The wireless communication system 200 may allow the network node 205 to send the second random access message 245 to the network node 215 via a number of PRBs greater than a threshold number of PRBs associated with the bandwidth capability 230 of the network node 215. In some cases, if the network node 205 sends the second random access message 245 via a number of PRBs greater than the threshold number, and the second random access message 245 indicates a time period 225 based on the first duration, the network node 215 may not be able to process the second random access message 245 during the time period 225. As a result, the network node 215 may not be able to send the third random access message 250 at the scheduled time, which may reduce throughput and increase latency of the random access procedure.

[0116] The techniques, systems, and devices described herein define an extended time period 225 that accounts for additional processing time at the network node 215 based on the bandwidth capability 230 and the number of PRBs over which the second random access message 245 is sent and received. For example, the described techniques define a threshold time period associated with the bandwidth capability 230 (e.g., for a device with reduced capabilities). The threshold time period can be based on a first duration associated with processing and / or uplink preparation performed by the network node 215 and an extended time. The extended time can be based on the number of PRBs allocated for the second random access message 245. For example, if the number of PRBs exceeds a threshold number supported by the network node 215 with reduced capabilities, the extended time can be a constant time period, or the extended time can be based on the difference between the number of PRBs and the threshold number, as described in further detail elsewhere herein, including with reference to Figures 4-7.

[0117] The network node 205, the network node 215, or both may determine (e.g., estimate or calculate) a threshold time period corresponding to the bandwidth capabilities 230 of the network node 215. In some aspects, the rules or procedures for defining or calculating the threshold time period may be configured (e.g., pre-configured or defined in a standard), or may be indicated via signaling exchanged between the network node 205 and the network node 215, or both. After receiving the first information 235 indicating the bandwidth capabilities 230 of the network node 215 and the first random access message 240, the network node 205 may determine, based on the threshold time period, a time period 225 to indicate via the second random access message 245. For example, the network node 205 may determine a time period 225 that is greater than or equal to the threshold time period so that the network node 215 may have sufficient time to receive and respond to the second random access message 245.

[0118] In some aspects, the network node 215 may receive a second random access message 245 indicating a time period 225, and the network node 215 may verify the time period 225 before responding. For example, the network node 215 may determine whether the time period 225 is greater than a threshold time period associated with the bandwidth capability 230. If the time period 225 is not greater than the threshold time period, the network node 215 may refrain from sending the third random access message 250. If the time period 225 is greater than or equal to the threshold time period, the network node 215 may send the third random access message 250 within a time window based on the time period 225.

[0119] Therefore, a threshold time period can be defined for a network node with reduced capabilities, and the threshold time period can be based on the bandwidth over which the random access message is received. By taking into account the bandwidth (number of PRBs) over which the random access message is received, the threshold time period can be extended if the number of PRBs increases, and can be reduced if the number of PRBs decreases (e.g., below a threshold number of PRBs associated with the bandwidth capability 230). The network node 205 can determine the time period 225 between the reception of the second random access message 245 and the transmission of the responsive random access message based on the threshold time period, which can provide the network node with reduced capabilities with the ability to accurately process and respond to the second random access message 245 regardless of the number of PRBs over which the second random access message 245 is transmitted.

[0120] Figure 3A and 3B 1 shows examples of bandwidth configurations 300-a and 300-b supporting random access timelines for devices with reduced capabilities according to one or more aspects of the present disclosure. Figure 1 and 2 As described, bandwidth configurations 300-a and 300-b may implement or be implemented by aspects of wireless communication systems 100 and 200. For example, bandwidth configurations 300-a and 300-b illustrate resources in the frequency domain that may be allocated for communication by a network node, which may be represented as shown in FIG. Figure 1 and 2 An example of a network node with reduced capabilities is described.

[0121] Figure 3AA first bandwidth configuration 300-a is shown for unicast communications (e.g., unicast PDSCH) at a network node with reduced capabilities. Bandwidth configuration 300-a includes a system bandwidth 305, which can represent a range of frequency resources allocated for wireless communications by devices in a wireless communication system. RF bandwidth 310 can represent a portion of system bandwidth 305 that includes frequency resources allocated for data transmission and reception by network nodes that do not have the capabilities of a network node with reduced capabilities as described herein. For example, one or more non-reduced capability network nodes can monitor, receive, and process downlink transmissions via RF bandwidth 310 (e.g., a 20 MHz bandwidth or some other bandwidth).

[0122] As reference Figure 1 and Figure 2 As described, to reduce complexity and cost, a reduced-capability network node may support a reduced or restricted bandwidth, which may correspond to a threshold number of PRBs 315 allocated for data reception at the network node. The network node may be capable of processing no more than the threshold number of PRBs 315 per time slot. Figure 3A In the example of FIG, the threshold number of PRBs 315 may include PRBs 315-a, 315-b, 315-c, and 315-d. In some aspects, the threshold number of PRBs 315 may be based on the SCS of the communication (e.g., the threshold number may be 25 PRBs 315 for a 15 kilohertz (kHz) SCS and 11 or 12 PRBs 315 for a 30 kHz SCS, or some other threshold number).

[0123] In this way, unicast data transmission to a reduced-capability network node can be scheduled within a number of PRBs 315 of RF bandwidth 310 that is the same as or less than a threshold number. It can be assumed that if intra-slot frequency hopping is enabled, the reduced-capability network node (e.g., an eRedCap UE or some other type of device) can process up to the threshold number of PRBs 315 per slot or per hop baseband. In some cases, unicast transmission via a number of PRBs 315 greater than the threshold number may not be supported by the reduced-capability network node.

[0124] Figure 3B A second bandwidth configuration 300-b is shown for broadcast communications (e.g., broadcast PDSCH) at a network node with reduced capability. The bandwidth configuration 300-b includes a system bandwidth 305 and an RF bandwidth 310, which may represent a reference bandwidth. Figure 3A Examples of system bandwidth 305 and RF bandwidth 310 are depicted.

[0125] In some aspects, a broadcast channel can be shared by multiple wireless devices, including network nodes that support the RF bandwidth 310 and reduced-capability network nodes that can process no more than a threshold number of PRBs 315 per time slot. The broadcast channel can include a downlink channel (e.g., a physical downlink shared channel (PDSCH)) for system information blocks (SIBs) (such as SIB1), other system information (OSI), paging, and RAR, among other examples. Due to shared usage between different types of devices, the broadcast channel can be transmitted without limiting the number of PRBs. In this way, reduced-capability network nodes can be scheduled within the RF bandwidth 310 for broadcast communications without limiting or reducing the number of PRBs 315. For example, the data bandwidth 320 over which the reduced-capability network nodes can receive broadcast communications can be the same as the RF bandwidth 310 (e.g., a 20 MHz bandwidth or some other bandwidth).

[0126] Thus, other network nodes can schedule broadcast communications via any number of PRBs 315 within data bandwidth 320. If broadcast communications are scheduled with a number of PRBs 315 greater than a threshold number of PRBs 315, network nodes with reduced capabilities may process the broadcast communications over a longer period of time compared to unicast communications. However, the timeline for processing and responding to broadcast communications may be more flexible than the corresponding timeline for unicast communications. Thus, the extended processing time may not impact broadcast communications, which is why increased data bandwidth 320 may be permitted.

[0127] In some aspects described herein, a random access message sent to a network node with reduced capability may be scheduled via a number of PRBs 315 greater than a threshold number of PRBs 315 that the network node can process per time slot (e.g., the random access message may be scheduled via any number of PRBs 315 in the data bandwidth 320). An extended time period for transmission of response messages by the network node with reduced capability may be defined to support such random access messages scheduled via increased bandwidth. Techniques for defining extended time periods and different applicable random access timelines are described in further detail elsewhere herein, including with reference to Figures 4-8.

[0128] Figure 4A and 4BExamples of random access timelines 400-a and 400-b supporting random access timelines for reduced-capability devices according to one or more aspects of the present disclosure are shown. The random access timelines 400-a and 400-b may implement or be implemented by aspects of the wireless communication systems 100 and 200. For example, the random access timelines 400-a and 400-b illustrate timelines for transmitting a RAR 420 by a network node 405, receiving and processing the RAR 420 by a network node 415, and transmitting an uplink message 430 by the network node 415 in response to the RAR 420. The network nodes 405 and 415 may represent timelines as described with reference to FIG. Figure 1 In some aspects, the number of PRBs over which the RAR 420 is scheduled may vary, which may or may not affect the processing of the RAR 420 at the network node 415.

[0129] Figure 4A A first random access timeline 400-a is shown. In some aspects, the first random access timeline 400-a can be associated with a four-step random access procedure. Figure 4A 4. Not shown, but the network node 415-a may send a first random access message to the network node 405-a at a time prior to sending the RAR 420-a. The first random access message may be, for example, a random access preamble (e.g., Msg1) or some other type of random access message and may represent a reference Figure 2 2. The example of the first random access message 240 described above. The network node 405-b may receive the first random access message and may send a RAR 420-a (e.g., Msg2) in response to the first random access message. In some aspects, the RAR 420-a may be a fallback RAR 420-a. For example, if the network node 415-a initiates a two-step random access procedure, the network node 405-a may send the fallback RAR 420-a to change the random access procedure from the two-step procedure to the four-step procedure.

[0130] In this example, the network node 415 - a may support non-reduced bandwidth capabilities. That is, the network node 415 - a may be able to receive and process unicast and broadcast communications within any number of PRBs of the system bandwidth, as described with reference to FIG. 3 .

[0131] RAR 420-a may schedule an uplink message 430-a (e.g., Msg3) and may indicate a time period 425 for network node 415-a to transmit uplink message 430-a in response to RAR 420-a. If network node 415-a supports non-reduced bandwidth capabilities, time period 425 indicated via RAR 420-a may be based on (e.g., not less than) a first duration associated with RAR 420-a. The first duration may include a first processing time N for network node 415-a. T,1 , uplink preparation time N for network node 415-a T,2 The time period 425T may be greater than or equal to the first time duration, as shown in Equation 1.

[0132] T≥N T,1 +N T,2 +0.5ms (1)

[0133] N T,1 The duration (in ms) of a number of symbols (eg, N1 symbols) corresponding to the PDSCH processing time for a given device processing capability (eg, UE processing capability 1) may be represented, and N T,2 The duration (in ms) of a number of symbols (eg, N2 symbols) corresponding to the physical uplink shared channel (PUSCH) preparation time for a given device processing capability (eg, UE processing capability 1) may be represented.

[0134] In this manner, network node 405-a may determine time period 425 to be greater than or equal to a first duration associated with processing RAR 420-a by network node 415-a. Network node 405-a may indicate time period 425 via RAR 420-a. Network node 415-a may receive RAR 420-a and obtain time period 425. Network node 415-a may process RAR 420-a and prepare uplink message 430-a during time period 425. Network node 415-a may initiate an uplink transmission during a time window based on time period 425 (e.g., at a time offset by at least time period 425 from the time when RAR 420-a was received, such as Figure 4A 4. As shown, the network node 405-a sends an uplink message 430-a to the network node 405-a. The network node 405-a and the network node 415-a may thereby perform the random access procedure according to the described timeline.

[0135] However, in some aspects, network node 415-a may support reduced bandwidth capabilities, as described with reference to Figure 1-3. In such a case, if RAR 420-a is transmitted and received via a number of PRBs greater than a threshold number of PRBs supported by network node 415-a, network node 415-a may take more time to process RAR 420-a than in a case where network node 415-a supports full bandwidth capability. In such a case, time period 425 may not account for the extended processing time, and network node 415-a may not have sufficient time to process and respond to RAR 420-a within the scheduled time period 425, which may reduce throughput and reliability and may increase latency of the random access procedure.

[0136] Figure 4B A second random access timeline 400-b is shown. In this example, the network node 415-b may support reduced bandwidth capabilities, as shown in FIG. Figure 1 -3, and the network node 405-b may determine that it may be greater than or equal to the reference Figure 4A Time period 435 is described as extending time period 425 to account for reduced bandwidth capabilities of network node 415-b. As described herein, to account for reduced bandwidth capabilities of network node 415-b, the duration of time period 435 may be based on the number of PRBs over which RAR 420-b is scheduled.

[0137] Despite Figure 4B 4. Although not shown in FIG. 4, the network node 415-b may send first information indicating the reduced bandwidth capabilities of the network node 415-b, a first random access message, or both to the network node 405-b at a time prior to sending the RAR 420-b. The first information may be sent via one or more messages that may include a first random access message or other type of uplink message. The first random access message may be, for example, a random access preamble (e.g., Msg1) or some other type of random access message and may indicate a reference to the network node 405-b. Figure 2 The network node 405-b may receive the first information, the first random access message, or both, and in response may send a RAR 420-b (e.g., Msg2 of the four-step random access procedure or a fallback RAR, as described in reference to Figure 4A ). The RAR 420-b may schedule an uplink message 430-b (eg, Msg3) and may indicate a time period 435 for the network node 415-b to transmit the uplink message 430-b in response to the RAR 420-b.

[0138] In some aspects described herein, for baseband bandwidth reduction, some wireless communication systems may allow RAR 420 (e.g., RAR PDSCH) to be scheduled to a device (e.g., an eRedCap UE or other type of device) supporting reduced bandwidth capabilities (e.g., network node 415-b) via a number of PRBs greater than a threshold number of PRBs that the device can process per timeslot (e.g., greater than a maximum number of unicast PRBs). In such a case, if network node 415-b receives RAR 420 (e.g., RAR 420-b) via a number of PRBs greater than the threshold number, network node 415-b may send uplink message 430-b if time period 435 indicated by RAR 420-b indicates that the time between reception of RAR 420-b and transmission of uplink message 430-b is not less than a threshold time period 440 supported by the reduced-capability network node 415-b. As described herein, the threshold time period 440 supported by the reduced capability network node 415-b may be based on or equal to the sum of the first duration and the extended time (eg, N T,1 +N T,2 +0.5ms+X ms).

[0139] The first duration may include a first processing time N T,1 , Uplink preparation time N T,2 and a constant duration (e.g., 0.5ms or some other constant value), as referenced Figure 4A and described in Equation 1. As described herein, the extension time may be based on the number of PRBs via which RAR 420-b is scheduled. Network node 405-b may consider threshold time period 440 based on receiving first information indicating a reduced capability of network node 415-b. That is, network node 405-b may determine time period 435T to satisfy Equation 2, where X may represent the extension time in milliseconds or some other time unit.

[0140] T≥N T,1 +N T,2 +0.5ms+X ms (2)

[0141] The extension time in the threshold time period 440 associated with the reduced bandwidth capability may be based on the number of PRBs via which the RAR 420-b is scheduled. If the network node 415-b indicates that the network node 415-b supports the reduced bandwidth capability associated with the threshold number of PRBs and schedules the RAR 420-b via a number of PRBs less than or equal to the threshold number of PRBs, the extension time may be zero (e.g., X=0). That is, the network node 415-b is capable of processing the RAR 420-b in a single time slot or hop without extending the first duration (e.g., T≥N). T,1 +N T,2 +0.5ms may be sufficient).

[0142] If the network node 415-b indicates that the network node 415-b supports reduced bandwidth capability associated with a threshold number of PRBs, and the RAR 420-b is scheduled via a number of PRBs greater than the threshold number of PRBs, the extension time can be greater than zero (e.g., X>0) to account for the increased processing time at the network node 415-b based on the reduced bandwidth capability.

[0143] In some aspects, the duration of the extended time may be a constant value (e.g., if the RAR 420-b is sent via more than the threshold number of PRBs (e.g., PRB_num)) based on the number of PRBs via which the RAR 420-b is scheduled being greater than a threshold number of PRBs (e.g., if the RAR 420-b is sent via more than the threshold number of PRBs, then X may be 1 ms or some other constant duration). The constant duration may be defined or configured or indicated to the network node 415-b, the network node 405-b, or both via control signaling. In some other aspects, the duration of the extended time may be based on the difference between the number of PRBs via which the RAR 420-b is scheduled and the threshold number of PRBs. For example, the duration of the extended time may be proportional to the number of PRBs greater than the threshold number.

[0144] In some aspects, the system bandwidth can be divided into multiple PRB number ranges, and each PRB number range can be associated with a corresponding extension time or can correspond to a corresponding extension time. The duration of the extension time for calculating or determining the threshold time period 440 can be based on the PRB number range including the number of PRBs via which the RAR 420-b is scheduled. In some aspects, the PRB number range can be defined by a corresponding maximum PRB number and a corresponding minimum PRB number, and each range can be associated with a corresponding extension duration. An example of a PRB number range and a corresponding extension time for a given SCS (e.g., 15KHz SCS) is shown in Equation 3.

[0145]

[0146] In this example, the PRB number range may include {[0, 25], (25, 52], (52, 79], and (79, PRB_max]}, where PRB_max may represent the total number of PRBs (e.g., in the system bandwidth, RF bandwidth, or some other bandwidth allocated for communication). In this example, if the RAR 420-b is scheduled via 53 PRBs (e.g., PRB_num=53), the extension time may be 1 ms, and the threshold period 440 may be equal to N T,1 +N T,2 +0.5ms+1ms. Although four ranges are shown in Equation 3, it should be understood that any number of ranges may be defined across any number of PRBs in the system bandwidth, and the extended duration assigned to each range may vary based on one or more system parameters.

[0147] In some aspects, the PRB number range may include the total PRB number (e.g., in the system bandwidth, RF bandwidth, or some other bandwidth allocated for communication). Each range may include the same number of PRBs. The number of PRBs in each range may correspond to a portion of the total PRB number. For example, the total PRB number may be divided into five equal ranges, or four equal ranges, or some other number of equal PRB ranges. Each equal PRB number range may correspond to a corresponding extension time. An example of a PRB number range and a corresponding extension time for a given SCS (e.g., 15KHz SCS) and a total PRB number (e.g., PRB_max=106) is shown in Equation 4.

[0148]

[0149] In this example, the PRB number ranges may each include one-quarter of the total PRB number, where PRB_max may represent the total PRB number, and PRB_num may represent the number of PRBs via which the RAR 420-b is scheduled. In this example, if the RAR 420-b is scheduled via 53 PRBs (e.g., PRB_num=53) and the total PRB number is 106 PRBs (e.g., PRB_max=106), the extension time may be 0.5 ms because PRB_num / PRB_max may be equal to 0.5, and the threshold period 440 may be equal to N T,1 +N T,2 +0.5ms+0.5ms. Although four ranges are shown in Equation 4, it should be understood that any number of ranges may be defined across any number of PRBs in the system bandwidth, and the extended duration assigned to each range may vary based on one or more system parameters.

[0150] Thus, the extension time may be based on the number of PRBs associated with RAR 420-b. The extension time may be defined as a constant or for each range of PRB numbers, or both, via configuration (e.g., during device manufacturing or defined in a standard) or via signaling exchanged between network node 405-b and network node 415-b. Before sending RAR 420-b, network node 405-b may determine (e.g., calculate) a threshold time period 440 corresponding to the reduced bandwidth capabilities of network node 415-b based on the number of PRBs scheduled or allocated for transmission of RAR 420-b. Network node 405-b may determine time period 435 based on threshold time period 440 and one or more other communication parameters. For example, network node 405-b may determine that time period 435 is greater than or equal to threshold time period 440 to support reliable communication with network node 415-b having reduced capabilities. The network node 405 - b may send the RAR 420 - b including an indication of the time period 435 to the network node 415 - b .

[0151] In some aspects, the network node 415-b may verify that the time period 435 is greater than or equal to the threshold time period 440. For example, the network node 415-b may determine the threshold time period 440 based on a defined or indicated rule and the number of PRBs via which the RAR 420-b is received. The network node 415-b may compare the time period 435 indicated via the RAR 420-b with the threshold time period 440. The network node 415-b may determine whether the indicated time period 435 is greater than or equal to the threshold time period 440. If the network node 415-b determines that the indicated time period 435 is less than the threshold time period 440, the network node 415-b may refrain from sending the uplink message 430-b. If the network node 415-b determines that the indicated time period 435 is greater than or equal to the threshold time period 440, the network node 415-b may process the RAR 420-b and prepare the uplink message 430-b during the time period 435, and the network node 415-b may send the uplink message 430-b within a time window based on the indicated time period 435 (e.g., at a second time that is offset from the first time period 435 when the RAR 420-b is received).

[0152] It should be understood that the terms "threshold period," "first duration," and "extended time," as used herein, are interchangeable and provide examples. For example, threshold period 440 and time period 435 may additionally or alternatively be referred to as durations or some other term representing time. Threshold period 440, first duration, time period 435, and extended time described herein represent examples of different time units that may be used to accommodate processing of a relatively large number of PRBs by a reduced-capability device.

[0153] Thus, the techniques described herein may define an extended random access timeline to provide a reduced capability network node with a timer that receives a random access message (such as a RAR 420) via a number of PRBs greater than a threshold number supported by the reduced capability network node. By extending the timeline, the reduced capability network node may process the RAR 420 received via the increased bandwidth and prepare an uplink message 430 for transmission in response to the RAR 420, which may improve throughput and reduce latency compared to a system in which the timeline may not be extended. The random access timeline extension described herein may be applicable to a variety of different types of random access messages and procedures, as described in further detail elsewhere herein, including with reference to Figure 5-7 .

[0154] Figure 5 An example of a random access timeline 500 supporting a random access timeline for a reduced capability device according to one or more aspects of the present disclosure is shown. The random access timeline 500 may implement or be implemented by aspects of the wireless communication systems 100 and 200. For example, the random access timeline 500 illustrates a timeline for transmitting a RAR 520 including a RAPID 545 by a network node 505, receiving and processing the RAR 520 by a network node 515, and transmitting a random access preamble 530 by the network node 515 in response to the RAR 520. The network nodes 505 and 515 may represent a random access preamble 530 as described with reference to FIG. Figure 1 In some aspects, the time period 535 between the reception of the RAR 520 by the network node 515 and the transmission of the random access preamble 530 by the network node 515 can be based on the bandwidth capabilities of the network node 515, the number of PRBs over which the RAR 520 is scheduled, or both.

[0155] Despite Figure 55. Although not shown in FIG. 5, the network node 515 may send first information indicating the reduced bandwidth capabilities of the network node 515, a first random access message, or both to the network node 505 at a time before the RAR 520 is sent. The first information may be sent via one or more messages that may include a first random access message or other type of uplink message. The first random access message may be, for example, a random access preamble (e.g., Msg1) or some other type of random access message and may represent a reference to the network node 505. Figure 2 5. The network node 505 may receive the first information, the first random access message, or both and may send a RAR 520 (e.g., Msg2 or MsgB) in response. In some aspects herein, the RAR 520 may be referred to as a second random access message. The RAR 520 may include a RAPID 545 that identifies the random access preamble to which the RAR 520 responds.

[0156] In some aspects, the network node 505 may send a RAR 520 with an incorrect RAPID 545 to the network node 515. For example, the RAPID 545 indicated via the RAR 520 may be different from or incorrectly associated with a random access preamble previously sent by the network node 515. In this case, the RAR 520 may be intended for a different network node or may have been sent in error. If the network node 515 receives the RAR 520 including the incorrect RAPID 545, the network node 515 may respond by retransmitting the random access preamble 530. Thus, the random access preamble 530 may be a repetition or second transmission of a previously sent random access preamble.

[0157] If the RAR 520 includes an incorrect RAPID 545, the RAR 520 may indicate a time period 535 for the network node 515 to transmit a retransmission of the random access preamble 530 in response to the RAR 520. In some aspects, the RAR 520 may indicate a single time period 535 that may be applicable for transmitting an uplink message in response to the RAR 520 if the RAPID 545 in the RAR 520 is correct (e.g., as described with reference to FIG. Figure 4A and 4B ), or may be adapted to retransmit the random access preamble 530 in response to the RAR 520 if the RAPID 545 transmitted via the RAR 520 is incorrect (e.g., the same time period 535 for both scenarios). In such a case, the time period 535 may be defined as being the same as the reference time period 535. Figure 4BThe described time period 435 is the same. Additionally or alternatively, the RAR 520 may indicate a time period 535 for retransmission of the random access preamble 530 and may separately indicate a time period for transmission of an uplink message.

[0158] As described herein, the RAR 520 may be sent to the network node 515 via a number of PRBs that is greater than a threshold number of PRBs associated with the bandwidth capabilities of the network node 515. The techniques, systems, and devices described herein provide a time period 535 to account for additional processing by the network node 515 due to the increased bandwidth of the RAR 520. Figure 4B As further described, a threshold time period 540 may be defined and may correspond to a reduced bandwidth capability of the network node 515. The threshold time period 540 may be different for different numbers of PRBs and may indicate a minimum time period for the network node 515 to receive and process the RAR 520 via the corresponding number of PRBs. The threshold time period 540 may be equal to the sum of the first duration and the extension time Y. In this example, the first duration may include a first processing time N for the network node 515. T,1 and a constant duration (eg, 0.75 ms or some other constant value), so that the threshold period 540 may be defined as T=N T,1 +0.75ms+Y ms.

[0159] The extension time Y may be based on the number of PRBs over which the RAR 520 is transmitted. The extension time Y may take into account the reduced bandwidth capability of the network node 515, similar to the reference Figure 4B If the RAR 520 is scheduled via a number of PRBs that is less than or equal to a threshold number of PRBs supported by the network node 515, the extension time may be zero (e.g., Y=0). That is, the network node 515 is able to process the RAR 520 in a single time slot or hop without extending the first duration allocated for processing (e.g., N T,1 +0.75ms). If the RAR 520 is scheduled via a number of PRBs greater than a threshold number of PRBs, the extension time may be greater than zero (eg, Y>0) to account for increased processing time at the network node 515 according to the reduced bandwidth capability.

[0160] As described in further detail elsewhere herein, including with reference to Figure 4BIf the number of PRBs exceeds the threshold number, the extension time may be defined as a constant value (e.g., 1 ms or some other time period), or the extension time may be based on the difference between the number of PRBs and the threshold number, or the extension time may be based on a PRB number range that includes the number of PRBs. For example, the bandwidth allocated for communication may be divided into multiple PRB number ranges, and each PRB number range may be associated with or correspond to a corresponding extension time. The duration of the extension time for determining the threshold time period 540 may be based on a PRB number range that includes the number of PRBs via which the RAR 520 is scheduled.

[0161] The extended time Y for the timing between the reception of the RAR 520 and the retransmission of the random access preamble 530 may be the same as the extended time X for the timing between the reception of the RAR and the transmission of the uplink message, as described with reference to FIG. Figure 4B Additionally or alternatively, the extension time Y may be defined differently from the extension time X used for timing between RAR reception and uplink message transmission. One or more rules or procedures for defining the extension time as a constant or for each PRB number range, or both, in the context of timing between RAR reception and random access preamble retransmission may be configured (e.g., during manufacture of the device or defined in a standard) or indicated via signaling exchanged between the network node 505 and the network node 515.

[0162] Before sending the RAR 520, the network node 505 may determine (e.g., calculate) a threshold time period 540 corresponding to the reduced bandwidth capabilities of the network node 515 based on the number of PRBs scheduled or allocated for transmission of the RAR 520. The network node 505 may determine the time period 535 based on the threshold time period 540 and one or more other communication parameters. For example, the network node 505 may determine that the time period 535 is greater than or equal to the threshold time period 540 to support reliable communication with the network node 515 with reduced capabilities. The network node 505 may send the RAR 520 including an indication of the time period 535 to the network node 515. In some aspects, the network node 515 may verify that the time period 535 is greater than or equal to the threshold time period 540 to determine whether to retransmit the random access preamble 530 at the scheduled time, as described with reference to FIG. Figure 4B described.

[0163] The described timeline extension techniques for the random access procedure can thus be applied to the time period between the reception of a RAR 520 including an incorrect or invalid RAPID 545 and the retransmission of a responsive random access preamble 530. Thus, the network node 505 can support increased bandwidth for the RAR 520 while maintaining reliable communications with the reduced-capability network node 515.

[0164] Figure 6 An example of a random access timeline 600 supporting a random access timeline for a device with reduced capability according to one or more aspects of the present disclosure is shown. The random access timeline 600 may implement or be implemented by aspects of the wireless communication systems 100 and 200. For example, the random access timeline 600 illustrates a timeline for transmitting a RAR 620 by a network node 605, receiving and processing the RAR 620 by a network node 615, and transmitting a feedback message 630 by the network node 615 in response to the RAR 620. The network nodes 605 and 615 may represent a random access timeline as shown in FIG. Figure 1-5 In some aspects, the time period 635 between receiving the RAR 620 by the network node 615 and transmitting the feedback message 630 by the network node 615 may be based on the bandwidth capabilities of the network node 615, the number of PRBs over which the RAR 620 is scheduled, or both.

[0165] Despite Figure 6 6, but the network node 615 may send first information indicating the reduced bandwidth capabilities of the network node 615, a first random access message, or both to the network node 605 at a time before the RAR 620 is sent. The first information may be sent via one or more messages that may include a first random access message or other type of uplink message. The first random access message may be, for example, a random access preamble (e.g., Msg1) or some other type of random access message and may represent a reference to the network node 605. Figure 2 An example of the first random access message 240 is described.

[0166] The network node 605 may receive the first information, the first random access message, or both, and may send a RAR 620 (e.g., Msg2 or MsgB) in response. In some aspects herein, the RAR 620 may be referred to as a second random access message. The RAR 620 may indicate the success of the random access procedure based on the first random access message (e.g., a successful RAR in a two-step random access procedure). The RAR 620 may indicate a time period 635 for the network node 615 to transmit a feedback message 630 (e.g., HARQ feedback) in response to the RAR 620.

[0167] As described herein, the RAR 620 may be sent to the network node 615 via a number of PRBs that is greater than a threshold number of PRBs associated with the bandwidth capabilities of the network node 615. The techniques, systems, and devices described herein provide a time period 635 to account for additional processing by the network node 615 due to the increased bandwidth of the RAR 620. Figure 4B As described in further detail, a threshold time period 640 may be defined and may correspond to a reduced bandwidth capability of the network node 615. The threshold time period 640 may be different for different numbers of PRBs via which the RAR 620 is transmitted and may indicate a minimum time period for the network node 615 to receive and process the RAR 620 via the corresponding number of PRBs. The threshold time period 640 may be equal to the sum of the first duration and the extension time Z. In this example, the first duration may include a first processing time N for the network node 615. T,1 and a constant duration (eg, 0.5 ms or some other constant value), so that the threshold period 640 may be defined as T=N T,1 +0.5ms+Z ms.

[0168] The extension time Z may be based on the number of PRBs over which the RAR 620 is transmitted. The extension time Z may take into account the reduced bandwidth capability of the network node 615, similar to the reference Figure 4B and 5 The extension times X and Y described above may be zero (e.g., Z=0) if the RAR 620 is scheduled via a number of PRBs that is less than or equal to a threshold number of PRBs supported by the network node 615. That is, the network node 615 is able to process the RAR 620 in a single time slot or hop without extending the first duration allocated for processing (e.g., N T,1 +0.5ms). If the RAR 620 is scheduled via a number of PRBs greater than a threshold number of PRBs, the extension time may be greater than zero (eg, Z>0) to account for increased processing time at the network node 615 according to the reduced bandwidth capability.

[0169] As described in further detail elsewhere herein, including with reference to Figure 4BIf the number of PRBs exceeds a threshold number, the extension time may be defined as a constant value (e.g., 1 ms or some other time period), or the extension time may be based on the difference between the number of PRBs and the threshold number, or the extension time may be based on a PRB number range that includes the number of PRBs. For example, the bandwidth allocated for wireless communication may be divided into multiple PRB number ranges, and each PRB number range may be associated with or correspond to a corresponding extension time. The duration of the extension time for determining the threshold time period 640 may be based on a PRB number range that includes the number of PRBs via which the RAR 620 is scheduled.

[0170] The extended time Z for the timing between the reception of the RAR 620 and the transmission of the feedback message 630 may be the same as the extended time X for the timing between the reception of the RAR and the transmission of the uplink message, as described with reference to FIG. Figure 4B As described above, or may be the same as the extended time Y used for the timing between RAR reception and random access preamble retransmission, as described in reference Figure 5 Additionally or alternatively, the extended time Z may be the same as that described in Figure 4B and 5 The extension times X and Y described are defined differently. One or more rules or procedures for defining the extension time as a constant or for each PRB number range, or both, in the context of feedback transmission after RAR reception may be configured (e.g., during device manufacturing or defined in a standard) or indicated via signaling exchanged between network node 605 and network node 615.

[0171] Before sending the RAR 620, the network node 605 may determine (e.g., calculate) a threshold time period 640 corresponding to the reduced bandwidth capabilities of the network node 615 based on the number of PRBs scheduled or allocated for transmission of the RAR 620 and one or more configured rules or procedures. The network node 605 may determine the time period 635 based on the threshold time period 640 and one or more other communication parameters. For example, the network node 605 may determine that the time period 635 is greater than or equal to the threshold time period 640 to support reliable communication with the network node 615 with reduced capabilities (e.g., T ≥ N T,1 +0.5ms+Z ms). The network node 605 may send the RAR 620 including an indication of the time period 635 to the network node 615. In some aspects, the network node 615 may verify that the time period 635 is greater than or equal to the threshold time period 640 to determine whether to send the feedback message 630 at the scheduled time, as described with reference to FIG. Figure 4B described.

[0172] The described timeline extension technique for the random access procedure can thus be applied to the time period between the reception of the RAR 620 indicating the success of the random access procedure and the transmission of the responsive feedback message 630. Thus, the network node 605 can support increased bandwidth for the RAR 620 while maintaining reliable communication with the reduced capability network node 615.

[0173] Figure 7 An example of a random access timeline 700 supporting a random access timeline for a device with reduced capability according to one or more aspects of the present disclosure is shown. The random access timeline 700 may implement or be implemented by aspects of the wireless communication systems 100 and 200. For example, the random access timeline 700 illustrates a timeline for transmitting a contention resolution message 720 by a network node 705, receiving and processing the contention resolution message 720 by a network node 715, and transmitting a feedback message 730 by the network node 715 in response to the contention resolution message 720. The network nodes 705 and 715 may represent a random access timeline as shown in FIG. Figure 1-6 In some aspects, the time period 735 between the reception of the contention resolution message 720 by the network node 715 and the transmission of the feedback message 730 by the network node 715 can be based on the bandwidth capabilities of the network node 715, the number of PRBs over which the contention resolution message 720 is scheduled, or both.

[0174] Despite Figure 7 7. Although not shown in FIG. 7 , the network node 715 may send first information indicating the reduced bandwidth capabilities of the network node 715, a first random access message, or both to the network node 705 at a time prior to the contention resolution message 720 being sent. The first information may be sent via one or more messages that may include a first random access message or other type of uplink message. The first random access message may be, for example, an uplink scheduling transmission (e.g., Msg3 in a four-step random access procedure) or some other type of random access message and may represent a reference to a random access message. Figure 2 An example of the first random access message 240 is described.

[0175] The network node 705 may receive the first information, the first random access message, or both and may send a downlink contention resolution message 720 (e.g., Msg2 or MsgB) in response. In some aspects herein, the contention resolution message 720 may be referred to as a second random access message. The contention resolution message 720 may indicate a time period 735 for the network node 715 to transmit a feedback message 730 (e.g., HARQ feedback) in response to the contention resolution message 720.

[0176] As described herein, the contention resolution message 720 may be sent to the network node 715 via a number of PRBs greater than a threshold number of PRBs associated with the bandwidth capabilities of the network node 715. The techniques, systems, and devices described herein provide a time period 735 to account for additional processing by the network node 715 due to the increased bandwidth of the contention resolution message 720. Figure 4B As further described, a threshold time period 740 may be defined and may correspond to a reduced bandwidth capability of the network node 715. The threshold time period 740 may be different for different numbers of PRBs via which the contention resolution message 720 is transmitted and may indicate a minimum time period for the network node 715 to receive and process the contention resolution message 720 via the corresponding number of PRBs. The threshold time period 740 may be equal to the sum of the first duration and the extended time W. In this example, the first duration may include a first processing time N for the network node 715. T,1 and a constant duration (eg, 0.5 ms or some other constant value), so that the threshold period 740 may be defined as T=N T,1 +0.5ms+W ms.

[0177] The extended time W may be based on the number of PRBs via which the contention resolution message 720 is transmitted. The extended time W may take into account the reduced bandwidth capability of the network node 715, similar to the reference Figure 4B and 5 The extension times X, Y, and Z described above may be zero (e.g., W=0) if the contention resolution message 720 is scheduled via a number of PRBs that is less than or equal to a threshold number of PRBs supported by the network node 715. That is, the network node 715 is able to process the contention resolution message 720 in a single time slot or hop without extending the first duration allocated for processing (e.g., N T,1 +0.5ms). If the contention resolution message 720 is scheduled via a number of PRBs greater than a threshold number of PRBs, the extension time may be greater than zero (eg, W>0) to account for increased processing time at the network node 715 according to the reduced bandwidth capability.

[0178] As described in further detail elsewhere herein, including with reference to Figure 4BIf the number of PRBs exceeds the threshold number, the extension time may be defined as a constant value (e.g., 1 ms or some other time period), or the extension time may be based on the difference between the number of PRBs and the threshold number, or the extension time may be based on a PRB number range that includes the number of PRBs. For example, the bandwidth allocated for wireless communication may be divided into multiple PRB number ranges, and each PRB number range may be associated with or correspond to a corresponding extension time. The duration of the extension time for determining the threshold time period 740 may be based on the PRB number range that includes the number of PRBs via which the contention resolution message 720 is scheduled.

[0179] The extended time W for the timing between the reception of the contention resolution message 720 and the transmission of the feedback message 730 may be the same as the extended time X for the timing between the reception of the RAR and the transmission of the uplink message, as shown in FIG. Figure 4B As described above, or may be the same as the extended time Y used for the timing between RAR reception and random access preamble retransmission, as described in reference Figure 5 As described, or may be the same as the extended time Z used for the timing between RAR reception and feedback transmission, as described in reference Figure 6 Additionally or alternatively, the extended time W may be the same as that described above, or any combination thereof. Figure 4B-6 The extension times X, Y, and Z described are defined differently. One or more rules or procedures for defining the extension time as a constant or for each PRB number range, or both, in the context of feedback transmission after contention resolution message reception may be configured (e.g., during manufacture of the device or defined in a standard) or indicated via signaling exchanged between network node 705 and network node 715.

[0180] Before sending the contention resolution message 720, the network node 705 may determine (e.g., calculate) a threshold time period 740 corresponding to the reduced bandwidth capabilities of the network node 715 based on the number of PRBs scheduled or allocated for transmission of the contention resolution message 720 and one or more configured rules or procedures. The network node 705 may determine the time period 735 based on the threshold time period 740 and one or more other communication parameters. For example, the network node 705 may determine that the time period 735 is greater than or equal to the threshold time period 740 to support reliable communication with the network node 715 with reduced capabilities (e.g., T ≥ N T,1 +0.5ms+Wms). The network node 705 may send a contention resolution message 720 including an indication of the time period 735 to the network node 715. In some aspects, the network node 715 may verify that the time period 735 is greater than or equal to the threshold time period 740 to determine whether to send the feedback message 730 at the scheduled time, as described with reference to FIG. Figure 4B described.

[0181] The described timeline extension techniques for the random access procedure can thus be applied to the time period between the receipt of the contention resolution message 720 and the transmission of the responsive feedback message 730. Thus, the network node 705 can support increased bandwidth for the contention resolution message 720 while maintaining reliable communication with the reduced capability network node 715.

[0182] Figure 8 An example of a process flow 800 for supporting a random access timeline for a device with reduced capabilities according to one or more aspects of the present disclosure is shown. The process flow 800 may implement or be implemented by aspects of the wireless communication systems 100 and 200 or the random access timelines 400, 500, 600, and 700. For example, the process flow 800 illustrates communications between a network node 805 and a network node 815, which may be represented as shown in FIG. Figure 1-7 In some aspects, the network node 815 can support reduced bandwidth capabilities associated with a threshold bandwidth for per-slot processing. The network node 805 can take the reduced bandwidth capabilities into account when scheduling random access messages, which can provide improved coordination between devices.

[0183] In the following description of process flow 800, operations between network node 805 and network node 815 may be performed in a different order or at different times. Some operations may also be omitted from process flow 800, or other operations may be added. Although network node 805 and network node 815 are shown as performing the operations of process flow 800, some aspects of some operations may also be performed by one or more other wireless devices.

[0184] At 820, the network node 815 may send first information indicating the bandwidth capabilities of the network node 815 to the network node 805. The first information may be conveyed via a random access message or some other type of uplink message. The first information may indicate that the network node 815 is a reduced-capability network node 815 and supports reduced bandwidth capabilities. In some aspects, the network node 805 may determine, based on one or more rules or configured parameters, that the reduced bandwidth capabilities are associated with a threshold number of PRBs that the network node 815 can process per timeslot. Additionally or alternatively, the first information may indicate the threshold number of PRBs.

[0185] At 825, the network node 815 may send a first random access message to the network node 805. The first random access message may indicate a reference to Figure 2An example of a first random access message 240 is described. In some aspects, the first random access message may convey the first information (e.g., the network node 815 may send a single transmission including the first random access message and the first information). The first random access message may be, for example, a random access preamble (e.g., MsgA or Msg1), an uplink transmission (e.g., Msg3), or some other type of random access message.

[0186] At 830, the network node 805 may send a second random access message to the network node 815 based on or in response to the first random access message. The network node 805 may schedule the transmission of the second random access message via a number of PRBs (e.g., from any number of PRBs within the system bandwidth allocated for wireless communication). The second random access message may indicate a time period 835 for the network node 815 to transmit a third random access message in response to the second random access message. The time period 835 may represent examples of the time periods 435, 535, 635, and 735 described with reference to Figures 4-7 and may be based on a threshold time period associated with the bandwidth capabilities of the network node 815 (e.g., the threshold time periods 440, 540, 640, and 740 described with reference to Figures 4-7).

[0187] The threshold time period may be based on the number of PRBs via which the second random access message is received. For example, the threshold time period may be based on (e.g., equal to) the first duration and the extension time, wherein the first duration is based on a processing time associated with the second random access message, and the extension time is based on the number of PRBs, as described in further detail elsewhere herein, including with reference to Figures 4-7. In some aspects, prior to sending the second random access message, the network node 805 may determine a threshold time period associated with the bandwidth capabilities of the network node 815, and the network node 805 may determine or select the time period 835 to be greater than or equal to the threshold time period. The second random access message may represent an example of a second random access message 245, a RAR 420, a RAR 520, a RAR 620, or a contention resolution message 720, as described with reference to Figures 4-7. Figure 2 and as described in Figures 4-7.

[0188] At 840, the network node 815 may send a third random access message based on the time period 835. The network node 805 may monitor for the third random access message based on the time period 835. For example, the network node 815 may send the third random access message based on the time period 835 or during a time window centered on the time period 835. Additionally or alternatively, the network node 815 may send the third random access message at a second time that is offset by the time period 835 from when the second random access message was received. The third random access message may be, for example, an uplink transmission scheduled by the second random access message (e.g., Msg3), a retransmission of a random access preamble (e.g., Msg1 or MsgA), or a feedback message.

[0189] In some aspects, the network node 815 may determine whether the time period 835 is greater than or equal to a threshold time period associated with the bandwidth capabilities of the network node 815 based on receiving the second random access message including the time period 835. If the network node 815 determines that the time period 835 indicated via the second random access message is less than the threshold time period, the network node 815 may refrain from sending the third random access message at the scheduled time. In such a case, the network node 815 may indicate a failure of the random access procedure, or the network node 815 may send the third random access message at a delayed time, or the network node 815 may restart the random access procedure (e.g., by retransmitting a previously sent random access message, such as the first random access message). If the network node 815 determines that the time period 835 indicated via the second random access message is greater than or equal to the threshold time period, the network node 815 may send the third random access message at the scheduled time.

[0190] The described random access timeline may thus provide for a reduced-capability network node 815 to receive a random access message via a number of PRBs that is greater than a threshold number of PRBs that the network node 815 can process for each timeslot. By indicating a reduced bandwidth capability, the network node 815 may inform the network node 805 of the threshold number of PRBs so that the network node 805 may indicate a sufficiently long time period based on the number of PRBs via which the random access message is sent to support the increased processing time of the network node 815.

[0191] Figure 9A block diagram 900 of a device 905 supporting a random access timeline for a reduced-capability device according to one or more aspects of the present disclosure is shown. The device 905 may be an example of aspects of a UE 115 or a network entity 105 as described herein. The device 905 may include a receiver 910, a transmitter 915, and a communication manager 920. The device 905 may also include a processor. Each of these components may communicate with each other (e.g., via one or more buses).

[0192] The receiver 910 may provide a means for receiving information (such as packets, user data, control information, or any combination thereof) associated with various information channels (e.g., a control channel, a data channel, an information channel related to a random access timeline for a reduced-capability device). The information may be communicated to other components of the device 905. The receiver 910 may utilize a single antenna or a collection of multiple antennas.

[0193] The transmitter 915 may provide a means for transmitting signals generated by other components of the device 905. For example, the transmitter 915 may transmit information (such as packets, user data, control information, or any combination thereof) associated with various information channels (e.g., a control channel, a data channel, an information channel associated with a random access timeline for a device with reduced capability). In some examples, the transmitter 915 may be co-located with the receiver 910 in a transceiver module. The transmitter 915 may utilize a single antenna or a collection of multiple antennas.

[0194] The communication manager 920, the receiver 910, the transmitter 915, or various combinations thereof, or various components thereof, may be examples of means for performing various aspects of a random access timeline for reduced capability devices as described herein. For example, the communication manager 920, the receiver 910, the transmitter 915, or various combinations thereof, or components thereof, may support methods for performing one or more of the functions described herein.

[0195] In some aspects, the communication manager 920, the receiver 910, the transmitter 915, or various combinations or components thereof can be implemented in hardware (e.g., in a communication management circuit). The hardware can include a processor, a digital signal processor (DSP), a central processing unit (CPU), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, a microcontroller, discrete gate or transistor logic, discrete hardware components, or any combination thereof configured as or otherwise supporting means for performing the functions described in this disclosure. In some aspects, the processor and memory coupled to the processor can be configured to perform one or more of the functions described herein (e.g., by executing instructions stored in the memory by the processor).

[0196] Additionally or alternatively, in some aspects, the communication manager 920, receiver 910, transmitter 915, or various combinations or components thereof may be implemented in code executed by a processor (e.g., as communication management software or firmware). If implemented in code executed by a processor, the functionality of the communication manager 920, receiver 910, transmitter 915, or various combinations or components thereof may be performed by a general-purpose processor, DSP, CPU, ASIC, FPGA, microcontroller, or any combination of these or other programmable logic devices (e.g., configured as or otherwise supporting means for performing the functionality described in this disclosure).

[0197] In some aspects, the communication manager 920 can be configured to perform various operations (e.g., receive, obtain, monitor, output, transmit) using or otherwise cooperating with the receiver 910, the transmitter 915, or both. For example, the communication manager 920 can receive information from the receiver 910, send information to the transmitter 915, or be integrated with the receiver 910, the transmitter 915, or both to obtain information, output information, or perform various other operations as described herein.

[0198] According to examples disclosed herein, the communication manager 920 may support wireless communication at a first network node. For example, the communication manager 920 may be configured to or otherwise support means for receiving first information indicating bandwidth capabilities of a second network node. The communication manager 920 may be configured to or otherwise support means for receiving a first random access message. The communication manager 920 may be configured to or otherwise support means for sending a second random access message based on the first random access message and via a number of PRBs, the second random access message indicating a time period for transmitting a third random access message by the second network node in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capabilities of the second network node, and wherein the threshold time period is based on the number of PRBs.

[0199] Additionally or alternatively, according to examples as disclosed herein, the communication manager 920 may support wireless communications at the first network node. For example, the communication manager 920 may be configured to or otherwise support means for sending first information indicating the bandwidth capabilities of the first network node. The communication manager 920 may be configured to or otherwise support means for sending a first random access message. The communication manager 920 may be configured to or otherwise support means for receiving a second random access message based on the first random access message and via a number of PRBs, the second random access message indicating a time period for transmitting a third random access message by the first network node in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capabilities of the first network node, and wherein the threshold time period is based on the number of PRBs. The communication manager 920 may be configured to or otherwise support means for sending the third random access message during a time window based on the time period.

[0200] By including or configuring the communication manager 920 according to the examples described herein, the device 905 (e.g., a processor controlling the receiver 910, the transmitter 915, the communication manager 920, or a combination thereof or otherwise coupled thereto) can support techniques for reduced processing, reduced power consumption, and more efficient utilization of communication resources.

[0201] Figure 10 A block diagram 1000 of a device 1005 supporting a random access timeline for a reduced-capability device according to one or more aspects of the present disclosure is shown. The device 1005 may be an example of aspects of the device 905, UE 115, or network entity 105 as described herein. The device 1005 may include a receiver 1010, a transmitter 1015, and a communication manager 1020. The device 1005 may also include a processor. Each of these components may communicate with each other (e.g., via one or more buses).

[0202] The receiver 1010 may provide means for receiving information (such as packets, user data, control information, or any combination thereof) associated with various information channels (e.g., a control channel, a data channel, an information channel associated with a random access timeline for a reduced-capability device). The information may be communicated to other components of the device 1005. The receiver 1010 may utilize a single antenna or a collection of multiple antennas.

[0203] The transmitter 1015 may provide a means for transmitting signals generated by other components of the device 1005. For example, the transmitter 1015 may transmit information (such as packets, user data, control information, or any combination thereof) associated with various information channels (e.g., a control channel, a data channel, an information channel associated with a random access timeline for a device with reduced capability). In some examples, the transmitter 1015 may be co-located with the receiver 1010 in a transceiver module. The transmitter 1015 may utilize a single antenna or a collection of multiple antennas.

[0204] Device 1005 or its various components may be examples of means for performing various aspects of a random access timeline for a device with reduced capabilities as described herein. For example, communications manager 1020 may include bandwidth capability component 1025, random access component 1030, random access timing component 1035, or any combination thereof. Communications manager 1020 may be an example of various aspects of communications manager 920 as described herein. In some aspects, communications manager 1020 or its various components may be configured to perform various operations (e.g., receive, monitor, transmit) using or otherwise cooperating with receiver 1010, transmitter 1015, or both. For example, communications manager 1020 may receive information from receiver 1010, send information to transmitter 1015, or be integrated with receiver 1010, transmitter 1015, or both to obtain information, output information, or perform various other operations as described herein.

[0205] According to examples disclosed herein, a communication manager 1020 may support wireless communications at a first network node. A bandwidth capability component 1025 may be configured to or otherwise support means for receiving first information indicating bandwidth capabilities of a second network node. A random access component 1030 may be configured to or otherwise support means for receiving a first random access message. A random access timing component 1035 may be configured to or otherwise support means for sending a second random access message based on the first random access message and via a number of PRBs, the second random access message indicating a time period for transmitting a third random access message by the second network node in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capabilities of the second network node, and wherein the threshold time period is based on the number of PRBs.

[0206] Additionally or alternatively, according to examples as disclosed herein, the communication manager 1020 can support wireless communications at the first network node. The bandwidth capabilities component 1025 can be configured to or otherwise support means for transmitting first information indicating the bandwidth capabilities of the first network node. The random access component 1030 can be configured to or otherwise support means for transmitting a first random access message. The random access timing component 1035 can be configured to or otherwise support means for receiving a second random access message based on the first random access message and via a number of PRBs, the second random access message indicating a time period for transmitting a third random access message by the first network node in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capabilities of the first network node, and wherein the threshold time period is based on the number of PRBs. The random access component 1030 can be configured to or otherwise support means for transmitting the third random access message during a time window based on the time period.

[0207] Figure 11 A block diagram 1100 is shown of a communication manager 1120 that supports a random access timeline for reduced-capability devices in accordance with one or more aspects of the present disclosure. The communication manager 1120 may be an example of aspects of the communication manager 920, the communication manager 1020, or both, as described herein. The communication manager 1120 or its various components may be examples of means for performing various aspects of a random access timeline for reduced-capability devices as described herein. For example, the communication manager 1120 may include a bandwidth capability component 1125, a random access component 1130, a random access timing component 1135, a RAR component 1140, a contention resolution component 1145, a timing verification component 1150, or any combination thereof. Each of these components may communicate with each other directly or indirectly (e.g., via one or more buses), which may include communication within a protocol layer of a protocol stack, communication associated with a logical channel of the protocol stack (e.g., between protocol layers of the protocol stack, within a device, component, or virtualized component associated with the network entity 105, or between devices, components, or virtualized components associated with the network entity 105), or any combination thereof.

[0208] According to examples disclosed herein, a communication manager 1120 may support wireless communications at a first network node. A bandwidth capability component 1125 may be configured to or otherwise support means for receiving first information indicating bandwidth capabilities of a second network node. A random access component 1130 may be configured to or otherwise support means for receiving a first random access message. A random access timing component 1135 may be configured to or otherwise support means for sending a second random access message based on the first random access message and via a number of PRBs, the second random access message indicating a time period for transmitting a third random access message by the second network node in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capabilities of the second network node, and wherein the threshold time period is based on the number of PRBs.

[0209] In some aspects, random access component 1130 may be configured or otherwise support means for monitoring for a third random access message based on a time period.

[0210] In some aspects, the threshold period may be based on the first duration and the extension time. In some aspects, the first duration may be based on a processing time associated with the first random access message, and the extension time may be based on a number of PRBs.

[0211] In some aspects, the number of PRBs in the second random access message may be within a specific PRB number range, and the extension period may be based on the specific PRB number range. In some aspects, the specific PRB number range is selected from a set of multiple PRB number ranges within the system bandwidth. In some aspects, each PRB number range in the set of multiple PRB number ranges corresponds to a corresponding extension period.

[0212] In some aspects, one or more ranges in the set of multiple ranges are defined by a corresponding maximum number of PRBs and a corresponding minimum number of PRBs. In some aspects, each PRB number range in the set of multiple PRB number ranges includes the same number of PRBs, where the same number of PRBs represents a fraction of the total number of PRBs included in the set of multiple PRB number ranges.

[0213] In some aspects, the extension time is based on a difference between a number of PRBs in the second random access message and a threshold number. In some aspects, the extension time is constant based on the number of PRBs in the second random access message being greater than the threshold number.

[0214] In some aspects, the time period is based on a threshold time period. In some aspects, the time period is greater than or equal to the threshold time period.

[0215] In some aspects, to support sending a second random access message, the RAR component 1140 may be configured to or otherwise support means for sending a second random access message based on the first information and in response to the first random access message, wherein the second random access message is a RAR message indicating the time period and scheduling an uplink message, wherein the time period is used for transmission of the scheduled uplink message by the second network node, and wherein the third random access message is the scheduled uplink message.

[0216] In some aspects, to support sending a second random access message, the RAR component 1140 may be configured to or otherwise support means for sending a second random access message based on the first information and in response to the first random access message, wherein the second random access message is a RAR message indicating the time period and the random access preamble ID associated with the scheduled uplink message, wherein the time period is for transmitting a retransmission of a random access preamble by the second network node based on the random access preamble ID being different from the ID of the second network node, and wherein the first random access message may be a random access preamble and the third random access message is a retransmission of the random access preamble.

[0217] In some aspects, to support sending a second random access message, the RAR component 1140 may be configured to or otherwise support means for sending a second random access message based on the first information and in response to the first random access message, wherein the second random access message is a RAR message indicating a time period and success of the random access procedure, wherein the time period is used for transmitting a feedback message by the second network node in response to the RAR message, and wherein the third random access message is a feedback message.

[0218] In some aspects, to support sending a second random access message, the contention resolution component 1145 may be configured to or otherwise support means for sending a second random access message based on the first information and in response to the first random access message, wherein the second random access message is a downlink contention resolution random access message indicating the time period, wherein the time period is used for transmitting a feedback message by the second network node in response to the downlink contention resolution random access message, and wherein the third random access message is a feedback message.

[0219] In some aspects, the first random access message includes first information indicating bandwidth capabilities of the second network node. In some aspects, the bandwidth capabilities of the second network node include a reduced capability associated with a threshold number of PRBs processed by the second network node during a timeslot.

[0220] Additionally or alternatively, according to examples as disclosed herein, the communication manager 1120 can support wireless communications at the first network node. In some aspects, the bandwidth capabilities component 1125 can be configured to or otherwise support means for sending first information indicating the bandwidth capabilities of the first network node. In some aspects, the random access component 1130 can be configured to or otherwise support means for sending a first random access message. In some aspects, the random access timing component 1135 can be configured to or otherwise support means for receiving a second random access message based on the first random access message and via a number of PRBs, the second random access message indicating a time period for transmission of a third random access message by the first network node in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capabilities of the first network node, and wherein the threshold time period is based on the number of PRBs. In some aspects, the random access component 1130 can be configured to or otherwise support means for sending the third random access message during a time window based on the time period.

[0221] In some aspects, the timing verification component 1150 can be configured as or otherwise support means for determining, based on receipt of the second random access message, whether the time period is greater than a threshold time period associated with the bandwidth capabilities of the first network node, wherein transmission of the third random access message is based on the time period being greater than the threshold time period.

[0222] In some aspects, the threshold period is based on the first duration and the extension time. In some aspects, the first duration is based on a processing time associated with the first random access message, and the extension time is based on a number of PRBs.

[0223] In some aspects, the number of PRBs in the second random access message is within a specific PRB number range, and the extension period is based on the specific PRB number range. In some aspects, the specific PRB number range is selected from a set of multiple PRB number ranges within the system bandwidth. In some aspects, each PRB number range in the set of multiple PRB number ranges corresponds to a corresponding extension period.

[0224] In some aspects, one or more ranges in the set of multiple ranges are defined by a corresponding maximum number of PRBs and a corresponding minimum number of PRBs. In some aspects, each PRB number range in the set of multiple PRB number ranges includes the same number of PRBs, where the same number of PRBs represents a fraction of the total number of PRBs included in the set of multiple PRB number ranges.

[0225] In some aspects, the extension time is based on a difference between a number of PRBs in the second random access message and a threshold number. In some aspects, the extension time is constant based on the number of PRBs in the second random access message being greater than the threshold number.

[0226] In some aspects, to support receiving a second random access message, the RAR component 1140 may be configured to or otherwise support a means for receiving a second random access message based on the first information and in response to the first random access message, wherein the second random access message is a RAR message indicating the time period and scheduling an uplink message, wherein the time period is used for transmission of the scheduled uplink message by the first network node, and wherein the third random access message is the scheduled uplink message.

[0227] In some aspects, to support receiving a second random access message, the RAR component 1140 may be configured to or otherwise support means for receiving a second random access message based on the first information, wherein the second random access message is a RAR message indicating the time period and a random access preamble ID associated with the scheduled uplink message, wherein the time period is for transmission of a random access preamble by the first network node based on the random access preamble ID being different from an ID of the first network node, and wherein the third random access message is a random access preamble.

[0228] In some aspects, to support receiving a second random access message, the RAR component 1140 may be configured to or otherwise support means for receiving a second random access message based on the first information and in response to the first random access message, wherein the second random access message is a RAR message indicating a time period and a success of the random access procedure, wherein the time period is used for transmitting a feedback message by the first network node in response to the RAR message, and wherein the third random access message is a feedback message.

[0229] In some aspects, to support receiving a second random access message, the contention resolution component 1145 may be configured to or otherwise support a means for receiving a second random access message based on the first information and in response to the first random access message, wherein the second random access message is a downlink contention resolution random access message indicating the time period, wherein the time period is used for transmitting a feedback message by the first network node in response to the downlink contention resolution random access message, and wherein the third random access message is a feedback message.

[0230] In some aspects, the first random access message includes first information indicating bandwidth capabilities of the first network node. In some aspects, the bandwidth capabilities of the first network node include a reduced capability associated with a threshold number of PRBs processed by the first network node during a timeslot.

[0231] Figure 12 A diagram of a system 1200 including a device 1205 supporting a random access timeline for a reduced-capability device in accordance with one or more aspects of the present disclosure is shown. The device 1205 may be an example of or include components of a device 905, a device 1005, or a network entity 105 as described herein. The device 1205 may communicate with one or more network entities 105, one or more UEs 115, or any combination thereof, which may include communication via one or more wired interfaces, via one or more wireless interfaces, or any combination thereof. The device 1205 may include components that support outgoing and incoming communications, such as a communication manager 1220, a transceiver 1210, an antenna 1215, a memory 1225, code 1230, and a processor 1235. These components may be in electronic communication or otherwise coupled (e.g., operatively, communicatively, functionally, electronically, electrically) via one or more buses (e.g., bus 1240).

[0232] The transceiver 1210 can support bidirectional communication via a wired link, a wireless link, or both, as described herein. In some aspects, the transceiver 1210 may include a wired transceiver and can communicate bidirectionally with another wired transceiver. Additionally or alternatively, in some aspects, the transceiver 1210 may include a wireless transceiver and can communicate bidirectionally with another wireless transceiver. In some aspects, the device 1205 may include one or more antennas 1215 that are capable of sending or receiving wireless transmissions (e.g., concurrently). The transceiver 1210 may also include a modem for modulating signals, for providing modulated signals for transmission (e.g., via one or more antennas 1215, via a wired transmitter), for receiving modulated signals (e.g., from one or more antennas 1215, from a wired receiver), and for demodulating signals. In some implementations, the transceiver 1210 may include one or more interfaces, such as one or more interfaces coupled to one or more antennas 1215 configured to support various receiving or obtaining operations, or one or more interfaces coupled to one or more antennas 1215 configured to support various transmitting or outputting operations, or a combination thereof. In some implementations, the transceiver 1210 may include or be configured to be coupled to one or more processors or memory components operable to perform or support operations based on received or obtained information or signals, or operable to generate information or other signals for transmission or other output, or any combination thereof. In some implementations, the transceiver 1210, or the transceiver 1210 and one or more antennas 1215, or the transceiver 1210 and one or more antennas 1215 and one or more processors or memory components (e.g., processor 1235, memory 1225, or both) may be included in a chip or chip assembly installed in the device 1205. In some aspects, the transceiver may be operable to support communications via one or more communication links (eg, communication link 125, backhaul communication link 120, mid-range communication link 162, fronthaul communication link 168).

[0233] Memory 1225 may include random access memory (RAM) and read-only memory (ROM). Memory 1225 may store computer-readable, computer-executable code 1230, which includes instructions that, when executed by processor 1235, cause device 1205 to perform various functions described herein. Code 1230 may be stored in a non-transitory computer-readable medium (such as system memory or another type of memory). In some cases, code 1230 may not be directly executable by processor 1235, but may cause a computer (e.g., when compiled and executed) to perform the functions described herein. In some cases, memory 1225 may also contain a basic input / output (I / O) system (BIOS), which may control basic hardware or software operations, such as interaction with peripheral components or devices.

[0234] The processor 1235 may include an intelligent hardware device (e.g., a general-purpose processor, a DSP, an ASIC, a CPU, an FPGA, a microcontroller, a programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof). In some cases, the processor 1235 may be configured to operate a memory array using a memory controller. In some other cases, the memory controller may be integrated into the processor 1235. The processor 1235 may be configured to execute computer-readable instructions stored in a memory (e.g., memory 1225) to cause the device 1205 to perform various functions (e.g., functions or tasks supporting a random access timeline for a device with reduced capabilities). For example, the device 1205 or a component of the device 1205 may include a processor 1235 and a memory 1225 coupled to the processor 1235, the processor 1235 and the memory 1225 being configured to perform the various functions described herein. The processor 1235 may be an example of a cloud computing platform (e.g., one or more physical nodes and supporting software such as an operating system, virtual machine, or container instance) that can host functionality (e.g., by executing code 1230) to perform the functions of the device 1205. The processor 1235 may be any one or more suitable processors capable of executing scripts or instructions of one or more software programs stored in the device 1205 (e.g., within the memory 1225). In some implementations, the processor 1235 may be a component of a processing system. A processing system may generally refer to a system or series of machines or components that receives input and processes the input to produce a set of outputs (which may be passed to, for example, other systems or components of the device 1205). For example, the processing system of the device 1205 may refer to a system that includes various other components or subcomponents of the device 1205 (such as the processor 1235, or the transceiver 1210, or the communication manager 1220, or other components or combinations of components of the device 1205). The processing system of device 1205 can be interfaced with other components of device 1205 and can process information (such as input or signals) received from other components or output information to other components. For example, the chip or modem of device 1205 may include a processing system and one or more interfaces for outputting information, or for obtaining information, or both. The one or more interfaces may be implemented as or otherwise include a first interface configured to output information and a second interface configured to obtain information, or the same interface configured to output information and obtain information, as well as other implementations. In some implementations, the one or more interfaces may refer to an interface between the processing system of the chip or modem and a transmitter, so that device 1205 can send information output from the chip or modem.Additionally or alternatively, in some implementations, one or more interfaces may refer to an interface between a processing system of a chip or modem and a receiver, such that the device 1205 can obtain information or signal input and pass the information to the processing system. Those skilled in the art will readily recognize that a first interface can also obtain information or signal input, and a second interface can also output information or signal output.

[0235] In some aspects, bus 1240 may support communications for protocol layers of a protocol stack (e.g., within a protocol layer of a protocol stack). In some aspects, bus 1240 may support communications associated with logical channels of a protocol stack (e.g., between protocol layers of a protocol stack), which may include communications performed within components of device 1205 or between different components of device 1205 that may be co-located or located in different locations (e.g., where device 1205 may refer to a system in which one or more of communication manager 1220, transceiver 1210, memory 1225, code 1230, and processor 1235 may be located in one of the different components or divided between the different components).

[0236] In some aspects, the communications manager 1220 can manage aspects of communications with the core network 130 (e.g., via one or more wired or wireless backhaul links). For example, the communications manager 1220 can manage the transmission of data communications for client devices, such as one or more UEs 112. In some aspects, the communications manager 1220 can manage communications with other network entities 105 and can include a controller or scheduler for controlling communications with the UEs 112 in cooperation with the other network entities 105. In some aspects, the communications manager 1220 can support an X2 interface within an LTE / LTE-A wireless communication network technology to provide communications between network entities 105.

[0237] According to examples disclosed herein, the communication manager 1220 may support wireless communication at a first network node. For example, the communication manager 1220 may be configured to or otherwise support means for receiving first information indicating bandwidth capabilities of a second network node. The communication manager 1220 may be configured to or otherwise support means for receiving a first random access message. The communication manager 1220 may be configured to or otherwise support means for sending a second random access message based on the first random access message and via a number of PRBs, the second random access message indicating a time period for transmitting a third random access message by the second network node in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capabilities of the second network node, and wherein the threshold time period is based on the number of PRBs.

[0238] Additionally or alternatively, according to examples as disclosed herein, the communication manager 1220 may support wireless communications at the first network node. For example, the communication manager 1220 may be configured to or otherwise support means for sending first information indicating the bandwidth capabilities of the first network node. The communication manager 1220 may be configured to or otherwise support means for sending a first random access message. The communication manager 1220 may be configured to or otherwise support means for receiving a second random access message based on the first random access message and via a number of PRBs, the second random access message indicating a time period for transmitting a third random access message by the first network node in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capabilities of the first network node, and wherein the threshold time period is based on the number of PRBs. The communication manager 1220 may be configured to or otherwise support means for sending the third random access message during a time window based on the time period.

[0239] By including or configuring the communication manager 1220 according to examples as described herein, the device 1205 can support techniques for improving communication reliability, reducing latency, reducing power consumption, more efficiently utilizing communication resources, and improving coordination between devices.

[0240] In some aspects, the communication manager 1220 can be configured to perform various operations (e.g., receive, obtain, monitor, output, transmit) using or in cooperation with the transceiver 1210, one or more antennas 1215 (e.g., where applicable), or any combination thereof. Although the communication manager 1220 is shown as a separate component, in some aspects, one or more functions described with reference to the communication manager 1220 can be supported or performed by the transceiver 1210, the processor 1235, the memory 1225, the code 1230, or any combination thereof. For example, the code 1230 can include instructions executable by the processor 1235 to cause the device 1205 to perform various aspects of the random access timeline for reduced-capability devices as described herein, or the processor 1235 and the memory 1225 can be otherwise configured to perform or support such operations.

[0241] Figure 13A diagram of a system 1300 including a device 1305 supporting a random access timeline for reduced-capability devices in accordance with one or more aspects of the present disclosure is shown. Device 1305 may be an example of, or include components of, device 905, device 1005, or UE 115 as described herein. Device 1305 may communicate (e.g., wirelessly) with one or more network entities 105, one or more UEs 115, or any combination thereof. Device 1305 may include components for two-way voice and data communications, including components for sending and receiving communications, such as a communications manager 1320, an I / O controller 1310, a transceiver 1315, an antenna 1325, a memory 1330, code 1335, and a processor 1340. These components may be in electronic communication or otherwise coupled (e.g., operatively, communicatively, functionally, electronically, electrically) via one or more buses (e.g., bus 1345).

[0242] I / O controller 1310 can manage input and output signals for device 1305. I / O controller 1310 can also manage peripheral devices that are not integrated into device 1305. In some cases, I / O controller 1310 can represent a physical connection or port to an external peripheral device. In some cases, I / O controller 1310 can utilize a computer such as , or another known operating system. Additionally or alternatively, I / O controller 1310 may represent or interact with a modem, keyboard, mouse, touch screen, or similar device. In some cases, I / O controller 1310 may be implemented as part of a processor (such as processor 1340). In some cases, a user may interact with device 1305 via I / O controller 1310 or via hardware components controlled by I / O controller 1310.

[0243] In some cases, the device 1305 may include a single antenna 1325. However, in some other cases, the device 1305 may have more than one antenna 1325 that can simultaneously transmit or receive multiple wireless transmissions. The transceiver 1315 can communicate bidirectionally via one or more antennas 1325, wired, or wireless links as described herein. For example, the transceiver 1315 can represent a wireless transceiver and can communicate bidirectionally with another wireless transceiver. The transceiver 1315 can also include a modem for modulating packets, providing the modulated packets to one or more antennas 1325 for transmission, and demodulating packets received from the one or more antennas 1325. The transceiver 1315 or the transceiver 1315 and one or more antennas 1325 can be examples of transmitter 915, transmitter 1015, receiver 910, receiver 1010, or any combination thereof, or components thereof, as described herein.

[0244] Memory 1330 may include RAM and ROM. Memory 1330 may store computer-readable, computer-executable code 1335, which includes instructions that, when executed by processor 1340, cause device 1305 to perform various functions described herein. Code 1335 may be stored in a non-transitory computer-readable medium (such as system memory or other types of memory). In some cases, code 1335 may not be directly executable by processor 1340, but may cause a computer (e.g., when compiled and executed) to perform the functions described herein. In some cases, memory 1330 may also contain, among other things, a BIOS that may control basic hardware or software operations, such as interaction with peripheral components or devices.

[0245] The processor 1340 may include an intelligent hardware device (e.g., a general-purpose processor, a DSP, a CPU, a microcontroller, an ASIC, an FPGA, a programmable logic device, a discrete gate or transistor logic component, a discrete hardware component, or any combination thereof). In some cases, the processor 1340 may be configured to operate a memory array using a memory controller. In some other cases, the memory controller may be integrated into the processor 1340. The processor 1340 may be configured to execute computer-readable instructions stored in a memory (e.g., memory 1330) to cause the device 1305 to perform various functions (e.g., functions or tasks supporting a random access timeline for a device with reduced capabilities). For example, the device 1305 or a component of the device 1305 may include a processor 1340 and a memory 1330 coupled to or coupled to the processor 1340, the processor 1340 and the memory 1330 being configured to perform the various functions described herein.

[0246] According to examples disclosed herein, the communication manager 1320 may support wireless communication at a first network node. For example, the communication manager 1320 may be configured to or otherwise support means for receiving first information indicating bandwidth capabilities of a second network node. The communication manager 1320 may be configured to or otherwise support means for receiving a first random access message. The communication manager 1320 may be configured to or otherwise support means for sending a second random access message based on the first random access message and via a number of PRBs, the second random access message indicating a time period for the second network node to transmit a third random access message in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capabilities of the second network node, and wherein the threshold time period is based on the number of PRBs.

[0247] Additionally or alternatively, according to examples as disclosed herein, the communication manager 1320 may support wireless communications at the first network node. For example, the communication manager 1320 may be configured to or otherwise support means for sending first information indicating the bandwidth capabilities of the first network node. The communication manager 1320 may be configured to or otherwise support means for sending a first random access message. The communication manager 1320 may be configured to or otherwise support means for receiving a second random access message based on the first random access message and via a number of PRBs, the second random access message indicating a time period for the first network node to transmit a third random access message in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capabilities of the first network node, and wherein the threshold time period is based on the number of PRBs. The communication manager 1320 may be configured to or otherwise support means for sending the third random access message during a time window based on the time period.

[0248] By including or configuring the communication manager 1320 according to examples as described herein, the device 1305 can support techniques for improving communication reliability, reducing latency, reducing power consumption, more efficiently utilizing communication resources, and improving coordination between devices.

[0249] In some aspects, the communication manager 1320 can be configured to perform various operations (e.g., receive, monitor, transmit) using or in cooperation with the transceiver 1315, one or more antennas 1325, or any combination thereof. Although the communication manager 1320 is shown as a separate component, in some aspects, one or more functions described with reference to the communication manager 1320 can be supported or performed by the processor 1340, the memory 1330, the code 1335, or any combination thereof. For example, the code 1335 can include instructions executable by the processor 1340 to cause the device 1305 to perform various aspects of the random access timeline for reduced-capability devices as described herein, or the processor 1340 and the memory 1330 can be otherwise configured to perform or support such operations.

[0250] Figure 14 A flow chart illustrating a method 1400 for supporting a random access timeline for a device with reduced capabilities according to one or more aspects of the present disclosure is shown. The operations of the method 1400 may be implemented by a network entity or UE or components thereof as described herein. For example, the operations of the method 1400 may be implemented by a network entity or UE or components thereof as described herein. Figures 1 to 13 The described functions may be performed by a network entity or UE 115. In some aspects, the network entity or UE may execute an instruction set to control functional units of the network entity or UE to perform the described functions. Additionally or alternatively, the network entity or UE may use dedicated hardware to perform various aspects of the described functions.

[0251] At 1405, the method may include receiving first information indicating bandwidth capabilities of the second network node. The operations of 1405 may be performed according to examples disclosed herein. In some aspects, aspects of the operations of 1405 may be performed as described with reference to Figure 11 The bandwidth capability component 1125 described above is executed.

[0252] At 1410, the method may include receiving a first random access message. The operations of 1410 may be performed according to examples disclosed herein. In some aspects, aspects of the operations of 1410 may be performed as described with reference to Figure 11 The random access component 1130 described above is performed.

[0253] At 1415, the method may include: sending a second random access message based on the first random access message and via the number of PRBs, the second random access message indicating a time period for the second network node to transmit a third random access message in response to the second random access message, wherein the time period is based on a threshold time period associated with a bandwidth capability of the second network node, and wherein the threshold time period is based on the number of PRBs. The operations of 1415 may be performed according to examples as disclosed herein. In some aspects, aspects of the operations of 1415 may be performed as described with reference to Figure 11 The random access timing component 1135 described above is performed.

[0254] Figure 15 A flow chart illustrating a method 1500 for supporting a random access timeline for a device with reduced capabilities according to one or more aspects of the present disclosure is shown. The operations of the method 1500 may be implemented by a network entity or a UE or components thereof as described herein. For example, the operations of the method 1500 may be implemented by a network entity or a UE or components thereof as described herein. Figures 1 to 13 The described functions may be performed by a network entity or UE 115. In some aspects, the network entity or UE may execute an instruction set to control functional units of the network entity or UE to perform the described functions. Additionally or alternatively, the network entity or UE may use dedicated hardware to perform various aspects of the described functions.

[0255] At 1505, the method may include receiving first information indicating bandwidth capabilities of a second network node. The operations of 1505 may be performed according to examples disclosed herein. In some aspects, aspects of the operations of 1505 may be performed as described with reference to Figure 11 The bandwidth capability component 1125 described above is executed.

[0256] At 1510, the method may include receiving a first random access message. The operations of 1510 may be performed according to examples as disclosed herein. In some aspects, aspects of the operations of 1510 may be as described with reference to Figure 11 The random access component 1130 described above is performed.

[0257] At 1515, the method may include: sending a second random access message based on the first random access message and via the number of PRBs, the second random access message indicating a time period for transmitting a third random access message by the second network node in response to the second random access message, wherein the time period is based on a threshold time period associated with a bandwidth capability of the second network node, and wherein the threshold time period is based on the number of PRBs. The operations of 1515 may be performed according to examples as disclosed herein. In some aspects, aspects of the operations of 1515 may be performed as described with reference to Figure 11 The random access timing component 1135 described above is performed.

[0258] At 1520, the method may include monitoring a third random access message based on a time period. The operations of 1520 may be performed according to examples disclosed herein. In some aspects, aspects of the operations of 1520 may be as described with reference to Figure 11 The random access component 1130 described above is performed.

[0259] Figure 16 A flow chart illustrating a method 1600 for supporting a random access timeline for a device with reduced capabilities according to one or more aspects of the present disclosure is shown. The operations of the method 1600 may be implemented by a network entity or UE or components thereof as described herein. For example, the operations of the method 1600 may be implemented by a network entity or UE or components thereof as described herein. Figures 1 to 13 The described functions may be performed by a network entity or UE 115. In some aspects, the network entity or UE may execute an instruction set to control functional units of the network entity or UE to perform the described functions. Additionally or alternatively, the network entity or UE may use dedicated hardware to perform various aspects of the described functions.

[0260] At 1605, the method may include receiving first information indicating bandwidth capabilities of the second network node. The operations of 1605 may be performed according to examples disclosed herein. In some aspects, aspects of the operations of 1605 may be performed as described with reference to Figure 11 The bandwidth capability component 1125 described above is executed.

[0261] At 1610, the method may include receiving a first random access message. The operations of 1610 may be performed according to examples as disclosed herein. In some aspects, aspects of the operations of 1610 may be as described with reference to Figure 11 The random access component 1130 described above is performed.

[0262] At 1615, the method may include: sending a second random access message in response to the first random access message and based on the first information and via the number of PRBs, wherein the second random access message is a RAR message that schedules an uplink message and indicates a time period for transmission of the scheduled uplink message by the second network node, wherein the time period is based on a threshold time period associated with a bandwidth capability of the second network node, and wherein the threshold time period is based on the number of PRBs. The operations of 1615 may be performed according to examples as disclosed herein. In some aspects, aspects of the operations of 1615 may be performed as described with reference to Figure 11 The RAR component 1140 described here is executed.

[0263] Figure 17A flow chart illustrating a method 1700 for supporting a random access timeline for a device with reduced capabilities according to one or more aspects of the present disclosure is shown. The operations of the method 1700 may be implemented by a network entity or UE or components thereof as described herein. For example, the operations of the method 1700 may be implemented by a network entity or UE or components thereof as described herein. Figures 1 to 13 The described functions may be performed by a network entity or UE 115. In some aspects, the network entity or UE may execute an instruction set to control functional units of the network entity or UE to perform the described functions. Additionally or alternatively, the network entity or UE may use dedicated hardware to perform various aspects of the described functions.

[0264] At 1705, the method may include sending first information indicating bandwidth capabilities of the first network node. The operations of 1705 may be performed according to examples disclosed herein. In some aspects, aspects of the operations of 1705 may be performed as described with reference to Figure 11 The bandwidth capability component 1125 described above is executed.

[0265] At 1710, the method may include sending a first random access message. The operations of 1710 may be performed according to examples as disclosed herein. In some aspects, aspects of the operations of 1710 may be as described with reference to Figure 11 The random access component 1130 described above is performed.

[0266] At 1715, the method may include receiving a second random access message based on the first random access message and via the number of PRBs, the second random access message indicating a time period for transmitting a third random access message by the first network node in response to the second random access message, wherein the time period is based on a threshold time period associated with a bandwidth capability of the first network node, and wherein the threshold time period is based on the number of PRBs. The operations of 1715 may be performed according to examples as disclosed herein. In some aspects, aspects of the operations of 1715 may be performed as described with reference to Figure 11 The random access timing component 1135 described above is performed.

[0267] At 1720, the method may include sending a third random access message during a time window based on a time period. The operations of 1720 may be performed according to examples as disclosed herein. In some aspects, aspects of the operations of 1720 may be as described with reference to Figure 11 The random access component 1130 described above is performed.

[0268] Figure 18A flow chart illustrating a method 1800 for supporting a random access timeline for a device with reduced capabilities according to one or more aspects of the present disclosure is shown. The operations of the method 1800 may be implemented by a network entity or UE or components thereof as described herein. For example, the operations of the method 1800 may be implemented by a network entity or UE or components thereof as described herein. Figures 1 to 13 The described functions may be performed by a network entity or UE 115. In some aspects, the network entity or UE may execute an instruction set to control functional units of the network entity or UE to perform the described functions. Additionally or alternatively, the network entity or UE may use dedicated hardware to perform various aspects of the described functions.

[0269] At 1805, the method may include sending first information indicating bandwidth capabilities of the first network node. The operations of 1805 may be performed according to examples disclosed herein. In some aspects, aspects of the operations of 1805 may be performed as described with reference to Figure 11 The bandwidth capability component 1125 described above is executed.

[0270] At 1810, the method may include sending a first random access message. The operations of 1810 may be performed according to examples disclosed herein. In some aspects, aspects of the operations of 1810 may be as described with reference to Figure 11 The random access component 1130 described above is performed.

[0271] At 1815, the method may include receiving a second random access message based on the first random access message and via the number of PRBs, the second random access message indicating a time period for transmitting a third random access message by the first network node in response to the second random access message, wherein the time period is based on a threshold time period associated with a bandwidth capability of the first network node, and wherein the threshold time period is based on the number of PRBs. The operations of 1815 may be performed according to examples as disclosed herein. In some aspects, aspects of the operations of 1815 may be performed as described with reference to Figure 11 The random access timing component 1135 described above is performed.

[0272] At 1820, the method may include determining, based on receiving the second random access message, whether the time period is greater than a threshold time period associated with the bandwidth capability of the first network node. The operations of 1820 may be performed according to examples disclosed herein. In some aspects, aspects of the operations of 1820 may be as described with reference to Figure 11 The timing verification component 1150 described above is performed.

[0273] At 1825, the method may include: transmitting a third random access message during a time window based on a time period, wherein the transmission of the third random access message is based on the time period being greater than a threshold time period. The operations of 1825 may be performed according to examples disclosed herein. In some aspects, aspects of the operations of 1825 may be performed as described with reference to Figure 11 The random access component 1130 described above is performed.

[0274] The following provides an overview of various aspects of the disclosure:

[0275] Aspect 1: A method for wireless communication at a first network node, comprising: receiving first information indicating bandwidth capabilities of a second network node; receiving a first random access message; and sending a second random access message based on the first random access message and via a number of PRBs, the second random access message indicating a time period for transmitting a third random access message by the second network node in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capabilities of the second network node, and wherein the threshold time period is based on the number of PRBs.

[0276] Aspect 2: The method according to aspect 1 further includes: monitoring the third random access message based on the time period.

[0277] Aspect 3: A method according to any one of Aspects 1 to 2, wherein the threshold time period is based on a first duration and an extension time, the first duration is based on a processing time associated with the first random access message, and the extension time is based on the number of PRBs.

[0278] Aspect 4: The method according to aspect 3, wherein the number of PRBs of the second random access message is within a specific PRB number range, and the extension time is based on the specific PRB number range.

[0279] Aspect 5: The method according to aspect 4, wherein the specific PRB number range is from a plurality of PRB number ranges within a system bandwidth, and each PRB number range in the plurality of PRB number ranges corresponds to a corresponding extension time.

[0280] Aspect 6: The method according to aspect 5, wherein one or more ranges of the plurality of ranges are defined by a corresponding maximum number of PRBs and a corresponding minimum number of PRBs.

[0281] Aspect 7: The method according to aspect 5, wherein each of the multiple PRB number ranges includes the same number of PRBs, and the same number of PRBs represents a fraction of the total number of PRBs included in the multiple PRB number ranges.

[0282] Aspect 8: The method according to aspect 3, wherein the extension time is based on a difference between the number of PRBs of the second random access message and a threshold number.

[0283] Aspect 9: The method according to aspect 3, wherein, based on the number of PRBs in the second random access message being greater than a threshold number, the extension time is constant.

[0284] Aspect 10: The method according to any one of aspects 3 to 9, wherein the time period is based on the threshold time period, and the time period is greater than or equal to the threshold time period.

[0285] Aspect 11: A method according to any one of Aspects 1 to 10, wherein sending the second random access message includes: sending the second random access message based on the first information and in response to the first random access message, wherein the second random access message is a RAR message indicating the time period and scheduling an uplink message, wherein the time period is used for transmission of the scheduled uplink message by the second network node, and wherein the third random access message is the scheduled uplink message.

[0286] Aspect 12: A method according to any one of Aspects 1 to 10, wherein sending the second random access message includes: sending the second random access message based on the first information and in response to the first random access message, wherein the second random access message is a RAR message indicating the time period and a random access preamble ID associated with the scheduled uplink message, wherein the time period is used by the second network node to transmit a retransmission of a random access preamble based on an identifier that is different from the random access preamble ID of the second network node, and wherein the first random access message is the random access preamble, and the third random access message is the retransmission of the random access preamble.

[0287] Aspect 13: A method according to any one of Aspects 1 to 10, wherein sending the second random access message includes: sending the second random access message based on the first information and in response to the first random access message, wherein the second random access message is a RAR message indicating the time period and the success of the random access procedure, wherein the time period is used by the second network node to transmit a feedback message in response to the RAR message, and wherein the third random access message is the feedback message.

[0288] Aspect 14: A method according to any one of Aspects 1 to 10, wherein sending the second random access message includes: sending the second random access message based on the first information and in response to the first random access message, wherein the second random access message is a downlink contention resolution random access message indicating the time period, wherein the time period is used by the second network node to transmit a feedback message in response to the downlink contention resolution random access message, and wherein the third random access message is the feedback message.

[0289] Aspect 15: The method according to any one of aspects 1 to 14, wherein the first random access message includes first information indicating the bandwidth capability of the second network node.

[0290] Aspect 16: The method according to any one of aspects 1 to 15, wherein the bandwidth capability of the second network node comprises a reduced capability associated with a threshold number of PRBs processed by the second network node during a time slot.

[0291] Aspect 17: A method for wireless communication at a first network node, comprising: sending first information indicating the bandwidth capability of the first network node; sending a first random access message; receiving a second random access message based on the first random access message and via a number of PRBs, the second random access message indicating a time period for transmitting a third random access message by the first network node in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capability of the first network node, and wherein the threshold time period is based on the number of PRBs; and sending the third random access message during a time window based on the time period.

[0292] Aspect 18: The method according to Aspect 17 further includes: determining whether the time period is greater than the threshold time period associated with the bandwidth capability of the first network node based on reception of the second random access message, wherein the transmission of the third random access message is based on the time period being greater than the threshold time period.

[0293] Aspect 19: A method according to any one of Aspects 17 to 18, wherein the threshold time period is based on a first duration and an extension time, the first duration is based on a processing time associated with the first random access message, and the extension time is based on the number of PRBs.

[0294] Aspect 20: The method according to aspect 19, wherein the number of PRBs of the second random access message is within a specific PRB number range, and the extension time is based on the specific PRB number range.

[0295] Aspect 21: The method according to aspect 20, wherein the specific PRB number range is from a plurality of PRB number ranges within a system bandwidth, and each PRB number range in the plurality of PRB number ranges corresponds to a corresponding extension time.

[0296] Aspect 22: The method according to aspect 21, wherein one or more ranges of the plurality of ranges are defined by a corresponding maximum number of PRBs and a corresponding minimum number of PRBs.

[0297] Aspect 23: The method according to aspect 21, wherein each of the multiple PRB number ranges includes a same number of PRBs, and the same number of PRBs represents a fraction of the total number of PRBs included in the multiple PRB number ranges.

[0298] Aspect 24: The method according to aspect 19, wherein the extension time is based on a difference between the number of PRBs of the second random access message and a threshold number.

[0299] Aspect 25: The method according to aspect 19, wherein, based on the number of PRBs of the second random access message being greater than a threshold number, the extension time is constant.

[0300] Aspect 26: A method according to any one of Aspects 17 to 25, wherein receiving the second random access message includes: receiving the second random access message based on the first information and in response to the first random access message, wherein the second random access message is a RAR message indicating the time period and scheduling an uplink message, wherein the time period is used for transmitting the scheduled uplink message by the first network node, and wherein the third random access message is the scheduled uplink message.

[0301] Aspect 27: A method according to any one of Aspects 17 to 25, wherein receiving the second random access message includes: receiving the second random access message based on the first information, wherein the second random access message is a RAR message indicating the time period and a random access preamble ID associated with the scheduled uplink message, wherein the time period is used by the first network node to transmit a random access preamble based on the random access preamble ID being different from the ID of the first network node, and wherein the third random access message is the random access preamble.

[0302] Aspect 28: A method according to any one of Aspects 17 to 25, wherein receiving the second random access message includes: receiving the second random access message based on the first information and in response to the first random access message, wherein the second random access message is a RAR message indicating the time period and the success of the random access procedure, wherein the time period is used by the first network node to transmit a feedback message in response to the RAR message, and wherein the third random access message is the feedback message.

[0303] Aspect 29: A method according to any one of Aspects 17 to 25, wherein receiving the second random access message includes: receiving the second random access message based on the first information and in response to the first random access message, wherein the second random access message is a downlink contention resolution random access message indicating the time period, wherein the time period is used by the first network node to transmit a feedback message in response to the downlink contention resolution random access message, and wherein the third random access message is the feedback message.

[0304] Aspect 30: The method according to any one of aspects 17 to 29, wherein the first random access message includes first information indicating the bandwidth capability of the first network node.

[0305] Aspect 31: The method according to any one of aspects 17 to 30, wherein the bandwidth capability of the first network node comprises a reduced capability associated with a threshold number of PRBs processed by the first network node during a time slot.

[0306] Aspect 32: A first network node for wireless communication, comprising: a memory; and at least one processor coupled to the memory, wherein the at least one processor is configured to perform the method according to any one of aspects 1 to 16.

[0307] Aspect 33: An apparatus for wireless communication at a first network node, comprising: at least one unit for performing the method according to any one of aspects 1 to 16.

[0308] Aspect 34: A non-transitory computer-readable medium storing code for wireless communication at a first network node, the code comprising instructions executable by a processor to perform the method according to any one of aspects 1 to 16.

[0309] Aspect 35: A first network node for wireless communication, comprising: a memory; and at least one processor coupled to the memory, wherein the at least one processor is configured to perform the method according to any one of aspects 17 to 31.

[0310] Aspect 36: An apparatus for wireless communication at a first network node, comprising: at least one means for performing the method according to any one of aspects 17 to 31.

[0311] Aspect 37: A non-transitory computer-readable medium storing code for wireless communication at a first network node, the code comprising instructions executable by a processor to perform the method according to any one of aspects 17 to 31.

[0312] The methods described herein describe possible implementations, and the operations and steps may be rearranged or otherwise modified, and other implementations are possible. Additionally, aspects from two or more methods may be combined.

[0313] Although aspects of LTE, LTE-A, LTE-A Pro, or NR systems may be described for example purposes, and LTE, LTE-A, LTE-A Pro, or NR terminology may be used throughout much of the description, the techniques described herein are applicable beyond LTE, LTE-A, LTE-A Pro, or NR networks. For example, the techniques described may be applicable to various other wireless communication systems, such as Ultra Mobile Broadband (UMB), Institute of Electrical and Electronics Engineers (IEEE) 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, Flash-OFDM, and other systems and radio technologies not explicitly mentioned herein.

[0314] The information and signals described herein may be represented using any of a variety of different techniques and methods. For example, data, instructions, commands, information, signals, bits, symbols, and chips mentioned throughout the description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.

[0315] The various illustrative blocks and components described in conjunction with the disclosure herein may be implemented or executed using a general purpose processor, a DSP, an ASIC, a CPU, an FPGA or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices (e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, a combination of one or more microprocessors and a DSP core, or any other such configuration).

[0316] The functions described herein may be implemented using hardware, software executed by a processor, firmware, or any combination thereof. If implemented using software executed by a processor, the functions may be stored as or transmitted using one or more instructions or code on a computer-readable medium. Other examples and implementations are within the scope of this disclosure and the claims. For example, due to the nature of software, the functions described herein may be implemented using software executed by a processor, hardware, firmware, hardwiring, or a combination of any of these. Features that implement the functions may also be physically located at various locations, including being distributed so that portions of the functions are implemented at different physical locations.

[0317] Computer readable medium includes non-transient computer storage medium and communication medium, and communication medium includes any medium that promotes the transmission of computer program from one location to another location.Non-transient storage medium can be any available medium that can be accessed by general-purpose computer or special-purpose computer.By way of example and not limitation, non-transient computer readable medium can include RAM, ROM, electrically erasable programmable ROM (EEPROM), flash memory, compact disc (CD) ROM or other optical disc storage, disk storage or other magnetic storage device or can be used for carrying or storing desired program code unit and any other non-transient medium that can be accessed by general-purpose or special-purpose computer or general or special-purpose processor in the form of instruction or data structure.In addition, any connection is suitably referred to as computer readable medium.For example, if software is to be sent from website, server or other remote source using coaxial cable, optical fiber cable, twisted pair, digital subscriber line (DSL) or wireless technology such as infrared, radio and microwave, then coaxial cable, optical fiber cable, twisted pair, DSL or wireless technology such as infrared, radio and microwave are included in the definition of computer readable medium. As used herein, disks and optical discs include CDs, laser discs, optical discs, digital versatile discs (DVDs), floppy disks, and Blu-ray discs. Disks can copy data magnetically, while optical discs can copy data optically using lasers. Combinations of the above are also included within the scope of computer-readable media.

[0318] As used herein, the term "or" is an inclusive "or" unless limiting language is used with respect to the listed alternatives. For example, a reference to "X is based on A or B" should be interpreted as including within its scope X is based on A, X is based on B, and X is based on A and B. In this regard, a reference to "X is based on A or B" means "at least one of A or B" or "one or more of A or B" due to the inclusive nature of "or". Similarly, a reference to "X is based on A, B, or C" should be interpreted as including within its scope X is based on A, X is based on B, X is based on C, X is based on A and B, X is based on A and C, X is based on B and C, and X is based on A, B, and C. In this regard, a reference to "X is based on A, B, or C" means "at least one of A, B, or C" or "one or more of A, B, or C" due to the inclusive nature of "or". As an example of limiting language, a reference to "X is based on only one of A or B" should be interpreted as including within its scope X is based on A and X is based on B, but not X is based on A and B. Furthermore, as used herein, the phrase "based on" should not be interpreted as a reference to a closed set of information, one or more conditions, one or more factors, etc. In other words, the phrase "based on A" (where "A" can be information, a condition, a factor, etc.) should be interpreted as "based on at least A" unless specifically stated otherwise. Furthermore, as used herein, the phrase "set" should be interpreted to include the possibility of a set having one member. That is, the phrase "set" should be interpreted in the same manner as "one or more" or "at least one."

[0319] The terms "determine" or "determining" include a wide variety of actions, and thus, "determining" may include calculating, computing, processing, deriving, investigating, looking up (e.g., via looking up in a table, a database, or another data structure), ascertaining, etc. Furthermore, "determining" may include receiving (e.g., receiving information), accessing (e.g., accessing data in a memory), etc. Furthermore, "determining" may include resolving, obtaining, selecting, choosing, establishing, and other such similar actions.

[0320] In the accompanying drawings, similar components or features may have the same reference number. In addition, various components of the same type may be distinguished by following the reference number with a dash and a second reference number to distinguish between similar components. If only the first reference number is used in the specification, the description applies to any one of the similar components having the same first reference number, regardless of the second reference number or other subsequent reference numbers.

[0321] The descriptions set forth herein in conjunction with the accompanying drawings describe example configurations and do not represent all examples that can be implemented or within the scope of the claims. The terms "aspect" or "example" used herein mean "serving as an aspect, example, instance, or illustration," rather than "preferred" or "having advantages over other aspects." For the purpose of providing an understanding of the described techniques, the detailed description includes specific details. However, these techniques can be implemented without these specific details. In some cases, structures and devices are shown in block diagram form to avoid obscuring the concepts of the described examples.

[0322] The description herein is provided to enable one of ordinary skill in the art to implement or use the present disclosure. Various modifications to the present disclosure will be readily apparent to one of ordinary skill in the art, and the overall principles defined herein may be applied to other variations without departing from the scope of the present disclosure. Therefore, the present disclosure is not limited to the examples and designs described herein, but is intended to be used in the widest possible manner consistent with the principles and novel features disclosed herein.

Claims

1. A first network node for wireless communication, comprising: Memory; as well as at least one processor coupled to the memory, wherein the at least one processor is configured to: receiving first information indicating bandwidth capabilities of a second network node; receiving a first random access message; and A second random access message is sent based on the first random access message and via a number of physical resource blocks, the second random access message indicating a time period for transmitting a third random access message by the second network node in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capability of the second network node, and wherein the threshold time period is based on the number of physical resource blocks.

2. The first network node according to claim 1, wherein: The at least one processor is further configured to: The third random access message is monitored based on the time period.

3. The first network node according to claim 1, wherein: The threshold period is based on a first duration and an extension time, the first duration being based on a processing time associated with the first random access message, and the extension time being based on the number of physical resource blocks. The first network node according to claim 3 , wherein: The number of physical resource blocks of the second random access message is within a specific range of the number of physical resource blocks, and the extension time is based on the specific range of the number of physical resource blocks.

5. The first network node according to claim 4, wherein: The specific physical resource block number range is from a plurality of physical resource block number ranges within a system bandwidth, and each physical resource block number range in the plurality of physical resource block number ranges corresponds to a corresponding extended time. The first network node according to claim 5 , wherein: One or more ranges of the plurality of ranges are defined by a respective maximum number of physical resource blocks and a respective minimum number of physical resource blocks.

7. The first network node according to claim 5, wherein: Each of the plurality of physical resource block number ranges includes a same number of physical resource blocks, and the same number of physical resource blocks represents a fraction of a total number of physical resource blocks included in the plurality of physical resource block number ranges.

8. The first network node according to claim 3, wherein: The extension time is based on a difference between the number of physical resource blocks of the second random access message and a threshold number.

9. The first network node according to claim 3, wherein: Based on the number of the physical resource blocks in the second random access message being greater than a threshold number, the extension time is constant.

10. The first network node according to claim 3, wherein: The time period is based on the threshold time period, and the time period is greater than or equal to the threshold time period.

11. The first network node according to claim 1, wherein: To send the second random access message, the at least one processor is configured to: The second random access message is sent based on the first information and in response to the first random access message, wherein the second random access message is a random access response message indicating the time period for transmission of the scheduled uplink message by the second network node and scheduling an uplink message, wherein the time period is used for transmission of the scheduled uplink message by the second network node, and wherein the third random access message is the scheduled uplink message.

12. The first network node according to claim 1, wherein: To send the second random access message, the at least one processor is configured to: The second random access message is sent based on the first information and in response to the first random access message, wherein the second random access message is a random access response message indicating the time period and a random access preamble identifier associated with the scheduled uplink message, wherein the time period is used for transmitting a retransmission of a random access preamble by the second network node based on the random access preamble identifier being different from an identifier of the second network node, and wherein the first random access message is the random access preamble and the third random access message is the retransmission of the random access preamble.

13. The first network node according to claim 1, wherein: To send the second random access message, the at least one processor is configured to: The second random access message is sent based on the first information and in response to the first random access message, wherein the second random access message is a random access response message indicating the time period and success of the random access procedure, wherein the time period is used for transmitting a feedback message by the second network node in response to the random access response message, and wherein the third random access message is the feedback message.

14. The first network node according to claim 1, wherein: To send the second random access message, the at least one processor is configured to: The second random access message is sent based on the first information and in response to the first random access message, wherein the second random access message is a downlink contention resolution random access message indicating the time period, wherein the time period is used for transmitting a feedback message by the second network node in response to the downlink contention resolution random access message, and wherein the third random access message is the feedback message.

15. The first network node according to claim 1, wherein: The first random access message includes first information indicating the bandwidth capability of the second network node.

16. The first network node according to claim 1, wherein: The bandwidth capability of the second network node comprises a reduced capability associated with a threshold number of physical resource blocks processed by the second network node during a time slot.

17. A first network node for wireless communication, comprising: Memory; as well as at least one processor coupled to the memory, wherein the at least one processor is configured to: sending first information indicating bandwidth capabilities of the first network node; Sending a first random access message; receiving a second random access message based on the first random access message and via a number of physical resource blocks, the second random access message indicating a time period for transmission of a third random access message by the first network node in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capabilities of the first network node, and wherein the threshold time period is based on the number of physical resource blocks; and The third random access message is sent during a time window based on the time period.

18. The first network node according to claim 17, wherein: The at least one processor is further configured to: Determining whether the time period is greater than the threshold time period associated with the bandwidth capability of the first network node based on receiving the second random access message, wherein transmitting the third random access message is based on the time period being greater than the threshold time period.

19. The first network node according to claim 17, wherein: The threshold period is based on a first duration and an extension time, the first duration being based on a processing time associated with the first random access message, and the extension time being based on the number of physical resource blocks.

20. The first network node according to claim 19, wherein: The number of physical resource blocks of the second random access message is within a specific range of the number of physical resource blocks, and the extension time is based on the specific range of the number of physical resource blocks.

21. The first network node according to claim 20, wherein: The specific physical resource block number range is from a plurality of physical resource block number ranges within a system bandwidth, and each physical resource block number range in the plurality of physical resource block number ranges corresponds to a corresponding extended time.

22. The first network node according to claim 21, wherein: One or more ranges of the plurality of ranges are defined by a respective maximum number of physical resource blocks and a respective minimum number of physical resource blocks.

23. The first network node according to claim 21, wherein: Each of the plurality of physical resource block number ranges includes a same number of physical resource blocks, and the same number of physical resource blocks represents a fraction of a total number of physical resource blocks included in the plurality of physical resource block number ranges.

24. The first network node according to claim 19, wherein: The extension time is based on a difference between the number of physical resource blocks of the second random access message and a threshold number.

25. The first network node according to claim 19, wherein: Based on the number of the physical resource blocks in the second random access message being greater than a threshold number, the extension time is constant.

26. The first network node according to claim 17, wherein: To receive the second random access message, the at least one processor is configured to: The second random access message is received based on the first information and in response to the first random access message, wherein the second random access message is a random access response message indicating the time period and scheduling an uplink message, wherein the time period is used for transmission of the scheduled uplink message by the first network node, and wherein the third random access message is the scheduled uplink message.

27. The first network node according to claim 17, wherein: To receive the second random access message, the at least one processor is configured to: The second random access message is received based on the first information, wherein the second random access message is a random access response message indicating the time period and a random access preamble identifier associated with the scheduled uplink message, wherein the time period is for transmitting a random access preamble by the first network node based on the random access preamble identifier being different from an identifier of the first network node, and wherein the third random access message is the random access preamble.

28. The first network node according to claim 17, wherein: To receive the second random access message, the at least one processor is configured to: The second random access message is received based on the first information and in response to the first random access message, wherein the second random access message is a random access response message indicating the time period and success of the random access procedure, wherein the time period is used for transmitting a feedback message by the first network node in response to the random access response message, and wherein the third random access message is the feedback message.

29. The first network node according to claim 17, wherein: To receive the second random access message, the at least one processor is configured to: The second random access message is received based on the first information and in response to the first random access message, wherein the second random access message is a downlink contention resolution random access message indicating the time period for transmitting a feedback message by the first network node in response to the downlink contention resolution random access message, and wherein the third random access message is the feedback message.

30. The first network node according to claim 17, wherein: The first random access message includes first information indicating the bandwidth capability of the first network node.

31. The first network node according to claim 17, wherein: The bandwidth capability of the first network node comprises a reduced capability associated with a threshold number of physical resource blocks processed by the first network node during a time slot.

32. A method for wireless communication at a first network node, comprising: receiving first information indicating bandwidth capabilities of a second network node; receiving a first random access message; as well as A second random access message is sent based on the first random access message and via a number of physical resource blocks, the second random access message indicating a time period for transmitting a third random access message by the second network node in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capability of the second network node, and wherein the threshold time period is based on the number of physical resource blocks.

33. The method of claim 32, further comprising: The third random access message is monitored based on the time period.

34. The method of claim 32, wherein: The threshold period is based on a first duration and an extension time, the first duration being based on a processing time associated with the first random access message, and the extension time being based on the number of physical resource blocks.

35. The method according to claim 34, wherein The number of physical resource blocks of the second random access message is within a specific range of the number of physical resource blocks, and the extension time is based on the specific range of the number of physical resource blocks.

36. A method for wireless communication at a first network node, comprising: sending first information indicating bandwidth capabilities of the first network node; Sending a first random access message; receiving a second random access message based on the first random access message and via a number of physical resource blocks, the second random access message indicating a time period for transmission of a third random access message by the first network node in response to the second random access message, wherein the time period is based on a threshold time period associated with the bandwidth capabilities of the first network node, and wherein the threshold time period is based on the number of physical resource blocks; and The third random access message is sent during a time window based on the time period.

37. The method of claim 36, further comprising: Determining whether the time period is greater than the threshold time period associated with the bandwidth capability of the first network node based on receiving the second random access message, wherein transmitting the third random access message is based on the time period being greater than the threshold time period.

38. The method of claim 36, wherein: The threshold period is based on a first duration and an extension time, the first duration being based on a processing time associated with the first random access message, and the extension time being based on the number of physical resource blocks.

39. The method according to claim 38, wherein The number of physical resource blocks of the second random access message is within a specific range of the number of physical resource blocks, and the extension time is based on the specific range of the number of physical resource blocks.

Images