• DocumentCode
    1135985
  • Title

    Reduction of CC-Tables Using Multiple Implication

  • Author

    Vink, H.A. ; Van Den Dolder, B. ; Al, J.

  • Author_Institution
    Department of Electrical Engineering, Delft University of Technology
  • Issue
    10
  • fYear
    1978
  • Firstpage
    961
  • Lastpage
    966
  • Abstract
    Gimpel has presented a minimization algorithm which realizes a minimal TANT network for any Boolean function, under a NAND gate cost criterion. Gimpel uses a covering closure (CC)-table and reduces this table with the reduction techniques of Grasselli and Luccio to find a least cost subset of implicants.
  • Keywords
    CC-table; gate cost criterion; minimal TANT network; minimization; reduction rules; Binary codes; Boolean functions; Cost function; Input variables; Minimization methods; CC-table; gate cost criterion; minimal TANT network; minimization; reduction rules;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

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