Title :
The Complexity of Computational Circuits Versus Radix
Author :
Armstrong, James R.
Author_Institution :
Department of Electrical Engineering, Virginia Polytechnic Institute and State University
Abstract :
The complexity of computational circuits versus radix is analyzed. Necessary and sufficient conditions are given that ensure that the complexity of certain computational circuits will be a monotonically decreasing function of radix. Mechanizations of a higher radix ripple carry adder, look-ahead adder, magnitude comparator, and parallel multiplier are given. Each mechanization is implemented using both I2L threshold logic and standard multiple-valued logic primitives and then tested against the necessary and sufficient conditions previously developed. A comparison is made of the relative effectiveness of I2L threshold logic versus logic primitives in realizing computational circuits whose complexity is a decreasing function of radix.
Keywords :
Arithmetic circuits; I; complexity; computational circuit; higher radix design; multiple-valued (multivalued) logic; Circuit faults; Circuit testing; Digital systems; Electrons; Fault detection; Fault diagnosis; Fault tolerance; Instruments; Notice of Violation; Partitioning algorithms; Arithmetic circuits; I; complexity; computational circuit; higher radix design; multiple-valued (multivalued) logic;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1980.1675480
