Read An algorithm for minimal tant network generation

An algorithm for minimal tant network generation

Stanford University Stanford Electronics Laboratories. Digital Systems Laboratory

4.9/5 (30358 ratings)

Description: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).We have made it easy for you to find a PDF Ebooks without any digging. And by having access to our ebooks online or by storing it on your computer, you have convenient answers with An algorithm for minimal tant network generation. To get started finding An algorithm for minimal tant network generation, you are right to find our website which has a comprehensive collection of manuals listed.
Our library is the biggest of these that have literally hundreds of thousands of different products represented.

Pages: 100

Format: PDF, EPUB & Kindle Edition

Publisher: —

Release: 1973

ISBN: FioFAAAAIAAJ

Description: 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).We have made it easy for you to find a PDF Ebooks without any digging. And by having access to our ebooks online or by storing it on your computer, you have convenient answers with An algorithm for minimal tant network generation. To get started finding An algorithm for minimal tant network generation, you are right to find our website which has a comprehensive collection of manuals listed.
Our library is the biggest of these that have literally hundreds of thousands of different products represented.

Special Offer | $0.00

Special Offer! | $0.00

An algorithm for minimal tant network generation

An algorithm for minimal tant network generation

More Books