US7665044B1 - Method and system for the condensed macro library creation - Google Patents

Method and system for the condensed macro library creation Download PDF

Info

Publication number
US7665044B1
US7665044B1 US11/098,026 US9802605A US7665044B1 US 7665044 B1 US7665044 B1 US 7665044B1 US 9802605 A US9802605 A US 9802605A US 7665044 B1 US7665044 B1 US 7665044B1
Authority
US
United States
Prior art keywords
cell
pins
files
pin
rules
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.)
Active, expires
Application number
US11/098,026
Inventor
Alexander F. Khomoutov
Brian J. Carlson
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Cadence Design Systems Inc
Original Assignee
Cadence Design Systems Inc
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Cadence Design Systems Inc filed Critical Cadence Design Systems Inc
Priority to US11/098,026 priority Critical patent/US7665044B1/en
Assigned to CADENCE DESIGN SYSTEMS, INC. reassignment CADENCE DESIGN SYSTEMS, INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: CARLSON, BRIAN J., KHOMOUTOV, ALEXANDER F.
Priority to US12/650,923 priority patent/US8516415B1/en
Application granted granted Critical
Publication of US7665044B1 publication Critical patent/US7665044B1/en
Active legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00Computer-aided design [CAD]
    • G06F30/30Circuit design
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2115/00Details relating to the type of the circuit
    • G06F2115/08Intellectual property [IP] blocks or IP cores

Definitions

  • the field of the invention relates generally to circuit package design, and more particularly to systems and methods for identifying relevant input and output sources on a circuit.
  • I/O Library cells and the general design data representations of I/O cells do not contain sufficient information for a designer to be able to determine how to interpret the function of the pins of individual I/O cells.
  • the pins of I/O cells can supply power to the cell, pass power supply voltages from outside the IC into the core of the IC, be embedded flip-chip solder bumps or wirebond bondpads, connect multiple redistribution layers routing to separate flip-chip bumps or wirebond pads, or connect to core cells of the IC to pass signals from outside the chip to the IC or from the IC to the system to which it is connected.
  • each pin can be used for one of the above purposes.
  • I/O cells there can be dozens or even hundreds of pins on one I/O cell, and each pin can be used for one of the above purposes.
  • Certain pins, such as those which supply power to the cell, or pins that connect to core cells are not important when planning I/O. Thus, they can usually be ignored.
  • Other pins, such as those that are embedded die pads or that connect to die pads, are significant to I/O planning.
  • an intelligent method and a system to pre-scan IC cell library files, analyze cell and pin data therein, and based on special heuristic algorithms using rules with some user defined parameters, automatically deduce I/O cell and pin information is described.
  • the method can read cell library data in Library Exchange Format (LEF) or any other formats, such as Open Access or any other known and/or convenient format.
  • LEF Library Exchange Format
  • CML Condensed Macro Library
  • the information deduced from the library and stored in the CML file is used to determine which cells and pins are important when importing I/Os from an IC design to IC packaging tools or other tools, and how to interpret the pins of those cells.
  • the system and method can also provide automated selection of I/O cells and I/O pins plus redistribution layer (RDL) routing connection point pins of those cells for an entire cell library.
  • RDL redistribution layer
  • FIG. 1 depicts a method for generating a CML file containing pin information.
  • FIG. 2 depicts a computerized system on which a method for generating a CML file containing information can be implemented.
  • FIG. 100 represents a diagram showing the steps of a method for the creation for a condensed macro library (CML).
  • CML condensed macro library
  • step 102 the system determines whether it can locate an existing condensed macro library file. If the system locates an existing CML file it will advance to step 104 where the located CML file will be read. In step 106 the located CML file will be pre-scanned. Then, in step 112 , the system will populate rule data based on the located CML file and a default set of rules.
  • the default set of rules can be manually entered into the system or be read from a file. Whether manually entered or read from a file, in some embodiments, the default set of rules can be modified by a user. In alternate embodiments, the default rules can be fixed. In some embodiments the rules can identify any known and/or convenient feature of components associated with the circuit package design and/or input and output sources on a circuit.
  • step 102 If the result in step 102 is that no CML file is located, then the system can proceed to step 108 where the system will attempt to locate an existing default condensed macro library file. If the system is unable to locate an existing default CML file, then the system can proceed to step 112 and populate rule data based on a default set of rules, as previously described.
  • the default CML file can be read in step 110 .
  • the default CML file can be pre-scanned and then the resulting data can be combined with default CML rules and populated into rule data in step 112 .
  • step 114 The resulting populated rule data from step 112 will be funneled to step 114 and a determination can be made regarding whether existing user defined rules exist. If at step 114 the system determines that existing user defined rules exist, then the user defined rules will be read in step 116 and a CML file will be generated in step 118 based on the populated rules from step 112 and the existing user defined rules. If the system determines that no predefined rules exist then the CML file will be generated in step 118 based on the populated rules from step 112 .
  • step 102 - 118 can be performed in any convenient sequence or can be eliminated and substituted with a set of predefined rules which can be user modifiable.
  • a cell is scanned to retrieve relevant pin data and cell class data.
  • the data retrieved in step 120 is used to determine whether the cell meets predefined class criteria.
  • the predefined class criteria can be manually entered or can be read from a file. Whether manually entered or read from a file, in some embodiments the predefined class criteria can be at least partially specified by a user. In alternate embodiments, the predefined class criteria can be fixed. In one embodiment, the predefined user criteria can include shape data, dimension data, composition data or any other known and/or convenient cell characteristic.
  • the cell can be parsed in step 124 and the shape of the pins of the defined redistribution layer (RDL) can be determined in step 126 .
  • RDL redistribution layer
  • step 130 a determination of the pins that are on the RDL is made to locate such pins meeting specific specified shape rules.
  • the specific shape rules can be geometric specification, electrical specification or any known and/or convenient shape specification.
  • the specific shape rules can be manually entered or read from a file. In some embodiments the specific shape rules can be modified by a user while in alternate embodiments the specific shape rules can be fixed.
  • step 132 pins having size that is less than a minimum specified input/output pad size are identified. Once this identification is made a write operation can be performed to write data to the CML created in step 118 .
  • the minimum specified input/output pad sizes can be manually entered or read from a file. In some embodiments the minimum specified input/output pad sizes can be modified by a user while in alternate embodiments the minimum specified input/output pad sizes can be fixed.
  • step 136 If a determination is made that the cell is on the top or die pin layer, then the system can determine the number of pins meeting input/output pad size rules in step 136 . In step 138 , those pins meeting special user exception rules can be identified. Both input/output pad size rules and special user exception rules can be manually entered or read from a file. In one embodiment, both input/output pad size rules and special user exception rules can be modified by a user. In alternate embodiments, input/output pad size rules can be fixed.
  • step 140 a determination can be made if any pins are comprised of multiple intersecting rectangular shapes. If the determination is made that none of the pins are comprised of multiple intersecting rectangular shapes the system can proceed to step 134 where data will be written to the CML file created in step 118 . If in step 140 , a determination is made that some pins are comprised of multiple intersecting rectangular shape then a second determination will be made in step 142 as to when the rectangular shapes are disjointed. If the rectangular shapes are determined not to be disjointed the system will proceed to step 144 .
  • step 144 the rectangular shapes will be merged into a single polygonal shape and the data related to the single polygonal shape can then, in step 134 , be written to the CML file generated in step 118 .
  • step 142 the rectangular shapes are determined to be disjointed then in step 146 the system can determine the smallest convex hull enclosing the disjointed rectangular shapes.
  • the smallest convex hull enclosing the disjointed rectangular shapes can be determined using any known or convenient determination method.
  • the data related to the smallest convex hull can be used to write to update the CML file, created in step 118 , in step 134 .
  • step 134 the system can proceed to step 158 .
  • step 158 the system determines whether more cells are present. If the system determines more cells are present, it can return to step 156 and proceed to the next cell. If the system determines that there are no more cells present, it can proceed to step 160 where the CML file will be closed.
  • the cell may be a special exception cell.
  • a determination is made is to whether the cell is a special exception cell. The determination as to whether a cell is a special exception cell can be performed by comparing the cell information contained in an exception cell file or by manual identification of the cell as a special exception cell.
  • the exception cell file can be a user created or modifiable file or can be a fixed file.
  • special exception cells can be identified specifically, can be identified based on the contents of a cell or based on any other known and/or convenient factors.
  • step 150 the system can determine whether all input/output pads of the cell meet the special rules. If all input/output pads meet the special rules, then in step 152 the system can determine all the connection point pins meeting the special rules. Based on the information from steps 150 and 152 , CML data can be written to CML file created in step 118 .
  • step 148 If the cell is determined not to be a special exception cell then the system can proceed to step 154 where a determination is made as to whether there are more cells present. If there are more cells present then it will proceed to step 156 . In step 156 , the system can increment to the next cell identified for processing and the system can then proceed to step 120 and the entire process from steps 120 - 158 can be repeated, as appropriate. If there are no more cells present then the system can perform an end operation to close the CML file, step 160 .
  • the execution of the sequences of instructions required to practice the embodiments may be performed by a computer system 200 as shown in FIG. 2 .
  • execution of the sequences of instructions is performed by a single computer system 200 .
  • two or more computer systems 200 coupled by a communication link 215 may perform the sequence of instructions in coordination with one another.
  • a description of only one computer system 200 will be presented below, however, it should be understood that any number of computer systems 200 may be employed to practice the embodiments.
  • FIG. 2 is a block diagram of the functional components of a computer system 200 .
  • the term computer system 200 is broadly used to describe any computing device that can store and independently run one or more programs.
  • Each computer system 200 may include a communication interface 214 coupled to the bus 206 .
  • the communication interface 214 provides two-way communication between computer systems 200 .
  • the communication interface 214 of a respective computer system 200 transmits and receives electrical, electromagnetic or optical signals, that include data streams representing various types of signal information, e.g., instructions, messages and data.
  • a communication link 215 links one computer system 200 with another computer system 200 .
  • the communication link 215 may be a LAN, in which case the communication interface 214 may be a LAN card, or the communication link 215 may be a PSTN, in which case the communication interface 214 may be an integrated services digital network (ISDN) card or a modem, or the communication link 215 may be the Internet, in which case the communication interface 214 may be a dial-up, cable or wireless modem.
  • ISDN integrated services digital network
  • a computer system 200 may transmit and receive messages, data, and instructions, including program, i.e., application, code, through its respective communication link 215 and communication interface 214 .
  • Received program code may be executed by the respective processor(s) 207 as it is received, and/or stored in the storage device 210 , or other associated non-volatile media, for later execution.
  • the computer system 200 operates in conjunction with a data storage system 231 , e.g., a data storage system 231 that contains a database 232 that is readily accessible by the computer system 200 .
  • the computer system 200 communicates with the data storage system 231 through a data interface 233 .
  • a data interface 233 which is coupled to the bus 206 , transmits and receives electrical, electromagnetic or optical signals, that include data streams representing various types of signal information, e.g., instructions, messages and data.
  • the functions of the data interface 233 may be performed by the communication interface 214 .
  • Computer system 200 includes a bus 206 or other communication mechanism for communicating instructions, messages and data, collectively, information, and one or more processors 207 coupled with the bus 206 for processing information.
  • Computer system 200 also includes a main memory 208 , such as a random access memory (RAM) or other dynamic storage device, coupled to the bus 206 for storing dynamic data and instructions to be executed by the processor(s) 207 .
  • the main memory 208 also may be used for storing temporary data, i.e., variables, or other intermediate information during execution of instructions by the processor(s) 207 .
  • the computer system 200 may further include a read only memory (ROM) 209 or other static storage device coupled to the bus 206 for storing static data and instructions for the processor(s) 207 .
  • ROM read only memory
  • a storage device 210 such as a magnetic disk or optical disk, may also be provided and coupled to the bus 206 for storing data and instructions for the processor(s) 207 .
  • a computer system 200 may be coupled via the bus 206 to a display device 211 , such as, but not limited to, a cathode ray tube (CRT), for displaying information to a user.
  • a display device 211 such as, but not limited to, a cathode ray tube (CRT)
  • An input device 212 e.g., alphanumeric and other keys, is coupled to the bus 206 for communicating information and command selections to the processor(s) 207 .
  • an individual computer system 200 performs specific operations by their respective processor(s) 207 executing one or more sequences of one or more instructions contained in the main memory 208 .
  • Such instructions may be read into the main memory 208 from another computer-usable medium, such as the ROM 209 or the storage device 210 .
  • Execution of the sequences of instructions contained in the main memory 208 causes the processor(s) 207 to perform the processes described herein.
  • hard-wired circuitry may be used in place of or in combination with software instructions. Thus, embodiments are not limited to any specific combination of hardware circuitry and/or software.
  • Non-volatile media i.e., media that can retain information in the absence of power
  • volatile media includes the main memory 208 .

Abstract

A method and a system to pre-scan a file, analyze data and create the Condensed Macro Library (CML) file. The method used is to find macros or cells of certain classes that are defined by rules. After a suitable macro or cell is identified, a parser scans the macro or cell pins and finds pins which have ports with the shapes defined on the specific layers defined by the rules and user data. Further processing is then performed based on a set of rules and the pin data to generate a CML file that contains relevant information regarding relevant pins.

Description

FIELD OF THE INVENTION
The field of the invention relates generally to circuit package design, and more particularly to systems and methods for identifying relevant input and output sources on a circuit.
BACKGROUND
In general I/O Library cells and the general design data representations of I/O cells, for example LEF (Library Exchange Format) files do not contain sufficient information for a designer to be able to determine how to interpret the function of the pins of individual I/O cells. The pins of I/O cells can supply power to the cell, pass power supply voltages from outside the IC into the core of the IC, be embedded flip-chip solder bumps or wirebond bondpads, connect multiple redistribution layers routing to separate flip-chip bumps or wirebond pads, or connect to core cells of the IC to pass signals from outside the chip to the IC or from the IC to the system to which it is connected.
There can be dozens or even hundreds of pins on one I/O cell, and each pin can be used for one of the above purposes. In order to correctly interpret I/O cells to use them appropriately when planning the I/O structures and die pads of a new IC, it is necessary to determine how each pin is intended to be used. Certain pins, such as those which supply power to the cell, or pins that connect to core cells are not important when planning I/O. Thus, they can usually be ignored. Other pins, such as those that are embedded die pads or that connect to die pads, are significant to I/O planning.
As this information is not available in the cell library, the current approach to determining how to interpret the various pins of I/O cells when planning the I/O and die pad layout of a new IC was done manually by a human. This made sense since the I/O planning was a completely manual task. Once the Condensed Macro Library file format was developed, a way was provided to record the information. However, this solution still requires the CML file to be created manually by a human using a computer program user interface. Thus, a user must manually determine the use of each pin for all cells in the library. Since a library typically has hundreds of cells that can have hundreds of pins this could be a very lengthy and tedious process.
What is needed is a system and method using parameterized rules which can develop a Condensed Macro Library file that contain the desired information.
SUMMARY
According to some embodiments, described is an intelligent method and a system to pre-scan IC cell library files, analyze cell and pin data therein, and based on special heuristic algorithms using rules with some user defined parameters, automatically deduce I/O cell and pin information is described. The method can read cell library data in Library Exchange Format (LEF) or any other formats, such as Open Access or any other known and/or convenient format.
An analysis is performed by the system and the rules along with any user modified parameters, and the resulting deduced information, are stored in a Condensed Macro Library (CML) file. The information deduced from the library and stored in the CML file is used to determine which cells and pins are important when importing I/Os from an IC design to IC packaging tools or other tools, and how to interpret the pins of those cells. The system and method can also provide automated selection of I/O cells and I/O pins plus redistribution layer (RDL) routing connection point pins of those cells for an entire cell library.
BRIEF DESCRIPTION OF THE DRAWINGS
The drawings illustrate the design and utility of preferred embodiments of the present invention. It should be noted that the figures are not drawn to scale and that elements of similar structures or functions are represented by like reference numerals throughout the figures. In order to better appreciate how the above-recited and other advantages and objects of the present inventions are obtained, a more particular description of the present inventions briefly described above will be rendered by reference to specific embodiments thereof, which are illustrated in the accompanying drawings. Understanding that these drawings depict only typical embodiments of the invention and are not therefore to be considered limiting of its scope, the invention will be described and explained with additional specificity and detail through the use of the accompanying drawings in which:
FIG. 1 depicts a method for generating a CML file containing pin information.
FIG. 2 depicts a computerized system on which a method for generating a CML file containing information can be implemented.
DETAILED DESCRIPTION
FIG. 100 represents a diagram showing the steps of a method for the creation for a condensed macro library (CML).
In LEF, cells are called macros, so “macro” and “cell” should be considered synonymous terms.
In step 102 the system determines whether it can locate an existing condensed macro library file. If the system locates an existing CML file it will advance to step 104 where the located CML file will be read. In step 106 the located CML file will be pre-scanned. Then, in step 112, the system will populate rule data based on the located CML file and a default set of rules. The default set of rules can be manually entered into the system or be read from a file. Whether manually entered or read from a file, in some embodiments, the default set of rules can be modified by a user. In alternate embodiments, the default rules can be fixed. In some embodiments the rules can identify any known and/or convenient feature of components associated with the circuit package design and/or input and output sources on a circuit.
If the result in step 102 is that no CML file is located, then the system can proceed to step 108 where the system will attempt to locate an existing default condensed macro library file. If the system is unable to locate an existing default CML file, then the system can proceed to step 112 and populate rule data based on a default set of rules, as previously described.
If the system is able to locate an existing default CML file in step 108, the default CML file can be read in step 110. In step 106, the default CML file can be pre-scanned and then the resulting data can be combined with default CML rules and populated into rule data in step 112.
The resulting populated rule data from step 112 will be funneled to step 114 and a determination can be made regarding whether existing user defined rules exist. If at step 114 the system determines that existing user defined rules exist, then the user defined rules will be read in step 116 and a CML file will be generated in step 118 based on the populated rules from step 112 and the existing user defined rules. If the system determines that no predefined rules exist then the CML file will be generated in step 118 based on the populated rules from step 112.
In alternate embodiments, step 102-118 can be performed in any convenient sequence or can be eliminated and substituted with a set of predefined rules which can be user modifiable.
In step 120 a cell is scanned to retrieve relevant pin data and cell class data. In step 122, the data retrieved in step 120 is used to determine whether the cell meets predefined class criteria. The predefined class criteria can be manually entered or can be read from a file. Whether manually entered or read from a file, in some embodiments the predefined class criteria can be at least partially specified by a user. In alternate embodiments, the predefined class criteria can be fixed. In one embodiment, the predefined user criteria can include shape data, dimension data, composition data or any other known and/or convenient cell characteristic.
If the cell does meet the specified class criteria, the cell can be parsed in step 124 and the shape of the pins of the defined redistribution layer (RDL) can be determined in step 126. In step 128, a determination will be made if the cell is on the top layer or die layer.
If the determination is made that the cell is not on the top layer or die layer then the system can proceed to step 130. In step 130 a determination of the pins that are on the RDL is made to locate such pins meeting specific specified shape rules. The specific shape rules can be geometric specification, electrical specification or any known and/or convenient shape specification. The specific shape rules can be manually entered or read from a file. In some embodiments the specific shape rules can be modified by a user while in alternate embodiments the specific shape rules can be fixed.
In step 132 pins having size that is less than a minimum specified input/output pad size are identified. Once this identification is made a write operation can be performed to write data to the CML created in step 118. The minimum specified input/output pad sizes can be manually entered or read from a file. In some embodiments the minimum specified input/output pad sizes can be modified by a user while in alternate embodiments the minimum specified input/output pad sizes can be fixed.
Returning to step 128. If a determination is made that the cell is on the top or die pin layer, then the system can determine the number of pins meeting input/output pad size rules in step 136. In step 138, those pins meeting special user exception rules can be identified. Both input/output pad size rules and special user exception rules can be manually entered or read from a file. In one embodiment, both input/output pad size rules and special user exception rules can be modified by a user. In alternate embodiments, input/output pad size rules can be fixed.
In step 140, a determination can be made if any pins are comprised of multiple intersecting rectangular shapes. If the determination is made that none of the pins are comprised of multiple intersecting rectangular shapes the system can proceed to step 134 where data will be written to the CML file created in step 118. If in step 140, a determination is made that some pins are comprised of multiple intersecting rectangular shape then a second determination will be made in step 142 as to when the rectangular shapes are disjointed. If the rectangular shapes are determined not to be disjointed the system will proceed to step 144. In step 144 the rectangular shapes will be merged into a single polygonal shape and the data related to the single polygonal shape can then, in step 134, be written to the CML file generated in step 118. If in step 142 the rectangular shapes are determined to be disjointed then in step 146 the system can determine the smallest convex hull enclosing the disjointed rectangular shapes. The smallest convex hull enclosing the disjointed rectangular shapes can be determined using any known or convenient determination method. The data related to the smallest convex hull can be used to write to update the CML file, created in step 118, in step 134.
From step 134 the system can proceed to step 158. In step 158 the system determines whether more cells are present. If the system determines more cells are present, it can return to step 156 and proceed to the next cell. If the system determines that there are no more cells present, it can proceed to step 160 where the CML file will be closed.
Returning now to step 122. If the determination is made the cells do not meet specific class requirements then the cell may be a special exception cell. In step 148, a determination is made is to whether the cell is a special exception cell. The determination as to whether a cell is a special exception cell can be performed by comparing the cell information contained in an exception cell file or by manual identification of the cell as a special exception cell. In one embodiment, the exception cell file can be a user created or modifiable file or can be a fixed file. In some embodiments, special exception cells can be identified specifically, can be identified based on the contents of a cell or based on any other known and/or convenient factors.
If the cell is determined to be a special exception cell, then in step 150 the system can determine whether all input/output pads of the cell meet the special rules. If all input/output pads meet the special rules, then in step 152 the system can determine all the connection point pins meeting the special rules. Based on the information from steps 150 and 152, CML data can be written to CML file created in step 118.
Returning to step 148. If the cell is determined not to be a special exception cell then the system can proceed to step 154 where a determination is made as to whether there are more cells present. If there are more cells present then it will proceed to step 156. In step 156, the system can increment to the next cell identified for processing and the system can then proceed to step 120 and the entire process from steps 120-158 can be repeated, as appropriate. If there are no more cells present then the system can perform an end operation to close the CML file, step 160.
With reference to FIG. 2, the execution of the sequences of instructions required to practice the embodiments may be performed by a computer system 200 as shown in FIG. 2. In an embodiment, execution of the sequences of instructions is performed by a single computer system 200. According to other embodiments, two or more computer systems 200 coupled by a communication link 215 may perform the sequence of instructions in coordination with one another. Although a description of only one computer system 200 will be presented below, however, it should be understood that any number of computer systems 200 may be employed to practice the embodiments.
A computer system 200 according to an embodiment will now be described with reference to FIG. 2, which is a block diagram of the functional components of a computer system 200. As used herein, the term computer system 200 is broadly used to describe any computing device that can store and independently run one or more programs.
Each computer system 200 may include a communication interface 214 coupled to the bus 206. The communication interface 214 provides two-way communication between computer systems 200. The communication interface 214 of a respective computer system 200 transmits and receives electrical, electromagnetic or optical signals, that include data streams representing various types of signal information, e.g., instructions, messages and data. A communication link 215 links one computer system 200 with another computer system 200. For example, the communication link 215 may be a LAN, in which case the communication interface 214 may be a LAN card, or the communication link 215 may be a PSTN, in which case the communication interface 214 may be an integrated services digital network (ISDN) card or a modem, or the communication link 215 may be the Internet, in which case the communication interface 214 may be a dial-up, cable or wireless modem.
A computer system 200 may transmit and receive messages, data, and instructions, including program, i.e., application, code, through its respective communication link 215 and communication interface 214. Received program code may be executed by the respective processor(s) 207 as it is received, and/or stored in the storage device 210, or other associated non-volatile media, for later execution.
In an embodiment, the computer system 200 operates in conjunction with a data storage system 231, e.g., a data storage system 231 that contains a database 232 that is readily accessible by the computer system 200. The computer system 200 communicates with the data storage system 231 through a data interface 233. A data interface 233, which is coupled to the bus 206, transmits and receives electrical, electromagnetic or optical signals, that include data streams representing various types of signal information, e.g., instructions, messages and data. In embodiments, the functions of the data interface 233 may be performed by the communication interface 214.
Computer system 200 includes a bus 206 or other communication mechanism for communicating instructions, messages and data, collectively, information, and one or more processors 207 coupled with the bus 206 for processing information. Computer system 200 also includes a main memory 208, such as a random access memory (RAM) or other dynamic storage device, coupled to the bus 206 for storing dynamic data and instructions to be executed by the processor(s) 207. The main memory 208 also may be used for storing temporary data, i.e., variables, or other intermediate information during execution of instructions by the processor(s) 207.
The computer system 200 may further include a read only memory (ROM) 209 or other static storage device coupled to the bus 206 for storing static data and instructions for the processor(s) 207. A storage device 210, such as a magnetic disk or optical disk, may also be provided and coupled to the bus 206 for storing data and instructions for the processor(s) 207.
A computer system 200 may be coupled via the bus 206 to a display device 211, such as, but not limited to, a cathode ray tube (CRT), for displaying information to a user. An input device 212, e.g., alphanumeric and other keys, is coupled to the bus 206 for communicating information and command selections to the processor(s) 207.
According to one embodiment, an individual computer system 200 performs specific operations by their respective processor(s) 207 executing one or more sequences of one or more instructions contained in the main memory 208. Such instructions may be read into the main memory 208 from another computer-usable medium, such as the ROM 209 or the storage device 210. Execution of the sequences of instructions contained in the main memory 208 causes the processor(s) 207 to perform the processes described herein. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions. Thus, embodiments are not limited to any specific combination of hardware circuitry and/or software.
The term “computer-usable medium,” as used herein, refers to any medium that provides information or is usable by the processor(s) 207. Such a medium may take many forms, including, but not limited to, non-volatile and volatile media. Non-volatile media, i.e., media that can retain information in the absence of power, includes the ROM 209, CD ROM, magnetic tape, and magnetic discs. Volatile media, i.e., media that can not retain information in the absence of power, includes the main memory 208.
In the foregoing specification, the embodiments have been described with reference to specific elements thereof. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the embodiments. For example, the reader is to understand that the specific ordering and combination of process actions shown in the process flow diagrams described herein is merely illustrative, and that using different or additional process actions, or a different combination or ordering of process actions can be used to enact the embodiments. The specification and drawings are, accordingly, to be regarded in an illustrative rather than restrictive sense.

