Heuristic AMD-OR-EXOR three-level minimisation algorithm for multiple-output incompletely-specified Boolean functions

摘要

Given a logic function f, an AND-OR-EXOR representation of f comprises a pair of sum-of-products expressions connected by a single two-input EXOR operator such that the resulting expression realises f. The AND-OR-EXOR form of a logic function has been observed to have a more compact representation for functions like arithmetic, control, ALU circuits, etc. Compared to sum-of-products as well as EXOR-sum-products based representations.