Method and apparatus for implementing cyclic redundancy check calculation for data communications
    2.
    发明授权
    Method and apparatus for implementing cyclic redundancy check calculation for data communications 失效
    用于实现数据通信的循环冗余校验计算的方法和装置

    公开(公告)号:US06357032B1

    公开(公告)日:2002-03-12

    申请号:US09246363

    申请日:1999-02-08

    IPC分类号: H03M1300

    CPC分类号: H03M13/091

    摘要: A method and apparatus are provided for implementing cyclic redundancy check (CRC) calculation for data communications in a communications system. CRC calculation apparatus includes a CRC tree structure receiving a first CRC input, a data input of N−1 data input bytes; and a length input. The CRC tree structure includes a series of CRC trees. Each of the CRC trees has a seed CRC input, a fixed size data input and provides a CRC result output. The series of CRC trees are arranged in cascade with increasing data size inputs. A multiplexer control logic responsive to the length input selectively couples predefined data input bytes to predefined ones of the series of the CRC trees. The multiplexer control logic responsive to the length input couples the first CRC input to a selected one of the CRC trees; couples predefined CRC result outputs to predefined ones of the CRC trees; and utilizes a selected CRC tree to provide the overall CRC result.

    摘要翻译: 提供了一种用于实现通信系统中的数据通信的循环冗余校验(CRC)计算的方法和装置。 CRC计算装置包括接收第一CRC输入的CRC树结构,N-1个数据输入字节的数据输入; 和长度输入。 CRC树结构包括一系列CRC树。 每个CRC树具有种子CRC输入,固定大小的数据输入,并提供CRC结果输出。 一系列CRC树与级数增加的数据大小输入进行排列。 响应于长度输入的多路复用器控制逻辑选择性地将预定义的数据输入字节耦合到一系列CRC树中的预定义数据输入字节。 响应于长度输入的多路复用器控制逻辑将第一CRC输入耦合到选定的一个CRC树; 将预定义的CRC结果输出耦合到预定义的CRC树中; 并利用选择的CRC树提供总体CRC结果。

    Cell/frame scheduling method and communications cell/frame scheduler
    5.
    发明授权
    Cell/frame scheduling method and communications cell/frame scheduler 失效
    单元/帧调度方法和通信单元/帧调度器

    公开(公告)号:US06477168B1

    公开(公告)日:2002-11-05

    申请号:US09244548

    申请日:1999-02-03

    IPC分类号: H04L1256

    摘要: A method and apparatus are provided for scheduling the transmission of cells and frames in a communications network. The transmission of cells and frames are scheduled utilizing a selected scheduling algorithm. The cell/frame scheduling algorithm includes the step of identifying a frame or cell transmission type. Responsive to the identified frame or cell transmission type, a frame multiplier value is identified. A target transmission time is calculated for the frame or cell transmission type utilizing the identified frame multiplier value. A method and apparatus optionally are provided for scheduling the transmission of packet pairs.

    摘要翻译: 提供了一种用于调度通信网络中的小区和帧的传输的方法和装置。 使用所选择的调度算法调度小区和帧的传输。 小区/帧调度算法包括识别帧或小区传输类型的步骤。 响应于所识别的帧或小区传输类型,识别帧乘法器值。 利用所识别的帧乘数值来计算帧或小区传输类型的目标传输时间。 可选地提供了一种用于调度分组对的传输的方法和装置。

    Rate based memory replacement mechanism for replacing cache entries when
the cache is full
    6.
    发明授权
    Rate based memory replacement mechanism for replacing cache entries when the cache is full 失效
    基于速率的内存替换机制,用于在缓存已满时替换缓存条目

    公开(公告)号:US5761716A

    公开(公告)日:1998-06-02

    申请号:US640605

    申请日:1996-05-01

    IPC分类号: G06F12/12 G06F13/00

    CPC分类号: G06F12/121

    摘要: A rate based mechanism for determining which data to replace in a cache when the cache is full. The computer system processes data, which are associated with multiple channels or processes. These channels or processes have different, cyclic rates. When the cache is full, the system chooses the data to replace by selecting the data block in the cache that has the lowest rate and is the most recently used.

    摘要翻译: 一种基于速率的机制,用于在高速缓存已满时确定要在高速缓存中替换的数据。 计算机系统处理与多个通道或过程相关联的数据。 这些通道或过程具有不同的循环速率。 当缓存已满时,系统通过选择具有最低速率且最近使用的缓存中的数据块来选择要替换的数据。