PHIPLA : a new algorithm for logic minimization

P.J.M. Laarhoven, van, E.H.L. Aarts, M. Davio

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    3 Citations (Scopus)

    Abstract

    PHIPLA, a new algorithm for logic minimization, is presented. The algorithm sets out to find optimal sum-of-products representations for a set of Boolean functions, thus contributing to area minimization of the Programmable Logic Array corresponding to the set of functions. The results of a comparative study of PHIPLA and two other algorithms, SPAM and PRESTOL-II, are presented. From these results it is concluded that PHIPLA generates representations which are competitive with those generated by SPAM and PRESTOL-II, whilst the algorithm is extremely fast for small problems (up to 12 variables).
    Original languageEnglish
    Title of host publicationProceedings 22nd Conference on Design Automation, 23-26 jUNE, 1985, Las Vegas, Nevada,
    PublisherACM/IEEE
    Pages739-743
    ISBN (Print)0-8186-0635-5
    DOIs
    Publication statusPublished - 1985
    Event22nd ACM/IEEE Conference on Design Automation, June 23-26, 1985, Las Vegas, NV, USA - Las Vegas, NV, United States
    Duration: 23 Jun 198526 Jun 1985

    Conference

    Conference22nd ACM/IEEE Conference on Design Automation, June 23-26, 1985, Las Vegas, NV, USA
    CountryUnited States
    CityLas Vegas, NV
    Period23/06/8526/06/85

    Fingerprint

    Dive into the research topics of 'PHIPLA : a new algorithm for logic minimization'. Together they form a unique fingerprint.

    Cite this