Sciweavers

165 search results - page 12 / 33
» Using Eigenvectors to Partition Circuits
Sort
View
JSAC
2007
107views more  JSAC 2007»
13 years 8 months ago
Admission control in data transfers over lightpaths
—The availability of optical network infrastructure and appropriate user control software has recently made it possible for scientists to establish end-to-end circuits across mul...
Wojciech M. Golab, Raouf Boutaba
ASPDAC
2008
ACM
106views Hardware» more  ASPDAC 2008»
13 years 10 months ago
Hierarchical Krylov subspace reduced order modeling of large RLC circuits
In this paper, we propose a new model order reduction approach for large interconnect circuits using hierarchical decomposition and Krylov subspace projection-based model order re...
Duo Li, Sheldon X.-D. Tan
DAC
1989
ACM
14 years 19 days ago
Fast Hypergraph Partition
We present a new 0 (n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are O(n2 log n). Our ...
Andrew B. Kahng
FPGA
1997
ACM
127views FPGA» more  FPGA 1997»
14 years 22 days ago
General Modeling and Technology-Mapping Technique for LUT-Based FPGAs
We present a general approach to the FPGA technology mapping problem that applies to any logic block composed of lookup tables LUTs and can yield optimal solutions. The connecti...
Amit Chowdhary, John P. Hayes
DAC
1997
ACM
14 years 23 days ago
Multilevel Hypergraph Partitioning: Application in VLSI Domain
In this paper, we present a new hypergraph partitioning algorithm that is based on the multilevel paradigm. In the multilevel paradigm, a sequence of successively coarser hypergra...
George Karypis, Rajat Aggarwal, Vipin Kumar, Shash...