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 S. Muroga},
  journal={IEEE Transactions on Computers},
  year={1974},
  volume={C-23},
  pages={63-70}
}
  • Tso-Kai Liu, Keith R. Hohulin, +1 author S. Muroga
  • Published 1974
  • Mathematics, Computer Science
  • IEEE Transactions on Computers
    • 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
    17 Citations
    Background Citations
    1
    Methods Citations
    2

    Topics from this paper

    Explore Further: Topics Discussed in This Paper

        17 Citations
        Citation Type

        Citation Type

        Parallel multipliers with NOR gates based on G-minimum adders
        Minimum Parallel Binary Adders with NOR (NAND) Gates
        • 13
        On the adders with minimum tests
        • 19
        • PDF
        Logic Networks of Carry–Save Adders
        Logic Networks of Carry-Save Adders
        • 7
        Logic Networks with a Minimum Number of NOR(NAND) Gates for Parity Functions of n Variables
        • 10
        Designing one-bit Full-Adder/Subtractor based on Multiplexer and LUTs architecture on FPGA
        • 4
        Performance Analysis of 64-Bit Carry Look Ahead Adder
        • 1
        • PDF
        Minimization of Logic Networks Under a Generalized Cost Function
        • 22
        Redundancy check technique for designing optimal networks by branch-and-bound method
        • 1

        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
        • 102
        Logical Design of Optimal Digital Networks by Integer Programming
        • 13
        Design of Optimal Switching Networks by Integer Programming
        • 37
        Threshold logic and its applications
        • 863
        An algorithm for nand decomposition of combinational switching functions
        • 7