Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleAugust 2011
Quadratic placement with single-iteration linear system solver
SBCCI '11: Proceedings of the 24th symposium on Integrated circuits and systems designPages 109–112https://doi.org/10.1145/2020876.2020902In this work we develop a new quadratic placement technique where we prematurely interrupt the linear system solver to interleave the spreading forces saving runtime. This has low impact in the placement flow due to the expand-contract phenomena ...
- research-articleFebruary 2010
Towards scalable placement for FPGAs
FPGA '10: Proceedings of the 18th annual ACM/SIGDA international symposium on Field programmable gate arraysPages 147–156https://doi.org/10.1145/1723112.1723140Placement based on simulated annealing is in dominant use in the FPGA community due to its superior quality of result (QoR). However, given the progression of FPGA device capacity to the order of 100K LUTs, the long runtime associated with simulated ...
- research-articleAugust 2008
Kraftwerk2—A Fast Force-Directed Quadratic Placement Approach Using an Accurate Net Model
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCADICS), Volume 27, Issue 8Pages 1398–1411https://doi.org/10.1109/TCAD.2008.925783The force-directed quadratic placer ldquoKraftwerk2,rdquo as described in this paper, is based on two main concepts. First, the force that is necessary to distribute the modules on the chip is separated into the following two components: a hold force ...
- ArticleSeptember 2007
Cell placement on graphics processing units
SBCCI '07: Proceedings of the 20th annual conference on Integrated circuits and systems designPages 87–92https://doi.org/10.1145/1284480.1284510Graphics Processing Units (GPUs) can be viewed as stream processors and, therefore, can be applied to improve the performance of data-parallel algorithms. GPUs can beat CPUs in most stream-like algorithms and have been successfully applied to solve ...
- research-articleNovember 2006
Multilevel fixed-point-addition-based VLSI placement
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCADICS), Volume 24, Issue 8Pages 1188–1203https://doi.org/10.1109/TCAD.2005.850802A placement problem can be formulated as a quadratic program with nonlinear constraints. Those constraints make the problem hard. Omitting the constraints and solving the unconstrained problem results in a placement with substantial cell overlaps. To ...
-
- research-articleOctober 2006
Force-Directed Methods for Generic Placement
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCADICS), Volume 25, Issue 10Pages 2076–2087https://doi.org/10.1109/TCAD.2005.862748This paper describes the implementation of a wire length-driven force-directed placer named FDP for generic placement. Specifically, it describes efficient force computation for cell spreading, numerical instabilities during force-directed placement, a ...
- ArticleAugust 2006
Quadratic placement for 3d circuits using z-cell shifting, 3d iterative refinement and simulated annealing
SBCCI '06: Proceedings of the 19th annual symposium on Integrated circuits and systems designPages 220–225https://doi.org/10.1145/1150343.1150399This paper presents a quadratic placement algorithm to be applied for 3D circuits. We formulate the 3D problem to control the area balance and the number of 3D-Vias between tiers. We introduce the z-Cell Shifting operation in order to control the area ...
- articleDecember 2005
Navigating Register Placement for Low Power Clock Network Design*This work was supported by Hi-Tech Research & Development (863) Program of China 2002AA1Z1460, the National Natural Science Foundation of China (NSFC) 60476014, Specialized Research Fund for the Doctoral Program of Higher Education: SRFDP-20020003008 and DAC Graduate Scholarship. Some preliminary results of this paper was presented at Asia South Pacific Design Automation Conference (ASPDAC), January, 2005 [17].
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (FECCS), Volume E88-A, Issue 12Pages 3405–3411https://doi.org/10.1093/ietfec/e88-a.12.3405With VLSI design development, the increasingly severe power problem requests to minimize clock routing wirelength so that both power consumption and power supply noise can be alleviated. In contrast to most of traditional works that handle this problem ...
- research-articleMay 2003
FaSa: A fast and stable quadratic placement algorithm
Journal of Computer Science and Technology (JCST), Volume 18, Issue 3Pages 318–324https://doi.org/10.1007/BF02948901AbstractPlacement is a critical step in VLSI design because it dominates overall speed and quality of design flow. In this paper, a new fast and stable placement algorithm called FaSa is proposed. It uses quadratic programming model and Lagrange ...
- ArticleMay 1998
Delay-optimal technology mapping by DAG covering
DAC '98: Proceedings of the 35th annual Design Automation ConferencePages 348–351https://doi.org/10.1145/277044.277142We propose an algorithm for minimal-delay technology mapping for library-based designs. We show that subject graphs need not be decomposed into trees for delay minimization; they can be mapped directly as DAGs. Experimental results demonstrate that ...
- ArticleMay 1998
Efficient Boolean division and substitution
DAC '98: Proceedings of the 35th annual Design Automation ConferencePages 342–347https://doi.org/10.1145/277044.277141Bo ole andivision, and henc eBo ole ansubstitution, produc es better result than algebraic division and substitution. However, due to the lack of an efficient Bo ole andivision algorithm, Bo ole ansubstitution has rarely b een used. We present an ...
- ArticleMay 1998
M32: a constructive multilevel logic synthesis system
DAC '98: Proceedings of the 35th annual Design Automation ConferencePages 336–341https://doi.org/10.1145/277044.277140We describe a new constructive multilevel logic synthesis system that integrates the traditionally separate technology-independent and technology-dependent stages of modern synthesis tools. Dubbed M32, this system is capable of generating circuits ...
- ArticleMay 1998
Optimal FPGA mapping and retiming with efficient initial state computation
DAC '98: Proceedings of the 35th annual Design Automation ConferencePages 330–335https://doi.org/10.1145/277044.277139For sequential circuits with given initial states, new equivalent initial states must be computed for retiming, which unfortunately is NP-hard. In this paper we propose a novel polynomial time algorithm for optimal FPGA mapping with forward retiming to ...
- ArticleMay 1998
Media architecture: general purpose vs. multiple application-specific programmable processor
DAC '98: Proceedings of the 35th annual Design Automation ConferencePages 321–326https://doi.org/10.1145/277044.277136In this paper we report a framework that makes it possible for a designer to rapidly explore the application-specific programmable processor design space under area constraints. The framework uses a production-quality compiler and simulation tools to ...
- ArticleMay 1998
A programming environment for the design of complex high speed ASICs
DAC '98: Proceedings of the 35th annual Design Automation ConferencePages 315–320https://doi.org/10.1145/277044.277135A C++ based programming environment for the design of complex high speed ASICs is presented. The design of a 75 Kgate DECT transceiv er is used as a driv er example. Compact descriptions, combined with efficient sim ulationand syn thesis strategies are ...
- ArticleMay 1998
A methodology for guided behavioral-level optimization
DAC '98: Proceedings of the 35th annual Design Automation ConferencePages 309–314https://doi.org/10.1145/277044.277134Optimization at the early stages of design are crucial. However, due to an overwhelming number of design and optimization options, design exploration is often conducted in a qualitative, ad-hoc manner. This paper presents a methodology and interactive ...
- ArticleMay 1998
Layout based frequency dependent inductance and resistance extraction for on-chip interconnect timing analysis
DAC '98: Proceedings of the 35th annual Design Automation ConferencePages 303–308https://doi.org/10.1145/277044.277133It is well understood that frequency independent lumped-element circuits can be used to accurately model proximity and skin effects in transmission lines [7]. Furthermore, it is also understood that these circuits can be synthesized knowing only the ...
- ArticleMay 1998
A mixed nodal-mesh formulation for efficient extraction and passive reduced-order modeling of 3D interconnects
DAC '98: Proceedings of the 35th annual Design Automation ConferencePages 297–302https://doi.org/10.1145/277044.277132As VLSI circuit speeds have increased, reliable chip and system design can no longer be performed without accurate three-dimensional interconnect models. In this paper, we describe an integral equation aproach to modeling the impedance of inter-connect ...
- ArticleMay 1998
Layout extraction and verification methodology CMOS I/O circuits
DAC '98: Proceedings of the 35th annual Design Automation ConferencePages 291–296https://doi.org/10.1145/277044.277129This paper presents a layout extraction and verification methodology which targets reliability-driven I/O design for CMOS VLSI chip, specifically to guard against electrostatic discharge (ESD) stress and latchup. We propose a new device extraction ...
- ArticleMay 1998
Multi-pad power/ground network design for uniform distribution of ground bounce
DAC '98: Proceedings of the 35th annual Design Automation ConferencePages 287–290https://doi.org/10.1145/277044.277128This paper presents a method for power and ground (p/g) network routing for high speed CMOS chips with multiple p/g pads. Our objective is not to reduce the total amount of the ground bounce, but to distribute it more evenly among the pads while the ...