US20010020289A1 - Modifying timing graph to avoid given set of paths - Google Patents
Modifying timing graph to avoid given set of paths Download PDFInfo
- Publication number
- US20010020289A1 US20010020289A1 US08/964,997 US96499797A US2001020289A1 US 20010020289 A1 US20010020289 A1 US 20010020289A1 US 96499797 A US96499797 A US 96499797A US 2001020289 A1 US2001020289 A1 US 2001020289A1
- Authority
- US
- United States
- Prior art keywords
- duplicate
- nodes
- edges
- paths
- false
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
- G06F30/32—Circuit design at the digital level
- G06F30/33—Design verification, e.g. functional simulation or model checking
- G06F30/3308—Design verification, e.g. functional simulation or model checking using simulation
- G06F30/3312—Timing analysis
Definitions
- the present invention generally relates to the art of microelectronic integrated circuits.
- the present invention relates to the art of placing and connecting cells on integrated circuit chips.
- An integrated circuit chip (hereafter referred to as an “IC” or a “chip”) comprises cells and connections between the cells formed on a surface of a semiconductor substrate.
- the IC may include a large number of cells and require complex connections between the cells.
- a cell is a group of one or more circuit elements such as transistors, capacitors, and other basic circuit elements grouped to perform a function.
- Each of the cells of an IC may have one or more pins, each of which, in turn, may be connected to one or more other pins of the IC by wires.
- the wires connecting the pins of the IC are also formed on the surface of the chip.
- FIG. 1A shows a grossly simplified IC 10 having four cells 12 , 14 , 16 , and 18 and ten pins 22 , 24 , 26 , 28 , 30 , 22 , 34 , 36 , 38 , and 40 .
- the cells will be denoted C nn and the pins will be denoted p nn where nn is the reference number of the cell or the pin used in the figure.
- a netlist is a list of nets for a chip.
- One of the major constraints in design and fabrication of IC's is the time the IC requires to perform the specified function. This is often referred to as the performance of the IC.
- various time measurements must to be considered. This is because, in addition to the input and output lines, the IC may include internal registers, or flip-flops, which may store certain output values and provide a portion of input values to the logic circuits.
- the performance of an IC may be defined as the period of time between the instant the last of the input signals are available to the logic circuit (whether the signals are from the input lines or from internal registers) to the instant the latest of the output signals are available from the logic circuit (whether the signals are for the output lines or for internal registers) .
- the delay of the IC 10 is 3 ns. This is true even if the other outputs signals of the IC are available at t 0 +1 ns or at t 0 +2 ns.
- the performance of the IC depends on many factors such as the physical characteristics of the material, the layout of the cells, etc. Some of these factors, such as the physical characteristics of the material of the IC, cannot be changed during the cell placement and routing process. On the other hand, the placement of the cells and the routing of the nets can be modified during the placement process to improve the performance of the IC.
- a net edge is the direction of signal flow from an output pin of a cell to an input pin of another cell, and is obtained by connecting the driverpin of a net with sink pin of the same net.
- a driverpin is the pin of a net which provides the signal to the sink pins of the same net and is typically an output pin of a cell. If a net has a driver pin P d which is connected to a sink pin p s , then the net edge for that signal flow is denoted e n (P d , p s ).
- a sink pin is a pin of a net which receives the signal from a driver pin, and is often an input pin of a cell.
- the IC 10 of FIG. 1A has several net edges. The net edges are e n (p 32 , P 36 ), e n (p 32 , P 38 ), and e n (p 34 , P 40 ).
- edges of an IC are directed edges having a driver pin from which the signal originates and a sink pin to which the signal flows.
- the distinction between the cell edges and net edges is not critical. Therefore, an edge will mean a cell edge or a net edge, and will be denoted e (P p , P c ) to indicate an edge between a parent pin P p and a child pin P c .
- the relationships of ancestor and descendent may exist between an edge and a node or between two edges. For example, if p 1 is an ancestor of P 2 , then P 1 is also an ancestor of the edge e(p 2 , p 3 ). Similarly, if p 7 is a descendent of p 4 , then e(p 7 , P 8 ) is a descendent of p 4 .
- FIG. 1B illustrates a directed graph constructed from the pins and the edges of the IC 10 of FIG. 1A.
- Each node of the graph 50 correspond to a pin of the IC 10 of FIG. 1, and each edge of the graph 50 correspond to an edge of the same IC 10 .
- the edges are directed. That is, each of the edges is indicated by an arrow to show the direction of the signal flow.
- the terms pins and the nodes will be used interchangeably unless otherwise specified.
- the paths of the timing graph of an IC can be analyzed to locate the critical paths.
- p is a child of p i ;
- P i is a parent of p
- arrival(p) 0 if p is an input node.
- each of the paths of the IC must be analyzed.
- m is the number of output pins of the IC
- P j is an output pin.
- the IC delay is the period of time signals take to travel from an input pin to an output pin. Accordingly, it is not possible to determine the IC delay at an output pin without first determining the delay from the input pins to each of the intermediate pins the signal travels through to arrive at the output pin. In fact, for any pin not an input pin, arrival(p) cannot be determined unless the arrival(p) of all of its ancestors are first found.
- the IC delay of the chip represented by the timing graph 70 cannot be determined unless arrival(P 90 ) and arrival(p 92 ) are found. However, arrival(p 92 ) cannot be found until arrival(p 86 ) is first determined. Likewise, arrival(p 86 ) cannot be found until arrival(p 82 ) and arrival( 80 ) are found, and so on.
- the arrival time of each of the pins of the IC must be determined. Because a typical IC contains many thousands or even millions of pins and paths, the analysis of arrival times for each of the pins are computationally expensive. Accordingly, the IC delay analysis of large IC circuits requires a large amount of time even when utilizing very powerful computers.
- IC's usually contain paths the delay of which should not be considered in the determination of the IC delay. These paths are called false paths.
- self-test circuits of the IC may cause high IC delay.
- the self-test circuits are not used during the ultimate use of the IC, and the IC delay, as defined by the self-test, would be misleading. For instance, if the self-test circuits causes the IC to have the IC delay of 20 ns where the other, more relevant portions of the IC has the delay of 5 ns, then the IC delay of 20 ns is misleading.
- an object of the present invention is to provide for a method and apparatus to ignore the false paths of an IC for the purposes of analyzing IC timing graphs and determining IC delays.
- the present invention provides for a method of modifying timing graph to avoid false paths, by modifying the timing graph to include all the paths except the false paths.
- the timing graph is modified by constructing duplicate nodes, duplicate edges, and mixed edges, and by replacing selected non-duplicate edges by mixed edges.
- the present invention also provides for an integrated circuit for which the arrival time of its pins were determined by constructing a timing graph, modifying the timing graph to exclude false paths, and determining the arrival time of the non- duplicate and duplicate nodes of the modified timing graph.
- the present invention also provides for an apparatus for of modifying timing graphs to avoid false paths.
- the apparatus has a processor and memory connected to the processor.
- the memory stores instructions for the processor to modify the timing graph to include all the paths except the false paths.
- FIG. 1A is a simplified illustration of an integrated circuit chip
- FIG. 1B is a timing graph derived from the integrated circuit chip of FIG. 1A;
- FIG. 2 is a sample directed timing graph
- FIG. 3 is the sample directed timing graph of FIG. 2 after it has been modified in accordance with the technique of the present invention.
- FIG. 4 is a block diagram illustrating an apparatus according to a preferred embodiment of the present invention.
- Directed timing graph may be used to facilitate the analysis of the paths of an IC.
- the timing graph used in delay calculations is constructed from the netlist. Therefore, a timing graph must first be constructed from a given IC design in order for the circuit to be analyzed.
- the timing graph 70 has input pins 72 , 74 , 76 , and 78 , output pins 90 and 92 , and pins 80 , 82 , 84 , and 86 .
- the pins will be denoted P nn where nn is the reference number of the pin used in the figure.
- the graph 70 also has the following edges e(p 72 , P 84 ), e(P 74 , P 82 ), e(P 76 , P 80 ), e(P 78 , P 80 ), e(P 80 , P 82 ), e(p 80 , P 86 ), e(P 82 , P 84 ), e(P 82 , P 86 ), e(P 84 , P 90 ), e(P 86 , P 90 ), and e(P 86 , P 92 ).
- the terms pins and the nodes will be used interchangeably unless otherwise specified.
- the arrival(p) is determined by analyzing each of the nodes of the graph.
- the IC delay is the larger of the two which is 6.8 ns of pgo. This value may be denoted D.
- the critical paths are the paths leading to the highest arrival time at an output node. In the present example, the critical path is path(p 76 , P 80 , P 86 , P 90 ) requiring 6.8 ns for signal to traverse the path.
- path(P 76 , P 80 , P 86 , P 90 ) is a false path, then the IC delay of 6.8 ns is misleading because that path should not be used in determining the IC delay. Also, the calculation of path(P 76 , P 80 , P 86 , P 90 ) required computational resources.
- the false paths form groups that can be expressed as “all the paths starting in the set of nodes N 1 , then going through the set of edges E 1 , then through the set of nodes N 2 ,” and so on.
- groups of paths can be called a path interval.
- a path interval is an alternating sequence of sets of nodes and sets of edges such that every element from N 1 is an ancestor of every element from any other sets of nodes or edges of the path interval.
- a path interval may comprise one or more paths to be ignored for the purposes of arrival time and IC delay determinations. Because all edges have a parent and a child node, a path interval always begins and ends with a set of nodes.
- a path interval is denoted PI.
- PI ⁇ N 1 , E 1 , N 2 , E 2 , . . . , E n ⁇ 1 , N n ⁇
- N 1 is a set of beginning nodes, not necessarily the input nodes
- E 1 is a set of edges, each edge having a parent node belonging to N 1 and a child node belonging to N 2 ;
- N 2 is a set of nodes, each node being a child node of an edge belonging to E 1 ; and so on until
- N n is a set of finishing nodes, each node being a child node of an edge belonging to E n ⁇ 1 ; the nodes of N n are not necessarily the output nodes.
- V beg (PI) N 1 , set of all nodes comprising the top level nodes, or input nodes, of PI. These are not necessarily the input nodes of the timing graph;
- V fin (PI) N n , set of all nodes comprising the bottom level nodes, or output nodes of PI; These are not necessarily the output nodes of the timing graph; and
- W(PI) set of all edges of the path interval PI
- V(PI) ⁇ P 76 , P 80 , P 86 , P 90 ⁇
- V fin (PI) ⁇ P 80 ⁇
- V int (PI) ⁇ P 80 , P 86 ⁇
- W(PI) ⁇ e(P 76 , P 80 ), e(P 80 , P 86 ), e(P 86 , P 90 ) ⁇
- Step 1 For each node in V int (PI), a duplicate node, denoted P′ nn , is constructed.
- a pin, or a node is denoted pnn where nn is the reference number used in the figure to identify the node.
- the duplicate pin if p nn will be denoted p′ nn where nn′ is the reference number used in the figure to identify the duplicate pin.
- Pin p′ nn is the duplicate of non-duplicate pin p nn .
- non-duplicate nodes For uniformity of terminology, the nodes of the original graph 70 of FIG. 2 will be referred to as non-duplicate nodes or non-duplicate pins. Similarly, edges connecting non-duplicate nodes will be referred to as non-duplicate edges. Edges connecting duplicate nodes will be referred to as duplicate edges. Edges connecting a duplicate pin and a non-duplicate pin will be referred to as a mixed edge.
- a duplicate node corresponds to the non-duplicate node to which it is the duplicate of. For instance, node P′ 80 corresponds to node P 80 .
- Step 3 For every edge e(p m , P n ) in W int (PI), a duplicated edge e(p′ m , P′ n ) is constructed.
- delay(p i , p j ) delay(p i , p′ j ) where P′ j is a duplicate of p j .
- delay(p i , p j ) delay(p′ i , p′ j ).
- FIG. 2 shows the timing graph 70 which has a false path path(p 76 , P 80 , P 86 , P 90 ).
- the false path if not ignored, defines the IC delay of the circuit represented by the graph 70 because the false path includes an output pin with the highest arrival time.
- PI is a one member set comprising path(p 76 , P 80 , P 86 , P 90 ).
- FIG. 3 shows a timing graph 70 ′ which is the timing graph 70 of FIG. 2 after it has been modified in accordance with the steps outlined above. Note that in the modified graph 70 ′, the false path path(p 76 , P 80 , P 86 , P 90 ) does not exist, but all other paths exists.
- Step 1 is applied to the graph 70 by constructing duplicate pins P′ 80 and P′ 86 because P 80 and P 86 are members of V int (PI).
- the set W int (PI) comprises only one edge e(p 80 , P 86 ).
- a duplicate edge, e(p′ 80 , P′ 86 ) is constructed.
- Step 4 requires the addition of edges e(p′80, P 82 ) and e(p′ 86 , P 92 ). Note that for each of the edges e(P 80 , P 82 ) and e(p 86 , p 90 ), the parent nodes were members of V int (PI), and the child nodes were not members of V(PI).
- the new IC delay value for the circuit represented by the graph 70 ′ is 6.6 ns via path path(p 78 , P 80 , P 86 , P 90 ).
- Such expectation is based on the fact that path(p 76 , P 80 , P 86 , P 92 ) was the path with the second longest delay according to the original graph 70 . See FIG. 2 and Table 2.
- the removal of the false path allowed a true path with a delay higher than 5.9 ns to be detected.
- the apparatus comprises a processor 102 and memory 104 . connected to the processor.
- the memory 104 stores instructions for the processor 102 for the processor 102 to modify the timing graph to include all the paths except the false paths.
- the memory 104 may be any kind of machine-readable storage medium containing the instructions for the processor to read input information 106 , modify the timing graph, and produce an output 108 .
- the input 106 may comprise the original timing graph, in which case, the memory 104 comprises instructions for the processor 102 to modify the timing graph and to produce, as the output 108 , the modified timing graph.
- the memory 104 comprises instructions for the processor 102 to construct a timing graph, modify the timing graph, and determine the arrival times of the pins of the circuit to produce, as the output 108 , the arrival times of the pins of the circuit.
- the memory may be formed as a semiconductor memory device, magnetic device, optical device, magneto-optical device, floppy diskette, hard drive, CD-ROM, magnetic tape, computer memory, or memory card.
Abstract
Description
- 1. Field of the Invention
- The present invention generally relates to the art of microelectronic integrated circuits. In particular, the present invention relates to the art of placing and connecting cells on integrated circuit chips.
- 2. Description of Related Art
- An integrated circuit chip (hereafter referred to as an “IC” or a “chip”) comprises cells and connections between the cells formed on a surface of a semiconductor substrate. The IC may include a large number of cells and require complex connections between the cells.
- A cell is a group of one or more circuit elements such as transistors, capacitors, and other basic circuit elements grouped to perform a function. Each of the cells of an IC may have one or more pins, each of which, in turn, may be connected to one or more other pins of the IC by wires. The wires connecting the pins of the IC are also formed on the surface of the chip. For example, FIG. 1A shows a grossly simplified
IC 10 having fourcells pins - A net is a set of two or more pins which must be connected. Because a typical chip has thousands, tens of thousands, or hundreds of thousands of pins, which must be connected in various combinations, the chip also includes definitions of thousands, tens of thousands, or hundreds of thousands of nets, or sets of pins. The number of the nets for a chip is typically in the same order as the order of the number of cells on that chip. Commonly, a majority of the nets include only two pins to be connected; however, many nets comprise three or more pins. Some nets may include hundreds of pins to be connected. The IC10 of FIG. 1A has two nets. The first net is a two-pin net comprising pins P34 and p40. The second net is a three pin net comprising pins P32, P36, and P38. A net can be denoted as a set of pins net (P1, P2, . . . Pn).
- A netlist is a list of nets for a chip.
- Typically, an IC has a plurality of input pins and a plurality of output pins. The inputs are digital electrical signals being provided to the IC to be operated on. The outputs are digital electrical signals resulting from the operations of the IC. In between the input pins receiving the input signals to the IC and the output pins providing the output signals, the digital signals are operated on by a plurality of cells connected to each other. The connections of the cells are defined by the nets discussed hereinabove. The IC10 of FIG. 1A has three input pins—P22, P24, and P26—and two output pins—P28 and P30. For the purposes of describing the present invention, the pins of the IC which are neither input pins nor output pins will be referred to as intermediate pins.
- One of the major constraints in design and fabrication of IC's is the time the IC requires to perform the specified function. This is often referred to as the performance of the IC. To determine the performance of an IC, various time measurements must to be considered. This is because, in addition to the input and output lines, the IC may include internal registers, or flip-flops, which may store certain output values and provide a portion of input values to the logic circuits. The performance of an IC may be defined as the period of time between the instant the last of the input signals are available to the logic circuit (whether the signals are from the input lines or from internal registers) to the instant the latest of the output signals are available from the logic circuit (whether the signals are for the output lines or for internal registers) . The instant the input signal are applied is often denoted as t0. In any event, the performance of the IC is the period of time required for the logic circuits of the IC to performs its designed function irrespective of whether the inputs to the logic circuits are from the input pins or from the flip-flops or the outputs from the logic circuits are to the output pins or to the flip-flops. The performance of the IC is also referred to as the delay of the IC, or the IC delay.
- For example, if the inputs to the
IC 10 of FIG. 1A is applied at time t0 and the last of the output signals of the IC is available at t0+3 ns (nano-seconds), then the delay of theIC 10 is 3 ns. This is true even if the other outputs signals of the IC are available at t0+1 ns or at t0+2 ns. - The performance of the IC depends on many factors such as the physical characteristics of the material, the layout of the cells, etc. Some of these factors, such as the physical characteristics of the material of the IC, cannot be changed during the cell placement and routing process. On the other hand, the placement of the cells and the routing of the nets can be modified during the placement process to improve the performance of the IC.
- In order to increase the performance of the IC by modifying the placement of the cells and re-routing the nets, the paths of the IC must be analyzed and the critical paths identified. A path is an alternating sequence of nodes and edges connecting them. A criticalpath is the path or the paths among all possible paths of an IC which causes the highest delay of the IC.
- An edge is the direction of signals flow through the cells and the wires. There are two types of edges in an IC. A cell edge is the direction of signals flow through the cells of an IC, and is obtained by “connecting” an input pin of a cell with an output pin of the same cell. If a cell takes an input signal at pin pi and produces and output signal at pin P0, then the cell edge for that signal flow is denoted ec(pi, P0) Then, pi is called a parent of P0 and p0 a child of pi. For example, the IC 10 of FIG. 1A has several cell edges. The cell edges are ec(P22, P32), ec(P24, P34), ec(P26, P34), ec(P36, P38), ec(P38, P30), and ec(P40, P30). A pin may have none (for an input pin), one, or many parent(s), and none (for an output pin), one, or many children. If there is a path from node P1 to node P2, then P1 is an ancestor of P2 and P2 is a descendant of P1.
- A net edge is the direction of signal flow from an output pin of a cell to an input pin of another cell, and is obtained by connecting the driverpin of a net with sink pin of the same net. A driverpin is the pin of a net which provides the signal to the sink pins of the same net and is typically an output pin of a cell. If a net has a driver pin Pd which is connected to a sink pin ps, then the net edge for that signal flow is denoted en(Pd, ps). A sink pin is a pin of a net which receives the signal from a driver pin, and is often an input pin of a cell. For example, the IC 10 of FIG. 1A has several net edges. The net edges are en(p32, P36), en(p32, P38), and en(p34, P40).
- All edges of an IC are directed edges having a driver pin from which the signal originates and a sink pin to which the signal flows. For the purposes of the present invention, the distinction between the cell edges and net edges is not critical. Therefore, an edge will mean a cell edge or a net edge, and will be denotede(Pp, Pc) to indicate an edge between a parent pin Pp and a child pin Pc.
- A path may be denoted as a set of pins and edges, for example, path(p1, e(p1, P2), P2, e(p2, P3), P3, . . . ) An alterative expression of the path is to merely list the nodes, for example, path(p1, P2, . . . ). Regardless of how it is denoted, a path comprises pins and edges connecting the pins.
- The relationships of ancestor and descendent may exist between an edge and a node or between two edges. For example, if p1 is an ancestor of P2, then P1 is also an ancestor of the edge e(p2, p3). Similarly, if p7 is a descendent of p4, then e(p7, P8) is a descendent of p4.
- FIG. 1B illustrates a directed graph constructed from the pins and the edges of the
IC 10 of FIG. 1A. Each node of the graph 50 correspond to a pin of theIC 10 of FIG. 1, and each edge of the graph 50 correspond to an edge of thesame IC 10. In FIG. 1B, the edges are directed. That is, each of the edges is indicated by an arrow to show the direction of the signal flow. In the present specification, the terms pins and the nodes will be used interchangeably unless otherwise specified. - Because each of the edges of the directed graph50 of FIG. 1B represents a signal travel through a cell or through a wire, each of the edges can be assigned an edge delay to indicate the time required for a signal to travel from the parent pin to the child pin. Then, the directed graph is referred to as a directed timing graph or merely a timing graph. The delay of e(p1, P2) is denoted delay(p1, P2). It takes time for electrical signal to travel from pin to pin; thus, every edge has a delay.
- The paths of the timing graph of an IC can be analyzed to locate the critical paths.
- The timing characteristics of the cell edges can be obtained from libraries. However, the timing characteristics of net edges are not easily obtainable before the actual routing of the nets.
- The period of time required for signals to travel from an input pin to pin p may be called the arrival time of pin p. The arrival time of node p, denoted arrival(p), is the latest time a signal from an input mode reaches node though any available path from an input node to the node. Formally, arrival(p) is
- where k is the number of parents of p; and
- p is a child of pi;
- Pi is a parent of p; and
- arrival(p)=0 if p is an input node.
-
- where m is the number of output pins of the IC;
- Pj is an output pin.
- As discussed above, the IC delay is the period of time signals take to travel from an input pin to an output pin. Accordingly, it is not possible to determine the IC delay at an output pin without first determining the delay from the input pins to each of the intermediate pins the signal travels through to arrive at the output pin. In fact, for any pin not an input pin, arrival(p) cannot be determined unless the arrival(p) of all of its ancestors are first found.
- For example, referring to FIG. 2, the IC delay of the chip represented by the
timing graph 70 cannot be determined unless arrival(P90) and arrival(p92) are found. However, arrival(p92) cannot be found until arrival(p86) is first determined. Likewise, arrival(p86) cannot be found until arrival(p82) and arrival(80) are found, and so on. - To find the delay of an IC, the arrival time of each of the pins of the IC must be determined. Because a typical IC contains many thousands or even millions of pins and paths, the analysis of arrival times for each of the pins are computationally expensive. Accordingly, the IC delay analysis of large IC circuits requires a large amount of time even when utilizing very powerful computers.
- Additionally, IC's usually contain paths the delay of which should not be considered in the determination of the IC delay. These paths are called false paths. For example, self-test circuits of the IC may cause high IC delay. However, the self-test circuits are not used during the ultimate use of the IC, and the IC delay, as defined by the self-test, would be misleading. For instance, if the self-test circuits causes the IC to have the IC delay of 20 ns where the other, more relevant portions of the IC has the delay of 5 ns, then the IC delay of 20 ns is misleading.
- In short, to determine the delay of an IC, only the true paths of the IC should be considered. Calculation of the arrival times and the delays of the false paths wastes the processing time and provides misleading results for the IC.
- Therefore, an object of the present invention is to provide for a method and apparatus to ignore the false paths of an IC for the purposes of analyzing IC timing graphs and determining IC delays.
- The present invention provides for a method of modifying timing graph to avoid false paths, by modifying the timing graph to include all the paths except the false paths. The timing graph is modified by constructing duplicate nodes, duplicate edges, and mixed edges, and by replacing selected non-duplicate edges by mixed edges.
- The present invention also provides for an integrated circuit for which the arrival time of its pins were determined by constructing a timing graph, modifying the timing graph to exclude false paths, and determining the arrival time of the non- duplicate and duplicate nodes of the modified timing graph.
- The present invention also provides for an apparatus for of modifying timing graphs to avoid false paths. The apparatus has a processor and memory connected to the processor. The memory stores instructions for the processor to modify the timing graph to include all the paths except the false paths.
- FIG. 1A is a simplified illustration of an integrated circuit chip;
- FIG. 1B is a timing graph derived from the integrated circuit chip of FIG. 1A;
- FIG. 2 is a sample directed timing graph;
- FIG. 3 is the sample directed timing graph of FIG. 2 after it has been modified in accordance with the technique of the present invention; and
- FIG. 4 is a block diagram illustrating an apparatus according to a preferred embodiment of the present invention.
- Directed timing graph may be used to facilitate the analysis of the paths of an IC. The timing graph used in delay calculations is constructed from the netlist. Therefore, a timing graph must first be constructed from a given IC design in order for the circuit to be analyzed.
- Referring to FIG. 2, a
sample timing graph 70 is illustrated. Thetiming graph 70 has input pins 72, 74, 76, and 78, output pins 90 and 92, and pins 80, 82, 84, and 86. For simplicity, the pins will be denoted Pnn where nn is the reference number of the pin used in the figure. Thegraph 70 also has the following edges e(p72, P84), e(P74, P82), e(P76, P80), e(P78, P80), e(P80, P82), e(p80, P86), e(P82, P84), e(P82, P86), e(P84, P90), e(P86, P90), and e(P86, P92). In the present specification, the terms pins and the nodes will be used interchangeably unless otherwise specified. - For the purposes of the discussion, the following sample delay values are assigned to the edges of the
graph 70 of FIG. 2:TABLE 1 Edges Edge Delay (in nano seconds) e(p76, p80), e(p80, p82) 1.0 e(p78, p80) 0.8 e(p74, p82), e(p84, p90) 1.2 e(p72, p84), e(p76, p82) 1.4 e(p80, p86) 3.2 e(p82, p84) 1.8 e(p82, p86) 1.5 e(p86, p90) 2.6 e(p86, p92) 1.7 - The arrival(p) is determined by analyzing each of the nodes of the graph. The resultant arrival times of the
sample graph 70 is summarized by Table 2 below:TABLE 2 Node Arrival time (0 = t0, in ns) p72, p74, p76, p78 0 p80 1.0 p82 2.0 via path(p76, p80, p82) p84 3.8 via path(p76, p80, p82, p84) p86 4.2 via path(p76, p80, p86) p90 6.8 via path(p76, p80, p86, p90) p92 5.9 via path(p76, p80, p86, p92) - Because nodes P90 and P92 are the output nodes, the IC delay is the larger of the two which is 6.8 ns of pgo. This value may be denoted D. The critical paths are the paths leading to the highest arrival time at an output node. In the present example, the critical path is path(p76, P80, P86, P90) requiring 6.8 ns for signal to traverse the path.
- However, if path(P76, P80, P86, P90) is a false path, then the IC delay of 6.8 ns is misleading because that path should not be used in determining the IC delay. Also, the calculation of path(P76, P80, P86, P90) required computational resources.
- To preclude the use of a false path delay as an IC delay, and to avoid the arrival time calculation of the false paths, the following technique may be used:
- Identify the False Path Intervals
- Very often, the false paths form groups that can be expressed as “all the paths starting in the set of nodes N1, then going through the set of edges E1, then through the set of nodes N2,” and so on. Such groups of paths can be called a path interval. Thus, a path interval is an alternating sequence of sets of nodes and sets of edges such that every element from N1 is an ancestor of every element from any other sets of nodes or edges of the path interval. A path interval may comprise one or more paths to be ignored for the purposes of arrival time and IC delay determinations. Because all edges have a parent and a child node, a path interval always begins and ends with a set of nodes.
- The arrival time of the nodes of the false paths can be easily ignored by grouping the false paths into path intervals. A path interval is denoted PI.
- First, the false path interval must be clearly defined by determining the beginning nodes, finishing nodes, and the intermediate nodes of the false path interval. Assuming that the false path interval is defined as
- PI={N1, E1, N2, E2, . . . , En−1, Nn}
- where
- N1 is a set of beginning nodes, not necessarily the input nodes;
- E1 is a set of edges, each edge having a parent node belonging to N1 and a child node belonging to N2;
- N2 is a set of nodes, each node being a child node of an edge belonging to E1; and so on until
- Nn is a set of finishing nodes, each node being a child node of an edge belonging to En−1; the nodes of Nn are not necessarily the output nodes.
- Then, define
- V(PI)=set of all nodes of the path interval PI
- Vbeg(PI)=N1, set of all nodes comprising the top level nodes, or input nodes, of PI. These are not necessarily the input nodes of the timing graph;
- Vfin(PI)=Nn, set of all nodes comprising the bottom level nodes, or output nodes of PI; These are not necessarily the output nodes of the timing graph; and
- Vint(PI)=V(PI)−(Vbeg(PI)∪Vfin(PI)), all other nodes of PI.
- And define
- W(PI)=set of all edges of the path interval PI;
- Wbeg(PI) set of edges having a parent node belonging in Vbeg(PI);
- Wfin(PI)=set of edges having a child node belonging in Vfin(PI); and
- wint(PI)=W(PI)−(Wbeg(PI)∪Wfin(PI)), all other edges of PI.
- Referring again to FIG. 2, these definitions can be illustrated using the directed
timing graph 70. Assuming that the path(P76, P80, P86, P90) is a false path, a false path interval, PI, is defined as comprising a single false path, path(p76, P80, P86, P90), then, - V(PI)={P76, P80, P86, P90}
- Vbeg(PI)={P76}
- Vfin(PI)={P80}
- Vint(PI)={P80, P86}
- W(PI)={e(P76, P80), e(P80, P86), e(P86, P90)}
- Wbeg(PI)={e(P76, P80)}
- Wfin(PI)={e(P86, P90)}
- Wint(PI)={e(P80, P86)}
- Modify the Graph
- To modify the timing graph to preclude the analysis of the false paths grouped in a false path interval PI, the following operation are applied to the graph:
- Step 1. For each node in Vint(PI), a duplicate node, denoted P′nn, is constructed. As discussed above, a pin, or a node, is denoted pnn where nn is the reference number used in the figure to identify the node. For simplicity, the duplicate pin if pnn will be denoted p′nn where nn′ is the reference number used in the figure to identify the duplicate pin. Pin p′nn is the duplicate of non-duplicate pin pnn.
- For uniformity of terminology, the nodes of the
original graph 70 of FIG. 2 will be referred to as non-duplicate nodes or non-duplicate pins. Similarly, edges connecting non-duplicate nodes will be referred to as non-duplicate edges. Edges connecting duplicate nodes will be referred to as duplicate edges. Edges connecting a duplicate pin and a non-duplicate pin will be referred to as a mixed edge. A duplicate node corresponds to the non-duplicate node to which it is the duplicate of. For instance, node P′80 corresponds to node P80. Similarly, a duplicate edge or a mixed edge corresponds to the non-duplicate edge if the node or the nodes defining the duplicate or mixed edge corresponds to the node or nodes of the non-duplicate edge. For example, e(p′80, P′86) corresponds to e(p80, P86), and e(p′86, P92) corresponds to e(p86, P92). The sets of duplicate nodes, duplicate edges, and mixed edges comprise a duplicate graph. Note that a duplicate graph does not completely copy the original timing graph, but copies only a portion of the original timing graph. - Step 2. For every edge e(pi, pj) in Wbeg(PI), if the child node, pj, is a member of Vint(PI), then the edge e(pi, pj) is deleted and a new edge e(pi, p′j) is constructed. Node p′j exists for the edge because it was constructed during Step 1. Note that pi is a member of Vbeg(PI). The edges of Wbeg(PI) is also referred to as the top level edges of PI.
-
Step 3. For every edge e(pm, Pn) in Wint(PI), a duplicated edge e(p′m, P′n) is constructed. - Step 4. For every edge e(pj, Pk), if the parent node, pj, is a member of Vint(PI) and the child node, pk, is not a member of V(PI), then a new edge e(p′j, Pk) is added.
- The modification of the graph is now complete, and the new, modified timing graph may be used to calculate the arrival time of the pins and the IC delay of the circuit. The edge delay between a non-duplicate pin and a duplicate pin is same as the edge delay between the non-duplicate pin and the non-duplicate pin to which the child pin is the duplicate of. More formally,
- delay(pi, pj)=delay(pi, p′j) where P′j is a duplicate of pj.
- Also,
- delay(pi, pj)=delay(p′i, pj); and
- delay(pi, pj)=delay(p′i, p′j).
- To calculate the IC delay of the circuit represented by the modified timing graph, all the nodes, including the non-duplicate and the duplicate nodes, must be analyzed for the arrival times.
- FIG. 2 shows the
timing graph 70 which has a false path path(p76, P80, P86, P90). As analyzed above, the false path, if not ignored, defines the IC delay of the circuit represented by thegraph 70 because the false path includes an output pin with the highest arrival time. In this example, there is only one false path, so the false path interval, PI is a one member set comprising path(p76, P80, P86, P90). - FIG. 3 shows a
timing graph 70′ which is thetiming graph 70 of FIG. 2 after it has been modified in accordance with the steps outlined above. Note that in the modifiedgraph 70′, the false path path(p76, P80, P86, P90) does not exist, but all other paths exists. - Beginning with the
graph 70 of FIG. 2, Step 1 is applied to thegraph 70 by constructing duplicate pins P′80 and P′86 because P80 and P86 are members of Vint(PI). - Step2 requires the deletion of e(P76, P80) and addition of e(P76, P′80). Note that e(P76, P80) is a member of Wbeg(PI), and P80 is a member of Vint(PI).
- In the present example, the set Wint(PI) comprises only one edge e(p80, P86). Thus, in accordance with
Step 3, a duplicate edge, e(p′80, P′86) is constructed. - Finally, the application of Step4 requires the addition of edges e(p′80, P82) and e(p′86, P92). Note that for each of the edges e(P80, P82) and e(p86, p90), the parent nodes were members of Vint(PI), and the child nodes were not members of V(PI).
- The resultant directed
timing graph 70′ of FIG. 3 has all the nodes and the edges of theinitial graph 70 except the false paths as defined by the false path interval PI. - Because the edge delay between a non-duplicate pin and a duplicate pin, and the edge delay between duplicate pins are same as the edge delay between the corresponding non-duplicate pins, the delays of the edges of the new timing graph can be summarized as listed by Table 3 below.
TABLE 3 Edges Edge Delay (in nano seconds) e(p76, p′80), e(p80, p82), e(p′80, p82) 1.0 e(p78, p80) 0.8 e(p74, p82), e(p84, p90) 1.2 e(p72, p84), e(p76, p82) 1.4 e(p80, p86), e(p′80, p′86) 3.2 e(p82, p84) 1.8 e(p82, p86) 1.5 e(p86, p90) 2.6 e(p86, p92), e(p′86, p92) 1.7 - The modified
graph 70′ no longer contains the false path path(p76, P80, P86, P90). However, thegraph 70′ includes paths traversing duplicate nodes and duplicated edges. The arrival(p) for the nodes of thenew graph 70′ is summarized by Table 4 below:TABLE 4 Node Arrival time (0 = t0, in ns) p72, 74, p76, p78 0, input nodes p80 0.8 p′80 1.0 p82 2.0 via path(p76, p′80, p82) p84 3.8 via path(p76, p′80, p82, p84) p86 4.0 via path(p78, p80, p86) p′86 4.2 via path(p76, p′80, p′86) p90 6.6 via path(p78, p80, p86, p90) p92 5.9 via path(p76, p′80, p′86, p92) - Note that the new IC delay value for the circuit represented by the
graph 70′ is 6.6 ns via path path(p78, P80, P86, P90). One could have expected the IC delay of the circuit, after the removal of the false path, to be 5.9 ns via path(p76, P80, P86, P92). Such expectation is based on the fact that path(p76, P80, P86, P92) was the path with the second longest delay according to theoriginal graph 70. See FIG. 2 and Table 2. However, the removal of the false path allowed a true path with a delay higher than 5.9 ns to be detected. This true path, path(p78, P80, P86, P90), was “hidden” by the false path until the false path was removed. Therefore, another advantage of the present invention is that, by removing false paths, the true paths are uncovered for a better analysis of the circuit. - Apparatus for Modifying Timing Graphs to Avoid False Paths
- Now referring to FIG. 5, a
computing apparatus 100 for modifying timing graphs to avoid false paths is illustrated. The apparatus comprises aprocessor 102 andmemory 104. connected to the processor. Thememory 104 stores instructions for theprocessor 102 for theprocessor 102 to modify the timing graph to include all the paths except the false paths. - The
memory 104 may be any kind of machine-readable storage medium containing the instructions for the processor to readinput information 106, modify the timing graph, and produce an output 108. For the present invention, theinput 106 may comprise the original timing graph, in which case, thememory 104 comprises instructions for theprocessor 102 to modify the timing graph and to produce, as the output 108, the modified timing graph. If theinput 106 is a circuit design, thememory 104 comprises instructions for theprocessor 102 to construct a timing graph, modify the timing graph, and determine the arrival times of the pins of the circuit to produce, as the output 108, the arrival times of the pins of the circuit. It is well known in the art that the memory may be formed as a semiconductor memory device, magnetic device, optical device, magneto-optical device, floppy diskette, hard drive, CD-ROM, magnetic tape, computer memory, or memory card. - Although the present invention has been described in detail with regarding the exemplary embodiments and drawings thereof, it should be apparent to those skilled in the art that various adaptations and modifications of the present invention may be accomplished without departing from the spirit and the scope of the invention. Accordingly, the invention is not limited to the precise embodiment shown in the drawings and described in detail hereinabove. Therefore, it is intended that all such variations not departing from the spirit of the invention be considered as within the scope thereof as limited solely by the claims appended hereto.
- In the following claims, those elements which do not include the words “means for” are intended not to be interpreted under 35 U.S.C.§112 ¶6.
Claims (20)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US08/964,997 US6292924B1 (en) | 1997-11-05 | 1997-11-05 | Modifying timing graph to avoid given set of paths |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US08/964,997 US6292924B1 (en) | 1997-11-05 | 1997-11-05 | Modifying timing graph to avoid given set of paths |
Publications (2)
Publication Number | Publication Date |
---|---|
US20010020289A1 true US20010020289A1 (en) | 2001-09-06 |
US6292924B1 US6292924B1 (en) | 2001-09-18 |
Family
ID=25509294
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US08/964,997 Expired - Lifetime US6292924B1 (en) | 1997-11-05 | 1997-11-05 | Modifying timing graph to avoid given set of paths |
Country Status (1)
Country | Link |
---|---|
US (1) | US6292924B1 (en) |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040132224A1 (en) * | 2000-11-22 | 2004-07-08 | Matsushita Electric Industrial Co., Ltd. | Delay distribution calculation method, circuit evaluation method and false path extraction method |
US20060190883A1 (en) * | 2005-02-10 | 2006-08-24 | Yee Ja | System and method for unfolding/replicating logic paths to facilitate propagation delay modeling |
US20080016480A1 (en) * | 2006-07-17 | 2008-01-17 | Gass Robert B | System and Method for Driving Values to DC Adjusted/Untimed Nets to Identify Timing Problems |
US7447620B2 (en) | 2006-02-23 | 2008-11-04 | International Business Machines Corporation | Modeling asynchronous behavior from primary inputs and latches |
US20090138837A1 (en) * | 2007-11-27 | 2009-05-28 | Baumgartner Jason R | System and Method for Sequential Equivalence Checking for Asynchronous Verification |
US20100115482A1 (en) * | 2008-11-05 | 2010-05-06 | Dilullo Jack | Method for Specifying and Validating Untimed Nets |
WO2022251227A1 (en) * | 2021-05-25 | 2022-12-01 | Synopsys, Inc. | Non-functional loopback-paths removal from io-pads using logic replication |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6795951B2 (en) * | 2001-02-09 | 2004-09-21 | International Business Machines Corporation | Method and system for fault-tolerant static timing analysis |
US10275561B2 (en) * | 2016-05-27 | 2019-04-30 | Taiwan Semiconductor Manufacturing Company Limited | Method for eliminating false paths of a circuit unit to be implemented using a system |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5448497A (en) * | 1992-09-08 | 1995-09-05 | Nec Research Institute, Inc. | Exploiting multi-cycle false paths in the performance optimization of sequential circuits |
US5457638A (en) * | 1993-02-23 | 1995-10-10 | Nec Research Institue, Inc. | Timing analysis of VLSI circuits |
US5508937A (en) * | 1993-04-16 | 1996-04-16 | International Business Machines Corporation | Incremental timing analysis |
JPH06309296A (en) * | 1993-04-19 | 1994-11-04 | Fujitsu Ltd | Network analyzing method |
-
1997
- 1997-11-05 US US08/964,997 patent/US6292924B1/en not_active Expired - Lifetime
Cited By (17)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040132224A1 (en) * | 2000-11-22 | 2004-07-08 | Matsushita Electric Industrial Co., Ltd. | Delay distribution calculation method, circuit evaluation method and false path extraction method |
US7131082B2 (en) * | 2000-11-22 | 2006-10-31 | Matsushita Electric Industrial Co., Ltd. | Delay distribution calculation method, circuit evaluation method and false path extraction method |
US20070033554A1 (en) * | 2000-11-22 | 2007-02-08 | Matsushita Electric Industrial Co., Ltd. | Delay distribution calculation method, circuit evaluation method and false path extraction method |
US20060190883A1 (en) * | 2005-02-10 | 2006-08-24 | Yee Ja | System and method for unfolding/replicating logic paths to facilitate propagation delay modeling |
US7302659B2 (en) * | 2005-02-10 | 2007-11-27 | International Business Machines Corporation | System and method for unfolding/replicating logic paths to facilitate propagation delay modeling |
US7885801B2 (en) | 2006-02-23 | 2011-02-08 | International Business Machines Corporation | Modeling asynchronous behavior from primary inputs and latches |
US7447620B2 (en) | 2006-02-23 | 2008-11-04 | International Business Machines Corporation | Modeling asynchronous behavior from primary inputs and latches |
US20080295052A1 (en) * | 2006-02-23 | 2008-11-27 | Hidvegi Zoltan T | Modeling asynchronous behavior from primary inputs and latches |
US7490305B2 (en) | 2006-07-17 | 2009-02-10 | International Business Machines Corporation | Method for driving values to DC adjusted/untimed nets to identify timing problems |
US20090132983A1 (en) * | 2006-07-17 | 2009-05-21 | International Business Machines Corporation | Driving Values to DC Adjusted/Untimed Nets to Identify Timing Problems |
US20080016480A1 (en) * | 2006-07-17 | 2008-01-17 | Gass Robert B | System and Method for Driving Values to DC Adjusted/Untimed Nets to Identify Timing Problems |
US7886244B2 (en) | 2006-07-17 | 2011-02-08 | International Business Machines Corporation | Driving values to DC adjusted/untimed nets to identify timing problems |
US20090138837A1 (en) * | 2007-11-27 | 2009-05-28 | Baumgartner Jason R | System and Method for Sequential Equivalence Checking for Asynchronous Verification |
US7882473B2 (en) | 2007-11-27 | 2011-02-01 | International Business Machines Corporation | Sequential equivalence checking for asynchronous verification |
US20100115482A1 (en) * | 2008-11-05 | 2010-05-06 | Dilullo Jack | Method for Specifying and Validating Untimed Nets |
US8122410B2 (en) | 2008-11-05 | 2012-02-21 | International Business Machines Corporation | Specifying and validating untimed nets |
WO2022251227A1 (en) * | 2021-05-25 | 2022-12-01 | Synopsys, Inc. | Non-functional loopback-paths removal from io-pads using logic replication |
Also Published As
Publication number | Publication date |
---|---|
US6292924B1 (en) | 2001-09-18 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7020855B2 (en) | Digital circuit layout techniques using identification of input equivalence | |
US6286126B1 (en) | Methods, apparatus and computer program products for performing post-layout verification of microelectronic circuits using best and worst case delay models for nets therein | |
US7086023B2 (en) | System and method for probabilistic criticality prediction of digital circuits | |
US8010921B2 (en) | System and method for statistical timing analysis of digital circuits | |
US7111260B2 (en) | System and method for incremental statistical timing analysis of digital circuits | |
US6698006B1 (en) | Method for balanced-delay clock tree insertion | |
US8875082B1 (en) | System and method for detecting and prescribing physical corrections for timing violations in pruned timing data for electronic circuit design defined by physical implementation data | |
US6477688B1 (en) | Logic equivalence leveraged placement and routing of an IC design | |
US6457159B1 (en) | Functional timing analysis for characterization of virtual component blocks | |
US5553000A (en) | Eliminating retiming bottlenecks to improve performance of synchronous sequential VLSI circuits | |
US6654938B2 (en) | Delay characteristic analyzing method and delay characteristic analyzing system for a custom LSI | |
US6360352B2 (en) | Digital circuit layout techniques | |
US10990733B1 (en) | Shared timing graph propagation for multi-mode multi-corner static timing analysis | |
Cherry | Pearl: A CMOS timing analyzer | |
Kayssi et al. | The impact of signal transition time on path delay computation | |
US6907590B1 (en) | Integrated circuit design system and method for reducing and avoiding crosstalk | |
US6292924B1 (en) | Modifying timing graph to avoid given set of paths | |
Kitahara et al. | A clock-gating method for low-power LSI design | |
US6000038A (en) | Parallel processing of Integrated circuit pin arrival times | |
US7191417B1 (en) | Method and apparatus for optimization of digital integrated circuits using detection of bottlenecks | |
JP3272915B2 (en) | Static timing analyzer | |
KR19980079812A (en) | How to optimize the circuit structure included in the circuit layout | |
Sivaraman et al. | Primitive path delay faults: identification and their use in timing analysis | |
Meyer et al. | Active timing multilevel fault-simulation with switch-level accuracy | |
US6109201A (en) | Resynthesis method for significant delay reduction |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: LSI LOGIC CORPORATION, CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:SCEPANOVIC, RANKO;ANDREEV, ALEXANDER E.;PAVISIC, IVAN;REEL/FRAME:008816/0540 Effective date: 19971104 |
|
AS | Assignment |
Owner name: LSI LOGIC CORPORATION, CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BOLOTOV, ANATOLI;REEL/FRAME:009139/0101 Effective date: 19980325 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
FEPP | Fee payment procedure |
Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
FPAY | Fee payment |
Year of fee payment: 8 |
|
FPAY | Fee payment |
Year of fee payment: 12 |
|
AS | Assignment |
Owner name: DEUTSCHE BANK AG NEW YORK BRANCH, AS COLLATERAL AG Free format text: PATENT SECURITY AGREEMENT;ASSIGNORS:LSI CORPORATION;AGERE SYSTEMS LLC;REEL/FRAME:032856/0031 Effective date: 20140506 |
|
AS | Assignment |
Owner name: LSI CORPORATION, CALIFORNIA Free format text: CHANGE OF NAME;ASSIGNOR:LSI LOGIC CORPORATION;REEL/FRAME:033102/0270 Effective date: 20070406 |
|
AS | Assignment |
Owner name: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:LSI CORPORATION;REEL/FRAME:035390/0388 Effective date: 20140814 |
|
AS | Assignment |
Owner name: LSI CORPORATION, CALIFORNIA Free format text: TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENT RIGHTS (RELEASES RF 032856-0031);ASSIGNOR:DEUTSCHE BANK AG NEW YORK BRANCH, AS COLLATERAL AGENT;REEL/FRAME:037684/0039 Effective date: 20160201 Owner name: AGERE SYSTEMS LLC, PENNSYLVANIA Free format text: TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENT RIGHTS (RELEASES RF 032856-0031);ASSIGNOR:DEUTSCHE BANK AG NEW YORK BRANCH, AS COLLATERAL AGENT;REEL/FRAME:037684/0039 Effective date: 20160201 |
|
AS | Assignment |
Owner name: BANK OF AMERICA, N.A., AS COLLATERAL AGENT, NORTH CAROLINA Free format text: PATENT SECURITY AGREEMENT;ASSIGNOR:AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD.;REEL/FRAME:037808/0001 Effective date: 20160201 Owner name: BANK OF AMERICA, N.A., AS COLLATERAL AGENT, NORTH Free format text: PATENT SECURITY AGREEMENT;ASSIGNOR:AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD.;REEL/FRAME:037808/0001 Effective date: 20160201 |
|
AS | Assignment |
Owner name: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD., SINGAPORE Free format text: TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENTS;ASSIGNOR:BANK OF AMERICA, N.A., AS COLLATERAL AGENT;REEL/FRAME:041710/0001 Effective date: 20170119 Owner name: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD Free format text: TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENTS;ASSIGNOR:BANK OF AMERICA, N.A., AS COLLATERAL AGENT;REEL/FRAME:041710/0001 Effective date: 20170119 |
|
AS | Assignment |
Owner name: BELL SEMICONDUCTOR, LLC, ILLINOIS Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD.;BROADCOM CORPORATION;REEL/FRAME:044887/0109 Effective date: 20171208 |
|
AS | Assignment |
Owner name: CORTLAND CAPITAL MARKET SERVICES LLC, AS COLLATERA Free format text: SECURITY INTEREST;ASSIGNORS:HILCO PATENT ACQUISITION 56, LLC;BELL SEMICONDUCTOR, LLC;BELL NORTHERN RESEARCH, LLC;REEL/FRAME:045216/0020 Effective date: 20180124 |
|
AS | Assignment |
Owner name: BELL NORTHERN RESEARCH, LLC, ILLINOIS Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:CORTLAND CAPITAL MARKET SERVICES LLC;REEL/FRAME:059720/0223 Effective date: 20220401 Owner name: BELL SEMICONDUCTOR, LLC, ILLINOIS Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:CORTLAND CAPITAL MARKET SERVICES LLC;REEL/FRAME:059720/0223 Effective date: 20220401 Owner name: HILCO PATENT ACQUISITION 56, LLC, ILLINOIS Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:CORTLAND CAPITAL MARKET SERVICES LLC;REEL/FRAME:059720/0223 Effective date: 20220401 |