WO2022157182A1

WO2022157182A1 - Acknowledgements

Info

Publication number: WO2022157182A1
Application number: PCT/EP2022/051105
Authority: WO
Inventors: Guillermo POCOVI; Klaus Hugl
Original assignee: Nokia Technologies Oy
Priority date: 2021-01-22
Filing date: 2022-01-19
Publication date: 2022-07-28
Also published as: GB202100860D0

Abstract

An apparatus comprising at least one processor; and at least one memory including computer program code; the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to perform: receiving configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; determining acknowledgements for a plurality of semi-persistent downlink data resources to be compressed based, at least in part, on the at least one associated identifiers; compressing the determined acknowledgements; and transmitting at least one compressed acknowledgement.

Description

TITLE

ACKNOWLEDGEMENTS

TECHNOLOGICAL FIELD

Embodiments of the present disclosure relate to acknowledgements. Some relate to compressing acknowledgments for downlink data resources.

BACKGROUND

A wireless network comprises a plurality of network nodes including terminal nodes and access nodes. Communication between the terminal nodes and the access nodes is wireless.

In some circumstances, it may be desirable to modify or enhance how acknowledgements for downlink data transmissions are handled.

BRIEF SUMMARY

According to various, but not necessarily all, embodiments there is provided examples as claimed in the appended claims.

According to various, but not necessarily all, embodiments there is provided an apparatus comprising at least one processor; and at least one memory including computer program code; the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to perform: receiving configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; determining acknowledgements for a plurality of semi-persistent downlink data resources to be compressed based, at least in part, on the at least one associated identifiers; compressing the determined acknowledgements; and transmitting at least one compressed acknowledgement.

In examples, the at least one associated identifier comprises one or more of: an indicator configured to indicate compressing is allowed, a bundle identifier and a scheduling configuration index.

In examples, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to perform: receiving, for the plurality of semi-persistent downlink data resource configurations, a timing indicator for uplink transmission of an acknowledgment, and wherein determining acknowledgements to be compressed comprises determining based, at least in part, on the one or more timing indicators, semi-persistent downlink data resources whose timing indicators indicate a common uplink resource for transmission of an acknowledgement.

In examples, determining acknowledgements to be compressed comprises determining semi-persistent downlink data resources whose timing indicators indicate a common uplink resource for transmission of an acknowledgement and who have a common associated bundle identifier.

In examples, determining acknowledgements to be compressed comprises determining semi-persistent downlink data resources whose timing indicators indicate a common uplink resource for transmission of an acknowledgement and who have an associated identifier configured to indicate compressing is allowed.

In examples, the at least one memory and computer program code configured to, with the at least one processor, cause the apparatus at least to perform: determining at least one reference semi-persistent downlink data resource configuration, wherein determining acknowledgements to be compressed comprises determining at least one semi-persistent downlink data resource occurring between instances of the at least one reference semi-persistent downlink data resource configuration.

In examples, determining at least one reference semi-persistent downlink data resource configuration comprises receiving an indication of at least one reference semi-persistent downlink data resource configuration. In examples, determining at least one semi-persistent downlink data resource occurring between instances of the at least one reference semi-persistent downlink data resource configuration comprises determining at least one semi-persistent downlink data resource occurring between instances of the at least one reference semi-persistent downlink data resource configuration whose associated semi-persistent downlink data resource configurations have a common associated bundle identifier.

In examples, determining at least one semi-persistent downlink data resource occurring between instances of the at least one reference semi-persistent downlink data resource configuration comprises determining at least one semi-persistent downlink data resource occurring between instances of the at least one reference semi-persistent downlink data resource configuration whose associated semi-persistent downlink data resource configurations have an associated identifier configured to indicate compressing is allowed.

In examples, determining acknowledgements to be compressed comprises determining at least one semi-persistent downlink data resource occurring between instances of the at least one reference semi-persistent downlink data resource configuration and determining scheduling configuration index values of the associated identifiers of the semi-persistent downlink data resource configurations of the determined semi-persistent downlink data resources.

In examples, determining acknowledgements to be compressed comprises determining at least one semi-persistent downlink data resource occurring between adjacent instances of the at least one reference semi-persistent downlink data resource configuration.

In examples, the at least one memory and computer program code configured to, with the at least one processor, cause the apparatus at least to perform: determining a parameter M, and wherein determining acknowledgements to be compressed comprises determining semi-persistent downlink data resources occurring between M adjacent instances of the at least one reference semi-persistent downlink data resource configuration.

In examples, determining the parameter M comprises receiving the parameter M. In examples, transmitting at least one compressed acknowledgement comprises transmitting at least one compressed acknowledgement on an uplink control channel at a time instance determined based, at least in part, on the timing indicator of one of the data resources whose acknowledgement is included in the compressed acknowledgements.

In examples, the at least one memory and computer program code configured to, with the at least one processor, cause the apparatus at least to perform: determining that at least one downlink resource is associated with a scheduling DCI and preventing compressing of an acknowledgement for the determined at least one downlink resource.

According to various, but not necessarily all, embodiments there is provided a method comprising: receiving configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; determining acknowledgements for a plurality of semi-persistent downlink data resources to be compressed based, at least in part, on the at least one associated identifiers; compressing the determined acknowledgements; and transmitting at least one compressed acknowledgement.

In examples, the method comprises: receiving, for the plurality of semi-persistent downlink data resource configurations, a timing indicator for uplink transmission of an acknowledgment, and wherein determining acknowledgements to be compressed comprises determining based, at least in part, on the one or more timing indicators, semi-persistent downlink data resources whose timing indicators indicate a common uplink resource for transmission of an acknowledgement.

In examples, the method comprises: determining at least one reference semi-persistent downlink data resource configuration, wherein determining acknowledgements to be compressed comprises determining at least one semi-persistent downlink data resource occurring between instances of the at least one reference semi-persistent downlink data resource configuration.

In examples, determining at least one reference semi-persistent downlink data resource configuration comprises receiving an indication of at least one reference semi-persistent downlink data resource configuration.

In examples, determining at least one semi-persistent downlink data resource occurring between instances of the at least one reference semi-persistent downlink data resource configuration comprises determining at least one semi-persistent downlink data resource occurring between instances of the at least one reference semi-persistent downlink data resource configuration whose associated semi-persistent downlink data resource configurations have a common associated bundle identifier.

In examples, determining at least one semi-persistent downlink data resources occurring between instances of the at least one reference semi-persistent downlink data resource configuration comprises determining at least one semi-persistent downlink data resource occurring between instances of the at least one reference semi-persistent downlink data resource configuration whose associated semi-persistent downlink data resource configurations have an associated identifier configured to indicate compressing is allowed.

In examples, the method comprises: determining a parameter M, and wherein determining acknowledgements to be compressed comprises determining semi-persistent downlink data resources occurring between M adjacent instances of the at least one reference semi-persistent downlink data resource configuration.

In examples, determining the parameter M comprises receiving the parameter M.

In examples, transmitting at least one compressed acknowledgement comprises transmitting at least one compressed acknowledgement on an uplink control channel at a time instance determined based, at least in part, on the timing indicator of one of the data resources whose acknowledgement is included in the compressed acknowledgements.

In examples, the method comprises: determining that at least one downlink resource is associated with a scheduling DCI and preventing compressing of an acknowledgement for the determined at least one downlink resource.

According to various, but not necessarily all, embodiments there is provided a computer program comprising instructions for causing an apparatus to perform at least the following: receiving configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; determining acknowledgements for a plurality of semi-persistent downlink data resources to be compressed based, at least in part, on the at least one associated identifiers; compressing the determined acknowledgements; and transmitting at least one compressed acknowledgement. In examples, the at least one associated identifier comprises one or more of: an indicator configured to indicate compressing is allowed, a bundle identifier and a scheduling configuration index.

In examples, computer program comprising instructions for causing an apparatus to perform at least the following: receiving, for the plurality of semi-persistent downlink data resource configurations, a timing indicator for uplink transmission of an acknowledgment, and wherein determining acknowledgements to be compressed comprises determining based, at least in part, on the one or more timing indicators, semi-persistent downlink data resources whose timing indicators indicate a common uplink resource for transmission of an acknowledgement.

In examples, computer program comprising instructions for causing an apparatus to perform at least the following: determining at least one reference semi-persistent downlink data resource configuration, wherein determining acknowledgements to be compressed comprises determining at least one semi-persistent downlink data resource occurring between instances of the at least one reference semi-persistent downlink data resource configuration.

In examples, computer program comprising instructions for causing an apparatus to perform at least the following: determining a parameter M, and wherein determining acknowledgements to be compressed comprises determining semi-persistent downlink data resources occurring between M adjacent instances of the at least one reference semi-persistent downlink data resource configuration.

In examples, determining the parameter M comprises receiving the parameter M.

In examples, computer program comprising instructions for causing an apparatus to perform at least the following: determining that at least one downlink resource is associated with a scheduling DCI and preventing compressing of an acknowledgement for the determined at least one downlink resource.

In examples, the computer program stored on a non-transitory computer readable medium.

According to various, but not necessarily all, embodiments there is provided an apparatus means for performing, at least: receiving configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; determining acknowledgements for a plurality of semi-persistent downlink data resources to be compressed based, at least in part, on the at least one associated identifiers; compressing the determined acknowledgements; and transmitting at least one compressed acknowledgement.

According to various, but not necessarily all, embodiments there is provided an apparatus comprising at least one processor; and at least one memory including computer program code; the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to perform: receiving configuration information and at least one associated identifier for a at least one semi-persistent downlink data resource configuration, the at least one associated identifier to enable compressing of acknowledgements; determining acknowledgements for a plurality of semi-persistent downlink data resources to be compressed based, at least in part, on the at least one associated identifier; compressing the determined acknowledgements; and transmitting at least one compressed acknowledgement. According to various, but not necessarily all, embodiments there is provided an apparatus comprising at least one processor; and at least one memory including computer program code; the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to perform: transmitting configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; transmitting information using one or more of the semi-persistent downlink data resource configurations; and receiving at least one compressed acknowledgement.

In examples, the at least one memory and computer program code configured to, with the at least one processor, cause the apparatus at least to perform: processing the at least one compressed acknowledgement to determine the meaning indicated by the at least one compressed acknowledgement.

According to various, but not necessarily all, embodiments there is provided an apparatus comprising means for performing at least part of one or more methods disclosed herein.

According to various, but not necessarily all, embodiments there is provided an apparatus comprising at least one processor; and at least one memory including computer program code; the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to perform at least a part of one or more methods disclosed herein.

The description of a function and/or action should additionally be considered to also disclose any means suitable for performing that function and/or action.

BRIEF DESCRIPTION

Some examples will now be described with reference to the accompanying drawings in which: FIG. 1 shows an example of the subject matter described herein;

FIG. 2 shows another example of the subject matter described herein;

FIG. 3 shows another example of the subject matter described herein;

FIG. 4 shows another example of the subject matter described herein;

FIG. 5 shows another example of the subject matter described herein;

FIG. 6 shows another example of the subject matter described herein;

FIG. 7 shows another example of the subject matter described herein;

FIG. 8 shows another example of the subject matter described herein;

FIG. 9 shows another example of the subject matter described herein;

FIG. 10 shows another example of the subject matter described herein;

FIG. 11 shows another example of the subject matter described herein;

FIG. 12 shows another example of the subject matter described herein;

FIG. 13 shows another example of the subject matter described herein;

