(Enter summary)
Abstract: Routing plays an important role in determining the total circuit area and circuit performance
and hence must be addressed as early as possible during the design process. In this paper,
an effective routing-driven approach for technology-dependent logic synthesis which relies on
alphabetic tree construction is presented. Alphabetic trees are trees which are generated under
the restriction that the initial order on the leaf nodes is maintained while not introducing any
internal edge crossing. (Update)
Similar documents based on text:
0.0: Unknown -
(Correct)
BibTeX entry: (Update)
@article{ vaishnav01alphabetic,
author = "Vaishnav and Pedram",
title = "Alphabetic Trees--Theory and Applications in Layout-Driven Logic Synthesis",
journal = "IEEETCAD: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",
volume = "20",
year = "2001",
url = "citeseer.ist.psu.edu/746833.html" }
Citations (may not include all citations):
2003
The Art of Computer Programming (context) - Knuth - 1973
338
A method for the construction of minimum redundancy codes (context) - Huffman - 1952
264
Combinatorial algorithms for integrated circuit layout (context) - Lengauer - 1990
109
Logic synthesis and optimization benchmarks user guide: Vers..
- Yang - 1991
83
GORDIAN: VLSI placement by quadratic programming and slicing.. (context) - Kleinhans, Sigl et al. - 1991
51
Optimum binary search trees (context) - Knuth - 1971
48
Performance Oriented Technology Mapping (context) - Touati - 1990
48
Performance-oriented technology mapping (context) - Touati, Moon et al. - 1990
25
Variable-length binary encoding (context) - Gilbert, Moore - 1959
24
Layout driven technology mapping (context) - Pedram, Bhat - 1991
23
Bounding fanout in logical networks (context) - Hoover, Klawe et al. - 1984
22
A new global router for row-based layout (context) - Lee, Sechen - 1988
21
The fanout problem: From theory to practice (context) - Berman, Carter - 1989
20
IEEE Transactions on Information Theory (context) - Gallager, by - 1978
18
A heuristic algorithm for the fanout problem (context) - Singh, Sangiovanni-Vincentelli - 1990
[Article contains additional citations not shown here]
Documents on the same site (http://atrak.usc.edu/~massoud/publications_nocgi.html): More
BEAR-FP: A Robust Framework for Floorplanning - Pedram, Kuh (1992)
(Correct)
Estimation of Peak Power Dissipation in VLSI Circuits Using.. - Wu, Qiu, Pedram
(Correct)
Capacitive Coupling Noise in High-Speed VLSI Circuits - Heydari, Pedram
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC