6 search results - page 1 / 2 » FAST-SP: a fast algorithm for block placement based on seque... |
ASPDAC
2001
ACM
13 years 8 months ago
2001
ACM
DATE
2000
IEEE
13 years 9 months ago
2000
IEEE
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
ICCAD
2006
IEEE
14 years 1 months ago
2006
IEEE
The wire length estimation is the bottleneck of packing based block placers. To cope with this problem, we present a fast wire length estimation method in this paper. The key idea...
ICCAD
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper, we present an integrated approach to floorplanning and bus planning, i.e., bus-driven floorplanning (BDF). We are given a set of circuit blocks and the bus speci...
ISPD
2005
ACM
13 years 10 months ago
2005
ACM
In this paper, the problem of bus-driven floorplanning is addressed. Given a set of blocks and the bus specification (the width of each bus and the blocks that the bus need to g...