B. A. McCoy and G. Robins, "Non-Tree Routing", IEEE Trans. CAD 14(6) (1995), pp. 780-784. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Balanced-Mesh Clock Routing Technique Using Circuit.. - Hidenori Sato Akira (1996) (1 citation) (Correct)
....it can reduce the power dissipation of the clock signal significantly.Furthermore, it provides the advantages of FMM, i.e. easy routing with at most one routing track in each channel. Another important point is, in general, the delay with mesh routing is smaller than with tree based approaches [8, 9]. The BMM was applied to several circuits including a MPEG2 LSI. The results show that the BMM can be used to design circuits with more than 100 MHz clock frequency with almost no area overhead. Section 2 discusses the effect of partitioning on the clock skew and delay time and describes the ....
B. A. McCoy and G. Robins: "Non-Tree Routing ", Proc. of IEEE European Design and Test Conference, pp. 430--434(1994).
Estimation Of The Ic Layout Sensitivity To Spot Defects - Kuzmicz (1999) (Correct)
....of missing conductive material resulting in a broken connection. However, one can not assume that a break which is situated between a pair of contacts is equivalent to an open. A break situated between two contacts does not affect the operation of the circuit if the redundant non tree routing [10] is used (Fig. 3a) Fig. 3a might suggest a simple rule: an open occurs if a region in a mask is divided by a defect into two disjoint regions (Fig. 2) but not if no separation into disjoint regions occurs (Fig. 3a) This can be true for metal masks but not necessarily for other conducting layers. ....
B. A. MCCOY, G. ROBBINS, Non-Tree Routing, Proc. of the European Design and Test Conference ED&TC-94, Paris, Mar. 1994, pp. 430-434.
Post Routing Performance Optimization via Multi-Link Insertion .. - Tianxiong Xue (1995) (7 citations) (Correct)
....fixed topologies, such simplification sacrifices the flexibility in routing. This paper proposes a new approach for post routing performance optimization via multi link insertion and non uniform wiresizing, which improves the performance of an existing net topology after global routing. Unlike [6], which greedily adds new edges into an existing tree on a geometric graph, we analyze in detail the impact of link insertion on maximum delay and skew of any arbitrary topology and develop a link insertion and wiresizing algorithm that can achieve the best improvement in performance. Our method ....
B. McCoy and G. Robins, "Non-Tree Routing ",Proc. ED&T 94, pp. 430-434, 1994.
Non-Tree Routing - Bernard Mccoy (1994) (4 citations) Self-citation (Mccoy Robins) (Correct)
....the problem of constructing optimal delay interconnection graph topologies, and discusses the delay models. In Section 3 we present a non tree routing heuristic. Section 4 discusses the experimental results, and we conclude in Section 5. A preliminary version of this work has appeared in [16]. 2 Problem Formulation A signal net N = fn 0 ; n 1 ; n k g is a fixed set of pins in the Manhattan plane to be connected by a routing graph G = N; E) Pin n 0 2 N is a source (i.e. where the signal originates) and the remaining pins are sinks (i.e. where the signal propagates to) Each ....
B. A. McCoy and G. Robins, Non-Tree Routing, in Proc. European Design and Test Conf., Paris, France, February 1994, pp. 430--434.
Research Directions for Coevolution of Rules and Routers - Kahng (2003) (Correct)
No context found.
B. A. McCoy and G. Robins, "Non-Tree Routing", IEEE Trans. CAD 14(6) (1995), pp. 780-784.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC