1. Field of the System
The present system relates to field programmable gate array (FPGA) devices. More specifically, the system relates to a parallel-programmable antifuse FPGA and a method for programming a parallel-programmable antifuse FPGA.
2. Background
FPGAs are known in the art. An FPGA comprises any number of logic modules, an interconnect routing architecture and programmable elements that may be programmed to selectively interconnect the logic modules to one another and to define the functions of the logic modules. To implement a particular circuit function, the circuit is mapped into an array and the wiring channels appropriate connections are programmed to implement the necessary wiring connections that form the user circuit.
A field programmable gate array circuit can be programmed to implement virtually any set of functions. Input signals are processed by the programmed circuit to produce the desired set of outputs. Such inputs flow from a user's system, through input buffers and through the circuit, and finally back out the user's system via output buffers. Such buffers may provide any or all of the following input/output (I/O) functions: voltage gain, current gain, level translation, delay, signal isolation or hysteresis.
An FPGA core tile may be employed as a stand-alone FPGA, repeated in a rectangular array of core tiles, or included with other devices in a system-on-a-chip (SOC). The core FPGA tile may include an array of logic modules, and input/output modules. Horizontal and vertical routing channels provide interconnections between the logic modules and the I/O modules. Programmable connections are provided by programmable elements between the routing resources.
The programmable elements in an FPGA can be either one-time programmable or re-programmable. Re-programmable elements used in FPGA technologies may comprise transistors or other re-programmable elements as is well known to those of ordinary skill in the art. One-time programmable elements used in FPGA technologies may comprise antifuse devices.
Antifuse devices are well known in the integrated circuit art. Antifuse devices comprise a pair of conductive electrodes separated by at least one layer of antifuse material and may include one or more diffusion barrier layers. Prior to programming, antifuses exhibit very high resistance between the two electrodes and may be considered to be open circuits. A programming process disrupts the antifuse material and creates a low-impedance connection between the two conductive electrodes.
The antifuses in an antifuse FPGA are programmed one antifuse at a time. There are two components considered when computing total programming time in an antifuse FPGA—overhead time (Toh) and fuse time (Tfuse). Overhead time is the time required for a computer system to set a programming environment that includes reading data from a computer disk, compiling the data, translating the data to a bit stream readable by the computer and loading the bit stream into a long shift register (LSR). The LSR is the main mechanism to setup a program/test environment in an antifuse FPGA.
Fuse time is the time it takes to program an individual antifuse. Fuse time is usually an average based on the total number of antifuses being programmed since each antifuse may have a slightly different programming time. The total time entailed in programming an antifuse FPGA is the overhead time plus the sum of the fuse times as set forth in the equation below.
Ttotal=Toh+ΣTfuse
In an antifuse FPGA, the antifuses in the FPGA are programmed one at time. As the size of the FPGA increases, the number of antifuses becomes much greater and the programming time increases. Hence, there is a need for an antifuse FPGA with a shorter programming time. Thus, there is also a need for an antifuse FPGA in which the antifuses to be programmed can be concurrently programmed.
The present invention comprises an FPGA having a plurality of logic modules with programmable elements. The logic modules are partitioned into a plurality of individually programmable groups and an isolation device may be coupled between the individually programmable groups of logic modules such that each of the programmable elements in each of the plurality of individually programmable logic modules may be programmed simultaneously.
The present invention also comprises a method of programming a plurality of tiles in an FPGA comprising loading the address data identifying which antifuses in tiles 1 through N are to be programmed. Next, from the loaded address data, one antifuse is selected in each of tiles 1 through N that need to be programmed. Then, the selected antifuses in each of the tiles 1 through N are programmed. Next, it is determined whether all the antifuses in tiles 1 through N are programmed. If all the antifuses in tiles 1 through N are not programmed, the software module selects from the loaded addresses the next one antifuse in each tile 1 through N that needs to be programmed. Finally, if all the antifuses are programmed in tiles 1 through N, the program ends.
A better understanding of the features and advantages of the present invention will be obtained by reference to the following detailed description of the invention and accompanying drawings which set forth an illustrative embodiment in which the principles of the invention are utilized.
Those of ordinary skill in the art will realize that the following description of the present system is illustrative only and not in any way limiting. Other embodiments will readily suggest themselves to such skilled persons having the benefit of this disclosure.
Similar designations used herein are intended to designate substantially similar matter.
Referring to
Referring still to
Isolation devices 186 and 188 can be implemented in several different ways.
As stated above, during programming, each tile can be treated as a separate device, allowing the programming of one antifuse in each tile concurrently, instead of consecutively, and providing a much faster programming environment. In each tile of the FPGA device, the tile level or local control signals are controlled by a bit pattern loaded into a tile mode register. Registers, which store data temporarily, are well known to those skilled in the art and will not be discussed herein in order to avoid complicating and obscuring the present disclosure. All tile mode registers in an antifuse FPGA of the present system can be loaded with different bit-patterns to produce different circuits. Alternatively, all tile mode registers may be loaded with the same bit-pattern with “broadcast mode.” Broadcast mode is very practical for the testing of an unprogrammed antifuse FPGA, so that all tile level controls are set to act the same way, and thus produce the same value.
The LSR bits belonging to any of the six peripheries as a group can be skipped by setting the appropriate values of the “skip” controls. For example, when all skip controls are set to “1”, all the LSR bits of the tile will be skipped. The “skip” function can be used for one or multiple peripheries. Partial skip is useful when a portion of the fuse address bit is the same. Skipping the whole tile is useful when debugging during a circuit failure.
An antifuse FPGA may contain a global mode register. Global mode registers are well known to those skilled in the art and will not be discussed herein in order to avoid complicating the present disclosure. The bit pattern loaded into a global mode register of an antifuse FPGA of the present system sets the chip level controls.
The broadcast mode is enabled when the “DRBCT” bit in the global mode register is set. When the broadcast mode is enabled, the same pattern is loaded into all tile level tile mode registers and LSRs. This function is useful for testing unprogrammed FPGAs and allows for parallel testing of all tiles in a chip simultaneously.
To facilitate parallel programming, there are separate external programming voltage power supply pins, Vpp pins, for each tile. During programming, Vpp is set at 5 volts and capable of sourcing more than 20 mA. During testing and normal operation, the voltage is lowered to Vcc (2.55-3.3V), the operating voltage. When the GMR control signal is set to “VPPHH”, all the internal Vpp pins are tied together for parallel testing.
Each tile may also include a single bit mask register. Mask registers are well known to those skilled in the art and will not be discussed herein in order to avoid complicating the present disclosure. When the mask register bit is set, the Vpp voltage is applied to all FBP in each tile and Vpp/2 is applied to all other antifuses in the FPGA. When the mask register bit is reset, it prevents the Vpp pulse from reaching the FBP so that the FBPs in each tile are not being reprogrammed. As set forth in greater detail below, when parallel programming an antifuse FPGA, for a given group of tiles, one antifuse per tile may be programmed at the same time.
In another embodiment, the present invention may be applied to an antifuse-based memory array. In this embodiment, the memory array is divided into individually programmable groups and then isolation devices are inserted in the circuit between the individually programmable memory array modules.
Also disclosed is a method of programming the present system.
Next, from the loaded address data, the software module selects one antifuse in each of tiles 1 through N that needs to be programmed at act 352. Next, at act 354, the software module programs the selected antifuses concurrently in each of the tiles 1 through N. Next, at query 356 it is determined from the loaded address data whether all the antifuses that need to be programmed in tiles 1 through N have been programmed. If all the antifuses designated for programming in tiles 1 through N are not programmed, the software module returns to act 352 and selects from the loaded addresses the next one antifuse in each tile 1 through N that needs to be programmed. As one skilled in the art having the benefit of this disclosure will realize, not all tiles will have the same number of fuses to be programmed. For example, tile 1 may have one hundred fuses to be programmed while tile two may have one hundred and fifty antifuses to be programmed. Thus, not all tiles will have antifuses to be programmed during the entire parallel programming process. Finally, if all the antifuses designated for programming have been programmed in tiles 1 through N, the program ends at act 358.
At act 404, from the loaded address data the software module selects one antifuse whose mask bits are set in each of tiles 1 through N to be programmed. Next, at act 406, the software module programs the selected antifuses concurrently in tiles 1 through N. At query 408, the software module determines whether the selected antifuses in each of tiles 1 through N have been programmed. If the selected antifuse has not been completely programmed, the software module continues to program the selected antifuse at act 410. At act 412, the software module resets the mask register bit while simultaneously soaking the previously selected antifuses in tiles 1 through N. At query 414, the software module determines whether all antifuses designated for programming have been programmed. As one skilled in the art having the benefit of this disclosure will realize, not all tiles will have the same number of fuses to be programmed. For example, tile 1 may have one hundred fuses to be programmed while tile two may have one hundred and fifty antifuses to be programmed. Thus, not all tiles will have antifuses to be programmed during the entire parallel programming process.
If all the antifuses in tiles 1 through N are not programmed, the software module returns to act 352 and selects from the loaded addresses the next one antifuse in each tile 1 through N that needs to be programmed. Finally, if all the antifuses designated for programming have been programmed in tiles 1 through N, the program ends at act 358.
In another embodiment, the above method of programming may be applied to antifuse memory arrays using the same steps as set forth above applicable to logic arrays.
While embodiments and applications of this system have been shown and described, it would be apparent to those skilled in the art that many more modifications than mentioned above are possible without departing from the inventive concepts herein. The system, therefore, is not to be restricted except in the spirit of the appended claims.
This application claims priority to co-pending U.S. patent application Ser. No. 11/532,757, filed Sep. 18, 2006, which is a continuation of U.S. patent application Ser. No. 10/833,608, filed Apr. 27, 2004, now issued as U.S. Pat. No. 7,111,272, which is a divisional of U.S. patent application Ser. No. 10/267,917, filed Oct. 8, 2002, now issued as U.S. Pat. No. 6,885,218, which are hereby incorporated by reference as if set forth herein.
Number | Date | Country | |
---|---|---|---|
Parent | 10267917 | Oct 2002 | US |
Child | 10833608 | Apr 2004 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11532757 | Sep 2006 | US |
Child | 11837700 | Aug 2007 | US |
Parent | 10833608 | Apr 2004 | US |
Child | 11532757 | Sep 2006 | US |