BUFFER MANAGEMENT VIA NON-DATA SYMBOL PROCESSING FOR A POINT TO POINT LINK
    1.
    发明申请
    BUFFER MANAGEMENT VIA NON-DATA SYMBOL PROCESSING FOR A POINT TO POINT LINK 审中-公开
    缓冲区管理通过非点数据符号处理点到点链接

    公开(公告)号:WO2005066827A2

    公开(公告)日:2005-07-21

    申请号:PCT/US2004043687

    申请日:2004-12-23

    CPC classification number: G06F5/14

    Abstract: A number of symbols are received in a first integrated circuit (IC) device, where these symbols have been transmitted by a second IC device and are received over a serial point to point link. These symbols include a non-data sequence that has been inserted into a data sequence by the second device. The symbols are loaded into a buffer. The data sequence and some of the non-data sequence is unloaded from the buffer, according to a changing unload pointer. To prevent overflow of the buffer, and in response to detecting the non-data sequence, the unload pointer is changed by more than one entry so that a non-­data symbol of the non-data sequence as loaded in the buffer is skipped while unloading from the buffer. In another embodiment, to prevent underflow of the buffer, the unload pointer is stalled at an entry of the buffer that contains a non-data symbol while unloading. Other embodiments are also described and claimed.

    Abstract translation: 在第一集成电路(IC)装置中接收多个符号,其中这些符号已由第二IC器件传输并通过串行点对点链接接收。 这些符号包括已被第二设备插入到数据序列中的非数据序列。 符号被加载到缓冲区。 根据改变的卸载指针,数据序列和一些非数据序列从缓冲区中卸载。 为了防止缓冲器的溢出,并且响应于检测到非数据序列,卸载指针由多个条目改变,使得在卸载期间跳过加载在缓冲器中的非数据序列的非数据符号 从缓冲区。 在另一个实施例中,为了防止缓冲器的下溢,卸载指针在卸载期间在包含非数据符号的缓冲器的条目处被停止。 还描述和要求保护其他实施例。

    5.
    发明专利
    未知

    公开(公告)号:DE112004002567T5

    公开(公告)日:2006-12-14

    申请号:DE112004002567

    申请日:2004-12-22

    Applicant: INTEL CORP

    Abstract: Multiple symbol sequences that have been transmitted in parallel using the same transmit clock over a serial point to point link are received. Each symbol sequence includes an instance of a first, non-data symbol. The multiple symbol sequences are buffered and the number of times an instance of a second, non-data symbol that occurs in one of the symbol sequences is changed. A first deskew process is performed, followed by a second deskew process. The first deskew process aligns an instance of the first non-data symbol in every one of the buffered symbol sequences. The second deskew process equalizes the number of instances of the second non-data symbol that follow an instance of the first non-data symbol in every one of the symbol sequences. Other embodiments are also described and claimed.

Patent Agency Ranking