|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
An Algorithm for Minimal TANT Network Generation
December 1978 (vol. 27 no. 12)
pp. 1202-1206
| ASCII Text | x | ||
| H.-P.S. Lee, "An Algorithm for Minimal TANT Network Generation," IEEE Transactions on Computers, vol. 27, no. 12, pp. 1202-1206, December, 1978. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1978.1675028, author = {H.-P.S. Lee}, title = {An Algorithm for Minimal TANT Network Generation}, journal ={IEEE Transactions on Computers}, volume = {27}, number = {12}, issn = {0018-9340}, year = {1978}, pages = {1202-1206}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1978.1675028}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - An Algorithm for Minimal TANT Network Generation IS - 12 SN - 0018-9340 SP1202 EP1206 EPD - 1202-1206 A1 - H.-P.S. Lee, PY - 1978 KW - TANT network KW - Minimal gate design KW - prime permissible implicant KW - second level minimization KW - third level minimization KW - tail factor VL - 27 JA - IEEE Transactions on Computers ER - | |||
An algorithm for constructing minimal TANT networks is presented. Using the upper prime permissible implicants as candidates, two particular networks, A and B, are 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. These bounds provide extra constraints which can speed up the process for finding a minimal TANT network.
Index Terms:
TANT network, Minimal gate design, prime permissible implicant, second level minimization, third level minimization, tail factor
Citation:
H.-P.S. Lee, "An Algorithm for Minimal TANT Network Generation," IEEE Transactions on Computers, vol. 27, no. 12, pp. 1202-1206, Dec. 1978, doi:10.1109/TC.1978.1675028
Usage of this product signifies your acceptance of the Terms of Use.