Repository logo
Log In(current)
  1. Home
  2. Colleges & Schools
  3. Graduate School
  4. Masters Theses
  5. A simple and reliable method for minimization of TANT networks
Details

A simple and reliable method for minimization of TANT networks

Date Issued
December 1974
Author(s)
Lui, Hsun
Advisor(s)
Robert E. Bodenheimer
Additional Advisor(s)
Robert J. Plemmons
Joseph M. Googe
Permanent URI
https://trace.tennessee.edu/handle/20.500.14382/64103
Abstract

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.

Degree
Master of Science
Major
Electrical Engineering
File(s)
Thumbnail Image
Name

Thesis74.L851.pdf

Size

3.78 MB

Format

Adobe PDF

Checksum (MD5)

d39cf99bf59f891bd9f58e4c34b47ae7


University Libraries

1015 Volunteer Boulevard
Knoxville, TN 37996
865-974-4351

Map & Directions
Donate to the Libraries
  • About
  • John C. Hodges Society
  • Speaking Volumes magazine
  • Outreach
  • Directory
  • Employment
  • Policies
  • Library Intranet
University of Tennessee power T logo

The University of Tennessee, Knoxville
Knoxville, Tennessee 37996
865-974-1000

Events
A-Z
Apply
Privacy
Map
Directory
Give to UT
Accessibility

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science