Widths of Channel Routing in VLSI DesignReport as inadecuate



 Widths of Channel Routing in VLSI Design


Widths of Channel Routing in VLSI Design - Download this document for free, or read online. Document in PDF available to download.

Download or read this book online for free in PDF: Widths of Channel Routing in VLSI Design
In VLSI design, one of the most important detailed routings is the channel routing. Given a channel with length n in 2-layer Manhattan model, Szeszler proved that the width number of tracks required for routing of  the channel is at most n, and this upper bound can be achieved by a linear time algorithm. In this note, we improve the upper bound n to n, which also can be achieved by a linear time algorithm.



Author: IJOER Engineering journal

Source: https://archive.org/







Related documents