<p>Routing techniques for plain ’flat’ microchips have been developed extensively and will soon reach its limitations. One natural step would be to develop chips which are manufactured in a more cubic type of volume, as oppose to the classical flat design. </p><p>This thesis proposes a method for routing two-point nets across a three- dimensional channel. The height required by this algorithm is of the order <i>O(n</i> <sup>(3/2)</sup>), where n is the number of terminals on a square top-layer with the side <i>2 (n</i><sup>(1/2)</sup>). </p><p>The algorithm proposed here is based on"On Routing Two-Point Nets Across a Channel", by Ron Y. Pinter [9], and the concepts from this paper are explainedin this thesis to familiarise the reader these. </p><p>It is also shown that the proposed algorithm is more effective in its volume than the two-dimensional counterpart. The algorithm here is of the order <i>O(n</i><sup>(3/2)</sup>) with the two-dimensional algorithm of the order <i>O</i>(<i>n</i><sup>2</sup>).</p>
| Identifer | oai:union.ndltd.org:UPSALLA/oai:DiVA.org:liu-2948 |
| Date | January 2005 |
| Creators | Hurtig, Patrik |
| Publisher | Linköping University, Department of Electrical Engineering, Institutionen för systemteknik |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, text |
Page generated in 0.0022 seconds