Some content of this application is unavailable at the moment.
If this situation persist, please contact us atFeedback&Contact
1. (WO2019029825) INDICATING UE CAPABILITY WITH SHORT TTI
Note: Text based on automatic Optical Character Recognition processes. Please use the PDF version for legal matters

Claims:

1. Apparatus, comprising at least one processor, at least one memory including computer program code, and the at least one processor, with the at least one memory and the computer program code, being arranged to cause the apparatus to at least perform

estimating a future instantaneously required processing effort required by a terminal to process symbols received in at least one first transmission time interval and at least one second transmission time interval;

checking if the estimated future instantaneously required processing effort exceeds a capability of the terminal to process the symbols;

modifying a future scheduling of the symbols for the terminal if the future instantaneously required processing effort exceeds the capability; wherein

each of the first transmission time intervals comprises not more than a first maximum possible number of the symbols;

each of the second transmission time intervals comprises not more than a second maximum possible number of the symbols; and at least one of:

the first maximum possible number is larger than the second maximum possible number, and

a second processing interval required to finalize the processing of the respective symbols of each of the second transmission time intervals is shorter than a first processing interval required to finalize the processing of the respective symbols of each of the first transmission time intervals.

2. The apparatus according to claim 1 , wherein

the first maximum possible number is larger than the second maximum possible number;

a scaling factor indicates a ratio of a second processing requirement required by the terminal to process the symbols of one of the second transmission time intervals to a first processing requirement required by the terminal to process the symbols of one of the first transmission time intervals; and

the estimating of the future instantaneously required processing effort is based on the scaling factor.

3. The apparatus according to any of claims 1 to 2, wherein

a first delay indicates how long a start of the processing of the symbols of each of the first transmission time intervals after the respective first transmission time interval is delayed by the terminal;

a second delay indicates how long a start of the processing of the symbols of each of the second transmission time intervals after the respective second transmission time interval is delayed by the terminal; and

the estimating of the maximum required processing effort is based on the respective at least one of the first delay and the second delay.

4. The apparatus according to any of claims 1 to 3, wherein the estimating comprises

calculating the future instantaneously required processing effort Ψ at a time of an ith second transmission time interval sTTI i based on the following pseudo-code:

• If PDSCH is scheduled in sTTI i for the terminal

o Ψ(ί + δΤΤΙ: i + KTTI + δΤΤΙ) = Ψ(ί + δΤΤΙ: i + KTTI + δΤΤΙ) +—— sTTI

κττι

ο £ = £ + NST77

• If sPDSCH is scheduled in sTTI i for the terminal

