An Algorithm for Transformation of an Arbitrary Switching Function to a Completely Symmetric Function

Authors:
Der Tsai Lee; Se June Hong
Affiliations:
Department of Computer Science and the Coordinated Science Laboratory, University of Illinois;-
Venue:
IEEE Transactions on Computers
Year:
1976

Citing 5
Cited 0

Bounds to Complexities of Networks for Sorting and for Switching

Journal of the ACM (JACM)
On Symmetric Functions with Redundant Variables-Weighted Functions

IEEE Transactions on Computers
Transformation of Switching Functions to Completely Symmetric Switching Functions

IEEE Transactions on Computers
An Iterative Technique for Determining the Minimal Number of Variables for a Totally Symmetric Function with Repeated Variables

IEEE Transactions on Computers
Transformation of an Arbitrary Switching Function to a Totally Symmetric Function

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

It is well known that any switching function may be transformed into a completely symmetric function when repetition of the input variables is allowed. We present an algorithm that may be applied to reduce the number of repeated variables when the transformation is performed. The method is based on an iterative construction of symmetric functions by admitting an increasing number of variables towards a completely symmetric function. The algorithm produces a near minimal number of the total number of inputs in the resultant symmetric function. This algorithm can also be used to determine all partially symmetric variable sets of a given function.