FIG. 14 shows another example of the subject matter described herein;

FIG.15A shows another example of the subject matter described herein; and FIG. 15B shows another example of the subject matter described herein.

ACRONYMS

(N)ACK - (Negative) Acknowledgement

DCI - Downlink control information

HARQ - Hybrid Automatic Repeat Request

MAC CE - Medium Access Control (MAC) control element (CE)

PDSCH - Physical Downlink Shared Channel

PLICCH - Physical Uplink Control Channel

RRC - Radio resource control

SPS - Semi-persistent scheduling

DETAILED DESCRIPTION

FIG 1 illustrates an example of a network 100 comprising a plurality of network nodes including terminal nodes 110, access nodes 120 and one or more core nodes 129. The terminal nodes 110 and access nodes 120 communicate with each other. The one or more core nodes 129 communicate with the access nodes 120. The network 100 is in this example a telecommunications network, in which at least some of the terminal nodes 110 and access nodes 120 communicate with each other using transmission/reception of radio waves/signals.

The one or more core nodes 129 may, in some examples, communicate with each other. The one or more access nodes 120 may, in some examples, communicate with each other.

The one or more terminal nodes 110 may, in some examples, communicate with each other.

The network 100 may be a cellular network comprising a plurality of cells 122 each served by an access node 120. In this example, the interface between the terminal nodes 110 and an access node 120 defining a cell 122 is a wireless interface 124.

The access node(s) 120 is a cellular radio transceiver. The terminal nodes 110 are cellular radio transceivers.

In the example illustrated the cellular network 100 is a third generation Partnership Project (3GPP) network in which the terminal nodes 110 are user equipment (UE) and the access nodes 120 are base stations (for example, gNBs).

Functionality of a base station may be distributed between a central unit (CU), for example a gNB-Cll, and one or more distributed units (DU), for example gNB-DUs.

In the particular example illustrated the network 100 is an Evolved Universal Terrestrial Radio Access network (E-UTRAN). The E-UTRAN consists of E-UTRAN NodeBs (eNBs), providing the E-UTRA user plane and control plane (for example, RRC) protocol terminations towards the UE. The eNBs 120 are interconnected with each other by means of an X2 interface 126. The eNBs are also connected by means of the S1 interface 128 to the Mobility Management Entity (MME) 129.

In other example the network 100 is a Next Generation (or New Radio, NR) Radio Access network (NG-RAN). The NG-RAN consists of gNodeBs (gNBs), providing the user plane and control plane (for example, RRC) protocol terminations towards the UE. The gNBs are interconnected with each other by means of an X2/Xn interface 126. The gNBs are also connected by means of the N2 interface 128 to the Access and Mobility management Function (AMF). In examples, the network 100 can comprise a combination of E-UTRAN and NG-RAN.

In examples, an access node 120 can configure a terminal node 110 with one or more semi- persistent downlink data resource configurations.

Once the semi-persistent downlink resource configuration(s) are activated at the terminal node 110, the terminal node can receive data using one or more downlink data resources according to the downlink resource configuration(s). The downlink data resources re-occur with a certain known and/or preconfigured time pattern, until they are adjusted or a release signal is received.

In examples, a terminal node prepares an acknowledgement, which can be positive of negative, for the configured downlink data resources and transmits the acknowledgement to the access node 120.

In some examples Hybrid Automatic Repeat Request Acknowledgements (HARQ-ACKs) can be used.

Some examples relate to a 3GPP network.

FIG. 2 illustrates an example of a method 200.

In examples, FIG. 2 can be considered to illustrate a plurality of methods. For example, FIG. 2 illustrates one or more actions at a plurality of actors/entities. In examples, FIG. 2 can be considered to illustrate a plurality of methods performed by the individual actors/entities.

One or more of the features discussed in relation to FIG. 2 can be found in one or more of the other FIGs. During discussion of FIG. 2, reference will be made to other FIGs for the purposes of explanation.

In the example of FIG. 2, a plurality of apparatuses transmit and/or receive one or more signals and/or one or more messages across and/or via and/or using a network. In examples, any suitable form of communication in any suitable network can be used. For example, at least a portion of the network 100 of FIG. 1 can be used. Accordingly, in examples, the plurality of apparatuses in FIG. 2 form at least a portion of a network 100 as described in relation to FIG. 1.

In the illustrated example, a terminal node 110, such as a UE 204, and an access node 120 transmit and/or receive one or more signals and/or one or more messages.

However, in examples any suitable nodes can be used.

Additionally, or alternatively, in some examples any suitable number of access nodes 120 and/or terminal nodes 110 can be used. For example, an access node 120 can communicate with a plurality of terminal nodes 110.

In examples, communications and/or transmissions between elements illustrated in FIG. 2 can proceed via any number of intervening elements, including no intervening elements.

In examples, method 200 and/or parts of method 200 can be considered a method of controlling acknowledgements and/or a method of compressing acknowledgements and/or a method of grouping downlink data resources.

In some examples, method 200 and/or parts of method 200 can be considered a method of reducing acknowledgements for semi-persistent scheduling (SPS) downlink resources.

At block 201 , and with reference to FIG. 3, method 200 comprises transmitting configuration information 130 and at least one associated identifier 132 for a plurality of semi-persistent downlink data resource configurations 134, the at least one associated identifier 132 to enable compressing of acknowledgements 138.

In some examples, at block 201 method 200 comprises transmitting configuration 130 and at least one associated identifier 132 for at least one semi-persistent downlink data resource configurations 134, the at least one associated identifier 132 to enable compressing of acknowledgements 138.

The at least one associated identifier 132 can be considered to and/or configured to facilitate and/or allow and/or permit compressing of acknowledgements 138. In some examples, at block 201 method 200 can be considered to comprise transmitting configuration information 130 for a plurality of semi-persistent downlink data resource configurations 134 and at least one associated identifier 132 for at least one of the semi- persistent downlink data resource configurations 134, the at least one associated identifier 132 to enable compressing of acknowledgements 138.

A semi-persistent downlink data resource configuration 134 can be associated with any suitable number of associated identifiers 132.

In examples, at least one associated identifier 132 is provided per semi-persistent downlink data resource configuration 134.

In some examples, at least one associated identifier 132 is provided for each of the semi- persistent downlink data resource configurations 134.

Accordingly, in some examples, at block 201 method 200 can be considered to comprise transmitting configuration information 130 for a plurality of semi-persistent downlink data resource configurations 134 and at least one associated identifier for each of the plurality of semi-persistent downlink data resource configurations 134, the at least one associated identifier 132 to enable compressing of acknowledgements 138.

In examples, the at least one semi-persistent downlink data resource configuration 134 can be a sub-set of the semi-persistent downlink data resource configurations 134 for which configuration information 130 is transmitted.

In examples, the plurality of semi-persistent downlink data resource configurations 134 can be a sub-set of the semi-persistent downlink data resource configurations 134 for which configuration information 130 is transmitted.

In examples, semi-persistent downlink data resource configuration(s) 134 for which at least one associated identifier 132 is not provided are not enabled for compressing of acknowledgements 138 and/or are not configured for compressing of acknowledgements 138 and/or are not considered for compressing of acknowledgements 138 and/or are omitted from compressing of acknowledgements 138. In examples, semi-persistent downlink data resource configuration(s) 134 without at least one associated identifier 132 can operate in a conventional manner with regard to transmission of acknowledgements 138.

In examples, the at least one associated identifier 132 of a semi-persistent downlink data resource configuration 134 is and/or can be considered to be also associated with semi- persistent downlink data resources 136 belonging to/configured by the semi-persistent downlink data resource configuration 134.

In the illustrated example, the location of the blocks indicates the entity performing the action(s). For example, in FIG. 2, block 201 is performed at and/or by the access node 120.

As FIG. 2 illustrates one or more actions of transmission, FIG. 2 also illustrates the corresponding receiving feature(s)/action(s) and vice versa.

For example, from the point of view of the terminal node 110, block 201 can be considered to illustrate receiving configuration information 130 and at least one associated identifier 132 for a plurality of semi-persistent downlink data resource configurations 134, the at least one associated identifier 132 to enable compressing of acknowledgements 138.

In examples, from the point of view of the terminal node 110, block 201 can be considered to illustrate receiving configuration information 130 and at least one associated identifier 132 for at least one downlink data resource configuration 134, the at least one associated identifier 132 to enable compressing of acknowledgements 138.

This is illustrated, in the example of FIG. 2, by the arrow from block 201 pointing to the line representing the terminal node 110.

In examples, the configuration information 130 and at least one associated identifier 132 for the plurality of semi-persistent downlink data resource configurations 134 can be transmitted in any suitable way.

For example, the configuration information 130 and associated identifiers 132 can be transmitted together and/or at the same time or can be transmitted separately and/or at different times. In some examples, at least part of the configuration information 130 can be transmitted as at least part of an RRC configuration using one or more RRC messages.

In examples, the configuration information 130 can comprise the associated identifiers 132. That is, in some examples the associated identifiers 132 can form part of the configuration information 130.

For example, the associated identifiers 132 for the plurality of semi-persistent downlink data resource configurations 134 can be included inside an information element, such as an SPS-config information element, in a radio resource control (RRC) configuration message.

In examples, the associated identifiers 132 can be indicated by one or more parameters, for example RRC parameters.

In examples, the one or more parameters, or a subset thereof, is/are not serving cell specific, but can be common across all serving downlink cells within a PLICCH cell group.

The configuration information 130 can have any suitable form.

In examples, the configuration information can have any suitable form to configure a plurality of semi-persistent downlink data resource configurations 134 at the terminal node 110.

For example, the configuration information 130 can comprise resource parameters for the semi-persistent downlink data resource configurations 134 such as SPS configuration index, periodicity, number of HARQ, PLICCH resource ID, applicable modulation and coding scheme (MCS) table, and so on.

In examples, configuration information 130 can be transmitted in any suitable number of parts and/or portions using any suitable number of transmissions.

In some examples, time/frequency domain allocation and modulation and coding can be provided separately from one or more other portions of configuration information 130, such as, for example, resource parameters.

In examples, one or more portions and/or parts of configuration information 130, for example time/frequency domain allocation and modulation and coding, can be provided through activation signaling for the semi-persistent downlink data resource configuration(s) 134. Activation signaling can comprise downlink control information (DCI) signaling.

In some examples, the activation signaling includes an indication of the semi-persistent downlink data resource configuration 134, such as an SPS configuration, that is activated.

In some examples, configuration information 130 can be transmitted and/or provided using a combination of RRC configuration and physical layer signaling, for example DCI signaling.

Any suitable number of semi-persistent downlink data resource configurations 134 can be configured at the terminal node 110, and can, for example, be limited by the network 100 and/or the capabilities of the terminal node 110.

The configuration information 130 can configure semi-persistent downlink data resource configurations 134 having any suitable form.

In examples, a semi-persistent downlink data resource configuration 134 comprises information to configure a terminal node 110 with re-occurring downlink data resources 136 that can be activated.

In examples, the activation provides resource definition, for example in terms of MCS and time-frequency allocation.

A semi-persistent downlink data resource configuration can be and/or be considered an SPS PDSCH configuration.

Upon activation, by any suitable activation indication(s) or signal(s), the downlink data resources 136 re-occur with a known and/or preconfigured time pattern and/or sequence and/or arrangement.

The downlink data resources 136 can re-occur until they are updated and/or changed and/or adjusted and/or they are released.

