A fast algorithm to minimize multi-output mixed-polarity generalized Reed-Muller forms

摘要: A very fast computer program that accepts a Boolean function as an array of multi-output disjoint cubes and returns mixed-polarity Generalized Reed-Muller Form is presented. Such circuits often have gates interconnections than classical sum-of-product realizations are easily testable. The was tested on many examples from literature well large arithmetic functions with up to 8 inputs, output 255 minterms. On all the solutions were either same or better those generated by other methods. algorithm based new cube operation, called xlinking, generalizes known operations merger, exclusion logic specified previous authors.