|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
A Minimization Technique for Tant Networks
January 1971 (vol. 20 no. 1)
pp. 105-107
| ASCII Text | x | ||
| null Kyung Shik Koh, "A Minimization Technique for Tant Networks," IEEE Transactions on Computers, vol. 20, no. 1, pp. 105-107, January, 1971. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1971.223090, author = {null Kyung Shik Koh}, title = {A Minimization Technique for Tant Networks}, journal ={IEEE Transactions on Computers}, volume = {20}, number = {1}, issn = {0018-9340}, year = {1971}, pages = {105-107}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1971.223090}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - A Minimization Technique for Tant Networks IS - 1 SN - 0018-9340 SP105 EP107 EPD - 105-107 A1 - null Kyung Shik Koh, PY - 1971 KW - Consensus operation KW - essential prime implicants KW - gate cost criterion KW - minimal TANT expression KW - TANT networks. VL - 20 JA - IEEE Transactions on Computers ER - | |||
A TANT network is a three-level network composed solely of AND-NOT gates having only uncomplemented inputs. A method of minimal gate TANT realization of a Boolean function is presented. The procedure permits hand solution of four-and five-variable problems. A computer program will be required to handle more complex cases.
Index Terms:
Consensus operation, essential prime implicants, gate cost criterion, minimal TANT expression, TANT networks.
Citation:
null Kyung Shik Koh, "A Minimization Technique for Tant Networks," IEEE Transactions on Computers, vol. 20, no. 1, pp. 105-107, Jan. 1971, doi:10.1109/T-C.1971.223090
Usage of this product signifies your acceptance of the Terms of Use.