In examples, the re-occurring downlink data resources 136, configured by a semi-persistent downlink data resource configuration 134, can have any suitable time pattern and/or sequence and/or arrangement. For example, the re-occurring downlink data resources 136, configured by a semi-persistent downlink data resource configuration 134, can be periodic or aperiodic.

The downlink data resources 136 can have any suitable form. In examples, the downlink data resources 136 can be or comprise semi-persistent scheduling physical downlink shared control channel (SPS PDSCH) resources.

In examples, downlink data resources 136 can be considered downlink data radio resources.

In examples, downlink data resources 136 configured by a semi-persistent downlink data resource configuration 134 can be considered to belong to the semi-persistent downlink data resource configuration 134.

In examples, downlink data resources 136 configured by a semi-persistent downlink data resource configuration 134 can be considered instances of the semi-persistent downlink data resource configuration 134.

In examples, semi-persistent downlink data resource configurations 134 can be considered reoccurring downlink data resource configurations and/or semi-static downlink data resource configurations and so on.

Reference is made to FIG. 3. FIG. 3 schematically illustrates an example of downlink data resources 136 of/belonging to/configured by six semi-persistent downlink data resource configurations 134 configured at a terminal node 110.

In the example of FIG. 3 a plurality of downlink time slots of a downlink channel 151 are shown.

In the illustrated example, downlink data resources 136 are indicated by rectangles in the downlink slots, the rectangles marked with a numeral 1 to 6 showing the configuration to which the downlink data resources 136 belong.

The numeral 1 to 6 can be and/or be considered a scheduling configuration index and/or a scheduling configuration identification of the semi-persistent downlink data resource configuration 134. In the example of FIG. 3 the downlink data resources 136 re-occur periodically. It can be seen that the downlink data resources 136 of configuration ‘6’ re-occur less frequently than those of configurations ‘2’, ‘4’ and ‘5’.

Similarly, the downlink data resources 136 of configurations T and ‘3’ re-occur more frequently than those of configurations ‘2’, ‘4’ and ‘5’.

Accordingly, in the example of FIG.3 there are a greater number of instances of configurations T and ‘3’ compared to configurations ‘2’, ‘4’ and ‘5’, and a greater number of instances of configurations ‘2’, ‘4’ and ‘5’ compared to configuration ‘6’.

In examples, the relative timing or time-domain location of the downlink data resources 136 of the various configurations 134 can be controlled by appropriate activation of the configurations 134.

Returning to block 201 of FIG. 2, in examples any suitable associated identifier(s) 132 having any suitable form can be used.

For example, any suitable associated identifier(s) 132 having any suitable form to enable compressing of acknowledgements 138 can be used.

In examples, the at least one associated identifiers 132 can be considered to enable compressing and/or combining and/or bundling and/or grouping and/or reducing of acknowledgements 138.

In some examples, the at least one associated identifiers 132 can be considered to enable determining which acknowledgements 138 are to be compressed and/or combined and/or bundled and/or grouped and/or reduced.

As used herein, the term "determining" (and grammatical variants thereof) can include, not least: calculating, computing, processing, deriving, investigating, looking up (for example, looking up in a table, a database or another data structure), ascertaining and the like. Also, "determining" can include receiving (for example, receiving information), accessing (for example, accessing data in a memory) and the like. Also, "determining" can include resolving, selecting, choosing, establishing, and the like. In examples, the acknowledgements 138 to be compressed and/or combined and/or bundled and/or grouped and/or reduced can be considered a subset and/or group and/or bundle and/or selection of acknowledgements 138.

In examples, the associated identifiers 132 are to and/or are configured to enable a reduction in the amount of information transmitted and/or a reduction in the number of transmissions in relation to the acknowledgements 138 to be reduced.

In some examples, the associated identifiers 132 are to and/or are configured to enable a reduction in the number of bits used to represent the acknowledgements 138 to be reduced.

In examples, the at least one associated identifier 132 comprises one or more of: an indicator configured to indicate compressing is allowed, a bundle identifier and a scheduling configuration index.

In some examples, a scheduling configuration index can be used in combination with an indicator configured to indicate compressing is allowed.

Any suitable indicator having any suitable form to indicate compressing is allowed can be used.

The indicator can be considered a compression and/or combining and/or bundle and/or group and/or reduction allow indicator. For example, the indicator can be considered a HARQ bundle allow indicator.

In examples, the indicator can be considered a flag configured to indicate that compression is allowed. For example, the indicator can be a one-bit flag configured to indicate whether acknowledgement compression is allowed for downlink data resources 136 configured by a semi-persistent downlink data resource configuration 134.

In examples, the indicator can be configured to indicate that acknowledgement compression is not allowed for downlink data resources 136 configured by a semi-persistent downlink data resource configuration 134. Any suitable bundle identifier having any suitable form to identify different acknowledgement bundles can be used.

In examples, a bundle identifier can be considered a compression identifier and/or a combination identifier and/or a group identifier and/or a reduction identifier and so on.

In some examples, a bundle identifier can be considered a HARQ bit bundle identifier.

A bundle identifier can be and/or comprise a value from a range of possible values. For example, a bundle identifier can be a value in the range of integers from 1 to N. Any suitable value of N can be used.

In examples, a semi-persistent downlink data resource configuration 134 is assigned a bundle identifier and the downlink data resources 136 belonging to the downlink data resource configuration 134 also have the assigned bundle identifier.

In the example of FIG. 3, the downlink data resources 136 of the various semi-persistent downlink data resource configurations 134 have different shades to indicate different bundle identifiers and therefore different groups.

In examples, the maximum number of bundles can be overall limited to 32 given by a maximum number of SPS configurations per PLICCH group. However, in some examples, the number of bundles can be limited to a smaller number, for example 8, being limited by different traffic types and/or services using SPS PDSCH and being applicable for the SPS compression operation for a terminal node 110, such as a UE.

In the example of FIG. 3, one of the semi-persistent downlink data resources 136 of semi- persistent downlink data resource configurations 134 that have a common bundle identifier have been indicated with an additional reference ‘a’, ‘b’ or ‘c’.

In FIG. 3, the downlink data resources 136 of configurations ‘1’ and ‘3’ have a common bundle identifier and are therefore indicated as ‘136a’.

In the example of FIG. 3, downlink data resources 136 of configurations ‘1’ and ‘3’ have associated bundle identifier T. However, any suitable bundle identifier can be used. In FIG. 3 the downlink data resources 136 of configurations ‘2’, ‘4’ and ‘5’ also have a common bundle identifier and are therefore indicated as ‘136b’.

In the example of FIG. 3, downlink data resources 136 of configurations ‘2’, ‘4’ and ‘5’ have associated bundle identifier ‘2’. However, any suitable bundle identifier can be used.

In FIG. 3 the downlink data resources 136 of configuration ‘6’ have an associated bundle identifier different to the other configurations and are therefore indicated as ‘136c’.

In the example of FIG. 3, downlink data resources 136 of configuration ‘6’ have associated bundle identifier ‘3’. However, any suitable bundle identifier can be used.

In other examples, a semi-persistent downlink data resource configuration 134, such as configuration ‘6’, does not have an associated identifier 132, meaning that the downlink data resources 136 of, for example, configuration ‘6’ do not have an associated identifier 132, indicating that compression is not allowed and/or is not enabled in relation to acknowledgements for those downlink data resources 136.

Returning to block 201 of FIG. 2, in examples the scheduling configuration indexes of the semi-persistent downlink data resource configurations 134 can be used to enable compression of acknowledgements 138.

For example, the various semi-persistent downlink data resource configurations 134 can be activated and/or scheduled and/or arranged to enable compressing of acknowledgements 138.

In such examples, an explicit indication that compression is enabled can be provided, for example an indicator configured to indicate compressing is allowed can be provided and the scheduling configuration indexes used in determining the acknowledgements 138 to be compressed.

At block 202 method 200 comprises transmitting, for the plurality of semi-persistent downlink data resource configurations 134, a timing indicator 142 for uplink transmission of an acknowledgement 138. In examples, at block 202 method 200 comprises transmitting, for the at least one semi- persistent downlink data resource configuration 134, a timing indicator 142 for uplink transmission of an acknowledgement 138.

The timing indicator(s) 142 are received by the terminal node 110.

In examples, a timing indicator 142 is provided per semi-persistent downlink data resource configuration 134.

In some examples, a timing indicator 142 is provided for each semi-persistent downlink data resource configuration 134.

Accordingly, in some examples, at block 202 method 200 can be considered to comprise transmitting, for each of the plurality of semi-persistent downlink data resource configurations 134, a timing indicator 142 for uplink transmission of an acknowledgement 138.

In examples, at block 202 method 200 can be considered to comprise transmitting, for each of the at least one semi-persistent downlink data resource configurations 134, a timing indicator 142 for uplink transmission of an acknowledgement 138.

The timing indicator 142 for a configuration 134 can apply to the downlink data resources 136 belonging to the configuration 134. That is, the timing indicator 142 for a configuration 134 can apply to instances of the configuration 134.

In examples, the timing indicator(s) 142 can have any suitable form and can be transmitted in any suitable way at any suitable time.

In some examples, the timing indicator(s) 142 can have any suitable form to indicate timing of uplink resources 144 relative to reception of an instance of a semi-persistent downlink data resource configuration 134. For examples, the timing indicator 142 can have any suitable form to indicate timing of uplink resources 144 relative to reception of SPS PDSCH resources.

In examples, the timing indicator(s) 142 are provided in activation signaling, for example an activation DCI. In examples, the uplink resources 144 are configured as part of a semi-persistent downlink data resource configuration 134. For example, the uplink resources 144 can be configured as part of a SPS RRC configuration.

In examples, the timing indicator can be/comprise PDSCH-to-HARQ_feedback timing value, k1.

In examples, any suitable uplink resources 144 can be used. In examples, uplink resources 144 of a control channel can be used. For example, uplink resources 144 can be/comprise physical uplink control channel (PLICCH) resources.

In some examples, acknowledgement(s) 138 and/or compressed acknowledgement(s) can be transmitted with uplink data on an uplink data channel, for example physical uplink shared channel (PLISCH).

In some examples, the timing indicator(s) 142 are configured by physical layer (PHY) signaling. For example, the timing indicator(s) 142 can be configured in SPS activation/re- activation downlink control information (DCI).

In examples, the timing indicator(s) 142 can be transmitted with and/or as a part of the configuration information 130. Accordingly, in some examples, blocks 201 and 202 can be combined.

At block 203 method 200 comprises transmitting information using one or more of the semi- persistent downlink data resource configurations 134.

In examples, at block 203 method 200 can be considered to comprise transmitting information using one or more instances of the one or more semi-persistent downlink data resource configurations 134.

In examples, at block 203 method 200 can be considered to comprise transmitting information using one or more downlink data resources 136 configured by one or more of the semi-persistent downlink data resource configurations 134. For example, with reference to FIG. 3, information can be transmitted using one or more of the illustrated downlink data resources 136.

The information is received by the terminal node 110.

In examples, any suitable information can be transmitted in any suitable way.

In some examples, one or more of the semi-persistent downlink data resource configurations 134 are used to transmit traffic with jitter. For example, one or more of the semi-persistent downlink data resource configurations can be used to transmit periodic traffic with jitter, arriving with deviation around a nominal arrival time.

