• DocumentCode
    1110122
  • Title

    The Synthesis of Minimal Hazardless TANT Networks

  • Author

    Frackowiak, Jerzy

  • Issue
    10
  • fYear
    1972
  • Firstpage
    1099
  • Lastpage
    1108
  • Abstract
    This paper presents a new algorithm Amfor the synthesis of minimum gate costs TANT networks. This algorithm, which differs in the setting up of the CC table from the known Gimpel´s algorithm [1], has some very advantageous features, both in its hand solution and the computer realization. The final stage of this synthesis is the solution of the CC table.
  • Keywords
    CC table, general implicant, head, modified CC table, prime permissible implicant, quasi-elementary implicant, static hazard, tail factors.; Automation; Boolean functions; Circuit synthesis; Combinational circuits; Computer science; Costs; Hazards; Minimization methods; Network synthesis; Tail; CC table, general implicant, head, modified CC table, prime permissible implicant, quasi-elementary implicant, static hazard, tail factors.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/T-C.1972.223456
  • Filename
    1672049
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1110122