Determination of unused physical random access channel occasions for multiple physical random access channel transmission

Abstract

This disclosure describes systems, methods, and devices related to unused physical random access channel (PRACH) determination. A device may generate a PRACH transmission with multiple preamble repetitions. The device may determine a first valid PRACH occasion based on a configured time offset. The device may determine PRACH occasions in an order by increasing frequency resource indexes and then increasing time resource indexes. The device may perform the PRACH transmission with multiple preamble repetitions using the same preamble index and spatial domain filter.

Description

[0001]Attorney Docket No. AG2913-PCT (31517-3503) DETERMINATION OF UNUSED PHYSICAL RANDOM ACCESS CHANNEL OCCASIONS FOR MULTIPLE PHYSICAL RANDOM ACCESS CHANNEL TRANSMISSION CROSS-REFERENCE TO RELATED PATENT APPLICATION(S) This application claims the benefit of U.S. Provisional Application No. 63 / 585,919, filed September 27, 2023, and U.S. Provisional Application No. 63 / 595,556, filed November 2, 2023, the disclosures of which are incorporated herein by reference as if set forth in full. TECHNICAL FIELD This disclosure generally relates to systems and methods for wireless communications and, more particularly, to determination of unused physical random access channel (PRACH) occasions for multiple physical random access channel (PRACH) transmission. BACKGROUND Wireless devices are becoming widely prevalent and are increasingly requesting access to wireless channels. Open RAN Alliance (O-RAN) is committed to evolve radio access networks. The O-RAN will be deployed based on 3GPP defined network slicing technologies. BRIEF DESCRIPTION OF THE DRAWINGS FIGs. 1-3 depict illustrative schematic diagrams for unused PRACH determination, in accordance with one or more example embodiments of the present disclosure. FIG. 4 illustrates a flow diagram of illustrative process for an illustrative unused PRACH determination system, in accordance with one or more example embodiments of the present disclosure. FIG. 5 illustrates an example network architecture, in accordance with one or more example embodiments of the present disclosure. FIG. 6 schematically illustrates a wireless network, in accordance with one or more example embodiments of the present disclosure. FIG. 7 illustrates components of a computing device, in accordance with one or more example embodiments of the present disclosure. FIG.8 illustrates a network in accordance with various embodiments. Attorney Docket No. AG2913-PCT (31517-3503) DETAILED DESCRIPTION The following description and the drawings sufficiently illustrate specific embodiments to enable those skilled in the art to practice them. Other embodiments may incorporate structural, logical, electrical, process, algorithm, and other changes. Portions and features of some embodiments may be included in, or substituted for, those of other embodiments. Embodiments set forth in the claims encompass all available equivalents of those claims. Mobile communication has evolved significantly from early voice systems to today’s highly sophisticated integrated communication platform. The next-generation wireless communication system, 5G, or new radio (NR) will provide access to information and sharing of data anywhere, anytime by various users and applications. NR is expected to be a unified network / system that targets to meet vastly different and sometimes conflicting performance dimensions and services. Such diverse multi-dimensional requirements are driven by different services and applications. In general, NR will evolve based on 3GPP LTE-Advanced with additional potential new Radio Access Technologies (RATs) to enrich people lives with better, simple and seamless wireless connectivity solutions. NR will enable everything connected by wireless and deliver fast, rich content and services. For cellular systems, coverage is an important factor for successful operation. Compared to LTE, NR can be deployed at relatively higher carrier frequency in frequency range 1 (FR1), e.g., at 3.5GHz. In this case, coverage loss is expected due to larger path-loss, which makes it more challenging to maintain an adequate quality of service. Typically, uplink coverage is the bottleneck for system operation considering the low transmit power at UE side. To improve the coverage, multiple PRACH transmissions can be supported, where same preamble is used for the PRACH repetitions in different time locations. Further, a time period is defined such that a set of determined valid PRACH occasions repeat every time period. Within a time period, at SSB block indexes are mapped at least once to N PRACH occasions, where N is the number of repetitions for multiple PRACH transmissions. In case when some of the PRACH occasions associated with SSB may not be mapped within the time period, certain mechanism may need to be defined for the remaining PRACH occasions. Example embodiments of the present disclosure relate to systems, methods, and devices for determination of unused PRACH occasions for multiple PRACH transmission. Various embodiments herein provide mechanisms for determining unused PRACH occasions for multiple PRACH transmissions. For example, aspects of various embodiments may relate to unused PRACH occasions (RO) for multiple PRACH transmissions. Additionally, these embodiments may involve the determination of the starting PRACH Attorney Docket No. AG2913-PCT (31517-3503) occasion (RO) in a RO group for multiple PRACH transmissions. Furthermore, they may address the power ramping counter determination for multiple PRACH transmissions. Embodiments may improve new radio (NR) PRACH coverage. The above descriptions are for purposes of illustration and are not meant to be limiting. Numerous other examples, configurations, processes, algorithms, etc., may exist, some of which are described in greater detail below. Example embodiments will now be described with reference to the accompanying figures. FIG.1 depicts an illustrative schematic diagram for unused PRACH determination, in accordance with one or more example embodiments of the present disclosure. Mobile communication has evolved significantly from early voice systems to today’s highly sophisticated integrated communication platform. The next-generation wireless communication system, 5G, or new radio (NR) will provide access to information and sharing of data anywhere, anytime by various users and applications. NR is expected to be a unified network / system that targets to meet vastly different and sometimes conflicting performance dimensions and services. Such diverse multi-dimensional requirements are driven by different services and applications. In general, NR will evolve based on 3GPP LTE-Advanced with additional potential new Radio Access Technologies (RATs) to enrich people lives with better, simple and seamless wireless connectivity solutions. NR will enable everything connected by wireless and deliver fast, rich content and services. For cellular systems, coverage is an important factor for successful operation. Compared to LTE, NR can be deployed at relatively higher carrier frequency in frequency range 1 (FR1), e.g., at 3.5GHz. In this case, coverage loss is expected due to larger path-loss, which makes it more challenging to maintain an adequate quality of service. Typically, uplink coverage is the bottleneck for system operation considering the low transmit power at UE side. In NR Rel-15, a 4-step procedure was defined. FIG. 1 illustrates the 4-step RACH procedure for initial access. In the first step, UE transmits physical random access channel (PRACH) in the uplink by randomly selecting one preamble signature, which would allow gNB to estimate the delay between gNB and UE for subsequent UL timing adjustment. Subsequently, in the second step, gNB feedbacks the random access response (RAR) which carries timing advanced (TA) command information and uplink grant for the uplink transmission in the third step. The UE expects to receive the RAR within a time window, of which the start and end are configured by the gNB via system information block (SIB). To improve the coverage, multiple PRACH transmissions can be supported, where same preamble is used for the PRACH repetitions in different time locations. Further, a time Attorney Docket No. AG2913-PCT (31517-3503) period is defined such that a set of determined valid PRACH occasions repeat every time period. Within a time period, at SSB block indexes are mapped at least once to N PRACH occasions, where N is the number of repetitions for multiple PRACH transmissions. In case when some of the PRACH occasions associated with SSB may not be mapped within the time period, certain mechanism may need to be defined for the remaining PRACH occasions. PRACH, or Physical Random Access Channel, is a channel used in wireless communication systems for devices to initiate communication with the network. The term ^ ^^^ ^^^^^^^^refers to the number of preamble repetitions, which is the number of times a preamble is sent ensure successful communication. The SS / PBCH block, or Synchronization Signal / Physical Broadcast Channel block, helps devices synchronize with the network and receive essential broadcast information. TimeOffsetBetweenStartingRO is a parameter that specifies the time offset between starting random access occasions. The frequency resource index is an identifier for a specific frequency resource used in multiplexing PRACH occasions. A valid PRACH occasion is a time and frequency slot where a PRACH transmission can occur. These terms are used to describe the process and conditions for initiating communication in a wireless network. Unused PRACH occasions (RO) for multiple PRACH transmissions: As mentioned above, to improve the coverage, multiple PRACH transmissions can be supported, where same preamble is used for the PRACH repetitions in different time locations. Further, a time period is defined such that a set of determined valid PRACH occasions repeat every time period. Within a time period, at SSB block indexes are mapped at least once to N PRACH occasions, where N is the number of repetitions for multiple PRACH transmissions. In case when some of the PRACH occasions associated with SSB may not be mapped within the time period, certain mechanism may need to be defined for the remaining PRACH occasions. Embodiments of unused PRACH occasions for multiple PRACH transmissions are provided as follows: In one embodiment, for a given repetition number N for multiple PRACH transmissions, if one or more PRACH occasions associated with SS / PBCH block indexes cannot be mapped within the time period, the one or more PRACH occasions are not used for multiple PRACH transmissions. In some aspects, the time period was defined in Clause 8.1 in TS38.213 [1], where for a PRACH transmission with ^ ^^^ ^^^^^^^^preamble repetitions, a time period, starting from frame 0, is the smallest integer number of SS / PBCH block to PRACH occasion association pattern Attorney Docket No. AG2913-PCT (31517-3503) periods such that ^^^^SS / PBCH ^^^ ^^block indexes are mapped at least once to ^^^^^^^^^PRACH occasions within the time period for each configured ^ ^^^ ^^^^^^^^number of preamble repetitions. The set of ^ ^^^ ^^^^^^^^PRACH occasions repeats every time period. In another option, for a given repetition number N for multiple PRACH transmissions, if one or more PRACH occasions associated with an SS / PBCH block index, where the SS / PBCH block index is associated with a same set of preambles, cannot be mapped within the time period, the one or more PRACH occasions are not used for multiple PRACH transmissions. In another option, for a given repetition number N for multiple PRACH transmissions, if one or more PRACH occasions associated with an SS / PBCH block index, where the SS / PBCH block index is associated with a same set of preambles, cannot be mapped within the time period, the one or more PRACH occasions are invalid PRACH occasions. In some aspects, this may apply for the cases when separate preambles on shared ROs are used to differentiate the single PRACH transmission and multiple PRACH transmissions and / or multiple PRACH transmissions with different number of repetitions. In some aspects, this may apply for the case when separate ROs are used to differentiate the single PRACH transmission and multiple PRACH transmissions and / or multiple PRACH transmissions with different number of repetitions. FIG. 2 depicts an illustrative schematic diagram for unused PRACH determination, in accordance with one or more example embodiments of the present disclosure. FIG. 2 illustrates one example of unused PRACH occasions for multiple PRACH transmission. In the example, the number of SSBs is 3, and the number of ROs which are multiplexed in a FDM manner is 4. Further, SSB to RO mapping ratio is 1 for single PRACH transmissions, which indicates that 1 SSB is associated with 1 RO. In addition, 4 repetitions are configured for multiple PRACH transmissions. Further, one RO group is formed based on the RO with same RO frequency index. In the example, 4 RO groups are formed based on the association between SSB and RO group in frequency domain. However, the last RO for 2ndand 3rdRO group is not mapped within the time period. For this option, the last RO for 2ndand 3rdRO group is not used for multiple PRACH transmissions. In another embodiment, for a given repetition number N for multiple PRACH transmissions, if one or more PRACH occasions associated with SS / PBCH block indexes cannot be mapped within the time period, the N PRACH occasions or the whole RO group are Attorney Docket No. AG2913-PCT (31517-3503) not used for multiple PRACH transmissions. In another option, for a given repetition number N for multiple PRACH transmissions, if one or more PRACH occasions associated with an SS / PBCH block index, where the SS / PBCH block index is associated with a same set of preambles, cannot be mapped within the time period, the N PRACH occasions or the whole RO group are not used for multiple PRACH transmissions. In another option, for a given repetition number N for multiple PRACH transmissions, if one or more PRACH occasions associated with an SS / PBCH block index, where the SS / PBCH block index is associated with a same set of preambles, cannot be mapped within the time period, the N PRACH occasions or the whole RO group are invalid PRACH occasions for multiple PRACH transmissions. In some aspects, this may apply for the cases when separate preambles on shared ROs are used to differentiate the single PRACH transmission and multiple PRACH transmissions and / or multiple PRACH transmissions with different number of repetitions. In some aspects, this may apply for the case when separate ROs are used to differentiate the single PRACH transmission and multiple PRACH transmissions and / or multiple PRACH transmissions with different number of repetitions. FIG. 3 depicts an illustrative schematic diagram for unused PRACH determination, in accordance with one or more example embodiments of the present disclosure. FIG. 3 illustrates one example of unused PRACH occasions for multiple PRACH transmission. In the example, the number of SSBs is 3, and the number of ROs which are multiplexed in a FDM manner is 4. Further, SSB to RO mapping ratio is 1 for single PRACH transmissions, which indicates that 1 SSB is associated with 1 RO. In addition, 4 repetitions are configured for multiple PRACH transmissions. Further, one RO group is formed based on the RO with same RO frequency index. In the example, 4 RO groups are formed based on the association between SSB and RO group in frequency domain. However, the last RO for 2nd and 3rd RO group is not mapped within the time period. For this option, the whole 2nd and 3rd RO groups are not used for multiple PRACH transmissions. In another embodiment, for a given repetition number N for multiple PRACH transmissions, if one or more PRACH occasions associated with SS / PBCH block indexes cannot be mapped within the time period, if the number of PRACH occasions associated with SS / PBCH block indexes that cannot be mapped within the time period is greater than or equal to a threshold, the N PRACH occasions or the whole RO group are not used for multiple Attorney Docket No. AG2913-PCT (31517-3503) PRACH transmissions; otherwise, the one or more PRACH occasions are not used for multiple PRACH transmissions. In another option, for a given repetition number N for multiple PRACH transmissions, if one or more PRACH occasions associated with an SS / PBCH block index, where the SS / PBCH block index is associated with a same set of preambles, cannot be mapped within the time period, if the number of PRACH occasions associated with the SS / PBCH block index, where the SS / PBCH block index is associated with a same set of preambles, that cannot be mapped within the time period is greater than or equal to a threshold, the N PRACH occasions or the whole RO group are not used for multiple PRACH transmissions; otherwise, the one or more PRACH occasions are not used for multiple PRACH transmissions. In another option, for a given repetition number N for multiple PRACH transmissions, if one or more PRACH occasions associated with an SS / PBCH block index, where the SS / PBCH block index is associated with a same set of preambles, cannot be mapped within the time period, if the number of PRACH occasions associated with the SS / PBCH block index, where the SS / PBCH block index is associated with a same set of preambles, that cannot be mapped within the time period is greater than or equal to a threshold, the N PRACH occasions or the whole RO group are invalid PRACH occasions for multiple PRACH transmissions; otherwise, the one or more PRACH occasions are invalid PRACH occasions for multiple PRACH transmissions. In some aspects, the threshold may be configured by NR remaining minimum system information (RMSI), NR other system information (OSI) or dedicated radio resource control (RRC) signalling, dynamically indicated in the DCI, or a combination thereof. In some aspects, this may apply for the cases when separate preambles on shared ROs are used to differentiate the single PRACH transmission and multiple PRACH transmissions and / or multiple PRACH transmissions with different number of repetitions. In some aspects, this may apply for the case when separate ROs are used to differentiate the single PRACH transmission and multiple PRACH transmissions and / or multiple PRACH transmissions with different number of repetitions. In one example, if the threshold is configured as 2, for the examples as shown in FIG. 2, the last RO for 2nd and 3rd RO group is not used for multiple PRACH transmissions. In case when the threshold is configured as 1, for the examples as shown in the FIG.2, the whole 2nd and 3rd RO groups are not used for multiple PRACH transmissions. In another embodiment, when separate preambles on shared ROs are used to differentiate between the single PRACH transmission and multiple PRACH transmissions or Attorney Docket No. AG2913-PCT (31517-3503) multiple PRACH transmissions with different number of repetitions, for a given repetition number N for multiple PRACH transmissions, if one or more PRACH occasions associated with SS / PBCH block indexes cannot be mapped within the time period, in one option, the PRACH preambles in the one or more PRACH occasions allocated for multiple PRACH transmissions with repetition number N are not used for multiple PRACH transmissions with repetition number N. In another option, when separate preambles on shared ROs are used to differentiate between the single PRACH transmission and multiple PRACH transmissions or multiple PRACH transmissions with different number of repetitions, for a given repetition number N for multiple PRACH transmissions, if one or more PRACH occasions associated with SS / PBCH block indexes cannot be mapped within the time period, in one option, the PRACH preambles in the N PRACH occasions or the whole RO group allocated for multiple PRACH transmissions with repetition number N are not used for multiple PRACH transmissions with repetition number N. In another option, when separate preambles on shared ROs are used to differentiate between the single PRACH transmission and multiple PRACH transmissions or multiple PRACH transmissions with different number of repetitions, for a given repetition number N for multiple PRACH transmissions, if the number of PRACH occasions associated with SS / PBCH block indexes that cannot be mapped within the time period is greater than or equal to a threshold, the PRACH preambles in the N PRACH occasions or the whole RO group allocated for multiple PRACH transmissions with repetition number N are not used for multiple PRACH transmissions with repetition number N; otherwise, the PRACH preambles in the one or more PRACH occasions allocated for multiple PRACH transmissions with repetition number N are not used for multiple PRACH transmissions with repetition number N. In another embodiment, for a given repetition number N for multiple PRACH transmissions, if one or more PRACH occasions associated with SS / PBCH block indexes cannot be mapped within the time period, and if the number of remaining PRACH occasions is larger than or equal to the next configured repetition number which is smaller than N, the remaining PRACH occasions in the RO group are used for multiple PRACH transmissions with the next configured repetition number which is smaller than N. Further, in one option if smaller repetition number than N is configured for multiple PRACH transmissions, the whole RO group is not used for multiple PRACH transmissions with repetition number N. Attorney Docket No. AG2913-PCT (31517-3503) In another option, if smaller repetition number than N is configured for multiple PRACH transmissions, the remaining PRACH occasions can be used for single PRACH transmission. In some aspects, this may apply for the cases when separate preambles on shared ROs are used to differentiate the single PRACH transmission and multiple PRACH transmissions and / or multiple PRACH transmissions with different number of repetitions. In some aspects, this may apply for the case when separate ROs are used to differentiate the single PRACH transmission and multiple PRACH transmissions and / or multiple PRACH transmissions with different number of repetitions. In another option, SSB index in the above embodiments may refer to the SSB index that is associated with a same set of preambles. Determination of starting PRACH occasion (RO) in a RO group for multiple PRACH transmissions: Embodiment of determination of starting RO in a RO group are provided as follows: In one embodiment, regardless of whether time offset is configured, same RO group determination is performed for multiple PRACH transmissions. Further, when the time offset is configured, the first RO of the subsequent RO groups is determined as the first valid RO after the previous RO group in the following order: first, in increasing order of frequency resource indexes for frequency multiplexed PRACH occasions; second, in increasing order of time resource indexes In one option, the following text in Clause 8.1 in TS38.213 [1] can be updated as shown as follows: In one or more embodiments, a Random Access Preamble may comply with the following: For a PRACH transmission with ^ ^^^ ^^^^^^^^preamble repetitions within a time period for ^ ^^^ ^^^^^^^^preamble repetitions associated with an SS / PBCH block: - If TimeOffsetBetweenStartingRO is provided, for each frequency resource index for frequency multiplexed PRACH occasions, - The first valid PRACH occasion of the first ^ ^^^ ^^^^^^^^preamble repetitions is the first valid PRACH occasion according to an ordering of valid PRACH occasions. - First, in increasing order of frequency resource indexes for frequency multiplexed PRACH occasions. - Second, in increasing order of time resource indexes for time multiplexed PRACH occasions. Attorney Docket No. AG2913-PCT (31517-3503) - The first valid PRACH occasion of subsequent ^ ^^^ ^^^^^^^^preamble repetitions is after TimeOffsetBetweenStartingRO consecutive valid in time from the first valid PRACH occasion corresponding to the previous ^^^^^^^^repetitions. - Otherwise if TimeOffsetBetweenStartingRO is not provided, - The first valid PRACH occasion of the first ^ ^^^ ^^^^^^^^preamble repetitions is the first valid PRACH occasion. - The first valid PRACH occasion of subsequent ^ ^^^ ^^^^^^^^preamble repetitions, if any, is determined after the ROs determined for the previous ^ ^^^ ^^^^^^^^preamble repetitions according to an ordering of valid PRACH occasions. - First, in increasing order of frequency for frequency multiplexed PRACH occasions. - Second, in increasing order of time resource indexes for time multiplexed PRACH occasions. In another option, the following text in Clause 8.1 in TS38.213 [1] can be updated as shown below in underline and strikethrough: In one or more embodiments, a Random Access Preamble may comply with the following: For a PRACH transmission with ^ ^^^ ^^^^^^^^preamble repetitions within a time period for ^ ^^^ ^^^^^^^^preamble repetitions associated with an SS / PBCH block: - If TimeOffsetBetweenStartingRO is provided, - The first valid PRACH occasion of the first ^ ^^^ ^^^^^^^^preamble repetitions is the first valid PRACH occasion. - The first valid PRACH occasion of subsequent ^ ^^^ ^^^^^^^^preamble repetitions is after TimeOffsetBetweenStartingRO consecutive valid PRACH occasions in time from the first valid PRACH occasion with a same frequency resource index corresponding to the previous ^ ^^^ ^^^^^^^^preamble repetitions according to an ordering of valid PRACH occasions. - First, in increasing order of frequency resource indexes for frequency multiplexed PRACH occasions. - Second, in increasing order of time resource indexes for time multiplexed PRACH occasions. - Otherwise, - The first valid PRACH occasion of the first ^ ^^^ ^^^^^^^^preamble repetitions is Attorney Docket No. AG2913-PCT (31517-3503) the first valid PRACH occasion. - The first valid PRACH occasion of subsequent ^ ^^^ ^^^^^^^^preamble repetitions, if any, is determined after the ROs determined for the previous ^ ^^^ ^^^^^^^^preamble repetitions according to an ordering of valid PRACH occasions. - First, in increasing order of frequency resource indexes for frequency multiplexed PRACH occasions. - Second, in increasing order of time resource indexes for time multiplexed PRACH occasions. In another embodiment, regardless of whether time offset is configured, same RO group determination is performed for multiple PRACH transmissions. Further, when the time offset is not configured, for each frequency resource index for frequency multiplexed PRACH occasions, the starting RO of other groups is determined as the first valid RO after the last RO of previous RO group with the same frequency resource index. In one option, the following text in Clause 8.1 in TS38.213 [1] can be updated as shown below: In one or more embodiments, a random access preamble may comply with the following: For a PRACH transmission with ^ ^^^ ^^^^^^^^preamble repetitions within a time period for ^ ^^^ ^^^^^^^^preamble repetitions associated with an SS / PBCH block. - If TimeOffsetBetweenStartingRO is provided, for each frequency resource index for frequency multiplexed PRACH occasions, - The first valid PRACH occasion of the first ^ ^^^ ^^^^^^^^preamble repetitions is the first valid PRACH occasion. - The first valid PRACH occasion of subsequent ^ ^^^ ^^^^^^^^preamble repetitions is after TimeOffsetBetweenStartingRO consecutive valid PRACH occasions in time from the first valid PRACH occasion corresponding to the previous ^ ^^^ ^^^^^^^^preamble repetitions - Otherwise, for each frequency resource index for frequency multiplexed PRACH occasions, - The first valid PRACH occasion of the first ^ ^^^ ^^^^^^^^preamble repetitions is the first valid PRACH occasion. - The first valid PRACH occasion of subsequent ^ ^^^ ^^^^^^^^preamble repetitions, if any, is determined after the ROs in time determined for the previous ^ ^^^ ^^^^^^^^preamble Attorney Docket No. AG2913-PCT (31517-3503) repetitions. In another embodiment, the following text in Clause 8.1 in TS38.213 [1] can be updated as shown below with underline and strikethrough. In one or more embodiments, a random access preamble may comply with the following: For a PRACH transmission with ^ ^^^ ^^^^^^^^preamble repetitions, a set consists of ^ ^^^ ^^^^^^^^valid PRACH occasions that in time, use same frequency resources, and are associated with a same where the SS / PBCH block index is associated with a same set of preambles. For a PRACH transmission with preamble repetitions, a time period, starting from frame 0, is the smallest integer number of association pattern periods such that at least one set of valid PRACH occasions for each of the ^^^^^^SS / PBCH block indexes associated with a same set of preambles can be determined within the time period for all configured number of preamble repetitions. The set(s) of valid PRACH occasions for each configured number of preamble repetitions repeats every time period. Within a time period, for set(s) of ^^^^^^^^^^^^valid PRACH occasions associated with an SS / PBCH block for a PRACH ^ ^^^ ^^^^^^^^preamble repetitions, where the SS / PBCH block index is associated with a same set of preambles. Power ramping counter determination for multiple PRACH transmissions: Embodiment of power ramping counter determination for multiple PRACH transmissions are provided as follows: In one embodiment, for multiple PRACH transmissions, if prior to a PRACH retransmission, a UE changes the spatial domain transmission filter, Layer 1 does not notify higher layers to suspend the power ramping counter. In some aspects, for single PRACH transmissions, if prior to a PRACH retransmission, a UE changes the spatial domain transmission filter, Layer 1 notifies higher layers to suspend the power ramping counter. The following text in Clause 7.4 in TS38.213 [1] can be updated as shown below: 7.4 Physical random access channel. For Type-1 random access procedure without preamble repetitions and Type 2 random access procedure, if prior to a PRACH retransmission, a UE changes the spatial domain transmission filter, Layer 1 notifies higher layers to suspend the power ramping counter as described in [11, TS 38.321]. In another embodiment, for multiple PRACH transmissions, if prior to a PRACH Attorney Docket No. AG2913-PCT (31517-3503) retransmission, a UE transmits PRACH preambles in PRACH occasions associated with different SSB indexes, Layer 1 notifies higher layers to suspend the power ramping counter. In some aspects, if prior to a PRACH retransmission, a UE transmits PRACH preambles in PRACH occasions associated with same SSB indexes, Layer 1 does not notify higher layers to suspend the power ramping counter. In another embodiment, the following text in Clause 8.1 in TS38.213 [1] can be updated as shown below with underline and strikethrough: 8.1 Random access preamble. A PRACH is transmitted using the selected PRACH format with transmission power ^^^^^^,^,^,^(^), as described in clause 7.4, on the indicated PRACH resource or on determined resources in case of ^ ^^^ ^^^^^^^^preamble repetitions. For Type-1 random access procedure with preamble repetitions, a PRACH is transmitted using a same preamble index and spatial domain filter. Reference: [1].3GPP TS 38.213, V18.0.0: “NR: Physical layer procedures for control” It is understood that the above descriptions are for the purposes of illustration and are not meant to be limiting. In some embodiments, the electronic device(s), network(s), system(s), chip(s) or component(s), or portions or implementations thereof, of FIGs. 5-8, or some other figure herein, may be configured to perform one or more processes, techniques, or methods as described herein, or portions thereof. One such process is depicted in FIG.4. For example, the process may include, at 402, generating a PRACH transmission with multiple preamble repetitions. The process further includes, at 404, determining a first valid PRACH occasion based on a configured time offset. The process further includes, at 406, determining PRACH occasions in an order by increasing frequency resource indexes and then increasing time resource indexes. The process further includes, at 408, perform the PRACH transmission with multiple preamble repetitions using the same preamble index and spatial domain filter. For one or more embodiments, at least one of the components set forth in one or more of the preceding figures may be configured to perform one or more operations, techniques, processes, and / or methods as set forth in the example section below. For example, the baseband circuitry as described above in connection with one or more of the preceding figures may be configured to operate in accordance with one or more of the examples set forth below. For Attorney Docket No. AG2913-PCT (31517-3503) another example, circuitry associated with a UE, base station, network element, etc. as described above in connection with one or more of the preceding figures may be configured to operate in accordance with one or more of the examples set forth below in the example section. It is understood that the above descriptions are for purposes of illustration and are not meant to be limiting. FIGs. 5-8 illustrate various systems, devices, and components that may implement aspects of disclosed embodiments. FIG. 5 illustrates an example network architecture 500 according to various embodiments. The network 500 may operate in a manner consistent with 3GPP technical specifications for LTE or 5G / NR systems. However, the example embodiments are not limited in this regard and the described embodiments may apply to other networks that benefit from the principles described herein, such as future 3GPP systems, or the like. The network 500 includes a UE 502, which is any mobile or non-mobile computing device designed to communicate with a RAN 504 via an over-the-air connection. The UE 502 is communicatively coupled with the RAN 504 by a Uu interface, which may be applicable to both LTE and NR systems. Examples of the UE 502 include, but are not limited to, a smartphone, tablet computer, wearable computer, desktop computer, laptop computer, in- vehicle infotainment system, in-car entertainment system, instrument cluster, head-up display (HUD) device, onboard diagnostic device, dashtop mobile equipment, mobile data terminal, electronic engine management system, electronic / engine control unit, electronic / engine control module, embedded system, sensor, microcontroller, control module, engine management system, networked appliance, machine-type communication device, machine-to-machine (M2M), device-to-device (D2D), machine-type communication (MTC) device, Internet of Things (IoT) device, and / or the like. The network 500 may include a plurality of UEs 502 coupled directly with one another via a D2D, ProSe, PC5, and / or sidelink (SL) interface. These UEs 502 may be M2M / D2D / MTC / IoT devices and / or vehicular systems that communicate using physical sidelink channels such as, but not limited to, PSBCH, PSDCH, PSSCH, PSCCH, PSFCH, etc. The UE 502 may perform blind decoding attempts of SL channels / links according to the various embodiments herein. In some embodiments, the UE 502 may additionally communicate with an AP 506 via an over-the-air (OTA) connection. The AP 506 manages a WLAN connection, which may serve to offload some / all network traffic from the RAN 504. The connection between the UE 502 and the AP 506 may be consistent with any IEEE 802.11 protocol. Additionally, the UE 502, RAN 504, and AP 506 may utilize cellular-WLAN aggregation / integration (e.g., Attorney Docket No. AG2913-PCT (31517-3503) LWA / LWIP). Cellular-WLAN aggregation may involve the UE 502 being configured by the RAN 504 to utilize both cellular radio resources and WLAN resources. The RAN 504 includes one or more access network nodes (ANs) 508. The ANs 508 terminate air-interface(s) for the UE 502 by providing access stratum protocols including RRC, PDCP, RLC, MAC, and PHY / L1 protocols. In this manner, the AN 508 enables data / voice connectivity between CN 520 and the UE 502. The ANs 508 may be a macrocell base station or a low power base station for providing femtocells, picocells or other like cells having smaller coverage areas, smaller user capacity, or higher bandwidth compared to macrocells; or some combination thereof. In these implementations, an AN 508 be referred to as a BS, gNB, RAN node, eNB, ng-eNB, NodeB, RSU, TRxP, etc. One example implementation is a “CU / DU split” architecture where the ANs 508 are embodied as a gNB-Central Unit (CU) that is communicatively coupled with one or more gNB- Distributed Units (DUs), where each DU may be communicatively coupled with one or more Radio Units (RUs) (also referred to as RRHs, RRUs, or the like) (see e.g., 3GPP TS 38.401 v16.1.0 (2020-03)). In some implementations, the one or more RUs may be individual RSUs. In some implementations, the CU / DU split may include an ng-eNB-CU and one or more ng- eNB-DUs instead of, or in addition to, the gNB-CU and gNB-DUs, respectively. The ANs 508 employed as the CU may be implemented in a discrete device or as one or more software entities running on server computers as part of, for example, a virtual network including a virtual Base Band Unit (BBU) or BBU pool, cloud RAN (CRAN), Radio Equipment Controller (REC), Radio Cloud Center (RCC), centralized RAN (C-RAN), virtualized RAN (vRAN), and / or the like (although these terms may refer to different implementation concepts). Any other type of architectures, arrangements, and / or configurations can be used. The plurality of ANs may be coupled with one another via an X2 interface (if the RAN 504 is an LTE RAN or Evolved Universal Terrestrial Radio Access Network (E-UTRAN) 510) or an Xn interface (if the RAN 504 is a NG-RAN 514). The X2 / Xn interfaces, which may be separated into control / user plane interfaces in some embodiments, may allow the ANs to communicate information related to handovers, data / context transfers, mobility, load management, interference coordination, etc. The ANs of the RAN 504 may each manage one or more cells, cell groups, component carriers, etc. to provide the UE 502 with an air interface for network access. The UE 502 may be simultaneously connected with a plurality of cells provided by the same or different ANs 508 of the RAN 504. For example, the UE 502 and RAN 504 may use carrier aggregation to allow the UE 502 to connect with a plurality of component carriers, each corresponding to a Attorney Docket No. AG2913-PCT (31517-3503) Pcell or Scell. In dual connectivity scenarios, a first AN 508 may be a master node that provides an MCG and a second AN 508 may be secondary node that provides an SCG. The first / second ANs 508 may be any combination of eNB, gNB, ng-eNB, etc. The RAN 504 may provide the air interface over a licensed spectrum or an unlicensed spectrum. To operate in the unlicensed spectrum, the nodes may use LAA, eLAA, and / or feLAA mechanisms based on CA technology with PCells / Scells. Prior to accessing the unlicensed spectrum, the nodes may perform medium / carrier-sensing operations based on, for example, a listen-before-talk (LBT) protocol. In V2X scenarios the UE 502 or AN 508 may be or act as a roadside unit (RSU), which may refer to any transportation infrastructure entity used for V2X communications. An RSU may be implemented in or by a suitable AN or a stationary (or relatively stationary) UE. An RSU implemented in or by: a UE may be referred to as a “UE-type RSU”; an eNB may be referred to as an “eNB-type RSU”; a gNB may be referred to as a “gNB-type RSU”; and the like. In one example, an RSU is a computing device coupled with radio frequency circuitry located on a roadside that provides connectivity support to passing vehicle UEs. The RSU may also include internal data storage circuitry to store intersection map geometry, traffic statistics, media, as well as applications / software to sense and control ongoing vehicular and pedestrian traffic. The RSU may provide very low latency communications required for high speed events, such as crash avoidance, traffic warnings, and the like. Additionally or alternatively, the RSU may provide other cellular / WLAN communications services. The components of the RSU may be packaged in a weatherproof enclosure suitable for outdoor installation, and may include a network interface controller to provide a wired connection (e.g., Ethernet) to a traffic signal controller or a backhaul network. In some embodiments, the RAN 504 may be an E-UTRAN 510 with one or more eNBs 512. The an E-UTRAN 510 provides an LTE air interface (Uu) with the following characteristics: SCS of 15 kHz; CP-OFDM waveform for DL and SC-FDMA waveform for UL; turbo codes for data and TBCC for control; etc. The LTE air interface may rely on CSI- RS for CSI acquisition and beam management; PDSCH / PDCCH DMRS for PDSCH / PDCCH demodulation; and CRS for cell search and initial acquisition, channel quality measurements, and channel estimation for coherent demodulation / detection at the UE. The LTE air interface may operating on sub-6 GHz bands. In some embodiments, the RAN 504 may be an next generation (NG)-RAN 514 with one or more gNB 516 and / or on or more ng-eNB 518. The gNB 516 connects with 5G-enabled UEs 502 using a 5G NR interface. The gNB 516 connects with a 5GC 540 through an NG Attorney Docket No. AG2913-PCT (31517-3503) interface, which includes an N2 interface or an N3 interface. The ng-eNB 518 also connects with the 5GC 540 through an NG interface, but may connect with a UE 502 via the Uu interface. The gNB 516 and the ng-eNB 518 may connect with each other over an Xn interface. In some embodiments, the NG interface may be split into two parts, an NG user plane (NG-U) interface, which carries traffic data between the nodes of the NG-RAN 514 and a UPF 548 (e.g., N3 interface), and an NG control plane (NG-C) interface, which is a signaling interface between the nodes of the NG-RAN 514 and an AMF 544 (e.g., N2 interface). The NG-RAN 514 may provide a 5G-NR air interface (which may also be referred to as a Uu interface) with the following characteristics: variable SCS; CP-OFDM for DL, CP- OFDM and DFT-s-OFDM for UL; polar, repetition, simplex, and Reed-Muller codes for control and LDPC for data. The 5G-NR air interface may rely on CSI-RS, PDSCH / PDCCH DMRS similar to the LTE air interface. The 5G-NR air interface may not use a CRS, but may use PBCH DMRS for PBCH demodulation; PTRS for phase tracking for PDSCH; and tracking reference signal for time tracking. The 5G-NR air interface may operating on FR1 bands that include sub-6 GHz bands or FR2 bands that include bands from 24.25 GHz to 52.6 GHz. The 5G-NR air interface may include an SSB that is an area of a downlink resource grid that includes PSS / SSS / PBCH. The 5G-NR air interface may utilize BWPs for various purposes. For example, BWP can be used for dynamic adaptation of the SCS. For example, the UE 502 can be configured with multiple BWPs where each BWP configuration has a different SCS. When a BWP change is indicated to the UE 502, the SCS of the transmission is changed as well. Another use case example of BWP is related to power saving. In particular, multiple BWPs can be configured for the UE 502 with different amount of frequency resources (e.g., PRBs) to support data transmission under different traffic loading scenarios. A BWP containing a smaller number of PRBs can be used for data transmission with small traffic load while allowing power saving at the UE 502 and in some cases at the gNB 516. A BWP containing a larger number of PRBs can be used for scenarios with higher traffic load. The RAN 504 is communicatively coupled to CN 520 that includes network elements and / or network functions (NFs) to provide various functions to support data and telecommunications services to customers / subscribers (e.g., UE 502). The components of the CN 520 may be implemented in one physical node or separate physical nodes. In some embodiments, NFV may be utilized to virtualize any or all of the functions provided by the network elements of the CN 520 onto physical compute / storage resources in servers, switches, Attorney Docket No. AG2913-PCT (31517-3503) etc. A logical instantiation of the CN 520 may be referred to as a network slice, and a logical instantiation of a portion of the CN 520 may be referred to as a network sub-slice. The CN 520 may be an LTE CN 522 (also referred to as an Evolved Packet Core (EPC) 522). The EPC 522 may include MME 524, SGW 526, SGSN 528, HSS 530, PGW 532, and PCRF 534 coupled with one another over interfaces (or “reference points”) as shown. The NFs in the EPC 522 are briefly introduced as follows. The MME 524 implements mobility management functions to track a current location of the UE 502 to facilitate paging, bearer activation / deactivation, handovers, gateway selection, authentication, etc. The SGW 526 terminates an S1 interface toward the RAN 510 and routes data packets between the RAN 510 and the EPC 522. The SGW 526 may be a local mobility anchor point for inter-RAN node handovers and also may provide an anchor for inter-3GPP mobility. Other responsibilities may include lawful intercept, charging, and some policy enforcement. The SGSN 528 tracks a location of the UE 502 and performs security functions and access control. The SGSN 528 also performs inter-EPC node signaling for mobility between different RAT networks; PDN and S-GW selection as specified by MME 524; MME 524 selection for handovers; etc. The S3 reference point between the MME 524 and the SGSN 528 enable user and bearer information exchange for inter-3GPP access network mobility in idle / active states. The HSS 530 includes a database for network users, including subscription-related information to support the network entities’ handling of communication sessions. The HSS 530 can provide support for routing / roaming, authentication, authorization, naming / addressing resolution, location dependencies, etc. An S6a reference point between the HSS 530 and the MME 524 may enable transfer of subscription and authentication data for authenticating / authorizing user access to the EPC 520. The PGW 532 may terminate an SGi interface toward a data network (DN) 536 that may include an application (app) / content server 538. The PGW 532 routes data packets between the EPC 522 and the data network 536. The PGW 532 is communicatively coupled with the SGW 526 by an S5 reference point to facilitate user plane tunneling and tunnel management. The PGW 532 may further include a node for policy enforcement and charging data collection (e.g., PCEF). Additionally, the SGi reference point may communicatively couple the PGW 532 with the same or different data network 536. The PGW 532 may be communicatively coupled with a PCRF 534 via a Gx reference point. Attorney Docket No. AG2913-PCT (31517-3503) The PCRF 534 is the policy and charging control element of the EPC 522. The PCRF 534 is communicatively coupled to the app / content server 538 to determine appropriate QoS and charging parameters for service flows. The PCRF 532 also provisions associated rules into a PCEF (via Gx reference point) with appropriate TFT and QCI. The CN 520 may be a 5GC 540 including an AUSF 542, AMF 544, SMF 546, UPF 548, NSSF 550, NEF 552, NRF 554, PCF 556, UDM 558, and AF 560 coupled with one another over various interfaces as shown. The NFs in the 5GC 540 are briefly introduced as follows. The AUSF 542 stores data for authentication of UE 502 and handle authentication- related functionality. The AUSF 542 may facilitate a common authentication framework for various access types.. The AMF 544 allows other functions of the 5GC 540 to communicate with the UE 502 and the RAN 504 and to subscribe to notifications about mobility events with respect to the UE 502. The AMF 544 is also responsible for registration management (e.g., for registering UE 502), connection management, reachability management, mobility management, lawful interception of AMF-related events, and access authentication and authorization. The AMF 544 provides transport for SM messages between the UE 502 and the SMF 546, and acts as a transparent proxy for routing SM messages. AMF 544 also provides transport for SMS messages between UE 502 and an SMSF. AMF 544 interacts with the AUSF 542 and the UE 502 to perform various security anchor and context management functions. Furthermore, AMF 544 is a termination point of a RAN-CP interface, which includes the N2 reference point between the RAN 504 and the AMF 544. The AMF 544 is also a termination point of NAS (N1) signaling, and performs NAS ciphering and integrity protection. AMF 544 also supports NAS signaling with the UE 502 over an N3IWF interface. The N3IWF provides access to untrusted entities. N3IWF may be a termination point for the N2 interface between the (R)AN 504 and the AMF 544 for the control plane, and may be a termination point for the N3 reference point between the (R)AN 514 and the 548 for the user plane. As such, the AMF 544 handles N2 signalling from the SMF 546 and the AMF 544 for PDU sessions and QoS, encapsulate / de-encapsulate packets for IPSec and N3 tunnelling, marks N3 user-plane packets in the uplink, and enforces QoS corresponding to N3 packet marking taking into account QoS requirements associated with such marking received over N2. N3IWF may also relay UL and DL control-plane NAS signalling between the UE 502 and AMF 544 via an N1 reference point between the UE 502and the AMF 544, and relay uplink and downlink user-plane packets between the UE 502 and UPF 548. The N3IWF also provides Attorney Docket No. AG2913-PCT (31517-3503) mechanisms for IPsec tunnel establishment with the UE 502. The AMF 544 may exhibit an Namf service-based interface, and may be a termination point for an N14 reference point between two AMFs 544 and an N17 reference point between the AMF 544 and a 5G-EIR (not shown by FIG.5). The SMF 546 is responsible for SM (e.g., session establishment, tunnel management between UPF 548 and AN 508); UE IP address allocation and management (including optional authorization); selection and control of UP function; configuring traffic steering at UPF 548 to route traffic to proper destination; termination of interfaces toward policy control functions; controlling part of policy enforcement, charging, and QoS; lawful intercept (for SM events and interface to LI system); termination of SM parts of NAS messages; downlink data notification; initiating AN specific SM information, sent via AMF 544 over N2 to AN 508; and determining SSC mode of a session. SM refers to management of a PDU session, and a PDU session or “session” refers to a PDU connectivity service that provides or enables the exchange of PDUs between the UE 502 and the DN 536. The UPF 548 acts as an anchor point for intra-RAT and inter-RAT mobility, an external PDU session point of interconnect to data network 536, and a branching point to support multi- homed PDU session. The UPF 548 also performs packet routing and forwarding, packet inspection, enforces user plane part of policy rules, lawfully intercept packets (UP collection), performs traffic usage reporting, perform QoS handling for a user plane (e.g., packet filtering, gating, UL / DL rate enforcement), performs uplink traffic verification (e.g., SDF-to-QoS flow mapping), transport level packet marking in the uplink and downlink, and performs downlink packet buffering and downlink data notification triggering. UPF 548 may include an uplink classifier to support routing traffic flows to a data network. The NSSF 550 selects a set of network slice instances serving the UE 502. The NSSF 550 also determines allowed NSSAI and the mapping to the subscribed S-NSSAIs, if needed. The NSSF 550 also determines an AMF set to be used to serve the UE 502, or a list of candidate AMFs 544 based on a suitable configuration and possibly by querying the NRF 554. The selection of a set of network slice instances for the UE 502 may be triggered by the AMF 544 with which the UE 502 is registered by interacting with the NSSF 550; this may lead to a change of AMF 544. The NSSF 550 interacts with the AMF 544 via an N22 reference point; and may communicate with another NSSF in a visited network via an N31 reference point (not shown). The NEF 552 securely exposes services and capabilities provided by 3GPP NFs for third party, internal exposure / re-exposure, AFs 560, edge computing or fog computing systems Attorney Docket No. AG2913-PCT (31517-3503) (e.g., edge compute node, etc. In such embodiments, the NEF 552 may authenticate, authorize, or throttle the AFs. NEF 552 may also translate information exchanged with the AF 560 and information exchanged with internal network functions. For example, the NEF 552 may translate between an AF-Service-Identifier and an internal 5GC information. NEF 552 may also receive information from other NFs based on exposed capabilities of other NFs. This information may be stored at the NEF 552 as structured data, or at a data storage NF using standardized interfaces. The stored information can then be re-exposed by the NEF 552 to other NFs and AFs, or used for other purposes such as analytics. The NRF 554 supports service discovery functions, receives NF discovery requests from NF instances, and provides information of the discovered NF instances to the requesting NF instances. NRF 554 also maintains information of available NF instances and their supported services. The NRF 554 also supports service discovery functions, wherein the NRF 554 receives NF Discovery Request from NF instance or an SCP (not shown), and provides information of the discovered NF instances to the NF instance or SCP. The PCF 556 provides policy rules to control plane functions to enforce them, and may also support unified policy framework to govern network behavior. The PCF 556 may also implement a front end to access subscription information relevant for policy decisions in a UDR of the UDM 558. In addition to communicating with functions over reference points as shown, the PCF 556 exhibit an Npcf service-based interface. The UDM 558 handles subscription-related information to support the network entities’ handling of communication sessions, and stores subscription data of UE 502. For example, subscription data may be communicated via an N8 reference point between the UDM 558 and the AMF 544. The UDM 558 may include two parts, an application front end and a UDR. The UDR may store subscription data and policy data for the UDM 558 and the PCF 556, and / or structured data for exposure and application data (including PFDs for application detection, application request information for multiple UEs 502) for the NEF 552. The Nudr service- based interface may be exhibited by the UDR 221 to allow the UDM 558, PCF 556, and NEF 552 to access a particular set of the stored data, as well as to read, update (e.g., add, modify), delete, and subscribe to notification of relevant data changes in the UDR. The UDM may include a UDM-FE, which is in charge of processing credentials, location management, subscription management and so on. Several different front ends may serve the same user in different transactions. The UDM-FE accesses subscription information stored in the UDR and performs authentication credential processing, user identification handling, access authorization, registration / mobility management, and subscription management. In addition to Attorney Docket No. AG2913-PCT (31517-3503) communicating with other NFs over reference points as shown, the UDM 558 may exhibit the Nudm service-based interface. AF 560 provides application influence on traffic routing, provide access to NEF 552, and interact with the policy framework for policy control. The AF 560 may influence UPF 548 (re)selection and traffic routing. Based on operator deployment, when AF 560 is considered to be a trusted entity, the network operator may permit AF 560 to interact directly with relevant NFs. Additionally, the AF 560 may be used for edge computing implementations, The 5GC 540 may enable edge computing by selecting operator / 3rd party services to be geographically close to a point that the UE 502 is attached to the network. This may reduce latency and load on the network. In edge computing implementations, the 5GC 540 may select a UPF 548 close to the UE 502 and execute traffic steering from the UPF 548 to DN 536 via the N6 interface. This may be based on the UE subscription data, UE location, and information provided by the AF 560, which allows the AF 560 to influence UPF (re)selection and traffic routing. The data network (DN) 536 may represent various network operator services, Internet access, or third party services that may be provided by one or more servers including, for example, application (app) / content server 538. The DN 536 may be an operator external public, a private PDN, or an intra-operator packet data network, for example, for provision of IMS services. In this embodiment, the app server 538 can be coupled to an IMS via an S-CSCF or the I-CSCF. In some implementations, the DN 536 may represent one or more local area DNs (LADNs), which are DNs 536 (or DN names (DNNs)) that is / are accessible by a UE 502 in one or more specific areas. Outside of these specific areas, the UE 502 is not able to access the LADN / DN 536. Additionally or alternatively, the DN 536 may be an Edge DN 536, which is a (local) Data Network that supports the architecture for enabling edge applications. In these embodiments, the app server 538 may represent the physical hardware systems / devices providing app server functionality and / or the application software resident in the cloud or at an edge compute node that performs server function(s). In some embodiments, the app / content server 538 provides an edge hosting environment that provides support required for Edge Application Server's execution. In some embodiments, the 5GS can use one or more edge compute nodes to provide an interface and offload processing of wireless communication traffic. In these embodiments, the edge compute nodes may be included in, or co-located with one or more RAN510, 514. For example, the edge compute nodes can provide a connection between the RAN 514 and UPF Attorney Docket No. AG2913-PCT (31517-3503) 548 in the 5GC 540. The edge compute nodes can use one or more NFV instances instantiated on virtualization infrastructure within the edge compute nodes to process wireless connections to and from the RAN 514 and UPF 548. The interfaces of the 5GC 540 include reference points and service-based itnterfaces. The reference points include: N1 (between the UE 502 and the AMF 544), N2 (between RAN 514 and AMF 544), N3 (between RAN 514 and UPF 548), N4 (between the SMF 546 and UPF 548), N5 (between PCF 556 and AF 560), N6 (between UPF 548 and DN 536), N7 (between SMF 546 and PCF 556), N8 (between UDM 558 and AMF 544), N9 (between two UPFs 548), N10 (between the UDM 558 and the SMF 546), N11 (between the AMF 544 and the SMF 546), N12 (between AUSF 542 and AMF 544), N13 (between AUSF 542 and UDM 558), N14 (between two AMFs 544; not shown), N15 (between PCF 556 and AMF 544 in case of a non- roaming scenario, or between the PCF 556 in a visited network and AMF 544 in case of a roaming scenario), N16 (between two SMFs 546; not shown), and N22 (between AMF 544 and NSSF 550). Other reference point representations not shown in FIG. 5 can also be used. The service-based representation of FIG.5 represents NFs within the control plane that enable other authorized NFs to access their services. The service-based interfaces (SBIs) include: Namf (SBI exhibited by AMF 544), Nsmf (SBI exhibited by SMF 546), Nnef (SBI exhibited by NEF 552), Npcf (SBI exhibited by PCF 556), Nudm (SBI exhibited by the UDM 558), Naf (SBI exhibited by AF 560), Nnrf (SBI exhibited by NRF 554), Nnssf (SBI exhibited by NSSF 550), Nausf (SBI exhibited by AUSF 542). Other service-based interfaces (e.g., Nudr, N5g- eir, and Nudsf) not shown in FIG.5 can also be used. In some embodiments, the NEF 552 can provide an interface to edge compute nodes 536x, which can be used to process wireless connections with the RAN 514.In some implementations, the system 500 may include an SMSF, which is responsible for SMS subscription checking and verification, and relaying SM messages to / from the UE 502 to / from other entities, such as an SMS-GMSC / IWMSC / SMS- router. The SMS may also interact with AMF 544 and UDM 558 for a notification procedure that the UE 502 is available for SMS transfer (e.g., set a UE not reachable flag, and notifying UDM 558 when UE 502 is available for SMS). The 5GS may also include an SCP (or individual instances of the SCP) that supports indirect communication (see e.g., 3GPP TS 23.501 section 7.1.1); delegated discovery (see e.g., 3GPP TS 23.501 section 7.1.1); message forwarding and routing to destination NF / NF service(s), communication security (e.g., authorization of the NF Service Consumer to access the NF Service Producer API) (see e.g., 3GPP TS 33.501), load balancing, monitoring, overload control, etc.; and discovery and selection functionality for UDM(s), AUSF(s), Attorney Docket No. AG2913-PCT (31517-3503) UDR(s), PCF(s) with access to subscription data stored in the UDR based on UE's SUPI, SUCI or GPSI (see e.g., 3GPP TS 23.501 section 6.3). Load balancing, monitoring, overload control functionality provided by the SCP may be implementation specific. The SCP may be deployed in a distributed manner. More than one SCP can be present in the communication path between various NF Services. The SCP, although not an NF instance, can also be deployed distributed, redundant, and scalable. FIG. 6 schematically illustrates a wireless network 600 in accordance with various embodiments. The wireless network 600 may include a UE 602 in wireless communication with an AN 604. The UE 602 and AN 604 may be similar to, and substantially interchangeable with, like-named components described with respect to FIG.5. The UE 602 may be communicatively coupled with the AN 604 via connection 606. The connection 606 is illustrated as an air interface to enable communicative coupling, and can be consistent with cellular communications protocols such as an LTE protocol or a 5G NR protocol operating at mmWave or sub-6GHz frequencies. The UE 602 may include a host platform 608 coupled with a modem platform 610. The host platform 608 may include application processing circuitry 612, which may be coupled with protocol processing circuitry 614 of the modem platform 610. The application processing circuitry 612 may run various applications for the UE 602 that source / sink application data. The application processing circuitry 612 may further implement one or more layer operations to transmit / receive application data to / from a data network. These layer operations may include transport (for example UDP) and Internet (for example, IP) operations. The protocol processing circuitry 614 may implement one or more of layer operations to facilitate transmission or reception of data over the connection 606. The layer operations implemented by the protocol processing circuitry 614 may include, for example, MAC, RLC, PDCP, RRC and NAS operations. The modem platform 610 may further include digital baseband circuitry 616 that may implement one or more layer operations that are “below” layer operations performed by the protocol processing circuitry 614 in a network protocol stack. These operations may include, for example, PHY operations including one or more of HARQ acknowledgement (ACK) functions, scrambling / descrambling, encoding / decoding, layer mapping / de-mapping, modulation symbol mapping, received symbol / bit metric determination, multi-antenna port precoding / decoding, which may include one or more of space-time, space-frequency or spatial coding, reference signal generation / detection, preamble sequence generation and / or decoding, Attorney Docket No. AG2913-PCT (31517-3503) synchronization sequence generation / detection, control channel signal blind decoding, and other related functions. The modem platform 610 may further include transmit circuitry 618, receive circuitry 620, RF circuitry 622, and RF front end (RFFE) 624, which may include or connect to one or more antenna panels 626. Briefly, the transmit circuitry 618 may include a digital-to-analog converter, mixer, intermediate frequency (IF) components, etc.; the receive circuitry 620 may include an analog-to-digital converter, mixer, IF components, etc.; the RF circuitry 622 may include a low-noise amplifier, a power amplifier, power tracking components, etc.; RFFE 624 may include filters (for example, surface / bulk acoustic wave filters), switches, antenna tuners, beamforming components (for example, phase-array antenna components), etc. The selection and arrangement of the components of the transmit circuitry 618, receive circuitry 620, RF circuitry 622, RFFE 624, and antenna panels 626 (referred generically as “transmit / receive components”) may be specific to details of a specific implementation such as, for example, whether communication is TDM or FDM, in mmWave or sub-6 gHz frequencies, etc. In some embodiments, the transmit / receive components may be arranged in multiple parallel transmit / receive chains, may be disposed in the same or different chips / modules, etc. In some embodiments, the protocol processing circuitry 614 may include one or more instances of control circuitry (not shown) to provide control functions for the transmit / receive components. A UE 602 reception may be established by and via the antenna panels 626, RFFE 624, RF circuitry 622, receive circuitry 620, digital baseband circuitry 616, and protocol processing circuitry 614. In some embodiments, the antenna panels 626 may receive a transmission from the AN 604 by receive-beamforming signals received by a plurality of antennas / antenna elements of the one or more antenna panels 626. A UE 602 transmission may be established by and via the protocol processing circuitry 614, digital baseband circuitry 616, transmit circuitry 618, RF circuitry 622, RFFE 624, and antenna panels 626. In some embodiments, the transmit components of the UE 604 may apply a spatial filter to the data to be transmitted to form a transmit beam emitted by the antenna elements of the antenna panels 626. Similar to the UE 602, the AN 604 may include a host platform 628 coupled with a modem platform 630. The host platform 628 may include application processing circuitry 632 coupled with protocol processing circuitry 634 of the modem platform 630. The modem platform may further include digital baseband circuitry 636, transmit circuitry 638, receive circuitry 640, RF circuitry 642, RFFE circuitry 644, and antenna panels 646. The components Attorney Docket No. AG2913-PCT (31517-3503) of the AN 604 may be similar to and substantially interchangeable with like-named components of the UE 602. In addition to performing data transmission / reception as described above, the components of the AN 608 may perform various logical functions that include, for example, RNC functions such as radio bearer management, uplink and downlink dynamic radio resource management, and data packet scheduling. FIG. 7 illustrates components of a computing device 700 according to some example embodiments, able to read instructions from a machine-readable or computer-readable medium (e.g., a non-transitory machine-readable storage medium) and perform any one or more of the methodologies discussed herein. Specifically, FIG.7 shows a diagrammatic representation of hardware resources 701 including one or more processors (or processor cores) 710, one or more memory / storage devices 720, and one or more communication resources 730, each of which may be communicatively coupled via a bus 740 or other interface circuitry. For embodiments where node virtualization (e.g., NFV) is utilized, a hypervisor 702 may be executed to provide an execution environment for one or more network slices / sub-slices to utilize the hardware resources 701. The processors 710 include, for example, processor 712 and processor 714. The processors 710 include circuitry such as, but not limited to one or more processor cores and one or more of cache memory, low drop-out voltage regulators (LDOs), interrupt controllers, serial interfaces such as SPI, I2C or universal programmable serial interface circuit, real time clock (RTC), timer-counters including interval and watchdog timers, general purpose I / O, memory card controllers such as secure digital / multi-media card (SD / MMC) or similar, interfaces, mobile industry processor interface (MIPI) interfaces and Joint Test Access Group (JTAG) test access ports. The processors 710 may be, for example, a central processing unit (CPU), reduced instruction set computing (RISC) processors, Acorn RISC Machine (ARM) processors, complex instruction set computing (CISC) processors, graphics processing units (GPUs), one or more Digital Signal Processors (DSPs) such as a baseband processor, Application-Specific Integrated Circuits (ASICs), an Field-Programmable Gate Array (FPGA), a radio-frequency integrated circuit (RFIC), one or more microprocessors or controllers, another processor (including those discussed herein), or any suitable combination thereof. In some implementations, the processor circuitry 710 may include one or more hardware accelerators, which may be microprocessors, programmable processing devices (e.g., FPGA, complex programmable logic devices (CPLDs), etc.), or the like. The memory / storage devices 720 may include main memory, disk storage, or any suitable combination thereof. The memory / storage devices 720 may include, but are not Attorney Docket No. AG2913-PCT (31517-3503) limited to, any type of volatile, non-volatile, or semi-volatile memory such as random access memory (RAM), dynamic RAM (DRAM), static RAM (SRAM), synchronous DRAM (SDRAM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), Flash memory, solid-state storage, phase change RAM (PRAM), resistive memory such as magnetoresistive random access memory (MRAM), etc., and may incorporate three-dimensional (3D) cross-point (XPOINT) memories from Intel® and Micron®. The memory / storage devices 720 may also comprise persistent storage devices, which may be temporal and / or persistent storage of any type, including, but not limited to, non-volatile memory, optical, magnetic, and / or solid state mass storage, and so forth. The communication resources 730 may include interconnection or network interface controllers, components, or other suitable devices to communicate with one or more peripheral devices 704 or one or more databases 706 or other network elements via a network 708. For example, the communication resources 730 may include wired communication components (e.g., for coupling via USB, Ethernet, Ethernet, Ethernet over GRE Tunnels, Ethernet over Multiprotocol Label Switching (MPLS), Ethernet over USB, Controller Area Network (CAN), Local Interconnect Network (LIN), DeviceNet, ControlNet, Data Highway+, PROFIBUS, or PROFINET, among many others), cellular communication components, NFC components, Bluetooth® (or Bluetooth® Low Energy) components, WiFi® components, and other communication components. Network connectivity may be provided to / from the computing device 700 via the communication resources 730 using a physical connection, which may be electrical (e.g., a “copper interconnect”) or optical. The physical connection also includes suitable input connectors (e.g., ports, receptacles, sockets, etc.) and output connectors (e.g., plugs, pins, etc.). The communication resources 730 may include one or more dedicated processors and / or FPGAs to communicate using one or more of the aforementioned network interface protocols. Instructions 750 may comprise software, a program, an application, an applet, an app, or other executable code for causing at least any of the processors 710 to perform any one or more of the methodologies discussed herein. The instructions 750 may reside, completely or partially, within at least one of the processors 710 (e.g., within the processor’s cache memory), the memory / storage devices 720, or any suitable combination thereof. Furthermore, any portion of the instructions 750 may be transferred to the hardware resources 701 from any combination of the peripheral devices 704 or the databases 706. Accordingly, the memory of Attorney Docket No. AG2913-PCT (31517-3503) processors 710, the memory / storage devices 720, the peripheral devices 704, and the databases 706 are examples of computer-readable and machine-readable media. FIG.8 illustrates a network 800 in accordance with various embodiments. The network 800 may operate in a matter consistent with 3GPP technical specifications or technical reports for 6G systems. In some embodiments, the network 800 may operate concurrently with network 500. For example, in some embodiments, the network 800 may share one or more frequency or bandwidth resources with network 500. As one specific example, a UE (e.g., UE 802) may be configured to operate in both network 800 and network 500. Such configuration may be based on a UE including circuitry configured for communication with frequency and bandwidth resources of both networks 500 and 800. In general, several elements of network 800 may share one or more characteristics with elements of network 500. For the sake of brevity and clarity, such elements may not be repeated in the description of network 800. The network 800 may include a UE 802, which may include any mobile or non-mobile computing device designed to communicate with a RAN 808 via an over-the-air connection. The UE 802 may be similar to, for example, UE 502. The UE 802 may be, but is not limited to, a smartphone, tablet computer, wearable computer device, desktop computer, laptop computer, in-vehicle infotainment, in-car entertainment device, instrument cluster, head-up display device, onboard diagnostic device, dashtop mobile equipment, mobile data terminal, electronic engine management system, electronic / engine control unit, electronic / engine control module, embedded system, sensor, microcontroller, control module, engine management system, networked appliance, machine-type communication device, M2M or D2D device, IoT device, etc. Although not specifically shown in FIG.8, in some embodiments the network 800 may include a plurality of UEs coupled directly with one another via a sidelink interface. The UEs may be M2M / D2D devices that communicate using physical sidelink channels such as, but not limited to, PSBCH, PSDCH, PSSCH, PSCCH, PSFCH, etc. Similarly, although not specifically shown in FIG. 8, the UE 802 may be communicatively coupled with an AP such as AP 506 as described with respect to FIG.5. Additionally, although not specifically shown in FIG.8, in some embodiments the RAN 808 may include one or more ANss such as AN 508 as described with respect to FIG. 5. The RAN 808 and / or the AN of the RAN 808 may be referred to as a base station (BS), a RAN node, or using some other term or name. The UE 802 and the RAN 808 may be configured to communicate via an air interface that may be referred to as a sixth generation (6G) air interface. The 6G air interface may include one or more features such as communication in a terahertz (THz) or sub-THz Attorney Docket No. AG2913-PCT (31517-3503) bandwidth, or joint communication and sensing. As used herein, the term “joint communication and sensing” may refer to a system that allows for wireless communication as well as radar-based sensing via various types of multiplexing. As used herein, THz or sub- THz bandwidths may refer to communication in the 80 GHz and above frequency ranges. Such frequency ranges may additionally or alternatively be referred to as “millimeter wave” or “mmWave” frequency ranges. The RAN 808 may allow for communication between the UE 802 and a 6G core network (CN) 810. Specifically, the RAN 808 may facilitate the transmission and reception of data between the UE 802 and the 6G CN 810. The 6G CN 810 may include various functions such as NSSF 550, NEF 552, NRF 554, PCF 556, UDM 558, AF 560, SMF 546, and AUSF 542. The 6G CN 810 may additional include UPF 548 and DN 536 as shown in FIG.8. Additionally, the RAN 808 may include various additional functions that are in addition to, or alternative to, functions of a legacy cellular network such as a 4G or 5G network. Two such functions may include a Compute Control Function (Comp CF) 824 and a Compute Service Function (Comp SF) 836. The Comp CF 824 and the Comp SF 836 may be parts or functions of the Computing Service Plane. Comp CF 824 may be a control plane function that provides functionalities such as management of the Comp SF 836, computing task context generation and management (e.g., create, read, modify, delete), interaction with the underlaying computing infrastructure for computing resource management, etc. Comp SF 836 may be a user plane function that serves as the gateway to interface computing service users (such as UE 802) and computing nodes behind a Comp SF instance. Some functionalities of the Comp SF 836 may include: parse computing service data received from users to compute tasks executable by computing nodes; hold service mesh ingress gateway or service API gateway; service and charging policies enforcement; performance monitoring and telemetry collection, etc. In some embodiments, a Comp SF 836 instance may serve as the user plane gateway for a cluster of computing nodes. A Comp CF 824 instance may control one or more Comp SF 836 instances. Two other such functions may include a Communication Control Function (Comm CF) 828 and a Communication Service Function (Comm SF) 838, which may be parts of the Communication Service Plane. The Comm CF 828 may be the control plane function for managing the Comm SF 838, communication sessions creation / configuration / releasing, and managing communication session context. The Comm SF 838 may be a user plane function for data transport. Comm CF 828 and Comm SF 838 may be considered as upgrades of SMF 546 and UPF 548, which were described with respect to a 5G system in FIG.5. The upgrades Attorney Docket No. AG2913-PCT (31517-3503) provided by the Comm CF 828 and the Comm SF 838 may enable service-aware transport. For legacy (e.g., 4G or 5G) data transport, SMF 546 and UPF 548 may still be used. Two other such functions may include a Data Control Function (Data CF) 822 and Data Service Function (Data SF) 832 may be parts of the Data Service Plane. Data CF 822 may be a control plane function and provides functionalities such as Data SF 832 management, Data service creation / configuration / releasing, Data service context management, etc. Data SF 832 may be a user plane function and serve as the gateway between data service users (such as UE 802 and the various functions of the 6G CN 810) and data service endpoints behind the gateway. Specific functionalities may include include: parse data service user data and forward to corresponding data service endpoints, generate charging data, report data service status. Another such function may be the Service Orchestration and Chaining Function (SOCF) 820, which may discover, orchestrate and chain up communication / computing / data services provided by functions in the network. Upon receiving service requests from users, SOCF 820 may interact with one or more of Comp CF 824, Comm CF 828, and Data CF 822 to identify Comp SF 836, Comm SF 838, and Data SF 832 instances, configure service resources, and generate the service chain, which could contain multiple Comp SF 836, Comm SF 838, and Data SF 832 instances and their associated computing endpoints. Workload processing and data movement may then be conducted within the generated service chain. The SOCF 820 may also responsible for maintaining, updating, and releasing a created service chain. Another such function may be the service registration function (SRF) 814, which may act as a registry for system services provided in the user plane such as services provided by service endpoints behind Comp SF 836 and Data SF 832 gateways and services provided by the UE 802. The SRF 814 may be considered a counterpart of NRF 554, which may act as the registry for network functions. Other such functions may include an evolved service communication proxy (eSCP) and service infrastructure control function (SICF) 826, which may provide service communication infrastructure for control plane services and user plane services. The eSCP may be related to the service communication proxy (SCP) of 5G with user plane service communication proxy capabilities being added. The eSCP is therefore expressed in two parts: eCSP-C 812 and eSCP- U 834, for control plane service communication proxy and user plane service communication proxy, respectively. The SICF 826 may control and configure eCSP instances in terms of service traffic routing policies, access rules, load balancing configurations, performance monitoring, etc. Attorney Docket No. AG2913-PCT (31517-3503) Another such function is the AMF 844. The AMF 844 may be similar to 544, but with additional functionality. Specifically, the AMF 844 may include potential functional repartition, such as move the message forwarding functionality from the AMF 844 to the RAN 808. Another such function is the service orchestration exposure function (SOEF) 818. The SOEF may be configured to expose service orchestration and chaining services to external users such as applications. The UE 802 may include an additional function that is referred to as a computing client service function (comp CSF) 804. The comp CSF 804 may have both the control plane functionalities and user plane functionalities, and may interact with corresponding network side functions such as SOCF 820, Comp CF 824, Comp SF 836, Data CF 822, and / or Data SF 832 for service discovery, request / response, compute task workload exchange, etc. The Comp CSF 804 may also work with network side functions to decide on whether a computing task should be run on the UE 802, the RAN 808, and / or an element of the 6G CN 810. The UE 802 and / or the Comp CSF 804 may include a service mesh proxy 806. The service mesh proxy 806 may act as a proxy for service-to-service communication in the user plane. Capabilities of the service mesh proxy 806 may include one or more of addressing, security, load balancing, etc. For one or more embodiments, at least one of the components set forth in one or more of the preceding figures may be configured to perform one or more operations, techniques, processes, and / or methods as set forth in the example section below. For example, the baseband circuitry as described above in connection with one or more of the preceding figures may be configured to operate in accordance with one or more of the examples set forth below. For another example, circuitry associated with a UE, base station, network element, etc. as described above in connection with one or more of the preceding figures may be configured to operate in accordance with one or more of the examples set forth below in the example section. Additional examples of the presently described embodiments include the following, non-limiting implementations. Each of the following non-limiting examples may stand on its own or may be combined in any permutation or combination with any one or more of the other examples provided below or throughout the present disclosure. For one or more embodiments, at least one of the components set forth in one or more of the preceding figures may be configured to perform one or more operations, techniques, processes, and / or methods as set forth in the example section below. For example, the baseband circuitry as described above in connection with one or more of the preceding figures may be Attorney Docket No. AG2913-PCT (31517-3503) configured to operate in accordance with one or more of the examples set forth below. For another example, circuitry associated with a UE, base station, network element, etc. as described above in connection with one or more of the preceding figures may be configured to operate in accordance with one or more of the examples set forth below. The following examples pertain to further embodiments. Example 1 may include an apparatus for a user equipment (UE) configured to manage physical random access channel (PRACH) transmissions comprising a processor configured to: generate a PRACH transmission with multiple preamble repetitions; determine a first valid PRACH occasion based on a configured time offset; determine PRACH occasions in an order by increasing frequency resource indexes and then increasing time resource indexes; perform the PRACH transmission with multiple preamble repetitions using the same preamble index and spatial domain filter. Example 2 may include the apparatus of example 1 and / or some other example herein, wherein the processing circuitry may be further configured to determine PRACH occasions for PRACH preamble repetitions associated with the same SS / PBCH block index. Example 3 may include the apparatus of example 1 and / or some other example herein, wherein the processing circuitry may be further configured to determine PRACH occasions for PRACH preamble repetitions that are consecutive in time. Example 4 may include the apparatus of example 1 and / or some other example herein, wherein the processing circuitry may be further configured to use the same frequency resources for PRACH preamble repetitions . Example 5 may include the apparatus of example 1 and / or some other example herein, wherein the processing circuitry may be further configured to determine subsequent PRACH occasions for PRACH preamble repetitions after the configured time offset. Example 6 may include the apparatus of example 1 and / or some other example herein, wherein the processing circuitry may be further configured to prioritize frequency resource indexes for frequency multiplexed PRACH occasions. Example 7 may include the apparatus of example 1 and / or some other example herein, wherein the processing circuitry may be further configured to prioritize time resource indexes for time multiplexed PRACH occasions. Example 8 may include the apparatus of example 1 and / or some other example herein, wherein the processing circuitry may be further configured to apply the Type-1 random access procedure. Attorney Docket No. AG2913-PCT (31517-3503) Example 9 may include the apparatus of example 1 and / or some other example herein, wherein the processing circuitry may be further configured to utilize a same preamble index for PRACH preamble repetitions. Example 10 may include a computer-readable medium storing computer-executable instructions which when executed by one or more processors result in performing operations comprising: generating a PRACH transmission with multiple preamble repetitions; determining a first valid PRACH occasion based on a configured time offset; determining PRACH occasions in an order by increasing frequency resource indexes and then increasing time resource indexes; performing the PRACH transmission with multiple preamble repetitions using the same preamble index and spatial domain filter. Example 11 may include the computer-readable medium of example 10 and / or some other example herein, wherein the operations further comprise determining PRACH occasions for PRACH preamble repetitions associated with the same SS / PBCH block index. Example 12 may include the computer-readable medium of example 10 and / or some other example herein, wherein the operations further comprise determining PRACH occasions for PRACH preamble repetitions that are consecutive in time. Example 13 may include the computer-readable medium of example 10 and / or some other example herein, wherein the operations further comprise using the same frequency resources for PRACH preamble repetitions . Example 14 may include the computer-readable medium of example 10 and / or some other example herein, wherein the operations further comprise determining subsequent PRACH occasions for PRACH preamble repetitions after the configured time offset. Example 15 may include the computer-readable medium of example 10 and / or some other example herein, wherein the operations further comprise prioritizing frequency resource indexes for frequency multiplexed PRACH occasions. Example 16 may include the computer-readable medium of example 10 and / or some other example herein, wherein the operations further comprise prioritizing time resource indexes for time multiplexed PRACH occasions. Example 17 may include the computer-readable medium of example 10 and / or some other example herein, wherein the operations further comprise applying the Type-1 random access procedure. Example 18 may include the computer-readable medium of example 10 and / or some other example herein, wherein the operations further comprise utilizing a same preamble index for PRACH preamble repetitions. Attorney Docket No. AG2913-PCT (31517-3503) Example 19 may include a method comprising: generating a PRACH transmission with multiple preamble repetitions; determining a first valid PRACH occasion based on a configured time offset; determining PRACH occasions in an order by increasing frequency resource indexes and then increasing time resource indexes; performing the PRACH transmission with multiple preamble repetitions using the same preamble index and spatial domain filter. Example 20 may include the method of example 19 and / or some other example herein, further comprising determining PRACH occasions for PRACH preamble repetitions associated with the same SS / PBCH block index. Example 21 may include the method of example 19 and / or some other example herein, further comprising determining PRACH occasions for PRACH preamble repetitions that are consecutive in time. Example 22 may include the method of example 19 and / or some other example herein, further comprising using the same frequency resources for PRACH preamble repetitions. Example 23 may include the method of example 19 and / or some other example herein, further comprising determining subsequent PRACH occasions for PRACH preamble repetitions after the configured time offset. Example 24 may include the method of example 19 and / or some other example herein, further comprising prioritizing frequency resource indexes for frequency multiplexed PRACH occasions. Example 25 may include the method of example 19 and / or some other example herein, further comprising prioritizing time resource indexes for time multiplexed PRACH occasions. Example 26 may include the method of example 19 and / or some other example herein, further comprising applying the Type-1 random access procedure. Example 27 may include the method of example 19 and / or some other example herein, further comprising utilizing a same preamble index for PRACH preamble repetitions. Example 28 may include an apparatus comprising means for: generating a PRACH transmission with multiple preamble repetitions; determining a first valid PRACH occasion based on a configured time offset; determining PRACH occasions in an order by increasing frequency resource indexes and then increasing time resource indexes; performing the PRACH transmission with multiple preamble repetitions using the same preamble index and spatial domain filter. Attorney Docket No. AG2913-PCT (31517-3503) Example 29 may include the apparatus of example 28 and / or some other example herein, further comprising determining PRACH occasions for PRACH preamble repetitions associated with the same SS / PBCH block index. Example 30 may include the apparatus of example 28 and / or some other example herein, further comprising determining PRACH occasions for PRACH preamble repetitions that are consecutive in time. Example 31 may include the apparatus of example 28 and / or some other example herein, further comprising using the same frequency resources for PRACH preamble repetitions. Example 32 may include the apparatus of example 28 and / or some other example herein, further comprising determining subsequent PRACH occasions for PRACH preamble repetitions after the configured time offset. Example 33 may include the apparatus of example 28 and / or some other example herein, further comprising prioritizing frequency resource indexes for frequency multiplexed PRACH occasions. Example 34 may include the apparatus of example 28 and / or some other example herein, further comprising prioritizing time resource indexes for time multiplexed PRACH occasions. Example 35 may include the apparatus of example 28 and / or some other example herein, further comprising applying the Type-1 random access procedure. Example 36 may include the apparatus of example 28 and / or some other example herein, further comprising utilizing a same preamble index for PRACH preamble repetitions. Example 37 may include an apparatus comprising means for performing any of the methods of examples 1-36. Example 38 may include a network node comprising a communication interface and processing circuitry connected thereto and configured to perform the methods of examples 1- 36. Example 39 may include an apparatus comprising means to perform one or more elements of a method described in or related to any of examples 1-36, or any other method or process described herein. Example 40 may include one or more non-transitory computer-readable media comprising instructions to cause an electronic device, upon execution of the instructions by one or more processors of the electronic device, to perform one or more elements of a method Attorney Docket No. AG2913-PCT (31517-3503) described in or related to any of examples 1-36, or any other method or process described herein. Example 41 may include an apparatus comprising logic, modules, or circuitry to perform one or more elements of a method described in or related to any of examples 1-36, or any other method or process described herein. Example 42 may include a method, technique, or process as described in or related to any of examples 1-36, or portions or parts thereof. Example 43 may include an apparatus comprising: one or more processors and one or more computer-readable media comprising instructions that, when executed by the one or more processors, cause the one or more processors to perform the method, techniques, or process as described in or related to any of examples 1-36, or portions thereof. Example 44 may include a signal as described in or related to any of examples 1-36, or portions or parts thereof. Example 45 may include a datagram, packet, frame, segment, protocol data unit (PDU), or message as described in or related to any of examples 1-36, or portions or parts thereof, or otherwise described in the present disclosure. Example 46 may include a signal encoded with data as described in or related to any of examples 1-36, or portions or parts thereof, or otherwise described in the present disclosure. Example 47 may include a signal encoded with a datagram, packet, frame, segment, protocol data unit (PDU), or message as described in or related to any of examples 1-36, or portions or parts thereof, or otherwise described in the present disclosure. Example 48 may include an electromagnetic signal carrying computer-readable instructions, wherein execution of the computer-readable instructions by one or more processors is to cause the one or more processors to perform the method, techniques, or process as described in or related to any of examples 1-36, or portions thereof. Example 49 may include a computer program comprising instructions, wherein execution of the program by a processing element is to cause the processing element to carry out the method, techniques, or process as described in or related to any of examples 1-36, or portions thereof. Example 50 may include a signal in a wireless network as shown and described herein. Example 51 may include a method of communicating in a wireless network as shown and described herein. Example 52 may include a system for providing wireless communication as shown and described herein. Attorney Docket No. AG2913-PCT (31517-3503) Example 53 may include a device for providing wireless communication as shown and described herein. An example implementation is an edge computing system, including respective edge processing devices and nodes to invoke or perform the operations of the examples above, or other subject matter described herein. Another example implementation is a client endpoint node, operable to invoke or perform the operations of the examples above, or other subject matter described herein. Another example implementation is an aggregation node, network hub node, gateway node, or core data processing node, within or coupled to an edge computing system, operable to invoke or perform the operations of the examples above, or other subject matter described herein. Another example implementation is an access point, base station, road-side unit, street-side unit, or on-premise unit, within or coupled to an edge computing system, operable to invoke or perform the operations of the examples above, or other subject matter described herein. Another example implementation is an edge provisioning node, service orchestration node, application orchestration node, or multi-tenant management node, within or coupled to an edge computing system, operable to invoke or perform the operations of the examples above, or other subject matter described herein. Another example implementation is an edge node operating an edge provisioning service, application or service orchestration service, virtual machine deployment, container deployment, function deployment, and compute management, within or coupled to an edge computing system, operable to invoke or perform the operations of the examples above, or other subject matter described herein. Another example implementation is an edge computing system operable as an edge mesh, as an edge mesh with side car loading, or with mesh-to-mesh communications, operable to invoke or perform the operations of the examples above, or other subject matter described herein. Another example implementation is an edge computing system including aspects of network functions, acceleration functions, acceleration hardware, storage hardware, or computation hardware resources, operable to invoke or perform the use cases discussed herein, with use of the examples above, or other subject matter described herein. Another example implementation is an edge computing system adapted for supporting client mobility, vehicle-to-vehicle (V2V), vehicle-to-everything (V2X), or vehicle-to-infrastructure (V2I) scenarios, and optionally operating according to ETSI MEC specifications, operable to invoke or perform the use cases discussed herein, with use of the examples above, or other subject matter described herein. Another example implementation is an edge computing system adapted for mobile wireless communications, including configurations according to an 3GPP 4G / LTE or 5G network capabilities, operable to invoke or perform the use cases discussed Attorney Docket No. AG2913-PCT (31517-3503) herein, with use of the examples above, or other subject matter described herein. Another example implementation is a computing system adapted for network communications, including configurations according to an O-RAN capabilities, operable to invoke or perform the use cases discussed herein, with use of the examples above, or other subject matter described herein. Any of the above-described examples may be combined with any other example (or combination of examples), unless explicitly stated otherwise. The foregoing description of one or more implementations provides illustration and description, but is not intended to be exhaustive or to limit the scope of embodiments to the precise form disclosed. Modifications and variations are possible in light of the above teachings or may be acquired from practice of various embodiments. TERMINOLOGY The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. As used herein, the singular forms “a,” “an” and “the” are intended to include plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and / or “comprising,” when used in this specification, specific the presence of stated features, integers, steps, operations, elements, and / or components, but do not preclude the presence or addition of one or more other features, integers, steps, operation, elements, components, and / or groups thereof. For the purposes of the present disclosure, the phrase “A and / or B” means (A), (B), or (A and B). For the purposes of the present disclosure, the phrase “A, B, and / or C” means (A), (B), (C), (A and B), (A and C), (B and C), or (A, B and C). The description may use the phrases “in an embodiment,” or “In some embodiments,” which may each refer to one or more of the same or different embodiments. Furthermore, the terms “comprising,” “including,” “having,” and the like, as used with respect to embodiments of the present disclosure, are synonymous. The terms “coupled,” “communicatively coupled,” along with derivatives thereof are used herein. The term “coupled” may mean two or more elements are in direct physical or electrical contact with one another, may mean that two or more elements indirectly contact each other but still cooperate or interact with each other, and / or may mean that one or more other elements are coupled or connected between the elements that are said to be coupled with each other. The term “directly coupled” may mean that two or more elements are in direct contact with one another. The term “communicatively coupled” may mean that two or more Attorney Docket No. AG2913-PCT (31517-3503) elements may be in contact with one another by a means of communication including through a wire or other interconnect connection, through a wireless communication channel or ink, and / or the like. The term “circuitry” as used herein refers to, is part of, or includes hardware components such as an electronic circuit, a logic circuit, a processor (shared, dedicated, or group) and / or memory (shared, dedicated, or group), an Application Specific Integrated Circuit (ASIC), a field-programmable device (FPD) (e.g., a field-programmable gate array (FPGA), a programmable logic device (PLD), a complex PLD (CPLD), a high-capacity PLD (HCPLD), a structured ASIC, or a programmable SoC), digital signal processors (DSPs), etc., that are configured to provide the described functionality. In some embodiments, the circuitry may execute one or more software or firmware programs to provide at least some of the described functionality. The term “circuitry” may also refer to a combination of one or more hardware elements (or a combination of circuits used in an electrical or electronic system) with the program code used to carry out the functionality of that program code. In these embodiments, the combination of hardware elements and program code may be referred to as a particular type of circuitry. The term “processor circuitry” as used herein refers to, is part of, or includes circuitry capable of sequentially and automatically carrying out a sequence of arithmetic or logical operations, or recording, storing, and / or transferring digital data. Processing circuitry may include one or more processing cores to execute instructions and one or more memory structures to store program and data information. The term “processor circuitry” may refer to one or more application processors, one or more baseband processors, a physical central processing unit (CPU), a single-core processor, a dual-core processor, a triple-core processor, a quad-core processor, and / or any other device capable of executing or otherwise operating computer-executable instructions, such as program code, software modules, and / or functional processes. Processing circuitry may include more hardware accelerators, which may be microprocessors, programmable processing devices, or the like. The one or more hardware accelerators may include, for example, computer vision (CV) and / or deep learning (DL) accelerators. The terms “application circuitry” and / or “baseband circuitry” may be considered synonymous to, and may be referred to as, “processor circuitry.” The term “memory” and / or “memory circuitry” as used herein refers to one or more hardware devices for storing data, including RAM, MRAM, PRAM, DRAM, and / or SDRAM, core memory, ROM, magnetic disk storage mediums, optical storage mediums, flash memory devices or other machine readable mediums for storing data. The term “computer-readable Attorney Docket No. AG2913-PCT (31517-3503) medium” may include, but is not limited to, memory, portable or fixed storage devices, optical storage devices, and various other mediums capable of storing, containing or carrying instructions or data. The term “interface circuitry” as used herein refers to, is part of, or includes circuitry that enables the exchange of information between two or more components or devices. The term “interface circuitry” may refer to one or more hardware interfaces, for example, buses, I / O interfaces, peripheral component interfaces, network interface cards, and / or the like. The term “user equipment” or “UE” as used herein refers to a device with radio communication capabilities and may describe a remote user of network resources in a communications network. The term “user equipment” or “UE” may be considered synonymous to, and may be referred to as, client, mobile, mobile device, mobile terminal, user terminal, mobile unit, mobile station, mobile user, subscriber, user, remote station, access agent, user agent, receiver, radio equipment, reconfigurable radio equipment, reconfigurable mobile device, etc. Furthermore, the term “user equipment” or “UE” may include any type of wireless / wired device or any computing device including a wireless communications interface. The term “network element” as used herein refers to physical or virtualized equipment and / or infrastructure used to provide wired or wireless communication network services. The term “network element” may be considered synonymous to and / or referred to as a networked computer, networking hardware, network equipment, network node, router, switch, hub, bridge, radio network controller, RAN device, RAN node, gateway, server, virtualized VNF, NFVI, and / or the like. The term “computer system” as used herein refers to any type interconnected electronic devices, computer devices, or components thereof. Additionally, the term “computer system” and / or “system” may refer to various components of a computer that are communicatively coupled with one another. Furthermore, the term “computer system” and / or “system” may refer to multiple computer devices and / or multiple computing systems that are communicatively coupled with one another and configured to share computing and / or networking resources. The term “appliance,” “computer appliance,” or the like, as used herein refers to a computer device or computer system with program code (e.g., software or firmware) that is specifically designed to provide a specific computing resource. A “virtual appliance” is a virtual machine image to be implemented by a hypervisor-equipped device that virtualizes or emulates a computer appliance or otherwise is dedicated to provide a specific computing resource. The term “element” refers to a unit that is indivisible at a given level of abstraction Attorney Docket No. AG2913-PCT (31517-3503) and has a clearly defined boundary, wherein an element may be any type of entity including, for example, one or more devices, systems, controllers, network elements, modules, etc., or combinations thereof. The term “device” refers to a physical entity embedded inside, or attached to, another physical entity in its vicinity, with capabilities to convey digital information from or to that physical entity. The term “entity” refers to a distinct component of an architecture or device, or information transferred as a payload. The term “controller” refers to an element or entity that has the capability to affect a physical entity, such as by changing its state or causing the physical entity to move. The term “cloud computing” or “cloud” refers to a paradigm for enabling network access to a scalable and elastic pool of shareable computing resources with self-service provisioning and administration on-demand and without active management by users. Cloud computing provides cloud computing services (or cloud services), which are one or more capabilities offered via cloud computing that are invoked using a defined interface (e.g., an API or the like). The term “computing resource” or simply “resource” refers to any physical or virtual component, or usage of such components, of limited availability within a computer system or network. Examples of computing resources include usage / access to, for a period of time, servers, processor(s), storage equipment, memory devices, memory areas, networks, electrical power, input / output (peripheral) devices, mechanical devices, network connections (e.g., channels / links, ports, network sockets, etc.), operating systems, virtual machines (VMs), software / applications, computer files, and / or the like. A “hardware resource” may refer to compute, storage, and / or network resources provided by physical hardware element(s). A “virtualized resource” may refer to compute, storage, and / or network resources provided by virtualization infrastructure to an application, device, system, etc. The term “network resource” or “communication resource” may refer to resources that are accessible by computer devices / systems via a communications network. The term “system resources” may refer to any kind of shared entities to provide services, and may include computing and / or network resources. System resources may be considered as a set of coherent functions, network data objects or services, accessible through a server where such system resources reside on a single host or multiple hosts and are clearly identifiable. As used herein, the term “cloud service provider” (or CSP) indicates an organization which operates typically large-scale “cloud” resources comprised of centralized, regional, and edge data centers (e.g., as used in the context of the public cloud). In other examples, a CSP may also be referred to as a Cloud Service Operator (CSO). References to “cloud computing” generally refer to computing resources and Attorney Docket No. AG2913-PCT (31517-3503) services offered by a CSP or a CSO, at remote locations with at least some increased latency, distance, or constraints relative to edge computing. As used herein, the term “data center” refers to a purpose-designed structure that is intended to house multiple high-performance compute and data storage nodes such that a large amount of compute, data storage and network resources are present at a single location. This often entails specialized rack and enclosure systems, suitable heating, cooling, ventilation, security, fire suppression, and power delivery systems. The term may also refer to a compute and data storage node in some contexts. A data center may vary in scale between a centralized or cloud data center (e.g., largest), regional data center, and edge data center (e.g., smallest). As used herein, the term “edge computing” refers to the implementation, coordination, and use of computing and resources at locations closer to the “edge” or collection of “edges” of a network. Deploying computing resources at the network’s edge may reduce application and network latency, reduce network backhaul traffic and associated energy consumption, improve service capabilities, improve compliance with security or data privacy requirements (especially as compared to conventional cloud computing), and improve total cost of ownership). As used herein, the term “edge compute node” refers to a real-world, logical, or virtualized implementation of a compute-capable element in the form of a device, gateway, bridge, system or subsystem, component, whether operating in a server, client, endpoint, or peer mode, and whether located at an “edge” of an network or at a connected location further within the network. References to a “node” used herein are generally interchangeable with a “device”, “component”, and “sub-system”; however, references to an “edge computing system” or “edge computing network” generally refer to a distributed architecture, organization, or collection of multiple nodes and devices, and which is organized to accomplish or offer some aspect of services or resources in an edge computing setting. Additionally or alternatively, the term “Edge Computing” refers to a concept, as described in [6], that enables operator and 3rd party services to be hosted close to the UE's access point of attachment, to achieve an efficient service delivery through the reduced end-to- end latency and load on the transport network. As used herein, the term “Edge Computing Service Provider” refers to a mobile network operator or a 3rd party service provider offering Edge Computing service. As used herein, the term “Edge Data Network” refers to a local Data Network (DN) that supports the architecture for enabling edge applications. As used herein, the term “Edge Hosting Environment” refers to an environment providing support required for Edge Application Server's execution. As used herein, the term “Application Server” refers to application software resident in the cloud performing the server function. Attorney Docket No. AG2913-PCT (31517-3503) The term “Internet of Things” or “IoT” refers to a system of interrelated computing devices, mechanical and digital machines capable of transferring data with little or no human interaction, and may involve technologies such as real-time analytics, machine learning and / or AI, embedded systems, wireless sensor networks, control systems, automation (e.g., smarthome, smart building and / or smart city technologies), and the like. IoT devices are usually low-power devices without heavy compute or storage capabilities. “Edge IoT devices” may be any kind of IoT devices deployed at a network’s edge. As used herein, the term “cluster” refers to a set or grouping of entities as part of an edge computing system (or systems), in the form of physical entities (e.g., different computing systems, networks or network groups), logical entities (e.g., applications, functions, security constructs, containers), and the like. In some locations, a “cluster” is also referred to as a “group” or a “domain”. The membership of cluster may be modified or affected based on conditions or functions, including from dynamic or property-based membership, from network or system management scenarios, or from various example techniques discussed below which may add, modify, or remove an entity in a cluster. Clusters may also include or be associated with multiple layers, levels, or properties, including variations in security features and results based on such layers, levels, or properties. The term “application” may refer to a complete and deployable package, environment to achieve a certain function in an operational environment. The term “AI / ML application” or the like may be an application that contains some AI / ML models and application-level descriptions. The term “machine learning” or “ML” refers to the use of computer systems implementing algorithms and / or statistical models to perform specific task(s) without using explicit instructions, but instead relying on patterns and inferences. ML algorithms build or estimate mathematical model(s) (referred to as “ML models” or the like) based on sample data (referred to as “training data,” “model training information,” or the like) in order to make predictions or decisions without being explicitly programmed to perform such tasks. Generally, an ML algorithm is a computer program that learns from experience with respect to some task and some performance measure, and an ML model may be any object or data structure created after an ML algorithm is trained with one or more training datasets. After training, an ML model may be used to make predictions on new datasets. Although the term “ML algorithm” refers to different concepts than the term “ML model,” these terms as discussed herein may be used interchangeably for the purposes of the present disclosure. The term “machine learning model,” “ML model,” or the like may also refer to ML methods and concepts used by an ML-assisted solution. An “ML-assisted solution” is a Attorney Docket No. AG2913-PCT (31517-3503) solution that addresses a specific use case using ML algorithms during operation. ML models include supervised learning (e.g., linear regression, k-nearest neighbor (KNN), decision tree algorithms, support machine vectors, Bayesian algorithm, ensemble algorithms, etc.) unsupervised learning (e.g., K-means clustering, principle component analysis (PCA), etc.), reinforcement learning (e.g., Q-learning, multi-armed bandit learning, deep RL, etc.), neural networks, and the like. Depending on the implementation a specific ML model could have many sub-models as components and the ML model may train all sub-models together. Separately trained ML models can also be chained together in an ML pipeline during inference. An “ML pipeline” is a set of functionalities, functions, or functional entities specific for an ML-assisted solution; an ML pipeline may include one or several data sources in a data pipeline, a model training pipeline, a model evaluation pipeline, and an actor. The “actor” is an entity that hosts an ML assisted solution using the output of the ML model inference). The term “ML training host” refers to an entity, such as a network function, that hosts the training of the model. The term “ML inference host” refers to an entity, such as a network function, that hosts model during inference mode (which includes both the model execution as well as any online learning if applicable). The ML-host informs the actor about the output of the ML algorithm, and the actor takes a decision for an action (an “action” is performed by an actor as a result of the output of an ML assisted solution). The term “model inference information” refers to information used as an input to the ML model for determining inference(s); the data used to train an ML model and the data used to determine inferences may overlap, however, “training data” and “inference data” refer to different concepts. The terms “instantiate,” “instantiation,” and the like as used herein refers to the creation of an instance. An “instance” also refers to a concrete occurrence of an object, which may occur, for example, during execution of program code. The term “information element” refers to a structural element containing one or more fields. The term “field” refers to individual contents of an information element, or a data element that contains content. As used herein, a “database object”, “data structure”, or the like may refer to any representation of information that is in the form of an object, attribute-value pair (AVP), key-value pair (KVP), tuple, etc., and may include variables, data structures, functions, methods, classes, database records, database fields, database entities, associations between data and / or database entities (also referred to as a “relation”), blocks and links between blocks in block chain implementations, and / or the like. An “information object,” as used herein, refers to a collection of structured data and / or any representation of information, and may include, for example electronic documents (or Attorney Docket No. AG2913-PCT (31517-3503) “documents”), database objects, data structures, files, audio data, video data, raw data, archive files, application packages, and / or any other like representation of information. The terms “electronic document” or “document,” may refer to a data structure, computer file, or resource used to record data, and includes various file types and / or data formats such as word processing documents, spreadsheets, slide presentations, multimedia items, webpage and / or source code documents, and / or the like. As examples, the information objects may include markup and / or source code documents such as HTML, XML, JSON, Apex®, CSS, JSP, MessagePack™, Apache® Thrift™, ASN.1, Google® Protocol Buffers (protobuf), or some other document(s) / format(s) such as those discussed herein. An information object may have both a logical and a physical structure. Physically, an information object comprises one or more units called entities. An entity is a unit of storage that contains content and is identified by a name. An entity may refer to other entities to cause their inclusion in the information object. An information object begins in a document entity, which is also referred to as a root element (or "root"). Logically, an information object comprises one or more declarations, elements, comments, character references, and processing instructions, all of which are indicated in the information object (e.g., using markup). The term “data item” as used herein refers to an atomic state of a particular object with at least one specific property at a certain point in time. Such an object is usually identified by an object name or object identifier, and properties of such an object are usually defined as database objects (e.g., fields, records, etc.), object instances, or data elements (e.g., mark-up language elements / tags, etc.). Additionally or alternatively, the term “data item” as used herein may refer to data elements and / or content items, although these terms may refer to difference concepts. The term “data element” or “element” as used herein refers to a unit that is indivisible at a given level of abstraction and has a clearly defined boundary. A data element is a logical component of an information object (e.g., electronic document) that may begin with a start tag (e.g., “<element>”) and end with a matching end tag (e.g., “< / element>”), or only has an empty element tag (e.g., “<element / >”). Any characters between the start tag and end tag, if any, are the element’s content (referred to herein as “content items” or the like). The content of an entity may include one or more content items, each of which has an associated datatype representation. A content item may include, for example, attribute values, character values, URIs, qualified names (qnames), parameters, and the like. A qname is a fully qualified name of an element, attribute, or identifier in an information object. A qname associates a URI of a namespace with a local name of an element, attribute, or identifier in that namespace. To make this association, the qname assigns a prefix to the local name that Attorney Docket No. AG2913-PCT (31517-3503) corresponds to its namespace. The qname comprises a URI of the namespace, the prefix, and the local name. Namespaces are used to provide uniquely named elements and attributes in information objects. Content items may include text content (e.g., “<element>content item< / element>”), attributes (e.g., “<element attribute="attributeValue">”), and other elements referred to as “child elements” (e.g., “<element1><element2>content item< / element2>< / element1>”). An “attribute” may refer to a markup construct including a name–value pair that exists within a start tag or empty element tag. Attributes contain data related to its element and / or control the element’s behavior. The term “resource” as used herein refers to a physical or virtual device, a physical or virtual component within a computing environment, and / or a physical or virtual component within a particular device, such as computer devices, mechanical devices, memory space, processor / CPU time, processor / CPU usage, processor and accelerator loads, hardware time or usage, electrical power, input / output operations, ports or network sockets, channel / link allocation, throughput, memory usage, storage, network, database and applications, workload units, and / or the like. A “hardware resource” may refer to compute, storage, and / or network resources provided by physical hardware element(s). A “virtualized resource” may refer to compute, storage, and / or network resources provided by virtualization infrastructure to an application, device, system, etc. The term “network resource” or “communication resource” may refer to resources that are accessible by computer devices / systems via a communications network. The term “system resources” may refer to any kind of shared entities to provide services, and may include computing and / or network resources. System resources may be considered as a set of coherent functions, network data objects or services, accessible through a server where such system resources reside on a single host or multiple hosts and are clearly identifiable. The term “channel” as used herein refers to any transmission medium, either tangible or intangible, which is used to communicate data or a data stream. The term “channel” may be synonymous with and / or equivalent to “communications channel,” “data communications channel,” “transmission channel,” “data transmission channel,” “access channel,” “data access channel,” “link,” “data link,” “carrier,” “radiofrequency carrier,” and / or any other like term denoting a pathway or medium through which data is communicated. Additionally, the term “link” as used herein refers to a connection between two devices through a RAT for the purpose of transmitting and receiving information. As used herein, the term “radio technology” refers to technology for wireless transmission and / or reception of electromagnetic radiation for information transfer. The term “radio access technology” or “RAT” refers to the technology used for the underlying physical connection to a radio based Attorney Docket No. AG2913-PCT (31517-3503) communication network. As used herein, the term “communication protocol” (either wired or wireless) refers to a set of standardized rules or instructions implemented by a communication device and / or system to communicate with other devices and / or systems, including instructions for packetizing / depacketizing data, modulating / demodulating signals, implementation of protocols stacks, and / or the like. As used herein, the term “radio technology” refers to technology for wireless transmission and / or reception of electromagnetic radiation for information transfer. The term “radio access technology” or “RAT” refers to the technology used for the underlying physical connection to a radio based communication network. As used herein, the term “communication protocol” (either wired or wireless) refers to a set of standardized rules or instructions implemented by a communication device and / or system to communicate with other devices and / or systems, including instructions for packetizing / depacketizing data, modulating / demodulating signals, implementation of protocols stacks, and / or the like. Examples of wireless communications protocols may be used in various embodiments include a Global System for Mobile Communications (GSM) radio communication technology, a General Packet Radio Service (GPRS) radio communication technology, an Enhanced Data Rates for GSM Evolution (EDGE) radio communication technology, and / or a Third Generation Partnership Project (3GPP) radio communication technology including, for example, 3GPP Fifth Generation (5G) or New Radio (NR), Universal Mobile Telecommunications System (UMTS), Freedom of Multimedia Access (FOMA), Long Term Evolution (LTE), LTE- Advanced (LTE Advanced), LTE Extra, LTE-A Pro, cdmaOne (2G), Code Division Multiple Access 2000 (CDMA 2000), Cellular Digital Packet Data (CDPD), Mobitex, Circuit Switched Data (CSD), High-Speed CSD (HSCSD), Universal Mobile Telecommunications System (UMTS), Wideband Code Division Multiple Access (W-CDM), High Speed Packet Access (HSPA), HSPA Plus (HSPA+), Time Division-Code Division Multiple Access (TD-CDMA), Time Division-Synchronous Code Division Multiple Access (TD-SCDMA), LTE LAA, MuLTEfire, UMTS Terrestrial Radio Access (UTRA), Evolved UTRA (E-UTRA), Evolution- Data Optimized or Evolution-Data Only (EV-DO), Advanced Mobile Phone System (AMPS), Digital AMPS (D-AMPS), Total Access Communication System / Extended Total Access Communication System (TACS / ETACS), Push-to-talk (PTT), Mobile Telephone System (MTS), Improved Mobile Telephone System (IMTS), Advanced Mobile Telephone System (AMTS), Cellular Digital Packet Data (CDPD), DataTAC, Integrated Digital Enhanced Network (iDEN), Personal Digital Cellular (PDC), Personal Handy-phone System (PHS), Wideband Integrated Digital Enhanced Network (WiDEN), iBurst, Unlicensed Mobile Access Attorney Docket No. AG2913-PCT (31517-3503) (UMA), also referred to as also referred to as 3GPP Generic Access Network, or GAN standard), Bluetooth®, Bluetooth Low Energy (BLE), IEEE 802.15.4 based protocols (e.g., IPv6 over Low power Wireless Personal Area Networks (6LoWPAN), WirelessHART, MiWi, Thread, 802.11a, etc.) WiFi-direct, ANT / ANT+, ZigBee, Z-Wave, 3GPP device-to-device (D2D) or Proximity Services (ProSe), Universal Plug and Play (UPnP), Low-Power Wide- Area-Network (LPWAN), Long Range Wide Area Network (LoRA) or LoRaWAN™ developed by Semtech and the LoRa Alliance, Sigfox, Wireless Gigabit Alliance (WiGig) standard, Worldwide Interoperability for Microwave Access (WiMAX), mmWave standards in general (e.g., wireless systems operating at 10-300 GHz and above such as WiGig, IEEE 802.11ad, IEEE 802.11ay, etc.), V2X communication technologies (including 3GPP C-V2X), Dedicated Short Range Communications (DSRC) communication systems such as Intelligent- Transport-Systems (ITS) including the European ITS-G5, ITS-G5B, ITS-G5C, etc. In addition to the standards listed above, any number of satellite uplink technologies may be used for purposes of the present disclosure including, for example, radios compliant with standards issued by the International Telecommunication Union (ITU), or the European Telecommunications Standards Institute (ETSI), among others. The examples provided herein are thus understood as being applicable to various other communication technologies, both existing and not yet formulated. The term “access network” refers to any network, using any combination of radio technologies, RATs, and / or communication protocols, used to connect user devices and service providers. In the context of WLANs, an “access network” is an IEEE 802 local area network (LAN) or metropolitan area network (MAN) between terminals and access routers connecting to provider services. The term “access router” refers to router that terminates a medium access control (MAC) service from terminals and forwards user traffic to information servers according to Internet Protocol (IP) addresses. The term “SMTC” refers to an SSB-based measurement timing configuration configured by SSB-MeasurementTimingConfiguration. The term “SSB” refers to a synchronization signal / Physical Broadcast Channel (SS / PBCH) block, which includes a Primary Syncrhonization Signal (PSS), a Secondary Syncrhonization Signal (SSS), and a PBCH. The term “a “Primary Cell” refers to the MCG cell, operating on the primary frequency, in which the UE either performs the initial connection establishment procedure or initiates the connection re-establishment procedure. The term “Primary SCG Cell” refers to the SCG cell in which the UE performs random access when performing the Reconfiguration with Sync procedure for DC operation. The term “Secondary Cell” refers to a cell providing additional Attorney Docket No. AG2913-PCT (31517-3503) radio resources on top of a Special Cell for a UE configured with CA. The term “Secondary Cell Group” refers to the subset of serving cells comprising the PSCell and zero or more secondary cells for a UE configured with DC. The term “Serving Cell” refers to the primary cell for a UE in RRC_CONNECTED not configured with CA / DC there is only one serving cell comprising of the primary cell. The term “serving cell” or “serving cells” refers to the set of cells comprising the Special Cell(s) and all secondary cells for a UE in RRC_CONNECTED configured with CA. The term “Special Cell” refers to the PCell of the MCG or the PSCell of the SCG for DC operation; otherwise, the term “Special Cell” refers to the Pcell. The term “A1 policy” refers to a type of declarative policies expressed using formal statements that enable the non-RT RIC function in the SMO to guide the near-RT RIC function, and hence the RAN, towards better fulfilment of the RAN intent. The term “A1 Enrichment information” refers to information utilized by near-RT RIC that is collected or derived at SMO / non-RT RIC either from non-network data sources or from network functions themselves. The term “A1-Policy Based Traffic Steering Process Mode” refers to an operational mode in which the Near-RT RIC is configured through A1 Policy to use Traffic Steering Actions to ensure a more specific notion of network performance (for example, applying to smaller groups of E2 Nodes and UEs in the RAN) than that which it ensures in the Background Traffic Steering. The term “Background Traffic Steering Processing Mode” refers to an operational mode in which the Near-RT RIC is configured through O1 to use Traffic Steering Actions to ensure a general background network performance which applies broadly across E2 Nodes and UEs in the RAN. The term “Baseline RAN Behavior” refers to the default RAN behavior as configured at the E2 Nodes by SMO. The term “E2” refers to an interface connecting the Near-RT RIC and one or more O- CU-CPs, one or more O-CU-UPs, one or more O-DUs, and one or more O-eNBs. The term “E2 Node” refers to a logical node terminating E2 interface. In this version of the specification, ORAN nodes terminating E2 interface are: for NR access: O-CU-CP, O- CU-UP, O-DU or any combination; and for E-UTRA access: O-eNB. The term “Intents”, in the context of O-RAN systems / implementations, refers to declarative policy to steer or guide the behavior of RAN functions, allowing the RAN function to calculate the optimal result to achieve stated objective. Attorney Docket No. AG2913-PCT (31517-3503) The term “O-RAN non-real-time RAN Intelligent Controller” or “non-RT RIC” refers to a logical function that enables non-real-time control and optimization of RAN elements and resources, AI / ML workflow including model training and updates, and policy-based guidance of applications / features in Near-RT RIC. The term “Near-RT RIC” or “O-RAN near-real-time RAN Intelligent Controller” refers to a logical function that enables near-real-time control and optimization of RAN elements and resources via fine-grained (e.g., UE basis, Cell basis) data collection and actions over E2 interface. The term “O-RAN Central Unit” or “O-CU” refers to a logical node hosting RRC, SDAP and PDCP protocols. The term “O-RAN Central Unit – Control Plane” or “O-CU-CP” refers to a logical node hosting the RRC and the control plane part of the PDCP protocol. The term “O-RAN Central Unit – User Plane” or “O-CU-UP” refers to a logical node hosting the user plane part of the PDCP protocol and the SDAP protocol. The term “O-RAN Distributed Unit” or “O-DU” refers to a logical node hosting RLC / MAC / High-PHY layers based on a lower layer functional split. The term “O-RAN eNB” or “O-eNB” refers to an eNB or ng-eNB that supports E2 interface. The term “O-RAN Radio Unit” or “O-RU” refers to a logical node hosting Low-PHY layer and RF processing based on a lower layer functional split. This is similar to 3GPP’s “TRP” or “RRH” but more specific in including the Low-PHY layer (FFT / iFFT, PRACH extraction). The term “O1” refers to an interface between orchestration & management entities (Orchestration / NMS) and O-RAN managed elements, for operation and management, by which FCAPS management, Software management, File management and other similar functions shall be achieved. The term “RAN UE Group” refers to an aggregations of UEs whose grouping is set in the E2 nodes through E2 procedures also based on the scope of A1 policies. These groups can then be the target of E2 CONTROL or POLICY messages. The term “Traffic Steering Action” refers to the use of a mechanism to alter RAN behavior. Such actions include E2 procedures such as CONTROL and POLICY. The term “Traffic Steering Inner Loop” refers to the part of the Traffic Steering processing, triggered by the arrival of periodic TS related KPM (Key Performance Measurement) from E2 Node, which includes UE grouping, setting additional data collection Attorney Docket No. AG2913-PCT (31517-3503) from the RAN, as well as selection and execution of one or more optimization actions to enforce Traffic Steering policies. The term “Traffic Steering Outer Loop” refers to the part of the Traffic Steering processing, triggered by the near-RT RIC setting up or updating Traffic Steering aware resource optimization procedure based on information from A1 Policy setup or update, A1 Enrichment Information (EI) and / or outcome of Near-RT RIC evaluation, which includes the initial configuration (preconditions) and injection of related A1 policies, Triggering conditions for TS changes. The term “Traffic Steering Processing Mode” refers to an operational mode in which either the RAN or the Near-RT RIC is configured to ensure a particular network performance. This performance includes such aspects as cell load and throughput, and can apply differently to different E2 nodes and UEs. Throughout this process, Traffic Steering Actions are used to fulfill the requirements of this configuration. The term “Traffic Steering Target” refers to the intended performance result that is desired from the network, which is configured to Near-RT RIC over O1. Furthermore, any of the disclosed embodiments and example implementations can be embodied in the form of various types of hardware, software, firmware, middleware, or combinations thereof, including in the form of control logic, and using such hardware or software in a modular or integrated manner. Additionally, any of the software components or functions described herein can be implemented as software, program code, script, instructions, etc., operable to be executed by processor circuitry. These components, functions, programs, etc., can be developed using any suitable computer language such as, for example, Python, PyTorch, NumPy, Ruby, Ruby on Rails, Scala, Smalltalk, Java™, C++, C#, “C”, Kotlin, Swift, Rust, Go (or “Golang”), EMCAScript, JavaScript, TypeScript, Jscript, ActionScript, Server- Side JavaScript (SSJS), PHP, Pearl, Lua, Torch / Lua with Just-In Time compiler (LuaJIT), Accelerated Mobile Pages Script (AMPscript), VBScript, JavaServer Pages (JSP), Active Server Pages (ASP), Node.js, ASP.NET, JAMscript, Hypertext Markup Language (HTML), extensible HTML (XHTML), Extensible Markup Language (XML), XML User Interface Language (XUL), Scalable Vector Graphics (SVG), RESTful API Modeling Language (RAML), wiki markup or Wikitext, Wireless Markup Language (WML), Java Script Object Notion (JSON), Apache® MessagePack™, Cascading Stylesheets (CSS), extensible stylesheet language (XSL), Mustache template language, Handlebars template language, Guide Template Language (GTL), Apache® Thrift, Abstract Syntax Notation One (ASN.1), Google® Protocol Buffers (protobuf), Bitcoin Script, EVM® bytecode, Solidity™, Vyper (Python derived), Attorney Docket No. AG2913-PCT (31517-3503) Bamboo, Lisp Like Language (LLL), Simplicity provided by Blockstream™, Rholang, Michelson, Counterfactual, Plasma, Plutus, Sophia, Salesforce® Apex®, and / or any other programming language or development tools including proprietary programming languages and / or development tools. The software code can be stored as a computer- or processor- executable instructions or commands on a physical non-transitory computer-readable medium. Examples of suitable media include RAM, ROM, magnetic media such as a hard-drive or a floppy disk, or an optical medium such as a compact disk (CD) or DVD (digital versatile disk), flash memory, and the like, or any combination of such storage or transmission devices. ABBREVIATIONS Unless used differently herein, terms, definitions, and abbreviations may be consistent with terms, definitions, and abbreviations defined in 3GPP TR 21.905 v16.0.0 (2019-06). For the purposes of the present document, the following abbreviations may apply to the examples and embodiments discussed herein. Table 1 Abbreviations: 3GPP Third Generation IBE In-Band Emission PUSCH Physical Uplink Shared Partnership Project Channel de er e TI , st on rk Attorney Docket No. AG2913-PCT (31517-3503) API Application Programming IoT Internet of Things RAR Random Access Response Interface APN Access Point Name IP Internet Protocol RAT Radio Access io p ed ng el r Attorney Docket No. AG2913-PCT (31517-3503) CCA Clear Channel Assessment L1 Layer 1 (physical RRC Radio Resource layer) Control, Radio Resource Control layer me g, ne k nt C Attorney Docket No. AG2913-PCT (31517-3503) CPE Customer Premise MAC-I MAC used for data SCEF Service Capability Equipment integrity of signalling Exposure Function messages (TSG T p ol n me ce er ort Attorney Docket No. AG2913-PCT (31517-3503) CWS Contention Window Size MPBCH MTC Physical SIM Subscriber Identity Broadcast CHannel Module D2D Device-to-Device MPDCCH MTC Physical SIP Session Initiated t t ce g nal nal Attorney Docket No. AG2913-PCT (31517-3503) EAS Edge Application Server NE-DC NR-E-UTRA Dual SSBRI SS / PBCH Block Connectivity Resource Indicator, Synchronization Signal nal nal nal nal nal e o nal k up ty e tor Attorney Docket No. AG2913-PCT (31517-3503) EPRE Energy per resource NR New Radio, Neighbour TDD Time Division Duplex element Relation EPS Evolved Packet System NRF NF Repository TDM Time Division ple te ng Attorney Docket No. AG2913-PCT (31517-3503) FDMA Frequency Division PAPR Peak-to-Average UDSF Unstructured Data Multiple Access Power Ratio Storage Network Function ow rk ot n g Attorney Docket No. AG2913-PCT (31517-3503) GTP GPRS Tunneling Protocol PLMN Public Land Mobile VIM Virtualized Network Infrastructure Manager GTP-U GPRS Tunnelling Protocol PIN Personal Identification VL Virtual Link, e- l ck n ea Attorney Docket No. AG2913-PCT (31517-3503) The foregoing description provides illustration and description of various example embodiments, but is not intended to be exhaustive or to limit the scope of embodiments to the precise forms disclosed. Modifications and variations are possible in light of the above teachings or may be acquired from practice of various embodiments. Where specific details are set forth in order to describe example embodiments of the disclosure, it should be apparent to one skilled in the art that the disclosure can be practiced without, or with variation of, these specific details. It should be understood, however, that there is no intent to limit the concepts of the present disclosure to the particular forms disclosed, but on the contrary, the intention is to cover all modifications, equivalents, and alternatives consistent with the present disclosure and the appended claim.

