An Algorithm for Minimal TANT Network Generation.
Technical rept. no. 68,
STANFORD UNIV CALIF STANFORD ELECTRONICS LABS
Pagination or Media Count:
An algorithm for constructing minimal TANT network minimum gate three level AND-NOT gate network with true inputs is presented. The upper prime permissible implicants of a function are first generated from the H-maximum compatibility classes of the prime implicants. Using the upper prime permissible implicants as candidates, two particular networks, A and B, are then constructed. Network A has the minimum number of third level gates among all networks that have the minimum number of second level gates. Network B has the minimum number of second level gates among all networks that have the minimum number of third level gates. For most functions with few variables, it can be shown that one or both of these two networks is a minimal TANT network. No function with less than nine variables has been found which violates the above statement. For other functions, upper and lower bounds for both the second level and third level gates are derived. Modified author abstract
- Electrical and Electronic Equipment