Sciweavers

Share
2 search results - page 1 / 1
» On the NP-completeness of regular 2-D FPGA routing architect...
Sort
View
ICCAD
1994
IEEE
106views Hardware» more  ICCAD 1994»
9 years 5 months ago
On the NP-completeness of regular 2-D FPGA routing architectures and a novel solution
Several industrial FPGA routing architectures have been shown to have no efficient routing algorithms (unless P=NP) [3,4]. Here, we further investigate if the intractability of th...
Yu-Liang Wu, Douglas Chang
DAC
1995
ACM
9 years 5 months ago
Orthogonal Greedy Coupling - A New Optimization Approach to 2-D FPGA Routing
We propose a novel optimization scheme that can improve the routing by reducing a newly observed router decaying effect. A pair of greedy-grow algorithms, each emphasizing a diffe...
Yu-Liang Wu, Malgorzata Marek-Sadowska
books