• DocumentCode
    1191507
  • Title

    An Algorithm for the Automatic Approximate Minimization of Boolean Functions

  • Author

    Necula, Nicolae N.

  • Issue
    8
  • fYear
    1968
  • Firstpage
    770
  • Lastpage
    782
  • Abstract
    Abstract—There are several algorithms that determine directly an irredundant normal form (INF) of a Boolean function without generating the entire set of prime implicants. These algorithms can generate solutions for the minimization problem much more rapidly than the algorithms determining minimum normal forms (MNF), and the cost of these solutions is, in many cases, very close to the minimum.
  • Keywords
    Index Terms—Approximate minimization algorithms, automatic generation, Boolean functions, essential prime implicants, irredundant normal forms.; Application software; Binary codes; Boolean functions; Cost function; Minimization methods; Telephony; Index Terms—Approximate minimization algorithms, automatic generation, Boolean functions, essential prime implicants, irredundant normal forms.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

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