WO2020194264A1 - Methods and nodes for downlink intra-ue pre-emption - Google Patents

Methods and nodes for downlink intra-ue pre-emption Download PDF

Info

Publication number
WO2020194264A1
WO2020194264A1 PCT/IB2020/052944 IB2020052944W WO2020194264A1 WO 2020194264 A1 WO2020194264 A1 WO 2020194264A1 IB 2020052944 W IB2020052944 W IB 2020052944W WO 2020194264 A1 WO2020194264 A1 WO 2020194264A1
Authority
WO
WIPO (PCT)
Prior art keywords
pdsch
resources
transmission
pdcch
pdsch transmission
Prior art date
Application number
PCT/IB2020/052944
Other languages
French (fr)
Inventor
Jonas FRÖBERG OLSSON
Alexey SHAPIN
Yufei Blankenship
Ying Sun
Kittipong KITTICHOKECHAI
Mattias Andersson
Jianwei Zhang
Original Assignee
Telefonaktiebolaget Lm Ericsson (Publ)
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Telefonaktiebolaget Lm Ericsson (Publ) filed Critical Telefonaktiebolaget Lm Ericsson (Publ)
Publication of WO2020194264A1 publication Critical patent/WO2020194264A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/003Arrangements for allocating sub-channels of the transmission path
    • H04L5/0044Arrangements for allocating sub-channels of the transmission path allocation of payload
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/003Arrangements for allocating sub-channels of the transmission path
    • H04L5/0053Allocation of signaling, i.e. of overhead other than pilot signals

