会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 12. 发明申请
    • METHOD FOR RECOGNITION OF ACYCLIC INSTRUCTION PATTERNS
    • 用于识别ACYCLIC指令模式的方法
    • WO2006020729A2
    • 2006-02-23
    • PCT/US2005/028463
    • 2005-08-11
    • SANDBRIDGE TECHNOLOGIES, INC.MOUDGILL, MayanKOTLYAR, Vladimir
    • MOUDGILL, MayanKOTLYAR, Vladimir
    • G06F9/44
    • G06F8/443
    • A method which determines by an optimizing compiler whether any variable in the given program equals to the given acyclic mathematical function f(x,y,...) applied to the given variables x, y, ... in the program. In one embodiment, the method includes expressing the bits of the value of the function f(x,y,..) as a Boolean function of the bits of the inputs x, y, ...; expressing, for every variable v and program statement s, the value taken by v when s is executed as a Boolean function V(s,v)(x, y, ...) of the bits of x, y, ...; and expressing, for every statement s, the condition under which the statement is executed as a Boolean function C(s)(x, y, ...) of the bits of the inputs x, y, .... Finally, a determination is made using a Boolean satisfiability oracle of whether, for the given variable v and program statement s, the following Boolean expression holds: C(s)(x,y,...) P> V(s,v)(x,y...)=f(x,y,...). In a second embodiment, the method includes expressing the value of f(x,y,...) as a plurality of functions f j (x,y,..) having the corresponding predicate P j (x,y,..); expressing, for every variable v and program statement s, the value taken by v when s is executed as a plurality of functions V j (s,v)(x,y,...), one for each predicate P j (x,y,..); and expressing, for every statement s, the condition under which the statement is executed as a plurality of functions C j (s)(x,y,...), one for each predicate P j (x,y,..). Finally, a determination is of whether for the given variable v and program statement s, V j (s,v)(x,y,...)=f j (x,y,..) whenever the predicate P j (x,y,..) and the condition C j (s)(x,y,...) are true.
    • 一种通过优化编译器确定给定程序中的任何变量是否等于给定的非循环数学函数f(x,y,...)的方法,该函数应用于程序中的给定变量x,y,...。 在一个实施例中,该方法包括将函数f(x,y,...)的值的位表示为输入x,y,...的位的布尔函数; 表示对于每个变量v和程序语句s,当s作为x,y,...的位的布尔函数V(s,v)(x,y,...)执行时,由v取得的值 ; 并且对于每个陈述s,表达作为输入x,y,...的位的布尔函数C(s,x,y,...)执行语句的条件。最后,a 对于给定的变量v和程序语句s,以下布尔表达式是否成立:C(s)(x,y,...)P> V(s,v)(x ,Y ...)= F(X,Y,...)。 在第二实施例中,该方法包括将f(x,y,...)的值表示为具有相应谓词P'的多个函数f(x,y,...) SUB>Ĵ(X,Y,...); 表示对于每个变量v和程序语句s,当s被执行为多个函数V S(s,v)(x,y,...)时,由v采取的值 对于每个谓词P< j>(x,y,...); 并且对于每个陈述s,表示执行该语句作为多个函数C(x,y,...)的条件,对于每个谓词P Ĵ(X,Y,...)。 最后,确定对于给定变量v和程序语句s,V j(s,v)(x,y,...)= f j j (x,y,...)和(x,y,...)(x,y,...)(x,y,...) 。)是真的。
    • 14. 发明申请
    • A METHOD OF REED-SOLOMON ENCODING AND DECODING
    • 一种解决方案编码和解码
    • WO2005069775A2
    • 2005-08-04
    • PCT/US2004/041011
    • 2004-12-08
    • SANDBRIDGE TECHNOLOGIES, INC.IANCU, DanielMOUDGILL, MayanGLOSSNER, John
    • IANCU, DanielMOUDGILL, MayanGLOSSNER, John
    • H03M13/15
    • H03M13/159H03M13/1515
    • A Reed-Solomon encoder method includes appending N zeros to a data block and performing a successive Homer reduction of the polynomial P(x) whose coefficients are the data of the data block plus the zeros. The remainders β (i) are multiplied by corresponding polynomial coefficients D (i) (x) and sum of all the resulting products. The sum of the products is appended to the data block as parity symbols to form a codeword. A Reed­Solomon decoder method includes calculating syndromes as the dot product of the codeword with syndrome vectors. If the syndromes equal 0, decode the codeword by merely removing the parity symbols. If the syndromes do not equal 0, correct the codeword by forming and solving an error locator polynomial for error locations, forming and solving an error magnitude polynomial for error magnitudes at the locations and correcting the error in the codeword. The codeword is decoded by removing the parity symbols. The methods are performed in software.
    • Reed-Solomon编码器方法包括将N个零附加到数据块并且执行其系数是数据块的数据加上零的多项式P(x)的连续荷马缩小。 剩余的β<(i)>乘以相应的多项式系数D(i)>(x)和所得到的所有乘积的总和。 将产品的总和作为奇偶校验符号附加到数据块以形成码字。 ReedSolomon解码器方法包括计算综合征作为码字与积分矢量的点积。 如果综合征等于0,则通过仅删除奇偶校验符号对码字进行解码。 如果综合征不等于0,则通过形成和求解错误位置的误差定位多项式来纠正码字,形成和求解用于位置处的误差幅度的误差幅度多项式并校正码字中的误差。 通过去除奇偶校验符号对码字进行解码。 这些方法是用软件执行的。
    • 15. 发明申请
    • HALTABLE AND RESTARTABLE DMA ENGINE
    • 易燃和可重启的DMA发动机
    • WO2010017263A1
    • 2010-02-11
    • PCT/US2009/052794
    • 2009-08-05
    • SANDBRIDGE TECHNOLOGIES, INC.MOUDGILL, MayanWANG, Shenghong
    • MOUDGILL, MayanWANG, Shenghong
    • G06F13/28
    • G06F13/28
    • A method is described for operation of a DMA engine. Copying is initiated for transfer of a first number of bytes from first source memory locations to first destination memory locations. Then, a halt instruction is issued before the first number of bytes are copied. After copying is stopped, a second number of bytes is established, encompassing those bytes remaining to be copied. After the transfer is halted, a quantity of the second number of bytes is identified. Quantity information is then generated and stored. Second source memory locations are identified to indicate where the second number of bytes are stored. Second source memory location information is then generated and stored. Second destination memory locations are then identified to indicate where the second number of bytes are to be transferred. Second destination memory location information is then generated and stored.
    • 描述了用于DMA引擎的操作的方法。 启动复制以将第一数量的字节从第一源存储器位置传送到第一目的地存储器位置。 然后,在第一个字节数被复制之前发出停止指令。 复制停止后,建立第二个字节数,包含剩下的要复制的字节。 传输停止后,识别出第二个字节数量。 然后生成和存储数量信息。 识别第二源存储器位置以指示第二数量的字节存储在哪里。 然后生成并存储第二源存储器位置信息。 然后识别第二目的地存储器位置以指示要传送第二数量字节的位置。 然后生成并存储第二目的地存储器位置信息。