Claims (27)

1. A computer-implemented method for identifying relevant input and output sources in an electronic circuit design of an integrated circuit, comprising:
identifying one or more library files related to one or more pins of a cell;
processing the one or more library files to determine whether at least one of the one or more pins in the electronic circuit design is to be used in input/output planning, wherein
the one or more library files provide the cell or pin information about importance of the at least one of the one or more pins of the cell in the input/output planning, and
the act of analyzing the cell or pin information is performed by at least one processor;
populating, into rule data, one or more default rules combined with a result of the act of processing the one or more library files, in which the rule data comprises a first information about how the one or more pins are used in the input/output planning;
identifying the relevant input and output sources in the electronic circuit design of the integrated circuit by determining whether the cell meets one or more class criteria based at least in part on the rule data; and
displaying a result of the act of determining whether the cell meets one or more class criteria on a display apparatus or storing the result in a tangible computer usable storage medium.
2. The method of claim 1, in which the class criteria are based in part upon pin data and cell class data.
3. The method of claim 1, in which the class criteria comprise shape data, dimension data, or composition data.
4. The method of claim 1, further comprising:
parsing the cell;
determining one or more properties of a pin of a redistribution layer;
determining whether the cell is on a top or die layer;
generating or updating one or more files based in part upon information obtained from one or more of aforementioned acts; and
interpreting the pin based in part upon the one or more files.
5. The method of claim 4, further comprising:
determining one or more pins meeting one or more input/output pad size rules;
identifying a pin from the one or more pins meeting one or more special user exception rules;
generating or updating one or more files based in part upon information obtained from one or more of aforementioned acts; and
interpreting the pin based in part upon the one or more files.
6. The method of claim 5, further comprising:
identifying one or more connection point pins meeting the one or more special rules where all input/output pads of the cell meet the one or more special rules;
generating or updating one or more files based in part upon information obtained from one or more of aforementioned acts; and
interpreting the one or more connection point pins based in part upon the one or more files.
7. The method of claim 1, further comprising:
determining whether the cell is a special exception cell where the cell is determined not to meet the one or more class criteria based at least in part on the rule data;
generating or updating one or more files based in part upon information obtained from one or more of aforementioned acts; and
interpreting the pin based in part upon the one or more files.
8. The method of claim 7, in which the step of determining whether the cell is a special exception cell is performed by comparing the cell information contained in a special exception cell file or by manually identifying the cell to be a special exception cell.
9. The method of claim 7, further comprising:
locating one or more pins meeting one or more shape rules;
identifying a pin from the one or more pins whose size is smaller than a minimum specified I/O pad size;
merging intersecting and non-disjointed pins into one or more polygonal shapes;
enclosing intersecting and disjointed pins with a smallest convex hull;
generating or updating one or more files based in part upon information obtained from one or more of aforementioned acts; and
interpreting the pin based in part upon the one or more files.
10. The method of claim 7, further comprising determining whether all input/output pads of the cell meet one or more special rules.
11. The method of claim 1, further comprising scanning one or more next available cell.
12. The computer-implemented method of claim 1, in which the one or more class criteria comprises at least one of shape data, dimension data, composition data, or a cell characteristic.
13. A computer program product comprising a computer-usable storage medium having executable code which, when executed by at least one processor, causes the processor to execute a process for interpreting input and output sources in an electronic circuit design of an integrated circuit, the process comprising:
identifying one or more library files related to one or more pins of a cell;
processing the one or more library files to determine whether at least one of the one or more pins in the electronic circuit design is to be used in input/output planning, wherein
the one or more library files provide the cell or pin information about importance of the at least one of the one or more pins of the cell in the input/output planning, and
the act of analyzing the cell or pin information is performed by at least one processor;
populating, into rule data, one or more default rules combined with a result of the act of processing the one or more library files, in which the rule data comprises a first information about how the one or more pins are used in the input/output planning;
identifying the relevant input and output sources in the electronic circuit design of the integrated circuit by determining whether the cell meets one or more class criteria based at least in part on the rule data.
14. The computer program product of claim 13, in which the process further comprises:
parsing the cell;
determining one or more properties of a pin of a redistribution layer;
determining whether the cell is on a top or die layer;
generating or updating one or more files based in part upon information obtained from one or more of aforementioned acts; and
interpreting the pin based in part upon the one or more files.
15. The computer program product of claim 14, in which the process further comprises determining whether all input pads of the cell meet one or more special rules.
16. The computer program product of claim 15, in which the process further comprises:
identifying one or more connection point pins meeting the one or more special rules where all input/output pads of the cell meet the one or more special rules;
generating or updating one or more files based in part upon information obtained from one or more of aforementioned acts; and
interpreting the one or more connection point pins based in part upon the one or more files.
17. The computer program product of claim 13, in which the process further comprises:
determining whether the cell is a special exception cell;
generating or updating one or more files based in part upon information obtained from one or more of aforementioned acts; and
interpreting the pin based in part upon the one or more files.
18. The computer program product of claim 13, in which the process further comprises:
locating one or more pins meeting one or more shape rules;
identifying a pin from the one or more pins whose size is smaller than a minimum specified I/O pad size;
merging intersecting and non-disjointed pins into one or more polygonal shapes;
enclosing intersecting and disjointed pins with a smallest convex hull;
generating or updating one or more files based in part upon information obtained from one or more of aforementioned acts; and
interpreting the pin based in part upon the one or more files.
19. The computer program product of claim 13, in which the process further comprises:
determining one or more pins meeting one or more input/output pad size rules;
identifying a pin from the one or more pins meeting one or more special user exception rules;
generating or updating one or more files based in part upon information obtained from one or more of aforementioned acts; and
interpreting the pin based in part upon the one or more files.
20. A computer system for identifying input and output sources on an integrated circuit, comprising:
means for identifying one or more library files related to one or more pins of a cell;
at least one processor for processing one or more library files to determine whether at least one of the one or more pins in the electronic circuit design is to be used in input/output planning, wherein
the one or more library files provide the cell or pin information about importance of the at least one of the one or more pins of the cell in the input/output planning,
means for populating, into rule data, one or more default rules combined with a result generated by the at least one processor for processing the one or more library files, in which the rule data comprises a first information about how the one or more pins are used in the input/output planning;
means for identifying the relevant input and output sources in the electronic circuit design of the integrated circuit by determining whether the cell meets one or more class criteria based at least in part on the rule data; and
a display apparatus for displaying a result of the act of determining whether the cell meets one or more class criteria on a tangible computer usable storage medium for storing the result.
21. The computer system of claim 20, further comprising:
means for parsing the cell;
means for determining one or more properties of a pin of a redistribution layer;
means for determining whether the cell is on a top or die layer;
means for generating or updating one or more files based in part upon information obtained from one or more of aforementioned; and
means for interpreting the pin based in part upon the one or more files.
22. The system of claim 21, further comprising:
means for determining one or more pins meeting one or more input/output pad size rules;
means for identifying a pin from the one or more pins meeting one or more special user exception rules;
means for generating or updating one or more files based in part upon information obtained from one or more of aforementioned acts; and
means for interpreting the pin based in part upon the one or more files.
23. The computer system of claim 20, further comprising:
means for determining whether the cell is a special exception cell;
means for generating or updating one or more files based in part upon information obtained from one or more of aforementioned acts; and
means for interpreting the pin based in part upon the one or more files.
24. The computer system of claim 23, in which the step of determining whether the cell is a special exception cell is performed by means for comparing the cell information contained in a special exception cell file or by manually identifying the cell to be a special exception cell.
25. The system of claim 23, further comprising means for determining whether all input/output pads of the cell meet one or more special rules.
26. The system of claim 25, further comprising:
means for identifying one or more connection point pins meeting the one or more special rules where all input/output pads of the cell meet the one or more special rules;
means for generating or updating one or more files based in part upon information obtained from one or more of aforementioned acts; and
means for interpreting the one or more connection point pins based in part upon the one or more files.
27. The system of claim 20, further comprising:
means for locating one or more pins meeting one or more shape rules;
means for identifying a pin from the one or more pins whose size is smaller than a minimum specified I/O pad size;
means for merging intersecting and non-disjointed pins into one or more polygonal shapes;
means for enclosing intersecting and disjointed pins with a smallest convex hull;
means for generating or updating one or more files based in part upon information obtained from one or more of aforementioned; and
means for interpreting the pin based in part upon the one or more files.
US11/098,026 2005-04-01 2005-04-01 Method and system for the condensed macro library creation Active 2025-09-03 US7665044B1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US11/098,026 US7665044B1 (en) 2005-04-01 2005-04-01 Method and system for the condensed macro library creation
US12/650,923 US8516415B1 (en) 2005-04-01 2009-12-31 Method and system for the condensed macro library creation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US11/098,026 US7665044B1 (en) 2005-04-01 2005-04-01 Method and system for the condensed macro library creation

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US12/650,923 Division US8516415B1 (en) 2005-04-01 2009-12-31 Method and system for the condensed macro library creation

