170 search results - page 32 / 34 » On two-step routing for FPGAS |
FCCM
1999
IEEE
13 years 11 months ago
1999
IEEE
This paper presents a method, called multiple constant multiplier trees MCMTs, for producing optimized recon gurable hardware implementations of vector products. An algorithm for ...
APCSAC
2001
IEEE
13 years 11 months ago
2001
IEEE
Traditional reconfigurable computing platforms are designed to be single user and have been acknowledged to be difficult to design applications for. The design tools are still pri...
FPGA
2008
ACM
13 years 9 months ago
2008
ACM
This paper presents a new technology mapper, WireMap. The mapper uses an edge flow heuristic to improve the routability of a mapped design. The heuristic is applied during the ite...
DAC
2002
ACM
14 years 8 months ago
2002
ACM
Research in algorithms for Boolean satisfiability and their efficient implementations [26, 8] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks fro...
IPPS
2008
IEEE
14 years 1 months ago
2008
IEEE
— To share and exchange the files among Internet users, Peerto-Peer (P2P) applications build another layer of overlay networks on top of the Internet Infrastructure. In P2P fil...