Efficient elementary function generation with multipliers

Efficient elementary function generation with multipliers
复制标题

DOI:
10.1109/arith.1989.72809
复制
发表时间:
1989-09
期刊:
Proceedings of 9th Symposium on Computer Arithmetic
影响因子:
--
通讯作者:
H. Ahmed
H. Ahmed
中科院分区:
其他
文献类型:
--
作者:
H. Ahmed

文献摘要

被引文献

相似文献

几乎所有的初等函数生成的数值技术都有一个共同的特性,即通过迭代执行移位运算来避免乘法。然而,随着超大规模集成电路的出现,乘数的经济性大大不如以前那么强大。作者提出将乘法器与这些无乘法算法相结合,构造出快速生成初等函数的方法。他通过将乘法器与CORDIC算法相结合来实现快速矢量旋转来演示这一想法。
Virtually all numerical techniques for elementary function generation share the common property of avoiding multiplication by iteratively performing shift operations. However, with the advent of VLSI, multiplier economics are considerably less formidable than before. The author proposes combining multipliers with these multiplication-free algorithms to construct fast methods of elementary function generation. He demonstrates the idea by combining multipliers with the CORDIC algorithm to achieve fast vector rotation.>