Bitstream processing using coalesced buffers and delayed matching and enhanced memory writes
    34.
    发明授权
    Bitstream processing using coalesced buffers and delayed matching and enhanced memory writes 有权
    使用合并缓冲区和延迟匹配和增强存储器写入的位流处理

    公开(公告)号:US09203887B2

    公开(公告)日:2015-12-01

    申请号:US13994129

    申请日:2011-12-23

    IPC分类号: H04L29/06 H04W28/06 H03M7/30

    摘要: Methods and apparatus for processing bitstreams and byte streams. According to one aspect, bitstream data is compressed using coalesced string match tokens with delayed matching. A matcher is employed to perform search string match operations using a shortened maximum string length search criteria, resulting in generation of a token stream having data and literal data. A distance match operation is performed on sequentially adjacent tokens to determine if they contain the same distance data. If they do, the len values of the tokens are added through use of a coalesce buffer. Upon detection of a distance non-match, a final coalesced length of a matching string is calculated and output along with the prior matching distance as a coalesced token. Also disclosed is a scheme for writing variable-length tokens into a bitstream under which token data is input into a bit accumulator and written to memory (or cache to be subsequently written to memory) as each token is processed in a manner that eliminates branch mispredict operations associated with detecting whether the bit accumulator is full or close to full.

    摘要翻译: 用于处理比特流和字节流的方法和装置。 根据一个方面,使用具有延迟匹配的合并字符串匹配令牌来压缩比特流数据。 使用匹配器来执行搜索字符串匹配操作,使用缩短的最大字符串长度搜索条件,导致生成具有数据和文字数据的令牌流。 对顺序相邻的令牌执行距离匹配操作,以确定它们是否包含相同的距离数据。 如果这样做,令牌的len值通过使用合并缓冲区来添加。 在检测到距离不匹配时,计算匹配串的最终合并长度,并将其与先前匹配距离一起作为合并令牌输出。 还公开了一种用于将可变长度令牌写入比特流的方案,在该比特流中,令牌数据被输入到比特累加器中,并且以消除分支错误预测的方式将每个令牌进行处理,并将其写入存储器(或高速缓存以随后写入存储器) 检测位累加器是满或接近满的操作。

    Instructions processors, methods, and systems to process BLAKE secure hashing algorithm
    35.
    发明授权
    Instructions processors, methods, and systems to process BLAKE secure hashing algorithm 有权
    指令处理器,方法和系统来处理BLAKE安全散列算法

    公开(公告)号:US09100184B2

    公开(公告)日:2015-08-04

    申请号:US13976741

    申请日:2011-12-22

    摘要: A method of an aspect includes receiving an instruction indicating a first source having at least one set of four state matrix data elements, which represent a complete set of four inputs to a G function of a cryptographic hashing algorithm. The algorithm uses a sixteen data element state matrix, and alternates between updating data elements in columns and diagonals. The instruction also indicates a second source having data elements that represent message and constant data. In response to the instruction, a result is stored in a destination indicated by the instruction. The result includes updated state matrix data elements including at least one set of four updated state matrix data elements. Each of the four updated state matrix data elements represents a corresponding one of the four state matrix data elements of the first source, which has been updated by the G function.

    摘要翻译: 一种方面的方法包括:接收指示具有至少一组四个状态矩阵数据元素的第一源的指令,其表示对密码散列算法的G函数的四个输入的完整集合。 该算法使用十六个数据元素状态矩阵,并在列和对角线之间更新数据元素。 该指令还指示具有表示消息和常数数据的数据元素的第二源。 响应该指令,结果存储在指令指示的目的地中。 结果包括更新的状态矩阵数据元素,包括至少一组四个更新的状态矩阵数据元素。 四个更新的状态矩阵数据元素中的每一个表示已由G功能更新的第一源的四个状态矩阵数据元素中的相应一个。

    BITSTREAM PROCESSING USING COALESCED BUFFERS AND DELAYED MATCHING AND ENHANCED MEMORY WRITES
    37.
    发明申请
    BITSTREAM PROCESSING USING COALESCED BUFFERS AND DELAYED MATCHING AND ENHANCED MEMORY WRITES 有权
    使用加密缓存和延迟匹配和增强存储器写入的BITSTREAM处理

    公开(公告)号:US20140156790A1

    公开(公告)日:2014-06-05

    申请号:US13994129

    申请日:2011-12-23

    IPC分类号: H04L29/06

    摘要: Methods and apparatus for processing bitstreams and byte streams. According to one aspect, bitstream data is compressed using coalesced string match tokens with delayed matching. A matcher is employed to perform search string match operations using a shortened maximum string length search criteria, resulting in generation of a token stream having data and literal data. A distance match operation is performed on sequentially adjacent tokens to determine if they contain the same distance data. If they do, the len values of the tokens are added through use of a coalesce buffer. Upon detection of a distance non-match, a final coalesced length of a matching string is calculated and output along with the prior matching distance as a coalesced token. Also disclosed is a scheme for writing variable-length tokens into a bitstream under which token data is input into a bit accumulator and written to memory (or cache to be subsequently written to memory) as each token is processed in a manner that eliminates branch mispredict operations associated with detecting whether the bit accumulator is full or close to full.

    摘要翻译: 用于处理比特流和字节流的方法和装置。 根据一个方面,使用具有延迟匹配的合并字符串匹配令牌来压缩比特流数据。 使用匹配器来执行搜索字符串匹配操作,使用缩短的最大字符串长度搜索条件,导致生成具有数据和文字数据的令牌流。 对顺序相邻的令牌执行距离匹配操作,以确定它们是否包含相同的距离数据。 如果这样做,令牌的len值通过使用合并缓冲区来添加。 在检测到距离不匹配时,计算匹配串的最终合并长度,并将其与先前匹配距离一起作为合并令牌输出。 还公开了一种用于将可变长度令牌写入比特流的方案,在该比特流中,令牌数据被输入到比特累加器中,并且以消除分支错误预测的方式将每个令牌进行处理,并将其写入存储器(或高速缓存以随后写入存储器) 检测位累加器是满或接近满的操作。

    METHOD AND APPARATUS TO PROCESS 4-OPERAND SIMD INTEGER MULTIPLY-ACCUMULATE INSTRUCTION
    38.
    发明申请
    METHOD AND APPARATUS TO PROCESS 4-OPERAND SIMD INTEGER MULTIPLY-ACCUMULATE INSTRUCTION 有权
    过程4操作的方法和装置SIMD INTEGER MULTIPLY-ACCUMULATE指令

    公开(公告)号:US20140082328A1

    公开(公告)日:2014-03-20

    申请号:US13617021

    申请日:2012-09-14

    IPC分类号: G06F9/302 G06F9/30

    摘要: According to one embodiment, a processor includes an instruction decoder to receive an instruction to process a multiply-accumulate operation, the instruction having a first operand, a second operand, a third operand, and a fourth operand. The first operand is to specify a first storage location to store an accumulated value; the second operand is to specify a second storage location to store a first value and a second value; and the third operand is to specify a third storage location to store a third value. The processor further includes an execution unit coupled to the instruction decoder to perform the multiply-accumulate operation to multiply the first value with the second value to generate a multiply result and to accumulate the multiply result and at least a portion of a third value to an accumulated value based on the fourth operand.

    摘要翻译: 根据一个实施例,处理器包括指令解码器,用于接收处理多重累积运算的指令,该指令具有第一操作数,第二操作数,第三操作数和第四操作数。 第一个操作数是指定一个存储累积值的第一个存储位置; 第二操作数是指定存储第一值和第二值的第二存储位置; 并且第三操作数是指定存储第三值的第三存储位置。 所述处理器还包括执行单元,其耦合到所述指令解码器以执行所述乘法运算,以将所述第一值乘以所述第二值以产生乘法结果,并将乘法结果和第三值的至少一部分累积到 基于第四操作数的累计值。

    Polynomial-basis to normal-basis transformation for binary Galois-Fields GF(2m)
    40.
    发明授权
    Polynomial-basis to normal-basis transformation for binary Galois-Fields GF(2m) 有权
    对于二值Galois-Fields GF(2m)的正态基变换的多项式

    公开(公告)号:US08380767B2

    公开(公告)日:2013-02-19

    申请号:US11772172

    申请日:2007-06-30

    IPC分类号: G06F7/72

    CPC分类号: G06F7/724

    摘要: Basis conversion from polynomial-basis form to normal-basis form is provided for both generic polynomials and special irreducible polynomials in the form of “all ones”, referred to as “all-ones-polynomials” (AOP). Generation and storing of large matrices is minimized by creating matrices on the fly, or by providing an alternate means of computing a result with minimal hardware extensions.

    摘要翻译: 对于通用多项式和以全1形式的特殊不可约多项式,提供了从多项式基形式到正态形式的基础转换,称为全要素多项式(AOP)。 通过在飞行中创建矩阵,或者通过提供以最小的硬件扩展来计算结果的替代方法来最小化大矩阵的生成和存储。