| 摘要 |
A method 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 method 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. |
