Maze routing with buffer insertion under transition time constraints.

Maze routing with buffer insertion under transition time constraints.

The authors address the problem of simultaneous routing and buffer insertion. Recently the authors considered simultaneous maze routing and buffer insertion under the Elmore delay model. Their algorithms can take into account both routing obstacles and restrictions on buffer locations. It is well kn...

Cijeli opis

Bibliografski detalji
Izdano u:IEEE Transactions on computer-aided design of integrated circuits and systems 22, 1 (2003).
Glavni autor: Li-Da Huang
Format: Članak
Jezik:English
Teme:
Accurate delay models.
Buffer insertion.
Buffer location restriction.
Buffer sizing.
Delay lookup table.
Maze routing.
Minimum-delay buffered routing path.
Routing obstacles.
Routing tree solution.
Shortest path problem.
Signal delay.
Simultaneous routing/buffer insertion.
Transition time constraints.
Transmission line model.
Weighted graph.
Wire sizing.