US 6,973,405 B1Grant
Programmable interactive verification agent
Issue Date:2005-12-06
•27 Claims
•9 Drawing Sheets
Abstract
A verification agent can be used to verify hard and/or soft modules under test in an integrated circuit. The integrated circuit contains a processor and memory for storing code executable by the processor. The module under test performs predetermined operations. The verification agent interacts with the module under test, including sending signals to the module under test and generating results based on the interaction. The code causes the processor to receive the results and compare the results with expected values. The module under test may be deemed to operate properly if the actual results match the expected values.
Metadata
Assignee
- Xilinx, Inc.
Inventor
- Ahmad R. Ansari
Application Information
Application Number:US 10/153,980
Filing Date:2002-05-22
Priority Date:2002-05-22
Art Unit:2857
Patent Drawings (9 sheets)
Description
Field of the Invention
[0001] The present invention relates to system on a chip (SoC), and more particularly to verification of components in the SoC.
Background of the Invention
[0002] The number of transistors that can be fabricated on a semiconductor has increased drastically over the years. It is now possible to implement a whole system (containing processor, memory and logic) on an integrated circuit, i.e., SoC. As the complexity of integrated circuits increases, it becomes more and more difficult to properly test them. This problem is especially challenging for field programmable gate arrays (FPGAs) that have embedded fixed processors. A FPGA contains a large number of wires and configuration memory cells, in addition to regular structures such as random access memory (RAM) and logic elements (such as look-up-tables). A user can program the FPGA to implement a variety of circuits. The flexibility and complexity of FPGA means that it is important to have thorough testing.
[0003] An important method for testing is by applying a stream of test vectors to the integrated circuit. A test vector is a pattern of signal values, some of which are applied to the integrated circuit and others represent an expected response from the integrated circuit. These vectors are typically applied to the periphery of the integrated circuit sequentially so that they are associated with a proper operational sequence of the internal circuitry of the integrated circuit. This stream of vectors must be created and stored prior to testing.
[0004] One problem of this approach is that it needs tremendous amount of physical resource and is very slow. The number of test vectors needed to test an integrated circuit increases drastically with the complexity of the integrated circuit. The test vectors need to be stored and then applied sequentially to the integrated circuit. A large number of test vectors requires lots of memory to store them and a long time to completely apply them to the integrated circuit. As a result, it is very inefficient.
[0005] Another problem is that this approach does not lead to a consistent implementation across various stages of designs. System verification is usually done at three levels: RTL, gate-level and on the actual silicon. Traditionally a Verilog or VHDL system testbench is developed to perform the RTL-level verification. Next, the module under test is converted to the gate-level and inserted in the same testbench to perform the gate-level verification. In the ASIC world (as an example) the values at the boundary of the integrated circuit are sampled at this level to create a collection of test vectors. When the integrated circuit is manufactured, the vectors are applied to the integrated circuit on a tester and the outputs are compared with the expected values captured during the simulation.
[0006] Having these distinct methods of verification before and after silicon usually causes a variety of problems and limitations. First of all, due to lack of accurate timing during simulations, the captured patterns may not completely match with the actual silicon and there may be unnecessary mismatches during silicon verification. Second, vector-based verification is not useful for timing verification or the performance measurement of the silicon.
[0007] Furthermore, conventional simulation testbenches contain structures which are not implementable and therefore the RTL or gate-level testbench cannot be easily ported to the silicon-level verification. Examples of these structures are the ways system level signals (such as clocks) or asynchronous events (such as resets, interrupts, and communication ports) are simulated. In conventional systems, generation of these events is hard coded in the testbench at the behavioral level. For example, the testbench can be designed to release reset input to the system after certain nano-seconds are elapsed. Although, the mechanism can become slightly more flexible by reading the parameters through a script or input file, overall, this approach is only useful for verification during simulation and not on the actual hardware.
[0008] The main reason that conventional systems use the vector-based approach is the lack of any other alternatives. Therefore, it would be greatly advantageous if new approaches are developed so that the testbenches used in all three levels of verification are substantially identical. This would also make the maintenance of this testbench much easier.
Summary of the Invention
[0009] The present invention relates to a verification agent that can be used to verify at least one module under test in an integrated circuit, in particularly a FPGA. The integrated circuit contains a processor and memory for storing code executable by the processor. The module under test performs predetermined operations. The verification agent interacts with the module under test, including sending stimuli to the module under test and generating results based on the interaction. The code causes the processor to initiate the verification agent, receive the results, and compare the results with expected values. The module under test may be deemed to operate properly if the actual results match the expected responses. In a different embodiment, the verification agent can be initiated during configuration of the integrated circuit, and later triggers the processor to execute the code.
[0010] The above summary of the present invention is not intended to describe each disclosed embodiment of the present invention. The figures and detailed description that follow provide additional example embodiments and aspects of the present invention.
Brief Description of the Drawings
[0011] FIG. 1 is a block diagram of an integrated circuit containing a programmable interactive verification agent of the present invention.
[0012] FIG. 2 is flow chart showing an operation of the components in the integrated circuit of FIG. 1 in accordance with the present invention.
[0013] FIG. 3 is a block diagram showing an implementation of a data processing system containing the verification agent of the present invention.
[0014] FIG. 4 is a memory map of the data processing system shown in FIG. 3 .
[0015] FIG. 5 is a flow chart showing a process of the present invention that can be used to test an on-chip memory controller.
[0016] FIG. 6 is a block diagram showing an implementation of a verification agent of the present invention.
[0017] FIG. 7 is a block diagram showing another implementation of a data processing system showing the verification agent of the present invention.
[0018] FIG. 8 is a flow chart showing another operation in accordance with the present invention.
Detailed Description of the Invention
[0019] The present invention relates to a new verification system. In the following description, numerous specific details are set forth in order to provide a more thorough understanding of the present invention. However, it will be apparent to one skilled in the art that the present invention may be practiced without these specific details. In other instances, well-known features have not been described in detail in order to avoid obscuring the present invention.
[0020] FIG. 1 is a block diagram of an integrated circuit 100 containing a programmable interactive verification agent 102 of the present invention. Integrated circuit 100 contains a processor 104 that is preferably hard (i.e., non-programmable). Integrated circuit 100 also contains memory 106 and at least one module under test (two modules, 112 and 113, are shown in FIG. 1 ). Verification agent 102, memory 106 and modules under test 112-113 are preferably implemented on programmable logic. Examples of modules under test are various intellectual property (IP) cores. These cores are intended to be used by many parties in many circuit environments. Modules under test may be hard or soft (i.e., programmable) modules.
[0021] In integrated circuit 100, the modules under test can preferably communicate with processor 104. Verification agent 102 communicates with processor 104 and the modules under test 112-113. Processor 104 executes program code stored in memory 106, including program code 108 for a test case that is related to the operation of verification agent 102 and the modules under test.
[0022] FIG. 2 is a flow chart showing the operation 130 of the components in integrated circuit 100 in accordance with the present invention. In this flow chart, it is assumed that integrated circuit is an FPGA having an embedded processor. In step 132, the FPGA is configured to create the soft modules under test and the verification agent. In step 134, the processor executes the test case. The test case preferably causes the processor to initialize the modules under test (which can be hard or soft) and the verification agent (step 136). For example, the processor can set the states of the modules under test to predetermined values. The processor then sends a request to the verification agent causing it to start the verification operations. In step 138, the verification agent can interact with the modules under test and/or the processor. For example, it can send stimuli to the modules under test and receive signals from them. The verification agent can evaluate the signals and send further stimuli to some or all of the modules under test. In step 140, the processor receives results from the modules under test and the verification agent. It then compares the results with expected results and makes determination on whether the verification is successful.
[0023] One embodiment of a system 160 that can be implemented in integrated circuit 100 of FIG. 1 is shown in FIG. 3 . It comprises a fixed processor 162 connected to a bus arbiter 164. Arbiter 164 manages the operation of a bus 165 that is used by various modules. An example of such a bus is a processor local bus (PLB). One of the modules that are connected to bus 165 is a soft memory controller 166. Memory controller 166 controls the operation of a block of memory 168. In this embodiment, a verification agent 170 is mapped into the address space of processor 162, and is preferably connected to bus 165. A module under test 172 may also be connected to bus 165. Thus, verification agent 170 is able to communicate with processor 162 and module under test 172.
[0024] Processor 162 is preferably connected to an on-chip memory controller (OCM), such as OCMs 174 and 175. Each OCM can control its respective memory block, such as memory blocks 176 and 177. Verification agent 170 may communicate with processor 162 directly (i.e., without using bus 165). As an example, verification agent 170 can be configured to receive a notification signal from processor 164 (indicated by a line 180) and deliver an interrupt signal (indicated by a line 178) and clock signals (indicated by a line 179) to processor 164. Note that additional signals may be present. Further, verification agent 170 can also communicate directly with other modules (such as communicating with memory block 177 through a line 182).
[0025] FIG. 4 shows an exemplary memory map 190 of system 160. The memory space between 00000000 and FFFFFFFF is divided into many segments. Different kinds of components, such as peripherals, random access memory devices, etc., occupy different segments. In this example, the verification agent occupies the space between F0000000 and F00FFFFF. Thus, the processor can communicate with the verification agent by writing to and reading from this address space.
[0026] FIG. 5 shows an example of a process 210 of the present invention that tests an OCM. In step 212, the processor initializes the OCM. For example, it may map the OCM controller to a specific region in the memory, disable the processor caches for that region, and set up the translation look-aside buffers with appropriate attributes for that region. In step 214, the processor initializes the verification agent. For example, it may set a counter in the verification agent to a predetermined value. Note that the order of steps 212 and 214 is not important for this example. After these operations, both the OCM and the verification agent can operate concurrently. In step 216, the processor performs a set of operations on the OCM and its associated blocks. For example, the processor may place the OCM in a first mode of operation by writing one value into a register of the OCM and a second mode of operation by writing another value. The processor then reads and writes data into the memory (i.e., an associated block with respect to the OCM). If the OCM is not functioning properly, the processor may not be able to correctly interact with the memory. Turning now to the verification agent, it is programmed to generate various signals at certain intervals (step 220). It may also receive data from the OCM and the memory. The results may be written into predetermined locations (inside or outside of the verification agent) so that the processor can access them (step 222). After the testing is performed, the processor compares the actual results with the expected results (step 226). Based on this comparison, the process can make a determination on whether the OCM is working properly.
[0027] An example of applying process 210 to system 160 of FIG. 3 is now described. The test case may cause processor 162 to set itself to a sleep mode (e.g., by writing a predetermined code to a machine state register 184 in processor 162). Processor 162 then sends a notification signal to verification agent 170 through line 180 indicating that it is now ready to be stopped. Verification agent 170 shuts down the clock signals (line 178) connected to processor 162. At this time, processor 162 is in the sleep mode. Verification agent 170 then counts a predetermined number of clock cycles. At the end of the counts, verification agent 170 reapplies the clock signals to processor 162. It also sends an interrupt signal (line 179) to processor 162 to wake it up. Processor 162 then interacts with OCM 175 and memory block 177. Verification agent 170 can monitor the status of OCM 175 and/or memory block 177 to determine if processor 162 and OCM 175 are operating properly after a sleep-wake cycle.
[0028] An exemplary verification agent 300 that can be used in process 210 is shown in FIG. 6 . In contains an address decoder 302 that is connected to an address bus 304. Address bus 304 can be part of bus 165 of system 160 of FIG. 3 . Verification agent 300 also accepts data in a data bus 306. Data bus 306 can be part of bus 165 of system 160. Address bus 304 and data bus 306 are accessible by various components in system 160. Agent 300 has a plurality of testing modules (such as modules 308-310) that are used to send signals to and receive signals from various modules under test. Different addresses cause different actions in different testing modules of agent 300. One exemplary testing module, 310, is shown in details here. It contains a register 312. Its “enable” terminal is connected to a line 314 that corresponds to a decoded address. When this line is activated (i.e., when agent 300 receives the corresponding address from address bus 304), register 312 accepts data in data bus 306. Agent 300 also contains a decrementor circuit 316 that decrements register 312. It is triggered into action by applying a signal to a “start” terminal. In this embodiment, this terminal is connected to line 314, although it may also be connected to a separate line that corresponds to another decoded address. The output of register 312 is connected to a zero-detector 320. If the value of register 312 is not equal to zero, detector 320 causes circuit 316 to decrement register 312 on more time. If the value of register 312 is equal to zero, an output signal is generated at a line 322. As a result, agent 300 can generate a timed signal that can be applied to a module under test. The processor can initialize register 312 and set testing module 310 in motion by writing to verification agent 300 at appropriate times.
[0029] FIG. 6 shows another exemplary testing module 308. It contains a register 323 and an incrementor circuit 324. In this example, another address causes address decoder 302 to generate an enable signal 328. This signal allows register 323 to capture data in data bus 306. Incrementor circuit 324 is triggered by an external signal, shown as signal 326 that is separate from address bus 304. Signal 326 can be generated by a module under test, processor, or other modules.
[0030] In some situations, it may not be desirable to attach the verification agent on a shared bus. For example, if the test relates to timing on the shared bus, the existence of the verification agent on the shared bus may affect the timing. Some processors allow communication between the processor and external modules using a special bus. For example, this can be achieved through a separate device control bus. An example of such a system 250 is shown in FIG. 7 . It comprises a processor 252 connected to a bus arbiter 254. Processor 252 may be connected to OCMs (not shown). One of the modules that is connected to a bus 255 managed by bus arbiter 254 is a soft memory controller 256. Memory controller 256 controls the operation of a block of memory 258. In this embodiment, a verification agent 260 is connected to processor 252 through a separate device control bus 262. A module under test 264 may be connected to bus 255. Verification agent 260 and module under test 264 may communicate directly by passing various signals between them (shown in FIG. 7 as a line 266). As a result, the present of verification agent 260 will not affect the behavior of bus 255 and module under test 264.
[0031] In a separate embodiment of the present invention, the verification agent may initiate a test case (as oppose to initiation by a processor). FIG. 8 shows a flow chart of an operation 340 of this embodiment. In step 342, the FGPA is configured to create various modules, including a verification agent and modules under test. A portion of the memory in the FPGA, such as the block random access memory built in many FPGAs, can be configured to store a set of instructions for the verification agent. In step 344, the verification agent executes the instructions, which include triggering the processor to execute codes of a test case. The processor and the verification agent now operate concurrently. In step 346, the processor interacts with the modules under test (which may include initializing the modules). In step 348, the verification agent generates signals at programmed intervals, and sends the signals to the modules under test. The verification agent may also receive data from them. In step 350, the verification agent writes results to predetermined locations. After the testing is completed, the processor compares the actual results with expected results. It can then determine whether the modules under test are operating properly.
[0032] It can be seen from the above description that a novel verification apparatus and method have been disclosed. Those having skill in the relevant arts of the invention will now perceive various modifications and additions which may be made as a result of the disclosure herein. Accordingly, all such modifications and additions are deemed to be within the scope of the invention, which is to be limited only by the appended claims and their equivalents.
Claims
1. An integrated circuit comprising:
a processor;
memory for storing code executable by the processor;
a module under test that performs predetermined operations;
an address bus;
a programmable verification agent that interacts with the module under test, including sending at least one stimulus to the module under test and generating results based on such interaction, wherein the programmable verification agent comprises a plurality of testing modules formed in a programmable logic device and an address decoder for generating at least one control signal in response to an address in the address bus, the at least one control signal being connected to one of the testing modules, wherein at least one of the testing modules generates an output in response to receiving the at least one control signal, the output being used as the at least one stimulus; and
wherein the code causes the processor to initiate the programmable verification agent, receive the results, and compare the results with expected values.
2. The integrated circuit of claim 1 wherein the verification agent is mapped into address space of the processor.
3. The integrated circuit of claim 1 wherein the module under test is initialized by the processor.
4. The integrated circuit of claim 1 wherein the programmable verification agent and module under test are implemented in programmable logic and the processor is implemented in hard logic.
5. The integrated circuit of claim 1 wherein the programmable verification agent is implemented in programmable logic and the module under test is implemented in hard logic.
6. The integrated circuit of claim 5 wherein the module under test is an on-chip memory controller.
7. The integrated circuit of claim 1 wherein the verification agent communicates with the processor through a first bus and the module under test communicates with the processor through a second bus.
8. The integrated circuit of claim 7 wherein the first bus is a device control bus and the second bus is a processor local bus.
9. The integrated circuit of claim 7 wherein the verification agent communicates with the processor through additional signal lines.
10. The integrated circuit of claim 7 wherein the module under test is initialized by the processor.
11. The integrated circuit of claim 7 wherein the programmable verification agent and module under test are implemented in programmable logic and the processor is implemented in hard logic.
12. The integrated circuit of claim 7 wherein the programmable verification agent is implemented in programmable logic and the module under test is implemented in hard logic.
13. The integrated circuit of claim 12 wherein the module under test is an on-chip memory controller.
14. The integrated circuit of claim 1 wherein at least one of the testing modules contains a register that can be enabled by the at least one control signal.
15. A circuit arrangement for testing a module under test, comprising:
a processor integrated on a semiconductor chip;
a memory integrated on the chip and coupled to the processor, the memory configured with code executable by the processor;
a module under test implemented on the chip;
a field programmable gate array integrated on the chip and configured to implement a verification agent, the verification agent coupled to the module under test, to the processor, and to the memory, and adapted to generate a stimulus signal for input to the module under test; and
wherein the processor, responsive to execution the code in the memory, initiates the verification agent, receives a result signal from the module under test, and compares the result signal to an expected value.
16. The circuit arrangement of claim 15, wherein the module under test is implemented in the field programmable gate array.
17. The circuit arrangement of claim 15, wherein the module under test is integrated on the chip as application-specific integrated circuitry.
18. The circuit arrangement of claim 15, wherein the module under test is an on-chip memory controller.
19. The circuit arrangement of claim 15, further comprising:
a first bus implemented in the field programmable gate array and adapted to couple the verification agent to the processor; and
a second bus implemented in the field programmable gate array and adapted to couple the module under test to the processor.
20. The circuit arrangement of claim 15 wherein the processor and the verification agent are adapted to communicate via a memory map in the memory.
21. A method for testing a module under test, comprising:
configuring resources of a field programmable gate array integrated on a semiconductor chip with configuration data that implements a verification agent;
configuring a memory integrated on the chip with program code;
executing the code by a processor integrated on the chip, and initiating the programmable verification agent by the processor in response to execution of the code;
applying a stimulus signal from the verification agent to a module under test implemented on the chip;
generating a result signal by the module under test in response to the stimulus signal; and
comparing the result signal from the module under test to an expected result value.
22. The method of claim 21, further comprising configuring the field programmable gate array with configuration data that implements the module under test.
23. The method of claim 21, wherein the module under test is integrated on the chip as application-specific integrated circuitry.
24. The method of claim 21, wherein the module under test is an on-chip memory controller.
25. The method of claim 21, further comprising configuring the field programmable gate array with configuration data that implements a first bus and a second bus, the first bus adapted to couple the verification agent to the processor, and the second bus adapted to couple the module under test to the processor.
26. The method of claim 21, further comprising:
establishing a memory map in the memory by the processor in response to execution of the code; and
communicating between the processor and the verification agent via the memory map.
27. The method of claim 21, further comprising:
configuring the field programmable gate array with configuration data that implements a plurality of testing modules and an address decoder;
providing an address from the processor to the address decoder decoding the address by the address decoder, and enabling one of the plurality of testing modules in response to the address; and
generating the stimulus signal by the enabled one of the plurality of testing modules.
Patent Citations (75)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4758985(A) | 1988-07-01 | Carter | Applicant |
| US4855669(A) | 1989-08-01 | Mahoney | Applicant |
| US5072418(A) | 1991-12-01 | Boutaud et al. | Applicant |
| US5142625(A) | 1992-08-01 | Nakai | Applicant |
| USRE34363(E) | 1993-08-01 | Freeman | Applicant |
| US5274570(A) | 1993-12-01 | Izumi et al. | Applicant |
| US5311114(A) | 1994-05-01 | Sambamurthy et al. | Applicant |
| US5339262(A) | 1994-08-01 | Rostoker et al. | Applicant |
| US5347181(A) | 1994-09-01 | Ashby et al. | Applicant |
| US5361373(A) | 1994-11-01 | Gilson | Applicant |
| US5457410(A) | 1995-10-01 | Ting | Applicant |
| US5473267(A) | 1995-12-01 | Stansfield | Applicant |
| US5500943(A) | 1996-03-01 | Ho et al. | Applicant |
| US5504738(A) | 1996-04-01 | Sambamurthy et al. | Applicant |
| US5537601(A) | 1996-07-01 | Kimura et al. | Applicant |
| US5543640(A) | 1996-08-01 | Sutherland et al. | Applicant |
| US5550782(A) | 1996-08-01 | Cliff et al. | Applicant |
| US5552722(A) | 1996-09-01 | Kean | Applicant |
| US5574930(A) | 1996-11-01 | Halverson, Jr. et al. | Applicant |
| US5574942(A) | 1996-11-01 | Colwell et al. | Applicant |
| US5581745(A) | 1996-12-01 | Muraoka et al. | Applicant |
| US5600845(A) | 1997-02-01 | Gilson | Applicant |
| US5652904(A) | 1997-07-01 | Trimberger | Applicant |
| US5671355(A) | 1997-09-01 | Collins | Applicant |
| US5705938(A) | 1998-01-01 | Kean | Applicant |
| US5732250(A) | 1998-03-01 | Bates et al. | Applicant |
| US5737631(A) | 1998-04-01 | Trimberger | Applicant |
| US5740404(A) | 1998-04-01 | Baji | Applicant |
| US5742179(A) | 1998-04-01 | Sasaki | Applicant |
| US5742180(A) | 1998-04-01 | DeHon et al. | Applicant |
| US5748979(A) | 1998-05-01 | Trimberger | Applicant |
| US5752035(A) | 1998-05-01 | Trimberger | Applicant |
| US5760607(A) | 1998-06-01 | Leeds et al. | Applicant |
| US5809517(A) | 1998-09-01 | Shimura | Applicant |
| US5835405(A) | 1998-11-01 | Tsui et al. | Applicant |
| US5874834(A) | 1999-02-01 | New | Applicant |
| US5889788(A) | 1999-03-01 | Pressly et al. | Applicant |
| US5892961(A) | 1999-04-01 | Trimberger | Applicant |
| US5914616(A) | 1999-06-01 | Young et al. | Applicant |
| US5914902(A) | 1999-06-01 | Lawrence et al. | Applicant |
| US5933023(A) | 1999-08-01 | Young | Applicant |
| US5970254(A) | 1999-10-01 | Cooke et al. | Applicant |
| US6011407(A) | 2000-01-01 | New | Applicant |
| US6020755(A) | 2000-02-01 | Andrews et al. | Applicant |
| US6026481(A) | 2000-02-01 | New et al. | Applicant |
| US6096091(A) | 2000-08-01 | Hartmann | Applicant |
| US6108806(A) | 2000-08-01 | Abramovici et al. | Examiner |
| US6154051(A) | 2000-11-01 | Nguyen et al. | Applicant |
| US6163166(A) | 2000-12-01 | Bielby et al. | Applicant |
| US6172990(B1) | 2001-01-01 | Deb et al. | Applicant |
| US6178533(B1) | 2001-01-01 | Chang | Examiner |
| US6178541(B1) | 2001-01-01 | Joly et al. | Applicant |
| US6181163(B1) | 2001-01-01 | Agrawal et al. | Applicant |
| US6211697(B1) | 2001-04-01 | Lien et al. | Applicant |
| US6247151(B1) | 2001-06-01 | Poisner | Examiner |
| US6272451(B1) | 2001-08-01 | Mason et al. | Applicant |
| US6272588(B1) | 2001-08-01 | Johnston et al. | Examiner |
| US6279045(B1) | 2001-08-01 | Muthujumaraswathy et al. | Applicant |
| US6282627(B1) | 2001-08-01 | Wong et al. | Applicant |
| US6301696(B1) | 2001-10-01 | Lien et al. | Applicant |
| US6343207(B1) | 2002-01-01 | Hessel et al. | Applicant |
| US6356987(B1) | 2002-03-01 | Aulas | Applicant |
| US6389558(B1) | 2002-05-01 | Herrmann et al. | Applicant |
| US6412046(B1) | 2002-06-01 | Sharma et al. | Examiner |
| US6467009(B1) | 2002-10-01 | Winegarden et al. | Applicant |
| US6483342(B2) | 2002-11-01 | Britton et al. | Applicant |
| US6578174(B2) | 2003-06-01 | Zizzo | Applicant |
| US6604228(B1) | 2003-08-01 | Patel et al. | Applicant |
| US6615167(B1) | 2003-09-01 | Devins et al. | Examiner |
| US2001/0049813(A1) | 2001-12-01 | Chan et al. | Applicant |
| US2003/0009712(A1) | 2003-01-01 | Lukanc | Examiner |
| EP315275(A2) | 1989-10-01 | Applicant | |
| EP905906(A2) | 1999-03-01 | Applicant | |
| EP1235351(A1) | 2002-08-01 | Applicant | |
| WO9325968(A1) | 1993-12-01 | Applicant |
Non-Patent Literature (31)
- Sayfe Kiaei et al., “VLSI Design of Dynamically Reconfigurable Array Processor-DRAP,” IEEE, Feb. 1989, pp. 2484-2486, 2488, V3.6, IEEE, 3 Park Avenue, 17th Floor, New York, NY 10016-5997.Applicant
- Vason P. Srini, “Field Programmable Gate Array (FPGA) Implementation of Digital Systems: An Alternative to ASIC,” IEEE, May 1991, pp. 309-311, 313, IEEE, 3 Park Avenue, 17th Floor, New York, NY 10016-5997.Applicant
- G. Maki et al., “A Reconfigurable Data Path Processor,” IEEE, Aug. 1991, pp. 18-4.1 and 18-4.3 IEEE, 3 Park Avenue, 17th Floor, New York, NY 10016-5997.Applicant
- Jacob Davidson, “FPGA Implementation of Reconfigurable Microprocessor,” IEEE, Mar. 1993, pp. 3.2.1-3.2.3 IEEE, 3 Park Avenue, 17th Floor, New York, NY 10016-5997.Applicant
- Christian Iseli et al. “Beyond Superscaler Using FPGA's,” IEEE, Apr. 1993, pp. 486-488, 490, IEEE, 3 Park Avenue, 17th floor, New York, NY 10016-5997.Applicant
- P.C. French et al., “A Self-Reconfiguring Processor,”; IEEE, Jul. 1993, pp. 50-59, IEEE, 3 Park Avenue, 17th Floor, New York, NY 10016-5997.Applicant
- Christian Iseli et al., “Spyder: A Reconfigurable VLIW Processor Using FPGA's,” IEEE, Jul. 1993, pp. 17-24, IEEE, 3 Park Avenue, 17th Floor, New York, NY 10016-5997.Applicant
- Michael I. Wirthlin et al., “The Nano Processor: A Low Resource Reconfigurable Processor,” IEEE, Feb. 1994, pp. 23-30, IEEE, 3 Park Avenue, 17th Floor, New York, NY 10016-5997.Applicant
- William S. Carter “The Future of Programmable Logic and Its Impact on Digital System Design,” Apr. 1994, IEEE, pp. 10-16, IEEE, 3 Park Avenue, 17th Floor, New York, NY 10016-5997.Applicant
- Andre′ Dehon, “DPGA-Coupled Microprocessor: Commodity ICs for the Early 21st Century,” IEEE, Feb. 1994, pp. 31-39, IEEE, 3 Park Avenue, 17th Floor, New York, NY 10016-5997.Applicant
- Osama T. Albaharna, “Area & Time Limitations of FPGA-Based Virtual Hardware,” IEEE, Apr. 1994, pp. 184-185, 186, 187, 188, 189, IEEE, 3 Park Avenue, 17th Floor, New York, NY 10016-5997.Applicant
- Xilinx, Inc., “The Programmable Logic Data Book,” 1994, Revised 1995, Xilinx, Inc., 2100 Logic Drive, San Jose, CA. 95124, 17 pages.Applicant
- Xilinx, Inc., “The Prgrammable Logic Data Book,” 1994, revised 1995, pp 2-109 to 2-117, Xilinx, Inc., 2100 Logic Drive, San Jose, CA. 95124.Applicant
- Xilinx, Inc., “The Programmable Logic Data Book,” 1994, Revised 1995, pp 2-9 to 2-18; 2-187 to 2-199, Xilinx Inc., 2100 Logic Drive, San Jose, CA. 95124.Applicant
- Xilinx, Inc. “The Programmable Logic Data Book,” 1994, Revised 1995, pp 2-107 to 2-108, Xilinx, Inc., 2100 Logic Drive, San Jose, CA. 95124.Applicant
- Christian Iseli et al., “AC++ Compiler For FPGA Custom Execution Units Synthesis,” 1995, pp. 179-179, IEEE, 3 PARK Avenue, 17th Floor, New York, NY 10016-5997.Applicant
- International Business Machines “POWERPC 405 Embedded Processor Core User Manual,” 1996, 5TH Ed., pp. 1-1 TO X-16, International Business Machines, 1580 rout 52, Bldg. 504 Hopewell Junction, NY 12533-6531, no month.Applicant
- Yamin Li et al., “AIZUP-A Pipelined Processor Design & Implementation on Xilinx FPGA Chip,” IEEE, Sep. 1996, pp 98-106, 98-106, IEEE, 3 Park Avenue, 17th Floor New York, NY 10016-5997.Applicant
- Ralph D. Wittig et al., ONECHIP: An FPGA Processor With Reconfigurable Logic, Apr 17, 1996, pp 126-135, IEEE, 3 Park Avenue, 17th Floor, New York, NY 10016-5997.Applicant
- Xilinx, Inc., “The Programmable Logic Data Book,” Jan. 27, 1999, Ch. 3, pp 3-1 TO 3-50, Xilinx, Inc., 2100 Logic Drive, San Jose, CA 95124.Applicant
- William B. Andrew et al., “A Field Programmable System Chip Which Combines FPGA & ASIC Circuitry,” IEEE, May 16, 1999, pp. 183-186, IEEE, 3 Park Avenue, 17th Floor, New York, NY 10016-5997.Applicant
- Xilinx Inc., “The Programmable Logic Data Book,” 2000, Ch. 3 pp 3-1 TO 3-117, Xilinx, Inc., 2100 Logic Drive, San Jose, CA 95124, no month.Applicant
- Xilinx, Inc., “The Programmable Logic Data Book,” 2000, Ch 3, pp 3-7 TO 3-17; 3-76 TO 3-87, Xilinx, Inc., 2100 Logic Drive, San Jose, CA. 95124.Applicant
- International Business Machines, “Processor Local Bus”Architecture Specifications, 32-Bit Implementation, Apr. 2000, First Edition, V2.9, pp. 1-76, IBM Corporation, Department H83A, P.O. Box 12195, Research Triangle Park, NC 27709.Applicant
- Xilinx, Inc., Virtex II Platform FPGA Handbook, Dec. 6, 2000, v1.1, pp 33-75, Xilinx, Inc., 2100 Logic Drive, San Jose, CA. 95124.Applicant
- Cary D. Snyder et al., “Xilinx'S A-TO-Z System Platform,” Cahners Microprocessor Report, Feb. 26, 2001, pp 1-5, Microdesign Resources, www.MDRonline.com, 408-328-3900.Applicant
- U.S. Appl. No. 09/968,446, filed Sep. 28, 2001, Douglass et al.Applicant
- U.S. Appl. No. 09/991,410, filed Nov. 16, 2001, Herron et al.Applicant
- U.S. Appl. No. 09/991,412, filed Nov. 16, 2001, Herron et al.Applicant
- U.S. Appl. No. 10/001,871, filed Nov. 19, 2001, Douglass et al.Applicant
- U.S. Appl. No. 10/043,769, filed Jan. 9, 2002, Schulz.Applicant