发明名称 BINARY-TREE METHOD AND SYSTEM FOR MULTIPLEXING SCHEDULING
摘要 <p>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).</p>
申请公布号 WO2002101997(A1) 申请公布日期 2002.12.19
申请号 US2002006966 申请日期 2002.03.07
申请人 发明人
分类号 主分类号
代理机构 代理人
主权项
地址
您可能感兴趣的专利