Definitions

  • the present description generally relates to wireless communication systems and more specifically to receiving different signals that may use overlapping resources.
  • PDSCH Physical Downlink Shared Channel
  • DL Downlink
  • HARQ-ACK transmission must be in-order, as specified in Technical Specification (TS) 38.214, vl5.4.0, Section 5.1.
  • a PDSCH will not comprise data in resources used by the Physical Downlink Control Channel (PDCCH) that schedules the PDSCH.
  • PDCCH Physical Downlink Control Channel
  • DMRS Demodulation Reference Signal
  • PDSCH Physical Downlink Control Information
  • DCI Downlink Control Information
  • CORESET Control Resource Set
  • CE Media Access Control Element
  • some embodiments include a method performed by a wireless device.
  • some embodiments include a wireless device configured, or operable, to perform one or more functionalities (e.g. actions, operations, steps, etc.) as described herein.
  • the wireless device may comprise one or more communication interfaces configured to communicate with one or more other radio nodes and/or with one or more network nodes, and processing circuitry operatively connected to the communication interface, the processing circuitry being configured to perform one or more functionalities as described herein.
  • the processing circuitry may comprise at least one processor and at least one memory storing instructions which, upon being executed by the processor, configure the at least one processor to perform one or more functionalities as described herein.
  • the wireless device may comprise one or more functional modules configured to perform one or more functionalities as described herein.
  • some embodiments include a non-transitory computer- readable medium storing a computer program product comprising instructions which, upon being executed by processing circuitry (e.g., at least one processor) of the wireless device, configure the processing circuitry to perform one or more functionalities as described herein.
  • processing circuitry e.g., at least one processor
  • some embodiments include a method performed by a network node.
  • some embodiments include a network node configured, or operable, to perform one or more functionalities (e.g. actions, operations, steps, etc.) as described herein.
  • the network node may comprise one or more communication interfaces configured to communicate with one or more other radio nodes and/or with one or more network nodes, and processing circuitry operatively connected to the communication interface, the processing circuitry being configured to perform one or more functionalities as described herein.
  • the processing circuitry may comprise at least one processor and at least one memory storing instructions which, upon being executed by the processor, configure the at least one processor to perform one or more functionalities as described herein.
  • the network node may comprise one or more functional modules configured to perform one or more functionalities as described herein.
  • some embodiments include a non-transitory computer- readable medium storing a computer program product comprising instructions which, upon being executed by processing circuitry (e.g., at least one processor) of the network node, configure the processing circuitry to perform one or more functionalities as described herein.
  • processing circuitry e.g., at least one processor
  • the embodiments allow to handle resources used by a later PDSCH and a PDCCH that overlap with a previous assigned PDSCH.
  • Figure 1 shows a schematic illustration of a PDCCH being punctured into a PDSCH.
  • Figure 2 shows a schematic illustration of time overlapping resources of PDCCH being punctured into a PDSCH.
  • Figure 3 shows a schematic illustration of later resources than PDCCH being punctured into a PDSCH.
  • Figure 4 shows a schematic illustration of a PDSCH2 being punctured into a PDSCH1.
  • Figure 5 shows a schematic illustration of time overlapping resources PDSCH2 being punctured into a PDSCH1.
  • Figure 6 shows a schematic illustration of PDSCH2 and all overlapping resources of PDSCH2 and later symbols being puncturing into PDSCH1.
  • Figure 7 illustrates an example of intra-UE pre-emption in downlink, according to some embodiments.
  • Figure 8 illustrates an example of intra-UE pre-emption in downlink in which the CORESET for each PDCCH is illustrated, according to some embodiments.
  • Figure 9 illustrates another example of intra-UE pre-emption in downlink in which the CORESET for each PDCCH is illustrated, according to some embodiments.
  • Figure 10 illustrates another example of intra-UE pre-emption in downlink in which the CORESET for each PDCCH is illustrated, according to some embodiments.
  • FIG 11 illustrates another example of intra-UE pre-emption in downlink in which the CORESET for each PDCCH is illustrated, according to some embodiments.
  • Figure 12 is a flow chart of a method in a wireless device, in accordance with some embodiments.
  • Figure 13 is a flow chart of a method in a network node, in accordance with some embodiments.
  • Figure 14 illustrates one example of a wireless communications system in which embodiments of the present disclosure may be implemented.
  • Figures 15 and 16 are block diagrams that illustrate a wireless device according to some embodiments of the present disclosure.
  • Figures 17 and 18 are block diagrams that illustrate a network node according to some embodiments of the present disclosure.
  • Figure 19 illustrates a virtualized environment of a network node, according to some embodiments of the present disclosure.
  • CASE 1 Receiving a PDSCH that overlaps with a PDCCH.
  • This case is concerned with a UE receiving a (first) PDSCH that overlaps with a PDCCH which schedules another (second) PDSCH, i.e. the PDCCH does not schedule the first PDSCH.
  • the network node may signal an indication that the first PDSCH overlaps with the PDCCH.
  • the UE can determine a reception procedure of the PDDCH based on the indication.
  • the PDCCH can be transmitted to the UE receiving the first PDSCH, or to a group of UEs including the UE receiving the first PDSCH.
  • the resources, occupied by DMRS used for receiving the PDCCH in the resources occupied by the PDCCH are included.
  • the UE successfully decodes a PDCCH on resources that overlap in time and/or frequency with resources that are allocated for a PDSCH transmission to the UE the UE assumes/determines the resources in time and frequency of the PDCCH that have punctured the PDSCH transmission.
  • Figure 1 illustrates such a case.
  • PDSCH 100 is punctured by resources overlapping in time and frequency with PDCCH 110.
  • the UE if the UE successfully decodes a PDCCH on resources that overlap in time and frequency with resources that are allocated for the PDSCH transmission to the UE, the UE assumes/determines that the resources that overlap in time with the PDCCH are punctured from the PDSCH transmission.
  • the resources that overlap in time comprise the resources used by PDCCH 110 and those that are not used by the PDCCH but overlap in time with PDCCH.
  • Figure 2 illustrates such a case, in which the resources 120 and resources used by PDSCH 100 which overlap in time and frequency with PDCCH 110 are not available for PDSCH 100. As such, the PDSCH 100 is punctured by these resources.
  • the UE if the UE successfully decodes a PDCCH on resources that overlap in time and frequency with resources that are allocated for the PDSCH transmission to the UE, the UE assumes/determines that the resources that overlap in time with the PDCCH 110, and all later resources are punctured from the PDSCH transmission.
  • This exemplary case is illustrated in Figure 3, in which resources 120, resources used by the PDSCH 100 which overlap in time and frequency with PDCCH 110 and resources 130, which represent the later resources, are not available for PDSCH 100. As such, PDSCH 100 is punctured by these later resources and time overlapping resources.
  • the UE determines/assumes that both PDCCH and PDSCH are present on the overlapping resources.
  • PDSCH is rate matched around potential PDCCH candidates
  • a set of resources that could be used for PDCCH are communicated to the UE. The UE assumes that any PDSCH that overlaps in time and frequency with these resources are rate matched around the set of resources.
  • CASE 2 Receiving a PDSCH that overlaps with another PDSCH.
  • the UE receives a first PDSCH (scheduled by a first/earlier PDCCH) and then receives a second PDSCH (scheduled by a second PDCCH) which uses resources that overlap with the first PDSCH.
  • a first PDSCH (scheduled by a first/earlier PDCCH)
  • a second PDSCH (scheduled by a second PDCCH) which uses resources that overlap with the first PDSCH.
  • the resources, occupied by DMRS and used for receiving the second PDSCH in the resources occupied by the first PDSCH are included.
  • one PDSCH is defined as having a higher priority than the other. This does not necessarily mean that there is an explicit priority associated with each PDSCH, it is just a compact notation for describing the behavior in different cases.
  • the network node may signal to the UE an indication of priority, based on which the UE can determine a reception procedure of the two PDSCHs.
  • the UE assumes that the higher priority PDSCH is punctured into the lower priority PDSCH.
  • Figure 4 illustrates a higher priority PDSCH 210 punctured into a lower priority PDSCH 200 with an earlier starting point.
  • the UE assumes that the resources that overlap in time with the higher priority PDSCH 210 are punctured from the lower priority PDSCH 200.
  • This example is illustrated in Figure 5, wherein the resources 300 and the resources that overlap in time with PDSCH 210 are not available for the lower priority PDSCH 200. As such, these resources, that overlap in time with the higher priority PDSCHs 210, are punctured into the lower priority PDSCH 200
  • the UE assumes that the resources that overlap in time with the higher priority PDSCH 210, and all later resources, are punctured from the lower priority PDSCH 200. This is illustrated in Figure 6.
  • the higher priority PDSCH 210 punctures all overlapping and later symbols/resources from the lower priority PDSCH 200.
  • the UE assumes that the lower priority PDSCH 200 is rate matched around the higher priority PDSCH 210.
  • the UE can assume that the higher priority PDSCH 210 is rate matched around the lower priority PDSCH 200.
  • the UE can assume that a lower priority DL Semi-Persistent Scheduling (SPS) PDSCH is rate matched around resources used by a higher priority DL SPS PDSCH transmission although no higher priority DL SPS PDSCH may be received.
  • SPS Semi-Persistent Scheduling
  • the UE can also assume that a higher priority DL SPS PDSCH is rate matched around a DL SPS PDSCH transmission that is not intended for the data from a predefined Logical Channel (LCH).
  • LCH Logical Channel
  • the UE can assume that the higher priority DL SPS PDSCH is rate matched around the DL SPS PDSCH transmission with dummy data.
  • a first PDSCH is considered to be scheduled later than a second PDSCH if both PDSCHs are scheduled by PDCCH, and the PDCCH scheduling the first PDSCH starts in an earlier Orthogonal Frequency Division Multiplexing (OFDM) symbol than the PDCCH scheduling the second PDSCH.
  • a first PDSCH is considered to be scheduled later than a second PDSCH if both PDSCHs are scheduled by PDCCH, and the PDCCH scheduling the first PDSCH ends in an earlier OFDM symbol than the PDCCH scheduling the second PDSCH.
  • a first PDSCH scheduled later than a second PDSCH has higher priority than the second PDSCH.
  • a first PDSCH scheduled dynamically by PDCCH has higher priority than a second PDSCH scheduled by DL-SPS.
  • a first PDSCH scheduled by DL-SPS has higher priority than a second PDSCH scheduled dynamically by PDCCH.
  • a first PDSCH scheduled by DL-SPS has lower priority than a second PDSCH scheduled dynamically by PDCCH.
  • a PDSCH can be associated with an explicit priority. Such a priority can be signaled through DCI or indicated by Radio Resource Control (RRC) if the PDSCH is scheduled by DL SPS.
  • RRC Radio Resource Control
  • a PDSCH without an explicit priority has higher priority than a PDSCH with an explicit priority.
  • a first PDSCH with an explicit priority higher than the explicit priority of a second PDSCH has higher priority than the second PDSCH.
  • a first PDSCH has higher priority than a second PDSCH if the first PDSCH occupies fewer OFDM symbols than the second PDSCH.
  • a first PDSCH has higher priority than a second PDSCH if the first PDSCH is scheduled by DCI that has Cyclic Redundancy Check (CRC) scrambled with a certain Radio Network Temporary Identity (RNTI), and the second PDSCH is not scheduled by DCI that has CRC scrambled with the certain RNTI.
  • CRC Cyclic Redundancy Check
  • RNTI Radio Network Temporary Identity
  • two colliding PDSCHs can be associated with two different HARQ process.
  • the two transport blocks (TBs) carried by the two PDSCHs are both received by the UE, if the UE is capable of simultaneously processing two DL TBs in a slot. If the UE is not capable of processing two DL TBs simultaneously, then the UE has to prioritize one TB and drop the other TB. Typically, the later scheduled TB is deemed higher priority and processed, whereas the earlier scheduled TB is dropped.
  • the two colliding PDSCHs are associated with the same HARQ process. In this case, the UE can only process one TB regardless of the UE’s processing capability.
  • the UE receives a first signal (earlier scheduled PDSCH) and a second signal (later scheduled PDCCH/PDSCH) which overlaps with resources of the first signal.
  • the network node can send an indication to the UE that the second signal punctures the first signal.
  • the network node can also send another indication regarding the priority of the later scheduled PDCCH/PDSCH and the earlier scheduled PDSCH. As such, the UE will receive and decode those transmissions based on the indication of puncturing and/or priority.
  • the later transmitted PDSCH has an associated PDCCH (i.e., dynamic scheduling) in the same slot. Therefore, the earlier transmitted PDSCH is affected by both the PDCCH and its associated later transmitted PDSCH.
  • one PDSCH or both of the PDSCH is/are not scheduled by an associated PDCCH, rather one PDSCH or both of the PDSCH is/are transmitted on semi-statically configured resources (i.e., DL SPS).
  • the later transmitted PDSCH can be associated with DL SPS, and the earlier transmitted PDSCH can be dynamically scheduled.
  • PDCCH 110 may not exist for the DL SPS case.
  • the two colliding PDSCHs are associated with two different HARQ processes.
  • the two transport blocks carried by the two PDSCHs are both received by the UE, if the UE is capable of simultaneously processing two DL TBs in a slot. If the UE is not capable of processing two DL TBs simultaneously, then the UE has to prioritize one TB and drop the other TB. Typically, the later scheduled TB is deemed higher priority and processed, whereas the earlier scheduled TB is dropped.
  • the two colliding PDSCHs are associated with the same HARQ process. In this case, the UE can only process one TB regardless of the UE’s processing capability.
  • the later PDCCH/PDSCH when the later scheduled PDCCH/PDSCH punctures resources of the earlier scheduled PDSCH, the later PDCCH/PDSCH can puncture the resources elements (REs) of the earlier scheduled PDSCH.
  • the punctured resources are considered to be not available for the PDSCH
  • the punctured resources can mean REs used for the coded PDCCH/PDSCH payload and the PDCCH/PDSCH DMRS.
  • the resources are punctured from the PDSCH, or
  • the PDSCH is decoded assuming the resources are present, but the soft-buffer values associated with the unavailable resources are flushed after decoding. Flushing can either be flushing only the soft-values related to the current PDSCH or flushing the aggregate soft-values related to the current and previous PDSCH transmissions (in case the current PDSCH is a re transmission).
  • Figure 7 illustrates an example in which, when the UE receives a first PDSCH1, the UE detects a PDCCH2 transmission, which schedules another (second) PDSCH transmission (i.e., PDSCH2). If the UE is signaled to have the later scheduled PDCCH/PDSCH (PDCCH2/PDSCH2) puncture REs of the earlier scheduled PDSCH (PDSCH1), when the UE receives PDSCH1, the UE determines that resources occupied by PDCCH2 are not available for PDSCH1. Alternatively, the resources corresponding to a union of the detected PDCCH2 that scheduled the PDSCH2 and associated PDCCH2 DMRS are not available for the PDSCH1. By“not available”, it can mean “rate matched around” or“punctured”.
  • the associated PDCCH DMRS are DMRS in all Resource Element Groups (REGs) of the CORESET associated with PDCCH2.
  • the CORESET precoder granularity is equal to the number of contiguous Resource Blocks (RBs) in the frequency domain within the CORESET.
  • PDCCH2 DMRS is mapped over all REGs within the associated CORESET to improve channel estimation performance.
  • the associated DMRS are the DMRS in REGs of the PDCCH2.
  • the CORESET precoder granularity is equal to the REG bundle size in the frequency domain.
  • PDCCH DMRS is located in the REGs occupied by PDCCH2, not the entire CORESET.
  • Figure 8 illustrates the same scenario as Figure 7, but Figure 8 further shows the CORESET for each PDCCH.
  • PDCCH 1 and PDCCH2 are used in scheduling DL data transmissions: PDSCH1 and PDSCH2, respectively.
  • the PDCCH candidate in the middle of the figure is monitored by the UE but not detected.
  • the UE assumes, for a first PDSCH, that resources used for PDSCHs that start later than the first PDSCH are not available for the first PDSCH.
  • the UE assumes that the resources occupied by PDSCH2 and its associated DMRS are not available for PDSCH1.
  • the UE assumes, for a PDSCH, that resources which can potentially be used for PDCCH, but if the signaling message for the PDCCH is not detected, are available for the PDSCH.
  • the UE performs PDCCH candidate monitoring in the search space of the middle PDCCH, but it does not find any valid PDCCH. Hence, resources that can be potentially used by the middle PDCCH and its associated CORESET are available for PDSCH1.
  • the UE can determine, for a first PDSCH, which resources used by later PDCCHs/PDSCHs (which start later than the first PDSCH) that are not available based on the TCI-state for the first PDSCH and TCI-states for the later PDCCHs/PDSCHs. In one aspect, only the resources used for the later PDCCHs/PDSCHs that have the same TCI-state as the first PDSCH will not be available. In other aspects, the UE is configured with“previous-PDSCH- resources-available” parameters for TCI-states of the later PDCCHs/PDSCHs. The parameters may be associated with the CORESET or search space configured for the UE.
  • the UE is configured with two CORESETs associated with two different TCI-states, with one of the CORESETs or TCI-states having “previous-PDSCH-resources-available” enabled, while the other CORESET or TCI-state having“previous-PDSCH-resources-available” disabled. If a later PDCCH is received on the CORESET for which an enabled “previous-PDSCH-resources- available” parameter is associated, the UE assumes that the resources used by the later PDCCH/PDSCH are available for the first PDSCH.
  • the UE assumes that the resources used by the later PDCCH/PDSCH are non-available for the first PDSCH.
  • the UE can determine, for a first PDSCH, which resources used by later PDCCHs/PDSCHs (which start later than the first PDSCH) that are not available based on an explicit field in the DCI carried by a later PDCCH scheduling a later PDSCH or a PUSCH transmission.
  • the DCI may comprise a field indicating if the resources used by the later PDCCH/PDSCH are available or not for the first PDSCH.
  • the indication may be separate for the later PDCCH and later PDSCH, thus, enabling a first indication that resources used by the later PDCCH are available and a second indication that resources used by the later PDSCH are not available for the previous PDSCH (or vice-versa).
  • the indication can indicate a priority, transmission-profile, or logical-channel-set of PDSCH which indicates to a UE which resources for a previous/later PDSCH are available with regards to a later/previous PDSCH.
  • the previous PDSCH can be indicated as a higher priority than the later PDSCH.
  • the later PDSCH is rate-matched around the previous PDSCH.
  • the availability may also be implicitly indicated by the DCI type, CORESET or search space.
  • the CORESET and/or search space may be associated/configured with a“previous-PDSCH-resources-available” parameter.
  • the UE can send a HARQ-ACK for a PDSCH which does not have available resources to be used by a later PDCCH/PDSCH.
  • the HARQ-ACK can be determined such that the unavailable resources are counted as available for the purpose of determining HARQ- ACK timing.
  • the timeline in the UE is such that the HARQ-ACK cannot be produced taking the non-available/unavailable resources into account.
  • the non availability is taken into soft-buffer handling, in which the soft-buffer values relating to the non- available resources are flushed/cleared, which means that, if the PDSCH is a re-transmission, the soft-values from the previous transmissions for the same TB and the same HARQ process that relates to the non-available resources will also be flushed.
  • the UE can only flush the soft-values relating to the PDSCH and relating to non-available resources.
  • the UE when the UE detects a later PDCCH/PDSCH within the allocated PDSCH resource, the UE assumes that previous possible PDCCH(s) resources, within the allocated PDSCH where a control signal has not been detected, are available to the allocated PDSCH.
  • some of the later PDCCHs or PDSCHs may partially overlap in time or frequency with the initially allocated PDSCH, as illustrated in Figure 8.
  • PDCCH2 and PDSCH2 overlap with PDSCH1, in time and frequency.
  • Allowing a UE to receive another (second) PDSCH starting earlier than the end of the first PDSCH where its scheduling PDCCH starts at a symbol later than the ending symbol of the first scheduling PDCCH as illustrated in Figures 7 and 8 can potentially increase UE complexity, i.e., the UE may need to perform simultaneous PDCCH blind decoding and PDSCH decoding.
  • the following examples aim to reduce this potential complexity.
  • one or more specific search spaces are defined for the UE to be used for PDCCH monitoring occasions, which are overlapped with the previously scheduled PDSCH.
  • the specific search spaces for such monitoring occasions can be RRC configured.
  • the specific search spaces defined for the PDCCH monitoring occasions, which overlap with the scheduled PDSCH, may contain a smaller number of DCI formats for a UE to monitor or a smaller number of PDCCH candidates per Control Channel Element (CCE) aggregation level, or a smaller set of aggregation levels than the normally configured search spaces.
  • a parameter celled dci-Formats overlapped mo can be added to the search space information element. If dci-Formats overlapped mo is configured for the search space, the DCI formats defined in dci-Formats overlapped mo are monitored when a PDCCH monitoring occasion is overlapped with the scheduled PDSCH instead of those in dci-Formats .
  • specific rules can be applied to the configured search space for the PDCCH monitoring occasions which are overlapped with the scheduled PDSCH. For example, only a subset of the DCI formats out of all configured formats in the configured search space are monitored by the UE in the PDCCH monitoring occasions overlapped with the scheduled PDSCH. Or, only a smaller number of PDCCH candidates per CCE aggregation level configured in the configured search space are monitored by the UE in the PDCCH monitoring occasions overlapped with the scheduled PDSCH. These specific rules can be fixed in the standard specification or separately configured.
  • URLLC Ultra Reliable Low Latency Communication
  • Overlapping of a PDCCH monitoring occasion with a scheduled PDSCH in the above examples may include overlapping in time but not in frequency or both in time and frequency.
  • the UE rate matches around some or all of the PDCCH candidates it monitors that overlap with the PDSCH transmission, even if no PDCCH is successfully received on these candidates.
  • the later PDCCH/PDSCH when the later scheduled PDCCH/PDSCH punctures resources of the earlier scheduled PDSCH, the later PDCCH/PDSCH can puncture the symbols of the earlier scheduled PDSCH.
  • the UE when the UE detects a later PDCCH/PDSCH within the allocated PDSCH resources, the UE can assume that the allocated PDSCH (first signal or PDSCH1 of Figure 9) is cancelled. This is particularly useful for a UE which is capable of processing one TB in a slot, not two TBs in a slot simultaneously.
  • the UE is capable of processing two TBs in a slot simultaneously, the first scheduled PDSCH1 does not have to be cancelled entirely.
  • the PDSCH1 symbols are skipped starting with the first symbol where PDCCH2/PDSCH2 resources collide with the PDSCH1 resource, as shown in Figure 9. More specifically, Figure 9 illustrates an example of intra-UE pre-emption in downlink. The CORESET for each PDCCH is illustrated. PDCCH1 and PDCCH2 are actually used in scheduling DL data transmissions: PDSCH1 and PDSCH2, respectively. The symbols 900 are not available for PDSCH1.
  • FIG. 10 In another example, only PDSCH1 symbols where PDSCH1 resources collide with PDCCH2/PDSCH2 resources are skipped (the later resources are not included), as shown in Figure 10. More specifically, in Figure 10, an example of intra-UE pre-emption in downlink is illustrated. The CORESET for each PDCCH is illustrated. PDCCH1 and PDCCH2 are actually used in scheduling DL data transmissions: PDSCH1 and PDSCH2, respectively. The symbols 1000 are not available (or skipped) for PDSCH1, but the symbols 1010 are available for PDSCH1.
  • Example B Later scheduled PDCCH for UL scheduling punctures resources of earlier scheduled PDSCH
  • some of the later PDCCHs may be a PDCCH carrying UL grants (for which there is no later PDSCH). This is illustrated by Figure 11, for example.
  • PDCCH2/PDSCH2 pair the same principles and methods described above for dynamically scheduled later PDSCH (i.e., PDCCH2/PDSCH2 pair) still apply.
  • the only change is that PDSCH2 is absent.
  • FIG 11 an example of intra-UE pre-emption in downlink is illustrated.
  • the CORESET for each PDCCH is illustrated.
  • PDCCH1 is transmitted for scheduling PDSCH1.
  • PDCCH2 is transmitted for scheduling PUSCH.
  • the middle PDCCH candidate is monitored by the UE but not detected.
  • CASE 3 Receiving a PDSCH that overlaps with reference signals other than DMRS.
  • the reference signals can be, for example, phase tracking reference signals (PT-RS) or channel state information reference signals (CSI-RS). They can be also reference signal measurement resources without a present reference signal, such as for example zero-power channel state information reference signals (ZP CSI-RS).
  • PT-RS phase tracking reference signals
  • CSI-RS channel state information reference signals
  • ZP CSI-RS zero-power channel state information reference signals
  • the PDSCH can be rate matched around the resources that overlap with the reference signals.
  • the PDSCH can be punctured into the resources that overlap with the reference signals. In this case, the UE can assume that the reference signals are not present in these resources.
  • the PDSCH can be considered to have high priority if there is an explicit priority associated with the PDSCH. Such a priority can be signaled, by a network node, through DCI or indicated by RRC (if the PDSCH is scheduled by DL SPS).
  • the PDSCH can be considered to have high priority if there is an explicit priority associated with the PDSCH that is higher than a predefined value. Such a priority can be signaled through DCI or indicated by RRC if the PDSCH is scheduled by DL SPS.
  • the PDSCH can be considered to have high priority if the transmission occupies fewer OFDM symbols than a predefined value.
  • the PDSCH can be considered to have high priority if it is scheduled by DL-SPS.
  • the PDSCH can be considered to have high priority if the PDSCH is scheduled by DCI that has CRC scrambled with a certain RNTI.
  • the PDSCH can be either punctured into, or rate matched around the resources that overlap with the reference signals, depending on whether the PDSCH has high priority or not. If the PDSCH is punctured into the resources, the UE can assume that the reference signals are not present in these resources.
  • the PDSCH can be considered to have high priority compared to the reference signals scheduled through DCI without an explicit priority. If the PDSCH is associated with an explicit priority, the PDSCH is considered to have high priority compared to the reference signals scheduled through DCI with an explicit priority, if the explicit priority associated with the PDSCH is higher than the explicit priority in the DCI scheduling the reference signals.
  • the PDSCH can be rate matched around the resources that overlap with SSB.
  • the UE can assume that the SSB is not present in these resources.
  • the PDSCH can be punctured into the resources that overlap with SSB.
  • the PDSCH is either punctured into, or rate matched around the resources that overlap with SSB, depending on whether the PDSCH has high priority or not. If the PDSCH is punctured into the resources, the UE can assume that the SSB is not present in these resources.
  • Method 1200 comprises:
  • Step 1210 receiving a first PDSCH transmission scheduled by a first PDCCH signal.
  • Step 1220 in resources allocated for the first PDSCH transmission, receiving a second PDCCH signal, which schedules a second transmission, such that the second PDCCH signal and the first PDSCH transmission use overlapping resources.
  • the second PDCCH signal did not schedule the first PDSCH transmission.
  • Step 1230 determining a reception procedure of the first PDSCH transmission based on an indication that the second PDCCH signal punctures the first PDSCH transmission.
  • this reception procedure is a new reception procedure, different from the reception in step 1210, since the presence of the second PDCCH in the first PDSCH transmission changes the reception of the first PDSCH transmission.
  • the second transmission can be a PUSCH transmission or a second PDSCH transmission (which is different from the first PDSCH transmission).
  • the indication that the second PDCCH signal punctures the first PDSCH transmission can be given by the reception of the second PDCCH signal. As such, the indication is implicit.
  • the indication that the second PDCCH signal punctures the first PDSCH transmission can be given by a Downlink Control Information (DCI) in the second PDCCH signal or by a configuration from a Radio Resource Control (RRC).
  • DCI Downlink Control Information
  • RRC Radio Resource Control
  • determining the reception procedure of the first PDSCH transmission based on the indication may comprise decoding successfully the second PDCCH signal on resources that overlap in time and frequency with resources that are allocated for the first PDSCH transmission and determining resources punctured by the second PDCCH signal into the first PDSCH transmission.
  • determining the punctured resources may comprise determining resources of the first PDSCH transmission that overlap in time with the second PDCCH signal.
  • determining the punctured resources may comprise determining resources of the first PDSCH transmission that overlap in time with the second PDCCH signal and later resources.
  • the overlapping resources are time-and-frequency resources, while a determined puncturing resource could be one of time-frequency resources (REs) or time (symbol) resources (all REs of one or more symbols).
  • the wireless device/UE can send a HARQ- ACK for the first PDSCH transmission which has non-available resource used by the second PDCCH signal or second PDSCH transmission, wherein the HARQ-ACK is determined such that the non-available resource are counted as available for the purpose of determining HARQ ACK timing.
  • the UE may flush soft buffer values related to the non-available resources from a soft buffer.
  • the determination of the reception procedure of the first PDSCH transmission may be further based on a Transmission Configuration Indicator (TCI) state.
  • TCI Transmission Configuration Indicator
  • the resources used by the second PDCCH signal that have a same TCI state as the first PDSCH may not be available for the first PDSCH transmission.
  • resources used by the second PDCCH signals may be available for the first PDSCH transmission.
  • resources used by the second PDCCH signal may be non-available for the first PDSCH transmission.
  • the determination of the reception procedure may be further based on an indication of priority between the first PDSCH transmission and the second PDCCH signal.
  • the overlapping resources may comprise partially overlapping resources.
  • the UE may further send a UE capability to the network node and determine the reception procedure may be further based on the UE capability.
  • Method 1300 illustrates a method 1300 in a network node, according to an embodiment.
  • the method can be implemented in any network node, e.g. network node.
  • the network node may be the network node 1420 of Figures 14, 17 and 18.
  • Method 1300 comprises:
  • Step 1310 sending a first PDSCH transmission scheduled by a first PDCCH signal.
  • Step 1320 during the transmission of the first PDSCH, sending a second PDCCH signal scheduling a second transmission, such that the first PDSCH transmission and the second PDCCH signal use overlapping resources.
  • Step 1330 sending an indication that the second PDCCH signal punctures the first PDSCH transmission.
  • the network node may send a Downlink Control Information (DCI) including the indication or a Radio Resource Control (RRC) configuration including the indication.
  • DCI Downlink Control Information
  • RRC Radio Resource Control
  • the second transmission may be a PUSCH transmission or a second PDSCH transmission which is different from the first PDSCH transmission.
  • the overlapping resources may comprise partially overlapping resources.
  • the overlapping resources may be resource elements or symbols.
  • FIG. 14 illustrates an example of a wireless network 1400 that may be used for wireless communications.
  • Wireless network 1400 includes UEs 1410 and a plurality of radio network nodes 1420 (e.g., Node Bs (NBs) Radio Network Controllers (RNCs), evolved NBs (eNBs), next generation NB (gNBs), etc.) directly or indirectly connected to a core network 1430 which may comprise various core network nodes.
  • the network 1400 may use any suitable radio access network (RAN) deployment scenarios, including Universal Mobile Telecommunication System (UMTS) Terrestrial Radio Access Network (UTRAN), and Evolved UMTS Terrestrial Radio Access Network (EUTRAN).
  • UEs 1410 may be capable of communicating directly with radio network nodes 1420 over a wireless interface.
  • UMTS Universal Mobile Telecommunication System
  • UTRAN Universal Mobile Telecommunication System
  • EUTRAN Evolved UMTS Terrestrial Radio Access Network
  • UEs may also be capable of communicating with each other via device-to-device (D2D) communication.
  • network nodes 1420 may also be capable of communicating with each other, e.g. via an interface (e.g. X2 in LTE or other suitable interface).
  • UE 1410 may communicate with radio network node 1420 over a wireless interface. That is, UE 1410 may transmit wireless signals to and/or receive wireless signals from radio network node 1420.
  • the wireless signals may contain voice traffic, data traffic, control signals, and/or any other suitable information.
  • an area of wireless signal coverage associated with a radio network node 1420 may be referred to as a cell.
  • a UE may be a wireless device, a radio communication device, target device, device to device (D2D) UE, machine type UE or UE capable of machine to machine communication (M2M), a sensor equipped with UE, iPAD, Tablet, mobile terminals, smart phone, laptop embedded equipped (LEE), laptop mounted equipment (LME), Universal Serial Bus (USB) dongles, Customer Premises Equipment (CPE) etc.
  • D2D device to device
  • M2M machine to machine communication
  • iPAD machine to machine communication
  • Tablet mobile terminals
  • smart phone laptop embedded equipped (LEE), laptop mounted equipment (LME), Universal Serial Bus (USB) dongles, Customer Premises Equipment (CPE) etc.
  • LEE laptop embedded equipped
  • LME laptop mounted equipment
  • USB Universal Serial Bus
  • CPE Customer Premises Equipment
  • the“network node” can be any kind of network node which may comprise of a radio network node such as a radio access node (which can include a base station, radio base station, base transceiver station, base station controller, network controller, gNB, NR BS, evolved Node B (eNB), Node B, Multi-cell/multicast Coordination Entity (MCE), relay node, access point, radio access point, Remote Radio Unit (RRU), Remote Radio Head (RRH), a multi standard BS (also known as MSR BS), etc.), a core network node (e.g., MME, SON node, a coordinating node, positioning node, MDT node, etc.), or even an external node (e.g., 3rd party node, a node external to the current network), etc.
  • the network node may also comprise a test equipment.
  • network nodes 1420 may interface with a radio network controller (not shown).
  • the radio network controller may control network nodes 1420 and may provide certain radio resource management functions, mobility management functions, and/or other suitable functions.
  • the functions of the radio network controller may be included in the network node 1420.
  • the radio network controller may interface with the core network node 1440.
  • the radio network controller may interface with the core network node 1440 via the interconnecting network 1430.
  • the interconnecting network 1430 may refer to any interconnecting system capable of transmitting audio, video, signals, data, messages, or any combination of the preceding.
  • the interconnecting network 1430 may include all or a portion of a public switched telephone network (PSTN), a public or private data network, a local area network (LAN), a metropolitan area network (MAN), a wide area network (WAN), a local, regional, or global communication or computer network such as the Internet, a wireline or wireless network, an enterprise intranet, or any other suitable communication link, including combinations thereof.
  • PSTN public switched telephone network
  • LAN local area network
  • MAN metropolitan area network
  • WAN wide area network
  • Internet a local, regional, or global communication or computer network
  • wireline or wireless network such as the Internet
  • enterprise intranet an enterprise intranet, or any other suitable communication link, including combinations thereof.
  • the core network node 1440 may manage the establishment of communication sessions and various other functionalities for wireless devices 1410. Examples of core network node 1440 may include MSC, MME, SGW, PGW, O&M, OSS, SON, positioning node (e.g. E-SMLC), MDT node, etc.
  • Wireless devices 110 may exchange certain signals with the core network node 1440 using the non-access stratum layer. In non-access stratum signaling, signals between wireless devices 1410 and the core network node 1440 may be transparently passed through the radio access network.
  • network nodes 1420 may interface with one or more other network nodes over an intemode interface. For example, network nodes 1420 may interface each other over an X2 interface.
  • Network 1400 may include any additional elements suitable to support communication between wireless devices or between a wireless device and another communication device (such as a landline telephone).
  • the embodiments may be implemented in any appropriate type of telecommunication system supporting any suitable communication standards and using any suitable components and are applicable to any radio access technology (RAT) or multi-RAT systems in which the wireless device receives and/or transmits signals (e.g., data).
  • RAT radio access technology
  • multi-RAT systems in which the wireless device receives and/or transmits signals (e.g., data).
  • the communication system 1400 may itself be connected to a host computer (not shown), which may be embodied in the hardware and/or software of a standalone server, a cloud- implemented server, a distributed server or as processing resources in a server farm.
  • the host computer may be under the ownership or control of a service provider or may be operated by the service provider or on behalf of the service provider.
  • the connections between the communication system 1400 and the host computer may extend directly from the core network 1440 to the host computer or may extend via the intermediate network 1430.
  • the communication system of Figure 14 as a whole enables connectivity between one of the connected wireless devices (WDs) 1410 and the host computer.
  • the connectivity may be described as an over-the-top (OTT) connection.
  • the host computer and the connected WDs 1410 are configured to communicate data and/or signaling via the OTT connection, using an access network, the core network 1440, any intermediate network 1430 and possible further infrastructure (not shown) as intermediaries.
  • the OTT connection may be transparent in the sense that at least some of the participating communication devices through which the OTT connection passes are unaware of routing of uplink and downlink communications.
  • the host computer may provide host applications which may be operable to provide a service to a remote user, such as a WD 1410 connecting via an OTT connection terminating at the WD 1410 and the host computer.
  • the host application may provide user data which is transmitted using the OTT connection.
  • The“user data” may be data and information described herein as implementing the described functionality.
  • the host computer may be configured for providing control and functionality to a service provider and may be operated by the service provider or on behalf of the service provider.
  • the host computer may be enabled to observe, monitor, control, transmit to and/or receive from the network node 1420 and or the wireless device 1410.
  • One or more of the various embodiments in this disclosure improve the performance of OTT services provided to the WD 1410 using the OTT connection. More precisely, the teachings of some of these embodiments may improve the data rate, latency, and/or power consumption and thereby provide benefits such as reduced user waiting time, relaxed restriction on file size, better responsiveness, extended battery lifetime, etc.
  • FIG. 15 is a schematic block diagram of the wireless device 1410 according to some embodiments of the present disclosure.
  • the wireless device 1410 includes circuitry 1500 comprising one or more processors 1510, e.g., Central Processing Units (CPUs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs), and/or the like) and memory 1520.
  • the wireless device 1410 also includes one or more transceivers 1530 that each include one or more transmitters 1540 and one or more receivers 1550 coupled to one or more antennas 1560.
  • the wireless device 1410 may also comprise a network interface and more specifically an input interface 1570 and an output interface 1580 for communicating with other nodes.
  • the wireless device may also comprise a power source 1590.
  • the functionality of the wireless device 1410 described above may be fully or partially implemented in software that is, e.g., stored in the memory 1520 and executed by the processor(s) 1500.
  • the processor 1500 is configured to perform method 1200 of Figure 12.
  • a computer program including instructions which, when executed by the at least one processor 1510, causes the at least one processor 1510 to carry out the functionality of the wireless device 1410 according to any of the embodiments described herein is provided (e.g. method 1200 of Figure 12).
  • a carrier containing the aforementioned computer program product is provided.
  • the carrier is one of an electronic signal, an optical signal, a radio signal, or a computer readable storage medium (e.g., a non-transitory computer readable medium such as memory).
  • FIG 16 is a schematic block diagram of the wireless device 1410 according to some other embodiments of the present disclosure.
  • the wireless device 1410 includes one or more modules 1600, each of which is implemented in software.
  • the module(s) 1600 provide the functionality of the wireless device 1410 described herein. More specifically, the modules 1600 provide the functionalities of method 1200 of Figure 12.
  • FIG 17 is a schematic block diagram of a network node 1420 according to some embodiments of the present disclosure.
  • the network node 1420 includes a processing circuitry 1700 comprising one or more processors 1710 (e.g., CPUs, ASICs, FPGAs, and/or the like) and memory 1720.
  • the network node also comprises a network interface 1730.
  • the network node 1420 also includes one or more transceivers 1740 that each include one or more transmitters 1750 and one or more receivers 1760 coupled to one or more antennas 1770.
  • the functionality of the network node 1410 described above may be fully or partially implemented in software that is, e.g., stored in the memory 1720 and executed by the processor(s) 1710.
  • FIG. 18 is a schematic block diagram of the network node 1420 according to some other embodiments of the present disclosure.
  • the network node 1420 includes one or more modules 1800, each of which is implemented in software.
  • the module(s) 1800 provide the functionality of the network node 1420 described herein. More specifically, they provide the functionalities of method 1330 of Figure 13.
  • FIG 19 is a schematic block diagram that illustrates a virtualized embodiment of the wireless device 1410 or network node 1420, according to some embodiments of the present disclosure.
  • a“virtualized” node 1900 is a network node 1420 or wireless device 1410 in which at least a portion of the functionality of the network node 1420 or wireless device 1410 is implemented as a virtual component (e.g., via a virtual machine(s) executing on a physical processing node(s) in a network(s)).
  • a virtual appliance 1920 implementing the methods or parts of the methods of some embodiments.
  • the one or more instance(s) runs in a cloud computing environment 1900.
  • the cloud computing environment provides processing circuits 1930 and memory 1990-1 for the one or more instance(s) or virtual applications 1920.
  • the memory 1990-1 contains instructions 1995 executable by the processing circuit 1960 whereby the instance 1920 is operative to execute the methods or part of the methods described herein in relation to some embodiments.
  • the cloud computing environment 1900 comprises one or more general-purpose network devices including hardware 1930 comprising a set of one or more processor(s) or processing circuits 1960, which may be commercial off-the-shelf (COTS) processors, dedicated Application Specific Integrated Circuits (ASICs), or any other type of processing circuit including digital or analog hardware components or special purpose processors, and network interface controller(s) (NICs) 1970, also known as network interface cards, which include physical Network Interface 1980.
  • the general-purpose network device also includes non-transitory machine readable storage media 1990-2 having stored therein software and/or instructions 1995 executable by the processor 1960.
  • the processor(s)/processing circuits 1960 execute the software/instructions 1995 to instantiate a hypervisor 1950, sometimes referred to as a virtual machine monitor (VMM), and one or more virtual machines 1940 that are run by the hypervisor 1950.
  • a hypervisor 1950 sometimes referred to as a virtual machine monitor (VMM)
  • VMM virtual machine monitor
  • a virtual machine 1940 is a software implementation of a physical machine that runs programs as if they were executing on a physical, non-virtualized machine; and applications generally do not know they are running on a virtual machine as opposed to running on a“bare metal” host electronic device, though some systems provide para-virtualization which allows an operating system or application to be aware of the presence of virtualization for optimization purposes.
  • Each of the virtual machines 1940, and that part of the hardware 1930 that executes that virtual machine 1940 be it hardware 1930 dedicated to that virtual machine 1940 and/or time slices of hardware 1930 temporally shared by that virtual machine 1940 with others of the virtual machine(s) 1940, forms a separate virtual network element(s) (VNE).
  • VNE virtual network element
  • the hypervisor 1950 may present a virtual operating platform that appears like networking hardware to virtual machine 1940, and the virtual machine 1940 may be used to implement functionality such as control communication and configuration module(s) and forwarding table(s), this virtualization of the hardware is sometimes referred to as network function virtualization (NFV).
  • NFV network function virtualization
  • CPE customer premise equipment
  • Different embodiments of the instance or virtual application 1920 may be implemented on one or more of the virtual machine(s) 1940, and the implementations may be made differently.
  • Some embodiments may be represented as a non-transitory software product stored in a machine-readable medium (also referred to as a computer-readable medium, a processor-readable medium, or a computer usable medium having a computer readable program code embodied therein).
  • the machine-readable medium may contain various sets of instructions, code sequences, configuration information, or other data, which, when executed, cause a processor to perform steps in a method according to one or more of the described embodiments.
  • Those of ordinary skill in the art will appreciate that other instructions and operations necessary to implement the described embodiments may also be stored on the machine -readable medium.
  • Software running from the machine-readable medium may interface with circuitry to perform the described tasks.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

