Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"Quine McCluskey algorithm"”.
-
A simple and reliable method for minimization of TANT networks
… networks. The new method is quite similar to the Quine-McCluskey algorithm for two-level AND/OR networks. Use of an upper prime permissible implicant table as a tool for the selecting of members of the minimal realizations is analogous to the use of a prime implicant table in two-level …
-
Fault diagnostics and vibration control of paper winders
A Level-to-Level Minimization (LLM) algorithm based on Boolean algebra was developed and compared to the Quine-McCluskey algorithm based on the manipulation of truth tables of logic functions. The minimization with Boolean laws can save much computing time and memory with certain types of logic …
-
Development and application of a computer program for the disjunctive decomposition of switching functions
… can then be fed into a standard minimization algorithm such as the Quine - McCluskey algorithm to obtain the simplest implementation of the decomposed functions in a sum-of-products form.</p>
-
Designing Six Variable Combination Logic Circuits with the TI-59
… TI-59 hand-held calculator implementing the Quine-McCluskey minimization method for logic circuit design. This program is contained on multiple magnetic cards and provides the user with the capability for combinational logic minimization of circuit design problems containing up to six …