Abstract :
An algorithm for identifying all redundant variables of switching functions and an algorithm for identifying their symmetries (total or partial) are presented. Both algorithms are straightforward and very efficient. These algorithms are based on manipulating the binary and decimal number representations of the minterms of the switching function under testing.
Keywords :
Algorithms, binary and decimal number representations of minterms, identification, partial or total symmetry, redundant variables, switching functions.; Testing; Writing; Algorithms, binary and decimal number representations of minterms, identification, partial or total symmetry, redundant variables, switching functions.;