Publication Type |
Journal Article |
School or College |
College of Engineering |
Department |
Computing, School of |
Creator |
Carter, Tony M. |
Other Author |
Robertson, James E. |
Title |
The set theory of arithmetic decomposition |
Date |
1989 |
Description |
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. |
Type |
Text |
Publisher |
University of Utah |
First Page |
1 |
Last Page |
35 |
Subject |
Arithmetic decomposition; Addition/ subtraction circuits |
Subject LCSH |
Set theory |
Language |
eng |
Bibliographic Citation |
Carter, T. M., & Robertson, J. E. (1989). The set theory of arithmetic decomposition. 1-35. UUCS-89-013. |
Series |
University of Utah Computer Science Technical Report |
Relation is Part of |
ARPANET |
Rights Management |
©University of Utah |
Format Medium |
application/pdf |
Format Extent |
4,370,584 bytes |
Identifier |
ir-main,16172 |
ARK |
ark:/87278/s6w09q9q |
Setname |
ir_uspace |
ID |
704986 |
Reference URL |
https://collections.lib.utah.edu/ark:/87278/s6w09q9q |