Communication Based Logic Partitioning Using Multi-Terminal-Node BDDs
碩士 === 國立清華大學 === 資訊科學學系 === 81 === We consider communication based circuit partitioning in this thesis. We operate on the logic specification before the synthesis and mapping steps have been performed. The main goal of our algori...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1993
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/42197383411952908453 |
| Summary: | 碩士 === 國立清華大學 === 資訊科學學系 === 81 === We consider communication based circuit partitioning in this
thesis. We operate on the logic specification before the
synthesis and mapping steps have been performed. The main
goal of our algorithm is to minimize the number of pins
needed to implement the resultant output partitions. This is
accomplished by adding logic to reduce the number of pins,
and by minimizing the number of pins needed for inter-
partition communication by encoding the signals that flow
between partitions. Counting the number of equivalence
classes is an important task in the communication
based logic partitioning. We propose the Multiple-Terminal-
Node BDD (abbreviate as MTBDD) to count the number of
equivalence classes of a multiple output function. The MTBDD
is an extension from Ordered Binary Decision Diagrams. Based
on the MTBDD, we can count the number of equivalence
classes of a multiple output function easily.
|
|---|