Time domain resource allocation for repeated transmission in new radio

Abstract

Methods, systems, and storage media for time domain resource allocation for repeated transmissions in new radio are described.Other embodiments may be described and / or claimed.

Description

[0001] Related Applications

[0002] This application claims priority to U.S. Provisional Patent Application Serial No. 62 / 739,030, filed on September 28, 2018, entitled “SYSTEM AND METHODS OF TIME-DOMAIN RESOURCE ALLOCATION FOR REPEATED TRANSMISSIONS,” and U.S. Provisional Patent Application Serial No. 62 / 743,305, filed on October 9, 2018, entitled “TIME DOMAIN RESOURCE ALLOCATION FOR REPEATED TRANSMISSIONS,” the entire disclosures of which are incorporated herein by reference in their entirety. Background Art

[0003] The embodiments described in this disclosure are directed to, among other things, allocation of time domain resources for repeated transmissions. Embodiments of the disclosure may be used in conjunction with transmissions for New Radio (NR). BRIEF DESCRIPTION OF THE DRAWINGS

[0004] The embodiments will be readily understood through the following detailed description in conjunction with the accompanying drawings. To facilitate this description, the same reference numerals refer to the same structural elements. In the accompanying drawings, the embodiments are illustrated by way of example and not limitation.

[0005] Figure 1 , 2 and 3 illustrate examples of operational flows / algorithm structures according to some embodiments.

[0006] Figure 4A An example of back-to-back repetition of dynamic indications is shown, compared to separate DCIs for each retransmission, without crossing slot boundaries.

[0007] Figure 4B and 4C An example of aggregated PUSCH allocation according to some embodiments is illustrated.

[0008] Figure 5 An architecture of a network system according to some embodiments is depicted.

[0009] Figure 6 Depicted are examples of components of a device according to some embodiments.

[0010] Figure 7 Depicted are examples of interfaces for baseband circuitry in accordance with some embodiments.

[0011] Figure 8 Depicted is a block diagram showing components capable of reading instructions from a machine-readable or computer-readable medium (eg, a non-transitory machine-readable storage medium) and performing any one or more of the methodologies discussed herein, in accordance with some embodiments. DETAILED DESCRIPTION

[0012] The embodiments discussed herein may relate to time domain resource allocation for repeated transmissions in New Radio (NR).Other embodiments may be described and / or claimed.

[0013] The following detailed description refers to the accompanying drawings. The same reference numerals may be used in different figures to identify the same or similar elements. In the following description, specific details, such as specific structures, architectures, interfaces, technologies, etc., are set forth for the purpose of explanation rather than limitation, so as to provide a thorough understanding of various aspects of the claimed invention. However, it will be apparent to those skilled in the art who benefit from this disclosure that various aspects of the claimed invention can be practiced in other examples that depart from these specific details. In some examples, descriptions of well-known devices, circuits, and methods are omitted to avoid making the description of the present invention unclear with unnecessary details.

[0014] The various aspects of the illustrative embodiments will be described using terms that are commonly used by those skilled in the art to convey the essence of their work to other persons skilled in the art. However, it will be apparent to those skilled in the art that alternative embodiments may be practiced utilizing only certain aspects of the various aspects described. For purposes of explanation, specific numbers, materials, and configurations are provided to provide a thorough understanding of the illustrative embodiments. However, it will be apparent to those skilled in the art that alternative embodiments may be practiced without the specific details. In other examples, well-known features have been omitted or simplified to avoid making the illustrative embodiments unclear.

[0015] In addition, various operations will be described as multiple discrete operations in turn in a manner that is most helpful for understanding the illustrative embodiments; however, the order of description should not be interpreted as implying that these operations must be order-dependent. In particular, these operations do not need to be performed in the order presented.

[0016] The phrases "in various embodiments," "in certain embodiments," and the like may refer to the same or different embodiments. Unless the context indicates otherwise, the terms "comprising," "having," and "including" are synonymous. The phrase "A and / or B" means (A), (B), or (A and B). The phrases "A / B" and "A or B" mean (A), (B), or (A and B), similar to the phrase "A and / or B." For purposes of the present disclosure, the phrase "at least one of A and B" means (A), (B), or (A and B). The description may use the phrases "in one embodiment," "in multiple embodiments," "in certain embodiments," and / or "in various embodiments," each of which may refer to one or more of the same or different embodiments. In addition, the terms "comprising," "including," "having," and the like used with respect to embodiments of the present disclosure are synonymous.

[0017] Examples of embodiments may be described as process diagrams depicted as flow charts, processes, data flow diagrams, structure diagrams, or block diagrams. Although flow charts may describe operations as sequential processes, many operations may be performed in parallel, simultaneously, or simultaneously. In addition, the order of operations may be rearranged. A process may terminate when its operations are completed, but may also have other steps not included in the figure. A process may correspond to a method, function, process, subroutine, subprogram, etc. When a process corresponds to a function, its termination may correspond to the function returning to the calling function and / or the main function. Examples of embodiments may be described in the general context of computer executable instructions (e.g., program code, software module, and / or functional process) executed by one or more of the above-mentioned circuits. Program code, software module, and / or functional process may include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific data types. The program code, software module, and / or functional process discussed herein may be implemented using existing hardware in an existing communication network. For example, the program code, software module, and / or functional process discussed herein may be implemented using existing hardware at an existing network element or control node.

[0018] Mobile communications have evolved from early voice systems to today's highly complex integrated communications platforms. The next generation of wireless communication systems, 5G or New Radio (NR), will provide access to information and sharing of data by a variety of users and applications at any time and anywhere. NR is expected to be a unified network / system designed to meet very different and sometimes conflicting performance dimensions and services. This different multi-dimensional requirements are driven by different businesses and applications. Overall, NR will evolve based on 3GPP LTE-Advanced and other potential new radio access technologies (RATs) to enable better, simpler, and seamless wireless connections to enable people's lives. NR will enable everything connected over the wireless network and provide fast, rich content and services.

[0019] Traditional NR (5G) includes a set of basic functions and components for future cellular communication systems, including ultra-reliable low-latency communication (URLLC) achieved through flexible resource allocation, scheduling and HARQ, low spectrum efficiency transmission parameters, etc.

[0020] Regarding repeated transmission considerations, embodiments disclosed herein may be directed to enhanced PUSCH transmission. In particular, enhancements related to PUSCH repetition are disclosed. In addition, embodiments of the present disclosure may be directed to a detailed mechanism to indicate time domain resources for repeated transmission to a UE.

[0021] In certain embodiments, one of the enhancements related to physical uplink shared channel (PUSCH) and physical downlink shared channel (PDSCH) transmissions is to consider repeated transmissions. The embodiments described herein may be directed to enhancements related to PUSCH and PDSCH repetitions. In particular, a mechanism for indicating time domain resources for repeated transmissions to a UE is discussed and disclosed.

[0022] Dynamic indication of shared channel transmission aggregation level

[0023] In an embodiment, one of the techniques to improve the tradeoff between latency and reliability and overall scheduling flexibility, considering the current slotted frame structure in NR, is to implement dynamic aggregation of PUSCH transmissions. Although the conventional PUSCH duration is already quite flexible and can be from 1 symbol to 14 or 12 symbols (for NCP and ECP, respectively), it cannot accommodate the situation when a relatively short transmission comparable to or smaller than a slot starts in the middle of one slot and ends in another. This situation is not addressed in the following sections. Figure 4A Medium picture. Figure 4A An example of back-to-back repetitions indicated dynamically (at the bottom) and an example of separate DCIs for each retransmission without crossing slot boundaries (at the top) are shown. Figure 4AIn the example, a typical conventional transmission is assembled into one time slot (top of the figure), while an enhanced transmission can be achieved by aggregation of two time slots in different time slots (bottom of the figure). It should be noted that it can also be done by transmitting two grants, however, this may bring a large (at least twice) control overhead that may cause UE blocking.

[0024] In some embodiments, in addition to the start symbol, the length of the PUSCH, and the mapping type of the PUSCH, the number of repetitions may be jointly configured to the user equipment (UE) using UE-specific radio resource control (RRC) signaling as part of the time domain resource allocation table. Next, thereafter, the currently defined time domain resource allocation bit field may be used to indicate the number of repetitions along with other time domain resource allocation (RA) information in DCI format 0_0 (using 4 bits) or downlink control information (DCI) format 0_1 ​​(using 0 / 1 / 2 / 3 / 4 bits, depending on the number of rows in the time domain resource allocation table configured by the higher layer). In order to reduce any negative impact on the flexibility in the possible time domain allocation in Rel-15, the number of repetitions may be jointly encoded with the start and length indicator value (SLIV) information (the latter indicating the start and length of the PUSCH), or certain specific combinations of the number of repetitions (which are dynamically indicated) and the start and length combinations may only be supported by the specification.