Claims

Attorney Docket No. AG2913-PCT (31517-3503) CLAIMS What is claimed is:

1. An apparatus for a user equipment (UE) configured to manage physical random access channel (PRACH) transmissions comprising: a processor configured to: generate a PRACH transmission with multiple preamble repetitions; determine a first valid PRACH occasion based on a configured time offset; determine PRACH occasions in an order by increasing frequency resource indexes and then increasing time resource indexes; and perform the PRACH transmission with multiple preamble repetitions using the same preamble index and spatial domain filter; and a memory to store the configured time offset.

2. The apparatus of claim 1, wherein the processing circuitry is further configured to determine PRACH occasions for PRACH preamble repetitions associated with the same SS / PBCH block index.

3. The apparatus of claim 1, wherein the processing circuitry is further configured to determine PRACH occasions for PRACH preamble repetitions that are consecutive in time.

4. The apparatus of claim 1, wherein the processing circuitry is further configured to use the same frequency resources for PRACH preamble repetitions .

5. The apparatus of claim 1, wherein the processing circuitry is further configured to determine subsequent PRACH occasions for PRACH preamble repetitions after the configured time offset.

6. The apparatus of claim 1, wherein the processing circuitry is further configured to prioritize frequency resource indexes for frequency multiplexed PRACH occasions.

