会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 91. 发明授权
    • Divide to integer
    • 划分为整数
    • US5661674A
    • 1997-08-26
    • US472963
    • 1995-06-07
    • Ronald Morton Smith, Sr.
    • Ronald Morton Smith, Sr.
    • G06F7/499G06F7/52G06F7/535G06F7/38
    • G06F7/535G06F7/4873G06F7/49957G06F7/49978
    • A system and method for providing an interruptible remainder instruction that can produce a quotient as well as a remainder. Remainders are computed through an iterative procedure. This procedure is carried out in a computer system's hardware by following a series of steps, the series being interruptible at any point. Each step reduces the magnitude of the dividend until the final remainder can be obtained. In the intermediate steps, the sign of the new (smaller in magnitude) dividend is kept the same as the sign of the original dividend, and the value Ni (which can be considered part of the quotient) is rounded toward zero. Only in the last step must the sign of the operands be considered and directed rounding be performed. Throughout the remainder operation, the partial quotients can be saved so that upon completion, not only has the remainder been computed, but so has the quotient.
    • 一种用于提供可产生商以及余数的可中断余数指令的系统和方法。 剩余值通过迭代过程计算。 该过程通过以下一系列步骤在计算机系统的硬件中进行,该系列在任何时候都是可中断的。 每个步骤减少分红的幅度,直到可以获得最后的余数。 在中间步骤中,新(较小幅度)的股息的符号与原始股利的符号保持一致,并且值Ni(可以被认为是商的一部分)被舍入为零。 只有在最后一步必须考虑操作数的符号并执行四舍五入。 在剩余操作中,可以保存部分商,以便在完成后,不仅计算余数,而且商数也是如此。
    • 92. 发明授权
    • Multiplication device using semiconductor memory
    • 使用半导体存储器的乘法器件
    • US5617346A
    • 1997-04-01
    • US462901
    • 1995-06-05
    • Genichiro Inoue
    • Genichiro Inoue
    • G06F1/035G06F7/50G06F7/52
    • G06F7/5324G06F1/0356G06F7/485G06F7/4876G06F7/535G06F7/49957
    • The present invention discloses a multiplication device. A multiplicand X of eight bits and a multiplier Y of eight bits are input and a product P of sixteen bits is found from these multiplication factors. MULTIPLICAND X is divided into two parts, an upper-order part X.sub.U of four bits and a low-order part X.sub.L of four bits. MULTIPLIER Y is likewise divided into two parts, an upper-order part Y.sub.U of four bits and a low-order part Y.sub.L of four bits. Thereafter, four 8-bit partial products, i.e., X.sub.L .times.Y.sub.L, X.sub.L .times.Y.sub.U, X.sub.U .times.Y.sub.L, and X.sub.U .times.Y.sub.U are computed one after another. These partial products are subjected to a digit place alignment addition operation, by an adder, to compute PRODUCT P. Computation of each of the partial products is implemented by performing addition of an approximate partial product AP retrieved by a 6-bit address from a 64-byte ROM, and a correction value H and a carry C generated by a correction value generator.
    • 本发明公开了一种乘法装置。 输入8位的乘法器X和8位的乘法器Y,并从这些乘法因子中找到16位乘积P. MULTIPLICAND X被分为两部分,四位的高阶部分XU和四位的低阶部分XL。 乘法器Y同样分为两部分,四位的高阶部分YU和四位的低阶部分YL。 此后,一个接一个地计算四个8位部分乘积,即XLxYL,XLxYU,XUxYL和XUxYU。 通过加法器对这些部分乘积进行数字位置对准加法运算,以计算出产品P P。通过执行由64位的6位地址检索的近似部分乘积AP的加法来实现每个部分乘积的计算 字节ROM,以及由校正值发生器产生的校正值H和进位C。
    • 96. 发明授权
    • Mathematical function processor utilizing table information
    • 数学函数处理器利用表信息
    • US5537345A
    • 1996-07-16
    • US322537
    • 1994-10-13
    • Hiraku Nakano
    • Hiraku Nakano
    • G06F1/035G06F7/52G06F7/535G06F7/552G06F7/38
    • G06F7/535G06F1/035G06F7/5525G06F2101/08G06F2101/12G06F2207/5521G06F7/4873
    • An input register holds, as an input operand to be square rooted, a floating-point number with an exponential radix is 2. An approximation of the reciprocal of a square root is retrieved from a table information store unit by an address composed of a least significant bit of an exponent and upper bits of a mantissa provided from the input register. The mantissa, with a leading bit appended, is normalized by a normalization circuit in units of two bits. An output of a remainder hold circuit in which a 0th remainder serves as a normalized operand is multiplied by a retrieved approximation to find a partial square root. Partial square roots found in iterative calculations are merged by a digit place alignment circuit and an adder. By making use of an inverter, a multiplicand generator, and an (R+S.times.T) arithmetic unit, a remainder being used in the next iterative calculation is found by subtracting a product of the merged square root times the partial square root from a remainder found in the preceding iterative calculation.
    • 输入寄存器保持作为平方根的输入操作数,具有指数基数的浮点数为2.平方根的倒数的近似从表信息存储单元通过由最少组成的地址来检索 从输入寄存器提供的指数的有效位和尾数的高位。 带有前导位的尾数由归一化电路以两位为单位进行归一化。 将第0个余数作为归一化操作数的余数保持电路的输出乘以检索到的近似值以找到部分平方根。 在迭代计算中发现的部分平方根由位置对齐电路和加法器合并。 通过使用逆变器,被乘数发生器和(R + S×T)运算单元,在下一次迭代计算中使用的余数是通过从发现的余数中减去合并的平方根的乘积乘以部分平方根 在前面的迭代计算中。
    • 98. 发明授权
    • Arithmetic unit for executing division
    • 用于执行分割的算术单元
    • US5517439A
    • 1996-05-14
    • US382576
    • 1995-02-02
    • Hidetoshi SuzukiToshihiro IshikawaYukihiro FujimotoNoriaki Minamida
    • Hidetoshi SuzukiToshihiro IshikawaYukihiro FujimotoNoriaki Minamida
    • G06F7/52G06F7/535
    • G06F7/535G06F2207/5352
    • An arithmetic unit includes an arithmetic and logic circuit having n bits and capable of controlling the execution of either addition or subtraction by responding to a signal indicative of a positive or negative sign of a result of one preceding calculation, a register of n bits for temporarily storing data delivered out of the arithmetic and logic circuit, a register of n bits for delivering a divisor to the arithmetic and logic circuit, a shift register of n stages for sequentially storing signals indicative of a positive or negative sign of results of calculation by the arithmetic and logic circuit, and a shifter for shifting data of the register by one bit to the left and inserting data of the most significant bit of the shift register into the least significant bit to provide an output which in turn is delivered to the arithmetic and logic circuit. A conventional shifter having a bit length of 2n can be replaced with the shifter having a bit length of n and the shift register having a bit length of n.
    • 算术单元包括具有n位的算术和逻辑电路,并且能够通过响应指示前一个计算的结果的正或负符号的信号来控制加法或减法的执行,暂时的n位寄存器 存储从算术和逻辑电路传送的数据,将n个比特的寄存器传送到算术和逻辑电路; n个阶段的移位寄存器,用于顺序地存储指示计算结果的正或负符号的信号, 算术和逻辑电路,以及用于将寄存器的数据向左移一位移位器,并将移位寄存器的最高有效位的数据插入到最低有效位中,以提供一个输出,该输出又被传递到算术和 逻辑电路。 具有2n长度的常规移位器可以用位长度为n的移位器和位长度为n的移位寄存器代替。