Publications (1)

Publication Number Publication Date
US7665044B1 true US7665044B1 (en) 2010-02-16

Family

ID=41665919

Family Applications (2)

Application Number Title Priority Date Filing Date
US11/098,026 Active 2025-09-03 US7665044B1 (en) 2005-04-01 2005-04-01 Method and system for the condensed macro library creation
US12/650,923 Active 2027-02-06 US8516415B1 (en) 2005-04-01 2009-12-31 Method and system for the condensed macro library creation

Family Applications After (1)

Application Number Title Priority Date Filing Date
US12/650,923 Active 2027-02-06 US8516415B1 (en) 2005-04-01 2009-12-31 Method and system for the condensed macro library creation

Country Status (1)

Country Link
US (2) US7665044B1 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10558774B1 (en) 2018-01-05 2020-02-11 Cadence Design Systems, Inc. Electronic library and design generation using image and text processing

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6907589B2 (en) * 2003-02-19 2005-06-14 Hewlett-Packard Development Company, L.P. System and method for evaluating vias per pad in a package design
US20060218516A1 (en) * 2005-03-16 2006-09-28 Mclain Michelle A Design rule report utility
US7353476B2 (en) * 2002-07-12 2008-04-01 Kabushiki Kaisha Toshiba System, method and computer program product for designing connecting terminals of semiconductor device

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6966045B2 (en) * 1999-12-27 2005-11-15 Kabushiki Kaisha Toshiba Method and computer program product for estimating wire loads
JP2002299452A (en) * 2001-03-30 2002-10-11 Fujitsu Ltd Semiconductor integrated circuit and method for designing layout of power source
US6895569B1 (en) * 2001-06-03 2005-05-17 Candence Design Systems, Inc. IC layout with non-quadrilateral Steiner points
US7340693B2 (en) * 2005-02-24 2008-03-04 Nick Martin System for designing re-programmable digital hardware platforms

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7353476B2 (en) * 2002-07-12 2008-04-01 Kabushiki Kaisha Toshiba System, method and computer program product for designing connecting terminals of semiconductor device
US6907589B2 (en) * 2003-02-19 2005-06-14 Hewlett-Packard Development Company, L.P. System and method for evaluating vias per pad in a package design
US20060218516A1 (en) * 2005-03-16 2006-09-28 Mclain Michelle A Design rule report utility

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Cadence Design Systems, Inc. "LEF/DEF 5.5 Language Reference" Product Version 5.5, Apr. 2004, Cadence Design Systems, Inc., San Jose, CA.
Cadence Design Systems, Inc. "What's New in LEF/DEF" Product Version 5.5, Dec. 2002, updated Apr. 2004, Cadence Design Systems, Inc., San Jose, CA.

