## Worst and Best Irredundant Sum-of-Products Expressions (2001)

### Download From

IEEE### Download Links

- [www.lsi-cad.com]
- [www.lsi-cad.com]
- DBLP

### Other Repositories/Bibliography

Venue: | IEEE Trans. Comp |

Citations: | 5 - 0 self |

### BibTeX

@ARTICLE{Sasao01worstand,

author = {Tsutomu Sasao and Jon T. Butler},

title = {Worst and Best Irredundant Sum-of-Products Expressions},

journal = {IEEE Trans. Comp},

year = {2001},

volume = {50},

pages = {935--948}

}

### OpenURL

### Abstract

In an irredundant sum-of-products expression (ISOP), each product is a prime implicant (PI) and no product can be deleted without changing the function. Among the ISOPs for some function f, a worst ISOP (WSOP) is an ISOP with the largest number of PIs and a minimum ISOP (MSOP) is one with the smallest number. We show a class of functions for which the Minato-Morreale ISOP algorithm produces WSOPs. Since the ratio of the size of the WSOP to the size of the MSOP is arbitrarily large when n, the number of variables, is unbounded, the Minato-Morreale algorithm can produce results that are very far from minimum. We present a class of multiple-output functions whose WSOP size is also much larger than its MSOP size. For a set of benchmark functions, we show the distribution of ISOPs to the number of PIs. Among this set are functions where the MSOPs have almost as many PIs as do the WSOPs. These functions are known to be easy to minimize. Also, there are benchmark functions where the fraction of ISOPs that are MSOPs is small and MSOPs have many fewer PIs than the WSOPs. Such functions are known to be hard to minimize. For one class of functions, we show that the fraction of ISOPs that are MSOPs approaches 0 as n approaches infinity, suggesting that such functions are hard to minimize.