Design Automation Conference · 1988 · 92 citations · 23 references
EngineeringComputer EngineeringComputer ScienceAlgorithmic DesignAlgorithmsOptimizationBoolean AlgebraBoolean OperationsCircuit ComplexityCombinational Logic DescriptionDigital Logic DesignLogic SynthesisArithmetic Circuit EvaluationArithmetic Circuit SynthesisBoolean Circuit EvaluationBoolean Function MinimizationBoolean Function RepresentationBoolean Logic OptimizationCombinational Circuit OptimizationMinimization Of Boolean Functions
A very fast computer program that accepts a Boolean function as an array of multi-output disjoint cubes and returns a mixed-polarity Generalized Reed-Muller Form is presented. Such circuits often have gates and interconnections than classical sum-of-product realizations and are easily testable. The program was tested on many examples from literature as well as on many large arithmetic functions with up to 8 inputs, 8 output and 255 minterms. On all the examples from the literature the solutions were either the same or better than those generated by other methods. The algorithm is based on a new cube operation, called xlinking, that generalizes known operations of merger, exclusion and other logic operations specified by previous authors.
23
Logic Testing and Design for testability
Computer-Aided Design · 1986 · 324 citations
Discrete and switching functions.
Mathematics and Computers in Simulation · 1979 · 295 citations
Easily Testable Realizations ror Logic Functions
S.M. Reddy · IEEE Transactions on Computers · 1972 · 278 citations