ComputingComputer EngineeringComputer ScienceAlgorithmsDesign OptimizationOptimizationCoding TheoryCombinational Logic DescriptionHeuristic OptimizationBoolean Function ComplexityBoolean Function MinimizationBoolean Function RepresentationCharacteristic Function FormCircuit Complexity Of Boolean FunctionsMinimization Of Boolean Functions
This paper shows a method to represent a multiple output function: Encoded characteristic function for non-zero outputs (ECFN). The ECFN uses (n+u) binary variables to represent an n-input m-output function, where u=[log/sub 2/m]. The size of the sum-of-products expressions (SOPs) depends on the encoding method of the outputs. For some class of functions, the optimal encoding produces SOPs with O(n) products, while the worst encoding produces SOPs with O(2/sup n/) products. We formulate encoding problem and show a heuristic optimization method. Experimental results using standard benchmark functions show the usefulness of the method.
14
Graph-Based Algorithms for Boolean Function Manipulation
Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text
Synthesis and optimization of digital circuits
Choice Reviews Online · 1994 · 2.4K citations
Engineering, Computer Engineering, Electrical Engineering +17