In examples, the terminal node 110 determines acknowledgements, such as HARQ-ACKs, for the downlink data resources 136, which can be SPS PDSCH resources, configured by the semi-persistent downlink data configurations based, at least in part, on whether information is successfully received/decoded from the downlink data resources 136.

In some examples, the terminal node 110 determines positive or negative acknowledgements 138, such as HARQ-ACKs, for the downlink data resources 136.

For example, the terminal node 110 can generate a positive acknowledgement for successful PDSCH decoding or a negative acknowledgement for unsuccessful PDSCH decoding.

Positive and negative acknowledgements can be represented in any suitable way and/or can have any suitable form. In examples, a positive acknowledgement is represented by a logical T and a negative acknowledgement is represented by a logical ‘O’.

At block 204 method 200 comprises determining acknowledgements 138 for a plurality of semi-persistent downlink data resources 136 to be compressed based, at least in part, on the at least one associated identifiers 132.

In examples, at block 204 method 200 can be considered to comprise determining acknowledgements 138, for a plurality of downlink data resources 136 configured by the plurality of semi-persistent downlink data resource configurations 134, to be compressed and/or combined and/or bundled and/or grouped and/or reduced based, at least in part, on the at least one associated identifiers 132.

For example, block 204 can comprise determining the acknowledgements 138 for which of the configured downlink data resources 136 should be compressed based, at least in part, on the at least one associated identifiers 132.

In examples, at block 204 method 200 can be considered to comprise determining acknowledgements 138 for a plurality of downlink data resources 136 configured by the at least one semi-persistent downlink data resource configuration 134, to be compressed and/or combined and/or bundled and/or grouped and/or reduced based, at least in part, on the at least one associated identifiers 132.

In examples, the at least one associated identifiers 132 can be considered the plurality of at least one associated identifier 132.

Acknowledgements 138 for a plurality of downlink data resources 136 to be compressed can be determined in any suitable way using any suitable method.

For example, the at least one associated identifier 132 can be used in any suitable way in determination of acknowledgements 138 to be compressed.

In examples, determining acknowledgements 138 to be compressed comprises determining acknowledgements 138 for a plurality of downlink data resources 136 to be compressed based, at least in part, on the at least one associated identifiers 132 and the timing indicators 142.

In some examples, determining acknowledgements 138 to be compressed comprises determining semi-persistent downlink data resources 136 whose timing indicators 142 indicate a common uplink resource 144 for transmission of an acknowledgement 138.

See, for example, FIG. 4.

In some examples, determining acknowledgements 138 to be compressed comprises determining which of the configured downlink data resources 136 have associated timing indicators 142 indicating a common uplink resource 144 for transmission of an acknowledgement 138.

Accordingly, in some examples, method 200 comprises receiving, for a plurality of semi- persistent downlink data resource configurations 134, a timing indicator 142 for uplink transmission of an acknowledgement 138, and determining acknowledgements 138 to be compressed comprises determining based, at least in part, on the one or more timing indicators 142, semi-persistent downlink data resources 136 whose timing indicators 142 indicate a common uplink resource 144 for transmission of an acknowledgement 138.

Associated identifiers 132 having any suitable form can be used in such examples.

In some examples, determining acknowledgements 138 to be compressed comprises determining semi-persistent downlink data resources 136 whose timing indicators 142 indicate a common uplink resource 144 for transmission of an acknowledgement 138 and who have a common associated bundle identifier.

In examples, this can be considered determining semi-persistent downlink data resources 136 whose timing indicators 142 indicate a common uplink resource 144 for transmission of an acknowledgement 138 and whose associated semi-persistent downlink data resource configurations 134 have a common associated bundle identifier.

Reference is made to FIG. 4. FIG. 4 is similar to FIG.3 and schematically illustrates a portion of the downlink data channel 151 illustrated in FIG. 3 and the associated downlink data resources 136.

The illustrated semi-persistent downlink data resource configurations 134 and associated downlink data resources 136 are as described in relation to FIG. 3.

However, in the example of FIG. 4, an uplink control channel 150 is also schematically illustrated. In the illustrated example, the uplink control channel 150 is a physical uplink control channel (PLICCH). Uplink resources 144 are indicated by rectangles in the uplink control channel 150. In the example of FIG. 4, arrows from the illustrated downlink data resources 136 to the uplink resources 144 indicate the associated timing values 142 for transmission of an acknowledgement 138 for the downlink data resources 136.

In the first downlink slot in FIG. 4, the downlink data resources 136 of configurations T and ‘3’, which as in the example of FIG. 3 have common bundle identifier T, have timing indicators 142 indicating a common uplink resource 144 for transmission of an acknowledgement 138.

This can be seen in FIG. 4 by the arrows from the rectangles marked T and ‘3’ in the first downlink slot converging at an uplink resource 144.

The acknowledgements 138 for the downlink data resources 136 having timing indicators 142 indicating a common uplink resource 144 for transmission of an acknowledgement 138 can be considered to be mapped to a common uplink resource 144.

For example, downlink data resources 136 of configurations T and ‘3’ in the first downlink slot of FIG. 4 can be considered to be mapped to a common uplink resource 144.

The terminal node 110 can determine that the acknowledgements 138 for downlink data resources 136 of configurations T and ‘3’ in the first downlink slot are to be compressed as they have a common associated bundle identifier and timing indicators 142 indicating a common uplink resource 144 for transmission of an acknowledgement 138.

Acknowledgement for downlink data resource 136 of configuration ‘2’ in the first downlink slot is not included as it does not share a common bundle identifier with configurations T and ‘3’ nor does it have a timing indicator 142 indicating a common uplink resource 144.

The situation is similar for the downlink data resources 136 of configurations T and ‘3’ in the second downlink slot of FIG. 4, the respective acknowledgements 138 being mapped to a second uplink resource 144.

However, in the example of FIG. 4, downlink data resources 136 of configurations ‘2’, ‘4’ and ‘5’, which as in the example of FIG. 3 have common bundle identifier ‘2’, also have timing indicators 142 indicating the second uplink resource 144 as a common uplink resource 144. This is illustrated in the example of FIG. 4 by the dotted arrows from the rectangles marked ‘2’, ‘4’ and ‘5’ converging at the second uplink resource 144.

With regard to the second uplink resource 144, the terminal node 110 can determine that acknowledgements 138 for downlink data resources 136 of configurations T and ‘3’ in the second downlink slot are to be compressed and that acknowledgements 138 for downlink data resources 136 of configurations ‘2’, ‘4’ and ‘5’ are to be compressed as these groups/bundles have a common associated bundle identifier and timing indicators 142 indicating a common uplink resource 144 for transmission of an acknowledgement 138.

Accordingly, in the example of FIG. 4, two separate compressed acknowledgements 140 will be transmitted using the second uplink resource 144.

In the example of FIG. 4, the first PLICCH could contain a single HARQ-ACK bit and the second PLICCH could contain two HARQ-ACK bits.

Returning to block 204 of FIG. 2, in examples determining acknowledgements 138 to be compressed comprises determining semi-persistent downlink data resources 136 whose timing indicators 142 indicate a common uplink resource 144 for transmission of an acknowledgement 138 and who have an associated identifier 132 configured to indicate compressing is allowed.

In examples this can be considered determining semi-persistent downlink data resources 136 whose timing indicators 142 indicate a common uplink resource 144 for transmission of an acknowledgement 138 and whose associated semi-persistent downlink data resource configurations have an associated identifier 132 configured to indicate compressing is allowed.

For example, referring again to FIG. 4, in examples the illustrated downlink data resources 136 could have an associated identifier 132, such as a flag, indicating that bundling is allowed rather than bundle identifiers configured to identify separate bundles.

In examples, it can be considered that the semi-persistent downlink data resource configurations 134 of the illustrated downlink data resources 136 could have an associated identifier 132, such as a flag, indicating that bundling is allowed rather than bundle identifiers configured to identify separate bundles.

In such examples, downlink data resources 136 of configurations T and ‘3’ in the first downlink slot would be grouped for compression of acknowledgements 138 as these downlink data resources 136 have a timing indicator 142 indicating a common uplink resource 144 for transmission of an acknowledgement 138 and have an associated identifier 132 configured to indicate compressing is allowed.

However, in such examples, downlink data resources 136 of configurations T and ‘3’ in the second downlink slot and also downlink data resources 136 of configurations ‘2’, ‘4’ and ‘5’ would be grouped for compression of acknowledgements 138 as these downlink data resources 136 have a timing indicator 142 indicating a common uplink resource 144 for transmission of an acknowledgement 138 and have an associated identifier 132 configured to indicate compressing is allowed.

Returning to block 204 of Fig. 2, in examples determining acknowledgements 138 to be compressed comprises determining scheduling configuration index values of the associated identifiers 132 of downlink data resources 136.

In examples, this can be considered determining scheduling configuration index values of the associated identifiers 132 of semi-persistent downlink data resource configurations 134 to which the downlink data resources 136 belong.

In examples, scheduling configuration index values can be used in any suitable way in determining acknowledgements 138 to be compressed.

For example, index values increasing or decreasing in value can be used in determining acknowledgements 138 to be compressed.

In examples, determining acknowledgements to be compressed can comprise determining the downlink data resources 136 whose associated scheduling configuration index values increase or decrease in sequence and whose associated timing indicator 142 indicates a common uplink resource 144 for transmission of an acknowledgement 138. With regard to FIG. 4, it could be determined that downlink data resources 136 for configurations T and ‘3’ in the first downlink slot have scheduling configuration index values that increase in sequence and also have timing indicators 142 that indicate a common uplink resource 144 for transmission of an acknowledgement 138.

Returning to block 204 of FIG. 2, in examples acknowledgements 138 to be compressed can be determined relative to instances of at least one reference semi-persistent downlink data resource configuration.

Any suitable number of reference semi-persistent downlink data resource configurations can be used.

In examples, semi-persistent downlink data resources 136 belonging to/configured by a reference semi-persistent downlink data resource configuration 134 can be considered reference downlink data resources 148.

Accordingly, reference downlink data resources 148 can be considered instances of a reference semi-persistent downlink data resource configuration and vice versa.

In some examples, method 200 comprises determining at least one reference semi- persistent downlink data resource configuration.

In examples, method 200 comprises determining at least one reference semi-persistent downlink data resource configuration, and determining acknowledgements 138 to be compressed comprises determining at least one semi-persistent downlink data resource 136 occurring between instances of the at least one reference semi-persistent downlink data resource configuration.

In examples, method 200 comprises determining at least one reference semi-persistent downlink data resource configuration, and determining acknowledgements 138 to be compressed comprises determining at least one semi-persistent downlink data resource 136 occurring between instances of the same at least one reference semi-persistent downlink data resource configuration.

For example, first and second different configurations 134 can be determined as reference configurations and determining acknowledgements 138 to be compressed comprises determining at least one downlink data resource 136 occurring between instances of the first reference configuration and determining at least one downlink data resource occurring between instances of the second reference configuration.

In some examples, determining acknowledgements 138 to be compressed comprises determining at least one semi-persistent downlink data resources 136 occurring between adjacent instances of the at least one reference semi-persistent downlink data resource.

In examples, this can be considered determining at least one semi-persistent downlink data resource 136 occurring between temporally adjacent instances of the at least one reference semi-persistent downlink data resource.

In examples, the at least one reference semi-persistent downlink data resource configuration can be determined in any suitable way.

For example, an indication of the at least one reference semi-persistent downlink data resource configuration can be received and/or the at least one reference semi-persistent downlink data resource configuration can be determined from available information.

