Beyond-Binary Arithmetic: Algorithms and VLSI Implementations.
Beyond-Binary Arithmetic: Algorithms and VLSI Implementations.
复制标题
超越二进制算术：算法和 VLSI 实现。
DOI：
10.4036/iis.2000.75
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
T. Higuchi
中科院分区：
文献类型：
--
作者：
T. Aoki;T. Higuchi
超越二进制算术算法是一类新的计算机算术算法，它采用非二进制数据表示，以实现比传统的二进制算法更高的性能。本文给出了超二进制算术算法的突出例子：例子包括（i）不使用查找表的高基数冗余除法算法，（ii）用于快速矢量旋转的高基数冗余CORDIC算法，以及（iii）用于快速真实的/复数混合计算的冗余复数算术算法。
Beyond-binary arithmetic algorithms are defined as a new class of computer arithmetic algorithms which employ non-binary data representations to achieve higher performances beyond those of conventional binary algorithms. This paper presents prominent examples of beyond-binary arithmetic algorithms: examples include (i) a high-radix redundant division algorithm without using lookup tables, (ii) a high-radix redundant CORDIC algorithm for fast vector rotation, and (iii) redundant complex arithmetic algorithms for fast real/complex-mixed computations.