International Journal of Electronics · 1993 · 33 citations · 8 references
EngineeringComputer EngineeringComputer ScienceAlgorithmsDesign OptimizationOptimizationBoolean AlgebraBoolean OperationsDigital Logic DesignHeuristic OptimizationLogic SynthesisOptimization-based DesignBoolean Algebra In Circuit DesignBoolean Function MinimizationBoolean Function RepresentationBoolean FunctionsBoolean Logic OptimizationBoolean MinimizationLogic MinimizationMinimization Of Boolean Functions
Abstract Two algorithms are presented, the first is a technique to determine good, though not necessarily optimum, fixed polarity Reed-Muller expansions of completely specified boolean functions. The second algorithm determines the allocations of the ‘don't care’ terms of incompletely specified boolean functions resulting in optimum positive polarity Reed-Muller expansions. Additionally, investigations are made into combining these two techniques to determine fixed polarity Reed-Muller expansions of incompletely specified boolean functions. Results are presented which show the effectiveness of the techniques and comparisons are made with existing methods.
8