There is provided a method in a wireless device for receiving multiple signals. The method comprises: receiving a first Physical Downlink Shared Channel (PDSCH) transmission scheduled by a first Physical Downlink Control Channel (PDCCH) signal; in resources allocated for the first PDSCH transmission, receiving a second PDCCH signal, which schedules a second transmission, such that the second PDCCH signal and the first PDSCH transmission use overlapping resources; and determining a reception procedure of the first PDSCH transmission based on an indication that the second PDCCH signal punctures the first PDSCH transmission.

Description

METHODS AND NODES FOR DOWNLINK INTRA-UE PRE-EMPTION
RELATED APPLICATIONS
[0001] This application claims the benefits of priority of U.S. Provisional Patent Application No. 62/825601, entitled“Methods and Nodes for downlink intra-UE pre-emption” and filed at the United States Patent and Trademark Office on March 28, 2019, the content of which is incorporated herein by reference.
TECHNICAL FIELD
[0002] The present description generally relates to wireless communication systems and more specifically to receiving different signals that may use overlapping resources.
INTRODUCTION
[0003] Release 15 (Rel-15) in-order scheduling and Hybrid Automatic Repeat Request- Acknowledgement (HARQ-ACK) transmission
[0004] In New Radio (NR) Rel-15, Physical Downlink Shared Channel (PDSCH) scheduling and Downlink (DL) HARQ-ACK transmission must be in-order, as specified in Technical Specification (TS) 38.214, vl5.4.0, Section 5.1.
[0005] Rel-15 PDSCH resource mapping
[0006] In Technical Specification (TS) 38.214, vl5.4.0, Section 5.1.4, it states that
a PDSCH will not comprise data in resources used by the Physical Downlink Control Channel (PDCCH) that schedules the PDSCH.
[0007] PDCCH and PDSCH quasi-co-location
[0008] Quasi-co-location describe how Demodulation Reference Signal (DMRS) of PDCCH/PDSCH are related to one or two reference signals with respect to doppler shift, doppler spread, average delay, delay spread and spatial Receive (RX) parameters. A Transmission Configuration Indicator (TCI)-state comprise parameters that describe this relationship. The User Equipment (UE) may be configured with multiple TCI-states. For PDSCH, the TCI-state can even be dynamically indicated in the Downlink Control Information (DCI). For PDCCH, each Control Resource Set (CORESET) can be associated with a TCI-state using Media Access Control (MAC) Control Element (CE) signaling, see TS. 38.321, vl5.4.0, Section 6.1.3.15.
[0009] In 3GPP standardization group, agreements in enhanced Ultra Reliable Low Communications (eURLLC) study item give recommendation to support out-of-order operation for HARQ-ACKs and for Physical Uplink Shared Channel (PUSCH), which can help to overcome Rel-15 limitations described above. At the same time, this can enable more scenarios when several time-overlapped transport blocks of downlink (DL) data can be transmitted to the same User Equipment (UE) with different HARQ-ACK timings.
[0010] There are at least three different ways of how to transmit when two signals overlap:
[0011] 1. Puncture the first signal with the second signal. In this case the first signal will not be transmitted on the overlapping resources. On resources that are not overlapping, the first signal will be the same as if the second signal were not present.
[0012] 2. Rate match the first signal around the second signal. In this case the first signal will not be transmitted on the overlapping resources. On resources that are not overlapping, the first signal will be different compared to the case where the second signal is not present. When mapping the first signal to physical resources, overlapping resources are avoided by the first signal.
[0013] 3. Transmit both signals on overlapping resources. In some cases, the UE is able to receive both signals simultaneously, and there is no need for puncturing or rate matching.
SUMMARY
[0014] Currently there exists some challenges. In cases where several PDCCHs and PDSCHs can be scheduled at the same time and/or frequency, it may happen that both a PDCCH assigning a later PDSCH and the later PDSCH itself may overlap (in time and/or frequency) with the previous assigned PDSCH. This creates ambiguity between PDCCH and PDSCH reception by the UE. Therefore, new operations in the UE are required, for handling these cases, where resources used by later PDCCH(s) and PDSCHs overlap with a previous assigned PDSCH.
[0015] Some embodiments allow to overcome or mitigate the challenges as described above.
[0016] According to one aspect, some embodiments include a method performed by a wireless device.
[0017] According to another aspect, some embodiments include a wireless device configured, or operable, to perform one or more functionalities (e.g. actions, operations, steps, etc.) as described herein.
[0018] In some embodiments, the wireless device may comprise one or more communication interfaces configured to communicate with one or more other radio nodes and/or with one or more network nodes, and processing circuitry operatively connected to the communication interface, the processing circuitry being configured to perform one or more functionalities as described herein. In some embodiments, the processing circuitry may comprise at least one processor and at least one memory storing instructions which, upon being executed by the processor, configure the at least one processor to perform one or more functionalities as described herein. [0019] In some embodiments, the wireless device may comprise one or more functional modules configured to perform one or more functionalities as described herein.
[0020] According to another aspect, some embodiments include a non-transitory computer- readable medium storing a computer program product comprising instructions which, upon being executed by processing circuitry (e.g., at least one processor) of the wireless device, configure the processing circuitry to perform one or more functionalities as described herein.
[0021] According to yet another aspect, some embodiments include a method performed by a network node.
[0022] According to another aspect, some embodiments include a network node configured, or operable, to perform one or more functionalities (e.g. actions, operations, steps, etc.) as described herein.
[0023] In some embodiments, the network node may comprise one or more communication interfaces configured to communicate with one or more other radio nodes and/or with one or more network nodes, and processing circuitry operatively connected to the communication interface, the processing circuitry being configured to perform one or more functionalities as described herein. In some embodiments, the processing circuitry may comprise at least one processor and at least one memory storing instructions which, upon being executed by the processor, configure the at least one processor to perform one or more functionalities as described herein.
[0024] In some embodiments, the network node may comprise one or more functional modules configured to perform one or more functionalities as described herein.
[0025] According to another aspect, some embodiments include a non-transitory computer- readable medium storing a computer program product comprising instructions which, upon being executed by processing circuitry (e.g., at least one processor) of the network node, configure the processing circuitry to perform one or more functionalities as described herein.
[0026] The advantages/technical benefits of the embodiments of the present disclosure are as follows:
[0027] - the embodiments allow to handle resources used by a later PDSCH and a PDCCH that overlap with a previous assigned PDSCH.
[0028] This summary is not an extensive overview of all contemplated embodiments, and is not intended to identify key or critical aspects or features of any or all embodiments or to delineate the scope of any or all embodiments. In that sense, other aspects and features will become apparent to those ordinarily skilled in the art upon review of the following description of specific embodiments in conjunction with the accompanying figures. BRIEF DESCRIPTION OF THE DRAWINGS
[0029] Exemplary embodiments will be described in more detail with reference to the following figures, in which:
[0030] Figure 1 shows a schematic illustration of a PDCCH being punctured into a PDSCH.
[0031] Figure 2 shows a schematic illustration of time overlapping resources of PDCCH being punctured into a PDSCH.
[0032] Figure 3 shows a schematic illustration of later resources than PDCCH being punctured into a PDSCH.
[0033] Figure 4 shows a schematic illustration of a PDSCH2 being punctured into a PDSCH1.
[0034] Figure 5 shows a schematic illustration of time overlapping resources PDSCH2 being punctured into a PDSCH1.
[0035] Figure 6 shows a schematic illustration of PDSCH2 and all overlapping resources of PDSCH2 and later symbols being puncturing into PDSCH1.
[0036] Figure 7 illustrates an example of intra-UE pre-emption in downlink, according to some embodiments.
[0037] Figure 8 illustrates an example of intra-UE pre-emption in downlink in which the CORESET for each PDCCH is illustrated, according to some embodiments.
[0038] Figure 9 illustrates another example of intra-UE pre-emption in downlink in which the CORESET for each PDCCH is illustrated, according to some embodiments.
[0039] Figure 10 illustrates another example of intra-UE pre-emption in downlink in which the CORESET for each PDCCH is illustrated, according to some embodiments.
[0040] Figure 11 illustrates another example of intra-UE pre-emption in downlink in which the CORESET for each PDCCH is illustrated, according to some embodiments.
[0041] Figure 12 is a flow chart of a method in a wireless device, in accordance with some embodiments.
[0042] Figure 13 is a flow chart of a method in a network node, in accordance with some embodiments.
[0043] Figure 14 illustrates one example of a wireless communications system in which embodiments of the present disclosure may be implemented.
[0044] Figures 15 and 16 are block diagrams that illustrate a wireless device according to some embodiments of the present disclosure.
[0045] Figures 17 and 18 are block diagrams that illustrate a network node according to some embodiments of the present disclosure. [0046] Figure 19 illustrates a virtualized environment of a network node, according to some embodiments of the present disclosure.
DETAILED DESCRIPTION
[0047] The embodiments set forth below represent information to enable those skilled in the art to practice the embodiments. Upon reading the following description in light of the accompanying figures, those skilled in the art will understand the concepts of the description and will recognize applications of these concepts not particularly addressed herein. It should be understood that these concepts and applications fall within the scope of the description.
[0048] In the following description, numerous specific details are set forth. However, it is understood that embodiments may be practiced without these specific details. In other instances, well-known circuits, structures, and techniques have not been shown in detail in order not to obscure the understanding of the description. Those of ordinary skill in the art, with the included description, will be able to implement appropriate functionality without undue experimentation.
[0049] In current systems, it is not allowed to send several PDCCHs scheduling different PDSCHs using overlapping time and frequency resources to a same UE. However, it is envisioned that this will be possible very soon, especially for time overlapping resources. By so doing, there will be ambiguity in the UE for receiving overlapping PDSCH and PDCCH. Therefore, this disclosure provides solutions for resolving ambiguity between PDCCH and PDSCH physical channels reception when they are mapped on a time-frequency resource grid in case of out-of-order HARQ, intra-UE pre-emption in downlink and downlink transmissions followed by uplink transmissions.
[0050] The following cases will be described:
[0051] CASE 1. Receiving a PDSCH that overlaps with a PDCCH.
[0052] This case is concerned with a UE receiving a (first) PDSCH that overlaps with a PDCCH which schedules another (second) PDSCH, i.e. the PDCCH does not schedule the first PDSCH. The network node may signal an indication that the first PDSCH overlaps with the PDCCH. The UE can determine a reception procedure of the PDDCH based on the indication.
[0053] The PDCCH can be transmitted to the UE receiving the first PDSCH, or to a group of UEs including the UE receiving the first PDSCH. When determining which resources overlap, the resources, occupied by DMRS used for receiving the PDCCH in the resources occupied by the PDCCH, are included. For example, if the UE successfully decodes a PDCCH on resources that overlap in time and/or frequency with resources that are allocated for a PDSCH transmission to the UE, the UE assumes/determines the resources in time and frequency of the PDCCH that have punctured the PDSCH transmission. Figure 1 illustrates such a case. PDSCH 100 is punctured by resources overlapping in time and frequency with PDCCH 110.
[0054] In another example, if the UE successfully decodes a PDCCH on resources that overlap in time and frequency with resources that are allocated for the PDSCH transmission to the UE, the UE assumes/determines that the resources that overlap in time with the PDCCH are punctured from the PDSCH transmission. The resources that overlap in time comprise the resources used by PDCCH 110 and those that are not used by the PDCCH but overlap in time with PDCCH. Figure 2 illustrates such a case, in which the resources 120 and resources used by PDSCH 100 which overlap in time and frequency with PDCCH 110 are not available for PDSCH 100. As such, the PDSCH 100 is punctured by these resources.
[0055] In another example, if the UE successfully decodes a PDCCH on resources that overlap in time and frequency with resources that are allocated for the PDSCH transmission to the UE, the UE assumes/determines that the resources that overlap in time with the PDCCH 110, and all later resources are punctured from the PDSCH transmission. This exemplary case is illustrated in Figure 3, in which resources 120, resources used by the PDSCH 100 which overlap in time and frequency with PDCCH 110 and resources 130, which represent the later resources, are not available for PDSCH 100. As such, PDSCH 100 is punctured by these later resources and time overlapping resources. In another example, if the UE successfully decodes a PDCCH on resources that overlap in time and frequency with resources that are allocated for the PDSCH transmission to the UE, the UE determines/assumes that both PDCCH and PDSCH are present on the overlapping resources. In another example, where PDSCH is rate matched around potential PDCCH candidates, a set of resources that could be used for PDCCH are communicated to the UE. The UE assumes that any PDSCH that overlaps in time and frequency with these resources are rate matched around the set of resources.
[0056] CASE 2. Receiving a PDSCH that overlaps with another PDSCH.
[0057] In this case, the UE receives a first PDSCH (scheduled by a first/earlier PDCCH) and then receives a second PDSCH (scheduled by a second PDCCH) which uses resources that overlap with the first PDSCH. When determining which resources overlap, the resources, occupied by DMRS and used for receiving the second PDSCH in the resources occupied by the first PDSCH, are included.
[0058] In order to describe compactly the two PDSCHs that overlap in time and/or frequency, one PDSCH is defined as having a higher priority than the other. This does not necessarily mean that there is an explicit priority associated with each PDSCH, it is just a compact notation for describing the behavior in different cases. The network node may signal to the UE an indication of priority, based on which the UE can determine a reception procedure of the two PDSCHs.
[0059] In some examples, the UE assumes that the higher priority PDSCH is punctured into the lower priority PDSCH. For example, Figure 4 illustrates a higher priority PDSCH 210 punctured into a lower priority PDSCH 200 with an earlier starting point.
[0060] In some examples, the UE assumes that the resources that overlap in time with the higher priority PDSCH 210 are punctured from the lower priority PDSCH 200. This example is illustrated in Figure 5, wherein the resources 300 and the resources that overlap in time with PDSCH 210 are not available for the lower priority PDSCH 200. As such, these resources, that overlap in time with the higher priority PDSCHs 210, are punctured into the lower priority PDSCH 200
[0061] In some examples, the UE assumes that the resources that overlap in time with the higher priority PDSCH 210, and all later resources, are punctured from the lower priority PDSCH 200. This is illustrated in Figure 6. In this example, the higher priority PDSCH 210 punctures all overlapping and later symbols/resources from the lower priority PDSCH 200.
[0062] In some examples, the UE assumes that the lower priority PDSCH 200 is rate matched around the higher priority PDSCH 210.
[0063] In other examples, alternatively, the UE can assume that the higher priority PDSCH 210 is rate matched around the lower priority PDSCH 200.
[0064] Furthermore, the UE can assume that a lower priority DL Semi-Persistent Scheduling (SPS) PDSCH is rate matched around resources used by a higher priority DL SPS PDSCH transmission although no higher priority DL SPS PDSCH may be received.
[0065] The UE can also assume that a higher priority DL SPS PDSCH is rate matched around a DL SPS PDSCH transmission that is not intended for the data from a predefined Logical Channel (LCH).
[0066] Also, the UE can assume that the higher priority DL SPS PDSCH is rate matched around the DL SPS PDSCH transmission with dummy data.
[0067] Now, some examples of combining cases 1 and 2 will be described. But before describing the examples, the following definitions will be adopted.
[0068] A first PDSCH is considered to be scheduled later than a second PDSCH if both PDSCHs are scheduled by PDCCH, and the PDCCH scheduling the first PDSCH starts in an earlier Orthogonal Frequency Division Multiplexing (OFDM) symbol than the PDCCH scheduling the second PDSCH. [0069] A first PDSCH is considered to be scheduled later than a second PDSCH if both PDSCHs are scheduled by PDCCH, and the PDCCH scheduling the first PDSCH ends in an earlier OFDM symbol than the PDCCH scheduling the second PDSCH.
[0070] A first PDSCH scheduled later than a second PDSCH has higher priority than the second PDSCH.
[0071] A first PDSCH scheduled dynamically by PDCCH has higher priority than a second PDSCH scheduled by DL-SPS.
[0072] A first PDSCH scheduled by DL-SPS has higher priority than a second PDSCH scheduled dynamically by PDCCH.
[0073] A first PDSCH scheduled by DL-SPS has lower priority than a second PDSCH scheduled dynamically by PDCCH.
[0074] A PDSCH can be associated with an explicit priority. Such a priority can be signaled through DCI or indicated by Radio Resource Control (RRC) if the PDSCH is scheduled by DL SPS.
[0075] A PDSCH without an explicit priority has higher priority than a PDSCH with an explicit priority.
[0076] A first PDSCH with an explicit priority higher than the explicit priority of a second PDSCH has higher priority than the second PDSCH.
[0077] A first PDSCH has higher priority than a second PDSCH if the first PDSCH occupies fewer OFDM symbols than the second PDSCH.
[0078] A first PDSCH has higher priority than a second PDSCH if the first PDSCH is scheduled by DCI that has Cyclic Redundancy Check (CRC) scrambled with a certain Radio Network Temporary Identity (RNTI), and the second PDSCH is not scheduled by DCI that has CRC scrambled with the certain RNTI.
[0079] It should be noted that two colliding PDSCHs can be associated with two different HARQ process. In this case, it is possible that the two transport blocks (TBs) carried by the two PDSCHs are both received by the UE, if the UE is capable of simultaneously processing two DL TBs in a slot. If the UE is not capable of processing two DL TBs simultaneously, then the UE has to prioritize one TB and drop the other TB. Typically, the later scheduled TB is deemed higher priority and processed, whereas the earlier scheduled TB is dropped. It is also possible that the two colliding PDSCHs are associated with the same HARQ process. In this case, the UE can only process one TB regardless of the UE’s processing capability. [0080] In the following examples, the UE receives a first signal (earlier scheduled PDSCH) and a second signal (later scheduled PDCCH/PDSCH) which overlaps with resources of the first signal. For example, the network node can send an indication to the UE that the second signal punctures the first signal. The network node can also send another indication regarding the priority of the later scheduled PDCCH/PDSCH and the earlier scheduled PDSCH. As such, the UE will receive and decode those transmissions based on the indication of puncturing and/or priority.
[0081] Example A Later scheduled PDCCH/PDSCH punctures resources of earlier scheduled PDSCH
[0082] In this case, it is assumed that the later transmitted PDSCH has an associated PDCCH (i.e., dynamic scheduling) in the same slot. Therefore, the earlier transmitted PDSCH is affected by both the PDCCH and its associated later transmitted PDSCH. Alternatively, it could be assumed that one PDSCH or both of the PDSCH is/are not scheduled by an associated PDCCH, rather one PDSCH or both of the PDSCH is/are transmitted on semi-statically configured resources (i.e., DL SPS). For example, the later transmitted PDSCH can be associated with DL SPS, and the earlier transmitted PDSCH can be dynamically scheduled. The principles and methods described for the dynamically scheduled PDSCH 100 of Figures 1 to 3 apply to this case. As a note, PDCCH 110 may not exist for the DL SPS case.
[0083] Furthermore, it could be assumed that the two colliding PDSCHs are associated with two different HARQ processes. In this case, it is possible that the two transport blocks carried by the two PDSCHs are both received by the UE, if the UE is capable of simultaneously processing two DL TBs in a slot. If the UE is not capable of processing two DL TBs simultaneously, then the UE has to prioritize one TB and drop the other TB. Typically, the later scheduled TB is deemed higher priority and processed, whereas the earlier scheduled TB is dropped. It is also possible that the two colliding PDSCHs are associated with the same HARQ process. In this case, the UE can only process one TB regardless of the UE’s processing capability.
[0084] More specifically, when the later scheduled PDCCH/PDSCH punctures resources of the earlier scheduled PDSCH, the later PDCCH/PDSCH can puncture the resources elements (REs) of the earlier scheduled PDSCH. The punctured resources are considered to be not available for the PDSCH
[0085] In some examples, the punctured resources can mean REs used for the coded PDCCH/PDSCH payload and the PDCCH/PDSCH DMRS.
[0086] Furthermore, when resources are considered to be not available for a PDSCH, it can mean either one of: [0087] - The PDSCH is rate-matched around the unavailable resources, or
[0088] - The resources are punctured from the PDSCH, or
[0089] - The PDSCH is decoded assuming the resources are present, but the soft-buffer values associated with the unavailable resources are flushed after decoding. Flushing can either be flushing only the soft-values related to the current PDSCH or flushing the aggregate soft-values related to the current and previous PDSCH transmissions (in case the current PDSCH is a re transmission).
[0090] Figure 7 illustrates an example in which, when the UE receives a first PDSCH1, the UE detects a PDCCH2 transmission, which schedules another (second) PDSCH transmission (i.e., PDSCH2). If the UE is signaled to have the later scheduled PDCCH/PDSCH (PDCCH2/PDSCH2) puncture REs of the earlier scheduled PDSCH (PDSCH1), when the UE receives PDSCH1, the UE determines that resources occupied by PDCCH2 are not available for PDSCH1. Alternatively, the resources corresponding to a union of the detected PDCCH2 that scheduled the PDSCH2 and associated PDCCH2 DMRS are not available for the PDSCH1. By“not available”, it can mean “rate matched around” or“punctured”.
[0091] In one example, when the parameter precoderGranularity is configured in a CORESET, where the PDCCH2 was detected, is equal to allContiguousRBs, the associated PDCCH DMRS are DMRS in all Resource Element Groups (REGs) of the CORESET associated with PDCCH2. In this case, the CORESET precoder granularity is equal to the number of contiguous Resource Blocks (RBs) in the frequency domain within the CORESET. PDCCH2 DMRS is mapped over all REGs within the associated CORESET to improve channel estimation performance.
[0092] Otherwise, the associated DMRS are the DMRS in REGs of the PDCCH2. In this case, the CORESET precoder granularity is equal to the REG bundle size in the frequency domain. PDCCH DMRS is located in the REGs occupied by PDCCH2, not the entire CORESET.
[0093] Figure 8 illustrates the same scenario as Figure 7, but Figure 8 further shows the CORESET for each PDCCH. PDCCH 1 and PDCCH2 are used in scheduling DL data transmissions: PDSCH1 and PDSCH2, respectively. The PDCCH candidate in the middle of the figure is monitored by the UE but not detected.
[0094] In one example, the UE assumes, for a first PDSCH, that resources used for PDSCHs that start later than the first PDSCH are not available for the first PDSCH. Using Figures 7 and 8 as an example, when receiving PDSCH1, afterthe UE detects PDCCH2 which schedules PDSCH2, the UE assumes that the resources occupied by PDSCH2 and its associated DMRS are not available for PDSCH1. [0095] In one example, the UE assumes, for a PDSCH, that resources which can potentially be used for PDCCH, but if the signaling message for the PDCCH is not detected, are available for the PDSCH. Using Figures 7 and 8 as an example, the UE performs PDCCH candidate monitoring in the search space of the middle PDCCH, but it does not find any valid PDCCH. Hence, resources that can be potentially used by the middle PDCCH and its associated CORESET are available for PDSCH1.
[0096] In another example, the UE can determine, for a first PDSCH, which resources used by later PDCCHs/PDSCHs (which start later than the first PDSCH) that are not available based on the TCI-state for the first PDSCH and TCI-states for the later PDCCHs/PDSCHs. In one aspect, only the resources used for the later PDCCHs/PDSCHs that have the same TCI-state as the first PDSCH will not be available. In other aspects, the UE is configured with“previous-PDSCH- resources-available” parameters for TCI-states of the later PDCCHs/PDSCHs. The parameters may be associated with the CORESET or search space configured for the UE. In this case, the UE is configured with two CORESETs associated with two different TCI-states, with one of the CORESETs or TCI-states having “previous-PDSCH-resources-available” enabled, while the other CORESET or TCI-state having“previous-PDSCH-resources-available” disabled. If a later PDCCH is received on the CORESET for which an enabled “previous-PDSCH-resources- available” parameter is associated, the UE assumes that the resources used by the later PDCCH/PDSCH are available for the first PDSCH. However, if the later PDCCH is received on a CORESET for which a disabled “previous-PDSCH-resources-available” parameter is associated, the UE assumes that the resources used by the later PDCCH/PDSCH are non-available for the first PDSCH.
[0097] In another example, the UE can determine, for a first PDSCH, which resources used by later PDCCHs/PDSCHs (which start later than the first PDSCH) that are not available based on an explicit field in the DCI carried by a later PDCCH scheduling a later PDSCH or a PUSCH transmission. For example, the DCI may comprise a field indicating if the resources used by the later PDCCH/PDSCH are available or not for the first PDSCH. The indication may be separate for the later PDCCH and later PDSCH, thus, enabling a first indication that resources used by the later PDCCH are available and a second indication that resources used by the later PDSCH are not available for the previous PDSCH (or vice-versa). Alternatively, the indication can indicate a priority, transmission-profile, or logical-channel-set of PDSCH which indicates to a UE which resources for a previous/later PDSCH are available with regards to a later/previous PDSCH. In this case, the previous PDSCH can be indicated as a higher priority than the later PDSCH. As such, the later PDSCH is rate-matched around the previous PDSCH. The availability may also be implicitly indicated by the DCI type, CORESET or search space. For example, the CORESET and/or search space may be associated/configured with a“previous-PDSCH-resources-available” parameter.
[0098] In another example, the UE can send a HARQ-ACK for a PDSCH which does not have available resources to be used by a later PDCCH/PDSCH. The HARQ-ACK can be determined such that the unavailable resources are counted as available for the purpose of determining HARQ- ACK timing. In this example, the timeline in the UE is such that the HARQ-ACK cannot be produced taking the non-available/unavailable resources into account. However, the non availability is taken into soft-buffer handling, in which the soft-buffer values relating to the non- available resources are flushed/cleared, which means that, if the PDSCH is a re-transmission, the soft-values from the previous transmissions for the same TB and the same HARQ process that relates to the non-available resources will also be flushed. Optionally, the UE can only flush the soft-values relating to the PDSCH and relating to non-available resources.
[0099] In another example, when the UE detects a later PDCCH/PDSCH within the allocated PDSCH resource, the UE assumes that previous possible PDCCH(s) resources, within the allocated PDSCH where a control signal has not been detected, are available to the allocated PDSCH.
[0100] In some examples, some of the later PDCCHs or PDSCHs may partially overlap in time or frequency with the initially allocated PDSCH, as illustrated in Figure 8. For example, PDCCH2 and PDSCH2 overlap with PDSCH1, in time and frequency.
[0101] Allowing a UE to receive another (second) PDSCH starting earlier than the end of the first PDSCH where its scheduling PDCCH starts at a symbol later than the ending symbol of the first scheduling PDCCH as illustrated in Figures 7 and 8 can potentially increase UE complexity, i.e., the UE may need to perform simultaneous PDCCH blind decoding and PDSCH decoding. The following examples aim to reduce this potential complexity.
[0102] In one example, one or more specific search spaces are defined for the UE to be used for PDCCH monitoring occasions, which are overlapped with the previously scheduled PDSCH. The specific search spaces for such monitoring occasions can be RRC configured.
[0103] The specific search spaces defined for the PDCCH monitoring occasions, which overlap with the scheduled PDSCH, may contain a smaller number of DCI formats for a UE to monitor or a smaller number of PDCCH candidates per Control Channel Element (CCE) aggregation level, or a smaller set of aggregation levels than the normally configured search spaces. [0104] A parameter celled dci-Formats overlapped mo can be added to the search space information element. If dci-Formats overlapped mo is configured for the search space, the DCI formats defined in dci-Formats overlapped mo are monitored when a PDCCH monitoring occasion is overlapped with the scheduled PDSCH instead of those in dci-Formats .
[0105] Furthermore, specific rules can be applied to the configured search space for the PDCCH monitoring occasions which are overlapped with the scheduled PDSCH. For example, only a subset of the DCI formats out of all configured formats in the configured search space are monitored by the UE in the PDCCH monitoring occasions overlapped with the scheduled PDSCH. Or, only a smaller number of PDCCH candidates per CCE aggregation level configured in the configured search space are monitored by the UE in the PDCCH monitoring occasions overlapped with the scheduled PDSCH. These specific rules can be fixed in the standard specification or separately configured.
[0106] Whether the solutions to reduce PDCCH blind decoding attempts at the UE, when a PDCCH monitoring occasion is overlapped with the scheduled PDSCH in the above examples are applied, depends on the traffic type and/or PDCCH monitoring capability of the UE. For example, if the UE supports latency critical traffic such as Ultra Reliable Low Latency Communication (URLLC) and has a total number of PDCCH blind decodes per slot which is lower than a certain threshold, the solutions can be applied.
[0107] Overlapping of a PDCCH monitoring occasion with a scheduled PDSCH in the above examples may include overlapping in time but not in frequency or both in time and frequency.
[0108] In another example, the UE rate matches around some or all of the PDCCH candidates it monitors that overlap with the PDSCH transmission, even if no PDCCH is successfully received on these candidates.
[0109] More specifically, when the later scheduled PDCCH/PDSCH punctures resources of the earlier scheduled PDSCH, the later PDCCH/PDSCH can puncture the symbols of the earlier scheduled PDSCH.
[0110] In one example, when the UE detects a later PDCCH/PDSCH within the allocated PDSCH resources, the UE can assume that the allocated PDSCH (first signal or PDSCH1 of Figure 9) is cancelled. This is particularly useful for a UE which is capable of processing one TB in a slot, not two TBs in a slot simultaneously.
[0111] However, if the UE is capable of processing two TBs in a slot simultaneously, the first scheduled PDSCH1 does not have to be cancelled entirely. [0112] In another example, the PDSCH1 symbols are skipped starting with the first symbol where PDCCH2/PDSCH2 resources collide with the PDSCH1 resource, as shown in Figure 9. More specifically, Figure 9 illustrates an example of intra-UE pre-emption in downlink. The CORESET for each PDCCH is illustrated. PDCCH1 and PDCCH2 are actually used in scheduling DL data transmissions: PDSCH1 and PDSCH2, respectively. The symbols 900 are not available for PDSCH1.
[0113] In another example, only PDSCH1 symbols where PDSCH1 resources collide with PDCCH2/PDSCH2 resources are skipped (the later resources are not included), as shown in Figure 10. More specifically, in Figure 10, an example of intra-UE pre-emption in downlink is illustrated. The CORESET for each PDCCH is illustrated. PDCCH1 and PDCCH2 are actually used in scheduling DL data transmissions: PDSCH1 and PDSCH2, respectively. The symbols 1000 are not available (or skipped) for PDSCH1, but the symbols 1010 are available for PDSCH1.
[0114] Example B. Later scheduled PDCCH for UL scheduling punctures resources of earlier scheduled PDSCH
[0115] In one example, some of the later PDCCHs may be a PDCCH carrying UL grants (for which there is no later PDSCH). This is illustrated by Figure 11, for example.
In this case, the same principles and methods described above for dynamically scheduled later PDSCH (i.e., PDCCH2/PDSCH2 pair) still apply. The only change is that PDSCH2 is absent. More specifically, in Figure 11, an example of intra-UE pre-emption in downlink is illustrated. The CORESET for each PDCCH is illustrated. PDCCH1 is transmitted for scheduling PDSCH1. PDCCH2 is transmitted for scheduling PUSCH. The middle PDCCH candidate is monitored by the UE but not detected.
[0116] CASE 3. Receiving a PDSCH that overlaps with reference signals other than DMRS.
[0117] The reference signals can be, for example, phase tracking reference signals (PT-RS) or channel state information reference signals (CSI-RS). They can be also reference signal measurement resources without a present reference signal, such as for example zero-power channel state information reference signals (ZP CSI-RS).
[0118] For example, the PDSCH can be rate matched around the resources that overlap with the reference signals.
[0119] In another example, the PDSCH can be punctured into the resources that overlap with the reference signals. In this case, the UE can assume that the reference signals are not present in these resources. [0120] In another example, the PDSCH can be considered to have high priority if there is an explicit priority associated with the PDSCH. Such a priority can be signaled, by a network node, through DCI or indicated by RRC (if the PDSCH is scheduled by DL SPS).
[0121] In some examples, the PDSCH can be considered to have high priority if there is an explicit priority associated with the PDSCH that is higher than a predefined value. Such a priority can be signaled through DCI or indicated by RRC if the PDSCH is scheduled by DL SPS.
[0122] In some examples, the PDSCH can be considered to have high priority if the transmission occupies fewer OFDM symbols than a predefined value.
[0123] In some examples, the PDSCH can be considered to have high priority if it is scheduled by DL-SPS.
[0124] In some examples, the PDSCH can be considered to have high priority if the PDSCH is scheduled by DCI that has CRC scrambled with a certain RNTI.
[0125] In some examples, the PDSCH can be either punctured into, or rate matched around the resources that overlap with the reference signals, depending on whether the PDSCH has high priority or not. If the PDSCH is punctured into the resources, the UE can assume that the reference signals are not present in these resources.
[0126] In some examples, the PDSCH can be considered to have high priority compared to the reference signals scheduled through DCI without an explicit priority. If the PDSCH is associated with an explicit priority, the PDSCH is considered to have high priority compared to the reference signals scheduled through DCI with an explicit priority, if the explicit priority associated with the PDSCH is higher than the explicit priority in the DCI scheduling the reference signals.
[0127] CASE 4. Receiving a PDSCH that overlaps with SSB.
[0128] For example, the PDSCH can be rate matched around the resources that overlap with SSB. In this case, the UE can assume that the SSB is not present in these resources.
[0129] In another example, the PDSCH can be punctured into the resources that overlap with SSB.
[0130] As a note, the same rules as those described above for determining whether a PDSCH has high priority, can be used in the examples in CASE 4.
[0131] In another example, the PDSCH is either punctured into, or rate matched around the resources that overlap with SSB, depending on whether the PDSCH has high priority or not. If the PDSCH is punctured into the resources, the UE can assume that the SSB is not present in these resources. [0132] Turning to Figure 12, a flow chart illustrating a method 1200 in a wireless device, for receiving multiple signals, will be described. The method can be implemented in a UE, or wireless device such as 1410 of Figures 14, 15 and 16. Method 1200 comprises:
[0133] Step 1210: receiving a first PDSCH transmission scheduled by a first PDCCH signal.
[0134] Step 1220: in resources allocated for the first PDSCH transmission, receiving a second PDCCH signal, which schedules a second transmission, such that the second PDCCH signal and the first PDSCH transmission use overlapping resources. As a note, the second PDCCH signal did not schedule the first PDSCH transmission.
[0135] Step 1230: determining a reception procedure of the first PDSCH transmission based on an indication that the second PDCCH signal punctures the first PDSCH transmission. As a note, this reception procedure is a new reception procedure, different from the reception in step 1210, since the presence of the second PDCCH in the first PDSCH transmission changes the reception of the first PDSCH transmission.
[0136] In one example, the second transmission can be a PUSCH transmission or a second PDSCH transmission (which is different from the first PDSCH transmission).
[0137] In one example, the indication that the second PDCCH signal punctures the first PDSCH transmission can be given by the reception of the second PDCCH signal. As such, the indication is implicit.
[0138] In one example, the indication that the second PDCCH signal punctures the first PDSCH transmission can be given by a Downlink Control Information (DCI) in the second PDCCH signal or by a configuration from a Radio Resource Control (RRC).
[0139] In one example, determining the reception procedure of the first PDSCH transmission based on the indication may comprise decoding successfully the second PDCCH signal on resources that overlap in time and frequency with resources that are allocated for the first PDSCH transmission and determining resources punctured by the second PDCCH signal into the first PDSCH transmission. In one example, determining the punctured resources may comprise determining resources of the first PDSCH transmission that overlap in time with the second PDCCH signal. In another example, determining the punctured resources may comprise determining resources of the first PDSCH transmission that overlap in time with the second PDCCH signal and later resources.
[0140] As a note, the overlapping resources are time-and-frequency resources, while a determined puncturing resource could be one of time-frequency resources (REs) or time (symbol) resources (all REs of one or more symbols). [0141] In one example, the wireless device/UE can send a HARQ- ACK for the first PDSCH transmission which has non-available resource used by the second PDCCH signal or second PDSCH transmission, wherein the HARQ-ACK is determined such that the non-available resource are counted as available for the purpose of determining HARQ ACK timing.
[0142] In one example, the UE may flush soft buffer values related to the non-available resources from a soft buffer.
[0143] In one example, the determination of the reception procedure of the first PDSCH transmission may be further based on a Transmission Configuration Indicator (TCI) state. For example, the resources used by the second PDCCH signal that have a same TCI state as the first PDSCH may not be available for the first PDSCH transmission.
[0144] In one example, if the second PDCCH signal is received on a CORESET associated with a TCI state that has a parameter“previous-PDSCH-resources-available” enabled, resources used by the second PDCCH signals may be available for the first PDSCH transmission.
[0145] In one example, if the second PDCCH signal is received on a CORESET associated with a TCI state that has a parameter“previous-PDSCH-resources-available” disabled, resources used by the second PDCCH signal may be non-available for the first PDSCH transmission.
[0146] In one example, the determination of the reception procedure may be further based on an indication of priority between the first PDSCH transmission and the second PDCCH signal.
[0147] In one example, the overlapping resources may comprise partially overlapping resources.
[0148] In some examples, the UE may further send a UE capability to the network node and determine the reception procedure may be further based on the UE capability.
[0149] Now turning to Figure 13, a flow chart illustrates a method 1300 in a network node, according to an embodiment. The method can be implemented in any network node, e.g. network node. The network node may be the network node 1420 of Figures 14, 17 and 18. Method 1300 comprises:
[0150] Step 1310: sending a first PDSCH transmission scheduled by a first PDCCH signal.
[0151] Step 1320: during the transmission of the first PDSCH, sending a second PDCCH signal scheduling a second transmission, such that the first PDSCH transmission and the second PDCCH signal use overlapping resources.
[0152] Step 1330: sending an indication that the second PDCCH signal punctures the first PDSCH transmission.
[0153] For example, the network node may send a Downlink Control Information (DCI) including the indication or a Radio Resource Control (RRC) configuration including the indication. [0154] In one example, the second transmission may be a PUSCH transmission or a second PDSCH transmission which is different from the first PDSCH transmission.
[0155] In one example, the overlapping resources may comprise partially overlapping resources.
[0156] In one example, the overlapping resources may be resource elements or symbols.
[0157] Figure 14 illustrates an example of a wireless network 1400 that may be used for wireless communications. Wireless network 1400 includes UEs 1410 and a plurality of radio network nodes 1420 (e.g., Node Bs (NBs) Radio Network Controllers (RNCs), evolved NBs (eNBs), next generation NB (gNBs), etc.) directly or indirectly connected to a core network 1430 which may comprise various core network nodes. The network 1400 may use any suitable radio access network (RAN) deployment scenarios, including Universal Mobile Telecommunication System (UMTS) Terrestrial Radio Access Network (UTRAN), and Evolved UMTS Terrestrial Radio Access Network (EUTRAN). UEs 1410 may be capable of communicating directly with radio network nodes 1420 over a wireless interface. In certain embodiments, UEs may also be capable of communicating with each other via device-to-device (D2D) communication. In certain embodiments, network nodes 1420 may also be capable of communicating with each other, e.g. via an interface (e.g. X2 in LTE or other suitable interface).
[0158] As an example, UE 1410 may communicate with radio network node 1420 over a wireless interface. That is, UE 1410 may transmit wireless signals to and/or receive wireless signals from radio network node 1420. The wireless signals may contain voice traffic, data traffic, control signals, and/or any other suitable information. In some embodiments, an area of wireless signal coverage associated with a radio network node 1420 may be referred to as a cell.
[0159] It should be noted that a UE may be a wireless device, a radio communication device, target device, device to device (D2D) UE, machine type UE or UE capable of machine to machine communication (M2M), a sensor equipped with UE, iPAD, Tablet, mobile terminals, smart phone, laptop embedded equipped (LEE), laptop mounted equipment (LME), Universal Serial Bus (USB) dongles, Customer Premises Equipment (CPE) etc. Example embodiments of a wireless device 1410 are described in more detail below with respect to Figures 15 and 16.
[0160] In some embodiments, the“network node” can be any kind of network node which may comprise of a radio network node such as a radio access node (which can include a base station, radio base station, base transceiver station, base station controller, network controller, gNB, NR BS, evolved Node B (eNB), Node B, Multi-cell/multicast Coordination Entity (MCE), relay node, access point, radio access point, Remote Radio Unit (RRU), Remote Radio Head (RRH), a multi standard BS (also known as MSR BS), etc.), a core network node (e.g., MME, SON node, a coordinating node, positioning node, MDT node, etc.), or even an external node (e.g., 3rd party node, a node external to the current network), etc. The network node may also comprise a test equipment.
[0161] In certain embodiments, network nodes 1420 may interface with a radio network controller (not shown). The radio network controller may control network nodes 1420 and may provide certain radio resource management functions, mobility management functions, and/or other suitable functions. In certain embodiments, the functions of the radio network controller may be included in the network node 1420. The radio network controller may interface with the core network node 1440. In certain embodiments, the radio network controller may interface with the core network node 1440 via the interconnecting network 1430.
[0162] The interconnecting network 1430 may refer to any interconnecting system capable of transmitting audio, video, signals, data, messages, or any combination of the preceding. The interconnecting network 1430 may include all or a portion of a public switched telephone network (PSTN), a public or private data network, a local area network (LAN), a metropolitan area network (MAN), a wide area network (WAN), a local, regional, or global communication or computer network such as the Internet, a wireline or wireless network, an enterprise intranet, or any other suitable communication link, including combinations thereof.
[0163] In some embodiments, the core network node 1440 may manage the establishment of communication sessions and various other functionalities for wireless devices 1410. Examples of core network node 1440 may include MSC, MME, SGW, PGW, O&M, OSS, SON, positioning node (e.g. E-SMLC), MDT node, etc. Wireless devices 110 may exchange certain signals with the core network node 1440 using the non-access stratum layer. In non-access stratum signaling, signals between wireless devices 1410 and the core network node 1440 may be transparently passed through the radio access network. In certain embodiments, network nodes 1420 may interface with one or more other network nodes over an intemode interface. For example, network nodes 1420 may interface each other over an X2 interface.
[0164] Although Figure 14 illustrates a particular arrangement of network 1400, the present disclosure contemplates that the various embodiments described herein may be applied to a variety of networks having any suitable configuration. For example, network 1400 may include any additional elements suitable to support communication between wireless devices or between a wireless device and another communication device (such as a landline telephone). The embodiments may be implemented in any appropriate type of telecommunication system supporting any suitable communication standards and using any suitable components and are applicable to any radio access technology (RAT) or multi-RAT systems in which the wireless device receives and/or transmits signals (e.g., data).
[0165] The communication system 1400 may itself be connected to a host computer (not shown), which may be embodied in the hardware and/or software of a standalone server, a cloud- implemented server, a distributed server or as processing resources in a server farm. The host computer may be under the ownership or control of a service provider or may be operated by the service provider or on behalf of the service provider. The connections between the communication system 1400 and the host computer may extend directly from the core network 1440 to the host computer or may extend via the intermediate network 1430.
[0166] The communication system of Figure 14 as a whole enables connectivity between one of the connected wireless devices (WDs) 1410 and the host computer. The connectivity may be described as an over-the-top (OTT) connection. The host computer and the connected WDs 1410 are configured to communicate data and/or signaling via the OTT connection, using an access network, the core network 1440, any intermediate network 1430 and possible further infrastructure (not shown) as intermediaries. The OTT connection may be transparent in the sense that at least some of the participating communication devices through which the OTT connection passes are unaware of routing of uplink and downlink communications.
[0167] The host computer may provide host applications which may be operable to provide a service to a remote user, such as a WD 1410 connecting via an OTT connection terminating at the WD 1410 and the host computer. In providing the service to the remote user, the host application may provide user data which is transmitted using the OTT connection. The“user data” may be data and information described herein as implementing the described functionality. In one embodiment, the host computer may be configured for providing control and functionality to a service provider and may be operated by the service provider or on behalf of the service provider. The host computer may be enabled to observe, monitor, control, transmit to and/or receive from the network node 1420 and or the wireless device 1410.
[0168] One or more of the various embodiments in this disclosure improve the performance of OTT services provided to the WD 1410 using the OTT connection. More precisely, the teachings of some of these embodiments may improve the data rate, latency, and/or power consumption and thereby provide benefits such as reduced user waiting time, relaxed restriction on file size, better responsiveness, extended battery lifetime, etc.
[0169] Figure 15 is a schematic block diagram of the wireless device 1410 according to some embodiments of the present disclosure. As illustrated, the wireless device 1410 includes circuitry 1500 comprising one or more processors 1510, e.g., Central Processing Units (CPUs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs), and/or the like) and memory 1520. The wireless device 1410 also includes one or more transceivers 1530 that each include one or more transmitters 1540 and one or more receivers 1550 coupled to one or more antennas 1560. The wireless device 1410 may also comprise a network interface and more specifically an input interface 1570 and an output interface 1580 for communicating with other nodes. The wireless device may also comprise a power source 1590.
[0170] In some embodiments, the functionality of the wireless device 1410 described above may be fully or partially implemented in software that is, e.g., stored in the memory 1520 and executed by the processor(s) 1500. For example, the processor 1500 is configured to perform method 1200 of Figure 12.
[0171] In some embodiments, a computer program including instructions which, when executed by the at least one processor 1510, causes the at least one processor 1510 to carry out the functionality of the wireless device 1410 according to any of the embodiments described herein is provided (e.g. method 1200 of Figure 12). In some embodiments, a carrier containing the aforementioned computer program product is provided. The carrier is one of an electronic signal, an optical signal, a radio signal, or a computer readable storage medium (e.g., a non-transitory computer readable medium such as memory).
[0172] Figure 16 is a schematic block diagram of the wireless device 1410 according to some other embodiments of the present disclosure. The wireless device 1410 includes one or more modules 1600, each of which is implemented in software. The module(s) 1600 provide the functionality of the wireless device 1410 described herein. More specifically, the modules 1600 provide the functionalities of method 1200 of Figure 12.
[0173] Figure 17 is a schematic block diagram of a network node 1420 according to some embodiments of the present disclosure. As illustrated, the network node 1420 includes a processing circuitry 1700 comprising one or more processors 1710 (e.g., CPUs, ASICs, FPGAs, and/or the like) and memory 1720. The network node also comprises a network interface 1730. The network node 1420 also includes one or more transceivers 1740 that each include one or more transmitters 1750 and one or more receivers 1760 coupled to one or more antennas 1770. In some embodiments, the functionality of the network node 1410 described above may be fully or partially implemented in software that is, e.g., stored in the memory 1720 and executed by the processor(s) 1710. For example, the processor 1710 can be configured to perform the method 1300 of Figure 13. [0174] Figure 18 is a schematic block diagram of the network node 1420 according to some other embodiments of the present disclosure. The network node 1420 includes one or more modules 1800, each of which is implemented in software. The module(s) 1800 provide the functionality of the network node 1420 described herein. More specifically, they provide the functionalities of method 1330 of Figure 13.
[0175] Figure 19 is a schematic block diagram that illustrates a virtualized embodiment of the wireless device 1410 or network node 1420, according to some embodiments of the present disclosure. As used herein, a“virtualized” node 1900 is a network node 1420 or wireless device 1410 in which at least a portion of the functionality of the network node 1420 or wireless device 1410 is implemented as a virtual component (e.g., via a virtual machine(s) executing on a physical processing node(s) in a network(s)). For example, in Figure 19, there is provided an instance or a virtual appliance 1920 implementing the methods or parts of the methods of some embodiments. The one or more instance(s) runs in a cloud computing environment 1900. The cloud computing environment provides processing circuits 1930 and memory 1990-1 for the one or more instance(s) or virtual applications 1920. The memory 1990-1 contains instructions 1995 executable by the processing circuit 1960 whereby the instance 1920 is operative to execute the methods or part of the methods described herein in relation to some embodiments.
[0176] The cloud computing environment 1900 comprises one or more general-purpose network devices including hardware 1930 comprising a set of one or more processor(s) or processing circuits 1960, which may be commercial off-the-shelf (COTS) processors, dedicated Application Specific Integrated Circuits (ASICs), or any other type of processing circuit including digital or analog hardware components or special purpose processors, and network interface controller(s) (NICs) 1970, also known as network interface cards, which include physical Network Interface 1980. The general-purpose network device also includes non-transitory machine readable storage media 1990-2 having stored therein software and/or instructions 1995 executable by the processor 1960. During operation, the processor(s)/processing circuits 1960 execute the software/instructions 1995 to instantiate a hypervisor 1950, sometimes referred to as a virtual machine monitor (VMM), and one or more virtual machines 1940 that are run by the hypervisor 1950.
[0177] A virtual machine 1940 is a software implementation of a physical machine that runs programs as if they were executing on a physical, non-virtualized machine; and applications generally do not know they are running on a virtual machine as opposed to running on a“bare metal” host electronic device, though some systems provide para-virtualization which allows an operating system or application to be aware of the presence of virtualization for optimization purposes. Each of the virtual machines 1940, and that part of the hardware 1930 that executes that virtual machine 1940, be it hardware 1930 dedicated to that virtual machine 1940 and/or time slices of hardware 1930 temporally shared by that virtual machine 1940 with others of the virtual machine(s) 1940, forms a separate virtual network element(s) (VNE).
[0178] The hypervisor 1950 may present a virtual operating platform that appears like networking hardware to virtual machine 1940, and the virtual machine 1940 may be used to implement functionality such as control communication and configuration module(s) and forwarding table(s), this virtualization of the hardware is sometimes referred to as network function virtualization (NFV). Thus, NFV may be used to consolidate many network equipment types onto industry standard highvolume server hardware, physical switches, and physical storage, which can be located in Data centers, and customer premise equipment (CPE). Different embodiments of the instance or virtual application 1920 may be implemented on one or more of the virtual machine(s) 1940, and the implementations may be made differently.
[0179] Some embodiments may be represented as a non-transitory software product stored in a machine-readable medium (also referred to as a computer-readable medium, a processor-readable medium, or a computer usable medium having a computer readable program code embodied therein).. The machine-readable medium may contain various sets of instructions, code sequences, configuration information, or other data, which, when executed, cause a processor to perform steps in a method according to one or more of the described embodiments. Those of ordinary skill in the art will appreciate that other instructions and operations necessary to implement the described embodiments may also be stored on the machine -readable medium. Software running from the machine-readable medium may interface with circuitry to perform the described tasks.
[0180] The above-described embodiments are intended to be examples only. Alterations, modifications and variations may be effected to the particular embodiments by those of skill in the art without departing from the scope of the description, which is defined solely by the appended claims.

