Input/Output Pad Placement Problem
TL;DR: Efficient heuristics for placing input/output (I/O) pads around the VLSI chip boundary are proposed and several pad placement candidates can be generated as input to cell placement algorithms.
read more
Abstract: We propose efficient heuristics for placing input/output (I/O) pads around the VLSI chip boundary. The
heuristics are based on the circuit connectivity and do not require the placement of cells. This is useful for cell
placement methods that require the knowledge of I/O pad placement. Using these heuristics, several pad
placement candidates can be generated as input to cell placement algorithms.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
Nicos Christofides
- 01 Feb 1976
TL;DR: An O(n3) heuristic algorithm is described for solving d-city travelling salesman problems (TSP) whose cost matrix satisfies the triangularity condition and a worst-case analysis of this heuristic shows that the ratio of the answer obtained to the optimum TSP solution is strictly less than 3/2.
An r-Dimensional Quadratic Placement Algorithm
TL;DR: In this paper, the problem of placing n connected points (or nodes) in r-dimensional Euclidean space is given, and the criterion for optimality is minimizing a weighted sum of squared distances between the points subject to quadratic constraints of the form X′X = 1, for each of the r unknown coordinate vectors.
583
PROUD: a sea-of-gates placement algorithm
TL;DR: An efficient method is proposed for placing modules in large and highly complex sea-of-gates chips that include preplaced I/O pads and macrocells that repeatedly solves sparse linear equations.
Module Placement Based on Resistive Network Optimization
Chung-Kuan Cheng,Ernest S. Kuh +1 more
TL;DR: A new constructive placement and partitioning method based on resistive network optimization is proposed, which is efficient because it takes advantage of net-list sparsity and has a complexity of O[n1.4 log n].