[0025] Currently, when a UE is scheduled by DCI to send a transport block on PUSCH and no CSI report, or when a UE is scheduled by DCI to send a transport block and CSI report on PUSCH, the time domain resource allocation field value m of the DCI provides a row index m+1 of the allocation table. The indexed row defines the slot offset K2 to be applied in the PUSCH transmission, the start and length indicator SLIV, or directly defines the start symbol S and the allocation length L, and the PUSCH mapping type.

[0026] When a UE is scheduled by DCI to send a transport block on PUSCH and no CSI report, or when a UE is scheduled by DCI to send a transport block and CSI report on PUSCH, the time domain resource allocation field value m of the DCI provides the row index m+1 of the allocation table. The determination of the resource allocation table used is defined in section 6.1.2.1.1. The indexed row defines the slot offset K2 to be applied in the PUSCH transmission, the start and length indicator SLIV, or directly defines the start symbol S and the allocation length L, and the PUSCH mapping type.

[0027] -The time slot in which the UE should send PUSCH is determined by K2 as Where n is the time slot with scheduled DCI, K2 is the communication technology parameter (numerology) based on PUSCH, μPUSCH and μ PDCCH are the subcarrier spacing configurations of PUSCH and PDCCH, respectively, and

[0028] - The starting symbol S relative to the start of the time slot and the number L of consecutive symbols counted from the symbol S allocated for PUSCH are determined from the start and length indicator SLIV of the indexed row:

[0029] If (L - 1) ≤ 7, then

[0030] SLIV = 14·(L - 1) + S

[0031] Otherwise

[0032] SLIV = 14·(14 – L + 1) + (14 – 1 - S)

[0033] where 0 < L ≤ 14 - S, and

[0034] - The PUSCH mapping type is set to type A or type B as defined in subsection 6.4.1.1.3 of 3GPP TS38.211 as given by the indexed row.

[0035] The UE can consider the combinations of S and L defined in Table 6.1.2.1-1 as valid PUSCH allocations:

[0036] Table 6.1.2.1-1: Valid combinations of S and L

[0037]

[0038] In an embodiment, in order to reduce any negative impact on the flexibility in the possible time domain allocations in Rel-15, the number of repetitions can be jointly encoded with the start and length indicator value (SLIV) information (the latter indicating the start and length of PUSCH), or certain specific combinations of the number of repetitions (which are dynamically indicated) and the start and length combinations can be supported only by the specification.

[0039] In an embodiment, only the values of L < L_th in the above table can be configured for the number of repetitions exceeding a given value (e.g., R), where L_th is a threshold calculated based on R. For example, if R = 2, then L_th can be set to 5, etc.

[0040] In an embodiment, if L - 1 ≤ L_th, then SLIV = 14R(L - l) + S, where L and R should be selected such that 0 < RL ≤ 14 - S.

[0041] In an embodiment, repeated transmissions including certain lengths (such as, a set of L values, where L<14) may not cross time slot boundaries. In this case, certain restrictions can be applied to the total length of the repetitions, such as 2<=RL<=14-S, where R is the repetition factor and L is the length of a TB transmission, i.e., the number of consecutive symbols including PUSCH without repetitions. Below are examples of R=2 and 4 to obtain valid S and L combinations. Here, R can be a higher layer configured or indicated as part of the scheduling DCI. In one example, R can also be indicated as part of an index indication of a table pusch-symbolAllocation from a high-level configuration, where the indexed row can also define the R to be applied in the PUSCH transmission as well as the time slot offset K2, the start and length indicator SLIV, and the PUSCH mapping type.

[0042] Table 1: Example of an update table for valid S and L combinations for R=2

[0043]

[0044] Table 2: Example of an update table of valid S and L combinations for R=4

[0045]

[0046] In an embodiment, even when the UE is configured with slot aggregation with an aggregation factor configured via RRC signaling, the UE may be expected to follow the dynamic indication if also configured and as indicated in the scheduling or activation DCI (for Type 2 CG PUSCH). This may be done through predefined override rules, or through some dynamic indication of which type of signaling to follow (e.g., RRC signaling vs. dynamic signaling).

[0047] In an embodiment, RRC signaling may include the repetition level as part of the time domain indication field, as shown in message box 1 below, where the underlined text indicates a change from the current message content. Message box 1: Example of updated RRC signaling to include a repetition factor

[0048] Further, in an embodiment, when repetition is scheduled, the repetition may be performed in at least two ways:

[0049] Type A: Based on time slot repetition, that is, the same time domain allocation can be used in repeated time slots, in particular, the starting symbol, duration of PUSCH, and PUSCH mapping type in each time slot in the aggregation are the same and are derived from the time domain resource allocation domain of DCI scheduling PUSCH or activating type 2CG-PUSCH.

[0050] Type B: Back-to-back repetition, i.e., Figure 1 As illustrated in , the start symbol of the repetition other than the initial repetition is derived based on the end symbol of the previous repetition or based on other rules / indications, so that repetition can even be performed within one time slot or in different time slots in a minimal / gap-free manner.

[0051] For DL ​​or UL data repetition transmission, each transmission duration or start / end symbol position may be different in different time slots, depending on the DL control region size or CORESET duration, the protection period duration, the NR physical uplink control channel (NR-PUCCH) duration, and whether there are reference signals including at least channel state information-reference signal (CSI-RS), sounding reference signal (SRS), RS for beam management, etc. in the time slot.

[0052] In some embodiments, in order to signal the data duration or start / end symbol of each transmission, for example, in each time slot, a bitmap for data start and / or end symbols may be configured by a higher layer or indicated in the DCI. If multi-level DCI is used to schedule data transmission, the DCI may be carried in the first-level DCI.

[0053] In other embodiments, the UE derives the starting position and / or transmission duration of the repetition across (one or more) time slot boundaries from the duration of the DL / UL control region or one or more CORESETs and the duration of the guard period of each time slot, and the SLIV value for the TD allocation used for the initial transmission and other previous repetitions. The UE can obtain information about the number of symbols used for DL ​​control or UL control channels from the information related to the time slot type carried by the group common PDCCH and the semi-static configuration of the guard period duration. Afterwards, the UE can derive the data duration of each time slot.

[0054] In addition, the gNB can indicate the CSI-RS or other RS ​​configuration within the desired time slot via DCI or group common PDCCH for data scheduling to accommodate repeated transmissions. In this case, the UE can perform rate matching around the RS according to the configuration.

[0055] In an embodiment, two starting positions may be indicated, one or both of which may be indicated dynamically or semi-statically. The starting position of the first repetition may also be indicated dynamically, while the starting position of the second or subsequent repetitions may be configured by a higher layer, for example, relative to the end of the previous repetition or based on a predetermined rule. Such a rule may depend on the exact position where the previous repetition ended in the time slot. In addition, different rules can be defined for TDD and FDD, for example, for a certain SFI in TDD, different rules associated with a given SFI can be identified.

[0056] An important aspect to consider is how the UE identifies available uplink (UL) symbols for mapping PUSCH repetitions, for example, in cases where certain symbols in a slot are identified as downlink (DL) symbols by higher layer signaling or where the UE receives a slot format indication (SFI) indication before or during the repetition, thus potentially affecting the overall transmission. In an embodiment, the UE may assume via a semi-static DL-UL configuration (cell-specific and / or UE-specific configuration) that those symbols indicated as UL or "flexible" are available for mapping PUSCH repetitions. In addition, symbols identified as "flexible" via semi-static configuration may also be subject to receiving other dynamic triggers, such as a scheduling DCI format for DL / UL scheduling or a dynamic SFI delivered via DCI format 2_0.

[0057] In an embodiment, the UE may assume via a semi-static DL-UL configuration (cell-specific and / or UE-specific configuration) that only those symbols indicated as "UL" are available for mapping of PUSCH repetitions. For the case of interaction with dynamic SFI, the UE may not be able to defer transmission by skipping the affected symbols with conflicting directions (i.e., SFI via DCI 2_0 indicating DL or "Flexible"). Therefore, mapping of back-to-back repetitions may be implemented by considering only the available UL symbols based on the semi-static DL-UL configuration, and further discarding rules can be defined to address the interaction with dynamic SFI as described below.