Claims

Claims: What is claimed is:
1. A method in a User Equipment (UE) for receiving multiple signals, the method comprising: receiving a first Physical Downlink Shared Channel (PDSCH) transmission scheduled by a first Physical Downlink Control Channel (PDCCH) signal;
in resources allocated for the first PDSCH transmission, receiving a second PDCCH signal, which schedules a second transmission, such that the second PDCCH signal and the first PDSCH transmission use overlapping resources; and
determining a reception procedure of the first PDSCH transmission based on an indication that the second PDCCH signal punctures the first PDSCH transmission.
2. The method of claim 1, wherein the second transmission is one of a Physical Uplink Shared Channel (PUSCH) transmission and a second PDSCH transmission which is different from the first PDSCH transmission.
3. The method of claim 1 or 2, wherein the indication that the second PDCCH signal punctures the first PDSCH transmission is given by the reception of the second PDCCH signal.
4. The method of claim 1 or 2, wherein the indication that the second PDCCH signal punctures the first PDSCH transmission is given by a Downlink Control Information (DCI) in the second PDCCH signal.
5. The method of claim 1 or 2, wherein the indication that the second PDCCH signal punctures the first PDSCH transmission is given by a configuration from a Radio Resource Control (RRC).
6. The method of any one of claims 1 to 5, wherein determining the reception procedure of the first PDSCH transmission based on the indication comprises decoding successfully the second PDCCH signal on resources that overlap in time and frequency with resources that are allocated for the first PDSCH transmission and determining resources punctured by the second PDCCH signal into the first PDSCH transmission.
7. The method of claim 6, wherein determining the punctured resources comprises determining resources of the first PDSCH transmission that overlap in time with the second PDCCH signal.
8. The method of claim 6, wherein determining the punctured resources comprises determining resources of the first PDSCH transmission that overlap in time with the second PDCCH signal and later resources.
9. The method of any one of claims 1 to 8, further comprising sending a Hybrid Automatic Repeat Request (HARQ)-Acknowledgement (ACK) for the first PDSCH transmission which has non-available resource used by the second PDCCH signal or second PDSCH transmission, wherein the HARQ-ACK is determined such that the non-available resource are counted as available for the purpose of determining HARQ ACK timing.
10. The method of claim 9, further comprising flushing soft buffer values related to the non- available resources from a soft buffer.
11. The method of any one of claims 1 to 8, wherein determining the reception procedure of the first PDSCH transmission based on the indication is further based on a Transmission Configuration Indicator (TCI) state.
12. The method of claim 11, wherein resources used by the second PDCCH signal that have a same TCI state as the first PDSCH are not available for the first PDSCH transmission.
13. The method of claim 11, wherein, if the second PDCCH signal is received on a Control Resource Set (CORESET) associated with a TCI state that has a parameter“previous- PDSCH-resources-available” enabled, resources used by the second PDCCH signals are available for the first PDSCH transmission.
14. The method of claim 11, wherein, if the second PDCCH signal is received on a CORESET associated with a TCI state that has a parameter“previous-PDSCH-resources-available” disabled, resources used by the second PDCCH signal are non-available for the first PDSCH transmission.
15. The method of any one of claims 1 to 14, further comprising determining the reception procedure based on an indication of priority between the first PDSCH transmission and the second PDCCH signal.
16. The method of any one of claims 1 to 15, wherein the overlapping resources comprise
partially overlapping resources.
17. A user equipment (UE) comprising:
a communication interface; and
processing circuitry connected thereto, the processing circuitry comprising a processor and a memory containing instructions that, when executed, cause the UE to: receive a first Physical Downlink Shared Channel (PDSCH) transmission scheduled by a first Physical Downlink Control CHannel (PDCCH) signal;
in resources allocated for the first PDSCH transmission, receive a second PDCCH signal, which schedules a second transmission, such that the second PDCCH signal and the first PDSCH transmission use overlapping resources; and
determine a reception procedure of the first PDSCH transmission based on an indication that the second PDCCH signal punctures the first PDSCH transmission.
18. The UE of claim 17, wherein the processor is configured to perform any method of any one of claims 2 to 16.
19. A computer program product comprising a non-transitory computer readable storage
medium having computer readable program code embodied in the medium, the computer readable program code comprising computer readable program code to operate according to any of the methods 1 to 16.
20. A method in a network node, comprising:
sending a first Physical Downlink Shared Channel (PDSCH) transmission scheduled by a first Physical Downlink Control Channel (PDCCH) signal;
during the transmission of the first PDSCH, sending a second PDCCH signal scheduling a second transmission, such that the first PDSCH transmission and the second PDCCH signal use overlapping resources;
sending an indication that the second PDCCH signal punctures the first PDSCH transmission.
21. The method of claim 20, wherein sending the indication comprises sending a Downlink Control Information (DCI) including the indication.
22. The method of claim 20, wherein sending the indication comprises sending a Radio
Resource Control (RRC) configuration including the indication.
23. The method of any one of claims 20 to 22, wherein the second transmission is one of a
Physical Uplink Shared Channel (PUSCH) transmission and a second PDSCH transmission which is different from the first PDSCH transmission.
24. The method of any one of claims 20 to 23, wherein the overlapping resources comprise partially overlapping resources.
25. The method of any one of claims 20 to 24, wherein the overlapping resources comprise one of resource elements and symbols.
26. A network node a communication interface; and
processing circuitry connected thereto, the processing circuitry comprising a processor and a memory containing instructions that, when executed, cause the network node to: send a first Physical Downlink Shared Channel transmission scheduled by a first Physical Downlink Control Channel (PDCCH) signal;
during the transmission of the first PDSCH, send a second PDCCH signal scheduling a second transmission, such that the first PDSCH transmission and the second PDCCH signal use overlapping resources;
send an indication that the second PDCCH signal punctures the first PDSCH transmission.
27. The network node of claim 26, wherein the processor is configured to perform any methods of any one of claims 20 to 25.
PCT/IB2020/052944 2019-03-28 2020-03-27 Methods and nodes for downlink intra-ue pre-emption WO2020194264A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201962825601P 2019-03-28 2019-03-28
US62/825,601 2019-03-28

