会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明授权
    • Fast floating point compare with slower backup for corner cases
    • 快速浮点与较慢的备份角落比较
    • US08407275B2
    • 2013-03-26
    • US12255968
    • 2008-10-22
    • Maarten J. BoersmaMichael KroenerSilvia M. MuellerJochen Preiss
    • Maarten J. BoersmaMichael KroenerSilvia M. MuellerJochen Preiss
    • G06F7/02
    • G06F9/30021G06F9/30025
    • A floating point processor unit executes a floating point compare instruction with two operands of the same or different precision by comparing the two operands in integer format, which speeds up the execution of the floating point compare instruction significantly. The floating point processor now executes the floating point compare instruction at least twice as fast or faster (e.g., two clock cycles instead of five clock cycles in the prior art) for nearly most operand cases (e.g., 99% of all cases). Only the rare corner cases require additional operations on one of the operands and thus require additional cycles of execution time because the integer compare operation will not work for these corner cases. This is due to the fact that one operand is a single precision subnormal number in an unnormalized representation (i.e., has two representations) and the other operand is in the SP subnormal range such that the integer compare operation will fail.
    • 浮点处理器单元通过比较整数格式的两个操作数来执行具有相同或不同精度的两个操作数的浮点比较指令,这显着地加快了浮点比较指令的执行。 浮点处理器现在对于几乎大多数操作数情况(例如,所有情况的99%),至少执行两倍快或更快(例如,现有技术中的两个时钟周期而不是五个时钟周期)的浮点比较指令。 只有罕见的角落情况需要在其中一个操作数上进行额外的操作,因此需要额外的执行周期,因为整数比较操作将不适用于这些角色。 这是由于一个操作数是非正规化表示中的单精度子正规数(即,具有两个表示),另一个操作数处于SP子正常范围,使得整数比较操作将失败。
    • 6. 发明申请
    • FAST FLOATING POINT COMPARE WITH SLOWER BACKUP FOR CORNER CASES
    • 快速浮动点与用于角膜的SLOWER BACKUP比较
    • US20100100713A1
    • 2010-04-22
    • US12255968
    • 2008-10-22
    • Maarten J. BoersmaMichael KroenerSilvia M. MeullerJochen Preiss
    • Maarten J. BoersmaMichael KroenerSilvia M. MeullerJochen Preiss
    • G06F9/302
    • G06F9/30021G06F9/30025
    • A floating point processor unit executes a floating point compare instruction with two operands of the same or different precision by comparing the two operands in integer format, which speeds up the execution of the floating point compare instruction significantly. The floating point processor now executes the floating point compare instruction at least twice as fast or faster (e.g., two clock cycles instead of five clock cycles in the prior art) for nearly most operand cases (e.g., 99% of all cases). Only the rare corner cases require additional operations on one of the operands and thus require additional cycles of execution time because the integer compare operation will not work for these corner cases. This is due to the fact that one operand is a single precision subnormal number in an unnormalized representation (i.e., has two representations) and the other operand is in the SP subnormal range such that the integer compare operation will fail.
    • 浮点处理器单元通过比较整数格式的两个操作数来执行具有相同或不同精度的两个操作数的浮点比较指令,这显着地加快了浮点比较指令的执行。 浮点处理器现在对于几乎大多数操作数情况(例如,所有情况的99%),至少执行两倍快或更快(例如,现有技术中的两个时钟周期而不是五个时钟周期)的浮点比较指令。 只有罕见的角落情况需要在其中一个操作数上进行额外的操作,因此需要额外的执行周期,因为整数比较操作将不适用于这些角色。 这是由于一个操作数是非正规化表示中的单精度子正规数(即,具有两个表示),另一个操作数处于SP子正常范围,使得整数比较操作将失败。
    • 7. 发明申请
    • Decimal Floating Point Mechanism and Process of Multiplication without Resultant Leading Zero Detection
    • 十进制浮点机制和乘法过程,无需导致零检测
    • US20110320512A1
    • 2011-12-29
    • US12821648
    • 2010-06-23
    • Steven R. CarloughAdam B. ColluraMichael KroenerSilvia Melitta Mueller
    • Steven R. CarloughAdam B. ColluraMichael KroenerSilvia Melitta Mueller
    • G06F7/44G06F5/01
    • G06F7/4915G06F2207/4911
    • A decimal multiplication mechanism for fixed and floating point computation in a computer having a coefficient mechanism without resulting leading zero detection (LZD) and process which assumes that the final product will be M+N digits in length and performs all calculations based on this assumption. Least significant digits that would be truncated are no longer stored, but retained as sticky information which is used to finalize the result product. Once the computation of the product is complete, a final check based on the examination of key bits observed during partial product accumulation is used to determine if the final product is truly M+N digits in length, or M+N−1 digits. If the latter is true, then corrective final product shifting is employed to obtain the proper result. This eliminates the need for dedicated leading zero detection hardware used to determine the number of significant digits in the final product. The corrective final product shifting also incorporates adjustments to the coefficient of the product when the product's exponent is at its extremes and the final product must be brought to be within the precision and range of a given format.
    • 具有系数机制而不产生前导零检测(LZD)的计算机中的固定和浮点计算的十进制乘法机制,其假设最终产品的长度为M + N个数字,并且基于该假设执行所有计算。 将被截断的最低有效数字不再存储,而是保留为用于确定结果产品的粘性信息。 一旦产品的计算完成,就使用基于在部分积累期间观察到的关键位的检查的最终检查来确定最终产品是真正的M + N个数字的长度,还是M + N-1个数字。 如果后者是真实的,则采用校正最终产品转换来获得适当的结果。 这消除了用于确定最终产品中有效数字数量的专用前导零检测硬件的需要。 当产品的指数处于极端状态并且最终产品必须在给定格式的精度和范围内时,纠正性最终产品转移也会对产品系数进行调整。
    • 8. 发明申请
    • System and method for performing floating point store folding
    • 执行浮点存储折叠的系统和方法
    • US20060179100A1
    • 2006-08-10
    • US11054686
    • 2005-02-09
    • Juergen HaessMichael KroenerDung NguyenLawrence PowellEric SchwarzSon Dao-TrongRaymond Yeung
    • Juergen HaessMichael KroenerDung NguyenLawrence PowellEric SchwarzSon Dao-TrongRaymond Yeung
    • G06F7/38
    • G06F9/3826G06F9/30014G06F9/3824G06F9/3838G06F9/3885
    • A system for performing floating point arithmetic operations including a plurality of stages making up a pipeline, the stages including a first stage and a last stage. The system also includes a register file adapted for receiving a store instruction for input to the pipeline, where the data associated with the store instruction is dependent on a previous operation still in the pipeline. The system further includes a store register adapted for outputting the data associated with the store instruction to memory and a control unit having instructions. The instructions are directed to inputting the store instruction into the pipeline and to providing a path for forwarding the data associated with the store instruction from the last stage in the pipeline to the store register for use by the store instruction if the previous operation immediately precedes the store operation in the pipeline and if there is a data type match between the store instruction and the previous operation. In addition, the instructions are directed to inputting the store instruction into the pipeline and to providing a path for forwarding the data associated with the store instruction from the first stage in the pipeline to the store register for use by the store instruction if the previous operation precedes the store operation by one or more stage in the pipeline and if there is a data type match between the store instruction and the previous operation.
    • 一种用于执行浮点算术运算的系统,包括构成流水线的多个级,所述级包括第一级和最后级。 该系统还包括适于接收用于输入到流水线的存储指令的寄存器文件,其中与存储指令相关联的数据依赖于仍在流水线中的先前操作。 该系统还包括适于将与存储指令相关联的数据输出到存储器的存储寄存器和具有指令的控制单元。 这些指令旨在将存储指令输入到流水线中,并且提供一个路径,用于将与流水线中的最后一级相关联的存储指令的数据转发到存储寄存器以供存储指令使用,如果先前的操作紧接在 存储操作在流水线中,并且存储指令与先前操作之间存在数据类型匹配。 此外,该指令旨在将存储指令输入到流水线中,并且提供用于将与流水线中的第一级相关联的存储指令的数据转发到存储寄存器以供存储指令使用的路径,如果先前的操作 在存储操作之前在流水线中的一个或多个阶段,以及存储指令和先前操作之间是否存在数据类型匹配。