会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明公开
    • HIGH PERFORMANCE MANTISSA DIVIDER
    • 高性能的MANTISSA DIVIDER
    • EP0658256A1
    • 1995-06-21
    • EP93919859.0
    • 1993-07-26
    • CRAY RESEARCH, INC.
    • SMITH, James, E.
    • G06F7
    • G06F7/535G06F7/4873G06F7/49947G06F7/5375
    • A high performance floating point mantissa divider employs SRT division, a Radix-4 redundant digit set and the principles of carry-save addition. At each step in the division, the upper few most significant bits of the partial remainder and the divisor are inspected via a look-up table to select the appropriate quotient digits. The quotient digits are represented in a Radix-4 redundant digit set, and the look-up table is generated using SRT division principles. The selected quotient digit is used to control a multiplexor which selects the selected multiple of the divisor. This value is substracted from the partial remainder via a carry-save adder to form the new partial remainder. As the quotient digits are generated, they are placed in two shift registers, one for the sum digits and one for carry digits. When the division is complete, the shift registers are added to give the final quotient mantissa. A combination of a carry save adder and carry lookahead adder reduce the practical implementation to only 8 logic levels.
    • 高性能浮点尾数分频器采用SRT分频,基数-4冗余数字集和进位保存加法原理。 在除法中的每一步中,部分余数和除数的高几位最重要的位通过查找表进行检查,以选择适当的商数字。 商数字用基数-4冗余数字集表示,并且使用SRT分割原理生成查找表。 所选商数字用于控制选择所选倍数除数的多路复用器。 该值通过进位保存加法器从部分余数中减去以形成新的部分余数。 随着商数字的产生,它们被放置在两个移位寄存器中,一个用于总数字,另一个用于进位数字。 分区完成后,移位寄存器被添加到最后的商尾数。 进位保存加法器和进位先行加法器的组合将实际实现减少到只有8个逻辑电平。
    • 5. 发明公开
    • High-radix divider
    • 高分辨率分辨率
    • EP0464493A3
    • 1993-08-18
    • EP91110168.1
    • 1991-06-20
    • KABUSHIKI KAISHA TOSHIBA
    • Mori, Junji, c/o Intellectual Property Div.
    • G06F7/52G06F7/49
    • G06F7/535G06F7/49G06F7/5375
    • A dividend or partial remainder (R (j) ) is stored in a partial remainder register (1). An output of the partial remainder register (1) is shifted to the left by a radix which uses the power of 2 and is larger than 2. A divisor (D) is stored in a divisor register (2). Comparison constants obtained by subjecting an output of the divisor register (2) to predetermined operations are stored in comparison constant registers (3-1, 3-2). Subtracters (5-1, 5-2) respectively receive outputs of the comparison constant registers as one input, receive upper bits of a bit number representing a precision required for conversion and included in the output of the partial remainder shifter (4) as another input, and compare the magnitudes of the two inputs with each other to derive partial quotients. A selector (6) shifts and selects an output of the divisor register (2) according to the signs of the remainder quotients output from the subtracters (5-1, 5-2) to create a factor having a value equal to the integer multiple of the divisor. An adder/subtracter (7) receives an output of the selector (6) and an output of the partial remainder shifter (4) and the addition or subtraction of the adder/subtracter is selectively specified by the sign bit of an output of the partial remainder shifter (4) to derive a partial remainder (R (j+1) ).