• DocumentCode
    1136238
  • Title

    Minimal TANT Networks of Functions with DON´T CARE´S and Some Complemented Input Variables

  • Author

    Vink, H.A.

  • Author_Institution
    Department of Electrical Engineering, Delft University of Technology
  • Issue
    11
  • fYear
    1978
  • Firstpage
    1073
  • Lastpage
    1078
  • Abstract
    The minimization algorithm of Gimpel realizes a minimal TANT network for any Boolean function under a NAND gate cost criterion. A TANT network is a three-level network composed of AND-NOT (i.e., NAND) gates, having only true (i.e., uncomplemented) input variables.
  • Keywords
    DON´T CARE´S; gate cost criterion; implicants; invertors; minimization; Circuit faults; Circuit testing; Costs; Electrical fault detection; Electrons; Fault detection; Input variables; Multivalued logic; Notice of Violation; Sequential analysis; DON´T CARE´S; gate cost criterion; implicants; invertors; minimization;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1978.1675000
  • Filename
    1675000
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1136238