Also Published As

Publication number Publication date
US8516415B1 (en) 2013-08-20

Similar Documents

Publication Publication Date Title
US8230370B2 (en) Circuit design assisting apparatus, computer-readable medium storing circuit design assisting program, and circuit design assisting method
US6182245B1 (en) Software test case client/server system and method
CA2297901C (en) System and method for generating year 2000 test cases
US7854376B2 (en) System and method for managing item interchange and identification in an extended enterprise
US7721253B2 (en) Software development support system
US20060224613A1 (en) Method and system for an administrative apparatus for creating a business rule set for dynamic transform and load
US20060106856A1 (en) Method and system for dynamic transform and load of data from a data source defined by metadata into a data store defined by metadata
US8595662B1 (en) Methods, systems, and articles of manufacture for implementing a physical design of an electronic circuit with automatic snapping
US20040205598A1 (en) Method and system for management of structured document and medium having processing program therefor
CN108509556B (en) Data migration method and device, server and storage medium
US9064063B1 (en) Methods, systems, and articles of manufacture for implementing interactive, real-time checking or verification of complex constraints
US20090172063A1 (en) Multi-Threaded Codeless User-Defined Functions
EP1171832A2 (en) Interface for an enterprise resource planning program
CN110990274A (en) Data processing method, device and system for generating test case
US7886243B1 (en) System and method for using rules-based analysis to enhance models-based analysis
CN108268615A (en) A kind of data processing method, device and system
CN108459846B (en) Software cloud customization method and platform
CN107909054A (en) The method for evaluating similarity and device of picture text
US7665044B1 (en) Method and system for the condensed macro library creation
US8694943B1 (en) Methods, systems, and computer program product for implementing electronic designs with connectivity and constraint awareness
US10782942B1 (en) Rapid onboarding of data from diverse data sources into standardized objects with parser and unit test generation
US6931573B2 (en) Automated audit methodology for design
US6609250B1 (en) Software generating device
US6681347B1 (en) Method for testing keyboard complied with language code
US5960184A (en) Method and apparatus for providing optimization parameters to a logic optimizer tool

Legal Events

Date Code Title Description
AS Assignment

Owner name: CADENCE DESIGN SYSTEMS, INC.,CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KHOMOUTOV, ALEXANDER F.;CARLSON, BRIAN J.;REEL/FRAME:016404/0136

Effective date: 20050608

STCF Information on status: patent grant

Free format text: PATENTED CASE

FPAY Fee payment

Year of fee payment: 4

FPAY Fee payment

Year of fee payment: 8

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 12