| A spacing algorithm for performance enhancement and cross-talk reduction |
| Full text |
Pdf
(622 KB)
|
| Source
|
International Conference on Computer Aided Design
archive
Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
table of contents
Santa Clara, California, United States
Pages: 697 - 702
Year of Publication: 1993
ISBN:0-8186-4490-7
|
|
Authors
|
|
Kamal Chaudhary
|
Electronics Research Laboratory, University of California, Berkeley
|
|
Akira Onozawa
|
NTT LSI Laboratories, Atsugi, Kanagawa, Japan
|
|
Ernest S. Kuh
|
Electronics Research Laboratory, University of California, Berkeley
|
|
| Sponsors |
|
| Publisher |
IEEE Computer Society Press
Los Alamitos, CA, USA
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 10, Citation Count: 17
|
|
|
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
|
H.B. Bakoglu. Circuits, lnterconnections, and Packagingfor VLSI. Addison-Wesley Publishing Company, 1990.
|
| |
2
|
A. Srinivasan, K. Chaudhary, and E.S. Kuh. RITUAL : A performance driven placement algorithm. IEEE Trans. Circuits and Systems, pages 825-839, November 1992.
|
| |
3
|
S. Prasitjutrakul and W. J. Kubitz. A performance-driven global router for custom VLSI chip design. IEEE Trans. Computer-Aided Design, 11 (8): 1044-1051, August 1992.
|
| |
4
|
|
| |
5
|
T. Yoshimura. A graph theoretical compaction algorithm. In Proc.ISCAS 85, pages 1455-1458, June 1985.
|
| |
6
|
K. Nishimura and Y. Ohtomo. Private communication. LSI Laboratories, 1992.
|
 |
7
|
|
| |
8
|
R. B. Hitchcock, G. L. Smith, and D. D. Cheng. Timing analysis of computer hardware. IBM Journal of Research and Development, 26(1 ): 100-105, 1983.
|
| |
9
|
T. Sakurai and K. Tamaru. Simple formulas for two- and three- dimensional capacitances. IEEE Trans. on Electron Devices, ED-30:183-185, Feb. 1983.
|
| |
10
|
K. Murty. Linear Programming. John Wiley and Sons, 1983.
|
| |
11
|
A. Feller, H.R. Kaupp, and J.J. Digiacomo. Crosstalk and reflections in high-speed digital systems. In AFIPS proceedings, volume 27, pages 511-525, 1965.
|
| |
12
|
T.Sakurai, S.Kobayashi, and M.Noda. Simple expressions for interconnection delay, coupling and crosstalk in VLSI's. In Proc. ISCAS, pages 2375-2378, 1991.
|
| |
13
|
|
| |
14
|
Y.-z. Liao and C. K. Wong. An algorithm to compact a VLSI symbolic layout with mixed constraints. IEEE Trans. Computer-Aided Design, CAD-2(2):62--69, April 1983.
|
CITED BY 17
|
|
Hsiao-Ping Tseng , Louis Scheffer , Carl Sechen, Timing and crosstalk driven area routing, Proceedings of the 35th annual conference on Design automation, p.378-381, June 15-19, 1998, San Francisco, California, United States
|
|
|
|
|
|
Ki-Wook Kim , Unni Narayanan , Sung-Mo Kang, Domino logic synthesis minimizing crosstalk, Proceedings of the 37th conference on Design automation, p.280-285, June 05-09, 2000, Los Angeles, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Tianxiong Xue , Ernest S. Kuh , Dongsheng Wang, Post global routing crosstalk risk estimation and reduction, Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design, p.302-309, November 10-14, 1996, San Jose, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|