✦ LIBER ✦

An algorithm for VLSI channel routing using neural network

✍ Scribed by Wang Dongsheng; Li Fang; Zhuang Zhenquan

Book ID: 112826482
Publisher: SP Science Press
Year: 1992
Tongue: English
Weight: 269 KB
Volume: 9
Category: Article
ISSN: 0217-9822
DOI: 10.1007/bf02685871

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for pattern recognition wit

An algorithm for pattern recognition with VLSI neural networks

✍ B. Sirletti; M. Verleysen; A. Vandemeulebroecke; P. Jespers 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 90 KB

An approach to channel routing problem u

An approach to channel routing problem using neural networks

✍ Takashi Shimamoto; Akio Sakamoto 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 831 KB

An efficient approach for channel routin

An efficient approach for channel routing in VLSI

✍ Sieteng Soh; Suresh Rai; Ravi Mehrotra 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 566 KB

A fast neural-network algorithm for VLSI

A fast neural-network algorithm for VLSI cell placement

✍ Cevdet Aykanat; Tevfik Bultan; İsmail Haritaoğlu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 423 KB

Cell placement is an important phase of current VLSI circuit design styles such as standard cell, gate array, and Field Programmable Gate Array (FPGA). Although nondeterministic algorithms such as Simulated Annealing (SA) were successful in solving this problem, they are known to be slow. In this pa

Neural network parallel computing for mu

Neural network parallel computing for multi-layer channel routing problems

✍ Kyotaro Suzuki; Hideharu Amano; Yoshiyasu Takefuji 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 900 KB

An application of neural networks on cha

An application of neural networks on channel routing problem

✍ Pao-Hsu Shih; Wu-Shung Feng 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 572 KB

Shih, P.-H. and W.-S. Feng, An application of neural networks on channel routing problem, Parallel Computing 17 (1991) 229-240 The channel routing problem is to make interconnections among terminals located on opposite sides of a rectangular channel. This problem has been proven to be NP-complete.