Maolin Tang
Abstract
A very large scale integrated-circuit (VLSI) floorplan can be represented in an ordered tree (O-tree), and therefore the VLSI floorplan optimization problem can be transformed into an O-tree permutation problem. This paper presents a new greedy O-tree permutation algorithm and applies it to the VLSI floorplan optimization problem.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A very large scale integrated-circuit (VLSI) floorplan can be represented in an ordered tree (O-tree), and therefore the VLSI floorplan optimization problem can be transformed into an O-tree permutation problem. This paper presents a new greedy O-tree permutation algorithm and applies it to the VLSI floorplan optimization problem.
Key concepts: Floorplan, Very-large-scale integration, Computer science, Permutation (music), Greedy algorithm, Algorithm, Tree (set theory), Integrated circuit layout