An algorithm for nand decomposition of combinational switching functions
An algorithm for nand decomposition of combinational switching functions
An Algorithm for NAND Decomposition Under Network Constraints
IEEE Transactions on Computers
Design of Optimal Switching Networks by Integer Programming
IEEE Transactions on Computers
IEEE Transactions on Computers - The MIT Press scientific computation series
Logic Networks with a Minimum Number of NOR(NAND) Gates for Parity Functions of n Variables
IEEE Transactions on Computers
Fault Diagnosis of MOS Combinational Networks
IEEE Transactions on Computers
Parallel Binary Adders with a Minimum Number of Connections
IEEE Transactions on Computers
Computer-Aided Logic Design of Two-Level MOS Combinational Networks with Statistical Results
IEEE Transactions on Computers
Exact combinational logic synthesis and non-standard circuit design
Proceedings of the 5th conference on Computing frontiers
| Hi-index | 14.99 |
Based on the intuitive observation that smaller numbers of gates and connections would usually lead to a more compact network on an integrated circuit (IC), a monotonically increasing function of gate count and connection count is concluded to be a reasonable cost function to be minimized in the logical design of a network implemented in IC. Then it is shown that all minimal solutions of such a cost function always can be found among the following: minimal networks with a minimal number of gates as the first objective and a minimal number of connections as the second objective; minimal networks with a minimal number of connections as the first objective and a minimal number of gates as the second objective; and minimal networks which are associated with the above two types of minimal networks. All three of these types of minimal networks of NOR gates, as an example, are calculated by logical design programs based on integer programming, for all functions of 3 or less variables and also some functions of 4 variables which require 5 or less NOR gates. 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.