2006IEEE Transactions on Circuits and Systems II Analog and Digital Signal ProcessingRequires access

VLSI Block Placement With Alignment Constraints

Song Chen, Shuting Dong, X. Hong, Yuchun Ma, Chung‐Kuan Cheng

Open publisher page 7 citations

Abstract

Corner block list (CBL) is a room-based floorplan representation. In this brief, we give a sufficient and necessary condition for the feasibility of a CBL, and we also deal with alignment constraints in CBL. A method is proposed to identify topological relation between two blocks in CBL. Based on the topological relations between blocks, it is also found that a sufficient and necessary condition to judge whether or not a CBL is feasible under alignment constraints. The experimental results showed the efficiency and effectiveness of the proposed method.

About this research paper

What this paper is about

Corner block list (CBL) is a room-based floorplan representation. In this brief, we give a sufficient and necessary condition for the feasibility of a CBL, and we also deal with alignment constraints in CBL. A method is proposed to identify topological relation between two blocks in CBL. Based on the topological relations between blocks, it is also found that a sufficient and necessary condition to judge whether or not a CBL is feasible under alignment constraints. The experimental results showed the efficiency and effectiveness of the proposed method.

Why it matters

OpenAlex reports 7 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

Corner block list (CBL) is a room-based floorplan representation. In this brief, we give a sufficient and necessary condition for the feasibility of a CBL, and we also deal with alignment constraints in CBL. A method is proposed to identify topological relation between two blocks in CBL. Based on the topological relations between blocks, it is also found that a sufficient and necessary condition to judge whether or not a CBL is feasible under alignment constraints. The experimental results showed the efficiency and effectiveness of the proposed method.

Key concepts: Floorplan, Block (permutation group theory), Very-large-scale integration, Representation (politics), Relation (database), Computer science, Topology (electrical circuits), Theoretical computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
VLSI Block Placement With Alignment Constraints — Research Paper | ScholarLens