o Ψ(ί +

o £ = £ + 1

• If nothing is scheduled in sTTI i for the terminal

o £ = £ + 1

sPDSCH denotes symbols of the symbols scheduled in any of the second transmission time intervals;

PDSCH denotes symbols of the symbols scheduled in any of the first transmission time intervals;

NsTTI is a ratio of the first maximum possible number to the second maximum possible number;

KTT1 is a first processing interval for processing the symbols of one of the first transmission time intervals in number of the second transmission time intervals;

KsTT1 is a second processing interval for processing the symbols of the second transmission time interval in number of second transmission time intervals;

Πττι is an instanteneous processing requirement for the processing of scheduled PDSCH of the first transmission time intervals normalized by the maximum possible instantaneous processing requirement for the processing of any scheduled PDSCH of the first transmission time intervals;

risTTi is an instanteneous processing requirement for the processing of scheduled sPDSCH of the second transmission time intervals normalized by the maximum possible

instantaneous processing requirement for the processing of any scheduled PDSCH of the first transmission time intervals;

p is a scaling factor indicating a ratio of a second processing requirement required by the terminal to process the symbols of one of the second transmission time intervals to a first processing requirement required by the terminal to process the symbols of one of the first transmission time intervals;

δττι is a first delay indicating how long a start of the processing of the symbols of each of the first transmission time intervals after the respective first transmission time interval is delayed by the terminal;

5STTI is a second delay indicating how long a start of the processing of the symbols of each of the second transmission time intervals after the respective second transmission time interval is delayed by the terminal.

5. The apparatus according to any of claims 1 to 4, wherein the at least one processor, with the at least one memory and the computer program code, being arranged to cause the apparatus to further perform

instructing to schedule the symbols for the terminal into at least one of one or more first transmission time intervals and one or more second transmission time intervals if the estimated future instantaneously required processing effort does not exceed the capability.

6. The apparatus according to any of claims 1 to 5, wherein,

if the terminal is capable to receive the symbols over plural aggregated carriers, the at least one processor, with the at least one memory and the computer program code, being arranged to cause the apparatus to further perform the estimating, checking, and inhibiting separately for each of the carriers.

7. The apparatus according to any of claims 1 to 5, wherein,

if the terminal is capable to receive the symbols over plural aggregated carriers, the at least one processor, with the at least one memory and the computer program code, being arranged to cause the apparatus to further perform the estimating, checking, and inhibiting for an aggregated capacity of the carriers.

8. The apparatus according to any of claims 1 to 7, wherein the at least one processor, with the at least one memory and the computer program code, being arranged to cause the apparatus to further perform

receiving, from the terminal, at least one of

• an indication of the capability;

• if dependent on claim 2, an indication of the scaling factor;

• if dependent on claim 3, an indication of the first delay; and,

• if dependent on claim 3, an indication of the second delay.

9. The apparatus according to any of claims 1 to 8, wherein

the symbols are scheduled in a sequence of the first transmission time intervals and the second transmission time intervals,

at least once in the sequence one of the second transmission time intervals follows after one of the first transmission time intervals; and the at least one processor, with the at least one memory and the computer program code, being arranged to cause the apparatus to further perform

inhibiting the estimating if the estimating would not include an instantaneous processing requirement to process the symbols of the one of the second transmission time intervals and an instantaneous processing requirement to process the symbols of the one of the first transmission time intervals.

10. Apparatus, comprising at least one processor, at least one memory including computer program code, and the at least one processor, with the at least one memory and the computer program code, being arranged to cause the apparatus to at least perform

informing a base station on at least one of a capability of a terminal to process symbols received within a predefined time interval in at least one first transmission time interval and at least one second transmission time interval, a scaling factor p, a first delay δττι, and a second delay 5sTTI; wherein

each of the first transmission time intervals comprises not more than a first maximum possible number of the symbols;

each of the second transmission time intervals comprises not more than a second maximum possible number of the symbols; and at least one of:

the first maximum possible number is larger than the second maximum possible number, and

a second processing interval required to finalize the processing of the respective symbols of each of the second transmission time intervals is shorter than a first processing interval required to finalize the processing of the respective symbols of each of the second transmission time intervals;

the scaling factor p indicates a ratio of a second processing requirement required by the terminal to process the symbols of one of the second transmission time intervals to a first processing requirement required by the terminal to process the symbols of one of the first transmission time intervals if the first maximum possible number is larger than the second maximum possible number;

the first delay δττι indicates how long a start of the processing of the symbols of each of the first transmission time intervals after the respective first transmission time interval is delayed by the terminal;

the second delay 5sTTI indicates how long a start of the processing of the symbols of each of the second transmission time intervals after the respective second transmission time interval is delayed by the terminal.

1 1. The apparatus according to claim 10, wherein the at least one processor, with the at least one memory and the computer program code, being arranged to cause the apparatus to at least perform

calculating an instantaneously required processing effort Ψ at a time of an ith second transmission time interval sTTI i based on the following pseudo-code:

• If PDSCH is received in sTTI i by the terminal

o Ψ(ί + δΤΤΙ: i + KTTI + δΤΤΙ) = Ψ(ί + δΤΤΙ: i + KTTI + δΤΤΙ) +—— sTTI

Κττι

ο £ = £ + NST77

• If sPDSCH is received in sTTI i by the terminal

o Ψ(ί +

o £ = £ + 1

• If nothing is received in sTTI i by the terminal

o £ = £ + 1

checking if the instantaneously required processing effort exceeds the capability; discarding the processing of the symbols of at least one of the first transmission time intervals if the instantaneously required processing effort exceeds the capability; wherein sPDSCH denotes symbols of the symbols received in any of the second transmission time intervals;

PDSCH denotes symbols of the symbols received in any of the first transmission time intervals;

NsTTI is a ratio of the first maximum possible number to the second maximum possible number;

KTT1 is a first processing interval for processing the symbols of one of the first transmission time intervals in number of the second transmission time intervals;

KsTT1 is a second processing interval for processing the symbols of the second transmission time interval in number of second transmission time intervals;

Πττι is an instantaneous processing requirement for the processing of received PDSCH of the first transmission time intervals normalized by the maximum possible instantaneous processing requirement for the processing of any received PDSCH of the first transmission time intervals;

risTTi is an instantaneous processing requirement for the processing of received sPDSCH of the second transmission time intervals normalized by the maximum possible instantaneous processing requirement for the processing of any received PDSCH of the first transmission time intervals.

12. The apparatus according to any of claims 10 and 1 1 , wherein the capability of the terminal ΨυΕ fulfills at least one of the following conditions:

ψ Tnom <- ψ τυΕ <— ψ ττηαχ

ψnom,s„T„TI,<— ψU„E„ <— ψmax

wherein

ΨΠΟΓΤΙ denotes an instantaneously required processing effort to process the symbols if the symbols are received only in first transmission time intervals;

denotes an instantaneously required processing effort to process the symbols if the symbols are received only in second transmission time intervals; and

ΨΓΤΙ3Χ denotes a maximum instantaneously required processing effort to process the symbols if, after the symbols are received only in first transmission time intervals, the symbols are received only in second transmission time intervals.

13. The apparatus according to claim 12 dependent on claim 1 1 , wherein the maximum required processing effort
is estimated based on the following formulas:

max ~

TT1 —

½

14. The apparatus according to any of claims 10 to 13, wherein the at least one processor, with the at least one memory and the computer program code, being arranged to cause the apparatus to further perform

normalizing the capability by one of ΨΠΟΓΠ,
to obtain a normalized capability, wherein

the base station is informed on the normalized capability;

ΨηοΓπ denotes a maximum instantaneously required processing effort to process the symbols if the symbols are received only in first transmission time intervals;

denotes a maximum instantaneously required processing effort to process the symbols if the symbols are received only in second transmission time intervals; and

ΨΓΤΙ3Χ denotes a maximum instantaneously required processing effort to process the symbols if, after the symbols are received only in first transmission time intervals, the symbols are received only in second transmission time intervals.

1 5. The apparatus according to any of claims 1 0 to 1 3, wherein the at least one processor, with the at least one memory and the computer program code, being arranged to cause the apparatus to further perform

calculating an excess capability based on the capability,
and one of ΨΠΟΓΠ and ΨΠΟΓΤΙ,3ΤΤΙ, wherein

the excess capability is 0% if the capability is the one of ΨΠΟΓΠ and

the excess capability is 1 00% if the capability is ΨΓ^Χ,

the excess capability is calculated by linear interpolation between the one of ΨΠΟΓΠ and ΨηοΓπ,3ττι and ΨΓΤΙ3Χ if the capability is between the one of ΨΠΟΓΠ and

the base station is informed on the excess capability;

ΨηοΓπ denotes a maximum instantaneously required processing effort to process the symbols if the symbols are received only in first transmission time intervals;

denotes a maximum instantaneously required processing effort to process the symbols if the symbols are received only in second transmission time intervals; and

ΨΓΤΙ3Χ denotes a maximum instantaneously required processing effort to process the symbols if, after the symbols are received only in first transmission time intervals, the symbols are received only in second transmission time intervals.

1 6. Method, comprising

estimating a future instantaneously required processing effort required by a terminal to process symbols received in at least one first transmission time interval and at least one second transmission time interval;

checking if the estimated future instantaneously required processing effort exceeds a capability of the terminal to process the symbols;

modifying a future scheduling of the symbols for the terminal if the future instantaneously required processing effort exceeds the capability; wherein

each of the first transmission time intervals comprises not more than a first maximum possible number of the symbols;

each of the second transmission time intervals comprises not more than a second maximum possible number of the symbols; and at least one of:

the first maximum possible number is larger than the second maximum possible number, and

a second processing interval required to finalize the processing of the respective symbols of each of the second transmission time intervals is shorter than a first processing interval required to finalize the processing of the respective symbols of each of the first transmission time intervals.

17. The method according to claim 16, wherein

the first maximum possible number is larger than the second maximum possible number;

a scaling factor indicates a ratio of a second processing requirement required by the terminal to process the symbols of one of the second transmission time intervals to a first processing requirement required by the terminal to process the symbols of one of the first transmission time intervals; and

the estimating of the future instantaneously required processing effort is based on the scaling factor.

18. The method according to any of claims 16 to 17, wherein

a first delay indicates how long a start of the processing of the symbols of each of the first transmission time intervals after the respective first transmission time interval is delayed by the terminal;

a second delay indicates how long a start of the processing of the symbols of each of the second transmission time intervals after the respective second transmission time interval is delayed by the terminal; and

the estimating of the maximum required processing effort is based on the respective at least one of the first delay and the second delay.

19. The method according to any of claims 16 to 18, wherein the estimating comprises

calculating the future instantaneously required processing effort Ψ at a time of an ith second transmission time interval sTTI i based on the following pseudo-code:

• If PDSCH is scheduled in sTTI i for the terminal

o Ψ(ί + δΤΤΙ: i + KTTI + δΤΤΙ) = Ψ(ί + δΤΤΙ: i + KTTI + δΤΤΙ) +—— sTTI

κττι

ο i = i + NST77

• If sPDSCH is scheduled in sTTI i for the terminal

o Ψ(ί +

o i = i + 1

• If nothing is scheduled in sTTI i for the terminal

o i = i + 1

sPDSCH denotes symbols of the symbols scheduled in any of the second transmission time intervals;

PDSCH denotes symbols of the symbols scheduled in any of the first transmission time intervals;

NsTTI is a ratio of the first maximum possible number to the second maximum possible number;

KTT1 is a first processing interval for processing the symbols of one of the first transmission time intervals in number of the second transmission time intervals;

KsTT1 is a second processing interval for processing the symbols of the second transmission time interval in number of second transmission time intervals;

Πττι is an instanteneous processing requirement for the processing of scheduled PDSCH of the first transmission time intervals normalized by the maximum possible instantaneous processing requirement for the processing of any scheduled PDSCH of the first transmission time intervals;

risTTi is an instanteneous processing requirement for the processing of scheduled sPDSCH of the second transmission time intervals normalized by the maximum possible instantaneous processing requirement for the processing of any scheduled PDSCH of the first transmission time intervals;

p is a scaling factor indicating a ratio of a second processing requirement required by the terminal to process the symbols of one of the second transmission time intervals to a first processing requirement required by the terminal to process the symbols of one of the first transmission time intervals;

δττι is a first delay indicating how long a start of the processing of the symbols of each of the first transmission time intervals after the respective first transmission time interval is delayed by the terminal;

5STTI is a second delay indicating how long a start of the processing of the symbols of each of the second transmission time intervals after the respective second transmission time interval is delayed by the terminal.

20. The method according to any of claims 16 to 19, further comprising

instructing to schedule the symbols for the terminal into at least one of one or more first transmission time intervals and one or more second transmission time intervals if the estimated future instantaneously required processing effort does not exceed the capability.

21. The method according to any of claims 16 to 20, wherein,

if the terminal is capable to receive the symbols over plural aggregated carriers, the method comprises

performing the estimating, checking, and inhibiting separately for each of the carriers.

22. The method according to any of claims 16 to 20, wherein,

if the terminal is capable to receive the symbols over plural aggregated carriers, the method comprises

performing the estimating, checking, and inhibiting for an aggregated capacity of the carriers.

23. The method according to any of claims 16 to 22, further comprising

receiving, from the terminal, at least one of

• an indication of the capability;

• if dependent on claim 17, an indication of the scaling factor;

• if dependent on claim 18, an indication of the first delay; and,

• if dependent on claim 18, an indication of the second delay.

24. The method according to any of claims 16 to 23, wherein

the symbols are scheduled in a sequence of the first transmission time intervals and the second transmission time intervals,

at least once in the sequence one of the second transmission time intervals follows after one of the first transmission time intervals; and the method further comprises

inhibiting the estimating if the estimating would not include an instantaneous processing requirement to process the symbols of the one of the second transmission time intervals and an instantaneous processing requirement to process the symbols of the one of the first transmission time intervals.

25. Method, comprising

informing a base station on at least one of a capability of a terminal to process symbols received within a predefined time interval in at least one first transmission time interval and at least one second transmission time interval, a scaling factor p, a first delay δπι, and a second delay 5sTTI; wherein

each of the first transmission time intervals comprises not more than a first maximum possible number of the symbols;

each of the second transmission time intervals comprises not more than a second maximum possible number of the symbols; and at least one of:

the first maximum possible number is larger than the second maximum possible number, and

a second processing interval required to finalize the processing of the respective symbols of each of the second transmission time intervals is shorter than a first processing interval required to finalize the processing of the respective symbols of each of the second transmission time intervals;

the scaling factor p indicates a ratio of a second processing requirement required by the terminal to process the symbols of one of the second transmission time intervals to a first processing requirement required by the terminal to process the symbols of one of the first transmission time intervals if the first maximum possible number is larger than the second maximum possible number;

the first delay δττι indicates how long a start of the processing of the symbols of each of the first transmission time intervals after the respective first transmission time interval is delayed by the terminal;

the second delay 5sTTI indicates how long a start of the processing of the symbols of each of the second transmission time intervals after the respective second transmission time interval is delayed by the terminal.

26. The method according to claim 25, further comprising

calculating an instantaneously required processing effort Ψ at a time of an ith second transmission time interval sTTI i based on the following pseudo-code:

• If PDSCH is received in sTTI i by the terminal

o Ψ(ί + δΤΤΙ: i + KTTI + δΤΤΙ) = Ψ(ί + δΤΤΙ: i + KTTI + δΤΤΙ) +—— sTTI

Κττι

ο £ = £ + NST77

• If sPDSCH is received in sTTI i by the terminal

o Ψ(ί +

o £ = £ + 1

• If nothing is received in sTTI i by the terminal

o £ = £ + 1

checking if the instantaneously required processing effort exceeds the capability; discarding the processing of the symbols of at least one of the first transmission time intervals if the instantaneously required processing effort exceeds the capability; wherein sPDSCH denotes symbols of the symbols received in any of the second transmission time intervals;

PDSCH denotes symbols of the symbols received in any of the first transmission time intervals;

NsTTI is a ratio of the first maximum possible number to the second maximum possible number;

KTT1 is a first processing interval for processing the symbols of one of the first transmission time intervals in number of the second transmission time intervals;

KsTT1 is a second processing interval for processing the symbols of the second transmission time interval in number of second transmission time intervals;

Πττι is an instantaneous processing requirement for the processing of received PDSCH of the first transmission time intervals normalized by the maximum possible instantaneous processing requirement for the processing of any received PDSCH of the first transmission time intervals;

risTTi is an instantaneous processing requirement for the processing of received sPDSCH of the second transmission time intervals normalized by the maximum possible instantaneous processing requirement for the processing of any received PDSCH of the first transmission time intervals.

27. The method according to any of claims 25 and 26, wherein the capability of the terminal ΨυΕ fulfills at least one of the following conditions:

ψ Tnom <- ψ τυΕ <— ψ ττηαχ

ψnom,s„T„TI,<— ψU„E„ <— ψmax

wherein

ΨΠΟΓΤΙ denotes an instantaneously required processing effort to process the symbols if the symbols are received only in first transmission time intervals;

denotes an instantaneously required processing effort to process the symbols if the symbols are received only in second transmission time intervals; and

ΨΓΤΙ3Χ denotes a maximum instantaneously required processing effort to process the symbols if, after the symbols are received only in first transmission time intervals, the symbols are received only in second transmission time intervals.

28. The method according to claim 27 dependent on claim 26, wherein the maximum required processing effort ΨΓΤ13Χ is estimated based on the following formulas:

Ψ T max

29. The method according to any of claims 25 to 28, further comprising

normalizing the capability by one of ΨΠΟΓΠ,
to obtain a normalized capability, wherein

the base station is informed on the normalized capability;

ΨηοΓπ denotes a maximum instantaneously required processing effort to process the symbols if the symbols are received only in first transmission time intervals;

denotes a maximum instantaneously required processing effort to process the symbols if the symbols are received only in second transmission time intervals; and

ΨΓΤΙ3Χ denotes a maximum instantaneously required processing effort to process the symbols if, after the symbols are received only in first transmission time intervals, the symbols are received only in second transmission time intervals.

30. The method according to any of claims 25 to 29, further comprising

calculating an excess capability based on the capability,
and one of ΨΠΟΓΠ and ΨΠΟΓΤΙ,3ΤΤΙ, wherein

the excess capability is 0% if the capability is the one of ΨΠΟΓΠ and

the excess capability is 100% if the capability is ΨΓ^Χ,

the excess capability is calculated by linear interpolation between the one of ΨΠΟΓΠ and ΨηοΓπ,3ττι and ΨΓΤΙ3Χ if the capability is between the one of ΨΠΟΓΠ and

the base station is informed on the excess capability;

ΨηοΓπ denotes a maximum instantaneously required processing effort to process the symbols if the symbols are received only in first transmission time intervals;

denotes a maximum instantaneously required processing effort to process the symbols if the symbols are received only in second transmission time intervals; and

ΨΓΤΙ3Χ denotes a maximum instantaneously required processing effort to process the symbols if, after the symbols are received only in first transmission time intervals, the symbols are received only in second transmission time intervals.

31 . A computer program product comprising a set of instructions which, when executed on an apparatus, is configured to cause the apparatus to carry out the method according to any of claims 16 to 30.

32. The computer program product according to claim 31 , embodied as a computer-readable medium or directly loadable into a computer.