Transformation of an Arbitrary Switching Function to a Totally Symmetric Function

IEEE Transactions on Computers

Volumn C-20, Issue 12, 1971, Pages 1606-1609

  Yau, S S ^a   Tang, Y S ^a  

^a NORTHWESTERN UNIVERSITY   (United States)

Author keywords

Least upper bound; switching functions; technique; totally symmetric functions; transformation

Indexed keywords

MATHEMATICAL TRANSFORMATIONS; SWITCHING FUNCTIONS; SWITCHING THEORY;

AUTOMATA THEORY;

EID: 0015202610     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/T-C.1971.223182     Document Type: Article

References (4)

1. [1] R. F. Arnold and M. A. Harrison, “Algebraic properties of symmetric and partially symmetric Boolean functions,” IEEE Trans. Electron. Comput., vol. EC-12, pp. 244–251, June 1963.
2. R. C. Born and A. K. Scidmore, “Transformation of switching functions to completely symmetric switching functions,” IEEE Trans. Comput., vol. C-17, pp. 596–599, June 1968.
3. S. H. Caldwell, Switching Circuits and Logical Logical Design. New York: Wiley, 1958.
4. S. S. Yau and Y. S. Tang, “On identification of redundancy and symmetry of switching functions,” this issue, pp. 1609–1613.