[0058] Currently, for the case of slot aggregation and dynamically scheduled PUSCH, the UE may not receive SFIs that change certain symbols to DL or "flexible" during transmission within the allocated slot. This is because in Rel-15, any changes / updates that affect dynamically scheduled transmissions are not allowed. In other words, in Rel-15, it is not expected that the UE will have conflicts in the link (DL or UL) direction between dynamic SFIs and UE-specific data (e.g., UE-specific DCI-triggered PUSCH (grant-based) or DCI-granted multi-slot transmissions).

[0059] On the other hand, if an ungranted PUSCH is ongoing then the UE may receive an SFI that changes certain symbols to DL or "flexible". In this case, the transmission in the corresponding timeslot and all subsequent transmissions are dropped. Although there is no restriction on type 1 vs. type 2 GF transmissions in this case and both can be treated the same, the first PUSCH transmission opportunity of type 2 after the activation DCI and the PUSCH transmission opportunity that carries the configured grant PUSCH MAC CE confirmation message in response to a deactivation command are treated similarly to dynamically granted PUSCH and are not subject to dynamic cancellation based on the SFI transmitted via DCI format 2_0. From this perspective, for type 2 GF UL, the SFI is then able to cover subsequent transmission opportunities instead of the first or last PUSCH resource used to carry a MAC CE confirmation in response to a deactivation / release command.

[0060] In an embodiment, if an ungranted PUSCH (repetition) is in progress and the UE receives an SFI that changes certain symbols to DL or "flexible", the transmission in only the corresponding time slot can be discarded, and subsequent transmissions in that time slot may proceed as before. As a further extension, considering the support of repetitions of PUSCH transmissions within a time slot, only the affected repetitions within the time slot (that is, certain symbols with a conflicting direction (via dynamic SFI, DL or "flexible")) can be discarded, and other repetitions in the same time slot or in a subsequent time slot can still be sent. As another option, when sending PUSCH, the UE can only discard (puncture) transmissions in affected symbols with a conflicting link direction from a dynamic SFI (via DCI 2_0). In other words, the UE maps the generated modulation symbols PUSCH TB, assuming that all symbols corresponding to the repetition are available, but does not send those symbols for a specific repetition of the TB in the symbols corresponding to the affected symbols.

[0061] Aggregation of time domain resource allocation for shared channel transmission

[0062] In an embodiment, in order to achieve mini-slot UL repetition across slot boundaries for grant-based transmission, especially for low-latency services, generalization of slot aggregation may be considered. Currently, in the slot aggregation method, the time domain (TD) allocation configuration is repeated across slots, which is not optimized in terms of the delay induced.

[0063] The joint TD allocation can be defined in an efficient way in terms of the overall experienced delay. Therefore, certain relationships and / or constraints can be applied between TD allocations in multiple (e.g., two) time slots to avoid the resulting high overall delay. Each of these allocations can carry one repetition of a PUSCH TB.

[0064] In an embodiment, the UE may be configured with K time domain resource allocations via RRC configuration or L1-signaling (eg, via a TD resource allocation field) or a combination thereof. In addition, multiple TD allocations may be configured jointly, wherein each is repeated one at a time.

[0065] In an embodiment, RRC configures the K2 value, the K value of SLIV, K (e.g., K=2) SLIV values, and the mapping type. In an embodiment, the RRC configuration may be implemented as part of a TD allocation table with a special field that is the concatenation of K (e.g., K=2) groups of TD SLIV values ​​(no effect on SLIV encoding). Each TD allocation may apply to each of the K slots in the aggregation. An exemplary modification of the RRC message (underlined text) is presented in the message box 2 below.

[0066] Message Box 2: Example of updated RRC signaling to include the start and length of the second transmission

[0067]

[0068] In yet another example, the case of an arbitrary number of concatenated TD allocations is presented in the following message box 3, where a single SLIV field is replaced by a list of SLIV fields. The one to be considered (e.g., the legacy table type or the new table type) can be configured as part of the PUSCH-Config. The size of the list implicitly indicates the number of repetitions corresponding to this particular entry of the time domain allocation table. The maximum number of entries in the time domain allocation table can be increased from 16 to other powers of 2 (e.g., 32), which will result in an increase of at most 1 bit in the TD RA field in the DCI.

[0069] Message Box 3: Example of TD assignment indicating an arbitrary number of cascades

[0070]

[0071] In an embodiment, the SLIV value may be replaced with (2S+L)IV to encode the starting position (while the SLIV characteristics remain the same overall) to further optimize the TD allocation signaling for K=2. This means that the allocation length across two time slots is the same, while two starting positions are signaled. Further extending this example, for any value of K, a single length "L" and K starting positions "S" may be associated with a given entry in the TD allocation table. For example, we can consider the transmission of a small packet with repetitions (e.g., 4 symbol duration), where multiple repetitions may need to be accommodated within a duration of 1.5 time slots. Using this scheme, it is still possible to allocate 14 symbols in the first time slot and the remaining symbols (e.g., the remaining 6 symbols) in the next time slot through two TD allocations. In particular, such a scheme does not impose the constraint of allocating the same length using these TD allocations. Therefore, the allocation scheme allows the starting symbol to be changed as well as the transmission length, i.e., for each of the PUSCHs, there are multiple repetitions with different TD durations.

[0072] With respect to the mapping type, in one example, the UE may reuse the packetization of the first transmission for the repeated transmission.

[0073] The importance and impact of such SLIV coding optimization may depend on the extent to which the indication is performed via RRC and DCI signaling.

[0074] In an embodiment, the SLIV value(s) are indicated via DCI, where the SLIV encoding rules may follow the previous example, or may be further optimized.

[0075] Typically, in such an example, more RRC bits are needed to construct each row of the time domain resource allocation table from which the DCI picks and indicates a row (with no impact on the DCI).

[0076] In an embodiment, the time domain resource allocation table consists of a cascade of a K2 value, a mapping time, and two SLIV values. One of the SLIV values ​​can be empty for compatibility with conventional operations. Non-empty cascade entries correspond to repetitions, and the first / second repetitions are mapped to the first / second SLIV values, respectively.

[0077] In a general embodiment, K repetitions with two or more (up to K) SLIV values ​​may be considered. If the number of SLIV values ​​is smaller than the number of repetitions, more operations are required to encode the corresponding starting position. Furthermore, SLIV values ​​may be associated with the same or different time slots (e.g., following Rel-15 behavior, where for repetitions only the position within the time slot is indicated). Even though it is possible to associate SLIV values ​​with the same time slot, in this case it may be more convenient to consider back-to-back repetitions without additional indication.

[0078] In an embodiment, where repeated transmissions are configured, the (possibly modified) TD allocation field may be used to explicitly indicate resource allocation information corresponding to transmissions in subsequent time slots.

[0079] In addition, the UE may be configured with rules on how to map multiple provided TD allocations characterizing duplication into time slots. The configuration signaling may indicate which TD allocation in the aggregation is mapped to which time slot. The first TD allocation may be mapped to the first time slot, the second TD allocation may be mapped to the second time slot, or both TD allocations may be mapped to the first time slot.

[0080] In one example, in the case where the number of configured repetitions is greater than the number of provided TD allocations, a modulo operation can be applied to a loop over the TD allocations: TD(k) = TD_set(k mod TD_set_size), where TD_set is the provided TD allocation set, TD_set_size - its size (e.g., 2), k = 0, ..., Kl is an index or repetition in the aggregation of K repetitions of PUSCH.

[0081] In an embodiment, the complete allocation signaling may apply only to the transmission corresponding to the current time slot. TD resource allocation information for (one or more) subsequent repeated transmissions may be implicitly derived based on the allocation in the previous time slot (e.g., the allocation for the transmission in the second time slot is derived based on the transmission in the first (current) time slot, etc.).

[0082] In one example, such implicit indication can be implemented by a predefined mirror relationship about the time slot boundary. The mirror relationship can be defined according to the end symbol of the transmission in each time slot and the start symbol of the transmission in the next time slot.

[0083] In an extended example, if the first / current TD allocation points to the end of the first slot (i.e., the PUSCH transmission ends at the slot boundary or a few symbols before the slot boundary), the next slot TD allocation can point to the start of the slot (i.e., the PUSCH starts at the slot boundary or a few symbols after the slot boundary). The same rules can be applied to the start position of the transmission in the third slot and the end position of the transmission in the second slot, and so on.

[0084] In another example, back-to-back repetitions with the same length can be considered until the TB can cross the slot boundary. In this case, when there is a UL symbol, the next repetition can start at the first available UL symbol in the next slot or subsequent slot.

