ACM Home Page
Please provide us with feedback. Feedback
A heuristic algorithm for the fanout problem
Full text PdfPdf (652 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 27th ACM/IEEE Design Automation Conference table of contents
Orlando, Florida, United States
Pages: 357 - 360  
Year of Publication: 1991
ISBN:0-89791-363-9
Authors
Kanwar Jit Singh  DEC, SGS-Thomson, Texas Instruments, Philips and Intel. and University of California, Berkeley, CA
Alberto Sangiovanni-Vincentelli  University of California, Berkeley, CA
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS : Computer Society
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 24,   Citation Count: 28
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/123186.123303
What is a DOI?

ABSTRACT

We present an algorithm to optimally distribute a signal to its required destinations. The choice of the buffers and the topology of the distribution tree depends on the availability of different strength gates and on the load and the required times at the destinations. The general problem is to construct a fanout-tree for a signal so that the required time constraint at the source node is met and the fanout-tree has a minimum area. Since the area constrained fanout problem is NP-complete and area is not a major consideration in present high density designs, we restrict our attention to the simpler problem of designing fast fanout circuits without any area constraint. The proposed algorithm builds the fanout tree by partitioning the fanout signals into subsets and then recursively solving each sub-problem. At each stage the algorithm generates a fanout tree that is an improvement over the previous stage. This feature allows the user to specify the improvement desired by the fanout correction process. The performance of the algorithm, when run on randomly generated distributions of required times and on real design examples, is very promising.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
G. De Micheli. Performance-Oriented Synthesis of Large-Scale Domino CMOS Circuits. IEEE Transactions on CAD, CAD- 6(5): 751-765, 1987.
3
 
4
K. Keutzer and M. Vancura. Timing Cq3tlmization in a Logic Synthesis System. In G. Saucier, editor, ,Proceedings of International Workshop on Logic and Arch. Synthesis for Silicon Compil. ers, pages 1-13, Grenoble, France, May 1988. Inst. Nat. Polytechnique.
 
5
E.L. Lawler. Combinatorial Optinu'zation: Networks and Matroids. Holt, Rinehart and Winston, 1976.
 
6
P. G. Paulin and F. Poirot. Logic Decomposition Algorithms for the Timing Optimization of Multi-Level l~gic. In Proceedings of ICCD 89, pages 329-333, 1989.
 
7
K. J. Singh, A. R. Wang, R. K. Brayton, and A. Sangiovanni- Vincentelli. Timing Optimization of Combinational Logic. In lCCAD-88, pages 282-285. IEEE, 1988.

CITED BY  29

Collaborative Colleagues:
Kanwar Jit Singh: colleagues
Alberto Sangiovanni-Vincentelli: colleagues