THE SET-THEORY OF ARITHMETIC DECOMPOSITION

被引：7
|
作者：
CARTER, TM [1 ]
ROBERTSON, JE [1 ]
机构：
[1] UNIV ILLINOIS,DEPT COMP SCI,URBANA,IL 61801
来源：
IEEE TRANSACTIONS ON COMPUTERS | 1990年 / 39卷 / 08期
基金：
美国国家科学基金会;
关键词：
Adders; arithmetic decomposition; hardware design; high radix arithmetic; redundant arithmetic;
D O I：
10.1109/12.57037
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The Set Theory of Arithmetic Decomposition is a method for designing complex addition/subtraction circuits at any radix using strictly positional, sign-local number systems. The specification of an addition circuit is simply an equation that describes the inputs and the outputs as weighted digit sets. Design is done by applying a set of rewrite rules known as decomposition operators to the equation. The order in which and weight at which each operator is applied maps directly to a physical implementation, including both multiple-level logic and connectivity. The method is readily automated and has been used to design some higher radix arithmetic circuits. It is possible to compute the cost of a given adder before the detailed design is complete. © 1990 IEEE
引用
收藏
页码：993 / 1005
页数：13
相关论文
共 50 条
12345