|
| 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
| ASCII Text | x | ||
| J.R. Armstrong, "The Complexity of Computational Circuits Versus Radix," IEEE Transactions on Computers, vol. 29, no. 10, pp. 937-941, October, 1980. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1980.1675480, author = {J.R. Armstrong}, title = {The Complexity of Computational Circuits Versus Radix}, journal ={IEEE Transactions on Computers}, volume = {29}, number = {10}, issn = {0018-9340}, year = {1980}, pages = {937-941}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1980.1675480}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - The Complexity of Computational Circuits Versus Radix IS - 10 SN - 0018-9340 SP937 EP941 EPD - 937-941 A1 - J.R. Armstrong, PY - 1980 KW - multiple-valued (multivalued) logic KW - Arithmetic circuits KW - complexity KW - computational circuit KW - higher radix design KW - I VL - 29 JA - IEEE Transactions on Computers ER - | |||
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.