A simple and reliable method for minimization of TANT networks
This thesis presents a new method for the minimization of TANT 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 minimization.
In addition, the new method employs a technique of choosing, by inspection, a possibly minimal gate solution and systematically checking the result by a step by step procedure. Finally, the checking procedure of this new method may prove the chosen solution to be a correct choice. If not, some other real minimal gate solutions will be generated during the checking process.
Thesis74.L851.pdf
3.78 MB
Adobe PDF
d39cf99bf59f891bd9f58e4c34b47ae7