9 search results - page 2 / 2 » Length-Matching Routing for High-Speed Printed Circuit Board... |
ISPD
1999
ACM
13 years 9 months ago
1999
ACM
—Maze routing algorithms are widely used for finding an optimal path in detailed routing for very large scale integration, printed circuit board and multichip modules In this pap...
ISCAS
2005
IEEE
13 years 11 months ago
2005
IEEE
Abstract— This paper presents and evaluates a hybrid implementation of a low complexity algorithm for speech enhancement, the Adaptive Gain Equalizer (AGE). The AGE is a subband ...
ASPDAC
1998
ACM
13 years 9 months ago
1998
ACM
— This article describes an algorithm for curvilinear detailed routing. We significantly improved the average time performance of Gao’s algorithm by resolving its bottleneck r...
DAC
1998
ACM
14 years 6 months ago
1998
ACM
In this paper we present a new global router appropriate for Multichip Module MCM and dense Printed Circuit Board PCB design, which utilizes a hybrid of the classical rip-up and r...