The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Sep. 12, 2006
Filed:
Aug. 18, 2003
Brian Eugene Lockyear, Portland, OR (US);
James Herbert Kukula, Hillsboro, OR (US);
Robert F. Damiano, Lake Oswego, OR (US);
Carl Preston Pixley, Beaverton, OR (US);
Brian Eugene Lockyear, Portland, OR (US);
James Herbert Kukula, Hillsboro, OR (US);
Robert F. Damiano, Lake Oswego, OR (US);
Carl Preston Pixley, Beaverton, OR (US);
Synopsys, Inc., Mountain View, CA (US);
Abstract
A decomposition technique, for solving combinational constraint expressions, is presented. Decomposing a set of constraints can increase the opportunities for dividing them into independent sets that do not need to be conjoined in a constraint-solving process using a BDD representation. An AND decomposition, relying on a Theorem 1, is presented. An OR decomposition, relying on a corollary of Theorem 1, is presented. Theorem 1 provides an operation to test for, and create, a pair of sub-constraints G and H which are independent in any two variables xand x. A decomposition procedure is presented for separating as many variables as possible, of an input constraint, into disjoint sub-constraints. A merging procedure is presented, that can be used if a decomposition does not only contain constraints whose support sets are disjoint from each other. The decomposition procedure can also be used to identify hold constraints.