Accordingly, in examples determining at least one reference semi-persistent downlink data resource configuration comprises receiving an indication of at least one reference semi- persistent downlink data resource configuration.

Any suitable indication can be used and can be received in any suitable way.

For example, the reference configuration(s) can be configured and/or indicated and/or selected as the reference configuration(s) using an information element, such as an SPS- config information element, in a radio resource control (RRC) configuration message.

For example, a parameter in SPS-config can be used to configure and/or indicate and/or select the reference configuration(s).

In some examples, determining acknowledgements 138 to be compressed comprises determining at least one semi-persistent downlink data resources 136 occurring between instances of the at least one reference semi-persistent downlink data resource configuration and whose associated semi-persistent downlink data resource configurations have a common associated bundle identifier.

In examples, this can be considered determining at least one semi-persistent downlink data resource 136 occurring between instances of the at least one reference semi-persistent downlink data resource configuration and who have a common associated bundle identifier.

In examples, it can be considered that determining at least one semi-persistent downlink data resources 136 occurring between instances of the at least one reference semi- persistent downlink data resource configuration comprises determining at least one semi- persistent downlink data resources 136 occurring between instances of the at least one reference semi-persistent downlink data resource configuration whose associated semi- persistent downlink data resource configurations have a common bundle identifier.

In examples, the common associated bundle identifier is the bundle identifier associated with the reference configuration.

Reference is made to FIG. 5. FIG. 5 is similar to FIG. 3 and FIG. 4 and schematically illustrates a portion of the downlink data channel 151 illustrated in FIG. 3 and the associated downlink data resources 136.

However, in the example of FIG. 5 configurations T, ‘3’, and ‘6’ are not present and therefore the downlink data resources 136 belonging to those configurations 134 are not illustrated.

The semi-persistent downlink data resource configurations 134 and associated downlink data resources 136 illustrated in the example of FIG. 5 are as described in relation to FIG. 3.

In the example of FIG. 5 instances of configurations ‘2’, ‘4’ and ‘5’, which as in the example of FIG. 3 have common bundle identifier ‘2’, are illustrated in the downlink data channel 151.

In the illustrated example, configuration ‘5’ is determined to be the reference semi-persistent downlink data resource configuration. Accordingly, in the example of FIG. 5, semi- persistent downlink data resources 136 of configuration ‘5’ can be considered reference semi-persistent downlink data resources 148.

Additionally, or alternatively, semi-persistent downlink data resources 136 of configuration ‘5’ can be considered instances of the reference configuration.

In the example of FIG. 5, after the first instance of configuration ‘5’, downlink data resources 136 of configurations ‘2’, ‘4’ and ‘5’ are determined to occur between instances of the reference configuration.

In the example of FIG.5, the window in which the grouping is determined is taken from the end of the instances of configuration ‘5’ as indicated by the double-headed arrow labelled 152.

However, in some examples, the window in which the grouping is determined can be taken from the start of the instances of the reference configuration.

Accordingly, in examples, semi-persistent downlink data resources 136 occurring between instances of a reference configuration can include an instance of the reference configuration.

The terminal node 110 can determine that the acknowledgements 138 for downlink data resources 136 of configurations ‘2’, ‘4’ and ‘5’, encircled by the dashed line in FIG. 5, are to be compressed as they have a common associated bundle identifier and occur between instances of the at least one reference semi-persistent downlink data resource configuration.

In the example of FIG. 5, the acknowledgements 138 for the determined group of semi- persistent downlink data resources are compressed and a compressed acknowledgement 140 transmitted using an uplink resource 144.

In the example of FIG. 5, the uplink resource 144 is a PLICCH resource. However, any suitable uplink resource(s) can be used. In the illustrated example, the PLICCH could contain a single bit of and/or representing the and/or forming the compressed acknowledgement 140, for example a single HARQ-ACK bit.

In examples, the timing for transmission of the compressed acknowledgement 140 can be determined in any suitable way.

In examples, an associated timing indicator 142 for one of the downlink data resources 136 whose acknowledgement 138 is included in the compressed acknowledgement 140 is used to indicate an uplink resource 144 to be used. See, for example, block 208.

In examples, this can be considered one of the downlink data resources 136 whose acknowledgement 138 is represented in and/or used to determine the compressed acknowledgement 140.

In the example of FIG. 5, the timing indicator 142 associated with the reference downlink data resource 136 (configuration ‘5’) is used to determine the uplink resource 144.

In some examples, the timing indicator 142 associated with the first or last received downlink data resource 136 whose acknowledgement 138 is included in the compressed acknowledgement 140 is used to indicate an uplink resource 144 to be used.

In the example of FIG. 5 downlink data resources 136 occurring before the reference configuration and between two instances of the reference configuration are grouped for compressing of acknowledgments 138.

However, in examples, downlink data resources 136 occurring after the reference configuration and between two instances of the reference configuration can be grouped for compressing of acknowledgements 138.

For example, in the example of FIG. 5, the same grouping can be achieved by using configuration ‘2’ as the reference configuration and determining downlink data resources 136 occurring after the reference configuration and between two instances of the reference configuration. Returning to block 204 of FIG. 2, in examples determining acknowledgements 138 to be compressed comprises determining at least one semi-persistent downlink data resource 136 occurring between instances of the at least one reference semi-persistent downlink data resource configuration and whose associated semi-persistent downlink data resource configurations 134 have an associated identifier 132 configured to indicate compressing is allowed.

In examples this can be considered determining at least one semi-persistent downlink data resources 136 occurring between instances of the at least one reference semi-persistent downlink data resource configuration and who have an associated identifier 132 configured to indicate compressing is allowed.

In examples, it can be considered that determining at least one semi-persistent downlink data resource 136 occurring between instances of the at least one reference semi- persistent downlink data resource configuration comprises determining at least one semi- persistent downlink data resource 136 occurring between instances of the at least one reference semi-persistent downlink data resource configuration whose associated semi- persistent downlink data resource configurations have an associated identifier configured to indicate compressing is allowed.

For example, referring again to FIG. 5, in examples the illustrated downlink data resources 136 could have an associated identifier 132, such as a flag, indicating that bundling is allowed rather than a bundle identifier configured to identify separate bundles.

With regard to FIG. 5, in such examples, the indicated downlink data resources 136 would still be grouped for compressing of acknowledgements 138, as the indicated downlink data resources 136 would occur between instances of the reference configuration and have an associated identifier configured to indicate compressing is allowed.

In examples, determining acknowledgements to be compressed comprises determining at least one semi-persistent downlink data resource 136 occurring between instances of the at least one reference semi-persistent downlink data resource configuration and determining scheduling configuration index values of the associated identifiers 132 of the semi-persistent downlink data resource configurations 134 of the determined at least one semi-persistent downlink data resource 136.

In examples, at least one reference semi-persistent downlink data resource configuration can be determined from the scheduling configuration index values of the semi-persistent downlink data resource configurations 134.

Semi-persistent downlink data resource configurations 134 can be activated and/or scheduled and/or arranged in any suitable way to allow a terminal node 110 to determine at least one reference semi-persistent downlink data resource configuration based, at least in part, on the associated scheduling configuration indexes of the configurations 134.

For example, the scheduling configuration indexes can increase or decrease in a sequence allowing, for example, at least a configuration at the end of the sequence to be determined as a reference configuration 134.

In some examples, the reference configuration can be the semi-persistent downlink data resource configuration 134 associated with the highest or lowest scheduling configuration index among downlink data resource configuration 134 configured with the same bundle identifier.

For example, with regard to FIG. 5, the scheduling configuration index values increase in sequence up to ‘5’ before reducing to ‘2’.

In examples, a terminal node 110 can determine that configuration ‘5’ is the reference configuration as it is the highest index value before the sequence repeats.

Alternatively, configuration ‘2’ can be determined as the reference configuration as it is the lowest index value in the sequence and so on.

In some examples, grouping of downlink data resources 136 for compression of acknowledgements 138 can extend beyond adjacent instances of a reference semi- persistent downlink date resource configuration 134. In examples, method 200 comprises determining a parameter, which can be represented by M, and determining acknowledgements 138 to be compressed comprises determining semi-persistent downlink data resources 136 occurring between M adjacent instances of the at least one reference semi-persistent downlink data resource configuration.

The parameter M can be considered a bundling periodicity parameter.

In examples, the parameter M can be determined in any suitable way and can have any suitable value.

In some examples, determining the parameter M comprises receiving the parameter M.

In examples, the parameter M can be transmitted to a terminal node 110 in any suitable way by the access node 120. In some examples, the value of M can be higher-layer configured, for example at RRC for a semi-persistent downlink data resource configuration.

In some examples, the value of M can be indicated in the activation DCI.

Reference is made to FIG. 6. FIG. 6 is similar to FIG. 5 and schematically illustrates a portion of the downlink data channel 151 illustrated in FIG. 3 and the associated downlink data resources 136.

However, in the example of FIG. 6 configurations ‘2’, ‘4’, ‘5’ and ‘6’ are not present and therefore the downlink data resources 136 belonging to those configurations 134 are not illustrated.

The semi-persistent downlink data resource configurations 134 and associated downlink data resources 136 illustrated in the example of FIG. 6 are as described in relation to FIG.

3.

In the example of FIG. 6 instances of configurations T and ‘3’, which as in the example of FIG. 3 have common bundle identifier T, are illustrated in the downlink data channel 151. However, any suitable bundle identifier can be used.

In the example of FIG. 6, configuration ‘3’ is determined to be the reference semi-persistent downlink data resource configuration. Accordingly, in the example of FIG. 6, semi- persistent downlink data resources 136 of configuration ‘3’ can be considered reference semi-persistent downlink data resources 148.

Additionally, or alternatively, semi-persistent downlink data resources 136 of configuration ‘3’ can be considered instances of the reference configuration.

In the example of FIG. 6, acknowledgements to be compressed can be determined as described in relation to FIG. 5, but with configuration ‘3’ being the reference configuration.

However, in the example of FIG. 6, the value of the parameter M is two and therefore the downlink data resources 136 occurring between two adjacent instances of the reference configuration are determined, as illustrated by the dashed lines encircling the determined groups for acknowledgement compression in FIG. 6.

In examples, the M adjacent instances or occasions of the reference configuration can be counted from any suitable point.

In the example of FIG. 6, the M adjacent occasions are counted from the downlink data resource 136 indicated in the activation DCI. This is illustrated in the example of FIG. 6.

In some examples, the example of FIG. 5 can be considered to be an example having the value of parameter M of one.

In examples, a semi-persistent downlink data resource configuration 134 can have a plurality of associated identifiers 132. For example, a semi-persistent downlink data resource configuration 134 can have a plurality of different associated bundle identifiers.

Reference is made to FIG. 7. FIG. 7 is similar to FIG. 4, however in the example of FIG 4 a plurality of different configurations indicated as T, ‘2’, ‘3’ and ‘4’ are illustrated.

In the illustrated example, semi-persistent downlink data resource configuration indicated having index ‘4’, has associated bundle identifier T and also associated bundle identifier ‘2’.

In the example of FIG. 7, in a first downlink slot, downlink data resources 136 of configurations T, ‘2’ and ‘4’ are grouped for compressing of acknowledgements 138 as they have a common associated bundle identifier, bundle identifier ‘1’, and have timing indicators 142 that indicate a common uplink resource 144 for transmission of an acknowledgement 138.

