Optimal One-Bit Full Adders With Different Types of Gates

@article{Liu1974OptimalOF,
  title={Optimal One-Bit Full Adders With Different Types of Gates},
  author={Tso-Kai Liu and Keith R. Hohulin and Lih-Er Shiau and Saburo Muroga},
  journal={IEEE Transactions on Computers},
  year={1974},
  volume={C-23},
  pages={63-70}
}
Optimal networks with thirty different types of restrictions are listed for the one-bit fuli adder. Optimality is derined as the minimization of the number of gates under different restrictions. 
View on IEEE
doi.org
18 Citations
Background Citations
1
Methods Citations
2

Topics from this paper

      18 Citations

      Citation Type

      Citation Type

      Parallel multipliers with NOR gates based on G-minimum adders
      TLDR
      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. Expand
      Minimum Parallel Binary Adders with NOR (NAND) Gates
      • H. Lai, S. Muroga
      • Mathematics, Computer Science
      • IEEE Transactions on Computers
      • 1979
      TLDR
      The minimality of the number of NOR gates is proved for an arbitrary value of n and it is proved that the adders must be a cascade ofbasic modules and that there exist many different types of basic modules. Expand
      On the adders with minimum tests
      TLDR
      Two types of n-bit adders, ripple carry adders and cascaded carry look-ahead adders are considered, with minimum tests for stuck-at-fault models, and it is proved that one of the full adders can be tested by only three test patterns for single stuck- at-faults. Expand
      Logic Networks of Carry–Save Adders
      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… Expand
      Logic Networks of Carry-Save Adders
      TLDR
      The derived networks of carry–save adder modules (NOCSAM's) have the advantages of fewer gates, fewer connections, and faster operation. Expand
      Logic Networks with a Minimum Number of NOR(NAND) Gates for Parity Functions of n Variables
      • H. Lai, S. Muroga
      • Mathematics, Computer Science
      • IEEE 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… Expand
      Designing one-bit Full-Adder/Subtractor based on Multiplexer and LUTs architecture on FPGA
      TLDR
      This paper aims to provide a history of electronic and Communication technology in Vietnam from the 1970s to the present day with a focus on Hunan University and its students. Expand
      mAnAGement OF teCHniCAl OBJeCtS
      Addition is one of the timing critical operations in most of modern processing units. For decades, extensive research has been done devoted to designing higher speed and less complex adder… Expand
      Performance Analysis of 64-Bit Carry Look Ahead Adder
      TLDR
      64-bit CLA is discussed and simulation results for 32bit and 64bit CLA has been exposed and the purposed design shows the Performance parameter chip area and delay in results. Expand
      Minimization of Logic Networks Under a Generalized Cost Function
      • S. Muroga, H. Lai
      • Mathematics, Computer Science
      • IEEE Transactions on Computers
      • 1976
      TLDR
      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. Expand
      ...
      1
      2
      ...

      References

      SHOWING 1-5 OF 5 REFERENCES
      A Catalog of Three-Variable Or-Invert and And-Invert Logical Circuits
      • L. Hellerman
      • Mathematics, Computer Science
      • IEEE Trans. Electron. Comput.
      • 1963
      This report gives a complete catalog of minimal NOR circuits and minimal NAND circuits, assuming complements not available, for all logic functions of three variables. Minimal circuits for a function… Expand
      Logical Design of Optimal Digital Networks by Integer Programming
      TLDR
      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. Expand
      Design of Optimal Switching Networks by Integer Programming
      TLDR
      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. Expand
      Threshold logic and its applications
      An algorithm for nand decomposition of combinational switching functions