×

BINARY-TREE MULTIPLEXING SCHEDULING

  • US 20090141698A1
  • Filed: 02/09/2009
  • Published: 06/04/2009
  • Est. Priority Date: 06/13/2001
  • Status: Abandoned Application
First Claim
Patent Images

1. A method for multiplexed scheduling of information blocks from multiple sources on a single communication channel, comprising:

  • defining blocks of information and associating each block of information with a source of information;

    dividing the single communication channel into multiple address positions;

    confirming bandwidth for the defined blocks of information;

    determining a number of positions necessary to allow the information blocks to be scheduled;

    sorting the information blocks in a scheduler list; and

    scheduling the information blocks in accordance with the scheduling list.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×