[0085] As another option, a single SLIV field may be used to signal the time domain resource allocation, but the time domain resource allocation may be reinterpreted based on a flag dynamically signaled in the DCI within the time domain allocation table entry or semi-statically signaled in the RRC. If reinterpretation is enabled, then in Option 1, the resulting starting symbol S may indicate the last symbol of the total PUSCH transmission in slot "n+(K-1)", while the value of (S+L-1) may indicate the first symbol in slot "n". This is determined by Figure 4B Graphic, Figure 4B The possible PUSCH allocations in the case of SLIV reinterpretation option 1 are illustrated for the case of K=2. In this context, in one example, such a reinterpretation may only apply to the case of two repetitions, ie K=2.

[0086] Alternatively, in Option 2, a single SLIV value may be reinterpreted based on the configured number of repetitions and the reinterpretation flag such that the start symbol S may indicate the start symbol in slot "n" and (S+L-1) may indicate the last symbol in slot "n+(K-1)". In other words, counting from symbol 0 in the first slot, the last symbol of the aggregated PUSCH transmission may be calculated as S+L-1+14*(K-1) in the case of NCP and S+L-1+12*(K-1) in the case of ECP. This is given by Figure 4C Shown, Figure 4C Possible aggregated PUSCH allocations in the case of SLIV reinterpretation option 2 are illustrated.

[0087] In the context of the above three options and embodiments of reinterpreting SLIV or replacing SLIV, in this case, the parts of PUSCH placed in different time slots are considered as independent PUSCH repetitions. Generally, one of the main motivations behind such TD allocation indication is to handle the case of repetitions across time slot boundaries. The techniques described in the embodiments of the above versions, such as mirroring behavior, are not currently supported in Rel-15 for GB or GF UL transmissions.

[0088] While for GB transmissions, the concatenation of two / multiple TD allocations provides a reasonable technique to handle repetitions, the exact same concept may or may not apply to GF transmissions (and may require some further adjustments). For GF UL transmissions, the S value from SLIV is repeated with a period P, which results in multiple starting positions within the slot. These positions are then repeated for each slot. If the period P is less than the slot duration, the single starting symbol is automatically extended to multiple candidates within the slot based on P. Thus, the starting position is effectively predetermined (i.e., not indicated in the activation DCI or by a higher layer configuration). Furthermore, the starting symbol is not fixed and may vary depending on the position / transmission opportunity of the repetition and the previous repetition(s) in the slot.

[0089] In an embodiment, with respect to configured granted PUSCH transmissions, if a generalized time domain allocation consisting of multiple TD SLIV indications is signaled for a configured grant type 1 or type 2, each starting position of each TD SLIV value in the concatenation / aggregation is recalculated based on the configured periodicity. In this case, it may not be desirable for the UE to be configured with a combination of periodicity and TD allocations such that at least one of the TD allocations crosses a slot boundary or a periodicity boundary.

[0090] In an embodiment, the TBS determination process for PUSCH repetition may use / apply only the first TD allocation, while the second and other TD allocations in the cascade / aggregation are not involved in the TBS determination process. This may be required in case the TD allocation length is different between the first repetition and other repetitions.

[0091] Generalization to PDSCH

[0092] It should be noted that although the concepts and embodiments are described in application to uplink shared channel transmission, the same approach can be used for downlink shared channel transmission. That is, it is possible to introduce exactly the same modifications to the time domain allocation table for DL, and signal multiple TD allocations and apply them to repetitions.

[0093] Figure 5The architecture of a network system 500 according to some embodiments is illustrated. The system 500 is shown to include user equipment (UE) 501 and UE 502. UE 501 and 502 are illustrated as smartphones (e.g., handheld touch screen mobile computing devices that can connect to one or more cellular networks), but may include any mobile or non-mobile computing device, such as a personal data assistant (PDA), a pager, a laptop computer, a desktop computer, a wireless handset, or any computing device that includes a wireless communication interface.

[0094] In some embodiments, any of UEs 501 and 502 can include an Internet of Things (IoT) UE, which can include a network access layer designed for low-power IoT applications that utilize short-lived UE connections. The IoT UE can exchange data with an MTC server or device via a public land mobile network (PLMN), proximity-based services (ProSe) or device-to-device (D2D) communications, sensor networks, or IoT networks using technologies such as machine-to-machine (M2M) or machine-type communications (MTC). The M2M or MTC data exchange can be a machine-initiated data exchange. The IoT network describes the use of short-term connections to interconnect IoT UEs, which may include uniquely identifiable embedded computing devices (within the Internet infrastructure). The IoT UE can execute background applications (e.g., keep-alive messages, status updates, etc.) to facilitate connectivity to the IoT network.

[0095] UE 501 and 502 may be configured to connect (e.g., be communicatively coupled) to a radio access network (RAN) 510, which may be, for example, an evolved universal mobile telecommunications system (UMTS) terrestrial radio access network (E-UTRAN), a next generation RAN (NG RAN), or some other type of RAN. UE 501 and 502 utilize connections 503 and 504, respectively, each of which includes a physical communication interface or layer (discussed in further detail below); in this example, connections 503 and 504 are illustrated as air interfaces that implement the communicatively coupled, and can be consistent with a cellular communication protocol, such as a global system for mobile communications (GSM) protocol, a code division multiple access (CDMA) network protocol, a push-to-talk (PTT) protocol, a cellular PTT (POC) protocol, a universal mobile telecommunications system (UMTS) protocol, a 3GPP long term evolution (LTE) protocol, a fifth generation (5G) protocol, a new radio (NR) protocol, etc.

[0096] In this embodiment, UE 501 and 502 may further directly exchange communication data via a ProSe interface 505. The ProSe interface 505 may alternatively be referred to as a side link interface including one or more logical channels including, but not limited to, a physical side link control channel (PSCCH), a physical side link shared channel (PSSCH), a physical side link discovery channel (PSDCH), and a physical side link broadcast channel (PSBCH).

[0097] UE 502 is shown configured to access access point (AP) 506 via connection 507. Connection 507 can include a local wireless connection, such as a connection consistent with any IEEE 802.11 protocol, wherein AP 506 would include wireless fidelity. In this example, AP 506 is shown connected to the Internet without being connected to the core network of the wireless system (described in further detail below).

[0098] The RAN 510 can include one or more access nodes that enable connections 503 and 504. These access nodes (ANs) can be referred to as base stations (BS), NodeBs, evolved NodeBs (eNBs), next generation NodeBs (gNBs), RAN nodes, etc., and can include ground stations (e.g., ground access points) or satellite stations that provide coverage within a geographic area (e.g., a cell). The RAN 510 can include one or more RAN nodes (e.g., macro RAN nodes 511) for providing macro cells, and one or more RAN nodes, such as low power (LP) RAN nodes 512, for providing femto cells or pico cells (e.g., cells with smaller coverage, smaller user capacity, or higher bandwidth than macro cells).

[0099] Any of the RAN nodes 511 and 512 can terminate the air interface protocol and can be the first point of contact for the UEs 501 and 502. In certain embodiments, any of the RAN nodes 511 and 512 can fulfill various logical functions of the RAN 510, including but not limited to radio network controller (RNC) functions, such as radio bearer management, uplink and downlink dynamic radio resource management and data packet scheduling, and mobility management.

[0100] According to certain embodiments, UEs 501 and 502 can be configured to communicate with each other or with any of RAN nodes 511 and 512 on a multi-carrier communication channel using orthogonal frequency division multiplexing (OFDM) communication signals according to various communication techniques, such as but not limited to orthogonal frequency division multiple access (OFDMA) communication techniques (e.g., for downlink communications) or single carrier frequency division multiple access (SC-FDMA) communication techniques (e.g., for uplink and ProSe or sidelink communications), but the scope of the embodiments is not limited in this respect. OFDM signals can include multiple orthogonal subcarriers.

[0101] In some embodiments, the downlink resource grid can be used for downlink transmission from any one of the RAN nodes 511 and 512 to the UEs 501 and 502, while uplink transmission can utilize similar techniques. The grid can be a time-frequency grid, referred to as a resource grid or a time-frequency resource grid, which is a physical resource in the downlink in each time slot. For OFDM systems, this time-frequency plane representation is a common practice, which makes wireless resource allocation intuitive. Each column and each row of the resource grid corresponds to an OFDM symbol and an OFDM subcarrier, respectively. The duration of the resource grid in the time domain corresponds to a time slot in a radio frame. The smallest time-frequency unit in the resource grid is represented as a resource element. Each resource grid includes a plurality of resource blocks, which describe the mapping of some physical channels to resource elements. Each resource block includes a set of resource elements. In the frequency domain, this can represent the minimum amount of resources that can be currently allocated. Such resource blocks are used to transmit several different physical downlink channels.

