User equipment with binary-tree multiplexing scheduling

• US 20030118046A1
• Filed: 12/09/2002
• Published: 06/26/2003
• Est. Priority Date: 06/13/2001
• Status: Active Grant

• Current Assignee: Rakuten Group, Inc.
• Original Assignee: Interdigital Technology Corporation (InterDigital, Inc.)
• Inventors: Chao, Yi-Ju
• Granted Patent: US 6,904,050 B2
• Time in Patent Office: Days
• US Class Current: 370/442
• CPC Class Codes: H04J 3/1629 Format building algorithm
• CPC Class Codes: H04W 72/1221 based on age of data to be sent
• CPC Class Codes: H04W 72/569 of the traffic information

Abstract

A user equipment (UE) for multiplexed scheduling of information blocks from multiple sources on a single communication channel divided into multiple address positions. The information block from each source has a repetition period and is divided into a number of segments. The UE includes determining the total number of positions on the channel to be scheduled; mapping positions in a non-sequential order corresponding to nodes in a binary tree, whereby each layer of the binary tree corresponds to a repetition period; ordering the blocks by repetition period, starting with the smallest repetition period; assigning information segments of each block to unassigned positions; and marking as assigned all child nodes of the assigned position node in the layer corresponding to the repetition period.

Claims

1. A user equipment (UE) that supports multiplexed scheduling of information blocks from multiple sources on a single communication channel divided into multiple address positions, the information block from each source having a repetition period and a number of segments, comprising:

a processor for determining the total number of positions on the channel to be scheduled;

non-sequential mapping of channel positions in an order corresponding to a binary tree; and

assigning information segments of each block to unassigned channel positions corresponding to binary tree nodes of a layer on the binary tree associated with the repetition period of the block and also marking as assigned all corresponding child nodes of the associated assigned layer nodes; and

a memory for storing the binary tree mapping.

2. The UE of claim 1 wherein the determining of the total number of positions is a function of the repetition period of the information.

3. The UE of claim 1 wherein the number of layers in the binary tree is a function of the greatest repetition period of the information blocks.

4. The UE of claim 1 wherein the processor further determines the priority order of information blocks for assigning positions on the channel based on the repetition period and assigns information segments of each information source to channel positions according to the priority order, whereby each information source is assigned completely before information segments of the next information block are assigned.

5. The UE of claim 4, wherein the information blocks include a header block of information which is first in the priority order and the processor further assigns segments of the header information block to numerically consecutive initial channel positions.

6. The UE of claim 5, wherein the processor further assigns segments of subsequent blocks of information to unassigned positions with the least numerical values and as consecutively as possible.

7. The UE of claim 5, wherein the processor further assigns segments of subsequent blocks of information to unassigned positions with the greatest numerical values and as consecutively as possible.

8. A UE for scheduling of information blocks from multiple sources on a single communication channel divided into multiple address positions, the information block from each source having a repetition period and a number of segments, comprising:

a processor for determining the total number of positions on the channel to be scheduled;

assigning the blocks in the order of repetition period, starting with the block having the smallest repetition period;

whereby the segments of each block are assigned to unassigned positions mapped to nodes in a binary tree; and

a memory for storing the binary tree.

9. The UE of claim 8, wherein the information blocks include a header block of information which is first in the priority order and the processor assigns segments of the header information block to numerically consecutive initial channel positions.

10. The UE of claim 9, wherein the processor assigns segments of subsequent blocks of information to unassigned positions with the least numerical values and as consecutively as possible.

11. The UE of claim 9, wherein the processor assigns segments of subsequent blocks of information to unassigned positions with the greatest numerical values and as consecutively as possible.

12. A UE for scheduling information blocks from multiple sources on a single communication channel divided into multiple address positions, the information block from each source having a repetition period and a number of segments, comprising:

a processor for determining the total number of positions on the channel to be scheduled;

mapping positions in a non-sequential order corresponding to nodes in a binary tree, whereby each layer of the binary tree corresponds to a repetition period;

ordering the blocks by repetition period, starting with the smallest repetition period;

assigning, based upon said ordering, information segments of each block to unassigned positions; and

identifying and marking as assigned all child nodes of the node in the layer corresponding to the repetition period; and

a memory for storing the binary tree.

13. The UE of claim 12, wherein the information blocks include a header block of information which is first in the priority order and the processor assigns segments of the header information block to numerically consecutive initial channel positions.

14. The UE of claim 13, wherein the processor assigns segments of subsequent blocks of information to unassigned positions with the least numerical values and as consecutively as possible.

15. The UE of claim 13, wherein the processor assigns segments of subsequent blocks of information to unassigned positions with the greatest numerical values and as consecutively as possible.

16. A UE for scheduling information blocks from multiple sources on a single communication channel divided into multiple address positions, the information block from each source having a repetition period and a number of segments, comprising:

a processor for determining the total number of positions on the channel to be scheduled;

mapping positions in a non-sequential order corresponding to nodes in a binary tree, the binary tree having a plurality of layers, each layer corresponding to a repetition period and the bottom layer having said required number of positions; and

assigning information segments of each block to unassigned positions at the layer corresponding with the repetition period of the block and to all corresponding child nodes down to the bottom layer on the binary tree; and

a memory for storing the binary tree.

17. The UE of claim 16, wherein the information blocks include a header block of information which is first in the priority order and the processor assigns segments of the header information block to numerically consecutive initial channel positions.

18. The UE of claim 17, wherein the processor assigns segments of subsequent blocks of information to unassigned positions with the least numerical values and as consecutively as possible.

19. The UE of claim 17, wherein the processor assigns segments of subsequent blocks of information to unassigned positions with the greatest numerical values and as consecutively as possible.