×

zbMATH — the first resource for mathematics

A new technique for the fast minimization of switching functions. (English) Zbl 0365.94048
After a brief survey of minimization techniques a new one called DSA, direct search algorithm, is introduced. Its main feature is that the processes of identification and selection of prime implicants are integrated. This enables to avoid handling some unuseful prime implicants and reduces computational effort. Comparative run-times are given.

MSC:
94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010)
PDF BibTeX XML Cite
Full Text: DOI