[0102] The physical downlink shared channel (PDSCH) may carry user data and high-layer signaling to the UEs 501 and 502. The physical downlink control channel (PDCCH) may carry information about the transport format and resource allocation associated with the PDSCH channel, etc. It may also inform the UEs 501 and 502 of the transport format, resource allocation, and H-ARQ (Hybrid Automatic Repeat Request) information associated with the uplink shared channel. Typically, downlink scheduling (allocation of control and shared channel resource blocks to the UEs 502 within the cell) may be performed on any one of the RAN nodes 511 and 512 based on channel quality information fed back from any one of the UEs 501 and 502. Downlink resource allocation information may be transmitted on the PDCCH for (e.g., allocated to) each of the UEs 501 and 502.

[0103] PDCCH can use control channel elements (CCE) to convey control information. Before being mapped to resource elements, PDCCH complex symbols can first be organized into quadruplets, which can then be permuted using a sub-block interleaver for rate matching. Each PDCCH can be sent using one or more of these CCEs, where each CCE can correspond to nine four physical resource elements called resource element groups (REGs). Four orthogonal phase shift keying (QPSK) symbols can be mapped to each REG. Depending on the size of the downlink control information (DCI) and the channel conditions, one or more CCEs can be used to send PDCCH. Four or more different PDCCH formats with different numbers of CCEs (e.g., aggregation levels L=1, 2, 4, or 8) can be defined in LTE.

[0104] Certain embodiments may use the concept of resource allocation for control channel information, which is an extension of the above concept. For example, certain embodiments may utilize an enhanced physical downlink control channel (EPDCCH) that uses PDSCH resources for control information transmission. One or more enhanced control channel elements (ECCEs) may be used to send EPDCCH. Similar to the above, each ECCE may correspond to nine four physical resource elements referred to as enhanced resource element groups (EREGs). In some cases, ECCE may have other numbers of EREGs.

[0105] The RAN 510 is shown to be communicatively coupled to a core network (CN) 520 via an S1 interface 513. In an embodiment, the CN 520 may be an evolved packet core (EPC) network, a next generation packet core (NPC) network, or some other type of CN. In this embodiment, the S1 interface 513 is divided into two parts: an S1-U interface 514 and an S1 mobility management entity (MME) interface 515. The S1-U interface 514 carries traffic data between the RAN nodes 511 and 512 and the serving gateway (S-GW) 522. The MME interface 515 is a signaling interface between the RAN nodes 511 and 512 and the MME 521.

[0106] In this embodiment, CN 520 includes MME 521, S-GW 522, Packet Data Network (PDN) Gateway (P-GW) 523 and Home Subscriber Server (HSS) 524. MME 521 may be similar in function to the control plane of a conventional Serving General Packet Radio Service (GPRS) Support Node (SGSN). MME 521 may manage mobility aspects in access such as gateway selection and tracking area list management. HSS 524 may include a database for network users, which includes subscription-related information to support the handling of communication sessions by network entities. Depending on the number of mobile subscribers, the capacity of the equipment, the organization of the network, etc., CN 520 may include one or several HSS 524. For example, HSS 524 may provide support for routing / roaming, authentication, authorization, naming / addressing resolution, location dependency, etc.

[0107] The S-GW 522 may terminate the S1 interface 513 towards the RAN 510 and route data packets between the RAN 510 and the CN 520. In addition, the S-GW 522 may be a local mobility anchor for inter-RAN node handovers and may also provide an anchor for inter-3GPP mobility. Other functions may include lawful interception, charging, and some policy enforcement.

[0108] The P-GW 523 may terminate the SGi interface toward the PDN. The P-GW 523 may route data packets between the EPC network and an external network, such as a network including an application server 530 (alternatively referred to as an application function (AF)), via an Internet Protocol (IP) interface 525. Typically, the application server 530 may be an element of a core network that provides applications using IP bearer resources (e.g., a UMTS packet service (PS) domain, LTE PS data services, etc.). In this embodiment, the P-GW 523 is shown as being communicatively coupled to the application server 530 via an IP communication interface 525. The application server 530 may also be configured to support one or more communication services of the UEs 501 and 502 (e.g., voice over Internet Protocol (VoIP) sessions, PTT sessions, group communication sessions, social network services, etc.) via the CN 520.

[0109] The P-GW 523 may further be a node for policy enforcement and charging data collection. The Policy and Charging Enforcement Function (PCRF) 526 is a policy and charging control element of the CN 520. In a non-roaming scenario, there may be one PCRF in a Home Public Land Mobile Network (HPLMN) associated with an Internet Protocol Connectivity Access Network (IP-CAN) session of the UE. In a roaming scenario with local traffic bursts, there may be two PCRFs associated with the UE's IP-CAN session: a Home PCRF (H-PCRF) in the HPLMN and a Visited PCRF (V-PCRF) in a Visited Public Land Mobile Network (VPLMN). The PCRF 526 may be communicatively coupled to the Application Server 530 via the P-GW 523. The Application Server 530 may signal the PCRF 526 to indicate a new traffic flow and select appropriate Quality of Service (QoS) and charging parameters. PCRF 526 may provide this rule to a Policy and Charging Enforcement Function (PCEF) (not shown) using the appropriate Traffic Flow Template (TFT) and QoS Class (QCI) identifier, which initiates the QoS and charging specified by the Application Server 530 .

[0110] Figure 6 Example components of a device 600 according to certain embodiments are illustrated. In certain embodiments, the device 600 may include an application circuit 602, a baseband circuit 604, a radio frequency (RF) circuit 606, a front-end module (FEM) circuit 608, one or more antennas 610, and a power management circuit (PMC) 612 coupled together at least as shown. The components of the illustrated device 600 may be included in a UE or a RAN node. In certain embodiments, the device 600 may include fewer elements (e.g., the RAN node may not utilize the application circuit 602, but may include a processor / controller to process IP data received from the EPC). In certain embodiments, the device 600 may include additional elements, such as memory / storage, a display, a camera, a sensor, or an input / output (I / O) interface. In other embodiments, the components described below may be included in multiple devices (e.g., for a cloud-RAN (C-RAN) implementation, the circuits may be included in multiple devices, respectively).

[0111] The application circuit 602 may include one or more application processors. For example, the application circuit 602 may include circuits such as, but not limited to, one or more single-core or multi-core processors. The processor may include any combination of general-purpose processors and special-purpose processors (e.g., graphics processors, application processors, etc.). The processor may be coupled to or may include memory / storage, and may be configured to execute instructions stored in the memory / storage to enable various applications or operating systems to run on the device 600. In some embodiments, the processor of the application circuit 602 may process IP data packets received from the EPC.

[0112] The baseband circuit 604 may include circuits such as, but not limited to, one or more single-core or multi-core processors. The baseband circuit 604 may include one or more baseband processors or control logic to process baseband signals received from the receive signal path of the RF circuit 606 and generate baseband signals for the transmit signal path of the RF circuit 606. The baseband processing circuit 604 may interface with the application circuit 602 to generate and process baseband signals and control the operation of the RF circuit 606. For example, in some embodiments, the baseband circuit 604 may include a third generation (3G) baseband processor 604A, a fourth generation (4G) baseband processor 604B, a fifth generation (5G) baseband processor 604C, or other baseband processors 604D of other existing generations, generations under development, or generations to be developed in the future (e.g., second generation (2G), sixth generation (6G), etc.). The baseband circuit 604 (e.g., one or more baseband processors 604A-D) may handle various wireless control functions that enable communication with one or more radio networks via the RF circuit 606. In other embodiments, some or all of the functions of the baseband processors 604A-D may be included in a module stored in the memory 604G and executed via the central processing unit (CPU) 604E. The wireless control functions may include, but are not limited to, signal modulation / demodulation, encoding / decoding, radio frequency shifting, etc. In some embodiments, the modulation / demodulation circuitry of the baseband circuitry 604 may include fast Fourier transform (FFT), precoding, or constellation mapping / demapping functions. In some embodiments, the encoding / decoding circuitry of the baseband circuitry 604 may include convolution, tail bit convolution, turbo, Viterbi, or low density parity check (LDPC) encoder / decoder functions. The embodiments of the modulation / demodulation and encoder / decoder functions are not limited to these examples, and may include other suitable functions in other embodiments.

[0113] In some embodiments, the baseband circuit 604 may include one or more audio digital signal processors (DSPs) 604F. The audio DSP 604F may include elements for compression / decompression and echo cancellation, and may include other suitable processing elements in other embodiments. In some embodiments, the components of the baseband circuit may be appropriately combined in a single chip, a single chipset, or disposed on the same circuit board. In some embodiments, some or all of the constituent components of the baseband circuit 604 and the application circuit 602 may be implemented together, such as on a system on a chip (SOC).

