DocumentCode
1147520
Title
Parallel Binary Adders with a Minimum Number of Connections
Author
Sakura ; Muroga, Saburo
Author_Institution
Instrumentation Division, Hitachi Ltd.
Issue
10
fYear
1983
Firstpage
969
Lastpage
976
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.
Keywords
Adder with a minimum number of connections; NOR gates; logic design; minimal adder; parallel adder; ripple adder; Adders; Application software; Computer science; Concurrent computing; Costs; Logic design; Logic devices; Microprocessor chips; Minimization methods; Parasitic capacitance; Adder with a minimum number of connections; NOR gates; logic design; minimal adder; parallel adder; ripple adder;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1983.1676144
Filename
1676144
Link To Document