IP Library Granted Patent US 9,219,591
Granted Patent B2
US 9,219,591 · App. 13/856,941 · Granted Dec 22, 2015

Method and apparatus for providing acknowledgement bundling

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,219,591
App. No.
13/856,941
Granted
Dec 22, 2015
Kind
B2
Abstract

An approach is provided for acknowledgement bundling. Dynamically scheduling of one or more of subframes per bundling window is performed by reusing an assignment index field (e.g., downlink assignment index (DAI) field). The assignment index field has a value greater than or equal to number of previously assigned subframes within the bundling window. The bundling window defines a group of subframes for common acknowledgement.

Claims (24)

1. A method comprising:

dynamically scheduling one or more of subframes per bundling window by reusing an assignment index field, wherein the assignment index field has a value greater than or equal to number of previously assigned subframes within the bundling window, the bundling window defining a group of subframes for common acknowledgement;

setting the assignment index field according to m modulo x, wherein m and x are integers;

comparing a value of the assignment index field associated with a last received downlink grant modulo x with a total number of downlink grants prior to the last received downlink grant modulo x; and

adding the value of the assignment index field associated with the last received downlink by x, if there are at least two identical assignment index field values in the bundling window, x being an integer.

2. The method according to claim 1 , further comprising:

labeling the assignment index field for each assignment according to (Ceil (n/2)+K) modulo x, wherein n and x are integers, and K is a boolean value to indicate whether at least 2 subframes will be dynamic assigned in the subframes within the bundling window.

3. The method according to claim 2 , wherein the assignment index field is a downlink assignment index field, and x equals 4.

4. The method according to claim 2 , wherein a value of the assignment index field associated with a last received downlink grant is compared with a total number of downlink grants.

5. The method according to claim 4 , wherein a predetermined number of downlink grants have been missed, and the dynamic scheduling is performed according to a maximum number of subframes associated with the bundling window.

6. 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 to perform at least the following:

dynamically schedule one or more of subframes per bundling window by reusing an assignment index field, wherein the assignment index field has a value greater than or equal to number of previously assigned subframes within the bundling window, the bundling window defining a group of subframes for common acknowledgement,

set the assignment index field according to m modulo x, m and x being integers,

compare a value of the assignment index field associated with a last received downlink grant modulo x with a total number of downlink grants prior to the last received downlink grant modulo x, and

add the value of the assignment index field associated with the last received downlink by x, if there are at least two identical assignment index field values in the bundling window, x being an integer.

7. The apparatus according to claim 6 , wherein the apparatus is further caused to:

label the assignment index field for each assignment according to (Ceil (n/2)+K) modulo x, wherein n and x are integers, and K is a boolean value to indicate whether at least 2 subframes will be dynamic assigned in the subframes within the bundling window.

8. The apparatus according to claim 7 , wherein the assignment index field is a downlink assignment index field, and x equals 4.

9. The apparatus according to claim 7 , wherein a value of the assignment index field associated with a last received downlink grant is compared with a total number of downlink grants.

10. The apparatus according to claim 9 , wherein a predetermined number of downlink grants have been missed, and the apparatus is further caused to:

dynamically schedule according to a maximum number of subframes associated with the bundling window.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 20, 2018
From: NOKIA SOLUTIONS AND NETWORKS OY
To: BEIJING XIAOMI MOBILE SOFTWARE CO.,LTD.
Reel/Frame 045380/0522 →
CHANGE OF NAME Recorded Nov 19, 2014
From: NOKIA SIEMENS NETWORKS OY
To: NOKIA SOLUTIONS AND NETWORKS OY
Reel/Frame 034294/0603 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 7, 2014
From: CHE, XIANGGUANG; CHEN, PENG; FREDERIKSEN, FRANK; KOLDING, TROELS
To: NOKIA SIEMENS NETWORKS OY
Reel/Frame 033252/0663 →