[0114] In some embodiments, the baseband circuit 604 can provide communications compatible with one or more radio technologies. For example, in some embodiments, the baseband circuit 604 can support communications with an Evolved Universal Terrestrial Radio Access Network (EUTRAN) or other wireless metropolitan area network (WMAN), wireless local area network (WLAN), wireless personal area network (WPAN). In embodiments where the baseband circuit 604 is configured to support radio communications of multiple wireless protocols, it can be referred to as a multi-mode baseband circuit.

[0115] The RF circuit 606 may enable communication with a wireless network using modulated electromagnetic radiation through a non-solid medium. In various embodiments, the RF circuit 606 may include switches, filters, amplifiers, etc. to facilitate communication with the wireless network. The RF circuit 606 may include a receive signal path, which may include circuits for down-converting RF signals received from the FEM circuit 608 and providing baseband signals to the baseband circuit 604. The RF circuit 606 may also include a transmit signal path, which may include circuits for up-converting baseband signals provided by the baseband circuit 604 and providing RF output signals to the FEM circuit 608 for transmission.

[0116] In some embodiments, the receive signal path of the RF circuit 606 may include a mixing circuit 606a, an amplifying circuit 606b, and a filtering circuit 606c. In some embodiments, the transmit signal path of the RF circuit 606 may include a filtering circuit 606c and a mixing circuit 606a. The RF circuit 606 may also include a synthesizing circuit 606d for synthesizing the frequencies used by the mixing circuit 606a of the receive signal path and the transmit signal path. In some embodiments, the mixing circuit 606a of the receive signal path may be configured to down-convert the RF signal received from the FEM circuit 608 based on the synthesized frequency provided by the synthesizing circuit 606d. The amplifying circuit 606b may be configured to amplify the down-converted signal, and the filtering circuit 606c may be a low pass filter (LPF) or a band pass filter (BPF) configured to remove unwanted signals from the down-converted signal to generate an output baseband signal. The output baseband signal may be provided to the baseband circuit 604 for further processing. In some embodiments, the output baseband signal may be a zero frequency baseband signal, but this is not required. In some embodiments, the mixing circuit 606a of the receive signal path may include a passive mixer, although the scope of the embodiments is not limited in this respect.

[0117] In some embodiments, the mixer circuit 606a of the transmit signal path may be configured to up-convert an input baseband signal based on a synthesized frequency provided by the synthesizer circuit 606d to generate an RF output signal for the FEM circuit 608. The baseband signal may be provided by the baseband circuit 604 and may be filtered by the filter circuit 606c.

[0118] In some embodiments, the mixing circuit 606a of the receive signal path and the mixing circuit 606a of the transmit signal path may include two or more mixers and may be arranged for orthogonal down-conversion and up-conversion, respectively. In some embodiments, the mixing circuit 606a of the receive signal path and the mixing circuit 606a of the transmit signal path may include two or more mixers and may be arranged for image rejection (e.g., Hartley image rejection). In some embodiments, the mixing circuit 606a of the receive signal path and the mixing circuit 606a of the transmit signal path may be arranged for direct down-conversion and direct up-conversion, respectively. In some embodiments, the mixing circuit 606a of the receive signal path and the mixing circuit 606a of the transmit signal path may be configured for superheterodyne operation.

[0119] In some embodiments, the output baseband signal and the input baseband signal may be analog baseband signals, but the scope of the embodiments is not limited in this respect. In some alternative embodiments, the output baseband signal and the input baseband signal may be digital baseband signals. In these alternative embodiments, the RF circuit 606 may include an analog-to-digital converter (ADC) and a digital-to-analog converter (DAC) circuit, and the baseband circuit 604 may include a digital baseband interface to communicate with the RF circuit 606.

[0120] In some dual-mode embodiments, separate radio IC circuits may be provided for processing signals for each frequency spectrum, although the scope of the embodiments is not limited in this respect.

[0121] In some embodiments, the synthesizer circuit 606d may be a fractional-N synthesizer or a fractional-N / N+1 synthesizer, but the scope of the embodiments is not limited in this respect, as other types of frequency synthesizers may be suitable. For example, the synthesizer circuit 606d may be a delta-sigma synthesizer, a frequency multiplier, or a synthesizer including a phase-locked loop with a frequency divider.

[0122] The synthesizing circuit 606d may be configured to synthesize an output frequency based on the frequency input and the divider control input for use by the mixing circuit 606a of the RF circuit 606. In some embodiments, the synthesizing circuit 606d may be a fractional-N / N+1 synthesizer.

[0123] In some embodiments, the frequency input may be provided by a voltage controlled oscillator (VCO), but this is not required. The divider control input may be provided by the baseband circuit 604 or the application processor 602 according to the desired output frequency. In some embodiments, the divider control input (e.g., N) may be determined from a lookup table based on the channel indicated by the application processor 602.

[0124] The synthesis circuit 606d of the RF circuit 606 may include a frequency divider, a delay locked loop (DLL), a multiplexer, and a phase accumulator. In some embodiments, the frequency divider may be a dual-mode frequency divider (DMD), and the phase accumulator may be a digital phase accumulator (DPA). In some embodiments, the DMD may be configured to divide the input signal by N or N+1 (e.g., based on a carry) to provide a fractional frequency division ratio. In some example embodiments, the DLL may include a set of cascaded adjustable delay cells, a phase detector, a charge pump, and a D-type flip-flop. In these embodiments, the delay cell may be configured to divide the VCO cycle into Nd equal phase groups, where Nd is the number of delay cells in the delay line. In this way, the DLL provides negative feedback to help ensure that the total delay through the delay line is one VCO cycle.

[0125] In some embodiments, the synthesizing circuit 606d can be configured to generate a carrier frequency as an output frequency, while in other embodiments, the output frequency can be a multiple of the carrier frequency (e.g., twice the carrier frequency, four times the carrier frequency), and used in conjunction with an orthogonal generator and a frequency division circuit to generate multiple signals with different phases at the carrier frequency. In some embodiments, the output frequency can be an LO frequency (fLO). In some embodiments, the RF circuit 606 can include an IQ / polarity converter.

[0126] The FEM circuitry 608 may include a receive signal path that may include circuitry configured to operate on RF signals received from one or more antennas 610, amplify the received signals, and provide an amplified version of the received signals to the RF circuitry 606 for further processing. The FEM circuitry 608 may also include a transmit signal path that may include circuitry configured to amplify signals provided by the RF circuitry 606 for transmission for transmission through one or more of the one or more antennas 610. In various embodiments, amplification by the transmit or receive signal path may be accomplished only in the RF circuitry 606, only in the FEM 608, or in both the RF circuitry 606 and the FEM 608.

[0127] In some embodiments, the FEM circuit 608 may include a TX / RX switch to switch between transmit mode operation and receive mode operation. The FEM circuit 608 may include a receive signal path and a transmit signal path. The receive signal path of the FEM circuit 608 may include a low noise amplifier (LNA) to amplify the received RF signal and provide the amplified received RF signal as an output (e.g., provided to the RF circuit 606). The transmit signal path of the FEM circuit 608 may include: a power amplifier (PA) for amplifying the input RF signal (e.g., provided by the RF circuit 606); and one or more filters for generating an RF signal for subsequent transmission (e.g., through one or more of the one or more antennas 610).

[0128] In some embodiments, PMC 612 can manage the power provided to baseband circuit 604. In particular, PMC 612 can control power selection, voltage scaling, battery charging, or DC-DC conversion. When device 600 is capable of being powered by a battery, for example, when the device is included in a UE, PMC 612 can often be included. PMC 612 can improve power conversion efficiency while providing a desired implementation size and heat dissipation characteristics.

[0129] Figure 6PMC 612 is shown coupled only to baseband circuitry 604. However, in other embodiments, PMC 612 may additionally or alternatively be coupled to and perform similar power management operations for other components, such as, but not limited to, application circuitry 602, RF circuitry 606, or FEM 608.

[0130] In certain embodiments, the PMC 612 may control, or otherwise be part of, various power saving mechanisms of the device 600. For example, if the device 600 is in an RRC connected state (in which it remains connected to a RAN node because it expects to briefly receive traffic), then after a period of inactivity, it may enter a state known as discontinuous reception mode (DRX). During this state, the device 600 may be powered off for short intervals, thereby saving power.

