Apparatus and method for handling of multi-level circuit design data
Claim Score by NHIP
Abstract
A system and method for implementation of look-ahead design methodology. Efficient debugging of a design is accomplished by evaluating the high level register transfer level (RTL) representation of a device being designed by quickly simulating the downstream implementation of that device to expose potential implementation problems that would otherwise be found much later in the design or manufacturing cycle.

Term
Term ended
Projected expiry passed 17 October 2023, 2.9 years ago.
- Priority and filed
- Published
- Projected expiry
- Today
149 claims: 6 independent, 143 dependent
- 1A system for look-ahead design analysis, the system comprising:a constraint database;means for design analysis comprising hierarchical design analysis means, structural design analysis means and flat gate netlist design analysis means;and means for detecting hierarchical design violations based on information from said constraint database and results from said hierarchical design analysis means, structural design analysis means and flat gate netlist design analysis means.
- 35A method for look-ahead design analysis, the method comprising:collecting constraint data in a constraint database;performing at least hierarchical design analysis and structural design analysis;detecting design violations based on information from said constraint database and results of said hierarchical design analysis and structural design analysis.
- 68A computer software product for the purpose of look-ahead design analysis, the computer program product comprising:software instructions for enabling said computer software product to perform predetermined operations for look-ahead design analysis, and a computer readable medium bearing the software instructions, said predetermined operations comprising: collecting constraint data in a constraint database;performing hierarchical design analysis and structural design analysis;and detecting design violations based on information from said constraint database and results of said hierarchical design analysis and said structural design analysis.
- 95A chip development system comprising:a look-ahead design analysis sub-system;means for inputting design constraints;means for inputting a design high-level definition;and means for providing feedback of design violations.
- 124A look-ahead design analysis mechanism comprising:a constraint database;a design analysis mechanism operably configured to a perform hierarchical design analysis, structural design analysis and flat gate netlist design analysis;and a detection mechanism operably configured to detect design violations based on information from said constraint database and results of said analysis by said design analysis mechanism.
- 125Broadest claimClaim Score 95, very broad(NHIP)The look-ahead design analysis mechanism claim of 124, wherein said constraint database comprises at least one constraint rule.
Independent claims6
47 paragraphs in 4 sections, as filed
BACKGROUND OF THE PRESENT INVENTION
[0001] 1. Technical Field of the Present Invention
[0002] The present invention generally relates to the design automation of complex circuits to be integrated on a single semiconductor device. More specifically, the invention relates to the specific stages of semiconductor chip design tools and methodologies.
[0003] 2. Description of the Related Art
[0004] There will now be provided a discussion of various topics to provide a proper foundation for understanding the present invention.
[0005] In recent years, the ability to design complex semiconductor devices has increased and it is quite common to observe designs with millions of gates all reduced to a single integrated circuit. Today's complex designs are combinations of acquired intellectual property (IP) in the form of logic design libraries such as logic gates, flip-flops, memories, etc., as well as more complex building blocks such as micro-controllers, digital signal processors (DSP), phase-locked loops and many others. Designers combine these design libraries with their self-conceived innovations and ideas, as well as with portions of designs that may have been previously used, to form new and more sophisticated solutions.
[0006] Referring to FIG. 1, the process of the design of a semiconductor device is illustrated, where the various stages of a design are shown. Commonly, a design is described in a hardware definition language (HDL), such as register transfer level (RTL). This enables the capturing of the design concepts in a manner that allows certain automated tools to handle the process of turning the design concepts into a transistor level solution required for the actual manufacturing of a semiconductor device.
[0007] An HDL representation <b>110</b> of a chip is prepared, at least partially based on the design representation <b>120</b> supplied for the purpose of designing the chip. It should be noted that the design representation <b>120</b> has certain constraints <b>170</b>A. Constraints <b>170</b>A define the ways that the design representation <b>120</b> may be used and such constraints ought to be at least partially taken into consideration as early as the HDL <b>110</b> stage of the design. Upon completion, or at least partial completion of the design, the verification stage <b>130</b> may begin. However, such verification must take into consideration various constrains <b>170</b>B, which may be constraints imposed by the designer, the combinational use of the design representation <b>120</b> with the newly added designs, and other factors. If errors are detected, the HDL <b>110</b> must be corrected based on the errors found in this stage. Next, the synthesis stage <b>140</b> takes place, where the general logic design is further detailed in the transistor level. Additional constraints <b>170</b>C are added at this stage, and may be constraints relative to the drive capability of transistors, speed requirements and similar parameters. If errors are detected, the HDL <b>110</b> must be corrected based on the errors found at this stage. These steps are similarly repeated at test stage <b>150</b> and the manufacture stage <b>160</b>, adding constraints <b>170</b>D and <b>170</b>E that must be taken into consideration to ensure a successful and operative chip. At each such stage, upon detection of an error, the HDL <b>110</b> must be corrected and the process repeated. The compliance with the process is important as is the manufacturing costs of sophisticated devices which, when using deep sub-micron design rules, is extremely high. Moreover, additional design and manufacturing cycles are not only expensive but contribute to delays in introduction of products into the marketplace. It should be further noted that such complex devices are customarily designed by large groups of engineers of different backgrounds and geographical locations, further enhancing the design's vulnerability to errors.
[0008] It would be therefore advantageous to develop a system and a method that allows for easy collaboration between large groups of designers using multiple sources of design representation and design types. It would be further advantageous if there would be easy referencing between each stage of the design for quick identification and corrections of design errors.
SUMMARY OF THE PRESENT INVENTION
[0009] The present invention has been made in view of the above circumstances and to overcome the above problems and limitations of the prior art.
[0010] A system, method and programmed product is provided for the purpose of a look-ahead design methodology. The system includes a constraint database, a means for design analysis and a means for detecting design violations based on information from the constraint database and results of the design analysis. Specifically, the design analysis includes means for hierarchical design analysis, structural design analysis and flat gate netlist analysis.
[0011] A chip development system is also provided wherein a sub-system is capable of look-ahead design analysis, the subsystem having an design constraint input means, a design high-level definition input means and a means for providing feedback of design violations.
[0012] Additional aspects and advantages of the present invention will be set forth in part in the description that follows and in part will be obvious from the description, or may be learned by practice of the present invention. The aspects and advantages of the present invention may be realized and attained by means of the instrumentalities and combinations particularly pointed out in the appended claims.
[0013] A first aspect of the present invention provides a system for look-ahead design analysis. The system for look-ahead design analysis comprises a constraint database. The system further comprises means for design analysis comprising hierarchical design analysis means, structural design analysis means and flat gate netlist design analysis means. The system for look-ahead analysis further comprises means for detecting hierarchical design violations based on information from the constraint database. The means for detecting hierarchical design violations also uses results from the hierarchical design analysis means, structural design analysis means and flat gate netlist design analysis means.
[0014] A second aspect of the invention provides a method for look-ahead design analysis. The method for look-ahead design analysis comprises first collecting constraint data in a constraint database. Next, the method performs at least a hierarchical design analysis and a structural design analysis. Following the design analyses, the method detects design violations based on information from the constraint database, as well as the results from the hierarchical design analysis and structural design analysis.
[0015] A third aspect of the invention provides a computer software product for the purpose of look-ahead design analysis. The computer program product comprises software instructions that enable the computer software product to perform predetermined operations for look-ahead design analysis, and a computer readable medium bearing the software instructions. The predetermined operations comprise first collecting constraint data in a constraint database. The predetermined operations further comprise performing a hierarchical design analysis and a structural design analysis. Following the design analyses, the predetermined operations next detect design violations based on information from the constraint database and based on the results from the hierarchical design analysis and the structural design analysis.
[0016] A fourth aspect of the present invention provides a chip development system that comprises a look-ahead design analysis sub-system. The chip development system further comprises means for inputting design constraints, and means for inputting a design high-level definition. In addition, the chip development system further comprises means for providing feedback of design violations.
[0017] A fifth aspect of the present invention provides a look-ahead design analysis mechanism that comprises a constraint database, and a design analysis mechanism operably configured to perform hierarchical design analysis, structural design analysis and flat gate netlist design analysis. The design analysis mechanism further provides a detection mechanism operably configured to detect design violations based on information from the constraint database and based on the results from the hierarchical design analysis, the structural design analysis and the flat gate netlist design analysis.
[0018] The above aspects and advantages of the present invention will become apparent from the following detailed description and with reference to the accompanying drawing figures.
BRIEF DESCRIPTION OF THE DRAWINGS
[0019] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate the present invention and, together with the written description, serve to explain the aspects, advantages and principles of the present invention. In the drawings,
[0020]FIG. 1 is a diagram of a conventional design methodology flow;
[0021]FIG. 2 is an exemplary schematic block diagram of an embodiment of the invention;
[0022]FIG. 3 is an exemplary schematic block diagram of a look-ahead architecture;
[0023]FIG. 4 is a schematic diagram of the design process used in an embodiment of the invention;
[0024]FIG. 5 is an exemplary schematic block diagram of an extended look-ahead architecture; and
[0025]FIG. 6 is an example of an RTL input to an embodiment of the invention;
[0026]FIG. 7 is a block diagram of the example circuit described in FIG. 6;
[0027]FIG. 8 is an exemplary output report from the logic hierarchy analysis for the example circuit described in FIG. 6;
[0028]FIG. 9 is an exemplary output report from the flat gate netlist analysis for the example circuit described in FIG. 6; and
[0029]FIG. 10 is an exemplary report generated as a result of an error detected in the example circuit described in FIG. 6.
DETAILED DESCRIPTION OF THE INVENTION
[0030] Prior to describing the aspects of the present invention, some details concerning the prior art will be provided to facilitate the reader's understanding of the present invention and to set forth the meaning of various terms.
[0031] As used herein, the term “computer system” encompasses the widest possible meaning and includes, but is not limited to, standalone processors, networked processors, mainframe processors, and processors in a client/server relationship. The term “computer system” is to be understood to include at least a memory and a processor. In general, the memory will store, at one time or another, at least portions of executable program code, and the processor will execute one or more of the instructions included in that executable program code.
[0032] As used herein, the terms “predetermined operations,” the term “computer system software” and the term “executable code” mean substantially the same thing for the purposes of this description. It is not necessary to the practice of this invention that the memory and the processor be physically located in the same place. That is to say, it is foreseen that the processor and the memory might be in different physical pieces of equipment or even in geographically distinct locations.
[0033] As used herein, the terms “media,” “medium” or “computer-readable media” include, but is not limited to, a diskette, a tape, a compact disc, an integrated circuit, a cartridge, a remote transmission via a communications circuit, or any other similar medium useable by computers. For example, to distribute computer system software, the supplier might provide a diskette or might transmit the instructions for performing predetermined operations in some form via satellite transmission, via a direct telephone link, or via the Internet.
[0034] Although computer system software might be “written on” a diskette, “stored in” an integrated circuit, or “carried over” a communications circuit, it will be appreciated that, for the purposes of this discussion, the computer usable medium will be referred to as “bearing” the instructions for performing predetermined operations. Thus, the term “bearing” is intended to encompass the above and all equivalent ways in which instructions for performing predetermined operations are associated with a computer usable medium.
[0035] Therefore, for the sake of simplicity, the term “program product” is hereafter used to refer to a computer-readable medium, as defined above, which bears instructions for performing predetermined operations in any form.
[0036] A detailed description of the aspects of the present invention will now be given referring to the accompanying drawings.
[0037] Referring to FIG. 2, an architecture <b>200</b> for design control capable of ensuring clean HDL designs is presented. The HDL <b>210</b> maybe represented by register transfer level (RTL) in terms of VHSIC HDL (VHDL) or Verilog. The HDL <b>210</b> is connected to a constraint engine <b>280</b> that in turn receives multiple constraints applicable to the various stages of the design process. These may include, but are not limited to, constraints relative to the design representation <b>220</b>, the verification stage <b>230</b>, the synthesis stage <b>240</b>, the test stage <b>250</b> and the manufacture stage <b>260</b>. All of the constraints <b>270</b> are fed to the constraint engine, as well as the HDL <b>210</b>, and the impact of the constraints is evaluated. Feedback on problems may be provided at each of the design levels, as well as feedback directed at the HDL <b>210</b> level. This significantly reduces the need to track low level errors at a late stage of the design and the way it relates to the HDL <b>210</b>. It should be noted that the constraints may apply to all portions of the design, or only to certain portions thereof. For example, a purchased design representation <b>220</b> may have constraints that are valid only to such design representation <b>220</b> and not to any other component used in the stages of the design. For example, input/output (I/O) circuits usually have constraints that are significantly different from other constraints imposed on other portions of the design.
[0038] Referring to FIG. 3, a look-ahead architecture for an implementation of the constraint engine <b>280</b> is described in more detail. The look-ahead architecture described enables the low-level analysis to occur at an early stage providing immediate feedback from a lower-level stage of the design to a higher-level stage of the design. A constraint database <b>320</b> contains the various constraints relative to the specific design. It may contain rules relative to the use of the specific HDL used for the description, as well as other rules and constraints specific to the design, application and technology used. The logic hierarchy analyzer (LHA) <b>340</b> analyses such rules, referred to as style rules, and applies them to cases such as signals, sensitivities and comments. The structure hierarchy analyzer (SHA) <b>350</b> analyses such rules, referred to as inference rules, and applies them to cases such as inferred latches, flip-flops and counters. The flat gate netlist analyzer (FGNA) <b>360</b> analyses such rules, referred to as connectivity rules, and apples them to cases such as connectivity, cone analysis and design for testability (DFT). The constraint database <b>320</b> interfaces with the various analysis stages through specific application interfaces (API) <b>330</b>, each customized to provide the necessary interface for the specific stage at hand.
[0039] The HDL <b>210</b> design is provided to LHA <b>340</b>, where the analysis described above is performed. When violations are detected at LHA <b>340</b> level, the violations <b>370</b> are directly reported to HDL report database <b>390</b>. The violations <b>370</b> detected at SHA <b>350</b> level are first back-referenced <b>380</b> to LHA <b>340</b> for the purpose of identification of the violation in the logical representation. The error is then reported to the HDL report database <b>390</b>. The violations <b>370</b> detected at FGNA <b>360</b> are first back-referenced <b>380</b> to the back-reference stage of SHA <b>350</b>, and then back-referenced to LHA <b>340</b> stage. This allows for the identification of the error also in the higher levels, namely the structure and the logic levels, allowing for an easier correction of the error detected, directly at the HDL level. The error is then reported to HDL report database <b>390</b>.
[0040] Referring to FIG. 4, the process is schematically described. The process begins with a HDL <b>410</b> that goes through a synthesis process <b>420</b>. The result of the synthesis is a gate level design <b>430</b>. The gate level design is then analyzed <b>440</b> and if errors are found, design changes take place <b>450</b>. This process may be a repetitive process until such time where the design is error free. The advantage of the proposed system and method is in the fact that all the user intervention is done at the highest level possible for design fixing, thereby ensuring that the time and cost required to implement those fixes are minimized.
[0041] Referring to FIG. 5, an extension of architecture <b>300</b> is shown. Two additional stages are added to the system for the purpose of ensuring post manufacturing constraint compliance, otherwise known as design for testability (DFT). In these two stages, the capability of testing and scanning the chip are checked <b>510</b>, as well as the ability to control, observe and initialize the chip <b>520</b>. Violations are reported through a back-reference mechanism such that the error is represented at each stage of the design all the way back to the highest description level possible. This again allows for the correction of the problem at the highest design level possible.
[0042] The following description is an exemplary implementation and use of the disclosed invention. Referring to FIG. 6, exemplary code in RTL is provided. In line 0605, the top module description begins and its description ends at line 0630. The module has two inputs, “clk” and “reset”, defined in line 0610, as well as an output “out” defined in line 0615. The “cnt” is a two-bit signal and therefore a two-wire bus is defined in line 0620. The connection of the counter is defined in line 0625. The counter definition is as follows: counter (3, clk, reset, c|reset, cnt, out, c)
[0043] Referring to FIG. 7, the resultant logic description of circuit <b>700</b> is shown. Specifically, the pins of counter <b>710</b> are as follows: limit, clk, Reset, Cin, cnt, Pulse, and Cout, corresponding to 3, clk, reset, c|reset, cnt, out, c respectively of “counter” above. The notation “3” is used to define a two-bit connection with each bit connected to “power”. “clk” is used to denote a clock. “reset” is a signal used for the resetting of a device, specifically, setting its output to “0”. In the case of this counter, the output “cnt” will have the value “0” after reset, i.e., both wires of “cnt” will have the logical value “0”. The notation “c|reset” means that the input Cin of counter <b>710</b> will receive the value of reset logically “OR”ed with the value of “c”. It can be easily seen that the value of “c” is provided from Cout of counter <b>710</b>. This connection has created a feedback loop from Cout through OR gate <b>720</b> and back to counter <b>710</b>. However, this feedback loop may not be easily observed at this level of description because a part of the connection can only be inferred in a lower level of the hierarchy. Lines 0635 through 0685 further describe the behavior of counter <b>710</b>.
[0044] Referring to FIG. 8, the output from logic hierarchy <b>340</b> is shown. As a result of the feedback loop explained above, an inferred latch device is actually created as can be seen in line 0844. This latch is not one intended in the original design and is a result of a design error. Referring to FIG. 9, the result of flat gate netlist <b>360</b> is shown. The combinational loop becomes apparent by tracing paths from all nets through combinational elements and searching for paths that loop back on themselves. This allows for the detection of such feedback loops even though such loops may cross hierarchy boundaries. While hierarchy-based methods frequently report false feedback where no feedback exists, this test method is unambiguous, i.e., not subject to false reporting of errors.
[0045] Referring to FIG. 10, an output report is provided making notification of the error detected. The report is provided in HDL report <b>390</b>. Specifically, line 1210 signals that there is a latch inferred for the signal “pulse”. Next, in line 1220 the specific error is detected as a combinational loop and indicating the specific place, by source (input) file and line-number in that file where such error has occurred. By providing the high level pinpoint notification of the error, the designer is assured of early and easy detection of design failure which would have been otherwise detected at a much later stage of the design phase.
[0046] The foregoing description of the aspects of the present invention has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit the present invention to the precise form disclosed, and modifications and variations are possible in light of the above teachings or may be acquired from practice of the present invention. The principles of the present invention and its practical application were described in order to enable one skilled in the art to utilize the present invention in various embodiments and with various modifications as are suited to the particular use contemplated.
[0047] Thus, while only certain aspects of the present invention have been specifically described herein, it will be apparent that numerous modifications may be made thereto without departing from the spirit and scope of the present invention. Further, acronyms are used merely to enhance the readability of the specification and claims. It should be noted that these acronyms are not intended to lessen the generality of the terms used and they should not be construed to restrict the scope of the claims to the embodiments described therein.
Contents4
10 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| WO2012118859A1 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| US7194400B2 | Cited by | United States of America | Applicant |
| US8707229B1 | Cited by | United States of America | Search report |
| US2003191869A1 | Cited by | United States of America | Pre-grant |
| US8631364B1 | Cited by | United States of America | Applicant |
| US10635766B2 | Cited by | United States of America | Applicant |
| US8661383B1 | Cited by | United States of America | Applicant |
| US8479128B2 | Cited by | United States of America | Applicant |
| US7203633B2 | Cited by | United States of America | Search report |
| US2003191621A1 | Cited by | United States of America | Pre-grant |
| CN103548026A | Cited by | China | Search report |
| US7373290B2 | Cited by | United States of America | Applicant |
| US7206732B2 | Cited by | United States of America | Search report |
| US2003115562A1 | Cites | United States of America | Pre-grant |
| US4937755A | Cites | United States of America | Pre-grant |
| US5050091A | Cites | United States of America | Pre-grant |
| US5067091A | Cites | United States of America | Pre-grant |
| US5197016A | Cites | United States of America | Pre-grant |
| US5222030A | Cites | United States of America | Pre-grant |
| US5487018A | Cites | United States of America | Pre-grant |
| US5537329A | Cites | United States of America | Pre-grant |
| US5541849A | Cites | United States of America | Pre-grant |
| US5555201A | Cites | United States of America | Pre-grant |
| US5757653A | Cites | United States of America | Pre-grant |
| US5781446A | Cites | United States of America | Pre-grant |
| US5812775A | Cites | United States of America | Pre-grant |
| US5848059A | Cites | United States of America | Pre-grant |
| US5930830A | Cites | United States of America | Pre-grant |
| US5931918A | Cites | United States of America | Pre-grant |
| US5943481A | Cites | United States of America | Pre-grant |
| US5987240A | Cites | United States of America | Pre-grant |
| US5991299A | Cites | United States of America | Pre-grant |
| US6009251A | Cites | United States of America | Pre-grant |
| US6011911A | Cites | United States of America | Pre-grant |
| US6081883A | Cites | United States of America | Pre-grant |
| US6157901A | Cites | United States of America | Pre-grant |
| US6167480A | Cites | United States of America | Pre-grant |
| US6185607B1 | Cites | United States of America | Pre-grant |
| US6226680B1 | Cites | United States of America | Pre-grant |
| US6243359B1 | Cites | United States of America | Pre-grant |
| US6269467B1 | Cites | United States of America | Pre-grant |
| US6425113B1 | Cites | United States of America | Pre-grant |
| US6581191B1 | Cites | United States of America | Pre-grant |
| US6591402B1 | Cites | United States of America | Pre-grant |
| US6601221B1 | Cites | United States of America | Pre-grant |
| US6618839B1 | Cites | United States of America | Pre-grant |
| US6708323B2 | Cites | United States of America | Pre-grant |
4 members in 1 office
Priority claims2
| Document | Office | Kind | Date |
|---|---|---|---|
| 11824202 | United States of America | A | |
| US20020118242 | – | – | – |
Members4
| Document | Office | Kind | |
|---|---|---|---|
| US2003192023A1 | United States of America | A1 | |
| US6993733B2 | United States of America | B2 | |
| US2006048083A1 | United States of America | A1 | |
| US7421670B2 | United States of America | B2 |
37 transactions on the USPTO file
Allowed after 1 non-final rejection.
- Non-final rejections
- 1
- Final rejections
- 0
- RCEs
- 0
- Appeals
- 0
Over time
Point at a mark for the transactionTransactions
| Event | |
|---|---|
| Entity status set to undiscounted (initial default setting or status change) | |
| Recordation of Patent Grant Mailed | |
| Patent Issue Date Used in PTA CalculationAllowed | |
| Issue Notification MailedAllowed | |
| Dispatch to FDC | |
| Application Is Considered Ready for Issue | |
| Issue Fee Payment Verified | |
| Issue Fee Payment Received | |
| Mail Notice of AllowanceAllowed | |
| Mail Examiner's Amendment | |
| Notice of Allowance Data Verification CompletedAllowed | |
| Case Docketed to Examiner in GAU | |
| Examiner's Amendment Communication | |
| Date Forwarded to Examiner | |
| Response to Election / Restriction Filed | |
| Mail Restriction Requirement | |
| Restriction/Election Requirement | |
| Date Forwarded to Examiner | |
| Response after Non-Final Action | |
| Mail Non-Final RejectionNon-final rejection | |
| Non-Final RejectionNon-final rejection | |
| Miscellaneous Incoming Letter | |
| IFW TSS Processing by Tech Center Complete | |
| Receipt of all Acknowledgement Letters | |
| Case Docketed to Examiner in GAU | |
| Application Dispatched from OIPE | |
| Application Is Now Complete | |
| Additional Application Filing Fees | |
| A statement by one or more inventors satisfying the requirement under 35 USC 115, Oath of the Applic | |
| Notice Mailed--Application Incomplete--Filing Date Assigned | |
| Referred by L&R for Third-Level Security Review. Agency Referral Letter Generated | |
| IFW Scan & PACR Auto Security Review | |
| IFW Scan & PACR Auto Security Review | |
| Preliminary Amendment | |
| Information Disclosure Statement (IDS) Filed | |
| Information Disclosure Statement (IDS) Filed | |
| Initial Exam Team nn |
14 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Fee paymentFPAY | FPAY | |
| Fee payment procedurePAT HOLDER NO LONGER CLAIMS SMALL ENTITY STATUS, ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: STOL); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYFEPP | FEPP | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| Fee paymentFPAY | FPAY | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| Fee paymentFPAY | FPAY | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| Information on status: patent grantGrantedPATENTED CASESTCF | STCF | |
| AssignmentAS | AS |
Numbers
- Publication, DOCDB
- 2003192023
- Publication, EPODOC
- US2003192023
- Application
- 10118242
- Application, DOCDB
- 11824202
- Application, EPODOC
- US20020118242
Titles
- English
- Apparatus and method for handling of multi-level circuit design data
Classification
- CPC, 5
- G06F17/5045
- G06F30/30
- G06F30/3308
- G06F17/5022
- G06F30/33
- IPC, 1
- G06F17 50
- USPC, 1
- 716106000