The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
By ignoring some cell overlaps, the common objective of the very large scale integration (VLSI) global placement problem is to minimize its total half-perimeter wirelength (HP-WL). As the HPWL is not differentiable, the log-sum-exponential (LSE) wirelength model, one of the most powerful differentiable wirelength approximation functions, has been adopted in several nonlinear programming-based placers...
Ignoring some cell overlaps, global placement computes the best position for each cell to minimize some cost metric (e.g., total wire length, density overflow). It is a crucial step in very large scale integration (VLSI) physical design, because it affects rout ability, performance, and power consumption of a circuit. In this paper, we propose an Augmented Lagrangian method to solve the VLSI global...
Floorplanning in very large scale integrated-circuit (VLSI) design is the first phase in the process of designing the physical layout of a chip. This makes the floorplanning problem of paramount importance, since it determines the performance, size, yield, and reliability of VLSI chips . From the computational point of view, the VLSI floorplanning is an NP-hard problem. In this paper, we present a...
The floorplanning is a critical phase in very large-scale integrated-circuit(VLSI) physical design. It determines the topology of layout, and it aims to arrange a set of rectangular modules on a chip so as to optimize the chip area, wirelength, etc. This problem is known to be NP-hard, and has received much attention in recent years. B*-tree representation is adopted in this paper. Based on the concept...
Floorplanning is the first stage of the very large scale integrated-circuit (VLSI) physical design process, the resultant quality of this stage is very important for successive design stages. From the computational point of view, VLSI floorplanning is an NP-hard problem. In this paper, a hybrid genetic algorithm (HGA) for a non-slicing and hard-module VLSI floorplanning problem is presented. This...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.