[0131] If there is no data traffic activity for an extended period of time, the device 600 may transition to an RRC idle state, in which it is disconnected from the network and does not perform operations such as channel quality feedback, handover, etc. The device 600 enters a very low power state and performs paging, in which it wakes up periodically again to listen to the network, and then powers down again. The device 600 may not receive data in this state, and in order to receive data, it must transition back to the RRC connected state.

[0132] Additional power saving modes can keep a device from using the network for longer than the paging interval (which can vary from a few seconds to several hours). During this time, the device is completely unable to access the network and may be completely powered down. Any data transmitted during this time will incur a significant delay, and it is assumed that this delay is acceptable.

[0133] The processor of the application circuit 602 and the processor of the baseband circuit 604 can be used to execute elements of one or more instances of the protocol stack. For example, the processor of the baseband circuit 604 can be used alone or in combination to perform layer 3, layer 2, or layer 1 functions, and the processor of the application circuit 602 can utilize data received from these layers (e.g., packet data) and further perform layer 4 functions (e.g., transmission communication protocol (TCP) and user datagram protocol (UDP) layers). As mentioned herein, layer 3 may include a radio resource control (RRC) layer, which will be described in further detail below. As mentioned herein, layer 2 may include a media access control (MAC) layer, a radio link control (RLC) layer, and a packet data convergence protocol (PDCP) layer, which will be described in further detail below. As mentioned herein, layer 1 may include a physical (PHY) layer of a UE / RAN node, which will be described in further detail below.

[0134] Figure 71 illustrates an example interface of a baseband circuit according to some embodiments. As discussed above, Figure 6 The baseband circuit 604 may include processors 604A-604E and a memory 604G used by the processors. Each of the processors 604A-604E may include a memory interface 704A-704E, respectively, to transmit / receive data to / from the memory 604G.

[0135] The baseband circuit 604 may further include one or more interfaces to communicatively couple to other circuits / devices, such as a memory interface 712 (e.g., an interface for transmitting / receiving data to / from a memory external to the baseband circuit 604), an application circuit interface 714 (e.g., an interface for transmitting / receiving data to / from a memory external to the baseband circuit 604), and a memory interface 715 (e.g., an interface for transmitting / receiving data to / from a memory external to the baseband circuit 604). Figure 6 The application circuit 602 transmits / receives data), the RF circuit interface 716 (for example, for transmitting / receiving data to / from Figure 6 an interface for transmitting / receiving data to / from the RF circuit 606), a wireless hardware connection interface 718 (e.g., for transmitting / receiving data to / from a near field communication (NFC) component, Components (e.g. Low energy), components and other communication components to transmit / receive data), and a power management interface 720 (for example, an interface for transmitting / receiving power or control signals to / from the PMC 612).

[0136] Figure 8 is a block diagram illustrating components capable of reading instructions from a machine-readable or computer-readable medium (e.g., a non-transitory machine-readable storage medium) and performing any one or more of the methods discussed herein, according to certain example embodiments. Specifically, Figure 8 A diagrammatic representation of hardware resources 800 is shown, including one or more processors (or processor cores) 810, one or more memory / storage devices 820, and one or more communication resources 830, each of which may be communicatively coupled via a bus 840. For embodiments in which node virtualization (e.g., NFV) is utilized, a manager 802 may be executed to provide an execution environment for one or more network slices / sub-slices to utilize the hardware resources 800.

[0137] Processor 810 (e.g., a central processing unit (CPU), a reduced instruction set computing (RISC) processor, a complex instruction set computing (CISC) processor, a graphics processing unit (GPU), a digital signal processor (DSP) such as a baseband processor, an application specific integrated circuit (ASIC), a radio frequency integrated circuit (RFIC), another processor, or any suitable combination thereof) may include, for example, processor 812 and processor 814.

[0138] The memory / storage device 820 may include main memory, disk storage, or any suitable combination thereof. The memory / storage device 820 may include, but is not limited to, any type of volatile or non-volatile memory, such as dynamic random access memory (DRAM), static random access memory (SRAM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), flash memory, solid-state memory, etc.

[0139] The communication resources 830 may include an interconnect or network interface component or other suitable device to communicate with one or more peripheral devices 804 or one or more databases 806 via the network 808. For example, the communication resources 830 may include a wired communication component (e.g., for coupling via a universal serial bus (USB)), a cellular communication component, an NFC component, Components (e.g. Low energy), components and other communication components.

[0140] The instructions 850 may include software, programs, applications, applet programs, APPs, or other executable codes for causing at least any one of the processors 810 to perform any one or more of the methods discussed herein. The instructions 850 may reside in whole or in part within at least one of the processors 810 (e.g., within a cache memory of the processor), within the memory / storage device 820, or any suitable combination thereof. In addition, any portion of the instructions 850 may be transmitted to the hardware resources 800 from any combination of the peripheral device 804 or the database 806. Therefore, the memory of the processor 810, the memory / storage device 820, the peripheral device 804, and the database 806 are examples of computer-readable and machine-readable media.

[0141] In various embodiments, Figure 5-8 Equipment / components (especially Figure 7 Baseband circuits) can be used to practice all or part of Figure 1-3 Any operational flow / algorithm structure depicted in.

[0142] exist Figure 1An example of an operation flow / algorithm structure is depicted in . According to certain embodiments, the operation flow / algorithm structure may be performed by a next generation Node B (gNB). In this example, the operation flow / algorithm structure 100 may include: at 105, retrieving time domain resource allocation information including a table from a memory, the table including an indication of the number of times a physical shared channel transmission to be used by a user equipment (UE) is repeated. The operation flow / algorithm structure 100 may further include: at 110, generating a first message including the time domain resource allocation information table. The operation flow / algorithm structure 100 may further include: at 115, encoding the first message for transmission to the UE. The operation flow / algorithm structure 100 may further include: at 120, generating a second message including an index to the time domain resource allocation information table. The operation flow / algorithm structure 100 may further include: at 125, encoding the second message for transmission to the UE.

[0143] exist Figure 2 Another example of an operational flow / algorithm structure is depicted in . According to certain embodiments, the operational flow / algorithm structure may be performed by a UE. In this example, the operational flow / algorithm structure 200 may include: at 205, receiving a first message including time domain resource allocation information, the time domain resource allocation information including a table with an indication of the number of times a physical shared channel transmission to be used by the UE is repeated. The operational flow / algorithm structure 200 may further include: at 210, receiving a second message including an index to the time domain resource allocation information table. The operational flow / algorithm structure 200 may further include: at 215, performing repeated physical shared channel transmissions based on the time domain resource allocation information.

[0144] exist Figure 3 Another example of an operational flow / algorithm structure is depicted in . According to certain embodiments, the operational flow / algorithm structure may be performed by a gNB. In this example, the operational flow / algorithm structure 300 may include: at 305, generating a first message including time domain resource allocation information, the time domain resource allocation information including an entry table, wherein each entry includes an indication of the number of times a physical shared control channel to be used by a user equipment (UE) is repeated. The operational flow / algorithm structure 300 may further include: at 310, encoding the first message for transmission to the UE. The operational flow / algorithm structure 300 may further include: at 315, generating a second message including an index to the time domain resource allocation information table. The operational flow / algorithm structure 300 may further include: at 320, encoding the second message for transmission to the UE.

[0145] Example

[0146] Some non-limiting examples are provided below.

[0147] Example 1 includes an apparatus comprising: a memory for storing time domain resource allocation information including a table, the table including an indication of the number of times a physical shared channel transmission to be used by a user equipment (UE) is repeated; and a processing circuit, coupled to the memory, for: retrieving the time domain resource allocation information table from the memory; generating a first message including the time domain resource allocation information table; encoding the first message for transmission to the UE; generating a second message, the second message including an index to the time domain resource allocation information table; and encoding the second message for transmission to the UE.

[0148] Example 2 includes the apparatus of Example 1 or some other example herein, wherein the first message is encoded for transmission to the UE via radio resource control (RRC) signaling.

[0149] Example 3 includes the apparatus of Example 1 or some other example herein, wherein the second message is included in downlink control information (DCI).

[0150] Example 4 includes the apparatus of Example 1 or some other example herein, wherein the time domain resource allocation information is associated with a physical uplink shared channel (PUSCH) transmission or a physical downlink shared channel (PDSCH) transmission.

[0151] Example 5 includes the apparatus of Example 1 or some other example herein, wherein the time domain resource allocation information further includes a number of shared channel repetitions and a duration of each repetition.

[0152] Example 6 includes the apparatus of Example 1 or any other example herein, wherein the time domain resource allocation information further includes the number of times the shared channel is repeated and the starting symbol or the ending symbol of each shared channel repetition.