Furthermore, in the example of FIG. 7, in a second downlink slot, downlink data resources 136 of configurations ‘3’ and ‘4’ are grouped for compressing of acknowledgements 138 as they have a common associated bundle identifier, bundle identifier ‘2’, and have timing indicators 142 that indicate a common uplink resource 144 for transmission of an acknowledgement 138.

A semi-persistent downlink data resource configuration 134 can have a plurality of associated identifiers 132 in examples involving a reference configuration.

For example, in FIG. 7, the same grouping for compressing acknowledgements can be achieved by indicating configuration ‘4’ as a reference configuration without having the timing indicators 142 that indicate a common uplink resource 144 for transmission of an acknowledgement 138.

At block 206 method 200 comprises compressing the determined acknowledgements.

In examples, block 206 can be considered to comprise compressing and/or combining and/or bundling and/or grouping and/or reducing the determined acknowledgements.

In examples, the determined acknowledgements can be compressed and/or combined and/or bundled and/or grouped and/or reduced in any suitable way using any suitable method.

In some examples, the amount of information transmitted and/or the number of transmissions in relation to the determined acknowledgements are reduced.

In some examples, the number of bits used to represent the determined acknowledgements 138 are reduced. For example a reduction of P to N bits.

In examples, one or more logical operators can be used to compress the determined acknowledgements. In examples the type(s) of logical operator(s) used to compress the determined acknowledgements can be based, at least in part, on the type of traffic. For example, where acknowledgements are indicated by single bits, such as HARQ-ACK acknowledgements, the determined acknowledgements can be compressed using a logical OR operation.

For an example of three SPS PDSCH mapped to a common HARQ bit:

SPS PDSCH 1 : correctly received = ‘1’

SPS PDSCH2: not correctly received = ‘0’

SPS PDSCH3: correctly received = T.

Using an ‘OR’ operation to compress such acknowledgements 138 will do OR(1 ,0,1) and thus report a ‘1’ or positive ACK on the PUCCH.

Similarly, an ‘AND’ operation would result in a NACK or ‘0’ on PUCCH.

In examples ‘OR’ can be used where a single successful transmission in the determined group for compressing acknowledgements is sufficient.

In examples, ‘AND’ can be used where all transmissions in the determined group for compressing acknowledgements should be successfully received.

In examples, any suitable combination of logical operators can be used.

In examples, the terminal node 110 can receive an indication of one or multiple downlink data resources 136, such as SPS PDSCH, that are skipped or not used for transmission by the access node 120.

In such examples, the terminal node 110 can exclude the corresponding acknowledgements 138, such as HARQ bits, from the compression operation.

For an example of three SPS PDSCH mapped to a common HARQ bit:

SPS PDSCH1 : correctly received = ‘1’

SPS PDSCH2: skipped by the network node = ‘NaN’

SPS PDSCH3: correctly received = T. Using an ‘AND’ operation to compress such acknowledgements 138 will do AND(1 ,NaN,1) and thus report a T or positive ACK of compressed acknowledgements 140 on the PUCCH.

In examples, a number of bits can be used to express certain decoding outcomes. For example, 3 HARQ bits belonging to three different SPS PDSCHs can be compressed/reduced to 2 bits where the 2^A2=4 states represent certain decoding outcomes. For example, ‘1 T could express ‘all ACKs’, ‘00’ could represent ‘all NACKs’ and ‘10’ and ‘01’ could express one out of three ACKs and two out of three ACKs, respectively. In examples, block 206 can be considered to illustrate compressing the determined acknowledgements to generate and/or provide at least one compressed acknowledgement 140.

At block 208 method 200 comprises transmitting at least one compressed acknowledgement 140.

In examples, block 208 can be considered to illustrate transmitting information representing the compressed acknowledgements 140.

In examples, block 208 can be considered to illustrate transmitting the compressed acknowledgements 140.

In examples, block 208 can be considered to illustrate transmitting at least the information determined at block 206.

Consequently FIG. 2 illustrates a method 200 comprising: receiving configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; determining acknowledgements for a plurality of semi-persistent downlink data resources to be compressed based, at least in part, on the at least one associated identifiers; compressing the determined acknowledgements; and transmitting at least one compressed acknowledgement. In examples, the compressed acknowledgements 140 can be transmitted in any suitable way. For example, the compressed acknowledgements can be transmitted using any suitable uplink resource(s).

In some example, the compressed acknowledgements 140 are transmitted on PLICCH resources.

In examples, timing of the uplink resources to be used for transmitting the compressed acknowledgement(s) 140 can be based, at least in part, on one or more timing indicators 142.

For example, in examples comprising determination of timing indicators 142 indicating a common uplink resource 144, the indicated common uplink resource 144 can be used to transmit the compressed acknowledgements 140. See, for example, FIG 4 and/or FIG. 7.

For example, in examples comprising determination of at least one reference semi- persistent downlink data resource configuration, a timing indicator 142 of one of the data resources 136 whose acknowledgement is included in the compressed acknowledgements 140 can be used. See, for example, FIG. 5 and/or FIG. 6.

Accordingly, in examples, transmitting at least one compressed acknowledgement 140 comprises transmitting at least one compressed acknowledgement 140 on an uplink control channel at a time instance determined based, at least in part, on the timing indicator 142 of one of the data resources 136 whose acknowledgement is and/or has been included in the compressed acknowledgement 140.

In examples, the compressed acknowledgements 140 can be identified in any suitable way. For example, the compressed acknowledgements 140 can have any suitable associated identifier or identifiers.

In some examples, a bundle identifier can be used to identify compressed acknowledgements, for example where a plurality of compressed acknowledgements 140 are transmitted using a common uplink resource 144. See, for example, FIG. 4. In examples, the compressed acknowledgements 140 can be sorted based on increasing (or decreasing) order of bundle identifier, for examples, with respect to FIG. 4, the compressed acknowledgement 140 derived from downlink data resources 136 of configurations T and ‘3’ is placed before the compressed acknowledgement 140 from downlink data resources 136 of configurations ‘2’, ‘4’ and ‘5’, since T and ‘3’ have bundle identifier T, and configurations ‘2’, ‘4’ and ‘5’ have bundle identifier ‘2’.

In some examples, the existing HARQ-ACK codebook construction procedure in TS 38.213 Clause 9.1 is followed, where the position of the compressed acknowledgements 140 is the same as the position of the HARQ-ACK bit of one of the associated downlink data resources 136 whose acknowledgement is included in the compressed acknowledgement 140.

From the point of view of the access node, block 208 illustrates receiving at least one compressed acknowledgement 140.

Consequently, FIG. 2 illustrates a method 200 comprising: transmitting configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; transmitting information using one or more of the semi-persistent downlink data resource configurations; and receiving at least one compressed acknowledgement.

At block 210 method 200 comprises processing the at least one compressed acknowledgement 140 to determine the meaning indicated by the at least one compressed acknowledgement 140.

In examples, any suitable form of processing can be used. For example, in examples where a reduced number of bits have been used to represent the possible acknowledgement outcomes, processing the at least one compressed acknowledgement 140 using, for example, a look-up table to determine the indicated acknowledgement outcome.

In some examples, method 200 comprises determining that at least one downlink resource 136 is associated with a scheduling DCI and preventing compressing of an acknowledgement for the determined at least one downlink resource 136. This can provide certainty that the scheduling DCI has been correctly received by the terminal node 110.

Although signaling aspect involving new RRC parameters in, for example, SPS-config have been discussed, in examples it is possible to use other types of signaling in addition or alternatively. For example DCI signaling and/or MAC CE signalling.

In examples, one or more of the blocks and/or actions of FIG. 2 can be omitted. For example, block 210 can be omitted.

Examples of the disclosure provide technical benefits. For example, examples of the disclosure provide for efficient and robust methods to determine acknowledgements to be compressed.

Examples of the disclosure provide for compression of acknowledgements where it is not possible to map the downlink resources involved to a common uplink resource.

Examples of the disclosure provide for compression of acknowledgements including multiple instances of a semi-persistent downlink data resource configuration.

Examples of the disclosure provide for flexibility in mapping a downlink data resource to a plurality of groups.

FIG. 8 illustrates an example of a method 800.

In examples, the method 800 can be performed by any suitable apparatus comprising any suitable means for performing the method 800.

In examples, the method 800 is performed by a terminal node 110, such as a UE 204.

At block 802, method 800 comprises receiving configuration information 130 and at least one associated identifier 132 for a plurality of semi-persistent downlink data resource configurations 134, the at least one associated identifier 132 to enable compressing of acknowledgements 138. At block 804, method 800 comprises determining acknowledgements 138 for a plurality of semi-persistent downlink data resources 136 to be compressed based, at least in part, on the at least one associated identifier 132.

At block 806, method 800 comprises compressing the determined acknowledgements.

At block 808, method 800 comprises transmitting at least one compressed acknowledgement 140.

Consequently, FIG. 8 illustrates a method 800 comprising: receiving configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; determining acknowledgements for a plurality of semi-persistent downlink data resources to be compressed based, at least in part, on the at least one associated identifiers; compressing the determined acknowledgements; and transmitting at least one compressed acknowledgement.

FIG. 9 illustrates an example of a method 900.

In examples, the method 900 can be performed by any suitable apparatus comprising any suitable means for performing the method 900.

In examples, the method 900 is performed by an access node 120, such as a gNB 164.

At block 902, method 900 comprises transmitting configuration information 130 and a least one associated identifier 132 for a plurality of semi-persistent downlink data resource configurations 134, the at least one identifier to enable compressing of acknowledgements 138.

At block 904, method 900 comprises transmitting information using one or more of the semi- persistent downlink data resource configurations 134.

At block 906, method 900 comprises receiving at least one compressed acknowledgement 140. Consequently, FIG. 9 illustrates a method comprising: transmitting configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; transmitting information using one or more of the semi-persistent downlink data resource configurations; and receiving at least one compressed acknowledgement.

Some examples relate to 3^rd generation partnership project (3GPP) network. FIGs 10 to 14 can be considered to illustrate some such examples.

FIG. 10 illustrates an example of a method 1000.

In examples, the method 1000 can be performed by any suitable apparatus comprising any suitable means for performing the method 1000.

In examples, the method 1000 is performed by a terminal node 110, such as a UE 204.

At block 1002, method 1000 comprises receiving from the gNB configuration information related to SPS HARQ-ACK bundling, including at least one of: HARQ bundle allow, HARQ bit bundle ID, or SPS reference configuration.

At block 1004, method 1000 comprises receiving from the gNB PDSCH on a pre-configured SPS PDSCH resource.

At block 1006, method 1000 comprises determining if the PDSCH belongs to a HARQ-ACK bundle group determined based on the timing of SPS PDSCH(s) associated to reference configuration(s), or if the PDSCH is a reference PDSCH itself.

If the determination at block 1006 is positive, method 1000 proceeds to block 1008.

At block 1008, method 1000 comprises bundling into a single bit the HARQ-ACK feedback of all the SPS PDSCHs associated to the bundle. HARQ-ACK feedback is reported on a PLICCH where the timing is provided by a reference SPS PDSCH. If the determination at block 1006 is negative, method 1000 proceeds to block 1010.

At block 1010, method 1000 comprises reporting HARQ-ACK feedback on a PLICCH with timing provided by PDSCH-to-HARQ timing indicator in the activation DCI for the PDSCH reception.

