A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
On the difficulty of Manhattan channel routing
1992
Information Processing Letters
Preserved Fulltext
We show that channel routing in the Manhattan model remains di cult even when all nets are single-sided. ...
Given a set of n single-sided nets, we consider the problem of determining the minimum number of tracks required to obtain a dogleg-free routing. ...
We consider the Manhattan model, where the horizontal segments of a wire are on one layer and the vertical segments are on the other layer. ...
doi:10.1016/0020-0190(92)90214-g
fatcat:nkciercteng2zhwzhywakjoruy
Octilinear redistributive routing in bump arrays
2009
Proceedings of the 19th ACM Great Lakes symposium on VLSI - GLSVLSI '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Experimental results show the effectiveness of our router. ...
Traditional RDL routing designs are mostly performed manually because the wire geometries are more flexible and therefore more difficult to handle on RDL than on chip. ...
Compared with on-chip routing, RDL routing has the freedom of interchanging the destinations of the pads which makes it easier, but also has the difficulty of placing wires with different directions in ...
doi:10.1145/1531542.1531591
dblp:conf/glvlsi/WangC09
fatcat:ckovzsy7hzhlzc2z3glh6fag74
Novel routing schemes for IC layout part I
1991
Proceedings of the 28th conference on ACM/IEEE design automation conference - DAC '91
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Non-Manhattan wires as well as overlapping wires are introduced. preliminary results show that a class of channel routing problems can be routed in height less than the Manhattan density. ...
We present new channel routing algorithms and theory that consider the characteristic of net crossings. The routing strategy is basedon parallel bubble sorting and river routing techniques. ...
Intuitively, the POTENTIAL function measures the degree of difficulty for a given channel routing problem. ...
doi:10.1145/127601.127626
dblp:conf/dac/Wang91
fatcat:trrlg5kjsngope3busp3iqon3q
An approximation algorithm for manhattan routing
1983
Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Acknowledgements We would like to thank the following people for helpful discussions: Donna Brown, Dave Deutsch, Gary Miller, Ron Pinter, Franco Preparata, and Ron Rivest. ...
An important measure of a channel routing problem's difficulty is its density. The density ofa problem is the maximum number of nets that are split by any vertical cut of the channel. ...
)Channel roting plays a central role in the development or automated layout systems for integrated circuits. One of the most common models for channel routing is known as Manhattan routing . ...
doi:10.1145/800061.808779
dblp:conf/stoc/BakerBL83
fatcat:nnkqapevovgfdflsjt6brwki6e
Routing multiterminal nets on a hexagonal grid
1999
Discrete Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Channel routing is a vital task in the layout design of VLSI circuits. Multiterminal channel routing is different from two-terminal one. ...
We present an efficient algorithm for routing multiterminal nets on a channel of width d + 3, where d is the problem density. ...
To evaluate the interest on TSM, let us compare it with the other routing models. For
both Manhattan and knock-knee routing models [ 1, 171, density d is a lower bound on
channel width. ...
doi:10.1016/s0166-218x(98)00093-6
fatcat:gttq5gplyzhqhk66ovklwcryya
Page 476 of Civil Engineering Vol. 2, Issue 8
[page]
1932
Civil Engineering
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
How engineers have surmounted these difficulties is told here by one of the administrative officers of the interstate governing body of the port. ...
Trade, both national and inter- national, flows in certain well defined channels or trade routes carved out by centuries of practical experience. ...
Diagonal routing in high performance microprocessor design
2006
Proceedings of the 2006 conference on Asia South Pacific design automation - ASP-DAC '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
While including the layout functions for the conventional Manhattan routing with horizontal and vertical directions, a new diagonal routing capability is added as one of the routing functions. ...
When the diagonal routing is applied to a critical path, path delay is improved by as much as about 14 pico-seconds per net on a path. This improvement is more than the delay of a gate with no load. ...
ACKNOWLEDGMENTS We would like to thank Toshiyuki Shibuya and Kaoru Kawamura and other researchers in the CAD group of Fujitsu Laboratories for their enhancement of the automatic routing engine. ...
doi:10.1145/1118299.1118446
fatcat:5w46l2wndjaexmd23yzgykf2u4
Page 7110 of Mathematical Reviews Vol. , Issue 97K
[page]
1997
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
These results shed more insight into the difficulty of the channel routing problem if an optimal solution is sought. ...
Manhattan channel routing is NP-complete under truly restricted settings. ...
A Multi-Terminal Net Router for Field-Programmable Gate Arrays
1996
VLSI design (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The router does not require pre-assignment of routing channels, a phase that is normally accomplished during global routing. ...
The memory requirements for this router are very low. The time needed for the routing is linear with respect to the size of the circuit. ...
Acknowledgement We would like to thank Jonathan Rose and Stephen Brown of the University of Toronto for providing us with the code of the CGE router and the benchmark circuits. We also thank Ms. ...
doi:10.1155/1996/79127
fatcat:sjsi5k7ip5fr5ca25kpb2kvlfy
A Global Routing Algorithm for General Cells
1984
21st Design Automation Conference Proceedings
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Instead of breaking the routing surface up into channels, a maze search finds acceptable global routes while avoiding the blocks. Both multi-pin terminals and multi-terminal nets are accomodated. ...
An algorithm is presented which accomplishes the global routing for a building block or general cell routing problem. ...
The inherent difficulty of the channel decomposition process is compounded by pin-splittin~ 2,1 and inter-channel inter]create, and avoiding the whole problem seems to be a good solution. ...
doi:10.1109/dac.1984.1585771
fatcat:ywhjr3zjtnb4tiw7ebwkbgkmne
A Fault-Tolerant Structure for Nano-Power Communication Based on the Multidimensional Crossbar Switch Network
2022
International Transactions on Electrical Energy Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The authors' design is superior and improves the reliability of the 3DNoC system. ...
In order to realize fault tolerance and further reduce the transmission delay, a fault-tolerant structure design method for nano-power communication based on a multidimensional crossbar switch network ...
Acknowledgments is study is funded by the Construction of Electronic Information Experimental Teaching Demonstration Center Project of the Guangdong Undergraduate University Teaching Quality and Teaching ...
doi:10.1155/2022/4783847
fatcat:j46esqvkcndbnattrw35ratraq
The SFRA
2004
Proceeding of the 2004 ACM/SIGDA 12th international symposium on Field programmable gate arrays - FPGA '04
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The SFRA routing and retiming tools also run one to two orders of magnitude faster than their Xilinx counterparts. ...
We have developed a novel approach, called a "corner-turn" interconnect, based on a Manhattan array of logically depopulated Sboxes with full connectivity but limited routability. ...
Parameters of the architecture include the number of signals in each channel (the channel capacity), and the number of bits routed as a unit (the bitwidth or granularity). ...
doi:10.1145/968280.968283
dblp:conf/fpga/WeaverHW04
fatcat:r5uyvrc66bf2dgfugk6abllkiu
Nicaragua or Panama
1901
Scientific American
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
On the question of the relative difficulty of constructing the great dams which are the essential features of each project, Mr. ...
In this connection it is asked, "What will be the effect of this great fall of water on the canal channel where this channel lies in the bed of the San Juan River?" THE QUESTION OF SILT. ...
doi:10.1038/scientificamerican12211901-406a
fatcat:6du7umnp5ffvdaauqxngzs2vya
Pennsylvania Railroad Terminal Station and Tunnel
1901
Scientific American
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
On the question of the relative difficulty of constructing the great dams which are the essential features of each project, Mr. ...
In this connection it is asked, "What will be the effect of this great fall of water on the canal channel where this channel lies in the bed of the San Juan River?" THE QUESTION OF SILT. ...
doi:10.1038/scientificamerican12211901-406
fatcat:euphlkxodzcwbchwnntmccocq4
Multi-Media and Multi-Band Based Adaptation Layer Techniques for Underwater Sensor Networks
2019
Applied Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
For the channel selection mechanism, two phases are involved: 1. Finding the distance of near and far nodes using Manhattan method, and 2. ...
The transmission of data starts from sensor nodes to surface gateway in a hierarchical manner through multiple channels. ...
This method is used for energy balancing in underwater routing techniques. Its major disadvantage is the difficulty of finding the position of the node due to node mobility. ...
doi:10.3390/app9153187
fatcat:upz6pxry6fc6fnuo3qa6nupkfq
« Previous
Showing results 1 — 15 out of 4,366 results