[0153] Example 7 includes the apparatus of any one of Examples 1-6 or some other example herein, wherein the time domain resource allocation information further includes an indication of a starting position of a first shared channel repetition and a starting position of a second shared channel repetition.

[0154] Example 8 includes one or more computer-readable media storing instructions that, when executed by one or more processors, cause a user equipment (UE) to: receive a first message including time domain resource allocation information, the time domain resource allocation information including a table having an indication of the number of times a physical shared channel transmission to be used by the UE is repeated; receive a second message including an index to the time domain resource allocation information table; and, based on the time domain resource allocation information, perform repeated physical shared channel transmissions.

[0155] Example 9 includes one or more computer-readable media of Example 8 or some other example herein, wherein repetitions of transmissions having a length less than a predetermined threshold (L) do not cross time slot boundaries.

[0156] Example 10 includes one or more computer-readable media described in Example 8 or some other example herein, wherein the medium further stores instructions for causing the UE to determine a starting position of a transmission repetition or a duration of a transmission repetition based on: a downlink / uplink (DL / UL) region, a control resource set (CORESET) duration, a guard period duration of a time slot, or a start and length indicator value (SLIV) associated with a time domain allocation for an initial or previous transmission.

[0157] Example 11 includes one or more computer-readable media as described in Example 8 or some other example herein, wherein the first message is received via radio resource control (RRC) signaling.

[0158] Example 12 includes one or more computer-readable media as described in Example 8 or some other example herein, wherein the second message is included in downlink control information (DCI).

[0159] Example 13 includes one or more computer-readable media as described in any of Examples 8-12 or some other example herein, wherein the time domain resource allocation information is associated with a physical uplink shared channel (PUSCH) transmission or a physical downlink shared channel (PDSCH) transmission.

[0160] Example 14 includes one or more computer-readable media storing instructions that, when executed by one or more processors, cause a next-generation Node B (gNB) to: generate a first message including time domain resource allocation information, the time domain resource allocation information including a table of entries, wherein each entry includes an indication of a number of times a physical shared channel transmission to be used by a user equipment (UE) is repeated; encode the first message for transmission to the UE; generate a second message including an index to the table of time domain resource allocation information; and, encode the second message for transmission to the UE.

[0161] Example 15 includes one or more computer-readable media as described in Example 14 or some other example herein, wherein the first message is encoded for transmission to the UE via radio resource control (RRC) signaling.

[0162] Example 16 includes one or more computer-readable media as described in Example 14 or some other example herein, wherein the second message is included in downlink control information (DCI).

[0163] Example 17 includes one or more computer-readable media as described in Example 14 or some other example herein, wherein the time domain resource allocation information is associated with a physical uplink shared channel (PUSCH) transmission or a physical downlink shared channel (PDSCH) transmission.

[0164] Example 18 includes the one or more computer-readable media of Example 14 or some other example herein, wherein the time domain resource allocation information further includes a shared channel duration for each repetition.

[0165] Example 19 includes one or more computer-readable media as described in Example 14 or some other example herein, wherein the time domain resource allocation information further includes a start symbol or an end symbol repeated for each shared channel.

[0166] Example 20 includes one or more computer-readable media as described in any one of Examples 14-19 or some other example herein, wherein the time domain resource allocation information also includes an indication of a starting position of a first shared channel repetition and a starting position of a second shared channel repetition.

[0167] Example 21 may include an apparatus comprising: a module for performing one or more elements of a method described in or with respect to any of Examples 1-20, or any other method or process described herein.

[0168] Example 22 may include one or more non-volatile computer-readable media comprising instructions that, when executed by one or more processors of an electronic device, cause the electronic device to perform one or more elements of a method described in or with respect to any of Examples 1-20, or any other method or process described herein.

[0169] Example 23 may include an apparatus comprising logic, modules, and / or circuits for performing one or more elements of a method described in or with respect to any of Examples 1-20, or any other method or process described herein.

[0170] Example 24 may include a method, technique, or process as described or related to any of Examples 1-20, or a portion thereof.

[0171] Example 25 may include a device comprising: one or more processors and one or more computer-readable media, wherein the one or more computer-readable media include instructions that, when executed by the one or more processors, cause the one or more processors to perform a method, technique, or process, or a portion thereof, as described in or with respect to any of Examples 1-20.

[0172] Example 26 may include a method of communicating in a wireless network as shown and described herein.

[0173] Example 27 may include a system for providing wireless communications as shown and described herein.

[0174] Example 28 may include an apparatus for providing wireless communications as shown and described herein.

[0175] The description of the implementations described herein includes what is described in the abstract and is not intended to be exhaustive or to limit the disclosure to the precise form disclosed. Although specific implementations and examples are described herein for illustrative purposes, various calculations may be performed to achieve alternative or equivalent implementations or implementations of the same purpose, based on the above detailed description, without departing from the scope of the disclosure.

Claims

1. A device for time domain resource allocation, comprising: a memory for storing time domain resource allocation information including a table including an indication of a number of times a physical shared channel transmission to be used by a user equipment UE is repeated; and A processing circuit, coupled to the memory, is configured to: Retrieving a time domain resource allocation information table from a memory; Generate a first message including a time domain resource allocation information table; encoding a first message for transmission to a UE; generating a second message, wherein the second message includes an index to the time domain resource allocation information table; as well as encoding a second message for transmission to the UE; Wherein, the time domain resource allocation information is associated with a physical uplink shared channel PUSCH transmission; The first message is encoded for transmission to the UE via radio resource control RRC signaling, and the second message is included in downlink control information DCI.

2. The device according to claim 1, wherein: Time domain resource allocation information is also associated with Physical Downlink Shared Channel PDSCH transmission.

3. The device according to claim 1, wherein: The time domain resource allocation information further includes the number of times the shared channel is repeated and the duration of each repetition.

4. The device according to claim 1, wherein: The time domain resource allocation information also includes: the number of times the shared channel is repeated and the starting symbol or the ending symbol of each shared channel repetition.

5. The apparatus according to any one of claims 1 to 4, wherein the time domain resource allocation information further comprises: An indication of a starting position of a first shared channel repetition and a starting position of a second shared channel repetition.

6. One or more computer-readable media for time domain resource allocation, wherein the one or more computer-readable media store instructions, which when executed by one or more processors, cause a user equipment UE to: receiving a first message including time domain resource allocation information, the time domain resource allocation information including a table with an indication of a number of times a physical shared channel transmission to be used by a UE is repeated; receiving a second message including an index to a time domain resource allocation information table; and performing repeated physical shared channel transmission based on the time domain resource allocation information; in, The time domain resource allocation information is associated with the physical uplink shared channel PUSCH transmission; The first message is received via radio resource control RRC signaling, and the second message is included in downlink control information DCI.

7. One or more computer-readable media as recited in claim 6, wherein repetitions of transmissions having a length less than a predetermined threshold L do not cross time slot boundaries.

8. One or more computer-readable media according to claim 6, wherein: The medium also stores instructions for causing the UE to determine a starting position of a transmission repetition or a duration of a transmission repetition based on: a downlink / uplink DL / UL region, a control resource set CORESET duration, a guard period duration of a time slot, or a start and length indicator value SLIV associated with a time domain allocation for an initial or previous transmission.

9. One or more computer-readable media according to any one of claims 6-8, wherein: Time domain resource allocation information is also associated with Physical Downlink Shared Channel PDSCH transmission.

10. One or more computer readable media for time domain resource allocation, wherein the one or more computer readable media store instructions that, when executed by one or more processors, cause a next generation Node B to: generating a first message comprising time domain resource allocation information, the time domain resource allocation information comprising a table of entries, wherein each entry comprises an indication of a number of times a physical shared channel transmission to be used by a user equipment UE is repeated; encoding a first message for transmission to a UE; generating a second message including an index of the time domain resource allocation information table; as well as encoding a second message for transmission to the UE; Wherein, the time domain resource allocation information is associated with physical uplink shared channel PUSCH transmission; The first message is encoded for transmission to the UE via radio resource control RRC signaling, and the second message is included in downlink control information DCI.

11. One or more computer-readable media according to claim 10, wherein: The time domain resource allocation information is also associated with physical downlink shared channel PDSCH transmission.

12. One or more computer-readable media according to claim 10, wherein: The time domain resource allocation information also includes a shared channel duration for each repetition.

13. The one or more computer-readable media of claim 10, wherein: The time domain resource allocation information also includes a starting symbol or an ending symbol repeated for each shared channel.

14. One or more computer readable media according to any one of claims 10-13, wherein: The time domain resource allocation information also includes an indication of a starting position of the first shared channel repetition and a starting position of the second shared channel repetition.

Images