FIG. 11 illustrates an example of a method 1100.

In examples, the method 1100 can be performed by any suitable apparatus comprising any suitable means for performing the method 1100.

In examples, the method 1100 is performed by a terminal node 110, such as a UE 204.

Block 1102: The UE receives from the gNB configuration on SPS HARQ-ACK bundling.

This configuration may contain at least one of HARQ bundle allow, HARQ bit bundle ID.

Block 1104: The UE receives from the gNB the SPS PDSCH and creates the related HARQ- ACK information.

Block 1106: The UE determines if the SPS PDSCH belongs to a HARQ-ACK bundle or not.

This determination is based on if one of HARQ bundle allow or HARQ bit bundle ID is configured for the SPS PDSCH configuration of the SPS PDSCH.

Based on the determination:

Block 1108: If the UE does not belong to a HARQ-ACK bundle (i.e. ‘no’), the HARQ-ACK bit for the SPS PDSCH is created to be reported as UE feedback on the associated PUCCH. Block 1110: If the UE belongs to a HARQ-ACK bundle (i.e. ‘yes’), the HARQ-ACK information will take part in the HARQ-ACK bundling operation of all the SPS PDSCHs associated with the bundle and the same PUCCH and a single 1 bit bundled HARQ-ACK for the bundle is to be reported as UE feedback.

FIG. 12 illustrates an example of a method 1200. In examples, the method 1200 can be performed by any suitable apparatus comprising any suitable means for performing the method 1200.

In examples, the method 1200 is performed by a terminal node 110, such as a UE 204.

Block 1202: The UE receives from the gNB configuration on SPS HARQ-ACK bundling.

This configuration may contain at least one of HARQ bit bundle ID, SPS reference configuration and Bundling periodicity parameter M.

Block 1202: The UE receives from the gNB the SPS PDSCH and creates the related HARQ- ACK information.

Block 1204: The UE determines if the SPS PDSCH belongs to a HARQ-ACK bundle or not.

This determination is based on configuration of a HARQ bit bundle ID for the SPS PDSCH configuration of the SPS PDSCH.

Based on the determination of block 1204:

Block 1206: If the UE does not belong to a HARQ-ACK bundle (i.e. ‘no’), the HARQ-ACK bit for the SPS PDSCH is created to be reported as UE feedback on the associated PUCCH.

If the UE belongs to a HARQ-ACK bundle (i.e. ‘yes’), the HARQ-ACK information will take part in the HARQ-ACK bundling operation and the UE moves further to Block 1208.

Block 1208: The UE determines if the SPS PDSCH is the last SPS PDSCH of a SPS PDSCH HARQ-ACK bundle.

This determination is based at least on configuration of a HARQ bit bundle ID and the SPS reference configuration for the SPS PDSCH configuration of the SPS PDSCH.

The determination can be based on the Bundling periodicity parameter M as well as the start of the bundling window given by the activation timing of the reference SPS configuration.

Based on the determination of block 1208: Block 1210: If the SPS PDSCH is not the last SPS PDSCH within the bundle (i.e. ‘No’), the UE does not create a HARQ-ACK bit for the associated PLICCH of the SPS PDSCH. The related HARQ-ACK information of the SPS PDSCH is stored for a later HARQ-ACK information bundling (depicted with a dashed line in Figure 9).

Block 121 : If the SPS PDSCH is the last SPS PDSCH within the bundle (i.e. ‘Yes’), the UE bundles the all pending HARQ-ACK feedback of the SPS PDSCHs associated to the bundle into a single bit HARQ-CK for the associated PUCCH of the SPS PDSCH.

This includes the stored related HARQ-ACK information of other SPS PDSCH within the same bundle based on block 1210.

The example of FIG. 13 is an example of compressing acknowledgements.

In FIG. 13 a UE 204 and a gNB 164 communicate across a network, such as at least a portion of network 100 of FIG. 1.

At block 1302 the gNB transmits RRC configuration of one or multiple SPS configurations and associated bundling parameters (at least one of bundle allow, bundle ID, reference configuration) to the UE 204.

At block 1304 gNB activates the multiple SPS configurations via activation DCI. DCI includes the PDSCH-to-HARQ timing indicator.

At block 1306 the UE 204 receives the SPS PDSCH and generates the associated acknowledgements.

At block 1308 the UE determines to transmit a PUCCH based on the PDSCH-to-HARQ timing indicators of the PDSCHs.

At block 1310 the UE transmits bundled HARQ-ACK feedback of all the SPS PDSCHs associated to the bundle.

The example of FIG. 14 is an example of compressing acknowledgements.

In FIG. 14 a UE 204 and a gNB 164 communicate across a network, such as at least a portion of network 100 of FIG. 1. At block 1402 the gNB 164 transmits RRC configuration of one or multiple SPS configurations and associated bundling parameters (at least one of bundle allow, bundle ID, reference configuration) to the UE 204.

At block 1404 gNB activates the multiple SPS configurations via activation DCI.

At block 1406 the UE 204 receives the SPS PDSCH and generates the associated acknowledgement.

At block 1408 UE determines SPS PDSCH resource belongs to a HARQ-ACK bundle and is not the last PDSCH of the bundle.

At block 1410 the UE 204 receives the SPS PDSCH and generates the associated acknowledgement.

At block 1412 the UE determined SPS PDSCH resource belongs to the HARQ-ACK bundle and is the last PDSCH of the bundle.

At block 1414 UE determines to transmit a PUCCH based on the PDSCH-to-HARQ timing indicator of the last PDSCH of the bundle.

At block 1416 UE transmits bundled HARQ-ACK feedback of the SPS PDSCHs associated to the bundle.

Examples of the disclosure provide technical benefits. For example, examples of the disclosure provide for efficient and flexible methods of compressing acknowledgements.

This can provide a reduction in bits to be transferred across a network and/or a reduction in the number of transmissions.

Fig 15A illustrates an example of a controller 1130. The controller 1130 can be used in an apparatus such as a network node 110, 120, such as a mobile terminal or UE and/or a gNB. Implementation of a controller 1130 may be as controller circuitry. The controller 1130 may be implemented in hardware alone, have certain aspects in software including firmware alone or can be a combination of hardware and software (including firmware). As illustrated in Fig 15A the controller 1130 may be implemented using instructions that enable hardware functionality, for example, by using executable instructions of a computer program 1136 in a general-purpose or special-purpose processor 1132 that may be stored on a computer readable storage medium (disk, memory etc.) to be executed by such a processor 1132.

The processor 1132 is configured to read from and write to the memory 1134. The processor 1132 may also comprise an output interface via which data and/or commands are output by the processor 1132 and an input interface via which data and/or commands are input to the processor 1132.

The memory 1134 stores a computer program 1136 comprising computer program instructions (computer program code) that controls the operation of the apparatus when loaded into the processor 1132. The computer program instructions, of the computer program 1136, provide the logic and routines that enables the apparatus to perform the methods illustrated in Figs 2 and/or 3 and/or 4 and/or 5 and/or 6 and/or 7 and/or 8. The processor 1132 by reading the memory 1134 is able to load and execute the computer program 1136.

The apparatus therefore comprises: at least one processor 1132; and at least one memory 1134 including computer program code the at least one memory 1134 and the computer program code configured to, with the at least one processor 1132, cause the apparatus at least to perform: receiving configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; determining acknowledgements for a plurality of semi-persistent downlink data resources to be compressed based, at least in part, on the at least one associated identifiers; compressing the determined acknowledgements; and transmitting at least one compressed acknowledgement.

The apparatus therefore comprises: at least one processor 1132; and at least one memory 1134 including computer program code the at least one memory 1134 and the computer program code configured to, with the at least one processor 1132, cause the apparatus at least to perform: transmitting configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; transmitting information using one or more of the semi-persistent downlink data resource configurations; and receiving at least one compressed acknowledgement.

As illustrated in Fig 15A, the computer program 1136 may arrive at the apparatus via any suitable delivery mechanism 1162. The delivery mechanism 1162 may be, for example, a machine-readable medium, a computer-readable medium, a non-transitory computer- readable storage medium, a computer program product, a memory device, a record medium such as a Compact Disc Read-Only Memory (CD-ROM) or a Digital Versatile Disc (DVD) or a solid-state memory, an article of manufacture that comprises or tangibly embodies the computer program 1136. The delivery mechanism may be a signal configured to reliably transfer the computer program 1136. The apparatus may propagate or transmit the computer program 1136 as a computer data signal.

Computer program instructions for causing an apparatus to perform at least the following or for performing at least the following: receiving configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; determining acknowledgements for a plurality of semi-persistent downlink data resources to be compressed based, at least in part, on the at least one associated identifiers; compressing the determined acknowledgements; and transmitting at least one compressed acknowledgement.

Computer program instructions for causing an apparatus to perform at least the following or for performing at least the following: transmitting configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; transmitting information using one or more of the semi-persistent downlink data resource configurations; and receiving at least one compressed acknowledgement.

The computer program instructions may be comprised in a computer program, a non- transitory computer readable medium, a computer program product, a machine-readable medium. In some but not necessarily all examples, the computer program instructions may be distributed over more than one computer program.

Although the memory 1134 is illustrated as a single component/circuitry it may be implemented as one or more separate components/circuitry some or all of which may be integrated/removable and/or may provide permanent/semi-permanent/ dynamic/cached storage.

In examples the memory 1134 comprises a random-access memory 1158 and a read only memory 1160. In examples the computer program 1136 can be stored in the read only memory 1158. See, for example, Fig. 15B

In some examples the memory 1134 can be split into random access memory 1158 and read only memory 1160.

Although the processor 1132 is illustrated as a single component/circuitry it may be implemented as one or more separate components/circuitry some or all of which may be integrated/removable. The processor 1132 may be a single core or multi-core processor.

References to ‘computer-readable storage medium’, ‘computer program product’, ‘tangibly embodied computer program’ etc. or a ‘controller’, ‘computer’, ‘processor’ etc. should be understood to encompass not only computers having different architectures such as single /multi- processor architectures and sequential (Von Neumann)/parallel architectures but also specialized circuits such as field-programmable gate arrays (FPGA), application specific circuits (ASIC), signal processing devices and other processing circuitry. References to computer program, instructions, code etc. should be understood to encompass software for a programmable processor or firmware such as, for example, the programmable content of a hardware device whether instructions for a processor, or configuration settings for a fixed-function device, gate array or programmable logic device etc. As used in this application, the term ‘circuitry’ may refer to one or more or all of the following:

(a) hardware-only circuitry implementations (such as implementations in only analog and/or digital circuitry) and

(b) combinations of hardware circuits and software, such as (as applicable):

(i) a combination of analog and/or digital hardware circuit(s) with software/firmware and

(ii) any portions of hardware processor(s) with software (including digital signal processor(s)), software, and memory(ies) that work together to cause an apparatus, such as a mobile phone or server, to perform various functions and

(c) hardware circuit(s) and or processor(s), such as a microprocessor(s) or a portion of a microprocessor(s), that requires software (e.g. firmware) for operation, but the software may not be present when it is not needed for operation.

This definition of circuitry applies to all uses of this term in this application, including in any claims. As a further example, as used in this application, the term circuitry also covers an implementation of merely a hardware circuit or processor and its (or their) accompanying software and/or firmware. The term circuitry also covers, for example and if applicable to the particular claim element, a baseband integrated circuit for a mobile device or a similar integrated circuit in a server, a cellular network device, or other computing or network device.

