DocumentCode :
1131847
Title :
An Algorithm for Transformation of an Arbitrary Switching Function to a Completely Symmetric Function
Author :
Lee, Der Tsai ; Hong, Se June
Author_Institution :
Department of Computer Science and the Coordinated Science Laboratory, University of Illinois
Issue :
11
fYear :
1976
Firstpage :
1117
Lastpage :
1123
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.
Keywords :
Completely symmetric function, repeated variables, symmetric switching functions, transformation of switching function.; Application software; Artificial intelligence; Computer science; Delay; Density estimation robust algorithm; Input variables; Iterative algorithms; Iterative methods; Large scale integration; Upper bound; Completely symmetric function, repeated variables, symmetric switching functions, transformation of switching function.;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1976.1674562
Filename :
1674562
Link To Document :
بازگشت