PARALLEL BINARY ADDERS WITH A MINIMUM NUMBER OF CONNECTIONS.

Akito Sakurai, Saburo Muroga

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

An n-bit parallel binary adder consisting of NOR gates only in single-rail input logic is proved to require at least 17n plus 1 connections for any value of n. Such an adder is proved to require at least 7n plus 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 H. C. Lai and S. 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. 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.

Original languageEnglish
Pages (from-to)969-976
Number of pages8
JournalIEEE Transactions on Computers
VolumeC-32
Issue number10
Publication statusPublished - 1983 Oct
Externally publishedYes

Fingerprint

Adders
Binary
Minimality
Logic
Rails
Module

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

PARALLEL BINARY ADDERS WITH A MINIMUM NUMBER OF CONNECTIONS. / Sakurai, Akito; Muroga, Saburo.

In: IEEE Transactions on Computers, Vol. C-32, No. 10, 10.1983, p. 969-976.

Research output: Contribution to journalArticle

Sakurai, A & Muroga, S 1983, 'PARALLEL BINARY ADDERS WITH A MINIMUM NUMBER OF CONNECTIONS.', IEEE Transactions on Computers, vol. C-32, no. 10, pp. 969-976.
Sakurai, Akito ; Muroga, Saburo. / PARALLEL BINARY ADDERS WITH A MINIMUM NUMBER OF CONNECTIONS. In: IEEE Transactions on Computers. 1983 ; Vol. C-32, No. 10. pp. 969-976.
@article{f59129a001f14751a15f52c944b33705,
title = "PARALLEL BINARY ADDERS WITH A MINIMUM NUMBER OF CONNECTIONS.",
abstract = "An n-bit parallel binary adder consisting of NOR gates only in single-rail input logic is proved to require at least 17n plus 1 connections for any value of n. Such an adder is proved to require at least 7n plus 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 H. C. Lai and S. 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. 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.",
author = "Akito Sakurai and Saburo Muroga",
year = "1983",
month = "10",
language = "English",
volume = "C-32",
pages = "969--976",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "10",

}

TY - JOUR

T1 - PARALLEL BINARY ADDERS WITH A MINIMUM NUMBER OF CONNECTIONS.

AU - Sakurai, Akito

AU - Muroga, Saburo

PY - 1983/10

Y1 - 1983/10

N2 - An n-bit parallel binary adder consisting of NOR gates only in single-rail input logic is proved to require at least 17n plus 1 connections for any value of n. Such an adder is proved to require at least 7n plus 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 H. C. Lai and S. 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. 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.

AB - An n-bit parallel binary adder consisting of NOR gates only in single-rail input logic is proved to require at least 17n plus 1 connections for any value of n. Such an adder is proved to require at least 7n plus 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 H. C. Lai and S. 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. 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.

UR - http://www.scopus.com/inward/record.url?scp=0020831145&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020831145&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0020831145

VL - C-32

SP - 969

EP - 976

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 10

ER -