Paper
22 March 1996 HDBE: an efficient algorithm toward global optimizing
Sikun Li, Hong Wang
Author Affiliations +
Proceedings Volume 2644, Fourth International Conference on Computer-Aided Design and Computer Graphics; (1996) https://doi.org/10.1117/12.235557
Event: Fourth International Conference on Computer-Aided Design and Computer Graphics, 1995, Wuhan, China
Abstract
In order to improve the global effect of placement, we introduce an efficient and fast algorithm. The main idea of this algorithm is that: the layout area is hierarchically decomposed into blocks. At each level of the decomposition, the cells in the block exchange at the same time. The min-cut exchange in the block hierarchy tree prevents local optimum solutions, as well as reduce the number of exchanges. Several questions are discussed about the algorithm. The time complexion is proved to be o(n).
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Sikun Li and Hong Wang "HDBE: an efficient algorithm toward global optimizing", Proc. SPIE 2644, Fourth International Conference on Computer-Aided Design and Computer Graphics, (22 March 1996); https://doi.org/10.1117/12.235557
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Bismuth

Computer aided design

Very large scale integration

Chlorine

Process control

Astatine

Computer engineering

RELATED CONTENT

Floorplanning with boundary constraints by using AE-TCG
Proceedings of SPIE (March 14 2013)
A web QoS strategy based on session for web cluster...
Proceedings of SPIE (February 20 2006)
Applying case-based reasoning to macro cell layout
Proceedings of SPIE (March 22 1996)
Hyperspheres of N-sequence distances
Proceedings of SPIE (April 09 1993)
Recursive ULV decomposition
Proceedings of SPIE (November 13 2000)

Back to Top