Computer-aided design and analysis of circuits and semiconductor – Nanotechnology related integrated circuit design
Reexamination Certificate
2005-06-21
2005-06-21
Smith, Matthew (Department: 2825)
Computer-aided design and analysis of circuits and semiconductor
Nanotechnology related integrated circuit design
C716S030000, C716S030000, C716S030000, C716S030000, C703S016000
Reexamination Certificate
active
06910196
ABSTRACT:
A method and apparatus to obtain minimum cycle latency and maximum required time at a driver for an assignment of clocked and non-clocked repeaters in a topology comprising, determining whether a node in the topology is a leaf, and assigning covers if the node is a leaf. Determining whether the node in the topology comprises one branch or two branches. Assigning covers to each node and eliminating inferior covers. Merging covers, and deleting inferior covers taking into account a difference in interconnect latency associated with the covers. The above method may be modified with a heuristic to insert repeaters in a topology for a given latency at each driver-receiver pair.
REFERENCES:
patent: 5410491 (1995-04-01), Minami
patent: 5557779 (1996-09-01), Minami
patent: 6117182 (2000-09-01), Alpert et al.
patent: 6807520 (2004-10-01), Zhou et al.
patent: 2003/0014724 (2003-01-01), Kojima et al.
Lin et al., “Buffer size driven partitioning for HW/SW co-design”, proceedings of International Conference on Computer Design: VLSI in Computers and Processors, Oct. 5, 1998, pp. 596-601.
Chen et al., “An algorithm for zero-skew clock tree routing with buffer insertion”, Proceedings of 1996 European Design and Te Conference, Mar. 11, 1996, pp. 230-236.
Mehta et al., “Clustering and load balancing for buffered clock tree synthesis”, 1997 IEEE International Conference on Comput Design: VLSI in Computers and Processors, Oct. 12, 1997, pp. 217-223.
Lin et al., “Performance and interface buffer size driven behavioral partitioning for embedded systems”, 1998 Ninth Internationa Workshop on Rapid System Prototyping, Jun. 3, 1998, pp. 116-121.
Hassoun, Soha, et al., “Optimal Buffered Routing Path Constructions for Single and Multiple Clock Domain Systems”,IEEE No. 0-7803-7607-2/02, IBM Austin Research Laboratory, Austin, TX, (2002), pp. 247-253.
Van Ginneken, Lukas P.P.P., “Buffer Placement in Distributed RC-tree Networks for Minimal Elmore Delay”,IEEE No. CH2868-8/90/0000-0, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, (1990), pp. 865-868.
Kik Phallaka
Schwegman Lundberg Woessner & Kluth P.A.
Smith Matthew
LandOfFree
Clocked and non-clocked repeater insertion in a circuit design does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Clocked and non-clocked repeater insertion in a circuit design, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clocked and non-clocked repeater insertion in a circuit design will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3513538