US 6,513,077 B2Grant
I/O and memory bus system for DFPs and units with two- or multi-dimensional programmable cell architectures
Issue Date:2003-01-28
•19 Claims
•19 Drawing Sheets
Abstract
A general bus system is provided which combines a number of internal lines and leads them as a bundle to the terminals. The bus system control is predefined and does not require any influence by the programmer. Any number of memories, peripherals or other units can be connected to the bus system (for cascading).
Metadata
Assignee
- PACT GmbH
Inventors
- Martin Vorbach
- Robert Münch
Application Information
Application Number:US 09/915,213
Filing Date:2001-07-25
Priority Date:1996-12-20
Art Unit:7
Classifications
IPC:
G06F 1300G06F 1340G06F 1580
Field of Search:
710100710300710 8710 72710305712 11712 14712 18716 17716 16326 38326 39326 41439 68
Patent Drawings (19 sheets)
Description
[0002] This application is a continuation of U.S. patent application Ser. No. 09/335,974 filed Jun. 18,1999, now U.S. Pat. No. 6,338,106 which is a continuation of International Patent Application PCT/DE97/03013 filed on Dec. 21, 1997 and a continuation-in-part of U.S. patent application Ser. No. 08/947,254 filed on Oct. 8, 1997, now U.S. Pat. No. 6,119,181.
BACKGROUND INFORMATION
[0003] DFP-based Systems
[0004] German Patent No. DE 44 16 881 describes data flow processors (DFPs) in which lines of each edge cell, i.e., a cell at the edge of a cell array often in direct contact with the terminals of the unit, lead outward via the terminals of the unit. The lines do not have any specific function. Instead, the lines assume the function that is written into the edge cells. Several DFPs may be interconnected to form a matrix by connecting all terminals.
[0005] Systems with Two- or Multi-dimensional Programmable Cell Architectures:
[0006] In systems with two- or multi-dimensional programmable cell architectures, such as field programmable gate arrays (FPGAs) and dynamically programmable gate arrays (DPGAs), a certain subset of internal bus systems and lines of the edge cells are connected to the outside via the unit terminals. The lines do not have any specific function, and instead they assume the function written in the edge cells. If several FPGAs/DPGAs are interconnected, the terminals assume the function implemented in the hardware or software.
Problems
[0007] DFP-based Systems
[0008] The wiring complexity for peripherals or for interconnecting DFPs is very high, because the programmer must also ensure that the respective functions are integrated into the cells of the DFP(s). For connecting a memory, a memory management unit must be integrated into the unit. For connecting peripherals, the peripherals must be supported. Additionally, cascading of DFPs must be similarly taken into account. This is relatively complicated. Moreover, space in the unit is lost for the respective implementations.
[0009] Systems with two- or multi-dimensional programmable cell architectures (FPGAs, DPGAs): The above also applies to FPGAs and DPGAs, in particular when the FPGAs and DPGAs implement algorithms or operate as arithmetic (co)processors.
SUMMARY
[0010] In accordance with an example embodiment of the present invention, the expense of wiring, in particular the number of unit terminals required, is greatly reduced. A uniform bus system operates without any special consideration by a programmer. A permanent implementation of the bus system control is provided. Memory and peripherals can be connected to the bus system without any special measures. Likewise, units can be cascaded with the help of the bus system.
[0011] According to the present invention, a general bus system is provided which combines a number of internal lines and leads them as a bundle to the terminals. The bus system control is predefined and does not require any influence by the programmer. Any number of memory devices, peripherals or other units (i.e., cascading) can be connected to the bus system.
BRIEF DESCRIPTION OF THE DRAWINGS
[0012] FIG. 1 shows an example of a basic unit as a type A FPGA.
[0013] FIG. 2 shows an example of a basic unit as a type B FPGA.
[0014] FIG. 3 shows an example of a basic unit as a DFP.
[0015] FIGS. 4aand 4bshow an example of line bundling in FPGAs according to an example embodiment of the present invention.
[0016] FIG. 5 shows an example of line bundling in DFPs according to an example embodiment of the present invention.
[0017] FIG. 6 shows an example of an OUTPUT CELL according to an example embodiment of the present invention.
[0018] FIG. 7 shows an example of an INPUT CELL according to an example embodiment of the present invention.
[0019] FIG. 8 shows an example of address generation in accordance with an example embodiment of the present invention.
[0020] FIGS. 9aand 9bshow an example of a complete bus system with controller according to an example embodiment of the present invention.
[0021] FIGS. 10a-gshow an example of a connection of memories and peripherals in accordance with an example embodiment of the present invention.
[0022] FIG. 11 shows an example of an EB-REG in accordance with an example embodiment of the present invention.
[0023] FIG. 12 shows an example embodiment of the present invention using a RAMBUS.
[0024] FIG. 13 shows an example implementation of an IO and memory bus system according to the present invention.
[0025] FIG. 14 shows an example Bus IO according to the present invention.
[0026] FIG. 15ashows an example address generator according to the present invention.
[0027] FIG. 15bshows another example address generator according to the present invention, generating end-of-data identification.
[0028] FIG. 15cshows an example function sequence with the address generator with end-of-data identification according to the present invention.
[0029] FIG. 16 shows an interaction of two segments in indirect addressing according to an example embodiment of the present invention.
[0030] FIG. 17 shows an example state machine for indirect addressing according to the present invention.
DETAILED DESCRIPTION
[0031] The following description encompasses several architectures which are controlled and configured by a primary logic unit, such as DiPs, FPGAs, DPGAs, etc. Parts of the primary logic unit may be integrated on the unit. Alternatively, the architectures may be dynamically controlled or reconfigured directly through the unit itself (see, e.g., FIGS. 6, 7). The architectures may be implemented in a permanent form on the unit, or they may be created by configuring and possibly combining multiple logic cells, i.e., configurable cells which fulfill simple logical or arithmetic functions according to their configuration (cf. DFP, FPGA, DPGA).
[0032] Bundling Internal Lines
[0033] In accordance with the example embodiment of the present invention, to obtain appropriate bus architectures, a plurality of internal lines are combined in buses (I-BUSn, where n denotes the number of the bus). The lines may be internal bus systems or lines of the edge cells. For write access to the external bus (E-Bus) over clocked latches or registers (I-GATE-REG), the individual buses are connected to gates that function as switches to the E-BUS. Such a unit is called an OUTPUT CELL. Access to the E-BUS takes place in such a way that the individual latches are switched via the gates to the common E-BUS. There is always only one gate open. Each I-BUSn has a unique identification number (n: e.g., I-BUS1, I-BUS976, etc.).
[0034] For read access, the incoming A-BUS is stored temporarily in clocked latches or registers (E-GATE-REG) and then distributed over the gates to the I-BUSn. Such a unit is called an INPUT CELL. Pick up from the E-BUS takes place in such a way that an E-BUS transfer is written into one or more E-GATE-REGs. The E-GATE-REGs can then be switched either individually or together to their internal bus systems.
[0035] Read-write access can take place in any order. Under some circumstances, the internal buses I-BUSn may be subdivided into two groups, e.g., writing output buses IO-BUSn and reading input buses II-BUSn.
[0036] Address Generation
[0037] For most accesses to external units, addresses are generated for selecting a unit or parts of a unit. The addresses may be permanent, i.e., they do not change (this is the case especially with peripheral addresses) or the addresses may change by (usually) fixed values with each access (this is the case especially with memory addresses). For generating the addresses, there are programmable counters for read access and programmable counters for write access. The counters are set at a base value by the PLU, which is the unit that configures the configurable units (DFPs, FPGAs, DPGAs, etc.) based on cell architecture. With each access to the gate, the counter is incremented or decremented by a value defined by the PLU, depending on the setting. Likewise, each counter can also be used as a register, which means that counting is not performed with each access, and the value set in the counter is unchanged. The value of the counter belonging to the gate is assigned as an address to each bus transfer. The counter is set by a setting register (MODE PLUREG) to which the PLU has write access.
[0038] Masks and States
[0039] Each gate is assigned a number of bits in MODE PLUREG (described below). The bits indicate whether the gate is active or is skipped by the controller, i.e., is masked out (MASK). If a gate is masked out, the gate is skipped in running through all gates to connect to the respective bus system.
[0040] The following mask records are examples of possible mask records:
[0041] always skip the INPUT/OUTPUT CELL,
[0042] skip the INPUT/OUTPUT CELL only in writing,
[0043] skip the INPUT/OUTPUT CELL only in reading if the E-BUS MASTER has not accessed the INPUT/OUTPUT CELL,
[0044] never skip the INPUT/OUTPUT CELL.
[0045] Each gate is assigned a state register which may be designed as an RS flip-flop. This register indicates whether data have been written into the register belonging to the gate.
[0046] MODE PLUREG
[0047] The MODE PLUREG can be written and read by the PLU. It serves to set the bus system.
[0048] One possible MODE PLUREG architecture from the standpoint of PLU is set forth below:
| Bit 1-m | Bit k-1 | Bit 2-k | Bit 1 | Bit 0 |
|---|---|---|---|---|
| Mask | Predefined | step | 0 = additive | 0 = register |
| value | length | counting | ||
| 1 = subtractive | 1 = counter | |||
| counting |
[0049] Description of the INPUT CELL
[0050] A distinction is made according to whether data is transmitted from the E-BUS to the unit (the component used for this is called the INPUT CELL) or whether data is transmitted from the unit to the E-BUS (the component used for this is called an OUTPUT CELL).
[0051] An example embodiment of the INPUT CELL is as follows. A latch (I-GATE-REG) which is controlled either by the external E-BUS MASTER or the internal state machine serves as a buffer for the data received from the E-BUS. The clock pulse of the latch is sent to (for example) an RS flip-flop (SET-REG) which retains access to the I-GATE-REG. Downstream from the I-GATE-REG is a gate (I-GATE) which is controlled by the state machine. The data goes from the I-GATE-REG to the I(I)-BUSn via the I-GATE.
[0052] In addition the example embodiment, there is a programmable incrementer/decrementer in the INPUT CELL. The programmable incrementer/decrementer can be controlled by the state machine after each active read access to the E-BUS to increment or decrement an adjustable value. It can also serve as a simple register.
[0053] This counter generates the addresses for bus access where the unit is E-BUS MASTER. The addresses are sent to the E-BUS via a gate (ADR-GATE). The ADR-REG is controlled by the state machine.
[0054] The E-BUS MASTER can poll the state of the SET-REG via another gate (STATE-GATE). Each INPUT CELL has a MODE PLUREG in which the PLU configures the counter and turns the INPUT CELL on or off (masks it).
[0055] Description of the OUTPUT CELL
[0056] An example embodiment of an OUTPUT CELL is as follows. A latch (E-GATE-REG) which is controlled by the internal state machine provides buffer storage for the data obtained from the I-BUS.
[0057] In addition, a programmable incrementer/decrementer is provided in the OUTPUT CELL. The clock signal of the latch is sent to (for example) an RS flip-flop (SET-REG) which retains access to the E-GATE-REG. The programmable incrementer/decrementer can be controlled by the state machine after each read access to the E-BUS to increment or decrement an selectable value. It can also function as a simple register. This counter generates the addresses for bus access in which the unit is E-BUS MASTER.
[0058] The data of the E-GATE-REG, the addresses and the state of the SET-REG are sent to the E-BUS via a gate (E-GATE) which is controlled either by the external E-BUS MASTER or the internal state machine. Each OUTPUT CELL has a MODE PLUREG in which the PLU configures the counter and turns the OUTPUT CELL on and off (masks it).
[0059] Controlling the Bus System
[0060] At a higher level than the individual gates, address generators and masks, in the example embodiment of the present invention, there is a controller consisting of a simple, conventional state machine. Two operating modes are differentiated:
[0061] 1. An active mode in which the state machine controls the internal bus (I-BUS) and the external u-s (E-BUS). This mode is called E-BUS MASTER because the state machine has control of the E-BUS.
[0062] 2. A passive mode in which the state machine controls only the internal bus (I-BUS). The E-BUS is controlled by another external unit. The state machine reacts in this mode to the requirements of the external E-BUS MASTER. This mode of operation is called E-BUS SLAVE.
[0063] The controller manages the E-BUS protocol. The sequence differs according to whether the controller is functioning in E-BUS MASTER or E-BUS SLAVE mode. A particular protocol is not described herein, because any one of a number of conventional protocols may be implemented.
[0064] E-BUS MASTER and E-BUS SLAVE, EB-REG
[0065] In the example embodiment, the E-BUS control register (EB-REG) is provided to manage the data traffic on the E-BUS. The E-BUS control register is connected in series with the gates and can be addressed and operated from the E-BUS. The data exchange may be regulated through the following records:
[0066] I-WRITE: indicates that the I-BUS is written completely into the INPUT/OUTPUT CELLS,
[0067] I-READ: indicates that the I-BUS has completely read the INPUT/OUTPUT CELLS,
[0068] E-WRITE: indicates that the E-BUS has been written completely into the INPUT/OUTPUT CELLs,
[0069] E-READ: indicates that the E-BUS has completely read the INPUT/OUTPUT CELLs.
[0070] In the example embodiment, the EB-REG is always active only on the side of the E-BUS SLAVE, and the E-BUS MASTER has read-write access to it.
[0071] All I- . . . records are written by E-BUS SLAVE and read by E-BUS MASTER.
[0072] All E- . . . records are written by E-BUS MASTER and read by E-BUS SLAVE.
[0073] An E-BUS SLAVE can request control of the E-BUS by setting the REQ MASTER bit in its EB-REG. If the E-BUS MASTER recognizes the REQ MASTER bit, it relinquishes the bus control as soon as possible. The E-BUS MASTER relinquishes the bus control by setting the MASTER bit in the EB-REG of an E-BUS SLAVF. The E-BUS MASTER then immediately switches the E-BUS to passive mode. The old E-BUS SLAVE becomes the new E-BUS MASTER, and the old E-BUS MASTER becomes the new E-BUS SLAVE. The new E-BUS MASTER assumes control of the E-BUS. To recognize the first E-BUS MASTER after a RESET of the system, there is a terminal on each unit which indicates by the preset polarity whether the unit is B-BUS MASTER or E-BUS SLAVE after a RESET. The MASTER record in the EB-REG can also be set and reset by the PLU. In the example embodiment, the PLU must be sure that there are no bus collisions on the EB-BUS and that no ongoing transfers are interrupted.
[0074] E-BUS MASTER Writes Data to E-BUS SLAVE
[0075] In the example embodiment of the present invention, the E-BUS MASTER can write data to the E-BUS SLAVE as follows:
[0076] The data transfer begins when the state machine of the E-BUS MASTER selects an OUTPUT CELL that is not masked out.
[0077] Data has already been stored in the I-GATE REG, depending on the design of the state machine, or the
[0078] data is stored now.
[0079] The gate is activated.
[0080] The valid read address is transferred to the bus.
[0081] The data goes to the E-BUS and is stored in the E-GATE REG of the E-BUS SLAVE.
[0082] The SET-REG in the E-BUS SLAVE is thus activated.
[0083] The gate in the E-BUS MASTER is deactivated.
[0084] The address counter generates the address for the next access.
[0085] The transfer is terminated for the E-BUS MASTER.
[0086] There are two possible embodiments of the E-BUS SLAVE for transferring data from the bus to the unit:
[0087] 1. The data gate is always open and the data goes directly from the E-GATE-REG to the I-BUSn.
[0088] 2. The state machine recognizes that SET-REG is activated, and it activates the gate, so that SET-REG can be reset.
[0089] The E-BUS MASTER can notify the E-BUS SLAVE when a complete bus cycle is terminated (a bus cycle is defined as the transfer of multiple data strings to different E-GATE-REGs, where each E-GATE-REG may be addressed exactly once).
[0090] The E-BUS MASTER sets the E-WRITE bit in the EB-REG of the E-BUS SLAVE at the end of a bus cycle.
[0091] The E-BUS SLAVE can respond by polling the INPUT CELLs.
[0092] When it has polled all the INPUT CELLs, it sets the I-READ bit in its EB-REG.
[0093] It then resets E-WRITE and all the SET-REGs of the INPUT CELLS.
[0094] The E-BUS MASTER can poll I-READ and begin a new bus cycle after its activation.
[0095] I-READ is reset by E-WRITE being written or the
[0096] first bus transfer.
[0097] The E-BUS SLARVE can analyze whether the INPUT CELLs can/must be read again on the basis of the status of the ER-REG or the individual SET-REGs of the INPUT CELLs.
[0098] E-BUS MASTER Reads Data from E-BUS SLAVE:
[0099] From the standpoint of the E-BUS MASTER, there are two basic methods of reading data from the E-BUS SLAVE:
[0100] 1. Method in which the E-bUS data goes directly to the I-BUS:
[0101] The data transfer begins with the state machine of the E-BUS MASTER selecting an INPUT CELL which is not masked out.
[0102] The I-GATE and the ADR-GATE are activated.
[0103] The valid read address is transferred to the bus.
[0104] The I-GATE-REG is transparent, i.e., it allows the data through to the I-BUSn.
[0105] The gate in the E-BUS MASTER is deactivated.
[0106] The address counter generates the address for the next access.
[0107] The transfer is terminated for the E-BUS MASTER.
[0108] 2. Method in which the E-BUS data is stored temporarily in the I-GATE-REG:
[0109] The data transfer begins with the state machine of the E-BUS MASTER selecting an INPUT CELL which is not masked out.
[0110] The I-GATE and the ADR-GATE are activated.
[0111] The valid read address is transferred to the bus.
[0112] I-GATE-REG stores the data.
[0113] The gate in the E-BUS MASTER is deactivated.
[0114] The address counter generates the address for the next access.
[0115] The E-BUS transfer is terminated for the E-BUS MASTER.
[0116] All INPUT CELLS involved in the E-BUS transfer, which can be ascertained on the basis of the masks
[0117] in the MODE PLUREG or the state of the SET-REG, are run through and the data is transferred to the respective I-BUS.
[0118] For the E-BUS SLAVE, the access looks as follows:
[0119] The gate is activated by the E-BUS.
[0120] The data and the state of any SET-REG that may be present go to the E-BUS.
[0121] The gate is deactivated.
[0122] The E-BUS MASTER can notify the E-BUS SLAVE when a complete bus cycle is terminated.
[0123] To do so, at the end of a bus cycle, the E-BUS MASTER sets the E-READ bit in the EB-REG of the E-BUS SLAVE.
[0124] E-BUS SLAVE can react by writing to the OUTPUT CELLs anew.
[0125] When it has written to all the OUTPUT CELLs, it sets the I-WRITE bit in its EB-REG.
[0126] In doing so, it resets E-READ and all the SET-REGs of the OUTPUT CELLS.
[0127] The E-BUS MASTER can poll I-WRITE and begin a new bus cycle after its activation.
[0128] I-WRITE is reset by writing E-READ or the first bus transfer.
[0129] E-BUS SLAVE can evaluate on the basis of the state of the EB-REG or the individual SET-REGs of the OUTPUT CELLS whether the OUTPUT CELLs can/must be written anew.
[0130] Connection of Memory Devices and Peripherals, Cascading
[0131] In addition to cascading identical units (DFPS, FPGAS, DPGAs), memories and peripherals can also be connected as lower-level SLAVE units (SLAVE) to the bus system described here. Memories and peripherals as well as other units (DFPs, FPGAs) can be combined here. Each connected SLAVE analyzes the addresses on the bus and recognizes independently whether it has been addressed. In these modes, the unit addressing the memory or the peripheral, i.e., the SLAVE units, is the bus MASTER (MASTER), i.e., the unit controls the bus and the data transfer. The exception is intelligent peripheral units, such as SCSI controllers that can initiate and execute transfers independently and therefore are E-BUS MASTERs.
[0132] Through the method described here, bus systems can be connected easily and efficiently to DFPs and FPGAs. Both memories and peripherals as well as other units of the types mentioned above can be connected over the bus systems.
[0133] The bus system need not be implemented exclusively in DFPS, FPGAs and DPGAs. Hybrid operation of this bus system with traditional unit terminal architectures is of course possible. Thus the advantages of the respective technique can be utilized optimally.
[0134] Other sequencing methods are also possible for the bus system described here. However, they will not be detailed here because they are free embodiment options that do not depend on the basic principle described here.
DESCRIPTION OF THE FIGURES
[0135] FIG. 1 shows a conventional FPGA, where 0101 represents the internal bus systems, 0102 includes one or more FPGA cells. 0103 denotes subbuses which are a subset of 0101 and are connected to 0101 via switches (crossbars). 0103 can also manage internal data of 0102 that are not switched to 0101. The FPGA cells are arranged in a two-dimensional array. 0104 is an edge cell located at the edge of the array and is thus in direct proximity to the terminals at the edge of the unit.
[0136] FIG. 2 shows another conventional FPGA. This embodiment does not work with bus systems like 0101 but instead mainly with next-neighbor connections (0201), which are direct connections from an FPGA cell (0203) to a neighboring cell. There may be global bus systems (0202) nevertheless, although they are not very wide. The FPGA cells or a group of FPGA cells have a connection to 0202. The FPGA cells are arranged in a two-dimensional array. 0204 is an edge cell located at the edge of the array and thus in close proximity to the terminals at the edge of the unit.
[0137] FIG. 3 shows a DFP described in, for example, German Pat. No. 196 51 075.9. The PAE cells (0303) are wired to the bus systems (0301) via a bus interface (0304). Bus systems 0301 can be wired together via a bus switch (0302). The PAE cells are arranged in a two-dimensional array. 0305 is an edge cell located on the edge of the array and is thus in close proximity to the terminals at the edge of the unit.
[0138] FIG. 4ashows an FPGA edge according to FIG. 1. Outside the edge cells (0401) there are arranged a plurality of INPUT/OUTPUT CELLs (0402) connecting the internal bus systems (0403) individually or in groups to the E-BUS (0404). The number of INPUT/OUTPUT CELLs depends on their own width in relation to the width of the internal bus systems. 0405 is an EB-REG. 0406 is a state machine. A bus system (0407) by means of which the state machine controls the INPUT/OUTPUT CELLs runs from the state machine to the EB-REG and each individual INPUT/OUTPUT CELL. There may be several 0405sand 0406sby combining a number of 0402sinto groups, each managed by a 0405 and 0406.
[0139] FIG. 4bshows an FPGA edge according to FIG. 2.
[0140] Several INPUT/OUTPUT CELLs (0412) are arranged outside the edge cells (0411) and are connected individually or in groups to the E-BUS (0414) via the internal bus systems (0413) and the direct connections of the edge cells (0417). The number of INPUT/OUTPUT CELLs depends on their own width in relation to the width of the internal bus systems (0413) and the number of direct connections (0418). 0415 is an EB-REG. 0416 is a state machine. A bus system (0417) by means of which the state machine controls the INPUT/OUTPUT CELLs goes from the state machine to the EB-REG and each individual INPUT/OUTPUT CELL. There may be multiple 0415sand 0416sby combining a number of 0412sinto groups, each managed by a 0415 and 0416.
[0141] FIG. 5 shows a DFP edge according to FIG. 3. Outside the edge cells (0501) are arranged several INPUT/OUTPUT CELLs (0502) which are connected individually or in groups to the E-BUS (0504) by the internal bus systems (0503). The number of INPUT/OUTPUT CELLs depends on their own width in relation to the width of the internal bus systems (0503). 0505 is an EB-REG. 0506 is a state machine. The state machine controls the INPUT/OUTPUT CELLs via a bus system (0507) which goes from the state machine to the EB-REG and each individual INPUT/OUTPUT CELL. There may be multiple 0505sand 0506sby combining a number of 0412sinto groups, each managed by a 0505 and 0506.
[0142] FIG. 6 shows an OUTPUT CELL 0601. Outside of 0601 there are the EB-REG (0602) and the state machine (0603) plus a gate (0604) which connects LIE state machine to the E-BUS (0605) if it is the E-BUS MASTER. Access to the EB-REG is possible via the E-BUS (0605), the I-BUS (0613) and the PLU bus (0609). In addition, when the unit is reset, the MASTER bit can be set via an external terminal (0614) leading out of the unit. The state machine (0603) has read-write access to 0602. In the OUTPUT CELL there is a multiplexer (0606) which assigns control of the E-GATE (0607) to either the E-BUS MASTER or the state machine (0603). The MODE PLUREG (0608) is set via the PLU bus (0609) or the I-BUS (0613) and it configures the address counter (0610) and the state machine (e.g., masking out the OUTPUT CELL). If data of the I-BUS (0613) is stored in the I-GATE-REG (0611), the access is noted in SET-REG (0612). The state of 0612 can De polled via 0607 on the E-BUS. Read access (E-GATE 0607 is activated) resets 0612. The addresses generated by 0610 and the data of 0611 are transferred to the E-BUS via gate 0607. There is the possibility of dynamically reconfiguring and controlling the OUTPUT CELL via the unit itself (DFP, FPGA, DPGA, etc.) rather than through the PLU. The I-BUS connection to the EB-REG (0602) and MODE PLUREG (0608) serves this function.
[0143] FIG. 7 shows an INPUT CELL 0701. Outside of 0701 there are the EB-REG (0702) and the state machine (0703), as well as a gate (MASTER GATE) (0704) which connects the state machine to the E-BUS (0705) if it is in the E-BUS MASTER mode. Access to EB-REG is possible via the E-BUS (0705), the I-BUS (0713) and the PLU bus (0709). Furthermore, when the unit is reset, the MASTER bit can be set via an external terminal (0714) leading out of the unit. The state machine (0703) has read-write access to 0702. In the INPUT CELL there is a multiplexer (0706) which assigns control of the E-GATE-REG (0707) to either the E-BUS MASTER or the state machine (0703). The MODE PLUREG (0708) is set via the PLU bus (0709) or the I-BUS (0713) and configures the address counter (0710) and the state machine (e.g., masking out the INPUT CELL). If data of the E-BUS (0705) is stored in the E-GATE-REG (0707), this access is noted in the SET-REG (0712). The state of 0712 can be polled on the E-BUS via a gate (0715) whose control is the same as that of the latch (0707). A read access—E-GATE 0711 is activated and the data goes to the I-BUS (0713) - resets 0712 via 0717. As an alternative, 0712 can be reset (0718) via the state machine (0703).
[0144] The addresses generated by 0710 are transferred via the gate (ADR-GATE) 0716 to the E-BUS. 0716 is activated by the state machine (0703) when it is the E-BUS MASTER. There is the possibility of dynamically reconfiguring and controlling the INPUT CELL via the unit itself (DFP, FPGA, DPGA, etc.) instead of through the PLU. The I-BUS connection to the EB-REG (0702) and the MODE PLUREG (0708) serves this function.
[0145] FIG. 8 shows the MODE PLUREG (0801) of an INPUT or OUTPUT CELL written by the PLU via the PLU bus (0802) or via an I-BUS (0808). The respective bus system is selected by the multiplexer (0809) (control of the multiplexer is not shown because an ordinary decoder logic can be used). The counter settings such as step length, counting direction and enabling of the counter are sent directly (0807) to the counter (0803). The basic address can either be written directly (0805) to the counter via a load (0804) or stored temporarily in an extension (0811) of 0801. Records in 0801 that are relevant for the state machine go to the state machine via a gate (0806) which is opened by the state machine for the INPUT or OUTPUT CELL activated at the time.
[0146] FIG. 9ashows a bus interface circuit with a state machine (0901), MASTER GATE (0902) and EB-REG (0903).
[0147] INPUT CELLs (0904) transfer data from the E-BUS (0905) to the II-BUS (0906). OUTPUT CELLs (0907) transfer data from the IO-BUS (0908) to the E-BUS (0905). All units are linked together by the control bus (0909).
[0148] FIG. 9bshows a bus interface circuit with a state machine (0901), MASTER GATE (0902) and EB-REG (0903).
[0149] INPUT CELLs (0904) transfer data from the E-BUS (0905) to the bidirectional I-BUS (0910). OUTPUT CELLS (0907) transfer data from the bidirectional I-BUS (0910) to the E-BUS (0905). All units are linked together over the control bus (0909). Interface circuits utilizing both possibilities (FIGS. 9a and 9b) in a hybrid design are also conceivable.
[0150] FIG. 10ashows the interconnection of two units (DFPs, FPGAs, DPGAs, etc.) (1001) linked together via the E-BUS (1002).
[0151] FIG. 10bshows the interconnection of a number of units (DFPs, FPGAs, DPGAs, etc.) (1001) via the E-BUS (1002).
[0152] FIG. 10cshows the interconnection of a number of units (DFPs, FPGAs, DPGAs, etc.) (1001) via the E-BUS (1002). This interconnection can be expanded to a matrix. One unit (1001) may also manage multiple bus systems (1002).
[0153] FIG. 10dshows the interconnection [of a] unit (DFP, FPGA, DPGA, etc.) (1001) to a memory unit or a memory bank (1003) via the E-BUS (1002).
[0154] FIG. 10eshows the interconnection [of a] unit (DFP, FPGA, DPGA, etc.) (1001) to a peripheral device or peripheral group (1004) via the E-BUS (1002).
[0155] FIG. 10fshows the interconnection [of a] unit (DFP, FPGA, DPGA, etc.) (1001) to a memory unit or a memory bank (1003) and to a peripheral device or a peripheral group (1004) via the E-BUS (1002).
[0156] FIG. 10gshows the interconnection [of a] unit (DFP, FPGA, DPGA, etc.) (1001) to a memory unit or a memory bank (1003) and to a peripheral device or a peripheral group (1004) plus another unit (DFP, FPGA, DPGA, etc.) (1001) via the E-BUS (1002).
[0157] FIG. 11 shows the architecture of the EB-REG. The bus systems E-BUS (1103), the PLU bus (1104) over which the PLU has access to the EB-REG, and the local internal bus between the INPUT/OUTPUT CELLs, the state machine and the EB-REG (1105, see 0407, 0417, 0517) and possibly an I-BUS En (1114) are connected to a multiplexer (1106). The multiplexer (1106) selects either one of the buses or feedback to the register (1108) and switches the data through to the input of the register (1108). The MASTER bit is sent to the register (1108) separately over the multiplexer (1107). The multiplexer is controlled by the RESET signal (1101) (resetting or initializing the unit). If a RESET signal is applied, the multiplexer (1107) switches the signal of an external chip connection (1102) through to the input of the register (1108); otherwise the output of the multiplexer (1106) is switched through to the input of the register (1108). MASTER may thus be pre-allocated. The register (1108) is clocked by the system clock (1112). The contents of the register (1108) are switched via a gate (1109, 1110, 1111, 1113) to the respective bus system (1103, 1104, 1105, 1114) having read access at that time. Control of the gates (1109, 1110, 1111, 1113) and of the multiplexer (1106) is not shown because an ordinary decoder logic may be used.
Embodiments
[0158] FIG. 12 shows an example embodiment using a standard bus system RAMBUS (1203). One unit (DFP, FPGA, DPGA, etc.) (1201) is connected to other units (memories, peripherals, other DFPs,. FPGAs, DPGAs, etc.) (1202) by the bus system (1203). IO dependently of the bus system (1203), this unit (1201) may have additional connecting lines (1204), e.g., for connecting any desired circuits, as is customary in the related art.
[0159] FIG. 13 shows an example of implementation of an IO and memory bus system. 1310 forms the RAM bus connecting RAM bus interface (1308) to the RAM bus memory. The RAM bus interface is connected to a cache RAM (1306). A tag RAM (1307) and a cache controller (1305) are provided for cache RAM (1306). With the help of the cache controller and tag RAM, a check is performed to determine whether the required data is in the cache memory or whether it must be loaded out of the external RAM bus memory. Cache RAM, cache controller and RAM bus interface are controlled by a state machine (1304). The cache is a known implementation.
[0160] Arbiter (1303) regulates access of individual bus segments to the cache RAM and thus also to external memory. In this exemplary implementation, access to eight bus segments is possible. Each connection to a bus segment (1309) has a bus IO (1301) and an address generator (1302). In addition, each bus IO is also connected to the primary logic bus (1307) and to an internal test bus (1311). Every n-th bus IO is connected to the (n+1)-th bus IO, where n is defined as n=(1, 3, 5, . . . ). Through this connection, data requested from memory by the n-th address generator is used by the (n+1)-th segment as the address for a memory access. Indirect addressing of the memory is thus possible. The value of the counter (1509) of segment n indicates a memory location in the RAM. Data from this memory location is transferred to segment (n+1), where it serves as the basic address for addressing the memory.
[0161] FIG. 14 shows an example bus IO unit. It is connected to the Internal bus system (1406), the test bus system (408) and the primary logic bus (1407). According to an example embodiment, bus (1412) and bus (1413) serve to connect the n-th bus IO to the (n+1)-th bus IO. In other words, bus (1413) is present only with every n-th segment, and bus (1412) is present only with every (n+1)-th segment. The n-th bus IO sends data over the bus (1413), and the (n+1)-th bus IO receives this data over the bus (1412). Bus systems (1406, 1407, 1412) are connected by gates (1401, 1402, 1403, 1411) to bus (1409) which connects the bus IO to the address generator. The arbiter (1404) selects a bus system (1406, 1407, 1412) for data transmission and delivers a control signal to the state machine (1405) which in turn controls gates (1401, 1402, 1403, 1411). In addition, state machine (1405) also sends control signals (1410) to the address generator and RAM.
[0162] Two example possibilities are as follows
[0163] a) Segment n: State machine (1405) receives from the address generator a configuration signal (1415) which determines whether indirect addressing is to take place. After a read trigger signal (1416) from internal bus (1406) or primary logic bus (1407), state machine (1405) enables the respective gate (1401, 1402, 1403, 1411) and generates control signals (1410). The memory location addressed by the loadable incrementer/decrementer (1509) is read out. Data contained in the RAM memory location is not sent back to the bus but instead is transmitted by the bus (1413) to the (n+1)-th segment, where it serves as a basic address for addressing the RAM. After having received data from the RAM, the state machine (1405) delivers an acknowledge signal for synchronization to state machine (1414), which controls the sequence in indirect addressing. This state machine (1414) is referred to below as ind state machine. It generates all the necessary control signals and sends them to the following segment (1413).
[0164] b) Segment (n+1): The (n+1)-th segment receives data transmitted from the n-th segment over the bus (1412). Arbiter- (1404) receives a write signal and sends a request to the state machine, which enables gate (1411). Gate (1411) adds the internal address of the basic address entry to the data from 1412, so that decoder (1502) enables the basic address latches.
[0165] FIG. 15ashows the address generator. Data and address information is transmitted from the bus IO to the address generator over the bus (1409). Bus (1410) transmits control signals CLK (1517, 1508) and the output enable signal (1518) as well as control signals to RAM (1519). The output enable signal (1518) enables the gates (1503, 1515). Gate (1503) switches data from bus (1409) to data bus (1504) to the RAM. Gate (1515) switches the addresses thus generated to address bus (1520) leading to the RAM.
[0166] Addresses are generated as follows: Four entries in the address generator generate addresses. Each entry is stored in two latches (1501), with one latch storing the higher-order address and the other latch storing the lower-order address. The basic address entry contains the start address of a memory access. The step width entry is added to or subtracted from the basic address in loadable incrementer/decrementer (1509). The (incrementing/decrementing) function of loadable incrementer/decrementer (1509) is coded in one bit of the basic address and transmitted to loadable incrementer/decrementer (1509).
[0167] The end address is stored in the end address entry, and one bit is encoded according to whether address generation is terminated on reaching the end address or whether the end address entry is ignored. If the counter counts up to an end address, the value of the end address entry is compared with the initial value of the loadable incrementer/decrementer. This takes place in the comparator (1510), which generates a high as soon as the end address is reached or exceeded. With an active enable end address signal (1507), the AND gate (1512) delivers this high to the OR gate (1.514), which then relays a trigger signal (1521) to the primary logic bus.
[0168] The data count entry contains the number of data transfers and thus of the addresses to be calculated. Here again, one bit in the data count entry determines whether this function is activated and the enable data counter signal (1506) is sent to the AND gate (1513) or whether the data count entry is ignored. Counter (1505) receives the value of the data count entry and decrements it by one with each clock pulse. Comparator (1511) compares the value of counter (1505) [with] zero and delivers a signal to AND gate (1513). If enable data counter signal (1506) is active, the signal of comparator (1511) is sent to OR gate (1514) and as trigger signal (1521) to the primary logic bus.
[0169] Bus (1409) contains control signals and addresses for the decoder (1502), which selects one of the latches (1501) according to the address. Configuration register (1516) can also be controlled by decoder (1502), determining whether the segment is used for indirect addressing. Data of the configuration register is transmitted to the bus IO of the segment over connection (1415).
[0170] FIG. 15bshows a modification of the address generator from FIG. 15a, which deposits the end address of the data block at the beginning of a data block in the memory. The advantage of this design is that (with) a variable size of the data block, the end is defined precisely for subsequent access. This structure corresponds basically to the structure of the address generator from FIG. 15a, but with the addition of two multiplexers (1522, 1523) and an additional entry in the configuration register (1523). This entry is called the calculate end address and determines whether the end address of the data block is deposited as the first entry of the data block at the location defined by the base address entry. These multiplexers are controlled by state machine (1405). Multiplexer (1522) serves to switch the basic address or output of counter (1509) to gate (1515). Multiplexer (1523) switches either data coming from bus (1404) or the output of counter (1509) to gate (1503).
[0171] FIG. 15cshows the sequence in the state machine and the pattern of memory access by the address generator shown in FIG. 15b. State machine (1405) is first in the IDLE state (1524). If the calculate end address entry is set in configuration register (1523), after writing step width (1529), state machine (1405) goes into state (1525) where the address for RAM access is written into the loadable incrementer/decrementer from the basic address entry, and the step width is added or subtracted, depending on counter mode (incrementing/decrementing). The RAM is accessed and the state machine returns to IDLE state (1524). The following data transfers are performed as specified by the basic addresses and step width entries. The pattern in memory is thus as follows. Basic address (1526) has not been written. First entry (1527) is in the position defined by the basic address plus (minus) the stop width. The next entries (1528) follow one another at step width intervals.
[0172] When the end of the transfer has been reached, a trigger signal is generated (1521). On the basis of the trigger signal (1521) or an external trigger signal (1417), state machine (1405) goes from IDLE state (1524) into state (1530), where multiplexers (1522, 1523) are switched, so that the basic address is applied to the input of gate (1515), and the address is applied to gate (1503) after the end of the data block. Then state machine (1405) enters state (1531) and writes the address to the RAM at the position of the basic address after the end of the data block. The pattern in memory is then as follows. The entry of basic address (1526) indicates the address after the end of the data block. The first entry in the data block is at address (1527), and then the remaining entries follow. Another possible embodiment of the state machine is for the state machine to first correct the count in 1509 on the basis of one of trigger signals (1521 or 1417) so that 1509 indicates the last data word of the data block. This is implemented technically by performing the inverse operation to that preset in 1509, i.e., if 1509 adds the step width according to the presettings, the step width is now subtracted; if 1509 subtracts according to the presettings, it is added. To perform the correction, an additional state (1540) is necessary in the state machine described below in conjunction with FIG. 15cto control 1509 accordingly.
[0173] FIG. 16 shows the interaction of multiple segments in indirect addressing. Segment n (1601) receives a read signal over the bus (1605) (primary logic bus (1407) or internal bus (1406)). Bus IO (1603) enables the respective gate and generates the required control signals. The memory location determined by 1509 is addressed. Data (1607) coming from the RAM is sent to segment (n+1) (1602). Ind state machine (1604) generates the required control signals and likewise sends them to segment (n+1) (1602). In segment (n+1) (1602), signals pass through gate (1411) of bus IO (1608) described in conjunction with FIG. 14, where an address is added for decoder (1502) described in conjunction with FIG. 15, so that the basic address entry of the address generator (1608) is addressed by segment (n+1) (1602). Data coming from segment n (1601) thus serves as the basic address in segment (n+1) (1602), i.e., read-write access over bus (1609) (primary logic bus (1407) or internal bus (1406)) can use this basic address for access to the RAM. Bus (1610) serves to transmit addresses to the RAM, and bus (1612) transmits data to and from the RAM, depending on whether it is a read or write access.
[0174] FIG. 17 illustrates the ind state machine. The basic state is the IDLE state (1701). It remains in this state until the acknowledge signal of state machine (1405) from FIG. 14 arrives. Then ind state machine goes into a write state (1702), generating a write enable signal which is sent with the data to segment (n+1), where it serves to activate the decoder selecting the various entries. Next it enters a wait—for—ack state. After the acknowledge signal of segment (n+1), the ind state machine returns to the IDLE state (1701).
[0175] Definition of Terms
[0176] ADR-GATE: Gate which switches addresses to the E-BUS if the unit is in E-BUS MASTER mode.
[0177] DFP: Data flow processor according to German Patent DE 44 16 881.
[0178] DPGA: Dynamically programmable gate array. Related art.
[0179] D flip-flop: Storage element which stores a signal at the rising edge of a clock pulse.
[0180] EB-REG: Register that stores the status signals between I-BUS and E-BUS.
[0181] E-BUS: External bus system outside a unit.
[0182] E-BUS MASTER: Unit that controls the E-BUS. Active.
[0183] E-BUS SLAVE: Unit controlled by the E-BUS MASTER. Passive.
[0184] E-GATE: Gate which is controlled by the internal state machine of the unit or by the E-BUS MASTER and switches data to the E-BUS.
[0185] E-GATE-REG: Register into which data transmitted to the E-BUS over the E-GATE is entered.
[0186] E-READ: Flag in the EB-REG indicating that the OUTPUT CELLS have been transferred completely to the E-BUS.
[0187] E-WRITE: Flag in the EB-REG indicating that the E-BUS has been transferred completely to the INPUT CELLS.
[0188] Flag: Status bit in a register, indicating a state.
[0189] FPGA: Field programmable gate array. Related art.
[0190] Handshake: Signal protocol where a signal A indicates a state and another signal B confirms that it has accepted signal A and responded to it.
[0191] INPUT CELL: Unit transmitting data from the E-BUS to an I-BUS.
[0192] I-BUSn (also I-BUS): Internal bus system of a unit, which may also consist of bundles of individual lines, where n indicates the number of the bus.
[0193] II-BUSn (also II-BUS): Internal bus system of a unit, which may also consist of bundles of individual lines, with n denoting the number of the bus. The bus is driven by an INPUT CELL and goes to logic inputs.
[0194] IO-BUSn (also 10-BUS): Internal bus system of a unit, which may also consist of bundles of individual lines, with n denoting the number of the bus. The bus is driven by logic outputs and goes to an OUTPUT CELL. n indicates the number of the bus.
[0195] I-GATE: Gate that switches data to the I-BUS.
[0196] I-GATE-REG: Register which is controlled by the internal state machine or by E-BUS MASTER and into which data transmitted over the I-GATE to the I-BUS is entered.
[0197] I-READ: Flag in the EB-REG indicating that the INPUT CELLs have been completely transferred to the I-BUS.
[0198] I-WRITE: Flag in the EB-REG indicating that the I-BUS has been completely transferred to the OUTPUT CELLs.
[0199] Edge cell: Cell at the edge of a cell array, often with direct contact with the terminals of a unit.
[0200] Configuring: Setting the function and interconnecting a logic unit, a (FPGA) cell (logic cell) or a PAE (see reconfiguring).
[0201] Primary logic unit (PLU): Unit for configuring and reconfiguring a PAE or logic cell. Configured by a microcontroller specifically designed for this purpose.
[0202] Latch: Storage element which usually relays a signal transparently during the H level and stores it during the L level. Latches where the function of levels is exactly the opposite are sometimes used in PAEs. An inverter is then connected before the clock pulse of a conventional latch.
[0203] Logic cells: Configurable cells used in DFPs, FPGAs, DPGAs, fulfilling simple logical or arithmetic functions, depending on configuration.
[0204] MASTER: Flag in EB-REG showing that the E-BUS unit is a MASTER.
[0205] MODE PLUREG: Register in which the primary logic unit sets the configuration of an INPUT/OUTPUT CELL.
[0206] OUTPUT CELL: Unit that transmits data from an I-BUS to the E-BUS.
[0207] PAE: Processing array element: EALU with O-REG, R-REG, R20-MUX, F-PLUREG, M-PLUREG, BM UNIT, SM UNIT, sync UNIT, state-back UNIT and power UNIT.
[0208] PLU: Unit for configuring and reconfiguring a PAE or a logic cell. Configured by a microcontroller specifically designed for this purpose.
[0209] REQ-MASTER: Flag in the EB-REG indicating that the unit would like to become E-BUS MASTER.
[0210] RS flip-flop: Reset/set flip-flop. Storage element which can be switched by two signals.
[0211] SET-REG: Register indicating that data has been written in an I-GATE-REG or E-GATE-REG but not yet read.
[0212] STATE-GATE: Gate switching the output of the SET-REG to the E-BUS.
[0213] Gate: Switch that relays or blocks a signal. Simple comparison: relay.
[0214] Reconfiguring: New configuration of any number of PAEs or logic cells while any remaining number of PAEs or logic cells continue their own function (see configuring).
[0215] State machine: Logic which can assume miscellaneous states. The transitions between states depend on various input parameters. These machines are used to control complexes functions and belong to the related art.
Claims
Post-issuance certificates present
The text shown below may not reflect later post-issuance changes.
What is claimed is:
1. A bus system, comprising:
a plurality of at least one of individual lines, buses, and subbuses within at least one of a unit including at least one of a data flow processor (DFP), a field programmable gate array (FPGA), a dynamically programmable gate array (DPGA), and a unit having a multi-dimensional programmable cell architecture, the plurality of the at least one of individual lines, buses and subbuses being bundled,
wherein the plurality of the at least one individual lines, buses and subbuses at least one of combines multiple units and connects at least one of memories and peripherals, and wherein standard bus systems are used, and
wherein the unit includes additional ordinary connections in a manner customary with at least one of the DFP, the FPGA and the DPGA.
2. A system configured to be connected to at least one of an external bus, a peripheral, or an external memory, comprising:
a plurality of reconfigurable cells; and
an interface unit configured to provide a connection between an at least one of the plurality of reconfigurable cells and the at least one of an external bus, peripheral, and external memory.
4. The system of claim 3, wherein the address generator is configured to generate addresses for accessing the at least one of the external bus, peripheral and external memory.
6. The system of claim 5, wherein
the address generator has a programmable base address for a memory access.
7. The system of claim 6, wherein
the address generator includes a latch configured to store the programmable base address.
9. The system of claim 5, wherein
the address generator has a programmable step width for successive memory accesses.
10. The system of claim 9, wherein
the address generator includes a latch configured to store the programmable step width.
11. The system of claim 5, wherein
the address generator has a programmable end address for successive memory accesses.
12. The system of claim 11, wherein
the address generator includes a latch configured to store the programmable end address.
14. A system configured to be connected to an external bus, comprising:
a plurality of reconfigurable cells; and
a plurality of interface elements configured to share the external bus and to provide connections between the plurality of reconfigurable cells and the external bus.
15. The system configured to be connected to an external bus of claim 14, further comprising:
an arbiter connected to each of the plurality of interface elements.
16. The system of claim 15, wherein
the arbiter is configured to manage the sharing of the external bus by the plurality of interface elements.
17. A system configured to be connected to at least one of an external bus, a peripheral, or an external memory, comprising:
a plurality of reconfigurable cells;
a plurality of interface elements; and
a cache system coupled to the plurality of interface elements, the cache system configured to cache at least one of reads to or writes from the at least one of the external bus, the peripheral, or the external memory.
18. The system of claim 17, further comprising:
a plurality of programmable address generators, each of the plurality of programmable address generators coupled to a respective one of the plurality of interface elements.
19. The system of claim 17, wherein the cache system comprises
a cache controller,
a tag RAM coupled to the cache controller, and
a cache RAM coupled to the cache controller.
Patent Citations (143)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4489857(A) | 1984-12-01 | Batlas | Applicant |
| US4591979(A) | 1986-05-01 | Iwashita | Applicant |
| US4706216(A) | 1987-11-01 | Carter | Applicant |
| US4739474(A) | 1988-04-01 | Holsztynski et al. | Applicant |
| US4761755(A) | 1988-08-01 | Ardini et al. | Applicant |
| US4811214(A) | 1989-03-01 | Nosenchuck et al. | Applicant |
| US4852043(A) | 1989-07-01 | Guest | Examiner |
| US4852048(A) | 1989-07-01 | Morton | Applicant |
| US4870302(A) | 1989-09-01 | Freeman | Applicant |
| US4901268(A) | 1990-02-01 | Judd | Applicant |
| US4967340(A) | 1990-10-01 | Dawes | Applicant |
| US5014193(A) | 1991-05-01 | Garner et al. | Applicant |
| US5015884(A) | 1991-05-01 | Agrawal et al. | Applicant |
| US5021947(A) | 1991-06-01 | Campbell et al. | Applicant |
| US5023775(A) | 1991-06-01 | Poret | Applicant |
| US5043978(A) | 1991-08-01 | Nagler et al. | Applicant |
| US5081375(A) | 1992-01-01 | Pickett et al. | Applicant |
| US5109503(A) | 1992-04-01 | Cruickshank et al. | Applicant |
| US5113498(A) | 1992-05-01 | Evan et al. | Applicant |
| US5115510(A) | 1992-05-01 | Okamoto et al. | Applicant |
| US5123109(A) | 1992-06-01 | Hillis | Applicant |
| US5125801(A) | 1992-06-01 | Nabity et al. | Applicant |
| US5128559(A) | 1992-07-01 | Steele | Applicant |
| US5142469(A) | 1992-08-01 | Weisenborn | Applicant |
| US5204935(A) | 1993-04-01 | Mihara et al. | Applicant |
| US5208491(A) | 1993-05-01 | Ebeling et al. | Applicant |
| US5226122(A) | 1993-07-01 | Thayer et al. | Applicant |
| USRE34363(E) | 1993-08-01 | Freeman | Applicant |
| US5233539(A) | 1993-08-01 | Agrawal et al. | Applicant |
| US5247689(A) | 1993-09-01 | Ewert | Applicant |
| US5287472(A) | 1994-02-01 | Horst | Applicant |
| US5301344(A) | 1994-04-01 | Kolchinsky | Applicant |
| US5303172(A) | 1994-04-01 | Magar et al. | Applicant |
| US5336950(A) | 1994-08-01 | Popli et al. | Applicant |
| US5361373(A) | 1994-11-01 | Gilson | Applicant |
| US5418952(A) | 1995-05-01 | Morley et al. | Applicant |
| US5421019(A) | 1995-05-01 | Holsztynski et al. | Applicant |
| US5422823(A) | 1995-06-01 | Agrawal et al. | Applicant |
| US5426378(A) | 1995-06-01 | Ong | Applicant |
| US5430687(A) | 1995-07-01 | Hung et al. | Applicant |
| US5440245(A) | 1995-08-01 | Galbraith et al. | Applicant |
| US5442790(A) | 1995-08-01 | Nosenchuck | Applicant |
| US5444394(A) | 1995-08-01 | Watson et al. | Applicant |
| US5448186(A) | 1995-09-01 | Kawata | Applicant |
| US5455525(A) | 1995-10-01 | Ho et al. | Applicant |
| US5457644(A) | 1995-10-01 | McCollum | Applicant |
| US5473266(A) | 1995-12-01 | Ahanin et al. | Applicant |
| US5473267(A) | 1995-12-01 | Stansfield | Applicant |
| US5475583(A) | 1995-12-01 | Bock et al. | Applicant |
| US5475803(A) | 1995-12-01 | Stearns et al. | Applicant |
| US5483620(A) | 1996-01-01 | Pechanek et al. | Applicant |
| US5485103(A) | 1996-01-01 | Pedersen et al. | Applicant |
| US5485104(A) | 1996-01-01 | Agrawal et al. | Applicant |
| US5489857(A) | 1996-02-01 | Agrawal et al. | Applicant |
| US5491353(A) | 1996-02-01 | Kean | Applicant |
| US5493239(A) | 1996-02-01 | Zlotnick | Applicant |
| US5497498(A) | 1996-03-01 | Taylor | Applicant |
| US5506998(A) | 1996-04-01 | Kato et al. | Applicant |
| US5510730(A) | 1996-04-01 | El Gamal et al. | Applicant |
| US5511173(A) | 1996-04-01 | Yamaura et al. | Applicant |
| US5513366(A) | 1996-04-01 | Agarwal et al. | Applicant |
| US5521837(A) | 1996-05-01 | Frankle et al. | Applicant |
| US5522083(A) | 1996-05-01 | Gove et al. | Applicant |
| US5532693(A) | 1996-07-01 | Winters et al. | Applicant |
| US5532957(A) | 1996-07-01 | Malhi | Applicant |
| US5535406(A) | 1996-07-01 | Kolchinsky | Applicant |
| US5537057(A) | 1996-07-01 | Leong et al. | Applicant |
| US5537601(A) | 1996-07-01 | Kimura et al. | Applicant |
| US5541530(A) | 1996-07-01 | Cliff et al. | Applicant |
| US5544336(A) | 1996-08-01 | Kato et al. | Applicant |
| US5548773(A) | 1996-08-01 | Kemney et al. | Applicant |
| US5555434(A) | 1996-09-01 | Carlstedt | Applicant |
| US5559450(A) | 1996-09-01 | Ngai et al. | Applicant |
| US5561738(A) | 1996-10-01 | Kinerk et al. | Applicant |
| US5570040(A) | 1996-10-01 | Lytle et al. | Applicant |
| US5583450(A) | 1996-12-01 | Trimberger et al. | Applicant |
| US5586044(A) | 1996-12-01 | Agrawal et al. | Applicant |
| US5587921(A) | 1996-12-01 | Agrawal et al. | Applicant |
| US5588152(A) | 1996-12-01 | Dapp et al. | Applicant |
| US5590345(A) | 1996-12-01 | Barker et al. | Applicant |
| US5596742(A) | 1997-01-01 | Agarwal et al. | Applicant |
| US5617547(A) | 1997-04-01 | Feeney et al. | Applicant |
| US5634131(A) | 1997-05-01 | Matter et al. | Applicant |
| US5652894(A) | 1997-07-01 | Hu et al. | Applicant |
| US5655124(A) | 1997-08-01 | Lin | Applicant |
| US5659797(A) | 1997-08-01 | Zandveld et al. | Applicant |
| US5675743(A) | 1997-10-01 | Mavity | Examiner |
| US5713037(A) | 1998-01-01 | Wilkinson et al. | Applicant |
| US5717943(A) | 1998-02-01 | Barker et al. | Applicant |
| US5734921(A) | 1998-03-01 | Dapp et al. | Applicant |
| US5742180(A) | 1998-04-01 | Detton et al. | Applicant |
| US5748872(A) | 1998-05-01 | Norman | Applicant |
| US5754871(A) | 1998-05-01 | Wilkinson et al. | Applicant |
| US5761484(A) | 1998-06-01 | Agarwal et al. | Applicant |
| US5778439(A) | 1998-07-01 | Timberger et al. | Applicant |
| US5801715(A) | 1998-09-01 | Norman | Applicant |
| US5828229(A) | 1998-10-01 | Cliff et al. | Examiner |
| US5828858(A) | 1998-10-01 | Athanas et al. | Applicant |
| US5838165(A) | 1998-11-01 | Chatter | Applicant |
| US5844888(A) | 1998-12-01 | Markkula, Jr. et al. | Applicant |
| US5867691(A) | 1999-02-01 | Shiraishi | Applicant |
| US5892961(A) | 1999-04-01 | Trimberger et al. | Applicant |
| US5915123(A) | 1999-06-01 | Mirsky et al. | Applicant |
| US5927423(A) | 1999-07-01 | Wada et al. | Applicant |
| US5936424(A) | 1999-08-01 | Young et al. | Applicant |
| US5943242(A) | 1999-08-01 | Vorbach et al. | Applicant |
| US5956518(A) | 1999-09-01 | DeHon et al. | Applicant |
| US6014509(A) | 2000-01-01 | Furtek et al. | Applicant |
| US6052773(A) | 2000-04-01 | DeHon et al. | Applicant |
| US6054873(A) | 2000-08-01 | Laramie | Applicant |
| US6108760(A) | 2000-08-01 | Mirsky et al. | Applicant |
| US6122719(A) | 2000-09-01 | Mirsky et al. | Applicant |
| US6127908(A) | 2000-10-01 | Bozler et al. | Applicant |
| US6243808(B1) | 2001-06-01 | Wang | Applicant |
| US6282627(B1) | 2001-08-01 | Wong et al. | Applicant |
| US6288566(B1) | 2001-09-01 | Hanrahan et al. | Applicant |
| US6311200(B1) | 2001-10-01 | Hanrahan et al. | Applicant |
| US6341318(B1) | 2002-01-01 | Dakhil | Applicant |
| US6347346(B1) | 2002-02-01 | Taylor | Applicant |
| US6349346(B1) | 2002-02-01 | Hanrahan et al. | Applicant |
| US6370596(B1) | 2002-04-01 | Dakhil | Applicant |
| US6389579(B1) | 2002-05-01 | Phillips et al. | Applicant |
| US6392912(B1) | 2002-05-01 | Hanrahan et al. | Applicant |
| US6405299(B1) | 2002-06-01 | Vorbach et al. | Examiner |
| DE4416881.0 | 1994-11-01 | Applicant | |
| DE19651075 | 1998-06-01 | Applicant | |
| DE19654595 | 1998-07-01 | Applicant | |
| DE19654846 | 1998-07-01 | Applicant | |
| DE19704728 | 1998-08-01 | Applicant | |
| EP221360 | 1987-05-01 | Applicant | |
| EP428327 | 1991-05-01 | Applicant | |
| EP748051 | 1991-12-01 | Applicant | |
| EP539595 | 1993-05-01 | Applicant | |
| EP678985 | 1995-10-01 | Applicant | |
| EP707269 | 1996-04-01 | Applicant | |
| EP726532 | 1996-08-01 | Applicant | |
| EP735685 | 1996-10-01 | Applicant | |
| WOA9004835 | 1990-05-01 | Applicant | |
| WO90/11648 | 1990-10-01 | Applicant | |
| WOA9311503 | 1993-06-01 | Applicant | |
| WO94/08399 | 1994-04-01 | Applicant | |
| WO95/00161 | 1995-01-01 | Applicant | |
| WO95/26001 | 1995-09-01 | Applicant |
Non-Patent Literature (10)
- Villasenor, John, et al., “Configurable Computing.” Scientific American, vol. 276, No. 6, Jun. 1997, pp. 66-71.Applicant
- Villasenor, John, et al., “Configuralbe Computing Solutions for Automatic Target Recognition,” IEEE, 1996 pp. 70-79.Applicant
- Tau, Edward, et al., “A First Generation DPGA Implementation,” FPD'95, pp. 138-143.Applicant
- Athanas, Peter, et al., “IEEE Symposium on FPGAs For Custom Computing Machines,” IEEE Computer Society Press, Apr. 19-21, 1995, pp. i-vii, 1-222.Applicant
- Bittner, Ray, A., Jr., “Wormhole Run-Time Reconfiguration: Conceptualization and VLSI Design of a High Performance Computing system,” Dissertation, Jan. 23, 1997, pp. i-xx, 1-415.Applicant
- Myers, G., Advances in Computer Architecture, Wiley-Interscience Publications, 2nd ed., John Wiley & Sons, Inc. pp. 463-494, 1978.Applicant
- M. Saleeba, “A Self-Contained Dynamically-Reconfigurable Processor Architecture”, Sixteenth Australian Computer Science Conference, ASCS-16, QLD, Australia, Feb., 1993.Applicant
- M. Morris Mano, “Digital Design,” by Prentice Hall, Inc., Englewood Cliffs, New Jersey 07632, 1984, pp. 119-125, 154-161.Applicant
- Maxfield, C. “Logic that Mutates While-U-Wait” EDN (Bur. Ed)(USA), EDN (European Edition), Nov. 7, 1996, Cahners Publishing, USA.Applicant
- Norman, Richard S., Hyperchip Business Summary, The Opportunity, Jan. 31, 2000, pp. 1-3.Applicant