An incompletely specified function can be given by an interval (g, h) or alternatively by a function f and a don't care set d. Depending on the assignment of don't cares, a different compatible function with a possibly support set may be derived. In this paper, efficient symbolic algorithms based on BDDs are presented for finding a compatible function with the minimum support. Efficient solution to this problem has important application in FPGA synthesis. >
['Bill Lin']
Efficient symbolic support manipulation