PHIPLA : a new algorithm for logic minimization

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

doi:10.1109/DAC.1985.1586026

PHIPLA : a new algorithm for logic minimization

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

Research output: Other contribution

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 language	English
Publisher	ACM/IEEE
Number of pages	5
ISBN (Print)	0-8186-0635-5
DOIs	https://doi.org/10.1109/DAC.1985.1586026
Publication status	Published - 1985
Externally published	Yes

Access to Document

10.1109/DAC.1985.1586026

Cite this

@misc{32652c65ae514a1183f53968619ee354,

title = "PHIPLA : a new algorithm for logic minimization",

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).",

author = "\{Laarhoven van\}, P.J.M. and E.H.L. Aarts and M. Davio",

year = "1985",

doi = "10.1109/DAC.1985.1586026",

language = "English",

isbn = "0-8186-0635-5",

publisher = "ACM/IEEE",

type = "Other",

}

TY - GEN

T1 - PHIPLA : a new algorithm for logic minimization

AU - Laarhoven van, P.J.M.

AU - Aarts, E.H.L.

AU - Davio, M.

PY - 1985

Y1 - 1985

N2 - 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).

AB - 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).

U2 - 10.1109/DAC.1985.1586026

DO - 10.1109/DAC.1985.1586026

M3 - Other contribution

SN - 0-8186-0635-5

PB - ACM/IEEE

ER -

PHIPLA : a new algorithm for logic minimization

Abstract

Access to Document

Fingerprint

Cite this