Novel routing algorithm using a bi-directional bubble sort for non-Manhattan channel routing.

Document Type : Original Article

Authors

Abstract

Abstract
A non-Manhattan channel router uses fewer routing tracks than a Manhattan one.
Many optimizations exist for the non-Manhattan channel routing to minimize the
number of vias as well as the crosstalk between the layers [7, 8].
In this paper, we propose a direct implementation of an optimal three-layer bubblesort-
based non-Manhattan channel routing algorithm. This direct implementation
minimizes the time complexity of the three-layer routing problem. We also implement
a five-layer technique to reduce the channel height of our three-layer algorithm
without affecting its time complexity.

Files

Share

How to cite

Statistics