ScholarLens Back to search
2005•Unpublished venueRequires access

VLSI Block Placement with Alignment Constraints based on Corner Block List

Song Chen, Xianlong Hong, Sheqin Dong, Yuchun Ma, Chung‐Kuan Cheng

Open publisher page 4 citations

Abstract

The corner block list (CBL) is an excellent representation of block floorplan/placement. In this paper, we give a sufficient and necessary condition for the feasibility of a CBL and alignment constraints in CBL are also dealt with. A method is proposed to identify a topological relation between any two blocks in CBL. We also find a sufficient and necessary condition to judge whether a CBL is feasible or not under alignment constraints. The experimental results have demonstrated the efficiency and effectiveness of the proposed method.

About this research paper

What this paper is about

The corner block list (CBL) is an excellent representation of block floorplan/placement. In this paper, we give a sufficient and necessary condition for the feasibility of a CBL and alignment constraints in CBL are also dealt with. A method is proposed to identify a topological relation between any two blocks in CBL. We also find a sufficient and necessary condition to judge whether a CBL is feasible or not under alignment constraints. The experimental results have demonstrated the efficiency and effectiveness of the proposed method.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The corner block list (CBL) is an excellent representation of block floorplan/placement. In this paper, we give a sufficient and necessary condition for the feasibility of a CBL and alignment constraints in CBL are also dealt with. A method is proposed to identify a topological relation between any two blocks in CBL. We also find a sufficient and necessary condition to judge whether a CBL is feasible or not under alignment constraints. The experimental results have demonstrated the efficiency and effectiveness of the proposed method.

Key concepts: Floorplan, Block (permutation group theory), Very-large-scale integration, Computer science, Representation (politics), Relation (database), Block structure, Algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
VLSI Block Placement with Alignment Constraints based on Corner Block List — Research Paper | ScholarLens