Synthesis of Combinational Logic Using Decomposition and Probability
- 1 November 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-29 (11) , 1013-1016
- https://doi.org/10.1109/tc.1980.1675497
Abstract
A new algorithm for the synthesis of single-output two-valued combinational logic using decomposition and probability is described. Two probabilistic quantities, the probability of existence of all pertinent decomposition classes, and the probable cost of an N variable function are defined. Results for completely specified functions are derived and tabulated. The extension to incompletely specified functions is discussed. A randomly chosen function is assumed throughout the paper.Keywords
This publication has 10 references indexed in Scilit:
- Synthesis of Combinational Logic Using Decomposition and ProbabilityIEEE Transactions on Computers, 1980
- Simplified Decomposition of Boolean FunctionsIEEE Transactions on Computers, 1976
- Logical Network Cost and EntropyIEEE Transactions on Computers, 1973
- Complex Disjunctive Decomposition of Incompletely Specified Boolean FunctionsIEEE Transactions on Computers, 1973
- A Computer Program for the Synthesis of Switching Circuits by DecompositionIEEE Transactions on Computers, 1972
- A Formula for Logical Network CostIEEE Transactions on Computers, 1968
- Statistical Complexity of Algorithms for Boolean Function MinimizationJournal of the ACM, 1965
- Average Values of Quantities Appearing in Boolean Function MinimizationIEEE Transactions on Electronic Computers, 1964
- Functional Decomposition and Switching Circuit DesignJournal of the Society for Industrial and Applied Mathematics, 1963
- Minimization Over Boolean GraphsIBM Journal of Research and Development, 1962