Parallel Binary Adders with a Minimum Number of Connections
- 1 October 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-32 (10) , 969-976
- https://doi.org/10.1109/tc.1983.1676144
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
This publication has 2 references indexed in Scilit:
- Minimum Parallel Binary Adders with NOR (NAND) GatesIEEE Transactions on Computers, 1979
- Minimization of Logic Networks Under a Generalized Cost FunctionIEEE Transactions on Computers, 1976