Computation Times of Arithmetic and Boolean Functions in (d, r) Circuits
- 1 June 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-22 (6) , 552-555
- https://doi.org/10.1109/TC.1973.5009105
Abstract
A (d, r) circuit is a d-valued logical circuit in which each element has fan-in at most r and can compute any r-argument d-valued logical function in unit time. In this paper we review results previously published on the computation time of such circuits for addition and multiplication and for computation of general Boolean functions. We also explicitly state hitherto unpublished but known results on the time necessary to divide in such circuits.Keywords
This publication has 8 references indexed in Scilit:
- On the Time Necessary to Compute Switching FunctionsIEEE Transactions on Computers, 1971
- On the Addition of Binary NumbersIEEE Transactions on Computers, 1970
- The Time Required for Group MultiplicationJournal of the ACM, 1969
- On the computation time of certain classes of boolean functionsPublished by Association for Computing Machinery (ACM) ,1969
- On the problem of computational time and complexity of arithmetic functionsPublished by Association for Computing Machinery (ACM) ,1969
- On the Time Required to Perform MultiplicationJournal of the ACM, 1967
- On the Time Required to Perform AdditionJournal of the ACM, 1965
- Signed-Digit Numbe Representations for Fast Parallel ArithmeticIEEE Transactions on Electronic Computers, 1961