| US 7,499,467 B2 | ||
| Binary-tree multiplexing scheduling | ||
| Yi-Ju Chao, Minnetonka, Minn. (US) | ||
| Assigned to Interdigital Technology Corporation, Wilmington, Del. (US) | ||
| Filed on May 05, 2005, as Appl. No. 11/122,538. | ||
| Application 11/122538 is a continuation of application No. 10/314691, filed on Dec. 09, 2002, granted, now 6,904,050. | ||
| Application 10/314691 is a continuation of application No. 10/010868, filed on Dec. 07, 2001, granted, now 6,504,848. | ||
| Claims priority of provisional application 60/297807, filed on Jun. 13, 2001. | ||
| Prior Publication US 2005/0201377 A1, Sep. 15, 2005 | ||
| Int. Cl. H04J 3/16 (2006.01) | ||
| U.S. Cl. 370—437 | 13 Claims |
| 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.
|