会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 再颁专利
    • Method and apparatus for performing mathematical functions using polynomial approximation and a rectangular aspect ratio multiplier
    • 使用多项式近似和矩形长宽比乘数执行数学函数的方法和装置
    • USRE39385E1
    • 2006-11-07
    • US08109577
    • 1993-08-19
    • Thomas B. BrightmanWillard S. BriggsWarren E. Ferguson
    • Thomas B. BrightmanWillard S. BriggsWarren E. Ferguson
    • G06F7/52
    • G06F7/544
    • A method for approximating mathematical functions using polynomial expansions is implemented in a numeric processing system (10) which comprises a control and timing circuit (18), a microprogram store (20) and a multiplier circuit (34). The multiplier circuit (34) may comprise a rectangular aspect ratio multiplier circuit (40) having an additional ADDER INPUT to enable the repeated evaluation of first order polynomials to evaluate polynomial expansions associated with each mathematical function. A constant store (28) is used to store predetermined coefficients for the polynomial expansion associated with each mathematical functions function. The microprogram store (20) is used to store argument transformation routines, polynomial expansions and result transformation routines associated with each mathematical function. The questions raised in reexamination request No. 90/004,138, filed Feb. 12, 1996, have been considered and the results thereof are reflected in this reissue patent which constitutes the reexamination certificate required by 35 U.S.C. 307 as provided in 37 CFR 1.570(e).
    • 在包括控制和定时电路(18),微程序存储(20)和乘法器电路(34)的数字处理系统(10)中实现用于使用多项式扩展近似数学函数的方法。 乘法器电路(34)可以包括具有额外的ADDER INPUT的矩形宽高比乘法器电路(40),以使得能够重复评估一阶多项式以评估与每个数学函数相关联的多项式扩展。 常数存储器(28)用于存储与每个数学相关联的多项式展开的预定系数<?delete-start id =“DEL-S-00001”date =“20061107”?>函数<?delete-end id =“ DEL-S-00001“?> <?insert-start id =”INS-S-00001“date =”20061107“?> function <?insert-end id =”INS-S-00001“?>。 微程序存储器(20)用于存储与每个数学函数相关联的参数转换程序,多项式展开和结果转换程序。 已经考虑了1996年2月12日提交的第90 / 004,138号复审请求中提出的问题,其结果反映在该重新颁发专利中,该专利构成了35U.S.C.所要求的复审证书。 307如第37 CFR 1.570(e)条所规定。
    • 2. 发明授权
    • Cache coherency without bus master arbitration signals
    • 高速缓存一致性无总线主控仲裁信号
    • US5724549A
    • 1998-03-03
    • US131043
    • 1993-10-01
    • Thomas D. SelgasThomas B. BrightmanWilliam C. Patton, Jr.
    • Thomas D. SelgasThomas B. BrightmanWilliam C. Patton, Jr.
    • G06F12/08G06F13/00
    • G06F12/0831
    • A method of data communication between asynchronous processes of a computer system is disclosed in connection with a cache coherency system for a processor-cache used in a multi-master computer system in which bus arbitration signals either are not available to the processor-cache, or are not exclusively relied on by the processor-cache to assure validity of the data in the cache (e.g., a 386-bus compatible computer system using an external secondary cache in which bus arbitration signals are only connected to and used by the secondary cache controller). In an exemplary external-chip implementation, the cache coherency system (120) comprises two PLAs--a FLUSH module (122) and a WAVESHAPING module (124). The FLUSH module (a) receives selected bus cycle definition and control signals from a microprocessor ((110), (b) detects FLUSH (cache invalidation) conditions, i.e., bus master synchronization events, and for each such FLUSH condition, (c) provides a FLUSH output signal. The WAVESHAPING module provides a corresponding CPU/FLUSH signal to the microprocessor with the appropriate set up and hold time. The exemplary bus master synchronization events, or FLUSH conditions, that cause cache invalidation are: (a) hardware generated interrupts, and (b) read or read/write accesses to I/O address space, except for those directed to a hard disk or an external coprocessor. If the bus architecture uses memory-mapped I/O, accesses to selected regions of memory-mapped I/O space could also be used. The cache coherency functionality could be implemented on-board the microprocessor.
    • 公开了一种用于计算机系统的异步过程之间的数据通信的方法,其结合用于多主计算机系统中使用的处理器 - 高速缓存一致性系统,其中总线仲裁信号对于处理器高速缓存不可用,或 不完全依赖于处理器缓存来确保缓存中的数据的有效性(例如,使用外部二级高速缓存的386总线兼容的计算机系统,其中总线仲裁信号仅连接到二级缓存控制器并由二级缓存控制器使用 )。 在示例性的外部芯片实现中,高速缓存一致性系统(120)包括两个PLA-FLUSH模块(122)和WAVESHAPING模块(124)。 FLUSH模块(a)从微处理器接收所选择的总线周期定义和控制信号((110),(b)检测FLUSH(高速缓存无效)条件,即总线主同步事件,以及每个这样的FLUSH条件,(c) 提供FLUSH输出信号,WAVESHAPING模块在相应的设置和保持时间内为微处理器提供相应的CPU / FLUSH信号,导致高速缓存无效的示例性总线主站同步事件或FLUSH条件是:(a)硬件产生 中断和(b)对I / O地址空间的读/写访问,除了定向到硬盘或外部协处理器的访问,如果总线架构使用存储器映射I / O,则访问所选择的存储区域 也可以使用映射的I / O空间。高速缓存一致性功能可以在微处理器上实现。
    • 3. 发明授权
    • Method and apparatus for performing the square root function using a
rectangular aspect ratio multiplier
    • 使用矩形宽高比乘数执行平方根函数的方法和装置
    • US5159566A
    • 1992-10-27
    • US852917
    • 1992-03-13
    • Willard S. BriggsThomas B. BrightmanDavid W. Matula
    • Willard S. BriggsThomas B. BrightmanDavid W. Matula
    • G06F7/552
    • G06F7/5525
    • A method and apparatus for performing the square root function which first comprises approximating the short reciprocal of the square root of the operand. A reciprocal bias adjustment factor is added to the approximation and the result truncated to form a correctly biased short reciprocal. The short reciprocal is then multiplied by a predetermined number of the most significant bits of the operand and the product is appropriately truncated to generate a first root digit value. The multiplication takes place in a multiplier array having a rectangular aspect raio with the long side having a number of bits essentially as large as the number of bits required for the desired full precision root. The short side of the multiplier array has a number of bits slightly greater by several guard bits than the number of bits required for a single root digit value, which is also determined to be the number of bits in the short reciprocal. The root digit value is squared and the exact square is subtracted from the operand to yield an exact remainder. Succeeding new root digit values are determined by multiplying the short reciprocal by the appropriately shifted current remainder, selectively adding a digit bias adjustment factor and truncating the product. The root digit values are appropriately shifted and accumulated to form a partial root. The described steps are repeated to serially generate root digit values and partial roots with corresponding new exact remainders.
    • 一种用于执行平方根函数的方法和装置,其首先包括近似操作数的平方根的短倒数。 将相应的偏差调整因子添加到近似值中,并将结果截断以形成正确偏置的短倒数。 然后将该短互逆乘以操作数的预定数量的最高有效位,并且将产品适当地截断以产生第一根数值。 乘法发生在具有矩形方面的乘法器阵列中,其中长边具有基本上与期望的全精度根所需的位数一样大的位数。 乘法器阵列的短边比单个根数值所需的位数多几个保护位的位数稍大一些,这也被确定为短倒数中的位数。 根数值平方,并从操作数中减去精确的平方,以产生精确的余数。 通过将短倒数乘以适当移位的电流余数来确定新的根数值,选择性地添加数字偏差调整因子并截断产品。 根数值被适当地移位和累加以形成部分根。 重复描述的步骤以连续地产生具有相应新的精确余数的根数值和部分根。
    • 5. 发明授权
    • Method and apparatus for performing the square root function using a
rectangular aspect ratio multiplier
    • 使用矩形纵坐标乘法器执行平方根功能的方法和装置
    • US5060182A
    • 1991-10-22
    • US402822
    • 1989-09-05
    • Willard S. BriggsThomas B. BrightmanDavid W. Matula
    • Willard S. BriggsThomas B. BrightmanDavid W. Matula
    • G06F7/552
    • G06F7/5525
    • A method and apparatus for performing the square root function which first comprises approximating the short reciprocal of the square root of the operand. A reciprocal bias adjustment factor is added to the approximation and the result truncated to form a correctly biased short reciprocal. The short reciprocal is then multiplied by a predetermined number of the most significant bits of the operand and the product is appropriately truncated to generate a first root digit value. The multiplication takes place in a multiplier array having a rectangular aspect ratio with the long side having a number of bits essentially as large as the number of bits required for the desired full precision root. The short side of the multiplier array has a number of bits slightly greater by several guard bits than the number of bits required for a single root digit value, which is also determined to be the number of bits in the short reciprocal. The root digit value is squared and the exact square is subtracted from the operand to yield an exact remainder. Succeeding new root digit values are determined by multiplying the short reciprocal by the appropriately shifted current remainder, selectively adding a digit bias adjustment factor and truncating the product. The root digit values are appropriately shifted and accumulated to form a partial root. The described steps are repeated to serially generate root digit values and partial roots with corresponding new exact remainders.