The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (1983 vol.32)
pp: 969-976
A. Sakura , Instrumentation Division, Hitachi Ltd.
ABSTRACT
An n-bit parallel binary adder consisting of NOR gates only in single-rail input logic is proved to require at least 17n + 1 connections for any value of n. Such an adder is proved to require at least 7n + 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 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.
INDEX TERMS
ripple adder, Adder with a minimum number of connections, logic design, minimal adder, NOR gates, parallel adder
CITATION
A. Sakura, S. Muroga, "Parallel Binary Adders with a Minimum Number of Connections", IEEE Transactions on Computers, vol.32, no. 10, pp. 969-976, October 1983, doi:10.1109/TC.1983.1676144
21 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool