Block placement to ensure channel routability

ACM Great Lakes Symposium on VLSI, pp. 465-468, 2007.

Cited by: 0|Bibtex|Views0|Links
EI
Keywords:
optimal routing areabinary searchchannel widthproposed techniqueminimally spaceMore(12+)

Abstract:

Given a set of placed blocks, we present an algorithm that minimally spaces the blocks to ensure routability under several assumptions. By performing a binary search on total width/height of the chip and optimal routing area can be obtained. The proposed technique utilizes a piecewise linear model of the channel width. Based on this model...More

Code:

Data:

Your rating :
0

 

Tags
Comments