The blocks illustrated in the Figs 2 and/or 8 and/or 9 and/or 10 and/or 12 and/or 13 and/or 14 may represent steps in a method and/or sections of code in the computer program 1136. The illustration of a particular order to the blocks does not necessarily imply that there is a required or preferred order for the blocks and the order and arrangement of the block may be varied. Furthermore, it may be possible for some blocks to be omitted.

Where a structural feature has been described, it may be replaced by means for performing one or more of the functions of the structural feature whether that function or those functions are explicitly or implicitly described.

Thus, the apparatus can, in examples, comprise means for: receiving configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; determining acknowledgements for a plurality of semi-persistent downlink data resources to be compressed based, at least in part, on the at least one associated identifiers; compressing the determined acknowledgements; and transmitting at least one compressed acknowledgement.

Thus, the apparatus can, in examples, comprise means for: transmitting configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; transmitting information using one or more of the semi-persistent downlink data resource configurations; and receiving at least one compressed acknowledgement.

In examples, an apparatus can comprise means for performing one or more methods, or at least part of one or more methods, as disclosed herein.

In examples, an apparatus can be configured to perform one or more methods, or at least part of one or more methods, as disclosed herein.

The above-described examples find application as enabling components of: automotive systems; telecommunication systems; electronic systems including consumer electronic products; distributed computing systems; media systems for generating or rendering media content including audio, visual and audio visual content and mixed, mediated, virtual and/or augmented reality; personal systems including personal health systems or personal fitness systems; navigation systems; user interfaces also known as human machine interfaces; networks including cellular, non-cellular, and optical networks; ad-hoc networks; the internet; the internet of things; virtualized networks; and related software and services.

The term ‘comprise’ is used in this document with an inclusive not an exclusive meaning. That is any reference to X comprising Y indicates that X may comprise only one Y or may comprise more than one Y. If it is intended to use ‘comprise’ with an exclusive meaning then it will be made clear in the context by referring to “comprising only one...” or by using “consisting”. In this description, reference has been made to various examples. The description of features or functions in relation to an example indicates that those features or functions are present in that example. The use of the term ‘example’ or ‘for example’ or ‘can’ or ‘may’ in the text denotes, whether explicitly stated or not, that such features or functions are present in at least the described example, whether described as an example or not, and that they can be, but are not necessarily, present in some of or all other examples. Thus ‘example’, ‘for example’, ‘can’ or ‘may’ refers to a particular instance in a class of examples. A property of the instance can be a property of only that instance or a property of the class or a property of a sub-class of the class that includes some but not all of the instances in the class. It is therefore implicitly disclosed that a feature described with reference to one example but not with reference to another example, can where possible be used in that other example as part of a working combination but does not necessarily have to be used in that other example.

Although examples have been described in the preceding paragraphs with reference to various examples, it should be appreciated that modifications to the examples given can be made without departing from the scope of the claims.

Features described in the preceding description may be used in combinations other than the combinations explicitly described above.

Although functions have been described with reference to certain features, those functions may be performable by other features whether described or not.

Although features have been described with reference to certain examples, those features may also be present in other examples whether described or not.

The term ‘a’ or ‘the’ is used in this document with an inclusive not an exclusive meaning. That is any reference to X comprising a/the Y indicates that X may comprise only one Y or may comprise more than one Y unless the context clearly indicates the contrary. If it is intended to use ‘a’ or ‘the’ with an exclusive meaning then it will be made clear in the context. In some circumstances the use of ‘at least one’ or ‘one or more’ may be used to emphasis an inclusive meaning but the absence of these terms should not be taken to infer any exclusive meaning. The presence of a feature (or combination of features) in a claim is a reference to that feature or (combination of features) itself and also to features that achieve substantially the same technical effect (equivalent features). The equivalent features include, for example, features that are variants and achieve substantially the same result in substantially the same way. The equivalent features include, for example, features that perform substantially the same function, in substantially the same way to achieve substantially the same result.

In this description, reference has been made to various examples using adjectives or adjectival phrases to describe characteristics of the examples. Such a description of a characteristic in relation to an example indicates that the characteristic is present in some examples exactly as described and is present in other examples substantially as described.

Whilst endeavoring in the foregoing specification to draw attention to those features believed to be of importance, it should be understood that the Applicant may seek protection via the claims in respect of any patentable feature or combination of features hereinbefore referred to and/or shown in the drawings whether or not emphasis has been placed thereon. l/we claim:

Claims

1. An apparatus comprising at least one processor; and at least one memory including computer program code; the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to perform: receiving configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; determining acknowledgements for a plurality of semi-persistent downlink data resources to be compressed based, at least in part, on the at least one associated identifiers; compressing the determined acknowledgements; and transmitting at least one compressed acknowledgement.

2. An apparatus as claimed in claim 1 , wherein the at least one associated identifier comprises one or more of: an indicator configured to indicate compressing is allowed, a bundle identifier and a scheduling configuration index.

3. An apparatus as claimed in claim 1 or 2, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to perform: receiving, for the plurality of semi-persistent downlink data resource configurations, a timing indicator for uplink transmission of an acknowledgment, and wherein determining acknowledgements to be compressed comprises determining based, at least in part, on the one or more timing indicators, semi-persistent downlink data resources whose timing indicators indicate a common uplink resource for transmission of an acknowledgement.

4. An apparatus as claimed in claim 3, wherein determining acknowledgements to be compressed comprises determining semi-persistent downlink data resources whose timing indicators indicate a common uplink resource for transmission of an acknowledgement and who have a common associated bundle identifier.

5. An apparatus as claimed in claim 3, wherein determining acknowledgements to be compressed comprises determining semi-persistent downlink data resources whose timing indicators indicate a common uplink resource for transmission of an acknowledgement and who have an associated identifier configured to indicate compressing is allowed.

6. An apparatus as claimed in claim 1 or 2, the at least one memory and computer program code configured to, with the at least one processor, cause the apparatus at least to perform: determining at least one reference semi-persistent downlink data resource configuration, wherein determining acknowledgements to be compressed comprises determining at least one semi-persistent downlink data resource occurring between instances of the at least one reference semi-persistent downlink data resource configuration.

7. An apparatus as claimed in claim 6, wherein determining at least one reference semi-persistent downlink data resource configuration comprises receiving an indication of at least one reference semi-persistent downlink data resource configuration.

8. An apparatus as claimed in claim 6 or 7, wherein determining at least one semi- persistent downlink data resource occurring between instances of the at least one reference semi-persistent downlink data resource configuration comprises determining at least one semi-persistent downlink data resource occurring between instances of the at least one reference semi-persistent downlink data resource configuration whose associated semi- persistent downlink data resource configurations have a common associated bundle identifier.

9. An apparatus as claimed in claim 6 or 7, wherein determining at least one semi- persistent downlink data resource occurring between instances of the at least one reference semi-persistent downlink data resource configuration comprises determining at least one semi-persistent downlink data resource occurring between instances of the at least one reference semi-persistent downlink data resource configuration whose associated semi- persistent downlink data resource configurations have an associated identifier configured to indicate compressing is allowed.

10. An apparatus as claimed in claim 6 or 7, wherein determining acknowledgements to be compressed comprises determining at least one semi-persistent downlink data resource occurring between instances of the at least one reference semi-persistent downlink data resource configuration and determining scheduling configuration index values of the associated identifiers of the semi-persistent downlink data resource configurations of the determined at least one semi-persistent downlink data resource.

11. An apparatus as claimed in any of claims 6 to 10, wherein determining acknowledgements to be compressed comprises determining at least one semi-persistent downlink data resource occurring between adjacent instances of the at least one reference semi-persistent downlink data resource configuration.

12. An apparatus as claimed in any of claims 6 to 11 , the at least one memory and computer program code configured to, with the at least one processor, cause the apparatus at least to perform: determining a parameter M, and wherein determining acknowledgements to be compressed comprises determining at least one semi-persistent downlink data resource occurring between M adjacent instances of the at least one reference semi-persistent downlink data resource configuration.

13. An apparatus as claimed in claim 12, wherein determining the parameter M comprises receiving the parameter M.

14. An apparatus as claimed in any of claims 6 to 13, wherein transmitting the at least one compressed acknowledgement comprises transmitting at least one compressed acknowledgement on an uplink control channel at a time instance determined based, at least in part, on the timing indicator of one of the data resources whose acknowledgement is included in the compressed acknowledgements.

15. An apparatus as claimed in any preceding claim, the at least one memory and computer program code configured to, with the at least one processor, cause the apparatus at least to perform: determining that at least one downlink resource is associated with a scheduling DCI and preventing compressing of an acknowledgement for the determined at least one downlink resource.

16. A method comprising: receiving configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; determining acknowledgements for a plurality of semi-persistent downlink data resources to be compressed based, at least in part, on the at least one associated identifiers; compressing the determined acknowledgements; and transmitting at least one compressed acknowledgement.

17. A method as claimed in claim 16, the method comprising: receiving, for the plurality of semi-persistent downlink data resource configurations, a timing indicator for uplink transmission of an acknowledgment, and wherein determining acknowledgements to be compressed comprises determining based, at least in part, on the one or more timing indicators, semi-persistent downlink data resources whose timing indicators indicate a common uplink resource for transmission of an acknowledgement.

18. A method as claimed in claim 16 comprising: determining at least one reference semi-persistent downlink data resource configuration, wherein determining acknowledgements to be compressed comprises determining at least one semi-persistent downlink data resource occurring between instances of the at least one reference semi-persistent downlink data resource configuration.

19. A computer program comprising instructions for causing an apparatus to perform at least the following: receiving configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; determining acknowledgements for a plurality of semi-persistent downlink data resources to be compressed based, at least in part, on the at least one associated identifiers; compressing the determined acknowledgements; and transmitting at least one compressed acknowledgement.

20. A computer program as claimed in claim 19, wherein the at least one associated identifier comprises one or more of: an indicator configured to indicate compressing is allowed, a bundle identifier and a scheduling configuration index.

21. A computer program as claimed in claim 19 or 20, the computer program stored on a non-transitory computer readable medium.

22. An apparatus comprising means for performing, at least: receiving configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; determining acknowledgements for a plurality of semi-persistent downlink data resources to be compressed based, at least in part, on the at least one associated identifiers; compressing the determined acknowledgements; and transmitting at least one compressed acknowledgement.

23. An apparatus comprising at least one processor; and at least one memory including computer program code; the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to perform: transmitting configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; transmitting information using one or more of the semi-persistent downlink data resource configurations; and receiving at least one compressed acknowledgement.

24. An apparatus as claimed in claim 23, the at least one memory and computer program code configured to, with the at least one processor, cause the apparatus at least to perform: processing the at least one compressed acknowledgement to determine the meaning indicated by the at least one compressed acknowledgement.

25. An apparatus as claimed in claim 23 or 24, wherein the at least one associated identifier comprises one or more of: an indicator configured to indicate compressing is allowed, a bundle identifier and a scheduling configuration index.

26. An apparatus comprising means for performing, at least: transmitting configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; transmitting information using one or more of the semi-persistent downlink data resource configurations; and receiving at least one compressed acknowledgement.

27. A method comprising: transmitting configuration information and at least one associated identifier for a plurality of semi-persistent downlink data resource configurations, the at least one associated identifier to enable compressing of acknowledgements; transmitting information using one or more of the semi-persistent downlink data resource configurations; and receiving at least one compressed acknowledgement.