๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An algorithm of global routing for gate array LSI

โœ Scribed by Ikuo Harada; Shuji Tsukiyama; Isao Shirakawa

Book ID
112074791
Publisher
John Wiley and Sons
Year
1984
Tongue
English
Weight
938 KB
Volume
67
Category
Article
ISSN
8756-6621

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

New global routing subsystem for CMOS ga
New global routing subsystem for CMOS gate arrays
โœ Lu, A.; Wu, X.; Zhuang, W.; Chen, W.-K. ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› The Institution of Electrical Engineers ๐ŸŒ English โš– 512 KB
A Parallel Algorithm for Global Routing
A Parallel Algorithm for Global Routing Using an Associative Processor
โœ Taegeun Park ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 372 KB

This paper proposes a parallel approach to global routing using an associative processor (AP). The proposed architecture, which is very efficient for search-oriented applications, consists of three main functional blocks: the content-addressable memory (CAM) array, the row logic, and the control sec

An efficient hierarchical timing-driven
An efficient hierarchical timing-driven Steiner tree algorithm for global routing
โœ Jingyu Xu; Xianlong Hong; Tong Jing; Yici Cai; Jun Gu ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 425 KB

In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as the goal. The algorithm uses heuristic approach to decompose the problem of minimum delay Steiner tree into hierarchy and

An algorithm for generating circuit diag
An algorithm for generating circuit diagrams of LSIs
โœ Nobuyuki Nishiguchi; Hiroshi Kawanishi; Masumi Nakao; Aritoyo Kishimoto ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 613 KB