An Iterative Technique for Determining the Minimal Number of Variables for a Totally Symmetric Function with Repeated Variables
Issue No.10 - October (1972 vol.21)
R.C. Born , Department of Electrical Engineering, Michigan Technological University
Several analytic procedures exist for transforming a partially symmetric switching function to a totally symmetric switching function by judiciously repeating certain variables. Presumably the best totally symmetric representation for a given function would be the one having the fewest variables. This note presents an iterative technique for finding the totally symmetric realization for a given function that has the absolute minimum number of variables.
Combinational logic, minimization of switching functions, switching theory, synthesis of switching functions, totally symmetric switching functions, use of partial symmetry information.
R.C. Born, "An Iterative Technique for Determining the Minimal Number of Variables for a Totally Symmetric Function with Repeated Variables", IEEE Transactions on Computers, vol.21, no. 10, pp. 1129-1131, October 1972, doi:10.1109/T-C.1972.223462