Please download the dossier by clicking on the dossier button x
×

Binary-tree multiplexing scheduling

  • US 7,499,467 B2
  • Filed: 05/05/2005
  • Issued: 03/03/2009
  • Est. Priority Date: 06/13/2001
  • Status: Expired due to Term
First Claim
Patent Images

1. 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 having a repetition period and a number of segments, comprising the steps of:

  • checking for adequate channel bandwidth for a plurality of information blocks according to a summed ratio of number of segments per repetition period for each respective information block;

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

    assigning information segments of each information block to unassigned channel positions corresponding to binary tree nodes of a layer on the binary tree associated with the repetition period of the information block.

View all claims
  • 3 Assignments
Timeline View
Assignment View
    ×
    ×