#### Filter Results:

#### Publication Year

1997

2003

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We present an ordered tree, O-tree, structure to represent non-slicing floor-plans. The O-tree uses only n (2 + rig nl) bits for a floorplan of n rectangular blocks. We define an admissible placement as a compacted placement in both x and y direction. For each admissible placement, we can find an O-tree representation. We show that the number of possible… (More)

—We present an ordered tree (O tree) structure to represent nonslicing floorplans. The O tree uses only (2 + lg) bits for a floorplan of rectangular blocks. We define an admissible placement as a compacted placement in both and directions. For each admissible placement, we can find an O-tree representation. We show that the number of possible O-tree… (More)

<italic>With the recent advent of deep sub-micron technology and new packaging schemes such as Multi-Chip Modules(MCMs), integrated circuit components are often not rectangular. Most existing block placement approaches, however, only deal with rectangular blocks, resulting in inefficient area utilization. New approaches which can handle arbitrarily shaped… (More)

We propose an iterative optimization approach for mixedmacro-cell and standard-cell placement, which minimizes the chipsize and interconnection wire length at the same time. We present abranch-and-bound algorithm which efficiently searches for the optimalsolution by evaluating all of the possible configurations on theselected cluster to minimize the gap… (More)

In this paper, we present a physical retiming algorithm for sequential circuits implemented in field programmable gate arrays (FPGAs). This algorithm can speed up the sequential circuits by reducing delay of all critical paths with negative slacks. By taking advantage of the physical information provided by placed circuits, this algorithm integrates two… (More)

- ‹
- 1
- ›