US 7,565,525 B2Grant
Runtime configurable arithmetic and logic cell
Issue Date:2009-07-21
•19 Claims
•24 Drawing Sheets
Abstract
A cascadable arithmetic and logic unit (ALU) which is configurable in function and interconnection. No decoding of commands is needed during execution of the algorithm. The ALU can be reconfigured at run time without any effect on surrounding ALUs, processing units or data streams. The volume of configuration data is very small, which has positive effects on the space required and the configuration speed. Broadcasting is supported through the internal bus systems in order to distribute large volumes of data rapidly and efficiently. The ALU is equipped with a power-saving mode to shut down power consumption completely. There is also a clock rate divider which makes it possible to operate the ALU at a slower clock rate. Special mechanisms are available for feedback on the internal states to the external controllers.
Metadata
Assignee
- Pact XPP Technologies AG
Inventors
- Martin Vorbach
- Robert Münch
Application Information
Application Number:US 10/791,501
Filing Date:2004-03-01
Priority Date:1996-12-09
Art Unit:2116
Classifications
IPC:
G06F9/00G06F15/00
Patent Drawings (24 sheets)
Description
Cross-Reference to Related Applications
[0001] This application is a continuation of U.S. patent application Ser. No. 09/329,132, filed Jun. 9, 1999, now U.S. Pat. No. 6,728,871 which is a continuation of International Patent Application PCT/DE97/02949 filed on Dec. 9, 1997, and a continuation-in-part of U.S. patent application Ser. No. 08/946,810 filed on Oct. 8, 1997, now U.S. Pat. No. 6,425,068 each of which is expressly incorporated herein by reference in its entirety.
Background Information
[0002] German Patent No. 44 16 881 describes a method of processing data, where homogeneously arranged cells which can be configured freely in function and interconnection are used.
[0003] Independently of the above-mentioned patent, field programmable gate array (FPGA) units are being used to an increasing extent to assemble arithmetic and logic units and data processing systems from a plurality of logic cells.
[0004] Another known method is to assemble data processing systems from fixed program-controlled arithmetic and logic units with largely fixed interconnection, referred to as systolic processors.
Problems
[0005] Units Described in German Patent No. 44 16 881
[0006] Units described in German Patent No. 44 16 881 (referred to below as “VPUs”) are very complicated to configure owing to the large number of logic cells. To control one logic cell, several control bits must be specified in a static memory (SRAM). There is one SRAM address for each logic cell. The number of SRAM cells to be configured is very large, thus, a great deal of space and time is needed for configuring and reconfiguring such a unit. The great amount of space required is problematical because the processing power of a VPU increases with an increase in the number of cells, and the area of a unit that can be used is limited by chip manufacturing technologies. The price of a chip increases approximately proportionally to the square of the chip area. It is impossible to broadcast data to multiple receivers simultaneously because of the repeated next-neighbor interconnection architecture. If VPUs are to be reconfigured on site, it is absolutely essential to achieve short reconfiguration times. However, the large volume of configuration data required to reconfigure a chip stands in the way of this. There is no possibility of separating cells from the power supply or having them cycle more slowly to minimize the power loss.
FPGAs
[0007] FPGAs for the use in the area described here usually include multiplexers or look-up table (LUT) architectures. SRAM cells are used for implementation. Because of the plurality of small SRAM cells, they are very complicated to configure. Large volumes of data are required, necessitating a comparably large amount of time for configuration and reconfiguration. SRAM cells take up a great deal of space, and the usable area of a unit is limited by the chip manufacturing technologies. Here again, the price increases approximately proportionally to the square of the chip area. SRAM-based technology is slower than directly integrated logic due to the SRAM access time. Although many FPGAs are based on bus architectures, there is no possibility of broadcasting for rapid and effective transmission of data to multiple receivers simultaneously. If FPGAs are to be reconfigured at run time, it is absolutely essential to achieve short configuration times. However, the large volume of configuration data required stands in the way. FPGAs do not offer any support for reasonable reconfiguration at run time. The programmer must ensure that the process takes place properly without interfering effects on data and surrounding logic. There is no intelligent logic to minimize power loss. There are no special function units to permit feedback on the internal operating states to the logic controlling the FPGA.
Systolic Processors
[0008] Reconfiguration is completely eliminated with systolic processors, but these processors are not flexible because of their rigid internal architecture. Commands are decoded anew in each cycle. As described above, there are no functions which include broadcasting or efficient minimization of power loss.
Summary
[0009] The present invention relates to a cascadable arithmetic and logic unit (ALU) which is configurable in function and interconnection. No decoding of commands is needed during execution of the algorithm. It can be reconfigured at run time without any effect on surrounding ALUs, processing units or data streams. The volume of configuration data is very small, which has positive effects on the space required and the configuration speed. Broadcasting is supported through the internal bus systems in order to distribute large volumes of data rapidly and efficiently. The ALU is equipped with a power-saving mode to shut down power consumption completely. There is also a clock rate divider which makes it possible to operate the ALU at a slower clock rate. Special mechanisms are available for feedback on the internal states to the external controllers.
[0010] The present invention is directed to the architecture of a cell as described in, for example, German Patent No. 44 16 881, or, or example, conventional FPGA cells. An expanded arithmetic and logic unit (EALU) with special extra functions is integrated into this cell to perform the data processing. The EALU is configured by a function register which greatly reduces the volume of data required for configuration. The cell can be cascaded freely over a bus system, the EALU being decoupled from the bus system over input and output registers. The output registers are connected to the input of the EALU to permit serial operations. A bus control unit is responsible for the connection to the bus, which it connects according to the bus register. The unit is designed-so that distribution of data to multiple receivers (broadcasting) is possible. A synchronization circuit controls the data exchange between multiple cells over the bus system. The EALU, the synchronization circuit, the bus control unit and registers are designed so that a cell can be reconfigured on site independently of the cells surrounding it. A power-saving mode which shuts down the cell can be configured through the function register; clock rate dividers which reduce the working frequency can also be set.
Brief Description of the Drawings
[0011] FIG. 1 shows an example arrangement of several PAEs forming one PA with PLU. Without connection to input/output systems or memories.
[0012] FIG. 2 shows an example architecture of a PAE.
[0013] FIG. 3 shows an example architecture of F-PLUREG and M-PLUREG.
[0014] FIGS. 4 a-4c shows an example architecture of an O-REG.
[0015] FIGS. 5 a-5c shows an example architecture of an O-REGsft with a right shift function.
[0016] FIGS. 6 a-6c shows an example architecture of an R-REGsft with right/left 1-2-bit barrel shifter.
[0017] FIGS. 7 a-7b shows an example architecture of the R2O-MUX and implementation of a MUX in transfer gate technology.
[0018] FIG. 8 shows example clock synchronization, delays and sync signals.
[0019] FIGS. 9/1-9/2 shows the functioning of an example sync UNIT.
[0020] FIG. 10 shows an example architecture of a power UNIT.
[0021] FIG. 11 shows an example architecture of a sync UNIT.
[0022] FIG. 12 shows an example architecture of a BM UNIT.
[0023] FIG. 13 shows an example architecture of an O-MUX, limited to four bus systems.
[0024] FIG. 14 shows an example architecture of an R GATE, limited to four bus systems.
[0025] FIG. 15 shows an example architecture of the state-back UNIT.
[0026] FIG. 16 shows an exemplary operating principle of the one-shot MODE and the one-shot/power-save MODE.
[0027] FIG. 17 shows an example of implementation of a PAE.
[0028] FIG. 18 shows an example architecture of a PAE, with the individual functions being linked via a bus system.
[0029] FIG. 19 shows an example operation of the config state machine.
[0030] FIG. 20 shows an example operation of a loop state machine.
[0031] FIG. 21 shows an example cyclical processing of the configuration register data.
Detailed Description
[0032] The present invention relates to the design of a cell (e.g., processing array element or “PAE”) as described in German Patent No. 44 16 881, or, for example, conventional FPGA cells, where the PAEs can be cascaded to form an array (e.g., a processing array or “PA”). One PAE is composed of a plurality of function units.
EALU
[0033] The computing unit includes an expanded arithmetic and logic unit (EALU) permanently implemented in the logic unit. An EALU is an ordinary known arithmetic and logic unit (ALU) which has been expanded by special functions such as counters. This EALU is capable of performing a plurality of arithmetic and logic operations, which do not have to be specified here exactly, because it is possible to refer to known ALUs. The EALU has direct access to its own results (described below) which are returned as the operand. Thus counters or serial operations such as serial multiplication, division or series expansion are possible. In addition to its result, the EALU delivers the signals CarryOut-AlessB and AequalB−0detect. CarryOut−AlessB specifies either the carry-over in arithmetic operations, or in comparisons by means of subtraction of two values, it specifies the carry-over, i.e., CarryOut−AlessB, that A<B or B<A, depending on the operand negated. The signal is the usual carry-over generated by a full adder. AequalB−0detect specifies that the result in the result register R−REGsft is zero. The signal is generated by a NOR element from the result. The signals are used for simple status analysis and can be returned to the PLU. Additional status signals can be implemented, depending on the application.
[0034] The function of the EALU is configured in a function register (F-PLUREG).
O-REG
[0035] The input operands of the EALU are stored in two independent operand registers (O-REG). The input operands are thus available independently of the status of the unit supplying the data (data transmitter). This permits decoupling from the bus and for the PAs to be freely reconfigurable. One or both O-REGs have a shift function which is triggered by the EALU, for each O-REG individually, if so required. The shift function makes it possible to perform serial operations such as serial multiplication or division in the EALU. O-REGsft denotes O-REGs with a shift function.
R-REGsft
[0036] The result of the EALU is stored in a result register (R-REGsft). This provides time independence of the unit or units receiving the result (data receivers). The R-REGsft has a shift function which is triggered by the EALU, thus permitting serial operations.
R2O MUX
[0037] The result data available in R-REGsft is introduced as an operand through a multiplexer (R2O-MUX) between one of the O-REGs and the EALU to guarantee feedback of results for serial operations, counters and similar functions. The multiplexer is set by the F-PLUREG.
Clock Cycles
[0038] It is appropriate but not absolutely necessary to trigger the O-REG sft at a clock pulse edge and the R-REGsft at the subsequent negated clock pulse edge. Thus, the EALU has a half clock pulse available to carry out its function; the second half clock pulse is available for signal propagation times and multiplexers. Thus, it is possible to perform a complete operation in each clock pulse.
StateMachine, SM Unit
[0039] An SM UNIT is available for sequence control in the EALU. The SM UNIT controls the O-REG and R-REGsft and their shift function, as well as controlling the R2O-MUX. Consequently, serial operations and shift and counting functions can be performed easily by the EALU. The state machine is easy to implement by the conventional methods.
Sync UNIT
[0040] A synchronization unit (Sync UNIT) is provided for synchronization of one PAE in an array (PA) of PAEs. The Sync UNIT analyzes a series of input signals, which execute a handshake protocol.
-
- [0041] rACK(h/l): The data receiver acknowledges the data received, rACKh being the acknowledgment of the high result byte (bits 8 through 15) and rACKl being the acknowledgment of the low result byte (bits 0 through 7). The two are linked with an AND (rACKh AND rACKl) and yield the signal rACK. rACK is not true while one or both data receivers are busy processing their data and becomes true when the processing of the data of both data receivers is concluded, and the result is stored in the R-REGsft of the respective data receiver. The rACK(h/l) signals are often considered below in their AND-linked form as rACK (=rACKh & rACKl).
- [0042] oRDY(½) The data transmitter signals its readiness to send new data. oRDY is not true while the data transmitter is busy processing its data, and it becomes true when the result of the data transmitter, which is the operand of the PAE, is available. oRDY1 is the enable signal of the data transmitter of the first operand, and oRDY2 is that of the second. The two are linked with an AND (oRDY1 AND oRDY2) and yield the oRDY signal. oRDY is true only when both data transmitters are ready to send data. The oRDY(½) signals are often considered below in their AND-linked form as oRDY (=oRDY1 & oRDY2).
[0043] Output signals generated from the input signals and the status of the sync UNIT which, together with the sequence control of the EALU, represent the overall status of the PAE; those output signals are in turn regarded as input signals by the sync UNITs of the data transmitters and receivers. Status information and the F-PLUREG register are used for sequence control of the EALU.
-
- [0044] rRDY: Indicates that the PAE has finished its data processing and a result is available in R-REGsft. rRDY is transmitted as rRDYh and rRDYl to both data receivers. However, it is the same signal in each case.
- [0045] oACK: Indicates that the PAE has processed its operands and can receive new data in O-REG(sft). oACK is transmitted as oACK1 and oACK2 to both data transmitters. However, it is the same signal in each case.
[0046] The RDY signals retain their level up to the input of the acknowledgment through ACK. This is necessary when the data receiver is reconfigured while the data are being made available. If RDY is applied until acknowledged through ACK, the data receiver will recognize after the reconfiguration that data is available and will accept it.
[0047] The linking of the signals over multiple PAEs is as follows:
[0048]
| Data transmitter | PAE | Data receiver | |||
|---|---|---|---|---|---|
| rRDY | → | oRDY rRDY | → | oRDY | |
| rACK |  | oACK rACK | | oACK | |
[0049] This means that the output signal rRDY of the data transmitter, for example, represents the input signal oRDY1 or oRDY2 of PAE. The output signal rRDY of PAE is the input signal oRDY of the data receiver.
[0050] The sync UNIT has the following types of sequences:
[0051]
| Mode | Description | Comments | |
|---|---|---|---|
| Wait OP | The PAE waits for | Only if no | |
| operands | multiple-cycle | ||
| operation is | |||
| taking place | |||
| Cycle 1 | A single-cycle | Operands are | |
| operation is | acknowledged | ||
| being carried out | |||
| Cycle n | One cycle of a | — | |
| multiple-cycle | |||
| operation is | |||
| being carried out | |||
| Cycle Z | The last cycle of | Operands are | |
| a multiple-cycle | acknowledged | ||
| operation is | |||
| being carried out | |||
| Wait ERG | The PAE waits for | Only if a | |
| acknowledgment of | preceding result | ||
| the result | exists | ||
| Stop | Stops execution | — | |
| after conclusion | |||
| of the current | |||
| cycle, then | |||
| acknowledges | |||
| ReConfig if the | |||
| result has also | |||
| been acknowledged | |||
[0052] The sync UNIT makes available a special mode which enables the clock signal only when operands are available. This mode is appropriate especially when the data transmitters do not supply the data in each clock pulse of the processor but instead only in every nth clock pulse. Then the clock cycle corresponds to one period of the normal clock cycle and is enabled through rACK or oRDY(½). The enable is referred to as OneShot. This mode is called the OneShot MODE. The clock pulse is AND-linked with one of the enable signals through an AND gate. The mode and signal selection take place through F-PLUREG. The enable signal generated through rACK or oRDY(½) can be lengthened by the SM UNIT. This is necessary so that operations which need more than one cycle can be carried out in one-shot MODE. To make this possible, a corresponding signal line of the SM UNIT is OR-linked to the enable signal.
[0053] If the registry entry STOP is set in F-PLUREG, the sync UNIT runs the current function to the end. Thereafter, no more operands are accepted or acknowledged. As soon as rACK indicates that the result has been accepted by the data receiver, the readiness of the PLU for reconfiguration is indicated by the ReConfig signal. The signal is generated when rACK stores the stop of F-PLUREG in a D flip-flop. ReConfig can be polled by read access of the PLU to F-PLUREG at the stop bit position.
[0054] Likewise, the sync UNIT can be used to generate and analyze error states or other status signals.
BM UNIT
[0055] To apply the operands and the result to the external bus systems, there is a bus multiplex unit (BM UNIT). The BM UNIT has two multiplexers and two gates, with the two multiplexers being for the operands (O-MUX) and the two gates for the result (R-GATE), one switch being for the higher-order result and one for the low-order result. The multiplexers and switches are controlled over the multiplexer register (M-PLUREG). The sync UNIT signals are controlled over the switches to the bus. The correlation of the multiplexers/switches and signals is as follows:
- [0056] O-MUX1:oRDY1, oACK
- [0057] O-MUX2:oRDY2, oACK
- [0058] RH-GATE:rRDY, rACKh
- [0059] RL-GATE:rRDY, rACKl
[0060] The R-GATE can be brought by M-PLUREG to a state in which it does not drive a bus system.
[0061] The table gives a description of the signals and their respective interface architecture:
[0062]
| Signal | oRDY | oACK | rRDY | rACK | D7-0 |
|---|---|---|---|---|---|
| Indicates | operands | operands | result | result | data |
| ready | acknowl- | ready | acknowl- | ||
| edged | edged | ||||
| Type | input | open | driver | input | bidirectional |
| collector | |||||
[0063] It is possible to operate several data receivers from one data transmitter (broadcasting). To do so, several data receivers are connected to the same bus. To guarantee acknowledgment of the data, the driver stage of the acknowledgment line oACK is designed as an open collector driver. The bus operates as wired AND, i.e., only when all data receivers have acknowledged the data does the H level required for the acknowledgment occur. This is accomplished by the fact that this data receiver which does NOT acknowledge the data pulls the bus to an L level over an open collector transistor. Data receivers which acknowledge the data do not trigger the open collector transistor and thus add no load to the bus. When all the data receivers have acknowledged the data, there is no more load on the bus and it assumes an H level via a pull-up resistor.
State-Back UNIT
[0064] The PAE is capable of supplying feedback about its operating state to its primary logic unit, hereinafter called PLU (see DE 44 16 881 A1). The primary logic unit configures the PA and requires information about the status of the individual PAEs in order to be able to perform appropriate reconfigurations. This is done through the StateBack UNIT. This transmits either the lower 3-bit of the result from the R-REGsft—to deliver calculated values to the PLU—or the CarryOut-AlessB and AequalB-0detect signals to a 3-bit status bus, depending on the entry in the F-PLUREG. To allow signals to be impressed from several PAEs, a simple wired-OR method over open collector drivers is used. In order for the reconfiguration of the PAE to begin only when the receiver has acknowledged the data, a latch unit can be inserted between the signals and the open collector drivers to enable the signals only after receipt of rACK. The status bus is monitored by the PLU, which reacts by its program flow and reconfiguration to the status supplied by the bus.
Power UNIT
[0065] The PAE has a power-saving mode (Sleep MODE) which, like the function of the EALU, is set in F-PLUREG. There is a bit for this which, when set, starts the sleep MODE. To do so, either the clock line of the PAE is set at a constant logic 0 or 1, or the voltage of the PAE is turned off via a transistor. F-PLUREG is always energized within the PAE and cannot be switched off. Unused areas (gates) of the PAE for the function executed are switched off by analysis of the F-PLUREG. This is done through a transistor which isolates those areas from the power supply. To prevent unwanted interference, the outputs of the areas are defined over pull-up/pull-down resistors.
[0066] In addition, the power save MODE can also be used within the one-shot MODE which is controlled by the sync UNIT. All parts of the PAE except the F-PLUREG, M-PLUREG and sync UNIT are isolated from the power supply. Only when the sync UNIT senses a one-shot mode are all the required PAE parts connected over the power UNIT. The sync UNIT delays the clock signal until all the newly connected parts are capable of functioning.
Registers
[0067] The F-PLUREG and M-PLUREG registers are connected to the PLU bus. The addresses of the data packages sent by the PLU are decoded in a comparator. If the address of the PAE is recognized, the data is stored in the registers. The PLU bus has the following architecture:
- [0068] AX7-0: X address of the X/Y matrix
- [0069] AY7-0: Y address of the X/Y matrix
- [0070] RS: Register select; logic 0 selects F-PLUREG, logic 1 selects M-PLUREG
- [0071] AEN: Address enable; the bus contains a final address. The addresses must be decoded as long as AEN is logic 0. AEN is logic 0 during the entire bus access, i.e., also during the data transmission.
- [0072] D23-00: Data
- [0073] DEN: Data enable; the bus contains final data. The data must be transferred to the register at the rising edge of the DEN signal.
- [0074] OEN: Output enable; the PLU reads valid data out of the PLUREGs.
Architecture of F-PLUREG:
1. The Architecture of the Register in Write Access:
[0075]
| F11 | F10-9 | F8 | F8 | F5 | F4-0 |
|---|---|---|---|---|---|
| Stop | StateBack | Sleep | OneShot | PowerSave | EALU |
| function | |||||
[0076] The functions of the individual bits:
[0077]
| Function | State | Effect | |
|---|---|---|---|
| Stop | 0 | Normal function | |
| 1 | Stop functions after current cycle, no | ||
| acknowledgment of the operands | |||
| StateBack | 00 | No feedback, bus open | |
| 01 | D2-0 to bus | ||
| 10 | CarryOut-AlessB, AequalB-0detect to | ||
| bus | |||
| 11 | Illegal | ||
| Sleep | 0 | No function, de-energized | |
| 1 | Normal function, energized | ||
| OneShot | 00 | Normal function | |
| 01 | OneShot to oRDY1 | ||
| 10 | OneShot to oRDY2 | ||
| 11 | OneShot to (rACKh & rACKl) | ||
| PowerSave | 0 | No PowerSave | |
| 1 | Power-saving mode in combination | ||
| with one-shot mode | |||
| EALU | 00000 | No operation (NOP) | |
| function | |||
| 00001 | |||
| . .. | Function according to design of the | ||
| EALU | |||
| 11111 | |||
[0078] The reset state is 0 in all bits.
2. Register Architecture in Read Access:
[0079]
| F11 |
| ReConfig |
[0080] The functions of the individual bits:
[0081]
| Function | State | Effect | |
|---|---|---|---|
| ReConfig | 0 | No reconfiguration possible | |
| 1 | Reconfiguration possible | ||
[0082] The reset state is 0 in all bits.
Architecture of M-PLUREG:
[0083]
| M23-18 | M17-12 | M11-06 | M05-00 | |
|---|---|---|---|---|
| High-order | Low-order | Operand 1 | Operand 0 | |
| result | result | |||
[0084] The values M(n+5)−.n=000000, n ε {0,6,12,18} mean that the multiplexers/switches are open and have no bus contact. It may be appropriate to block M-PLUREG via the ReConfig signal, i.e., as soon as ReConfig is activated, PAE disconnects from all bus systems. The reset status is 0 in all bits.
Summary
[0085] The function of PAE can be configured and reconfigured more easily and quickly than in known technologies, in particular the FPGA technology. The interconnection of the ALU is specified in M-PLUREG, whereas in the traditional technologies a plurality of individual unrelated configuration bits must be occupied. The transparent architecture of the registers simplifies (re)configuration.
[0086] Due to the direct design as an ALU, the PAE requires less space than in traditional technologies where ALUs have been implemented by a plurality of logic cells. At the same time, the run delays are lower and the attainable clock frequencies are higher accordingly.
[0087] A broadcasting function is guaranteed due to the design of the BM UNIT, and acknowledgment is automatic. A data transfer that is largely independent in time is guaranteed due to the input and output registers (O-REG, R-REG).
[0088] Configuration and reconfiguration are greatly simplified due to the decoupling of each PAE from the overall system through the O-REG and R-REG registers since the individual PAEs are largely independent of one another. Feedback to the PLU as well as the interaction of STOP and ReConfig permit efficient control of (re)configuration.
[0089] Power-saving functions have been implemented which lead to a reduction in power consumption—automatically to some extent (one-shot MODE).
[0090] The PAE architecture can be implemented in the FPGAs to increase their efficiency. Arithmetic operations can thus be implemented much more efficiently.
Description of the Figures
[0091] Referring now to the figures, FIG. 1 shows a simplified processor according to German Patent 44 16 881 A1. The PLU (0101) and its bus system (0102) are shown. The PAEs (0103) are shown as an array, and the internal bus system (0104) in the chip is indicated schematically.
[0092] FIG. 2 shows the schematic architecture of a PAE. The internal bus system (0201) within the chip is connected to the BM UNIT (0202) which connects the buses selected by M-REG (0203) to O-REG1sft (0204) as operand 1 and O-REG (0205) as operand 2. The result available in result register R-REGsft (0207) is optionally introduced into the data path of operand 2 over R2O-MUX (0206). The data from O-REGsft (0204) and R2O-MUX (0206) are processed in the EALU (0208). Feedback goes to the PLU over the state-back UNIT (0209). The PLU bus (0210) is connected to the F-PLUREG (0211) and M-PLUREG (0212) registers and to the state-back UNIT (0209), and the PAE is configured and monitored over it. F-PLUREG contains all functional configuration data, M-PLUREG contains the interconnection information of the PAE. The sync UNIT (0212) controls the interaction of the data exchange between the data transmitters, the data receivers and the processing PAE. The SM UNIT (0213) controls the entire internal sequence of the PAE. The power UNIT (0214) regulates the power supply and serves to reduce power consumption.
[0093] FIG. 3 illustrates the functioning of the M-PLUREG and F-PLUREG registers. The AX and AY addresses of the PLU bus (0308) are compared with the address of PAE in a comparator (0301) if AEN (address enable) indicates a valid bus transfer. Each PAE has a unique address composed of its line and column within a PA. If DEN (data enable) indicates data transmission, then either M-PLUREG (0302) or F-PLUREG (0303) is selected over RS (register select). The data are stored in the respective register at the rising edge of DEN. The registers are implemented as D flip-flops (0304). Timing diagram 0305 illustrates the sequence. The ReConfig signal is sent from the sync UNIT to the PLU bus only over the gate (0306) for read access to the F-PLUREG. Enable is based on the result of the comparator (0301) AND the OEN signal.
[0094] FIG. 4 a shows a block diagram of O-REG. FIG. 4 b shows how the O-REG is constructed of D flip-flops. FIG. 4 c shows the timing diagram. The clock signal is generated by SYNC-SM.
[0095] FIG. 5 a shows a block diagram of O-REGsft. FIG. 5 b shows how O-REGsft is constructed of D flip-flops (0501). The AND gates (0502) and OR gates (0503) form, via the inverter (0504), a mode-controlled multiplexer (0506) which either switches the input data to the D flip-flops (0501) or sends the output data of the D flip-flops, shifted by one bit, to their inputs. The AND gate (0505) is not necessary, because one input is permanently at logic 0. It is shown only for the purpose of illustration. FIG. 5 c shows the timing diagram as a function of the signal mode. The clock pulse is generated by SYNC-SM.
[0096] FIG. 6 a shows the block architecture of R-REGsft. Upstream from the register (0601) there is a multiplexer (0602) which either switches the input data to the register (0601) or directs the shifted output data of the register (0601) to its input. The clock pulse generated by SYNC-SM is sent to the register, shifted by one half clock pulse. FIG. 6 b shows the block diagram on a gate level. Modes 0-2 switch a multiplexer (0606) consisting of AND gates with a downstream OR gate via a decoder (0603). Gates shown with dotted lines (0605, etc.) are shown only for the sake of illustration. They are functionless, because one input is constantly at L. The multiplexer switches the input signal to the registers (0607) in modes 0-2=010. In modes 0-2=000 to modes 0-2=001, the output values of the registers (0607) are shifted by one bit to the left, and in modes 0-2=011 to modes 0-2=100 they are shifted by two bits to the right and sent to the inputs of the registers. The timing diagram in FIG. 6 c illustrates the shift function, depending on modes 0-2.
[0097] FIG. 7 a shows the architecture of multiplexer R2O-MUX which sends the operands or the result to EALU as a function of mode. FIG. 7 a shows a traditional multiplexer design, while FIG. 7 b shows the space-saving and power-saving variant due to the use of CMOS transfer gates (0701). All the multiplexers described in this document can be constructed with transfer gates.
[0098] A gate may be composed of transfer gates in a design equivalent to that of the multiplexer. However, the direction of data exchange is exactly the opposite!
[0099] FIG. 8 shows the relationship of PAE-internal clock CLK to the activities taking place. At the rising edge (0801), operands are stored in the O-REG. During the H level (0802), PAE processes the data (ΔPAE=processing phase). This includes the data traffic between O-REG and R-REG. At the trailing edge (0803) the result is stored in R-REG. The L level (0804) is used for distribution of the BM UNIT enclosed in the bus system (Δnetwork=bus phase). The time sequence of signals (oRDY and oACK, rRDY and rACK) generated by SYNC-SM is shown in the time diagram.
[0100] FIG. 9 shows the sequence diagram of the sync UNIT. The state machine recognizes two fixed states, DATA (0901) and RESULT (0902). DATA is synchronized at the rising edge, RESULT at the trailing edge. The status of the input parameters is analyzed and, depending on the result, the machine jumps to the YES branch (0903/0904) or the NO branch (0905/0906). If the operands are not ready in DATA, the machine jumps to NO. No operation is carried out in the next steps until the machine jumps back according to DATA and performs an analysis again. If operands, indicated by oRDY, are ready, the operands are stored in O-REG (0907). The operands are processed (0908) and analyzed (0909) at the same time to ascertain whether it is the last cycle in multiple-cycle operations (serial operations requiring more than one clock cycle) or whether a single-cycle operation is taking place. In these cases, the operands are acknowledged by oACK (0910). RESULT is synchronized with the trailing edge, and a check is performed to determine whether the “result available” flag has been set (0911). This flag is always set when a finished result is signaled by rRDY (0912).
[0101] In two cases, the system jumps to the YES branch (0904):
- [0102] 1. There is no preceding result (“result available” flag is false).
- [0103] 2. There is a preceding result (“result available” flag is true) and it is acknowledged with rACK. In this case (and only in this case(!)) 0902 resets the result (0913).
[0104] Otherwise the system jumps to the NO branch (0906) and no operation is carried out until the state machine returns after RESULT (0902). In the YES branch (0904) the result is stored in output register R-REGsft (0914). It is then determined whether this is the last cycle of a multiple-cycle operation (0915) (cf. 0909) or a single-cycle operation; if yes, the presence of the result is signaled by rRDY (0916). The state machine returns after DATA (0901). The recognition of whether it is the last cycle of an operation—or a single-cycle operation—can be queried of the SM UNIT via the FINISH signal (0916). This is active when the last—or single—cycle takes place. The status of the sync UNIT is signaled to the SM UNIT via RUN (0917). RUN is active in the event an operation is taking place; otherwise it is inactive. The mechanism of the STOP entry in F-PLUREG and the ReConfig generated from this are not shown in FIG. 9 because the sequence is trivial and is apparent from the description of the sync UNIT.
[0105] FIG. 10 shows the basic architecture of the power UNIT. The sleep signal is sent from F-PLUREG to a transistor or a transistor stage (1001) which controls the power supply for all cell functions that can be switched off. The sync UNIT delivers the one-shot power-save signal (see FIG. 16 ) which enables the power supply of the remaining cell functions via a transistor or transistor stage (1002). Depending on the functions actually used in the cell, the transistors or transistor stages (1003) shut down the unneeded functions (power down). It is understandable that other similar means such as capacitors, etc., must be provided for proper power supply and EMC behavior.
[0106] FIG. 11 shows the implementation of the machine from FIG. 9 in the concept. The oRDY(½) and rACK signals are switched over the BM UNIT (1101) (in simplified terms—there is actually rACKh and RACKl, rACK=rACKl & rACKh) to the CCLK-controlled latches (1102). The latches are switched in such a way that-they are transparent in the L phase (bus phase) of CCLK and hold their status in the H phase (processing phase). The outputs of the latches make available the signals for the sync state machine (1103). rRDY (in simplified terms: there are actually rRDYh and rRDYl—they are completely identical but are sent to different receivers) from 1103 is switched to the bus over a gate. The oACK(½) signals from 1103 are negated in the BM UNIT (1101) and sent to the inverting open collector bus driver (1104). The bus is pulled to H over resistors (1105). The BM UNIT is switched so that the following cases occur:
- [0107] 1. If the corresponding bus is not driven by the BM UNIT, L is at the base of the transistors (1104). Therefore, they place no load on the bus.
- [0108] 2. If the corresponding bus is driven by the BM UNIT and the signal is not acknowledged, the base of the transistors (1104) is at H. This means that the bus is pulled to L. If a result is distributed to multiple data receivers by broadcasting, then all PAEs that have not yet acknowledged the result data and need waiting cycles pull the bus to L.
- [0109] 3. If the corresponding bus is driven by the BM UNIT and the signal is acknowledged, the base of the transistors (1104) is at L. This means that the bus is not placed under load. If a result is-distributed to multiple data receivers by broadcasting, all PAEs which have acknowledged the result data and do not need waiting cycles place no load on the bus.
[0110] In its initial state, the bus assumes the H level, i.e., acknowledgment, so non-acknowledgment according to case 2 overrides the acknowledgment by pulling the bus to L. The bus goes to the H level, i.e., the acknowledgment state, only when all PAEs acknowledge the result data. Thus, a wired-AND circuit is implemented. The sync state machine supplies the RUN signal (1107) to the SM UNIT (1106) which is running on the basis of RUN. If the SM UNIT is in the last—or only processing cycle—it signals this to the sync state machine via FINISH (1108). FINISH is analyzed in the analysis units to recognize the last cycle (0907, 0915). The SM UNIT runs in sync with the PAE-internal clock CLK.
[0111] FIG. 12 shows the architecture of the BM UNIT. Depending on the entries into M-PLUREG, the multiplexers (1201, 1202) switch the operands from the internal bus (1203) to O-REG. Likewise, the gates (1204, 1205) switch the upper and lower halves of the result to the bus. Multiplexer 1206 switches oRDY(½) according to the position of 1201 and 1202 and switches rACK according to the position of 1204 and 1205 from the bus to the PAE. The rACK signals of the two data receivers are linked together by AND. If there is only one data receiver, the multiplexer is switched so that it returns a logic 1 instead of the missing rACK. 1207 contains a gate for switching the oACK(½) and rRDY signals to the bus. The oACK(½) signals are first inverted and then switched to the bus over the open collector driver (1104).
[0112] FIG. 13 illustrates the architecture of an O-MUX. There is a 3:5 decoder (1301) for analyzing mode 2-0 signals from M-PLUREG. The multiplexer is constructed with AND gates (1302) and a downstream OR gate (1303). The analysis signal of mode 2-0=000 of the decoder (1301) is switched directly to the OR gate (1304). This causes logic 1 to always be returned in the open state, i.e., no connection to a bus system (see rACK in FIG. 12 ). Only a reduced bus size is shown for the sake of simplicity.
[0113] FIG. 14 shows the architecture of an R GATE. There is a 3:4 decoder (1401) for analyzing mode 2-0 signals from M-PLUREG. The analysis signal of mode 2-0=000 of the decoder is not used. Therefore, no bus connection is established with this bit combination. The gates (1402) are composed either of AND gates or transmission gates (see 0701). An amplifier stage for driving the bus load is connected upstream or downstream. Only a reduced bus size is shown for the sake of simplicity.
[0114] FIG. 15 shows the state-back UNIT. Depending on the setting in M-PLUREG, a multiplexer (1501) switches through either the signals CarryOut-AlessB, AequalB-0detect from the EALU or the outputs of R-REG R-REGD2-0. The signals go to an open collector transistor stage (1502) and are switched to the PLU bus. The PLU bus needs external pull-up resistors (1503) positioned near the PLU. Latch 1504 is optional. If it is inserted into the output signals of 1501, they are switched to the bus (1503) only after the data receiver has acknowledged the data via rACK. Consequently, the readiness for reconfiguration is indicated by the status signals only when the data have been accepted. This is normally regulated by the interaction of STOP and ReConfig in the sync UNIT. Therefore, the latch is optional. The rACK signal is used as the latch clock pulse. The latch is transparent at rACK=1 and saved at rACK=0.
[0115] FIG. 16 illustrates the operation of the one-shot MODE.
[0116] The signals
- [0117] 1. Vcc
- [0118] 2. oRDY1
- [0119] 3. oRDY2
- [0120] 4. (oRDY1 & rACK)
enable the cell clock via a multiplexer (1601) depending on the setting in F-PLUREG. The effect of the enable via Vcc is that the clock is always running (see “normal operation” in the timing diagram).
[0121] In the three remaining modes, the clock does not run until the signals or signal combinations enable the clock. The enable is synchronized to clock CCLK by a latch (1602), so the phase is not aborted prematurely when the enable signal is too short. The latch is transparent in the L phase of CCLK and holds its value in the H phase. The enable signal goes to the AND gate pair (1603 and 1604) which enables the clock. Inverted clock signal CCLK is generated by an inverter (1605); CLK runs through a time-delay element (1606) to guarantee phase coincidence (see “one-shot operation” in the timing diagram). CCLK is delayed over two delay pulses (1610) in the incoming line to 1604 to guarantee phase coincidence with CCLK which is applied to 1603 and has been delayed by the multiplexer (1608). If a PAE is brought into the power-save mode, the power supply of the cell is mostly shut down. This is done via OR gate 1611. If the power-save MODE has been activated, i.e., power save=1, the negated signal carries an L level. If one-shot MODE has also been switched on and register 1602 is at L, the power supply transistor in the power UNIT (see FIG. 17 ) is also switched off via the one-shot power-save signal. However, if register 1602 is at logic 1 (or power save=0), the power supply transistor is switched on via 1611. The following table gives an overview of the function:
[0122]
| Power | Latch | |||
|---|---|---|---|---|
| save | (1602) | Voltage | Comments | |
| L | X | on | ||
| H | L | off | only when one-shot MODE | |
| has been set! | ||||
| H | H | on | ||
[0123] When switching on the power supply, there is a wake-up time of fixed duration until the cell is capable of functioning. To nevertheless function properly, the signals must be delayed accordingly. Therefore, CCLK is sent over a delay line (1607). A multiplexer (1608) selects according to the power-save signal from F-PLUREG whether the normal or delayed clock pulse is sent to the cell. Only the uninverted clock pulse is delayed by the Δpower-on period; the inverted clock pulse is not delayed. Therefore, the result is available in synchronization with the remaining functions of the unit. Thus, the usable processing time is reduced to Δprocess. The maximum clock frequency of the unit thus depends on Δpower-on+cprocess (see “one-shot operation with power save” in the timing diagram).
[0124] FIG. 17 shows an example of implementation of a PAE. The BM unit, the power unit, the StateBack unit, the PLU bus and the M-PLUREG are not shown.
[0125] The PAE has three input registers oREG1 (1701), oREG2 (1702), oREG3 (1703) for the data to be processed. The input registers receive their data from preceding PAEs via the BM unit. All the input registers are registers without a shift function.
[0126] The F-PLUREGs (1704, 1705, 1706) determine a plurality of configurations of the PAEs. They are loaded by the PLU over the PLU bus. A configuration selected via the multiplexer (1723) is stored in each F-PLUREG. The multiplexer (1723) is controlled by the register (1724). The register (1724) receives data or triggers from a preceding PAE through the BM unit. This PAE is not identical to the PAEs which supply the data for the input registers. Of course, a larger or smaller number of F-PLUREGs is also conceivable.
[0127] The third input register oREG3 (1703) supplies the operand for a multiply-add function, where the contents of the oREG1 (1701) are multiplied by the contents of the oREG2 (1702) in the multiplier (1709) and then the contents of the oREG3 (1703) are added in the adder/comparator (1718). The adder/comparator is configured so that it performs an addition. If only multiplication is to be performed, the oREG3 (1703) is loaded with the value zero. If only addition is to be performed, the F-PLUREG switches the multiplexer (1711). Thus, the value of the oREG1 (1701) goes directly to the adder/comparator (1718). The second function of the adder/comparator (1718) takes the value of the oREG1 (1701) and the value of oREG3 (1703) and compares the two values. The output signals CarryOut-AlessB and AequalB-0detect (1719) indicate whether the two values are the same or the value of oREG3 (1703) is greater or less than the value of oREG1 (1701).
[0128] Additional functions implemented in the PAE include a shift register (1712), a divider (1713), logic functions (1714) and AND, OR, NOT and a counter (1715). The counter (1715) generates a trigger signal (1720) as soon as it has counted from a predetermined value to zero. The counter (1715) is loaded directly with the value also received by oREG3 (1703). It is also conceivable to use other counters, such as incremental counters which count from zero to a loaded value and then generate a trigger signal.
[0129] The results of the function units are relayed by the multiplexer (1716) to the two output registers rREG1 (1710) and rREG2 (1702) which are connected to the BM unit and thus relay the data to the downstream PAEs. The sequence is controlled by a sync unit (1708) connected to the trigger logic (1707). In addition, it exchanges control signals with the config state machine, guaranteeing the correct sequence when the configuration is changed by the multiplexer (1711). The trigger logic (1707) is connected to the F-PLUREG and analyzes the incoming signals (1722) in accordance with the configuration stored in the F-PLUREGs. The incoming signals include the ReConfig, the general trigger signal as well as the handshake signals oRDY and rACK. Depending on the configuration, the trigger logic (1707) delivers the handshake signals to the sync unit (1708), which in turn generates the enable signals for the input and output registers and the counter. In addition, the sync unit (1708) generates outgoing handshake signals oACK and rRDY, relaying them to the trigger logic (1707). Depending on the configuration, the signals (1719) or the trigger of the counter (1720) can be used as a general trigger signal and sent to the trigger logic (1707). The signals (1721) ReConfig, handshake signals oRDY and rACK and the general trigger signal are outgoing from the trigger logic (1707) and sent to the BM unit.
[0130] FIG. 18 shows a PAE with the same extent of functions as the PAE in FIG. 17 . Here again, the BM unit, the power unit, the StateBack unit and the M-PLUREG are not shown. It has three input registers oREG1 (1801), oREG2 (1802), oREG3 (1803), two output registers rREG1 (1804), rREG2 (1818), three F-PLUREGs (1813, 1814, 1815), a multiplexer (1817), one sync unit (1805) and one trigger logic (1806). The function units include a divider (1807), a multiplier (1817), an adder/comparator (1809), logic functions (1810), a shift register (1811) and a counter (1812). The function of the individual units corresponds to that described with regard to FIG. 17 . It is also conceivable to have additional functions integrated into the PAE, such as the trigonometric functions, root and exponential functions. This is of course also true of the PAE described with regard to FIG. 17 . The individual functions can be implemented as integers or as floating point units. In contrast with the PAE in FIG. 17 , the individual function units are linked by a bus system (1816), so that the individual functions can be interconnected in any sequence. The wiring is determined by the configuration stored in the F-PLUREGs. The bus system (1816) may have different designs. Possibilities include one or more segmented buses whose segments connect two functions that are wired together or a number of continuous buses wiring two function units together. In addition, there is the possibility of the individual functions and registers sending a target address with the help of which a connection is established.
[0131] FIG. 19 shows a config state machine which manages the configuration registers. At the start, the config state machine is in the IDLE state (1901). This state is not left until after a rRDY signal has been received from the config PAE selecting the configuration register. Then the config state machine enters the stop state (1902) and transmits a stop signal to the sync unit of the PAE. The PAE terminates its operation at the next possible time, sending a stop acknowledge signal to the config state machine. The latter goes into the reload state (1903) and transmits an enable signal to the register of the config PAE. Then the config state machine changes into the restart state (1904), sends a start signal to the sync unit, which resumes its processing. At the same time, it sends an rACK signal to the config PAE. Finally, the config state machine returns to the IDLE state (1901).
[0132] FIG. 20 shows a state machine for automatically running through the various configurations of the PAE, which is referred to below as a loop state machine. Since there are several F-PLUREGs, it is appropriate under some circumstances to perform multiple operations in succession and only then relay the data as well as the trigger signals and handshake signals to the downstream PAE.
[0133] The result of the individual operations is returned from the rREG of the PAE to the input registers via the feedback described above. This process can be controlled by an external stop loop signal or an internal counter.
[0134] At the beginning, the loop state machine is in the IDLE state (2001). In the IDLE state (2001) the loop state machine delivers a reset signal to a counter. This counter is used to dial the F-PLUREG. After the rRDY of the preceding PAE, the loop state machine enters the configuration state (2002), where it generates the handshake signals for the PAE and the control signals for the config state machine. In addition, an enable signal is generated for the counter, whose value is incremented by one. If the loop state machine then does not receive any stop loop signal or if the internal counter of the PAE has not yet reached its final value, it remains in the configuration state (2002), and the sequence described above is repeated. On arrival of a stop loop signal or when the internal counter of the PAE has reached its final value, the state machine returns to the IDLE state (2001) and the rRDY signal is relayed to the next PAE.
[0135] FIG. 21 illustrates the part of the PAE needed for the sequential run-through of the configurations stored in the F-PLUREG. The F-PLUREGs (2104) receive their data from the PLU (2107) and are slightly modified in comparison with the embodiments described previously. Each F-PLUREG contains an additional bit, the loop bit (2106). This loop bit is returned to the loop state machine (2102) described with regard to FIG. 20 through the link (2112). It functions there as a stop loop signal, i.e., with the loop bit (2106) set, the loop sequence is terminated; otherwise, it is continued until the loop stop bit is set, or the internal counter of the loop state machine (2101) described in conjunction with FIG. 20 has reached its final value. The loop state machine (2101) controls the counter (2102) whose value controls the selection of the F-PLUREG (2104) by the multiplexer (2105). The control signals of the config state machine and the handshake signals of the PAE are transmitted through the link (2113). The configuration data of the F-PLUREG is relayed over the link (2108) to the function units of the PAE.
[0136] The counter (2102) receives an enable signal (2110) so that the value of the counter (2102) is incremented. In addition, the loop state machine (2101) sends a reset signal (2111) to the counter as soon as a loop operation is concluded. A choice can be made between loop mode and the normal process in the PAE by way of the multiplexer (2103). In a normal sequence, the multiplexer (2103) relays a data (2109) for selection of an F-PLUREG (2104) to the multiplexer (2105).
Definition of Terms
-
- [0137] AequalB-0detect: Signal generated by the EALU, indicating in arithmetic operations that the result is equal to zero. In comparisons, it indicates that operand A is equal to operand B.
- [0138] ALU: Arithmetic and logic unit. Basic unit for processing data. The unit can perform arithmetic operations such as addition, subtraction or under some circumstances also multiplication, division, series expansions, etc. The unit may be designed as an integer unit or as a floating point unit. It may also perform logic operations such as AND, OR and comparisons.
- [0139] BM UNIT: Unit for connecting the data to the bus systems outside the PAE. The connection takes place via multiplexers for the data inputs and gates for the data outputs. oACK lines are implemented as open collector drivers. The BM UNIT is controlled by M-PLUREG.
- [0140] Broadcast: Transmitting data from a PAE to multiple data receivers.
- [0141] CarryOut-AlessB: Signal generated by the EALU which indicates a carry-over in arithmetic operations. In comparisons, it indicates that operand A is smaller than operand B.
- [0142] Data receiver: The unit(s) which processes further the results of the PAE.
- [0143] Data transmitter: The unit(s) which makes available the data for the PAE as operands.
- [0144] D flip-flop: Storage element that stores a signal at the rising edge of a clock pulse.
- [0145] EALU: Expanded arithmetic and logic unit.
[0146] An ALU expanded to add special functions which are needed or appropriate for the operation of a data processing system according to German Patent No. 44 16 881. These are counters in particular.
-
- [0147] FPGA: Known field-programmable gate array.
- [0148] F-PLUREG: Register in which the function of the PAE is set. The one-shot and sleep modes are also set here. The PLU writes into the register.
- [0149] Gate: Group of transistors that perform a basic logic function. Basic functions include, for example, NAND, NOR. Transmission gates.
- [0150] H level: Logic 1 level, depending on the technology used.
- [0151] Handshake: Signal protocol in which one signal A indicates a state and another signal B confirms that it accepts signal A and responds (has responded) to it.
- [0152] Configuring: Determining the function and interconnecting a logic unit, a (FPGA) cell or a PAE (see reconfiguring).
- [0153] Latch: Storage element which normally relays a signal transparently during the H level and stores it during the L level. Latches where the function of the levels is exactly reversed are occasionally used in PAEs, in which case an inverter is connected upstream from the clock of a conventional latch.
- [0154] L level: Logic 0 level, depending on the technology used.
- [0155] M-PLUREG: Register in which the interconnection of the PAE is set. The PLU writes into the register.
- [0156] Next-neighbor interconnection: Interconnection of bus systems with the adjacent neighbors abutting at the edges.
- [0157] O-MUX: Multiplexer within the BM UNIT which selects the bus system of the operands.
- [0158] One shot: Mode in which a PAE operates at a lower clock rate than the processor clock rate. The clock rate is synchronous with the processor clock rate and corresponds to one period.
[0159] There is no phase shift. The clock pulse is enabled by one of the signals oRDY(½) or rRDY. This mode serves to save power when the data transmitters or receivers are transmitting or receiving data at a slower rate than the processor clock rate.
-
- [0160] Open collector: Circuitry in which a bus signal pulled to the H level via a pull-up is applied to the collector of a transistor. The emitter of the transistor is grounded. If the transistor switches, the bus signal is pulled to the L level. The advantage of this method is that a plurality of such transistors can control the bus without electrical collision. The signals are OR linked, resulting in wired-OR.
- [0161] O-REG: Operand register for storing the operands of the EALU. It makes it possible for the PAE to be independent of the data transmitters in time and function. This simplifies data transfer because it can be asynchronous or packet-oriented. At the same time, the possibility of reconfiguring the data transmitters independently of the PAEs or reconfiguring the PAEs independently of the data transmitters is created.
- [0162] O-REGsft: O-REG with a shift register controlled by the SM UNIT.
- [0163] PA: Processing array: array of PAEs.
- [0164] PAE: Processing array element: EALU with O-REG, R-REG, R2O-MUX, F-PLUREG, M-PLUREG, BM UNIT, SM UNIT, sync UNIT, state-back UNIT and power UNIT.
- [0165] PLU: Unit for configuring and reconfiguring the PAW. Configured by a microcontroller adapted specifically to its task.
- [0166] Power-save MODE: Power-saving mode within the one-shot MODE. None of the parts of the PAE except the F-PLUREG, M-PLUREG and sync unit are supplied with voltage when no operation is being carried out.
- [0167] Power Unit: Unit which regulates the power-saving functions.
- [0168] Pull-down: Resistor which pulls a bus line to an L level.
- [0169] Pull-up: Resistor which pulls a bus line to an H level.
- [0170] R GATE: Switch within the BM UNIT which switches the result to the corresponding bus system. Some signals are switched over open collector drivers. The R GATE works as a bus driver and can enter a bus-neutral mode.
- [0171] R2O-MUX: Multiplexer for inserting the result in an R-REGsft into the data path between O-REG and EALU.
- [0172] R-REGsft: Result register for storing the result of the EALU. It makes it possible for the PAE to be independent, in time and function, of the data receivers. This simplifies data transfer because it can be asynchronous or packet-oriented. At the same time, this creates the possibility of reconfiguring the data receivers independently of the PAE or reconfiguring the PAE independently of the data receivers. The register is provided with a shift function which is controlled by the SM UNIT.
- [0173] Serial operations: Operations performed by serial processing of a data word or an algorithm. Serial multiplication, serial division, series expansion.
- [0174] Sleep MODE: Power-saving mode in which the PAE, except for F-PLUREG, carries no voltage.
- [0175] SM UNIT: State machine UNIT. State machine which controls the EALU.
- [0176] StateBack UNIT: Unit which controls the feedback of the status signals to the PLU. Consists of a multiplexer and an open collector bus driver stage.
- [0177] Sync UNIT: Unit responsible for the synchronization of the PAE with the data transmitters and receivers, which also monitors the reconfiguration of PAEs. At the same time, it assumes the one-shot functions.
- [0178] Gate: Switch that forwards or blocks a signal. Simple comparison: relay.
- [0179] Reconfiguring: New configuration of any number of PAEs while any remaining PAEs continue with the same function (see configuring).
- [0180] State machine: Logic which can assume various states. The transitions between the states depend on various input parameters. These are known machines that are used to control complex functions.
Conventions
Naming Conventions
- [0181] Component: UNIT
- [0182] Operating mode: MODE
- [0183] Multiplexer: MUX
- [0184] Negated signal: not
- [0185] Visible register for PLU: PLUREG
- [0186] Internal register: REG
- [0187] Shift registers: sft
- [0188] Function Conventions
Shift registers: sft
AND function: &
[0189]
OR function: #
|
OR function: #
[0190]
NOT function: !
|
NOT function: !
[0191]
GATE function: G
|
GATE function: G
[0192]
|
Claims
What is claimed is:
1. A Field Programmable Gate Array device that is configurable during runtime, comprising:
a plurality of configurable cells that are configurable by configuration information;
a configurable interconnect structure adapted to transmit data in an at least two-dimensional way, at least some of the plurality of configurable cells being configurable for connection to said interconnect structure, wherein said at least some configurable cells include units for arithmetic operations, at least one of the configurable cells that include units for arithmetic operations including:
an arithmetic operation unit, the arithmetic operation unit including a multiplier stage and an adder stage;
at least three inputs and at least one output for data;
at least three input registers;
at least one output register;
a return path; and
at least one multiplexer; and
an interconnection selection unit adapted to selectively interconnect said at least one of the configurable cells with others of the configurable cells;
wherein:
the at least three input registers and the at least one output register allow for decoupling of the at least three inputs and the at least one output from said interconnect by storing of operand inputs, the decoupling supporting at least one of pipelining and a decoupling during configuration;
said multiplier stage is connectable to: (a) at least two of the input registers for receiving an input of two operands; and (b) said adder stage, said connections to (a) and (b) being such that a selection can be made between at least two of:
(i) adding the two operand inputs;
(ii) adding an output of said multiplier stage and a further operand input;
(iii) adding the output of said multiplier stage and results of the at least one of the configurable cells; and
(iv) adding (a) one of the operand inputs and (b) at least one of the results of the at least one of the configurable cells;
said return path is adapted to return said results of said at least one of the configurable cells from the at least one output register as an operand via said at least one multiplexer, said at least one multiplexer selecting for further processing one of an external operand input and said results; and
said at least one multiplexer is arranged between at least one of said input registers and said adder stage so as to allow said at least one of the configurable cells to selectively have direct access to its own results which are returned as operands for calculations in a serial manner.
2. The device of claim 1, wherein the at least one of the configurable cells is configurable at run time in at least one of its interconnection and its function.
3. The device of claim 1, wherein the arithmetic operation unit of the at least one of the configurable cells provides shift capabilities.
5. The device of claim 1, further comprising:
an element for configuring and reconfiguring, the element transmitting to the at least one of the configurable cells data relating to a configurable function of the at least one of the configurable cells and data relating to an interconnection of stages within the at least one of the configurable cells.
6. The device of claim 1, further comprising:
an element for configuring and reconfiguring, said element for configuring and reconfiguring being adapted for accessing specific registers for at least one of:
storing the data relating to the configurable function;
selectively transferring to said specific registers the data relating to the configurable function; and
selectively transferring to said specific registers the data relating to the configurable interconnection.
7. The device of claim 5, wherein the data relating to the configurable function of and the interconnection of stages within the at least one of the configurable cells forms a configuration vector that is set through a function control interface and refers to a number of possible instructions, said possible instructions being such that, for any one of the number of possible instructions, a response of any one of the at least some of the plurality of configurable cells to said data that refers to the number of possible instructions is identical to a response of any other of the at least some of the plurality of configurable cells to said number of possible instructions, said responses remaining the same over time such that transmitted ones of the number of possible instructions statically correspond to a constant one of possible operations.
8. The device of claim 1, wherein:
a function and interconnection of the at least one the configurable cells are programmed in registers specifically accessible by an element for configuring and reconfiguring.
9. The device of claim 8, wherein the device is adapted for reconfiguring said plurality of configurable cells in their function and interconnection at run time such that data processing by at least some of said plurality of configurable cells is not inhibited while data relating to a configurable function of and an interconnection of stages within another of said plurality of configurable cells is transferred to ones of the specifically accessible registers.
10. The device of claim 9, wherein a register decoupling from a bus of said another configurable cell when said another configurable cell is reconfigured by the configuration information at runtime allows for the reconfiguration of said another configurable cell without an interfering effect on data transmitters and receivers in the at least some of said plurality of configurable cells, such that the at least some of said plurality of configurable cells are able to continue their data processing during the reconfiguration.
11. The device of claim 1, wherein said at least some configurable cells output, as a status signal, at least one of a carry-over signal, a A<B signal, and a zero signal, wherein A and B are the two operand inputs.
12. The device of claim 1, further comprising:
a plurality of configuration registers storing configuration information; and
a configuration multiplexer, wherein at least one of the configuration registers is selected via the configuration multiplexer for a reconfiguration of the plurality of configurable cells at runtime.
13. The device of claim 12, further comprising:
a selection device that outputs selection data that controls a selector setting of the configuration multiplexer, wherein which of the configuration registers is selected depends upon the selector setting.
14. The device of claim 13, wherein the selection device is a counter.
15. The device of claim 13, wherein the selection device traverses through a data sequence, the selection data that is output by the selection device depending upon a current point within the traversal.
16. The device of claim 13, wherein the configuration registers are associated with respective bits, each bit indicating a respective subsequent configuration to be loaded, the selection device outputting the selection data according to the bits.
17. The device of claim 13, wherein the configuration registers are associated with respective flags, each flag indicating a respective subsequent configuration to be loaded, the selection device outputting the selection data according to the flags.
18. The device of claim 1, wherein the at least one of the configurable cells is configurable at run time in its function.
19. The device of claim 3, wherein the function and interconnection of the at least one the configurable cells are programmed in components specifically accessible by an element for configuring and reconfiguring.
Patent Citations (552)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US2067477(A) | 1937-01-01 | Cooper | Applicant |
| US3242998(A) | 1966-03-01 | Gubbins | Applicant |
| US3681578(A) | 1972-08-01 | Stevens | Applicant |
| US3757608(A) | 1973-09-01 | Willner | Applicant |
| US3855577(A) | 1974-12-01 | Vandierendonck | Applicant |
| US4233667(A) | 1980-11-01 | Devine et al. | Applicant |
| US4414547(A) | 1983-11-01 | Knapp et al. | Applicant |
| US4498134(A) | 1985-02-01 | Hansen et al. | Examiner |
| US4498172(A) | 1985-02-01 | Bhavsar | Applicant |
| US4566102(A) | 1986-01-01 | Hefner | Applicant |
| US4590583(A) | 1986-05-01 | Miller | Applicant |
| US4591979(A) | 1986-05-01 | Iwashita | Applicant |
| US4663706(A) | 1987-05-01 | Allen et al. | Applicant |
| US4667190(A) | 1987-05-01 | Fant et al. | Applicant |
| US4682284(A) | 1987-07-01 | Schrofer | Applicant |
| US4706216(A) | 1987-11-01 | Carter | Applicant |
| US4720778(A) | 1988-01-01 | Hall et al. | Applicant |
| US4720780(A) | 1988-01-01 | Dolecek | Applicant |
| US4739474(A) | 1988-04-01 | Holsztynski | 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 | Applicant |
| US4852048(A) | 1989-07-01 | Moton | Applicant |
| US4860201(A) | 1989-08-01 | Miranker et al. | Applicant |
| US4870302(A) | 1989-09-01 | Freeman | Applicant |
| US4882687(A) | 1989-11-01 | Gordon | Applicant |
| US4891810(A) | 1990-01-01 | de Corlieu et al. | Applicant |
| US4901268(A) | 1990-02-01 | Judd | Applicant |
| US4910665(A) | 1990-03-01 | Mattheyses et al. | Applicant |
| US4918440(A) | 1990-04-01 | Furtek et al. | Applicant |
| US4967340(A) | 1990-10-01 | Dawes | Applicant |
| US4972314(A) | 1990-11-01 | Getzinger et al. | Applicant |
| US5010401(A) | 1991-04-01 | Murakami et al. | 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 |
| US5034914(A) | 1991-07-01 | Osterlund | Applicant |
| US5041924(A) | 1991-08-01 | Blackborow et al. | Applicant |
| US5043978(A) | 1991-08-01 | Nagler et al. | Applicant |
| US5047924(A) | 1991-09-01 | Matsubara et al. | Applicant |
| US5065308(A) | 1991-11-01 | Evans | Applicant |
| US5072178(A) | 1991-12-01 | Matsumoto | Applicant |
| US5081375(A) | 1992-01-01 | Pickett et al. | Applicant |
| US5099447(A) | 1992-03-01 | Myszewski | 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 |
| US5144166(A) | 1992-09-01 | Camarota et al. | Applicant |
| US5193202(A) | 1993-03-01 | Lee et al. | Applicant |
| US5203005(A) | 1993-04-01 | Horst | Applicant |
| US5204935(A) | 1993-04-01 | Mihara et al. | Applicant |
| US5208491(A) | 1993-05-01 | Ebeling et al. | Applicant |
| US5212716(A) | 1993-05-01 | Ferraiolo et al. | Applicant |
| US5218302(A) | 1993-06-01 | Loewe 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 |
| US5237686(A) | 1993-08-01 | Asano et al. | Applicant |
| US5247689(A) | 1993-09-01 | Ewert | Applicant |
| USRE34444(E) | 1993-11-01 | Kaplinsky | Applicant |
| US5274593(A) | 1993-12-01 | Proebsting | Applicant |
| US5276836(A) | 1994-01-01 | Fukumaru et al. | Applicant |
| US5287472(A) | 1994-02-01 | Horst | Applicant |
| US5287532(A) | 1994-02-01 | Hunt | Applicant |
| US5294119(A) | 1994-03-01 | Vincent et al. | Applicant |
| US5301284(A) | 1994-04-01 | Estes et al. | Applicant |
| US5301344(A) | 1994-04-01 | Kolchinsky | Applicant |
| US5303172(A) | 1994-04-01 | Magar et al. | Applicant |
| US5311079(A) | 1994-05-01 | Ditlow et al. | Applicant |
| US5327125(A) | 1994-07-01 | Iwase et al. | Applicant |
| US5336950(A) | 1994-08-01 | Popli et al. | Applicant |
| US5343406(A) | 1994-08-01 | Freeman et al. | Applicant |
| US5347639(A) | 1994-09-01 | Rechtschaffen et al. | Applicant |
| US5349193(A) | 1994-09-01 | Mott et al. | Applicant |
| US5353432(A) | 1994-10-01 | Richek et al. | Applicant |
| US5361373(A) | 1994-11-01 | Gilson | Applicant |
| US5379444(A) | 1995-01-01 | Mumme | Applicant |
| US5392437(A) | 1995-02-01 | Matter et al. | Applicant |
| US5410723(A) | 1995-04-01 | Schmidt et al. | Applicant |
| US5418952(A) | 1995-05-01 | Morley et al. | Applicant |
| US5418953(A) | 1995-05-01 | Hunt et al. | Applicant |
| US5421019(A) | 1995-05-01 | Holsztynski et al. | Applicant |
| US5422823(A) | 1995-06-01 | Agrawal et al. | Applicant |
| US5425036(A) | 1995-06-01 | Liu et al. | Applicant |
| US5426378(A) | 1995-06-01 | Ong | Applicant |
| US5428526(A) | 1995-06-01 | Flood et al. | Applicant |
| US5430687(A) | 1995-07-01 | Hung et al. | Applicant |
| US5440245(A) | 1995-08-01 | Galbraith et al. | Applicant |
| US5440538(A) | 1995-08-01 | Olsen 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 |
| US5465375(A) | 1995-11-01 | Thepaut et al. | Applicant |
| US5469003(A) | 1995-11-01 | Kean | 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 |
| US5475856(A) | 1995-12-01 | Kogge | 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 |
| US5530873(A) | 1996-06-01 | Takano | Applicant |
| US5530946(A) | 1996-06-01 | Bouvier 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 |
| US5537580(A) | 1996-07-01 | Giomi 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 | Kemeny et al. | Applicant |
| US5550782(A) | 1996-08-01 | Cliff 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 |
| US5574930(A) | 1996-11-01 | Halverson, Jr. et al. | Applicant |
| US5581731(A) | 1996-12-01 | King 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 |
| US5590348(A) | 1996-12-01 | Phillips et al. | Applicant |
| US5596742(A) | 1997-01-01 | Agarwal et al. | Applicant |
| US5600265(A) | 1997-02-01 | El Gamal Abbas et al. | Applicant |
| US5600845(A) | 1997-02-01 | Gilson | Applicant |
| US5611049(A) | 1997-03-01 | Pitts | Applicant |
| US5617547(A) | 1997-04-01 | Feeney et al. | Applicant |
| US5625806(A) | 1997-04-01 | Kromer | Applicant |
| US5625836(A) | 1997-04-01 | Barker et al. | Applicant |
| US5634131(A) | 1997-05-01 | Matter et al. | Applicant |
| US5646544(A) | 1997-07-01 | Iadanza | Applicant |
| US5646545(A) | 1997-07-01 | Trimberger et al. | Applicant |
| US5649176(A) | 1997-07-01 | Selvidge et al. | Applicant |
| US5649179(A) | 1997-07-01 | Steenstra et al. | Applicant |
| US5652529(A) | 1997-07-01 | Gould et al. | Applicant |
| US5652894(A) | 1997-07-01 | Hu et al. | Applicant |
| US5655069(A) | 1997-08-01 | Ogawara et al. | Applicant |
| US5655124(A) | 1997-08-01 | Lin | Applicant |
| US5657330(A) | 1997-08-01 | Matsumoto | Applicant |
| US5659797(A) | 1997-08-01 | Zandveld et al. | Applicant |
| US5675743(A) | 1997-10-01 | Mavity | Applicant |
| US5680583(A) | 1997-10-01 | Kuijsten | Applicant |
| US5694602(A) | 1997-12-01 | Smith | Applicant |
| US5713037(A) | 1998-01-01 | Wilkinson et al. | Applicant |
| US5717943(A) | 1998-02-01 | Barker et al. | Applicant |
| US5732209(A) | 1998-03-01 | Vigil et al. | Applicant |
| US5734921(A) | 1998-03-01 | Dapp et al. | Applicant |
| US5737516(A) | 1998-04-01 | Circello et al. | Applicant |
| US5737565(A) | 1998-04-01 | Mayfield | Applicant |
| US5742180(A) | 1998-04-01 | DeHon | Applicant |
| US5748872(A) | 1998-05-01 | Norman | Applicant |
| US5748979(A) | 1998-05-01 | Trimberger | Applicant |
| US5752035(A) | 1998-05-01 | Trimberger | Applicant |
| US5754459(A) | 1998-05-01 | Telikepalli | Applicant |
| US5754820(A) | 1998-05-01 | Yamagami | Applicant |
| US5754827(A) | 1998-05-01 | Barbier et al. | Applicant |
| US5754871(A) | 1998-05-01 | Wilkinson et al. | Applicant |
| US5760602(A) | 1998-06-01 | Tan | Applicant |
| US5761484(A) | 1998-06-01 | Agarwal et al. | Applicant |
| US5773994(A) | 1998-06-01 | Jones | Applicant |
| US5778439(A) | 1998-07-01 | Trimberger et al. | Applicant |
| US5781756(A) | 1998-07-01 | Hung | Applicant |
| US5784636(A) | 1998-07-01 | Rupp | Applicant |
| US5794059(A) | 1998-08-01 | Barker et al. | Applicant |
| US5794062(A) | 1998-08-01 | Baxter | Applicant |
| US5801547(A) | 1998-09-01 | Kean | Applicant |
| US5801715(A) | 1998-09-01 | Norman | Applicant |
| US5802290(A) | 1998-09-01 | Casselman | Applicant |
| US5821774(A) | 1998-10-01 | Veytsman et al. | Applicant |
| US5828229(A) | 1998-10-01 | Cliff et al. | Applicant |
| US5828858(A) | 1998-10-01 | Athanas | Applicant |
| US5831448(A) | 1998-11-01 | Kean | Applicant |
| US5838165(A) | 1998-11-01 | Chatter | Applicant |
| US5841973(A) | 1998-11-01 | Kessler et al. | Applicant |
| US5844422(A) | 1998-12-01 | Trimberger et al. | Applicant |
| US5844888(A) | 1998-12-01 | Markkula, Jr. et al. | Applicant |
| US5848238(A) | 1998-12-01 | Shimomura et al. | Applicant |
| US5854918(A) | 1998-12-01 | Baxter | Applicant |
| US5857097(A) | 1999-01-01 | Henzinger et al. | Applicant |
| US5859544(A) | 1999-01-01 | Norman | Applicant |
| US5862403(A) | 1999-01-01 | Kanai et al. | Applicant |
| US5865239(A) | 1999-02-01 | Carr | Applicant |
| US5867691(A) | 1999-02-01 | Shiraishi | Applicant |
| US5867723(A) | 1999-02-01 | Peters et al. | Applicant |
| US5870620(A) | 1999-02-01 | Kadosumi et al. | Applicant |
| US5884075(A) | 1999-03-01 | Hester et al. | Applicant |
| US5887162(A) | 1999-03-01 | Williams et al. | Applicant |
| US5887165(A) | 1999-03-01 | Martel et al. | Applicant |
| US5889533(A) | 1999-03-01 | Lee | Applicant |
| US5889982(A) | 1999-03-01 | Rodgers et al. | Applicant |
| US5892370(A) | 1999-04-01 | Eaton et al. | Applicant |
| US5892961(A) | 1999-04-01 | Trimberger et al. | Applicant |
| US5892962(A) | 1999-04-01 | Cloutier | Applicant |
| US5901279(A) | 1999-05-01 | Davis, III | Applicant |
| US5915123(A) | 1999-06-01 | Mirsky et al. | Applicant |
| US5924119(A) | 1999-07-01 | Sindhu et al. | Applicant |
| US5926638(A) | 1999-07-01 | Inoue | Applicant |
| US5927423(A) | 1999-07-01 | Wada et al. | Applicant |
| US5933023(A) | 1999-08-01 | Young | Applicant |
| US5933642(A) | 1999-08-01 | Baxter 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 |
| US5960193(A) | 1999-09-01 | Guttag et al. | Applicant |
| US5960200(A) | 1999-09-01 | Eager et al. | Applicant |
| US5966143(A) | 1999-10-01 | Breternitz, Jr. | Applicant |
| US5966534(A) | 1999-10-01 | Cooke et al. | Applicant |
| US5970254(A) | 1999-10-01 | Cooke et al. | Applicant |
| US5978260(A) | 1999-11-01 | Trimberger et al. | Applicant |
| US5978583(A) | 1999-11-01 | Ekanadham et al. | Applicant |
| US5996083(A) | 1999-11-01 | Gupta et al. | Examiner |
| US5999990(A) | 1999-12-01 | Sharrit et al. | Applicant |
| US6003143(A) | 1999-12-01 | Kim et al. | Applicant |
| US6011407(A) | 2000-01-01 | New | Applicant |
| US6014509(A) | 2000-01-01 | Furtek et al. | Applicant |
| US6020758(A) | 2000-02-01 | Patel et al. | Applicant |
| US6020760(A) | 2000-02-01 | Sample et al. | Applicant |
| US6021490(A) | 2000-02-01 | Vorbach et al. | Applicant |
| US6023564(A) | 2000-02-01 | Trimberger | Applicant |
| US6023742(A) | 2000-02-01 | Ebeling et al. | Applicant |
| US6026481(A) | 2000-02-01 | New et al. | Applicant |
| US6034538(A) | 2000-03-01 | Abramovici | Applicant |
| US6035371(A) | 2000-03-01 | Magloire | Applicant |
| US6038650(A) | 2000-03-01 | Vorbach et al. | Applicant |
| US6038656(A) | 2000-03-01 | Cummings et al. | Applicant |
| US6044030(A) | 2000-03-01 | Zheng et al. | Applicant |
| US6047115(A) | 2000-04-01 | Mohan et al. | Applicant |
| US6049222(A) | 2000-04-01 | Lawman | Applicant |
| US6052773(A) | 2000-04-01 | DeHon et al. | Applicant |
| US6054873(A) | 2000-04-01 | Laramie | Applicant |
| US6058469(A) | 2000-05-01 | Baxter | Applicant |
| US6077315(A) | 2000-06-01 | Greenbaum et al. | Applicant |
| US6081903(A) | 2000-06-01 | Vorbach et al. | Applicant |
| US6084429(A) | 2000-07-01 | Trimberger | Applicant |
| US6085317(A) | 2000-07-01 | Smith | Applicant |
| US6086628(A) | 2000-07-01 | Dave et al. | Applicant |
| US6088795(A) | 2000-07-01 | Vorbach et al. | Applicant |
| US6092174(A) | 2000-07-01 | Roussakov | Applicant |
| US6105105(A) | 2000-08-01 | Trimberger et al. | Applicant |
| US6105106(A) | 2000-08-01 | Manning | Applicant |
| US6108760(A) | 2000-08-01 | Mirsky et al. | Applicant |
| US6119181(A) | 2000-09-01 | Vorbach et al. | Applicant |
| US6122719(A) | 2000-09-01 | Mirsky et al. | Applicant |
| US6125408(A) | 2000-09-01 | McGee et al. | Applicant |
| US6127908(A) | 2000-10-01 | Bozler et al. | Applicant |
| US6134166(A) | 2000-10-01 | Lytle et al. | Applicant |
| US6137307(A) | 2000-10-01 | Iwanczuk et al. | Applicant |
| US6150837(A) | 2000-11-01 | Beal et al. | Applicant |
| US6150839(A) | 2000-11-01 | New et al. | Applicant |
| US6154048(A) | 2000-11-01 | Iwanczuk et al. | Applicant |
| US6154049(A) | 2000-11-01 | New | Applicant |
| US6157214(A) | 2000-12-01 | Marshall | Applicant |
| US6170051(B1) | 2001-01-01 | Dowling | Applicant |
| US6172520(B1) | 2001-01-01 | Lawman et al. | Applicant |
| US6173434(B1) | 2001-01-01 | Wirthlin et al. | Applicant |
| US6185256(B1) | 2001-02-01 | Saito et al. | Applicant |
| US6185731(B1) | 2001-02-01 | Maeda et al. | Applicant |
| US6188240(B1) | 2001-02-01 | Nakaya | Applicant |
| US6198304(B1) | 2001-03-01 | Sasaki | Applicant |
| US6201406(B1) | 2001-03-01 | Iwanczuk et al. | Applicant |
| US6202182(B1) | 2001-03-01 | Abramovici et al. | Applicant |
| US6204687(B1) | 2001-03-01 | Schultz et al. | Applicant |
| US6211697(B1) | 2001-04-01 | Lien et al. | Applicant |
| US6212650(B1) | 2001-04-01 | Guccione | Applicant |
| US6215326(B1) | 2001-04-01 | Jefferson et al. | Applicant |
| US6216223(B1) | 2001-04-01 | Revilla et al. | Applicant |
| US6219833(B1) | 2001-04-01 | Solomon et al. | Applicant |
| USRE37195(E) | 2001-05-01 | Kean | Applicant |
| US6230307(B1) | 2001-05-01 | Davis et al. | Applicant |
| US6240502(B1) | 2001-05-01 | Panwar et al. | Applicant |
| US6243808(B1) | 2001-06-01 | Wang | Applicant |
| US6252792(B1) | 2001-06-01 | Marshall et al. | Applicant |
| US6256724(B1) | 2001-07-01 | Hocevar et al. | Applicant |
| US6260179(B1) | 2001-07-01 | Ohsawa et al. | Applicant |
| US6262908(B1) | 2001-07-01 | Marshall et al. | Applicant |
| US6263430(B1) | 2001-07-01 | Trimberger et al. | Applicant |
| US6279077(B1) | 2001-08-01 | Nasserbakht et al. | Applicant |
| US6282627(B1) | 2001-08-01 | Wong et al. | Applicant |
| US6282701(B1) | 2001-08-01 | Wygodny et al. | Applicant |
| US6285624(B1) | 2001-09-01 | Chen | Applicant |
| US6286134(B1) | 2001-09-01 | Click, Jr. et al. | Applicant |
| US6288566(B1) | 2001-09-01 | Hanrahan et al. | Applicant |
| US6289440(B1) | 2001-09-01 | Casselman | Applicant |
| US6298472(B1) | 2001-10-01 | Phillips et al. | Applicant |
| US6301706(B1) | 2001-10-01 | Maslennikov et al. | Applicant |
| US6311200(B1) | 2001-10-01 | Hanrahan et al. | Applicant |
| US6311265(B1) | 2001-10-01 | Beckerle et al. | Applicant |
| US6321366(B1) | 2001-11-01 | Tseng et al. | Applicant |
| US6321373(B1) | 2001-11-01 | Ekanadham et al. | Applicant |
| US6338106(B1) | 2002-01-01 | Vorbach 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 |
| US6353841(B1) | 2002-03-01 | Marshall et al. | Applicant |
| US6362650(B1) | 2002-03-01 | New et al. | Applicant |
| US6370596(B1) | 2002-04-01 | Dakhil | Applicant |
| US6373779(B1) | 2002-04-01 | Pang et al. | Applicant |
| US6378068(B1) | 2002-04-01 | Foster et al. | Applicant |
| US6389379(B1) | 2002-05-01 | Lin et al. | Applicant |
| US6389579(B1) | 2002-05-01 | Phillips et al. | Applicant |
| US6392912(B1) | 2002-05-01 | Hanrahan et al. | Applicant |
| US6398383(B1) | 2002-06-01 | Huang | Applicant |
| US6400601(B1) | 2002-06-01 | Sudo et al. | Applicant |
| US6404224(B1) | 2002-06-01 | Azegami et al. | Applicant |
| US6405299(B1) | 2002-06-01 | Vorbach et al. | Applicant |
| US6421809(B1) | 2002-07-01 | Wuytack et al. | Applicant |
| US6421817(B1) | 2002-07-01 | Mohan et al. | Applicant |
| US6425054(B1) | 2002-07-01 | Nguyen | Applicant |
| US6425068(B1) | 2002-07-01 | Vorbach et al. | Applicant |
| US6427156(B1) | 2002-07-01 | Chapman et al. | Applicant |
| US6430309(B1) | 2002-08-01 | Pressman et al. | Applicant |
| US6434642(B1) | 2002-08-01 | Camilleri et al. | Applicant |
| US6434695(B1) | 2002-08-01 | Esfahani et al. | Applicant |
| US6434699(B1) | 2002-08-01 | Jones et al. | Applicant |
| US6437441(B1) | 2002-08-01 | Yamamoto | Applicant |
| US6438747(B1) | 2002-08-01 | Schreiber et al. | Applicant |
| US6457116(B1) | 2002-09-01 | Mirsky et al. | Applicant |
| US6476634(B1) | 2002-11-01 | Bilski | Applicant |
| US6477643(B1) | 2002-11-01 | Vorbach et al. | Applicant |
| US6480937(B1) | 2002-11-01 | Vorbach et al. | Applicant |
| US6480954(B2) | 2002-11-01 | Trimberger et al. | Applicant |
| US6487709(B1) | 2002-11-01 | Keller et al. | Applicant |
| US6490695(B1) | 2002-12-01 | Zagorski et al. | Applicant |
| US6496971(B1) | 2002-12-01 | Lesea et al. | Applicant |
| US6504398(B1) | 2003-01-01 | Lien et al. | Applicant |
| US6513077(B2) | 2003-01-01 | Vorbach et al. | Applicant |
| US6516382(B2) | 2003-02-01 | Manning | Applicant |
| US6518787(B1) | 2003-02-01 | Allegrucci et al. | Applicant |
| US6519674(B1) | 2003-02-01 | Lam et al. | Applicant |
| US6523107(B1) | 2003-02-01 | Stansfield et al. | Applicant |
| US6525678(B1) | 2003-02-01 | Veenstra et al. | Applicant |
| US6526520(B1) | 2003-02-01 | Vorbach et al. | Applicant |
| US6538468(B1) | 2003-03-01 | Moore | Applicant |
| US6539477(B1) | 2003-03-01 | Seawright | Applicant |
| US6542394(B2) | 2003-04-01 | Marshall et al. | Applicant |
| US6542844(B1) | 2003-04-01 | Hanna | Applicant |
| US6542998(B1) | 2003-04-01 | Vorbach et al. | Applicant |
| US6553395(B2) | 2003-04-01 | Marshall et al. | Applicant |
| US6567834(B1) | 2003-05-01 | Marshall et al. | Applicant |
| US6571381(B1) | 2003-05-01 | Vorbach et al. | Applicant |
| US6587939(B1) | 2003-07-01 | Takano | Applicant |
| US6631487(B1) | 2003-10-01 | Abramovici et al. | Applicant |
| US6633181(B1) | 2003-10-01 | Rupp | Applicant |
| US6657457(B1) | 2003-12-01 | Hanrahan et al. | Applicant |
| US6658564(B1) | 2003-12-01 | Smith et al. | Applicant |
| US6687788(B2) | 2004-02-01 | Vorbach et al. | Applicant |
| US6697979(B1) | 2004-02-01 | Vorbach et al. | Applicant |
| US6704816(B1) | 2004-03-01 | Burke | Applicant |
| US6708325(B2) | 2004-03-01 | Cooke et al. | Applicant |
| US6717436(B2) | 2004-04-01 | Kress et al. | Applicant |
| US6721830(B2) | 2004-04-01 | Vorbach et al. | Applicant |
| US6728871(B1) | 2004-04-01 | Vorbach et al. | Applicant |
| US6754805(B1) | 2004-06-01 | Juan | Applicant |
| US6757847(B1) | 2004-06-01 | Farkash et al. | Applicant |
| US6757892(B1) | 2004-06-01 | Gokhale et al. | Applicant |
| US6782445(B1) | 2004-08-01 | Olgiati et al. | Applicant |
| US6785826(B1) | 2004-08-01 | Durham et al. | Examiner |
| US6803787(B1) | 2004-10-01 | Wicker, Jr. | Applicant |
| US6820188(B2) | 2004-11-01 | Stansfield et al. | Applicant |
| US6847370(B2) | 2005-01-01 | Baldwin et al. | Applicant |
| US6868476(B2) | 2005-03-01 | Rosenbluth et al. | Applicant |
| US6871341(B1) | 2005-03-01 | Shyr | Applicant |
| US6874108(B1) | 2005-03-01 | Abramovici et al. | Applicant |
| US6886092(B1) | 2005-04-01 | Douglass et al. | Applicant |
| US6901502(B2) | 2005-05-01 | Yano et al. | Applicant |
| US6928523(B2) | 2005-08-01 | Yamada | Applicant |
| US6961924(B2) | 2005-11-01 | Bates et al. | Applicant |
| US6977649(B1) | 2005-12-01 | Baldwin et al. | Applicant |
| US7000161(B1) | 2006-02-01 | Allen et al. | Applicant |
| US7007096(B1) | 2006-02-01 | Lisitsa et al. | Applicant |
| US7010667(B2) | 2006-03-01 | Vorbach et al. | Applicant |
| US7038952(B1) | 2006-05-01 | Zack et al. | Applicant |
| US7210129(B2) | 2007-04-01 | May et al. | Applicant |
| US7216204(B2) | 2007-05-01 | Rosenbluth et al. | Applicant |
| US7237087(B2) | 2007-06-01 | Vorbach et al. | Applicant |
| US7249351(B1) | 2007-07-01 | Songer et al. | Applicant |
| US7254649(B2) | 2007-08-01 | Subramanian et al. | Applicant |
| US7340596(B1) | 2008-03-01 | Crosland et al. | Applicant |
| US7350178(B1) | 2008-03-01 | Crosland et al. | Applicant |
| US2001/0001860(A1) | 2001-05-01 | Beiu | Applicant |
| US2001/0010074(A1) | 2001-07-01 | Nishihara et al. | Applicant |
| US2001/0018733(A1) | 2001-08-01 | Fujii et al. | Applicant |
| US2001/0032305(A1) | 2001-10-01 | Barry | Applicant |
| US2002/0013861(A1) | 2002-01-01 | Adiletta et al. | Applicant |
| US2002/0038414(A1) | 2002-03-01 | Taylor et al. | Applicant |
| US2002/0045952(A1) | 2002-04-01 | Blemel | Applicant |
| US2002/0083308(A1) | 2002-06-01 | Pereira et al. | Applicant |
| US2002/0103839(A1) | 2002-08-01 | Ozawa | Applicant |
| US2002/0124238(A1) | 2002-09-01 | Metzgen | Applicant |
| US2002/0138716(A1) | 2002-09-01 | Paul et al. | Applicant |
| US2002/0143505(A1) | 2002-10-01 | Drusinsky | Applicant |
| US2002/0144229(A1) | 2002-10-01 | Hanrahan | Applicant |
| US2002/0165886(A1) | 2002-11-01 | Lam | Applicant |
| US2003/0001615(A1) | 2003-01-01 | Sueyoshi et al. | Applicant |
| US2003/0014743(A1) | 2003-01-01 | Cooke et al. | Applicant |
| US2003/0046607(A1) | 2003-03-01 | Vorbach | Applicant |
| US2003/0052711(A1) | 2003-03-01 | Taylor et al. | Applicant |
| US2003/0055861(A1) | 2003-03-01 | Lai et al. | Applicant |
| US2003/0056085(A1) | 2003-03-01 | Vorbach | Applicant |
| US2003/0056091(A1) | 2003-03-01 | Greenberg | Applicant |
| US2003/0056202(A1) | 2003-03-01 | Vorbach | Applicant |
| US2003/0061542(A1) | 2003-03-01 | Bates et al. | Applicant |
| US2003/0062922(A1) | 2003-04-01 | Douglass et al. | Applicant |
| US2003/0086300(A1) | 2003-05-01 | Noyes et al. | Applicant |
| US2003/0093662(A1) | 2003-05-01 | Vorbach et al. | Applicant |
| US2003/0097513(A1) | 2003-05-01 | Vorbach et al. | Applicant |
| US2003/0123579(A1) | 2003-07-01 | Safavi et al. | Applicant |
| US2003/0135686(A1) | 2003-07-01 | Vorbach et al. | Applicant |
| US2003/0192032(A1) | 2003-10-01 | Andrade et al. | Applicant |
| US2004/0015899(A1) | 2004-01-01 | May et al. | Applicant |
| US2004/0025005(A1) | 2004-02-01 | Vorbach et al. | Applicant |
| US2004/0168099(A1) | 2004-08-01 | Vorbach et al. | Applicant |
| US2004/0199688(A1) | 2004-10-01 | Vorbach et al. | Applicant |
| US2005/0066213(A1) | 2005-03-01 | Vorbach et al. | Applicant |
| US2005/0144210(A1) | 2005-06-01 | Simkins et al. | Applicant |
| US2005/0144212(A1) | 2005-06-01 | Simkins et al. | Applicant |
| US2005/0144215(A1) | 2005-06-01 | Simkins et al. | Applicant |
| US2006/0230094(A1) | 2006-10-01 | Simkins et al. | Applicant |
| US2006/0230096(A1) | 2006-10-01 | Thendean et al. | Applicant |
| DE4416881 | 1993-05-01 | Applicant | |
| DE4221278 | 1994-01-01 | Applicant | |
| DE3855673 | 1996-11-01 | Applicant | |
| DE19654593 | 1998-07-01 | Applicant | |
| DE19654595 | 1998-07-01 | Applicant | |
| DE19654846 | 1998-07-01 | Applicant | |
| DE19704044 | 1998-08-01 | Applicant | |
| DE19704728 | 1998-08-01 | Applicant | |
| DE19704742 | 1998-09-01 | Applicant | |
| DE19651075 | 1998-10-01 | Applicant | |
| DE19222776 | 1999-03-01 | Applicant | |
| DE19807872 | 1999-08-01 | Applicant | |
| DE19861088 | 2000-02-01 | Applicant | |
| DE19926538 | 2000-12-01 | Applicant | |
| DE10028397 | 2001-12-01 | Applicant | |
| DE10036627 | 2002-02-01 | Applicant | |
| DE10129237 | 2002-04-01 | Applicant | |
| DE10204044 | 2003-08-01 | Applicant | |
| EP208457 | 1987-01-01 | Applicant | |
| EP221360 | 1987-05-01 | Applicant | |
| EP398552 | 1990-11-01 | Applicant | |
| EP428327 | 1991-05-01 | Applicant | |
| EP428327(A1) | 1991-05-01 | Applicant | |
| EP748051(A2) | 1991-12-01 | Applicant | |
| EP463721 | 1992-01-01 | Applicant | |
| EP477809 | 1992-04-01 | Applicant | |
| EP485690 | 1992-05-01 | Applicant | |
| EP497029 | 1992-08-01 | Applicant | |
| EP539595 | 1993-05-01 | Applicant | |
| EP539596(A1) | 1993-05-01 | Applicant | |
| EP628917 | 1994-12-01 | Applicant | |
| EP678985 | 1995-10-01 | Applicant | |
| EP686915 | 1995-12-01 | Applicant | |
| EP707269(A) | 1996-04-01 | Applicant | |
| EP726532 | 1996-08-01 | Applicant | |
| EP726532 | 1996-08-01 | Applicant | |
| EP735685 | 1996-10-01 | Applicant | |
| EP835685 | 1996-10-01 | Applicant | |
| EP735685 | 1996-10-01 | Applicant | |
| EP746106 | 1996-12-01 | Applicant | |
| EP748051 | 1996-12-01 | Applicant | |
| EP748051(A2) | 1996-12-01 | Applicant | |
| EP735685 | 1998-10-01 | Applicant | |
| EP926594 | 1999-06-01 | Applicant | |
| EP726532 | 2000-08-01 | Applicant | |
| EP1061439 | 2000-12-01 | Applicant | |
| EP1102674 | 2001-05-01 | Applicant | |
| EP1115204 | 2001-07-01 | Applicant | |
| EP1146432 | 2001-10-01 | Applicant | |
| EP696001 | 2001-12-01 | Applicant | |
| EP1669885 | 2006-06-01 | Applicant | |
| FR2752466 | 1998-02-01 | Applicant | |
| GB2304438 | 1997-03-01 | Applicant | |
| JP58-58672 | 1983-04-01 | Applicant | |
| JP2-130023 | 1990-05-01 | Applicant | |
| JP2-226423 | 1990-09-01 | Applicant | |
| JP5-276007 | 1993-10-01 | Applicant | |
| JP7-154242 | 1995-06-01 | Applicant | |
| JP8-44581 | 1996-02-01 | Applicant | |
| JP8069447 | 1996-03-01 | Applicant | |
| JP8-250685 | 1996-09-01 | Applicant | |
| JP9-27745 | 1997-01-01 | Applicant | |
| JP11-307725 | 1999-11-01 | Applicant | |
| JP2000-076066 | 2000-03-01 | Applicant | |
| JP2000-181566 | 2000-06-01 | Applicant | |
| JP2000-201066 | 2000-07-01 | Applicant | |
| JP2000-311156 | 2000-11-01 | Applicant | |
| JP2001-500682 | 2001-01-01 | Applicant | |
| JP5-509184 | 2003-12-01 | Applicant | |
| WOA9004835 | 1990-05-01 | Applicant | |
| WO90/11648 | 1990-10-01 | Applicant | |
| WO92/01987 | 1992-02-01 | Applicant | |
| WOA9311503 | 1993-06-01 | Applicant | |
| WO94/06077 | 1994-03-01 | Applicant | |
| WO94/08399 | 1994-04-01 | Applicant | |
| WO95/00161 | 1995-01-01 | Applicant | |
| WO95/26001 | 1995-09-01 | Applicant | |
| WO98/10517 | 1998-03-01 | Applicant | |
| WO98/26356 | 1998-06-01 | Applicant | |
| WO98/28697 | 1998-07-01 | Applicant | |
| WO98/29952 | 1998-07-01 | Applicant | |
| WO98/31102 | 1998-07-01 | Applicant | |
| WO98/35299 | 1998-08-01 | Applicant | |
| WO99/00731 | 1999-01-01 | Applicant | |
| WO99/00739 | 1999-01-01 | Applicant | |
| WO99/12111 | 1999-03-01 | Applicant | |
| WO99/32975 | 1999-07-01 | Applicant | |
| WO99/40522 | 1999-08-01 | Applicant | |
| WO99/44120 | 1999-09-01 | Applicant | |
| WO99/44147 | 1999-09-01 | Applicant | |
| WO/17771 | 2000-03-01 | Applicant | |
| WO/38087 | 2000-06-01 | Applicant | |
| WO2000/045282 | 2000-08-01 | Applicant | |
| WO/49496 | 2000-08-01 | Applicant | |
| WO/77652 | 2000-12-01 | Applicant | |
| WO1/55917 | 2001-08-01 | Applicant | |
| WO2/13000 | 2002-02-01 | Applicant | |
| WO2/21010 | 2002-03-01 | Applicant | |
| WO2/29600 | 2002-04-01 | Applicant | |
| WO2/50665 | 2002-06-01 | Applicant | |
| WO2/071196 | 2002-09-01 | Applicant | |
| WO2/071248 | 2002-09-01 | Applicant | |
| WO2/071249 | 2002-09-01 | Applicant | |
| WO2/103532 | 2002-12-01 | Applicant | |
| WO3/017095 | 2003-02-01 | Applicant | |
| WO3/023616 | 2003-03-01 | Applicant | |
| WO3/025781 | 2003-03-01 | Applicant | |
| WO3/032975 | 2003-04-01 | Applicant | |
| WO3/036507 | 2003-05-01 | Applicant | |
| WO2004/053718 | 2004-06-01 | Applicant | |
| WO2004/114128 | 2004-12-01 | Applicant | |
| WO2005/045692 | 2005-03-01 | Applicant |
Non-Patent Literature (169)
- 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
- Athanas, Peter, et al., Quantitative analysis of floating point arithmetic on FPGA based custom computing machines, IEE Computer Society Press, Apr. 19-21, 1995 pp. i-vii, 1-222.Applicant
- M. Morris Mano, “Digital Design,” by Prentice Hall, Inc., Englewood Cliffs, New Jersey 07632, 1984, pp. 119-125, 154-161.Applicant
- M. Saleeba, “A Self-Contained Dynamically Reconfigurable Proessor Architecture”, Sixteenth Australian Computer Science Coinferene, ASCS-16, QLD, Australia, Feb. 1993.Applicant
- Maxfield, C. “Logic that Mutates While-U-Wait” EDN (Bur. Ed.) (USA), EDN (European Edition), Nov. 7, 1996, Cahners Publishing, USA.Applicant
- Myers, G., Advances in Computer Architecture Wiley-Interscience Publication, 2nd ed., John Wiley & Sons, Inc. pp. 463-494, 1978.Applicant
- Norman, Richard S., Hyperchip Business Summary, The Opportunity, Jan. 31, 2000, pp. 1-3.Applicant
- Villasenor, John, et al., “Configurable Computing Solutions for Automatic Target Recogition,” IEEE, 1996 pp. 70-79.Applicant
- Villasenor, John, et al., “Configurable Computing.” Scientific American, vol. 276, No. 6, Jun. 1997, pp. 66-71.Applicant
- Ade et al., “Minimum Memory Buffers in DSP Applications,” Electronics Letters, vol. 30, No. 6, Mar. 17, 1994, pp. 469-471.Applicant
- Alippi, et al., Determining the Optimum Extended Instruction Set Architecture for Application Specific Reconfigurable VLIW, CPUs, IEEE., 2001, pp. 50-56.Applicant
- Arabi et al., “PLD Integrates Dedicated High-speed Data Buffering, Complex State Machine, and Fast Decode Array,” conference record on WESCON '93, Sep. 28, 1993, pp. 432-436.Applicant
- Athanas, “A Functional Reconfigurable Architecture and Compiler for Adoptive Computing,”, IEEE, pp. 49-55.Applicant
- Athanas, et al., “An Adaptive Hardware Machine Architecture and Compiler for Dynamic Processor Reconfiguration”, IEEE, Laboratory for Engineering Man/Machine Systems Division of Engineering, Box D, Brown University Providence, Rhode Island, 1991, pp. 397-400.Applicant
- Baumgarte, et al., PACT XPP “A Self-reconfigurable Data Processing Architecture,” PACT Info. GMBH, Munchen Germany 2001, 7 pages.Applicant
- Beck et al., “From control flow to data flow,” TR 89-1050, Oct. 1989, Dept. of Computer Science, Cornell University, Ithaca, NY, pp. 1-25.Applicant
- Becker, et al., “Parallelization in Co-compilation for Configurable Accelerators—a Host/accelerator Partitioning Compilation Method,” proceedings of Asia and South Pacific Design Automation Conference, Yokohama, Japan, Feb. 10-13, 1998, 11 pages.Applicant
- Cadambi et al., “Managing Pipeline-reconfigurable FPGAs,” ACM, 1998, pp. 55-64.Applicant
- Callahan, et al. “The Garp Architecture and C Copiler,” Computer, Apr. 2000, pp. 62-69.Applicant
- Cardoso, “Compilation of Java™ Algorithms onto Reconfigurable Computing Systems with Exploitation of Operation-Level Parallelism,” Ph.D. Thesis, Universidade Tecnica de Lisboa (UTL), Lisbon, Portugal Oct. 2000 (Table of Contents and English Abstract only).Applicant
- Diniz,. et al., “Automatic Synthesis of Data Storage and Control Structures for FPGA-based Computing Engines”, 2000, IEEE, pp. 91-100.Applicant
- Donandt, “Improving Response Time of Programmable Logic Controllers by Use of a Boolean Coprocessor”, AEG Research Institute Berlin, IEEE, 1989, pp. 4-167-4-169.Applicant
- Dutt, et al., If Software is King for Systems-on-Silicon, What's New in Compiler?, IEEE., 1997, pp. 322-325.Applicant
- Ferrante, et al., “The Program Dependence Graph and its Use in Optimization ACM Transactions on Programming Languages and Systems,” Jul. 1987, USA, [online] Bd. 9, Nr., 3, pp. 319-349, XP002156651 ISSN: 0164-0935 ACM Digital Library.Applicant
- Fineberg, et al., “Experimental Analysis of a Mixed-Mode Parallel Architecture Using Bitonic Sequence Sorting”, vol. 11. No. 3, Mar. 1991, pp. 239-251.Applicant
- Fornaciari, et al., System-level power evaluation metrics, 1997 Proceedings of the 2nd Annual IEEE International Conference on Innovative Systems in Silicon, New York, NY, Oct. 1997, pp. 323-330.Applicant
- Gokhale, et al., “Automatic Allocation of Arrays to Memories in FPGA processors with Multiple Memory Banks”, Field-Programmable Custom Computing Machines, 1999, IEEE, pp. 63-67.Applicant
- Hammes, et al., “Cameron: High Level Language Compilation for Reconfigurable Systems,” Department of Computer Science, Colorado State University, Conference on Parallel Architectures and Compilation Techniques, Oct. 12-16, 1999, 9 pages.Applicant
- Hauck ,“The Roles of FPGA's in Reprogrammable Systems,” IEEE, Apr. 1998, pp. 615-638.Applicant
- Hauser, et al., “Garp: A MIPS Processor with a Reconfigurable Coprocessor”, University of California, Berkely, IEEE, 1997, pp. 24-33.Applicant
- Hedge, 3D WASP Devices for On-line Signal and Data Processing, 1994, International Conference on Wafer Scale Integration, pp. 11-21.Applicant
- Hwang, et al., “Min-cut Replication in Partitioned Networks” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, [online] Bd. 14, Nr. 1, Jan. 1995, pp. 96-106, (XP00053228 USA ISSN: 0278-0070 IEEE Xplore).Applicant
- Iseli, et al. “A C++ Compiler for FPGA Custom Execution Units Synthesis,” IEEE. 1995, pp. 173-179.Applicant
- Isshiki, et al., “Bit-Serial Pipeline Synthesis for Multi-FPGA Systems with C++ Design Capture,” 1996 IEEE, pp. 38-47.Applicant
- Jacob, et al., “Memory Interfacing and Instruction Specification for Reconfigurable Processors”, ACM 1999, pp. 145-154.Applicant
- Jantsch, et al., “A Case Study on Hardware/software Partitioning,” Royal Institute of Technology, Kista, Sweden, Apr. 10, 1994 IEEE, pp. 111-118.Applicant
- Koch, et al, “Practical Experiences with the SPARXIL Co-Processor”, 1998, IEEE, pp. 394-398.Applicant
- Kung,, “Deadlock Avoidance for Systolic Communication”, 1988 Conference Proceedings of 15th Annual International Symposium on Computer Architecture, May 30, 1988, pp. 252-260.Applicant
- Ling et al., “WASMII: An MPLD with Data-Driven Control on a Virtual Hardware,” Journal of Supercomputing, Kluwer Academic Publishers, Dordrecht, Netherlands, 1995, pp. 253-276.Applicant
- Ling et al., “WASMII: A Multifunction Programmable Logic Device (MPLD) with Data Driven Control,” The Transactions of the Institute of Electronics, Information and Communication Engineers, Apr. 25, 1994, vol. J77-D-1, Nr. 4, pp. 307-317. [This reference is in Chinese, but should be comparable in content to the Ling et al. reference above].Applicant
- Lizy, J., et al., “A Dynamically Reconfigurable Interconnect for Array Processors”, vol. 6, No. 1, Mar. 1998, IEEE, pp. 150-157.Applicant
- Miller, et al., “High-Speed FIFOs Contend with Widely Differing Data Rates: Dual-port RAM Buffer and Dual-pointer System Provide Rapid, High-density Data Storage and Reduce Overhead”, Computer Design, Sep. 1, 1985, pp. 83-86.Applicant
- Mirsky, “Matrix: A Reconfigurable Computing Architecture with Configurable Instruction Distribution and Deployable Resources,” Proceedings of the IEEE Symposium on FPGAs for Custom Computing Machines, 1996, pp. 157-166.Applicant
- Nilsson, et al., “The Scalable Tree Protocol—A Cache Coherence Approaches for Large-Scale Multiprocessors” IEEE, pp. 498-506 Dec. 1992.Applicant
- Schmit, et al., Hidden Markov Modeling and Fuzzy Controllers in FPGAs, FPGAs for Custom Computing Machines, 1995; Proceedings, IEEE Symposium on Napa Valley, CA, Apr. 1995, pp. 214-221.Applicant
- Shirazi, et al., “Quantitative analysis of floating point arithmetic on FPGA based custom computing machines, IEEE Symposium on FPGAs for Custom Computing Machines,” IEEE Computer Society Press, Apr. 19-21, 1993, pp. 390-393.Applicant
- Siemers, “Rechenfabrik Ansaetze Fuer Extrem Parallele Prozessoren,” Verlag Heinze Heise GmbH., Hannover, DE No. 15, Jul. 16, 2001, pp. 170-179.Applicant
- Simunic, et al., Source Code Optimization and Profiling of Energy Consumation in Embedded Systems, Proceedings of the 13th International Symposium on System Synthesis, Sep. 2000, pp. 193-198.Applicant
- Tau, et al., “A First Generation DPGA Implementation,” FPD'95, pp. 138-143.Applicant
- Tenca, et al., “A Variable Long-Precision Arithmetic Unit Design for Reconfigurable Coprocessor Architectures”, University of California, Los Angeles, 1998, pp. 216-225.Applicant
- The XPP White Paper, Release 2.1, PACT—A Technical Perspective, Mar. 27, 2002, pp. 1-27.Applicant
- TMS320C54X DSP: vol. 1: CPU and Peripherals, Texas Instruments, 1996, pp. 6-26 to 6-49.Applicant
- TMS320C54x DSP: vol. 2: Mnemonic Instruction Set, Texas Instruments, 1996, p. i-xi; 1-1 to 1-11; 2-1 to 2-21; 3-1 to 3-72; 4-1 to 4-203; A-1 to A-3; B-1 to B-7; -1 to C-5; D-1 to D-10, and Index.Applicant
- Villasensor, et al., “Express Letters Video Communications Using Rapidly Reconfigurable Hardware,” IEEE Transactions on Circuits and Systems for Video Technology, IEEE, Inc. NY, Dec. 1995, pp. 565-567.Applicant
- Wada, et al., “A Performance Evaluation of Tree-based Coherent Distributed Shared Memory” Proceedings of the Pacific RIM Conference on Communications, Comput and Signal Processing, Victoria, May 19-21, 1993, pp. 390-393.Applicant
- Weinhardt, et al., “Pipeline Vectorization,”IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 20, No. 2, Feb. 2001, pp. 234-248.Applicant
- Weinhardt, et al., “Pipeline Vectorization for Reconfigurable Systems”, 1999, IEEE, pp. 52-60.Applicant
- Wittig et al., “OneChip: An FPGA Processor with Reconfigurable Logic” IEEE, 1996 pp. 126-135.Applicant
- Wu et al., “A New Cache Directory Scheme”, IEEE, pp. 466-472, Jun. 1996.Applicant
- Xu et al., “Parallel QR Factorization on a Block Data Flow Architecture” Conference Proceeding Article, Mar. 1, 1992, pp. 332-336 XPO10255276, p. 333, Abstract 2.2, 2.3, 2.4—p. 334.Applicant
- XLINX, “Logic Cell Array Families: XC4000, XC4000A and XC4000H”, product description, pp. 2-7 to 2-15, Additional XC3000, XC31000 and XC3100A Data, pp. 2-7, 2-9, 2-14, 2-15, 8-16, and 9-14.Applicant
- Ye, Z.A. et al., “A Compiler for a Processor With A Reconfigurable Functional Unit,”FPGA 2000 ACM/SIGNA International Symposium on Field Programmable Gate Arrays, Monterey, CA Feb. 9-11, 2000, pp. 95-100.Applicant
- Zhang, N. et al., Architectural Evaluation of Flexible Digital Signal Processing for Wireless Receivers, Signals, Systems and Computers, 2000; Conference Record of the Thirty-Fourth Asilomar Conference, Bd. 1, Oct. 29, 2000, pp. 78-83.Applicant
- Abnous, A. et al., “Ultra-Low-Power Domain-Specific Multimedia Processors,” U.C. Berkeley, 1996 IEEE, pp. 461-470.Applicant
- Sutton et al., “A Multiprocessor DSP System Using PADDI-2,” U.C. Berkeley, 1998 ACM, pp. 62-65.Applicant
- Zhang, et al., “Abstract: Low-Power Heterogeneous Reconfigurable Digital Signal Processors with Energy-Efficient Interconnect Network,” U.C. Berkeley, pp. 1-120.Applicant
- Abnous, A., et al., “The Pleiades Architecture,” Chapter 1 of The Application of Programmable DSPs in Mobile Communications, A. Gatherer and A. Auslander, Ed., Wiley, 2002, pp. 1-33.Applicant
- Chen et al., “A reconfigurable multiprocessor IC for rapid prototyping of algorithmic-specific high-speed DSP data paths,” IEEE Journal of Solid-State Circuits, vol. 27, No. 12, Dec. 1992, pp. 1895-1904.Applicant
- Hartstein, R., “Coarse grain reconfigurable architectures,” Design Automation Conference, 2001, Proceedings of the ASP-DAC 2001 Asia and South Pacific, Jan. 30-Feb. 2, 2001, IEEE Jan. 30, 2001, pp. 564-569.Applicant
- Hastie et al., “The implementation of hardware subroutines on field programmable gate arrays,” Custom Integrated Circuits Conference, 1990, Proceedings of the IEEE 1990, May 16, 1990, pp. 31.3.1—31.4.3 (3 pages).Applicant
- John, L., et al., “A Dynamically Reconfigurable Interconnect for Array Processors,” vol. 6, No. 1, Mar. 1998, IEEE, pp. 150-157.Applicant
- Kastrup, B., “Automatic Hardware Synthesis for a Hybrid Reconfigurable CPU Featuring Philips CPLDs,” Proceedings of the PACT Workshop on Reconfigurable Computing, 1998, pp. 5-10.Applicant
- Koren et al., “A data-driven VLSI array for arbitrary algorithms,” IEEE Computer Society, Long Beach, CA vol. 21, No. 10, Oct. 1, 1988, pp. 30-34.Applicant
- Razdan et al., A High-Performance Microarchitecture with Hardware-Programmable Functional Units, Micro-27, Proceedings of the 27th Annual International Symposium on Microarchitecture, IEEE Computer Society and Association for Computing Machinery, Nov. 30-Dec. 2, 1994, pp. 172-180.Applicant
- Skokan, Z.E., “Programmable logic machine (A programmable cell array),” IEEE Journal of Solid-State Circuits, vol. 18, Issue 5, Oct. 1983, pp. 572-578.Applicant
- Sueyoshi, T., “Present Status and Problems of the Reconfigurable Computing Systems Toward the Computer Evolution,” Department of Artificial Intelligence, Kyushi Institute of Technology, Fukuoka, Japan; Institute of Electronics, Information and Communication Engineers, vol. 96, No. 426, IEICE Technical Report (1995), pp. 111-119 [English Abstract Only].Applicant
- Siemers et al., “The .>S<puter: A Novel Micoarchitecture Mode for Execution inside Superscalar and VLIW Processors Using Reconfigurable Hardware,” Australian Computer Science Communications, vol. 20, No. 4, Computer Architecture, Proceedings of the 3rd Australian Computer Architecture Conference, Perth, John Morris, Ed., Feb. 2-3, 1998, pp. 169-178.Applicant
- Weinhardt, Markus et al., “Pipeline Vectorization,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 20, No. 2, Feb. 2001, pp. 234-248.Applicant
- Yeung, A. et al., “A data-drive architecture for rapid prototyping of high throughput DSP algorithms,” Dept. of Electrical Engineering and Computer Sciences, Univ. of California, Berkeley, USA, Proceedings VLSI Signal Processing Workshop, IEEE Press, pp. 225-234, Napa, Oct. 1992.Applicant
- Yeung, A. et al., “A reconfigurable data-driven multiprocessor architecture for rapid prototyping of high throughput DSP algorithms,” Dept. of Electrical Engineering and Computer Sciences, Univ. of California, Berkeley, USA, pp. 169-178, IEEE 1993.Applicant
- Albaharna, O.T. et al., “On the Viability of FPGA-Based Integrated Coprocessors,” Dept. of Electrical and Electronic Engineering, Imperial College of Science, London, 1999 IEEE, pp. 206-215.Applicant
- Athanas et al., “Processor Reconfiguration Through Instruction-Set Metamorphosis,” 1993, IEEE Computers, pp. 11-18.Applicant
- Bakkes, P.J., et al., “Mixing Fixed and Reconfigurable Logic for Array Processing,” Dept. of Electrical and Electronic Engineering, University of Stellenbosch, South Africa, 1996 IEEE, pp. 118-125.Applicant
- Bratt, A, “Motorola field programmable analogue arrays, present hardware and future trends,” Motorola Programmable Technology Centre, Gadbrook Business Centre, Northwich, Cheshire, 1998, The Institute of Electrical Engineers, IEE. Savoy Place, London, pp. 1-5.Applicant
- Cardoso, Joao M.P. and Markus Weinhardt, “XPP-VC: A C Compiler with Temporal Partitioning for the PACT-XPP Architecture,” Field-Programmable Logic and Applications. Reconfigurable Computing is Going Mainstream, 12th International Conference FPL 2002, Proceedings (Lecture Notes in Computer Science, vol. 2438) Springer-Verlag Berlin, Germany, pp. 864-874.Applicant
- Compton, K. et al., “Configurable Computing: A Survey of Systems and Software,” Northwestern University, Dept. of ECE, Technical Report, 1999, (XP-002315148), 39 pages.Applicant
- DeHon, A., “DPGA Utilization and Application,”MIT Artificial Intelligence Laboratory, Proceedings of the Fourth International ACM Symposium on Field-Programmable Gate Arrays (FPGA '96), IEEE Computer Society, pp. 1-7.Applicant
- Franklin, Manoj et al., “A Fill-Unit Approach to Multiple Instruction Issue,” Proceedings of the Annual International Symposium on Microarchitecture, Nov. 1994, pp. 162-171.Applicant
- Hwang, K., “Advanced Computer Architecture—Parallelism, Scalability, Programmability,” 1993, McGraw-Hill, Inc., pp. 348-355.Applicant
- IBM Technical Disclosure Bulletin, IBM Corp., New York, XP000424878, Bd. 36, Nr. 11, Nov. 1, 1993, pp. 335-336.Applicant
- Knittel, Gunter, “A PCI-compatible FPGA-Coprocessor for 2D/3D Image Processing,” University of Turgingen, Germany, 1996 IEEE, pp. 136-145.Applicant
- Lee et al., “A new distribution network based on controlled switching elements and its applications,” IEEE/ACT Trans. of Networking, vol. 3, No. 1, pp. 70-81, Feb. 1995.Applicant
- Lee, Jong-eun et al., “Reconfigurable ALU Array Architecture with Conditional Execution,” International Soc. Design Conference (ISOOC) [online] Oct. 25, 2004, Seoul, Korea, 5 pages.Applicant
- Margolus, N., “An FPGA architecture for DRAM-based systolic computations,” Boston University Center for Computational Science and MIT Artificial Intelligence Laboratory, IEEE 1997, pp. 2-11.Applicant
- Ozawa, Motokazu et al., “A Cascade ALU Architecture for Asynchronous Super-Scalar Processors,” IEICE Transactions on Electronics, Electronics Society, Tokyo, Japan, vol. E84-C, No. 2, Feb. 2001, pp. 229-237.Applicant
- Quenot, G.M., et al., “A Reconfigurable Compute Engine for Real-Time Vision Automata Prototyping,” Laboratoire Systeme de Perception, DGA/Etablissement Technique Central de l'Armement, France, 1994 IEEE, pp. 91-100.Applicant
- Tsutsui, A., et al., “YARDS: FPGA/MPU Hybrid Architecture for Telecommunication Data Processing,” NTT Optical Network Systems Laboratories, Japan, 1997 ACM, pp. 93-99.Applicant
- Weinhardt, M., “Compilation Methods for Structure-programmable Computers,” dissertation, ISBN 3-89722-011-3, 1997. [Table of Contents and English Abstract Provided].Applicant
- Xilinx, “Spartan and SpartanXL Families Field Programmable Gate Arrays,” Jan. 1999, Xilinx, pp. 4-3 through 4-70.Applicant
- Zhang, et al., “A 1-V Heterogeneous Reconfigurable DSP IC for Wireless Baseband Digital Signal Processing,” IEEE Journal of Solid-State Circuits, vol. 35, No. 11, Nov. 2000, pp. 1697-1704.Applicant
- Altera, “Flex 8000 Programmable Logic Device Family,” Altera Corporation product description, Jan. 2003, pp. 1-62.Applicant
- Altera, “Flex 10K Embedded Programmable Logic Device Family,” Altera Corporation product description, Jan. 2003, pp. 1-128.Applicant
- Atmel, 5-K-50K Gates Coprocessor FPGA with Free Ram, Data Sheet, Jul 2006, 55 pages.Applicant
- Atmel, FPGA-based FIR Filter Application Note, Sep. 1999, 10 pages.Applicant
- Atmel, “An Introduction to DSP Applications using the AT40K FPGA,” FPGA Application Engineering, San Jose, CA, Apr. 2004, 15 pages.Applicant
- Atmel, Configurable Logic Design & Application Book, Atmel Corporation, 1995, pp. 2-19 through 2-25.Applicant
- Atmel, Field Programmable Gate Array Configuration Guide, AT6000 Series Configuration Data Sheet, Sep. 1999, pp. 1-20.Applicant
- Bacon, D. et al., “Compiler Transformations for High-Performance Computing,” ACM Computing Surveys, 26(4):325-420.Applicant
- Becker, J. et al., “Architecture, Memory and Interface Technology Integration of an Industrial/Academic Configurable System-on-Chip (CSoC),” IEEE Computer Society Annual Workshop on VLSI (WVLSI 2003), (Feb. 2003), 6 pages.Applicant
- Becker, J. “Configurable System-on-Chip (CSoC),” (Invited Tutorial), Proc. of 9th Proc. of XV Brazilian Symposium on Integrated Circuit, Design (SBCCI 2002), (Sep. 2002), 6 pages.Applicant
- Cardoso, J.M.P. et al., “A novel algorithm combining temporal partitioning and sharing of functional units,” University of Algarve, Faro, Portugal, 2001 IEEE, pp. 1-10.Applicant
- Clearspeed, CSX Processor Architecture, Whitepaper, PN-1110-0702, 2007, pp. 1-15, www.clearspeed.com.Applicant
- Clearspeed, CSX Processor Architecture, Whitepaper, PN-1110-0306, 2006, pp. 1-14, www.clearspeed.com.Applicant
- Cronquist, D. et al., Architecture Design of Reconfigurable Pipelined Datapaths, Department of Computer Science and Engineering, University of Washington, Seattle, WA, Proceedings of the 20th Anniversary Conference on Advanced Research in VSLI, 1999, pp. 1-15.Applicant
- DeHon, Andre, “Reconfigurable Architectures for General-Purpose Computing,” Massachusetts Institute of Technology, Technical Report AITR-1586, Oct. 1996 (Oct. 1996), XP002445054, Cambridge, MA, pp. 1-353.Applicant
- Diniz, P., et al., “A behavioral synthesis estimation interface for configurable computing,” University of Southern California, Marina Del Rey, CA, 2001 IEEE, pp. 1-2.Applicant
- Ebeling, C. et al., “Mapping Applications to the RaPiD Configurable Architecture,” Department of Computer Science and Engineering, University of Washington, Seattle, WA, FPGAs for Custom Computing Machines, 1997, Proceedings., The 5th Annual IEEE Symposium, Publication Date: Apr. 16-18, 1997, 10 pages.Applicant
- Equator, Pixels to Packets, Enabling Multi-Format High Definition Video, Equator Technologies BSP-15 Product Brief, www.equator.com, 2001, 4 pages.Applicant
- Freescale Slide Presentation, An Introduction to Motorola's RCF (Reconfigurable Compute Fabric) Technology, Presented by Frank David, Launched by Freescale Semiconductor, Inc., 2004, 39 pages.Applicant
- Genius, D. et al., “A Case for Array Merging in Memory Hierarchies,” Proceedings of the 9th International Workshop on Compilers for Parallel Computers, CPC'01 (Jun. 2001), pp. 1-10.Applicant
- Hartenstein, R. et al., “A new FPGA architecture for word-oriented datapaths,” Proc. FPL '94, Springer LNCS, Sep. 1994, pp. 144-155.Applicant
- Hwang, K., “Computer Architecture and Parallel Processing,” Data Flow Computers and VLSI Computations, XP-002418655, 1985 McGraw-Hill, Chapter 10, pp. 732-807.Applicant
- Inside DSP, “Ambric Discloses Massively Parallel Architecture,” Aug. 23, 2006, HTTP://insidedsp.com/tabid/64/articleType/ArticleView/articleId/155/Defa . . . , 2 pages.Applicant
- Intel, Intel MXP5800/MXP5400 Digital Media Processors, Architecture Overview, Jun. 2004, Revision 2.4, pp. 1-14.Applicant
- Kaul, M., et al., “An automated temporal partitioning and loop fission approach of FPGA based reconfigurable synthesis of DSP applications,”University of Cincinnati, OH, ACM 1999, pp. 616-622.Applicant
- Kean, T.A., “Configurable Logic: A Dynamically Programmable Cellular Architecture and its VLSI Implementation,” University of Edinburgh (Dissertation) 1988, pp. 1-286.Applicant
- Kean, T., et al., “A Fast Constant Coefficient Multiplier for the XC6200,” Xilinx, Inc., Lecture Notes in Computer Science, vol. 1142, Proceedings of the 6th International Workshop of Field-Programmable Logic, 1996, 7 pages.Applicant
- Kim et al., “A Reconfigurable Multifunction Computing Cache Architecture,” IEEE Transactions on Very Large Scale Intergration (VLSI) Systems vol. 9, Issue 4, Aug. 2001 pp.(s):509-523.Applicant
- Larsen, S. et al., “Increasing and Detecting Memory Address Congruence,” Proceedings of the 2002 IEEE International Conference on Parallel Architectures and Compilation Techniques (PACT'02), pp. 18-29 (Sep. 2002).Applicant
- Maxfield, C., “Logic that mutates while-u-wait,” EDN Access 1996, EDN Magazine, www.edn.com/index, 4 pages.Applicant
- Mei, Bingfeng, “A Coarse-Grained Reconfigurable Architecture Template and Its Compilation Techniques,” Katholeike Universiteit Leuven, PhD Thesis, Jan. 2005, IMEC vzw, Universitair Micro-Electronica Centrum, Belgium, pp. 1-195 (and Table of Contents).Applicant
- Mei, Bingfeng, et al., “Design and Optimization of Dynamically Reconfigurable Embedded Systems,” IMEC vzw, 2003, Belgium, 7 pages, http://www.imec.be/reconfigurable/pdf/ICERSA—01—design.pdf.Applicant
- Miyamori, T. et al., “REMARC: Reconfigurable Multimedia Array Coprocessor,” Computer Systems Laboratory, Stanford University, IEICE Transactions on Information and Systems E Series D, 1999; (abstract): Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays, p. 261, Feb. 22-25, 1998, Monterey, California, United States, pp. 1-12.Applicant
- Muchnick, S., “Advanced Complier Design and Implementation” (Morgan Kaufmann 1997), Table of Contents, 11 pages.Applicant
- Murphy, C., “Virtual Hardware Using Dynamic Reconfigurable Field Programmable Gate Arrays,” Engineering Development Centre, Liverpool John Moores University, UK, GERI Annual Research Symposium 2005, 8 pages.Applicant
- Nageldinger, U., “Design-Space Exploration for Coarse Grained Reconfigurable Architectures,” (Dissertation) Universitaet Kaiserslautem, 2000, Chapter 2, pp. 19-45.Applicant
- Olukotun, K., “The Case for a Single-Chip Microprocessor,” ACM Sigplan Notices, ACM, Association for Computing Machinery, New York, vol. 31, No. 9, Sep. 1996 (Sep. 09, 1996-2000) pp. 2-11.Applicant
- PACT Corporation, “The XPPP Communication System,” Technical Report 15 (2000), pp. 1-16.Applicant
- Saleeba, Z.M.G., “A Self-Reconfiguring Computer System,” Department of Computer Science, Monash University (Dissertation) 1998, pp. 1-306.Applicant
- Schmidt, H. et al., “Behavioral synthesis for FGPA-based computing,” Carnegie Mellon University, Pittsburgh, PA, 1994 IEEE, pp. 125-132.Applicant
- Singh, H. et al., “MorphoSys: An Integrated Reconfigurable System for Data-Parallel Computation-Intensive Applications,” University of California, Irvine, CA. and Federal University of Rio de Janeiro, Brazil, 2000, IEEE Transactions on Computers, pp. 1-35.Applicant
- Soni, M., “VLSI Implementation of a Wormhole Run-time Reconfigurable Processor,” Jun. 2001, (Master Thesis) Virginia Polytechnic Institute and State Univesity, 88 pages.Applicant
- Vasell et al., “The Function Processor: A Data-Driven Processor Array for Irregular Computations,” Chalmers University of Technology, Sweden, pp. 1-21.Applicant
- Waingold, E., et al., “Baring it all to software: Raw machines,” IEEE Computer, Sep. 1997, at 86-93.Applicant
- Weinhardt, Markus et al., “Memory Access Optimization for Reconfigurable Systems,” IEEE Proceedings Computers and Digital Techniques, 48(3) (May 2001).Applicant
- Wolfe, M. et al., “High Performance Compilers for Parallel Computing” (Addison-Wesley 1996), Table of Contents, 11 pages.Applicant
- Xilinx, “XC6200 Field Programmable Gate Arrays,” Apr. 24, 1997, Xilinx product description, pp. 1-73.Applicant
- Xilinx, “XC3000 Series Field Programmable Gate Arrays,” Nov. 6, 1998, Xilinx product description, pp. 1-76.Applicant
- Xilinx, “XC4000E and XC4000X Series Field Programmable Gate Arrays,” May 14, 1999, Xilinx product description, pp. 1-68.Applicant
- Xilinx, “Virtex-E 1.8 V Extended Memory Field Programmable Gate Arrays,” Jul. 17, 2002, Xilinx Production Product Specification, pp. 1-118.Applicant
- Xilinx, “Virtex-II and Virtex-II Pro X FPGA User Guide,”Mar. 28, 2007, Xilinx user guide, pp. 1-559.Applicant
- Zhang et al., “Abstract: Low-Power Heterogeneous Reconfigurable Digital Signal Processors with Energy-Efficient Interconnect Network,” U.C. Berkeley (2004), pp. 1-120.Applicant
- Zima, H. et al., “Supercompilers for parallel and vector computers” (Addison-Wesley 1991), Table of Contents, 5 pages.Applicant
- Cardoso, J.M.P. et al., “Compilation and Temporal Partitioning for a Coarse-Grain Reconfigurable Architecture,” Lysacht, P. & Rosentiel, W. eds., “New Algorithms, Architectures and Applications for Reconfigurable Computing,” (2005) pp. 105-115.Applicant
- Cardoso, J.M.P. et al., “Macro-Based Hardware Compilation of Java™ Bytecodes into a Dynamic Reconfigurable Computing System,” Field-Programmable Custom Computing Machines (1999) FCCM '99. Proceedings, Seventh Annual IEEE Symposium on NAPA Valley, CA, USA, Apr, 21-23, 1999, IEEE Comput. Soc, US, (Apr. 21, 1999) pp.2-11.Applicant
- Cook, Jeffrey J., “The Amalgam Compiler Infrasturcture,” Thesis at the University of Illinois at Urbana-Champaign (2004) Chapter 7 & Appendix G.Applicant
- Fawcett, B.K., “Map, Place and Route: The Key to High-Density PLD Implementation,” Wescon Conference, IEEE Center (Nov. 7, 1995) pp. 292-297.Applicant
- Hendrich, N., et al., “Silicon Compilation and Rapid Prototyping of Microprogrammed VLSI-Circuits with MIMOLA and SOLO 1400,” Microprocessing & Microprogramming (Sep. 1992) vol. 35(1-5), pp. 287-294.Applicant
- Koch, Andreas et al., “High-Level-Language Compilation for Reconfigurable Computers,” Proceedings of European Workshop on Reconfigurable Communication-Centric SOCS (Jun. 2005) 8 pages.Applicant
- Moracs, F., et al., “A Physical Synthesis Design Flow Based on Virtual Components,” XV Conference on Design of Circuits and Integrated Systems (Nov. 2000) 6 pages.Applicant
- Neumann, T., et al., “A Generic Library for Adaptive Computing Environments,” Field Programmable Logic and Applications, 11th International Conference, FPL 2001, Proceedings(Lecture Notes in Computer Science, vol. 2147)(2001) pp. 503-512.Applicant
- Schönfeld, M., et al., “The LISA Design Environment for the Synthesis of Array Processors Including Memories for the Data Transfer and Fault Tolerance by Reconfiguration and Coding Techniques,” J. VLSI Signal Processing Systems for Signal, Image, and Video Technology, (Oct. 1, 1995) vol. 11(1/2), pp. 51-74.Applicant
- Shin, D., et al., “C-based Interactive RTL Design Methodology,” Technical Report CECS-03-42 (Dec. 2003) pp. 1-16.Applicant
- Sondervan, J., “Retiming and logic synthesis,” Electronic Engineering (Jan. 1993) vol. 65(793), pp. 33, 35-36.Applicant
- Asari, et al., “FeRAM circuit technology for system on a chip,” Proceedings First NASA/DoD Workshop on Evolvable Hardware, pp. 193-197 (1999).Applicant
- Lee, et al., “Multimedia extensions for general-purpose processors,” IEEE Workshop on Signal Processing Systems, SIPS 97 - Design and Implementation, pp. 9-23 (1997).Applicant
- Pirsch, et al., “VLSI implementations of image and video multimedia processing systems,” IEEE Transactions on Circuits and Systmes for Video Technology 8(7): 878-891 (Nov. 1998).Applicant
- Salefski, et al., “Re-configurable computing in wireless,” Annual ACM IEEE Design Automation Conference: Proceedings of the 38th conference on Design automation, pp. 178-183 (2001)Applicant
- Schmidt, et al., “Datawave: A Single-Chip Multiprocessor for Video Applications,” IEEE Micro11(3): 22-25 and 88-94 (Jun. 1991).Applicant