Parallel binary adders with a minimum number of connections
An >n>-bit parallel binary adder consisting of nor gates only in single-rail input logic is proved to require at least 17>n> + 1 connections for any value of >n>. Such an adder is proved to require at least 7>n> + 2 gates. An adder that attains these minimal values is shown. Also, it is concluded that some of the parallel adders with the minimum number of nor gates derived by Lai and Muroga (ibid., vol. C-28, no. 9, pp. 648-659, 1979) have the minimum number of connections as well as the minimum number of gates, except for the two modules for the two least-significant bit positions. In general, it is extremely difficult to prove the minimality of the number of gates in an arbitrarily large logic network, and it is even more difficult to prove the minimality of the number of connections. Both problems have been solved for >n>-bit adders of nor gates in single-rail input logic. 7 references.
- Research Organization:
- Univ. of Illinois, Urbana
- OSTI ID:
- 5294956
- Journal Information:
- IEEE Trans. Comput.; (United States), Vol. 10
- Country of Publication:
- United States
- Language:
- English
Similar Records
HIGH-SPEED TRANSISTORIZED ADDER FOR A DIGITAL COMPUTER
Four-to-two adder cell for parallel multiplication