International Journal of Electronics · 1991 · 65 citations · 11 references
EngineeringComputer EngineeringComputer ScienceCircuit TheoryCombinatoricsField-programmable Gate ArraysBoolean AlgebraCircuit ComplexityDigital Logic DesignLogic SynthesisMany-valued LogicModular FormsBoolean Function DecompositionBoolean Function RepresentationCanonical Form ComputationCanonical FormsHierarchyModular Circuit DesignMulti-level Logic SynthesisSwitching Functions
The existence of a large number of Reed-Muller canonical forms for switching functions is demonstrated and it is shown that these can be arranged in a nested hierarchy of families with increasing size and decreasing general structure. Many of these forms can be derived, and their weights evaluated for particular functions, by employing recursively defined incidence matrices operating on an extended form of truth vector. The more useful forms are also characterized by their being realizable using a modular circuit tree involving combinations of 1-variable sub-modules.
11
Discrete and switching functions.
Mathematics and Computers in Simulation · 1979 · 295 citations
Easily testable realizations for logic functions
S.M. Reddy · Computer-Aided Design · 1973 · 96 citations