US 8,572,542 B2Granted

Clock-tree structure and method for synthesizing the same

AssigneeNational Taiwan University

InventorsXin-Wei Shih, Yao-Wen Chang

Life of this patent

Estimating the term…

Loading patent…

Abstract

A method for synthesizing a clock-tree structure may be applied to a physical design such as an integrated circuit or a printed circuit board to form a symmetrical clock-tree structure, while achieving the effects including minimizing a clock skew, having a process variation tolerance and increasing the synthesizing rate. To prevent a certain level from having too many branches and ensure that the clock-tree structure satisfies the fan-out constraint, a plurality of pseudo sinks are provided such that the result of factorizing the value of the number of the total sinks may satisfy the fan-out constraint. The levels in the clock-tree structure may have equal branch lengths by employing snaking routing, so as to achieve a symmetrical clock-tree structure design and reduce the clock skew of the clock-tree.

Claims7

Dependent claims

A clock-tree structure applied to a physical design of an integrated circuit, a clock routing being performed symmetrically, the clock-tree structure comprising:

a plurality of levels, each of which has a plurality of nodes, wherein each of the nodes has an equal number of branches and is connected via the branches to nodes of a next level by using snaking routing, a sum of numbers of branches of all nodes in each of the levels is equal to a total branch number of the each level, a number of nodes of the each level is equal to a total branch number of a previous level to the each level, and nodes in the each level have equal branch lengths;
a plurality of sinks, each of which defines nodes of the last one of the plurality of levels, wherein each node in the each level has a branch number that is defined to be a branch number of each of the levels;
and
a plurality of buffers that are inserted on all branches of the each node in the each level, wherein connection lengths between the each node and the buffers on the branches of the node are equal, and the buffers on the branches in the same level are completely the same.

1 more element

Dependencies are inferred from the claim text.