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).
|Title of host publication||Proceedings 22nd Conference on Design Automation, 23-26 jUNE, 1985, Las Vegas, Nevada,|
|Publication status||Published - 1985|
|Event||22nd ACM/IEEE Conference on Design Automation, June 23-26, 1985, Las Vegas, NV, USA - Las Vegas, NV, United States|
Duration: 23 Jun 1985 → 26 Jun 1985
|Conference||22nd ACM/IEEE Conference on Design Automation, June 23-26, 1985, Las Vegas, NV, USA|
|City||Las Vegas, NV|
|Period||23/06/85 → 26/06/85|