Publications (1)

Publication Number Publication Date
WO2020194264A1 true WO2020194264A1 (en) 2020-10-01

Family

ID=70228403

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2020/052944 WO2020194264A1 (en) 2019-03-28 2020-03-27 Methods and nodes for downlink intra-ue pre-emption

Country Status (1)

Country Link
WO (1) WO2020194264A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2022206271A1 (en) * 2021-04-01 2022-10-06 华为技术有限公司 Resource determination method and apparatus

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180234998A1 (en) * 2015-07-24 2018-08-16 Lg Electronics Inc. Downlink control information receiving method and user equipment, and downlink control information transmission method and base station

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180234998A1 (en) * 2015-07-24 2018-08-16 Lg Electronics Inc. Downlink control information receiving method and user equipment, and downlink control information transmission method and base station

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
CATT: "Corrections on rate matching", vol. RAN WG1, no. Gothenburg, Sweden; 20180820 - 20180824, 11 August 2018 (2018-08-11), XP051515764, Retrieved from the Internet <URL:http://www.3gpp.org/ftp/tsg%5Fran/WG1%5FRL1/TSGR1%5F94/Docs/R1%2D1808382%2Ezip> [retrieved on 20180811] *
CATT: "On efficient multiplexing of normal TTI and sTTI", vol. RAN WG1, no. Lisbon, Portugal; 20161010 - 20161014, 9 October 2016 (2016-10-09), XP051148804, Retrieved from the Internet <URL:http://www.3gpp.org/ftp/Meetings_3GPP_SYNC/RAN1/Docs/> [retrieved on 20161009] *
ERICSSON: "Scheduling/HARQ Enhancements for NR URLLC", vol. RAN WG1, no. Chongqing, China; 20191014 - 20191020, 8 October 2019 (2019-10-08), XP051809152, Retrieved from the Internet <URL:https://ftp.3gpp.org/tsg_ran/WG1_RL1/TSGR1_98b/Docs/R1-1910548.zip R1-1910548 Scheduling HARQ Enhancements for NR URLLC.docx> [retrieved on 20191008] *
INTEL CORPORATION: "On multiplexing of PDSCH with different TTIs and related enhancements", vol. RAN WG1, no. St Julian's, Malta; 20160215 - 20160219, 14 February 2016 (2016-02-14), XP051054187, Retrieved from the Internet <URL:http://www.3gpp.org/ftp/Meetings_3GPP_SYNC/RAN1/Docs/> [retrieved on 20160214] *
MOTOROLA MOBILITY ET AL: "Interrupted transmission indication for Multi-TRP Transmission", vol. RAN WG1, no. Athens, Greece; 20190225 - 20190301, 16 February 2019 (2019-02-16), XP051600545, Retrieved from the Internet <URL:http://www.3gpp.org/ftp/tsg%5Fran/WG1%5FRL1/TSGR1%5F96/Docs/R1%2D1902848%2Ezip> [retrieved on 20190216] *
NTT DOCOMO ET AL: "Dynamic resource sharing between DL data and control channels", vol. RAN WG1, no. Athens, Greece; 20170213 - 20170217, 7 February 2017 (2017-02-07), XP051221661, Retrieved from the Internet <URL:http://www.3gpp.org/ftp/tsg_ran/WG1_RL1/TSGR1_88/Docs/> [retrieved on 20170207] *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2022206271A1 (en) * 2021-04-01 2022-10-06 华为技术有限公司 Resource determination method and apparatus

