2003 · 26 citations · 12 references
EngineeringComputer EngineeringComputer ScienceAlgorithmsFault-tolerant ComputingOptimizationError DetectionNumerical AnalysisCanonical Form ComputationCircuit MinimizationExperimental Results InterpretationMinimizationMinimization Of Boolean Functions
A quasi-minimal algorithm for canonical restricted mixed polarity (CRMP) AND/XOR forms is presented. These forms, which include the consistent and inconsistent generalized Reed-Muller (GRM) forms, are both very easily testable and, on average, have smaller numbers of terms than sum-of-product (SOP) expressions. The set of test vectors for detecting stuck-at and bridging faults of a function realized in CRMP forms, like that of consistent (GRM) forms, is independent of the function. This test can be of order (n+4)r, where n is the number of variables in the function and r is the number of component consistent GRMs in the CRMP. The experimental results confirm the compactness of CRMPs as compared to SOP expressions.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
12
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
On the complexity of mod-2l sum PLA's
T. Sasao, Philipp W. Besslich · IEEE Transactions on Computers · 1990 · 180 citations