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.
Original language | English (US) |
---|---|
Pages (from-to) | 1609-1613 |
Number of pages | 5 |
Journal | IEEE Transactions on Computers |
Volume | C-20 |
Issue number | 12 |
DOIs | |
State | Published - Dec 1971 |
Externally published | Yes |
Keywords
- Algorithms
- binary and decimal number representations of minterms
- identification
- partial or total symmetry
- redundant variables
- switching functions
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics