T. Miyoshi, Shin’ichi Wakabayashi, Tetsushi Koide, N. Yoshida
Abstract
This paper presents an MCM routing algorithm considering crosstalk. The aim of the algorithm is to minimize the total wire length under the condition that the crosstalk constraints among nets are satisfied. Experimental results show the effectiveness of the algorithm.
OpenAlex reports 13 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper presents an MCM routing algorithm considering crosstalk. The aim of the algorithm is to minimize the total wire length under the condition that the crosstalk constraints among nets are satisfied. Experimental results show the effectiveness of the algorithm.
Key concepts: Crosstalk, Network routing, Computer science, Routing algorithm, Algorithm, Algorithm design, Routing (electronic design automation), Parallel computing