DocumentCode
1110179
Title
An Iterative Technique for Determining the Minimal Number of Variables for a Totally Symmetric Function with Repeated Variables
Author
Born, Richard C.
Author_Institution
Department of Electrical Engineering, Michigan Technological University
Issue
10
fYear
1972
Firstpage
1129
Lastpage
1131
Abstract
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.
Keywords
Combinational logic, minimization of switching functions, switching theory, synthesis of switching functions, totally symmetric switching functions, use of partial symmetry information.; Artificial intelligence; Counting circuits; Logic; Minimization; Zinc; Combinational logic, minimization of switching functions, switching theory, synthesis of switching functions, totally symmetric switching functions, use of partial symmetry information.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1972.223462
Filename
1672055
Link To Document