IP Library Patent Application 17870688
Patent Application
App. No. 17/870,688

UPLINK DATA TRANSMISSION SCHEDULING

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 None
App. No.
17/870,688
Abstract

An apparatus and method for uplink data transmission scheduling are disclosed. In an example, the method can include obtaining, by at least one processor, a plurality of packets to be transmitted via uplink. The method can also include queueing, by the at least one processor, the plurality of packets according to logical channel prioritization. The method can further include receiving, by the at least one processor, a service grant after the queueing. The method can additionally include trimming, by the at least one processor, the plurality of packets according to a grant size of the service grant.

Claims (45)

1 . An apparatus, comprising:

at least one processor; and

at least one memory including computer program code,

wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to:

obtain a plurality of packets to be transmitted via uplink;

queue the plurality of packets according to logical channel prioritization;

receive a service grant after the queueing; and

trim the plurality of packets according to a grant size of the received service grant.

2 . The apparatus of claim 1 , wherein the at least one memory and the computer program code are further configured to, with the at least one processor, cause the apparatus at least to forward a remainder of the plurality of packets after the trimming to transmission.

3 . The apparatus of claim 1 , wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to queue the plurality of packets at least by placing the plurality of packets partially into at least one high priority queue and partially into at least one low priority queue.

4 . The apparatus of claim 3 , wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to trim the plurality of packets at least by removing an integer number of packets from the low priority queue.

5 . The apparatus of claim 1 , wherein the at least one memory and the computer program code are further configured to, with the at least one processor, cause the apparatus at least to:

calculate the grant size based on the received service grant; and

identify a size of an untrimmable subset of the plurality of packets,

wherein the trimming the plurality of packets comprises trimming a remainder of the plurality of packets excluding the untrimmable subset.

6 . The apparatus of claim 1 , wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to trim the plurality of packets in a medium access control (MAC) layer, wherein the plurality of packets comprise MAC packet data units.

7 . The apparatus of claim 1 , wherein the at least one memory and the computer program code are further configured to, with the at least one processor, cause the apparatus at least to:

estimate a predicted grant size prior to receiving the service grant; and

pre-assemble the plurality of packets into a packet data unit before receiving the service grant.

8 . The apparatus of claim 7 , wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to trim the plurality of packets at least by modifying the packet data unit to exclude one or more packets of the plurality of packets.

9 . The apparatus of claim 1 , wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to queue the plurality of packets at least by storing the plurality of packets according to logical priority in contiguous memory.

10 . A method for data transmission scheduling, comprising:

obtaining, by at least one processor, a plurality of packets to be transmitted via uplink;

queueing, by the at least one processor, the plurality of packets according to logical channel prioritization;

receiving, by the at least one processor, a service grant after the queueing; and

trimming, by the at least one processor, the plurality of packets according to a grant size of the received service grant.

11 . The method of claim 10 , further comprising forwarding, by the at least one processor, a remainder of the plurality of packets after the trimming to transmission.

12 . The method of claim 10 , wherein the queueing comprises placing the plurality of packets partially into at least one high priority queue and partially into at least one low priority queue.

13 . The method of claim 12 , wherein the trimming comprises removing an integer number of packets from the low priority queue.

14 . The method of claim 10 , further comprising:

calculating, by the at least one processor, a grant size based on the received service grant; and

identifying, by the at least one processor, a size of an untrimmable subset of the plurality of packets,

wherein the trimming the plurality of packets comprises trimming a remainder of the plurality of packets excluding the untrimmable subset.

15 . The method of claim 10 , wherein the trimming is performed in a medium access control (MAC) layer, and the plurality of packets comprise MAC packet data units.

16 . The method of claim 10 , further comprising:

estimating, by the at least one processor, a predicted grant size prior to receiving the service grant; and

pre-assembling, by the at least one processor, the plurality of packets into a packet data unit before receiving the service grant.

17 . The method of claim 16 , wherein the trimming comprises modifying the packet data unit to exclude one or more packets of the plurality of packets.

18 . The method of claim 10 , wherein the queueing comprises storing the plurality of packets according to logical priority in contiguous memory.

19 . A non-transitory computer-readable medium encoded with instructions that, when executed by at least one processor, perform a process comprising:

obtaining a plurality of packets to be transmitted via uplink;

queueing the plurality of packets according to logical channel prioritization;

receiving a service grant after the queueing; and

trimming the plurality of packets according to a grant size of the received service grant.

20 . The computer-readable medium of claim 19 , wherein the process further comprises forwarding a remainder of the plurality of packets after the trimming to transmission.

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 28, 2024
From: ZEKU TECHNOLOGY (SHANGHAI) CORP., LTD.
To: GREATER SHINE LIMITED
Reel/Frame 068429/0645 →
CORRECTIVE ASSIGNMENT TO CORRECT THE THE NAME WITH CORRECT PUNCTUATION OF COMPANY IS ZEKU TECHNOLOGY (SHANGHAI) CORP., LTD PREVIOUSLY RECORDED AT REEL: 064305 FRAME: 0576. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Aug 25, 2023
From: ZEKU, INC.
To: ZEKU TECHNOLOGY (SHANGHAI) CORP., LTD.
Reel/Frame 064782/0220 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 18, 2023
From: ZEKU, INC.
To: ZEKU TECHNOLOGY (SHANGHAI) CORP. LTD.
Reel/Frame 064305/0576 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 21, 2022
From: LOW, SU-LIN; MA, TIANAN TIM; HONG, HAUSTING
To: ZEKU INC.
Reel/Frame 060585/0529 →