Binary-tree method and system for multiplexing scheduling

Details Binary-tree method and system for multiplexing scheduling Binary-tree method and system for multiplexing scheduling

H - Electricity

04

J

H04J 3/16 (2006.01) H04W 72/12 (2009.01)

Patent

CA 2450008

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 (101); mapping positions in a non-sequential order coresponding to nodes in a binary tree (103); 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 (106); and marking as assigned all child nodes of the assigned position node in the layer corresponding to the repetition period (107).

La présente invention concerne un procédé de programmation multiplexée de blocs d'informations de sources multiples sur une voie de communication unique divisée en positions d'adresses multiples. Le bloc d'informations de chaque source présente une période de répétition et est divisé en un certain nombre de segments. Ledit procédé consiste à déterminer le nombre total de positions sur le canal à programmer (101); des positions de mise en correspondance dans un ordre non séquentiel correspondant à des noeuds dans un arbre binaire (103), chaque couche de l'arbre binaire correspondant à une période de répétition ; ordonner les blocs par période de répétition, démarrer avec la période de répétition la plus petite ; affecter les segments d'informations de chaque bloc à des positions non affectées (106); et marquer comme affectés tous les noeuds-enfants du noeud de position affectée dans la couche correspondant à la période de répétition (107).

Affiliated with

Also associated with

Rating

Binary-tree method and system for multiplexing scheduling does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Binary-tree method and system for multiplexing scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Binary-tree method and system for multiplexing scheduling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1491167