User equipment with binary-tree multiplexing scheduling

Multiplex communications – Channel assignment techniques – Adaptive selection of channel assignment technique

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S537000

Reexamination Certificate

active

06904050

ABSTRACT:
A user equipment (UE) 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 UE 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.

REFERENCES:
patent: 4593282 (1986-06-01), Acampora et al.
patent: 5463777 (1995-10-01), Bialkowski et al.
patent: 5574910 (1996-11-01), Bialkowski et al.
patent: 5648958 (1997-07-01), Counterman
patent: 6222851 (2001-04-01), Petry
patent: 6504848 (2003-01-01), Chao
patent: 6553002 (2003-04-01), Bremer et al.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

User equipment with binary-tree 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 User equipment with binary-tree multiplexing scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and User equipment with binary-tree multiplexing scheduling will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3483981

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.