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:
Apr. 05, 2005
Filed:
Jul. 25, 2000
Gi-joon Nam, Ann Arbor, MI (US);
Sandor S. Kalman, Los Gatos, CA (US);
Jason H. Anderson, Campbell, CA (US);
Rajeev Jayaraman, San Jose, CA (US);
Sudip K. Nag, San Jose, CA (US);
Jennifer Zhuang, San Jose, CA (US);
Gi-Joon Nam, Ann Arbor, MI (US);
Sandor S. Kalman, Los Gatos, CA (US);
Jason H. Anderson, Campbell, CA (US);
Rajeev Jayaraman, San Jose, CA (US);
Sudip K. Nag, San Jose, CA (US);
Jennifer Zhuang, San Jose, CA (US);
Xilinx, Inc., San Jose, CA (US);
Abstract
A method and apparatus for determining routing feasibility of a plurality of nets. Each net has an associated set of one or more routing solutions, wherein each solution specifies one or more routing resources consumed by the net. A liveness Boolean function is generated having variables that represent respective net/solution pairs. If there exists a set of values for the variables such that at least one of the variables for each net is logically true, then the liveness function is true. An exclusivity function is generated using the variables that represent the net/solution pairs. If there exists at least one set of values for the variables such that no resource is used is by more than a predetermined number of nets, then the exclusivity function is true. The nets are routable using the provided solutions if there is one set of values for the variables such that both the liveness and exclusivity functions are true.