Patent Grant
9064074
Electronic circuit packages or designs are often composed of a variety of components delivered and/or provided by different sources. For example, the electronic circuit design may include boards/backplanes, cards, multi-chip modules, chips, etc., plugged into each other. The various physical components of the package are connected to each other via connectors, wires, solder lines, etc. During the design process for the electronic circuit package, a simulation process may be performed to enable designers to simulate the design using software tools, thereby testing the function of the design before its actual build. Part of the simulation process is to ensure the various components of the design are correctly connected.
According to one aspect of the present disclosure a method and technique for identifying odd nets in a hierarchical electronic circuit design is disclosed. The method includes: receiving a very high-speed integrated circuit hardware description language (VHDL) model of an electronic circuit design; modifying an architecture section of VHDL code of each endpoint component of the VHDL model to connect each input/output (IO) of the endpoint component VHDL code to an instance of a snoop VHDL code; executing a simulation of the VHDL model through a plurality of clock cycles while driving a logical value by the snoop VHDL code and deriving simulation clashes detected by the snoop VHDL code for each IO of the endpoint components; and extracting an odd net topology for the VHDL model based on the simulation clashes derived from the simulation.
For a more complete understanding of the present application, the objects and advantages thereof, reference is now made to the following descriptions taken in conjunction with the accompanying drawings, in which:
Embodiments of the present disclosure provide a method, system and computer program product for identifying odd nets in a hierarchical electronic circuit design. For example, in some embodiments, the method and technique includes: receiving a very high-speed integrated circuit hardware description language (VHDL) model of an electronic circuit design; modifying an architecture section of VHDL code of each endpoint component of the VHDL model to connect each input/output (IO) of the endpoint component VHDL code to an instance of a snoop VHDL code; executing a simulation of the VHDL model through a plurality of clock cycles while driving a logical value by the snoop VHDL code and deriving simulation clashes detected by the snoop VHDL code for each IO of the endpoint components; and extracting an odd net topology for the VHDL model based on the simulation clashes derived from the simulation. Thus, in some embodiments of the present disclosure, a simulation of an electronic circuit design over multiple package levels may be performed to identify odd or incorrect/potentially incorrect nets (or connections) between design components by evaluating simulation clashes. Embodiments of the present disclosure utilize a watchdog or snoop latch to drive one value and sense another value to identify a signal clash to establish a netlist for the design over multiple package levels.
As will be appreciated by one skilled in the art, aspects of the present disclosure may be embodied as a system, method or computer program product. Accordingly, aspects of the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present disclosure may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.
Any combination of one or more computer usable or computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
Aspects of the present disclosure are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosure. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable medium that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable medium produce an article of manufacture including instruction means which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
With reference now to the Figures and in particular with reference to
In some embodiments, server 140 and server 150 connect to network 130 along with data store 160. Server 140 and server 150 may be, for example, IBM System P® servers. In addition, clients 110 and 120 connect to network 130. Clients 110 and 120 may be, for example, personal computers or network computers. In the depicted example, server 140 provides data and/or services such as, but not limited to, data files, operating system images, and applications to clients 110 and 120. Network data processing system 100 may include additional servers, clients, and other devices.
In the depicted example, network data processing system 100 is the Internet with network 130 representing a worldwide collection of networks and gateways that use the Transmission Control Protocol/Internet Protocol (TCP/IP) suite of protocols to communicate with one another. At the heart of the Internet is a backbone of high-speed data communication lines between major nodes or host computers, consisting of thousands of commercial, governmental, educational and other computer systems that route data and messages. Of course, network data processing system 100 also may be implemented as a number of different types of networks, such as for example, an intranet, a local area network (LAN), or a wide area network (WAN).
Processor unit 204 serves to execute instructions for software that may be loaded into memory 206. Processor unit 204 may be a set of one or more processors or may be a multi-processor core, depending on the particular implementation. Further, processor unit 204 may be implemented using one or more heterogeneous processor systems in which a main processor is present with secondary processors on a single chip. As another illustrative example, processor unit 204 may be a symmetric multi-processor system containing multiple processors of the same type.
In some embodiments, memory 206 may be a random access memory or any other suitable volatile or non-volatile storage device. Persistent storage 208 may take various forms depending on the particular implementation. For example, persistent storage 208 may contain one or more components or devices. Persistent storage 208 may be a hard drive, a flash memory, a rewritable optical disk, a rewritable magnetic tape, or some combination of the above. The media used by persistent storage 208 also may be removable such as, but not limited to, a removable hard drive.
Communications unit 210 provides for communications with other data processing systems or devices. In these examples, communications unit 210 is a network interface card. Modems, cable modem and Ethernet cards are just a few of the currently available types of network interface adapters. Communications unit 210 may provide communications through the use of either or both physical and wireless communications links.
Input/output unit 212 enables input and output of data with other devices that may be connected to data processing system 200. In some embodiments, input/output unit 212 may provide a connection for user input through a keyboard and mouse. Further, input/output unit 212 may send output to a printer. Display 214 provides a mechanism to display information to a user.
Instructions for the operating system and applications or programs are located on persistent storage 208. These instructions may be loaded into memory 206 for execution by processor unit 204. The processes of the different embodiments may be performed by processor unit 204 using computer implemented instructions, which may be located in a memory, such as memory 206. These instructions are referred to as program code, computer usable program code, or computer readable program code that may be read and executed by a processor in processor unit 204. The program code in the different embodiments may be embodied on different physical or tangible computer readable media, such as memory 206 or persistent storage 208.
Program code 216 is located in a functional form on computer readable media 218 that is selectively removable and may be loaded onto or transferred to data processing system 200 for execution by processor unit 204. Program code 216 and computer readable media 218 form computer program product 220 in these examples. In one example, computer readable media 218 may be in a tangible form, such as, for example, an optical or magnetic disc that is inserted or placed into a drive or other device that is part of persistent storage 208 for transfer onto a storage device, such as a hard drive that is part of persistent storage 208. In a tangible form, computer readable media 218 also may take the form of a persistent storage, such as a hard drive, a thumb drive, or a flash memory that is connected to data processing system 200. The tangible form of computer readable media 218 is also referred to as computer recordable storage media. In some instances, computer readable media 218 may not be removable.
Alternatively, program code 216 may be transferred to data processing system 200 from computer readable media 218 through a communications link to communications unit 210 and/or through a connection to input/output unit 212. The communications link and/or the connection may be physical or wireless in the illustrative examples.
The different components illustrated for data processing system 200 are not meant to provide architectural limitations to the manner in which different embodiments may be implemented. The different illustrative embodiments may be implemented in a data processing system including components in addition to or in place of those illustrated for data processing system 200. Other components shown in
As illustrated in
Build module 420 is used to design and/or represent an electronic circuit design, such as design 300, in very high-speed integrated circuit hardware description language (VHDL). For example, in
In
In the embodiment illustrated in
Build module 420 is used to modify the VHDL content of the endpoint components of VHDL model 442 using snoop VHDL 446. For example, the original VHDL architecture content of the endpoint component VHDLs have an entity section and an architecture section. Build module 420 is used to replace the architecture section of the VHDL content of the endpoint components of VHDL model 442 so that each IO in a portmap of the endpoint component is connected to an instance of snoop VHDL 446. This enables the generation a fully populated VHDL model with known endpoint component netnames for stimulation and expectation purposes. The structural VHDLs describing the wiring/connections are unchanged. Build module 420 thereafter generates a snoop VHDL netlist 448 for VHDL model 442 containing the snoop VHDL 446 instances connected to IOs of the endpoint components of the circuit design. As an example, netlist 448 for VHDL model 442 may contain entries such as:
Thus, in operation, each IO of an endpoint component is assigned to an instance of snoop VHDL 446. In VHDL, all identifiers are unique. Thus, as illustrated above, the snoop VHDL 446 instance name is chosen to have a prefix (e.g., “BB”) followed by the original netname. As a further example,
Simulation module 422 is used for executing a simulation on VHDL model 442 utilizing the endpoint components with base VHDLs having the snoop VHDL 446 instances instead of their original VHDL architecture content. As illustrated above, snoop VHDL netlist 448 contains nets ending with GET or SET at the endpoints, and nets without either SET/GET representing the interconnection signals. In operation, simulation module 422 is used such that endpoints that end with “.SET” are stimulated while endpoints that end with “.GET” are observed. The SET latch of snoop VHDL 446 is driven to logical value 1 while the GET latch of snoop VHDL 446 is wired to the SET latch and to the output of the endpoint component VHDL. Since the clock signal in snoop VHDL 446's sensitivity list is always logical value 1, this part of the model is recalculated in each clock cycle without any further effort. Thus, upon the initiation of a simulation by simulation module 422, the first clock cycle puts/sets all “.SET” nets to logical value 1, and also all “.GET” nets will be a logical value 1, so the simulation model 442 does not have any logical 0 values.
Simulation module 422 executes the simulation of VHDL module 442 by driving a particular logical value to nets ending with SET and observing nets ending with GET. For example, in operation, simulation module 422 picks up or selects one net at a time and sticks the selected net to logical value 0 for one simulation cycle, checks all GET nets, and then unsticks the selected net. Simulation module 422 observes all GET nets for a simulation clash (e.g., being an “X” state since a logical 0 is driven against a logical 1). Any nets having an X state therefore belong to the same net. Any X state will disappear by unsticking the net and running one simulation clock cycle. So a net is identified for just one clock cycle and is separated from the next net simulation by another simulation clock cycle.
As illustrated in
In some embodiments, simulation module 422 analyzes and/or otherwise filters simulation log 452 to derive an odd net list 454. For example, simulation log 452 may include some nets which odd names or different names at the package/component connection and will generally show up within one clock cycle. Simulation module 422 may be configured to apply one or more rules to extract odd nets from simulation log 452. For example, in some embodiments, simulation module 422 filters simulation log 452 based on the centerstring of a netname and its index. If these do not match, the net is written to odd net list 454.
At block 808, build module 420 generates snoop VHDL netlist 448 containing nets ending in SET and GET based on the modification of endpoint component VHDLs with snoop VHDL 446. At block 812, simulation module 422 receives the VHDL model 442 netlist 448 and initiates a simulation by sequentially selecting SET nets and driving a logical value 0. At block 814, simulation module 422 observes the GET nets for each simulation clock cycle to determine the logical value thereon. At block 816, simulation module 420 identifies simulation clashes for each simulation clock cycle based on an X state resulting from the logical 0 being driven against a logical value 1 on the GET nets. At block 818, simulation module 422 generates simulation log 452 identifying simulation clashes based on simulation clock cycles. At block 820, simulation module 422 analyzes and/or otherwise filters the content of simulation log 452 (e.g., based on applying a rule based on differing netnames). At block 822, simulation module 422 generates odd net list 454 corresponding to actual or potential odd or incorrect nets.
Thus, embodiments of the present disclosure enable odd nets to be identified in a hierarchical design package. For example, design validation over multiple packaging levels is typically performed by manual inspection. Embodiments of the present invention build a model of the design package containing all components of the package. Utilizing a snoop VHDL element, simulation clashes are detected based on a logical value 1 being driven against a logical value 0. The simulation clashes are used to identify nets extending across, over or through different levels of the design hierarchy. The identified nets based on the simulation clashes may then be analyzed for incorrect or odd nets.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present disclosure has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the disclosure in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the disclosure. The embodiment was chosen and described in order to best explain the principles of the disclosure and the practical application, and to enable others of ordinary skill in the art to understand the disclosure for various embodiments with various modifications as are suited to the particular use contemplated.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5487074 | Sullivan | Jan 1996 | A |
| 6516456 | Garnett et al. | Feb 2003 | B1 |
| 7080333 | Ratchev et al. | Jul 2006 | B1 |
| 7188284 | Mitra et al. | Mar 2007 | B2 |
| 7292970 | Hurlock | Nov 2007 | B1 |
| 7506286 | Beardslee et al. | Mar 2009 | B2 |
| 8020057 | Whetsel | Sep 2011 | B2 |
| 8341473 | Bertacco et al. | Dec 2012 | B2 |
| 8601333 | Van Den Eijnden | Dec 2013 | B2 |
| 20080077893 | Korson et al. | Mar 2008 | A1 |
| 20100146338 | Schalick et al. | Jun 2010 | A1 |
| Entry |
|---|
| Guohun Zhu; Xuelong Yan; Ya Zhou; Yueren Guo, “The algorithms of inserting boundary-scan circuit automatically,” Solid-State and Integrated Circuit Technology, 1998. Proceedings. 1998 5th International Conference on , vol., No., pp. 527,531, 1998. |
| Number | Date | Country | |
|---|---|---|---|
| 20130124182 A1 | May 2013 | US |