Similar Documents

Publication Publication Date Title
US11917632B2 (en) Physical uplink control channel (PUCCH) resource allocation
CN111165048B (en) Method and apparatus for configuring resources and transmitting/receiving data in wireless cellular communication system
JP7416853B2 (en) System and method for prioritizing channel state information reports
US11678212B2 (en) Methods executed by user equipment and user equipment
US11337186B2 (en) Method and apparatus for control information searching and data information transmission in a communication system
US11528101B2 (en) Methods and apparatus for control information triggering in wireless networks
CN111200871B (en) Method and communication device for receiving data
US11937241B2 (en) UCI on grant-free PUSCH
US20190357182A1 (en) Method and device for transmitting downlink control information
US11177927B2 (en) Terminal apparatus, base station apparatus, communication method, and integrated circuit
US20170105197A1 (en) Method and Devices for Mitigating Error Propagation in Transmission Assignments
WO2020194264A1 (en) Methods and nodes for downlink intra-ue pre-emption
US11323985B2 (en) Methods and apparatus relating to control channel decoding in a wireless communications network
US20230291508A1 (en) Enhanced one-shot harq-ack codebook transmission
US20230283415A1 (en) Enhanced one-shot harq-ack codebook transmission
US11974265B2 (en) Use of priority mismatch indication for uplink transmission for wireless networks
WO2023123246A1 (en) Method, device and computer storage medium for communication
US20210329658A1 (en) Use of priority mismatch indication for uplink transmission for wireless networks
WO2020225710A1 (en) Methods for improving reliability and latency of ul configured grant or dl sps
WO2013023686A1 (en) Scheduling in a communication system capable of using muted or almost blank subframes
CN116325611A (en) Communication method, terminal device, network device, and computer-readable medium

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20717968

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20717968

Country of ref document: EP

Kind code of ref document: A1