5,013 research outputs found
2D multi-objective placement algorithm for free-form components
This article presents a generic method to solve 2D multi-objective placement
problem for free-form components. The proposed method is a relaxed placement
technique combined with an hybrid algorithm based on a genetic algorithm and a
separation algorithm. The genetic algorithm is used as a global optimizer and
is in charge of efficiently exploring the search space. The separation
algorithm is used to legalize solutions proposed by the global optimizer, so
that placement constraints are satisfied. A test case illustrates the
application of the proposed method. Extensions for solving the 3D problem are
given at the end of the article.Comment: ASME 2009 International Design Engineering Technical Conferences &
Computers and Information in Engineering Conference, San Diego : United
States (2009
A stochastic template placement algorithm for gravitational wave data analysis
This paper presents an algorithm for constructing matched-filter template
banks in an arbitrary parameter space. The method places templates at random,
then removes those which are "too close" together. The properties and
optimality of stochastic template banks generated in this manner are
investigated for some simple models. The effectiveness of these template banks
for gravitational wave searches for binary inspiral waveforms is also examined.
The properties of a stochastic template bank are then compared to the
deterministically placed template banks that are currently used in
gravitational wave data analysis.Comment: 14 pages, 11 figure
Backtracking IC Placement Algorithm
A new algorithm for integrated circuit (IC) layout placement is introduced. As in simulated annealing, it allows uphill movements but in a more restrictive manner; thus, the search for an optima is more directed. Experiments on standard cell placement have shown that the average convergence time is faster than the simulated annealing algorithm while achieving similar results
FFTPL: An Analytic Placement Algorithm Using Fast Fourier Transform for Density Equalization
We propose a flat nonlinear placement algorithm FFTPL using fast Fourier
transform for density equalization. The placement instance is modeled as an
electrostatic system with the analogy of density cost to the potential energy.
A well-defined Poisson's equation is proposed for gradient and cost
computation. Our placer outperforms state-of-the-art placers with better
solution quality and efficiency
Cycle time optimization by timing driven placement with simultaneous netlist transformations
We present new concepts to integrate logic synthesis and physical design. Our methodology uses general Boolean transformations as known from technology-independent synthesis, and a recursive bi-partitioning placement algorithm. In each partitioning step, the precision of the layout data increases. This allows effective guidance of the logic synthesis operations for cycle time optimization. An additional advantage of our approach is that no complicated layout corrections are needed when the netlist is changed
Eigenvalue Placement and Stabilization by Constrained Optimization
A pole placement algorithm is proposed which uses constrained nonlinear optimization techniques on a finite dimensional model of a linear n degree of freedom system. Low order feedback control is assumed where r poles may be assigned; r being the rank of the sensor coefficient matrix. It is shown that by combining feedback control theory methods with optimization techniques, one can ensure the stability characteristics of a system, and can alter its transient response
A scanline-based algorithm for the 2D free-form bin packing problem
Abstract This paper describes a heuristic algorithm for the two-dimensional free-form bin packing (2D-FBP) problem, which is also called the irregular cutting and packing, or nesting problem. Given a set of 2D free-form bins, which in practice may be plate materials, and a set of 2D free-form items, which in practice may be plate parts to be cut out of the materials, the 2D-FBP problem is to lay out items inside one or more bins in such a way that the number of bins used is minimized, and for each bin, the yield is maximized. The proposed algorithm handles the problem as a variant of the one-dimensional bin-packing problem; i.e., items and bins are approximated as sets of scanlines, and scanlines are packed. The details of the algorithm are given, and its application to a nesting problem in a shipbuilding company is reported. The proposed algorithm consists of the basic and the group placement algorithms. The basic placement algorithm is a variant of the first-fit decreasing algorithm which is simply extended from the one-dimensional case to the two-dimensional case by a novel scanline approximation. The group placement algorithm is an extension of the basic placement algorithm with recombination of input items. A numerical study with real instances shows that the basic placement algorithm has sufficient performance for most of the instances, however, the group placement algorithm is required when items must be aligned in columns. The qualities of the resulting layouts are good enough for practical use, and the processing times required for both algorithms are much faster than those by manual nesting. 1
An improved simulated annealing algorithm for standard cell placement
Simulated annealing is a general purpose Monte Carlo optimization technique that was applied to the problem of placing standard logic cells in a VLSI ship so that the total interconnection wire length is minimized. An improved standard cell placement algorithm that takes advantage of the performance enhancements that appear to come from parallelizing the uniprocessor simulated annealing algorithm is presented. An outline of this algorithm is given
- …