Aggressor classification method for analyzing crosstalk of circuit

A method for classifying aggressors in a circuit, comprising the steps of:

• (a) arranging a victim and associated aggressors in a circuit in timing windows by plotting minimum and maximum starting points of signal transitions of the victim and associated aggressors;
• (b) grouping the aggressors into groups of aggressors using the minimum starting point of the signal transition of the aggressors as a reference;
• and
• (c) determining which group of aggressors is capable of causing the greatest crosstalk to the victim, and classifying each aggressor within the determined group as true aggressors.

A method for classifying aggressors for analyzing crosstalk of a circuit, comprising the steps of:

• performing a functional classification method comprising:
• (a) obtaining CNF (conjunction normal form) clauses of signal lines from a victim to a predetermined signal line and from an aggressor to a predetermined signal line for circuit analysis using a backward search, and obtaining CNF clauses of the victim and the aggressor, and summing up the CNF clauses of the victim and the aggressor to obtain a final CNF clause;
• (b) obtaining CNF clauses with respect to various cases in which logic values of the victims and aggressors are varied in the final CNF clause;
• and
• (c) analyzing the CNF clauses obtained in step (b) to classify aggressors as true or false aggressors, wherein an aggressor is classified as a true aggressor if a result of a given CNF clause has a vector, and classifying an aggressor as a false aggressor if a result of a given CNF clause has no vector;
• and
• performing a temporal classification method comprising:
• (d) arranging a victim and associated aggressors in a circuit in timing windows by plotting minimum and maximum starting points of signal transitions of the victim and associated aggressors;
• (e) grouping the aggressors into groups of aggressors using the minimum starting point of the signal transition of the aggressors as a reference;
• and
• (f) determining which group of aggressors is capable of causing the greatest crosstalk to the victim, and classifying each aggressor within the determined group as true aggressors.

A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform method steps for classifying aggressors for analyzing crosstalk of a circuit, the method steps comprising:

• (a) obtaining CNF (conjunction normal form) clauses of signal lines from a victim to a predetermined signal line and from an aggressor to a predetermined signal line for circuit analysis using a backward search, and obtaining CNF clauses of the victim and the aggressor, and summing up the CNF clauses of the victim and the aggressor to obtain a final CNF clause;
• (b) obtaining CNF clauses with respect to various cases in which logic values of the victims and aggressors are varied in the final CNF clause;
• and
• (c) analyzing the CNF clauses obtained in step (b) to classify aggressors as true or false aggressors, wherein an aggressor is classified as a true aggressor if a result of a given CNF clause has a vector, and classifying an aggressor as a false aggressor if a result of a given CNF clause has no vector.

A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform method steps for classifying aggressors in a circuit, the method steps comprising:

• (a) arranging a victim and associated aggressors in a circuit in timing windows by plotting minimum and maximum starting points of signal transitions of the victim and associated aggressors;
• (b) grouping the aggressors into groups of aggressors using the minimum starting point of the signal transition of the aggressors as a reference;
• and
• (c) determining which group of aggressors is capable of causing the greatest crosstalk to the victim, and classifying each aggressor within the determined group as true aggressors.