会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 14. 发明申请
    • System and method for performing decimal floating point addition
    • US20060179099A1
    • 2006-08-10
    • US11055231
    • 2005-02-10
    • Steven CarloughWen LiEric Schwarz
    • Steven CarloughWen LiEric Schwarz
    • G06F7/38
    • G06F7/4912G06F2207/4911
    • A method for performing a decimal floating point operation. A first operand including a first coefficient and a first exponent is received. The method also includes receiving a second operand that includes a second coefficient and a second exponent. An operation associated with the first operand and the second operand is received. The operation is an addition or a subtraction. Three concurrent calculations are performed on the first operand and the second operand. The first concurrent calculation includes applying the operation to the first operand and the second operand based on a first assumption that the first exponent is equal to the second exponent. The applying the operation based on the first assumption results in a first result and includes utilizing a two cycle adder. The second concurrent calculation includes applying the operation to the first operand and the second operand based on a second assumption that an absolute difference between the first exponent and the second exponent is less than or equal to a number of leading zeros in the coefficient of the operand with the larger exponent. The applying the operation based on the second assumption results in a second result and includes utilizing the two cycle adder. The third concurrent calculation includes applying the operation to the first operand and the second operand based on a third assumption that the absolute difference between the first exponent and the second exponent is greater than the number of leading zeros in the coefficient of the operand with the larger exponent. The applying the operation based on the third assumption results in a third result and includes utilizing the two cycle adder. A final result is selected from the first result, the second result and the third result.
    • 15. 发明申请
    • Decimal multiplication using digit recoding
    • 使用数字重新编码的十进制乘法
    • US20050010631A1
    • 2005-01-13
    • US10616556
    • 2003-07-10
    • Steven CarloughEric Schwarz
    • Steven CarloughEric Schwarz
    • G06F7/48G06F7/496G06F7/52
    • G06F7/4824G06F7/496
    • A system and methodology for decimal multiplication in a microprocessor comprising: a recoder configured to recode decimal digits of a first operand to a corresponding set of {−5 to +5}. The recoder also configured to recode decimal digits of a second operand to a corresponding set of {−5 to +5}. The system also includes a multiplier array of digit multipliers, each digit multiplier configured to generate a partial product of a selected digit of a recoded first operand and a recoded second operand; and an adder array of digit adders, each adder configured to generate a sum of the partial products, wherein a least significant digit of the sum is shifted to a results register, and each adder includes carry feedback.
    • 一种微处理器中十进制乘法的系统和方法,包括:重新编码器,被配置为将第一操作数的十位数字重新编码为对应的{-5至+5}集合。 编码器还配置为将第二操作数的十进制数字重新编码为相应的{-5到+5}集合。 该系统还包括数字乘法器的乘法器阵列,每个数字乘法器被配置为生成重新编码的第一操作数的选定位数和重新编码的第二操作数的部分乘积; 和加法器数组加法器阵列,每个加法器被配置为产生部分乘积的和,其中该和的最低有效位被移位到结果寄存器,并且每个加法器包括进位反馈。
    • 19. 发明申请
    • Zero detect in partial sums while adding
    • 零点检测部分和,而添加
    • US20060184603A1
    • 2006-08-17
    • US11056036
    • 2005-02-11
    • Son TrongMark ErleBruce FleischerJuergen HaessMichael KellyKlaus KroenerMartin SchmooklerEric Schwarz
    • Son TrongMark ErleBruce FleischerJuergen HaessMichael KellyKlaus KroenerMartin SchmooklerEric Schwarz
    • G06F7/52
    • G06F7/53G06F7/74
    • The present invention relates to a method and circuit for performing multiply-operations in an arithmetic unit of a computer processor. In a multiplier thereof, zero detection of the resulting product bit string (22) is needed for a proper setting of condition code and overflow status information. Zero detection according to prior art decreases the calculation speed in the multiplier. In order to provide a method and respective electronic circuit, wherein the zero detection is earlier completed, it is proposed to use a leading zero anticipation (LZA) hardware—i.e., an LZA circuit (40), which exists usually anyway in floating point processor adders for calculating the number of leading zeros for operand normalization purposes—for performing a zero detection of the product by aid of the partial results (16, 17) emerging at the output of the Wallace tree of the multiplier. MSB-most and LSB-most margin bits (24, 26) of the partial (16, 17) results which cannot be processed by the LZA circuit (40), are read directly from the final product bit string (22).
    • 本发明涉及一种用于在计算机处理器的运算单元中执行乘法运算的方法和电路。 在其乘数中,为了适当地设置条件代码和溢出状态信息,需要对所得到的产品位串(22)进行零检测。 根据现有技术的零检测降低了乘法器中的计算速度。 为了提供一种方法和各自的电子电路,其中零检测较早完成,提出使用前导零预期(LZA)硬件即LZA电路(40),其通常在浮点处理器 用于计算操作数归一化目的的前导零数量的加法器,用于通过在乘法器的华莱士树的输出处出现的部分结果(16,17)执行零检测。 从最终产品位串(22)直接读取不能由LZA电路(40)处理的部分(16,17)结果的MSB最大和LSB最大的边缘位(24,26)。
    • 20. 发明申请
    • System and method for processing limited out-of-order execution of floating point loads
    • 用于处理浮点负载有限次序执行的系统和方法
    • US20060179286A1
    • 2006-08-10
    • US11054201
    • 2005-02-09
    • Juergen HaessMichael KroenerDung NguyenEric SchwarzSon Dao-TrongRaymond Yeung
    • Juergen HaessMichael KroenerDung NguyenEric SchwarzSon Dao-TrongRaymond Yeung
    • G06F9/44
    • G06F9/3867G06F9/3838
    • A system for performing limited out-of order execution of floating point loads. The system includes a plurality of stages making up a pipeline, the stages including an early stage. The system also includes a mechanism for inputting an arithmetic instruction into the pipeline, the arithmetic instruction including a result address. The mechanism also determines if the arithmetic instruction causes a write after write (WAW) condition to occur before writing a result of the arithmetic instruction to the result address. The determining includes comparing the result address to a load address associated with a load instruction subsequent to the arithmetic instruction in the pipeline. The load data associated with the load instruction was written to the load address in the early stage of the pipeline. A WAW condition occurs if the result address is equal to the load address. Writing a result of the arithmetic instruction is suppressed in response to the WAW condition occurring.
    • 用于执行浮点负载有限次序执行的系统。 该系统包括构成管道的多个阶段,这些阶段包括早期阶段。 该系统还包括用于将算术指令输入流水线的机构,算术指令包括结果地址。 该机制还确定在将算术指令的结果写入结果地址之前,算术指令是否在写入(WAW)条件之后发生写入。 确定包括将结果地址与在流水线中的算术指令之后的加载指令相关联的加载地址进行比较。 与加载指令相关联的加载数据在管道的早期阶段被写入加载地址。 如果结果地址等于加载地址,则会发生WAW条件。 响应于发生的WAW状态,写入算术指令的结果被抑制。