SYSTEM AND METHOD FOR AVOIDING STALL OF AN H-ARQ REORDERING BUFFER IN A RECEIVER
    12.
    发明申请
    SYSTEM AND METHOD FOR AVOIDING STALL OF AN H-ARQ REORDERING BUFFER IN A RECEIVER 有权
    用于避免接收器中的H-ARQ重构缓冲器的驻留的系统和方法

    公开(公告)号:US20040001456A1

    公开(公告)日:2004-01-01

    申请号:US10327301

    申请日:2002-12-20

    Inventor: Yi-Ju Chao

    CPC classification number: H04L47/10 H04L1/1812 H04L1/1887

    Abstract: A system and method for avoiding stall of an H-ARQ reordering buffer in a receiver is disclosed. The present invention reduces the latency of the H-ARQ reordering buffers within a receiver and uses a Last-In-First-Out (LIFO) policy for loading the transmitting H-ARQ processors. The LIFO loading policy increases the probability that the UE will be able to determine at an earlier time whether the missed TSN is due to delay in retransmission or due to the release of a transmission by the Node B by reading the new H-ARQ processor identifier (ID).

    Abstract translation: 公开了一种用于避免接收机中的H-ARQ重排序缓冲器停顿的系统和方法。 本发明减少了接收机内的H-ARQ重新排序缓冲器的等待时间,并且使用用于加载发送H-ARQ处理器的先进先出(LIFO)策略。 LIFO加载策略增加了UE能够在较早时间确定丢失的TSN是由于重传延迟还是由于节点B通过读取新的H-ARQ处理器标识符而发布的传输的概率 (ID)。

    System for efficient recovery of node B buffered data following serving high speed downlink shared channel cell change
    13.
    发明申请
    System for efficient recovery of node B buffered data following serving high speed downlink shared channel cell change 有权
    用于高速下行链路共享信道小区改变后的节点B缓冲数据的高效恢复系统

    公开(公告)号:US20030189909A1

    公开(公告)日:2003-10-09

    申请号:US10334489

    申请日:2002-12-30

    Abstract: The present invention relates to efficient recovery of High Speed Downlink Packet Access (HSDPA) data following handover. The present invention discloses a method and system for the UE to perform a serial of actions in order to reduce the latency and potentially prevent loss of PDU transmission during the serving HS-DSCH cell change procedure. A new criterion is introduced for UE generation of the status report of RLC PDU. The UE generates status report of the PDUs as soon as possible following notification of the HS-DSCH cell change indicated by the RRC procedure to more efficiently recover source Node B buffered data. PDU status may be signaled for each AM RLC instance associated with the HS-DSCH transport channel. Furthermore, upon Inter Node B serving HS-DSCH cell change the SRNC may wait for PDU status report before initiating transmission of new data in target cell.

    Abstract translation: 本发明涉及切换后的高速下行链路分组接入(HSDPA)数据的有效恢复。 本发明公开了一种用于UE执行一系列动作的方法和系统,以便在服务HS-DSCH小区改变过程期间减少等待时间并潜在地防止PDU传输的丢失。 引入了用于UE生成RLC PDU的状态报告的新标准。 在通知由RRC过程指示的HS-DSCH小区改变之后,UE将尽快生成PDU的状态报告,以更有效地恢复源节点B缓冲的数据。 可以针对与HS-DSCH传输信道相关联的每个AM RLC实例发信号通知PDU状态。 此外,在服务HS-DSCH小区改变的节点B之间,SRNC可以在开始发送目标小区中的新数据之前等待PDU状态报告。

    User equipment with binary-tree multiplexing scheduling
    15.
    发明申请
    User equipment with binary-tree multiplexing scheduling 有权
    具有二叉树复用调度的用户设备

    公开(公告)号:US20030118046A1

    公开(公告)日:2003-06-26

    申请号:US10314691

    申请日:2002-12-09

    Inventor: Yi-Ju Chao

    CPC classification number: H04J3/1629 H04W72/1221 H04W72/1242

    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.

    Abstract translation: 用于在被划分为多个地址位置的单个通信信道上从多个源多路复用调度信息块的用户设备(UE)。 来自每个源的信息块具有重复周期并被划分成多个段。 UE包括确定要调度的信道上的位置的总数; 以对应于二叉树中的节点的非顺序顺序映射位置,由此二叉树的每个层对应于重复周期; 以重复周期排序块,从最小重复周期开始; 将每个块的信息段分配给未分配的位置; 并且在与重复周期相对应的层中分配分配的位置节点的所有子节点。

Patent Agency Ranking