The Community for Technology Leaders
Green Image
Issue No. 10 - October (1983 vol. 32)
ISSN: 0018-9340
pp: 969-976
A. Sakura , Instrumentation Division, Hitachi Ltd.
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.
ripple adder, Adder with a minimum number of connections, logic design, minimal adder, NOR gates, parallel adder

S. Muroga and A. Sakura, "Parallel Binary Adders with a Minimum Number of Connections," in IEEE Transactions on Computers, vol. 32, no. , pp. 969-976, 1983.
86 ms
(Ver 3.3 (11022016))