# Minimum Parallel Binary Adders with NOR (NAND) Gates

@article{Lai1979MinimumPB, title={Minimum Parallel Binary Adders with NOR (NAND) Gates}, author={H. Lai and S. Muroga}, journal={IEEE Transactions on Computers}, year={1979}, volume={C-28}, pages={648-659} }

Parallel binary adders of n bits long in single-rail input logic which have a minimum number of NOR gates are derived in this paper. The minimality of the number of NOR gates is proved for an arbitrary value of n. Also, it is proved that the adders must be a cascade of basic modules and that there exist many different types of basic modules. These adders have fewer gates and shorter net gate delays (or fewer connections) than the widely used carry-ripple adders which are a cascade of one-bit…

## Figures, Tables, and Topics from this paper

## 13 Citations

Parallel Binary Adders with a Minimum Number of Connections

- Mathematics, Computer ScienceIEEE Transactions on Computers
- 1983

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 and an adder that attains these minimal values is shown.

Logic Networks of Carry-Save Adders

- Computer ScienceIEEE Trans. Computers
- 1982

The derived networks of carry–save adder modules (NOCSAM's) have the advantages of fewer gates, fewer connections, and faster operation.

Logic Networks of Carry–Save Adders

- IEEE Transactions on Computers
- 1982

logic networks of carry–save adders such as high-speed multipliers, multioperand adders, and double-rail input parallel adders are designed based on the parallel adders with a minimum number of NOR…

Parallel multipliers with NOR gates based on G-minimum adders

- Computer ScienceInternational Journal of Computer & Information Sciences
- 2004

The parallel multipliers of NOR gates are designed, by expressing two numbers to be multiplied in the sign and magnitude representation unlike those in Ref. 2, using fewer gates, fewer connections, and faster operation than conventional multiplier based on carry-save adders.

Logic Networks with a Minimum Number of NOR(NAND) Gates for Parity Functions of n Variables

- Mathematics, Computer ScienceIEEE Transactions on Computers
- 1987

Design of logic networks, in single-rail input logic, with a minimum number of NOR gates for parity functions of an arbitrary number of variables is described. This is partly based on minimum…

Comparison of 14 Different Gate Level 1-bit Full Adder Design at Constant Delay

- Computer Science2020 International Conference on Electrical and Electronics Engineering (ICE3)
- 2020

A trade-off among different parameters like Area acquired, Power used, Quality & Performance (PDP), Energy efficiencies (EDP) of fourteen different full adder circuit is calculated and analyzed at 90nm CMOS technology on DSCH 3.8 software.

Area-Time Optimal Adder Design

- Computer ScienceIEEE Trans. Computers
- 1990

A systematic method of implementing a VLSI parallel adder based on a modular design, formulated as a dynamic programming problem, optimizing with respect to area and time, results in an area-time optimal adder in the design family.

A Novel Neural Network Parallel Adder

- Computer ScienceIWANN
- 2013

A design of neural network parallel adder (NNPA) under the framework of multi-layer perceptron (MLP) of binary feedforward neural networks (BFNN) and the DNA-like learning algorithm proposed by the present authors is successfully used for training the weight-threshold values of NNPA.

Computer-Aided Logic Synthesis for VLSI Chips

- Computer ScienceAdv. Comput.
- 1991

This chapter provides an overview of the research on automated logic synthesis, the design of minimal logic networks by integer programming, the transduction method for theDesign of NOR logic networks, the logic design of MOS networks, and SYLON—the new Logic-Synthesis system.

The Complexity of Fault Detection Problems for Combinational Logic Circuits

- Mathematics, Computer ScienceIEEE Transactions on Computers
- 1982

This correspondence analyzes the computational complexity of fault detection problems for combinational circuits and proposes an approach to design for testability, and shows that for k-level (k ≥ 3) monotone/unate circuits these problems are still NP-complete, but that these are solvable in polynomial time for 2-level monot one/ unate circuits.

## References

SHOWING 1-10 OF 17 REFERENCES

NOR-Gate Binary Adder with Carry Completion Detection

- Computer Science
- 1967

This paper presents a parallel binary NOR-gate adder circuit with carry completion detection that is very economical and identical to any other known solution consisting of one-position adders.

A Parallel Accumulator for a General-Purpose Computer

- Computer ScienceIEEE Trans. Electron. Comput.
- 1967

A family of parallel synchronous comparitors and adders are described which can be constructed entirely of either NOR or NAND circuits. An adder is shown combined with registers to form a high speed…

Minimization of Logic Networks Under a Generalized Cost Function

- Mathematics, Computer ScienceIEEE Transactions on Computers
- 1976

According to the computational results, for the majority of the functions the first type of minimal networks is identical to the second type, and for no function were networks of the third type found to exist.

Logical Design of Optimal Digital Networks by Integer Programming

- Computer Science
- 1970

No efficient design method has been known for designing optimal networks with arbitrary types of gates under arbitrary network restrictions, except the exhaustive method, i.e., a method which exhausts all conceivable networks and chooses a best one.

Optimal One-Bit Full Adders With Different Types of Gates

- Mathematics, Computer ScienceIEEE Transactions on Computers
- 1974

Optimal networks with thirty different types of restrictions are listed for the one-bit fuli adder to ensure the minimization of the number of gates under different restrictions.

Design of Optimal Switching Networks by Integer Programming

- Mathematics, Computer ScienceIEEE Transactions on Computers
- 1972

Various optimal networks are derived by a computer as follows: optimal NOR networks and optimal NOR-AND networks for all functions of up through three variables, one-bit adders with various gate types, and others, indicating the computational feasibility of the integer programming approach.

High-Speed Arithmetic in Binary Computers

- Computer ScienceProceedings of the IRE
- 1961

Methods of obtaining high speed in addition, multiplication, and division in parallel binary computers are described and then compared with each other as to efficiency of operation and cost. The…

An Algorithm for NAND Decomposition Under Network Constraints

- Computer ScienceIEEE Transactions on Computers
- 1969

A branch-and-bound algorithm is presented for the synthesis of multioutput, multilevel, cycle-free NAND networks to realize an arbitrary given set of partially or completely specified combinational…

Addition and Subtraction in the Residue Number System

- Mathematics, Computer ScienceIEEE Trans. Electron. Comput.
- 1967

Improved residue expression and new arithmetic algorithms for addition and subtraction are proposed and basic properties of the proposed arithmetic algorithms are also derived.