This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Complexity of Computational Circuits Versus Radix
October 1980 (vol. 29 no. 10)
pp. 937-941
J.R. Armstrong, Department of Electrical Engineering, Virginia Polytechnic Institute and State University
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.
Index Terms:
multiple-valued (multivalued) logic, Arithmetic circuits, complexity, computational circuit, higher radix design, I
Citation:
J.R. Armstrong, "The Complexity of Computational Circuits Versus Radix," IEEE Transactions on Computers, vol. 29, no. 10, pp. 937-941, Oct. 1980, doi:10.1109/TC.1980.1675480
Usage of this product signifies your acceptance of the Terms of Use.