...
首页> 外文期刊>IEEE Transactions on Computers >Powering by a table look-up and a multiplication with operand modification
【24h】

Powering by a table look-up and a multiplication with operand modification

机译:通过表查找和带有操作数修改的乘法来提供动力

获取原文
获取原文并翻译 | 示例

摘要

An efficient method for generating a power of an operand, i.e., X/sup p/ for an operand X and a given p, is proposed. It is applicable to ps in the form of /spl plusmn/2/sup k/, where k is any integer and of /spl plusmn/2(k/sub 1/) /spl plusmn/2(-k/sub 2/), where k/sub 1/ is any integer and k/sub 2/ is any nonnegative integer. The reciprocal, the square root, the reciprocal square root, the reciprocal square, the reciprocal cube, and so forth are included. The method is a modification of the piecewise linear approximation. A power of an operand is generated through a table look-up and a multiplication with operand modification. The same accuracy is achieved as the piecewise linear approximation. The multiplication and an addition required for the piecewise linear approximation are replaced by only one double-sized multiplication with a slight modification of the operand and, hence, one clock cycle may be reduced. The required table size is reduced because only one coefficient instead of two has to be stored.
机译:提出了一种有效的方法来产生操作数的幂,即针对操作数X和给定p的X / sup p /。它适用于以/ spl plusmn / 2 / sup k /形式的ps,其中k是任何整数,并且是/ spl plusmn / 2(k / sub 1 /)/ spl plusmn / 2(-k / sub 2 / ),其中k / sub 1 /是任何整数,而k / sub 2 /是任何非负整数。包括倒数,平方根,倒数平方根,倒数平方,倒数立方等。该方法是分段线性逼近的一种改进。操作数的幂是通过表查找和操作数修改的乘法生成的。获得与分段线性逼近相同的精度。分段线性逼近所需的乘法和加法仅被一个两倍大小的乘法所取代,并且对操作数进行了少许修改,因此可以减少一个时钟周期。由于仅需要存储一个系数而不是两个系数,因此减少了所需的表大小。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号