The Complexity of Computational Circuits Versus Radix
- 1 October 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-29 (10) , 937-941
- https://doi.org/10.1109/tc.1980.1675480
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
This publication has 10 references indexed in Scilit:
- Logic Design of Multivalued I2L Logic CircuitsIEEE Transactions on Computers, 1979
- Multivalued Integrated Injection LogicIEEE Transactions on Computers, 1977
- The pervasive microprocessor: Trends and prospects: The progressive EE cannot afford to overlook new microprocessor technologies and applications. The author, an expert, tells whyIEEE Spectrum, 1977
- minimization of multivalued functionsPublished by Elsevier ,1977
- computer simplification of multi-valued switching functionsPublished by Elsevier ,1977
- Variable radix multistable integrated circuitsComputer, 1974
- Cost and radixElectronics Letters, 1973
- Computer Minimization of Multivalued Switching FunctionsIEEE Transactions on Computers, 1972
- A Many-Valued Algebra for Switching SystemsIEEE Transactions on Computers, 1970
- A Minimization Technique for Multiple-Valued Logic SystemsIEEE Transactions on Computers, 1968