No abstract

We consider the problem of minimizing interconparticular, nection complezity we assume in that behavioral logical level connection synthesis. require-Inments have already been determined, with a corresponding level of multiplezing implied. We firther reduce the total amount of multiplezing by combining ble. Using the number of equivalent 2 x 1 multiplezors as the measure of interconnection complezity, we can guarantee the optimum solution to this problem.The solution technique employs integer linear programming, preceded by a process that reduces the problem space without compromising optimality. We also show how to minimize the total number of tri-state buffers in a bus implementation. 4 connections onto %hared path segments" when possi- 5.3

No abstract