User equipment with binary-tree multiplexing scheduling

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.

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.

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.