Generating minimal covers of symmetric functions
Donald L. Dietmeyer · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 1993
An algorithm is offered for generating minimum-cost, two-level expressions for totally symmetric, complete switching functions. The algorithms discussed were programmed in TurboPascal (and TurboC) and executed on an IBM PS/2-80. Many symmetric switching functions of from 7 to 15 variables were minimized and the results validated against the original specifications of the functions. Run times varied from a tenth to tens of seconds and were heavily dependent on the size of the input array and the literals of symmetry.>