7. The apparatus of claim 1, wherein the processing circuitry is further configured to prioritize time resource indexes for time multiplexed PRACH occasions.Attorney Docket No. AG2913-PCT (31517-3503) 8. The apparatus of claim 1, wherein the processing circuitry is further configured to apply the Type-1 random access procedure.

9. The apparatus of any one of claims 1-8, wherein the processing circuitry is further configured to utilize a same preamble index for PRACH preamble repetitions.

10. A computer-readable medium storing computer-executable instructions which when executed by one or more processors result in performing operations comprising: generating a PRACH transmission with multiple preamble repetitions; determining a first valid PRACH occasion based on a configured time offset; determining PRACH occasions in an order by increasing frequency resource indexes and then increasing time resource indexes; performing the PRACH transmission with multiple preamble repetitions using the same preamble index and spatial domain filter.

11. The computer-readable medium of claim 10, wherein the operations further comprise determining PRACH occasions for PRACH preamble repetitions associated with the same SS / PBCH block index.

12. The computer-readable medium of claim 10, wherein the operations further comprise determining PRACH occasions for PRACH preamble repetitions that are consecutive in time.

13. The computer-readable medium of claim 10, wherein the operations further comprise using the same frequency resources for PRACH preamble repetitions .

14. The computer-readable medium of claim 10, wherein the operations further comprise determining subsequent PRACH occasions for PRACH preamble repetitions after the configured time offset.

15. The computer-readable medium of claim 10, wherein the operations further comprise prioritizing frequency resource indexes for frequency multiplexed PRACH occasions.Attorney Docket No. AG2913-PCT (31517-3503) 16. The computer-readable medium of claim 10, wherein the operations further comprise prioritizing time resource indexes for time multiplexed PRACH occasions.

17. The computer-readable medium of claim 10, wherein the operations further comprise applying the Type-1 random access procedure.

18. The computer-readable medium of any one of claims 10-17, wherein the operations further comprise utilizing a same preamble index for PRACH preamble repetitions.

19. A method comprising: generating a PRACH transmission with multiple preamble repetitions; determining a first valid PRACH occasion based on a configured time offset; determining PRACH occasions in an order by increasing frequency resource indexes and then increasing time resource indexes; performing the PRACH transmission with multiple preamble repetitions using the same preamble index and spatial domain filter.

20. The method of claim 19, further comprising determining PRACH occasions for PRACH preamble repetitions associated with the same SS / PBCH block index.

Images