Circuit having a multidimensional structure of configurable cells that include multi-bit-wide inputs and outputs

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.
Description
BACKGROUND INFORMATION

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.


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.


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


Units Described in German Patent No. 44 16 881


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


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


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

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.


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


FIG. 1 shows an example arrangement of several PAEs forming one PA with PLU. Without connection to input/output systems or memories.



FIG. 2 shows an example architecture of a PAE.



FIG. 3 shows an example architecture of F-PLUREG and M-PLUREG.



FIGS. 4
a-4c shows an example architecture of an O-REG.



FIGS. 5
a-5c shows an example architecture of an O-REGsft with a right shift function.



FIGS. 6
a-6c shows an example architecture of an R-REGsft with right/left 1-2-bit barrel shifter.



FIGS. 7
a-7b shows an example architecture of the R2O-MUX and implementation of a MUX in transfer gate technology.



FIG. 8 shows example clock synchronization, delays and sync signals.


FIGS. 9/1-9/2 shows the functioning of an example sync UNIT.



FIG. 10 shows an example architecture of a power UNIT.



FIG. 11 shows an example architecture of a sync UNIT.



FIG. 12 shows an example architecture of a BM UNIT.



FIG. 13 shows an example architecture of an O-MUX, limited to four bus systems.



FIG. 14 shows an example architecture of an R GATE, limited to four bus systems.



FIG. 15 shows an example architecture of the state-back UNIT.



FIG. 16 shows an exemplary operating principle of the one-shot MODE and the one-shot/power-save MODE.



FIG. 17 shows an example of implementation of a PAE.



FIG. 18 shows an example architecture of a PAE, with the individual functions being linked via a bus system.



FIG. 19 shows an example operation of the config state machine.



FIG. 20 shows an example operation of a loop state machine.



FIG. 21 shows an example cyclical processing of the configuration register data.





DETAILED DESCRIPTION

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


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.


The function of the EALU is configured in a function register (F-PLUREG).


O-REG


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


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


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


It is appropriate but not absolutely necessary to trigger the O-REGsft 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


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


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.

  • rACK(h/l): The data receiver acknowledges the data received, rACKh being the acknowledgment of the high result byte (bits 8 through 15) and rACK1 being the acknowledgment of the low result byte (bits 0 through 7). The two are linked with an AND (rACKh AND rACK1) 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 & rACK1).
  • 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).


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.

  • rRDY: Indicates that the PAE has finished its data processing and a result is available in R-REGsft. rRDY is transmitted as rRDYh and rRDY1 to both data receivers. However, it is the same signal in each case.
  • 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.


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.


The linking of the signals over multiple PAEs is as follows:



















Data transmitter

PAE

Data receiver









rRDY

oRDY rRDY

oRDY



rACK

oACK rACK

oACK










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.


The sync UNIT has the following types of sequences:

















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










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.


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.


Likewise, the sync UNIT can be used to generate and analyze error states or other status signals.


BM UNIT


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:

  • O-MUX1:oRDY1, oACK
  • O-MUX2:oRDY2, oACK
  • RH-GATE:rRDY, rACKh
  • RL-GATE:rRDY, rACK1


The R-GATE can be brought by M-PLUREG to a state in which it does not drive a bus system.


The table gives a description of the signals and their respective interface architecture:

















Signal
oRDY
oACK
rRDY
rACK
D7-0







Indicates
operands ready
operands
result ready
result
data




acknowledged

acknowledged


Type
input
open
driver
input
bidirectional




collector









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


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


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.


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


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:

  • AX7-0: X address of the X/Y matrix
  • AY7-0: Y address of the X/Y matrix
  • RS: Register select; logic 0 selects F-PLUREG, logic 1 selects M-PLUREG
  • 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.
  • D23-00: Data
  • DEN: Data enable; the bus contains final data. The data must be transferred to the register at the rising edge of the DEN signal.
  • 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:

















F11
F10-9
F8
F8
F5
F4-0







Stop
StateBack
Sleep
OneShot
PowerSave
EALU







function









The functions of the individual bits:

















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










The reset state is 0 in all bits.

  • 2. Register architecture in read access:

















F11



ReConfig










The functions of the individual bits:

















Function
State
Effect









ReConfig
0
No reconfiguration possible




1
Reconfiguration possible










The reset state is 0 in all bits.


Architecture of M-PLUREG:


















M23-18
M17-12
M11-06
M05-00









High-order
Low-order
Operand 1
Operand 0



result
result










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


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.


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.


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).


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.


Power saving functions have been implemented which lead to a reduction in power consumption—automatically to some extent (one-shot MODE).


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

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.



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.



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.



FIG. 4
a shows a block diagram of O-REG. FIG. 4b shows how the O-REG is constructed of D flip-flops. FIG. 4c shows the timing diagram. The clock signal is generated by SYNC-SM.



FIG. 5
a shows a block diagram of O-REGsft. FIG. 5b 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. 5c shows the timing diagram as a function of the signal mode. The clock pulse is generated by SYNC-SM.



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. 6b 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. 6c illustrates the shift function, depending on modes 0-2.



FIG. 7
a shows the architecture of multiplexer R20-MUX which sends the operands or the result to EALU as a function of mode. FIG. 7a shows a traditional multiplexer design, while FIG. 7b 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.


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!



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.



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).


In two cases, the system jumps to the YES branch (0904):

  • 1. There is no preceding result (“result available” flag is false).
  • 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).


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.



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.



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 RACK1, rACK=rACK1 & 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 L5 rRDY1—they are completely identical but are sent to different receivers) from 1103 is switched to the bus over a gate. The oACK(M) 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:

  • 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.
  • 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.
  • 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.


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.



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).



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.



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.



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.



FIG. 16 illustrates the operation of the one-shot MODE.


The Signals




  • 1. Vcc

  • 2. oRDY1

  • 3. oRDY2

  • 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).



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 !CLK 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=1), the power supply transistor is switched on via 1611. The following table gives an overview of the function:


















Power
Latch





save
(1602)
Voltage
Comments









L
X
on




H
L
off
only when one-shot MODE






has been set!



H
H
on










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).



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.


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.


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.


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).


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.


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.



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.



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). 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.


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.


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.



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.


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



  • 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.

  • 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.

  • 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.

  • Broadcast: Transmitting data from a PAE to multiple data receivers.

  • 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.

  • Data receiver: The unit(s) which processes further the results of the PAE.

  • Data transmitter: The unit(s) which makes available the data for the PAE as operands.

  • D flip-flop: Storage element that stores a signal at the rising edge of a clock pulse.

  • EALU: Expanded arithmetic and logic unit. 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.

  • FPGA: Known field-programmable gate array.

  • 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.

  • Gate: Group of transistors that perform a basic logic function. Basic functions include, for example, NAND, NOR. Transmission gates.

  • H level: Logic 1 level, depending on the technology used.

  • 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.

  • Configuring: Determining the function and interconnecting a logic unit, a (FPGA) cell or a PAE (see reconfiguring).

  • 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.

  • L level: Logic 0 level, depending on the technology used.

  • M-PLUREG: Register in which the interconnection of the PAE is set. The PLU writes into the register.

  • Next-neighbor interconnection: Interconnection of bus systems with the adjacent neighbors abutting at the edges.

  • O-MUX: Multiplexer within the BM UNIT which selects the bus system of the operands.

  • 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. 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.

  • 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.

  • 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.

  • O-REGsft: O-REG with a shift register controlled by the SM UNIT.

  • PA: Processing array: array of PAEs.

  • PAE: Processing array element: EALU with O-REG, R-REG, R20-MUX, F-PLUREG, M-PLUREG, BM UNIT, SM UNIT, sync UNIT, state-back UNIT and power UNIT.

  • PLU: Unit for configuring and reconfiguring the PAW. Configured by a microcontroller adapted specifically to its task.

  • 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.

  • Power Unit: Unit which regulates the power-saving functions.

  • Pull-down: Resistor which pulls a bus line to an L level.

  • Pull-up: Resistor which pulls a bus line to an H level.

  • 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.

  • R2O-MUX: Multiplexer for inserting the result in an R-REGsft into the data path between O-REG and EALU.

  • 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.

  • Serial operations: Operations performed by serial processing of a data word or an algorithm. Serial multiplication, serial division, series expansion.

  • Sleep MODE: Power-saving mode in which the PAE, except for F-PLUREG, carries no voltage.

  • SM UNIT: State machine UNIT. State machine which controls the EALU.

  • 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.

  • 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.

  • Gate: Switch that forwards or blocks a signal. Simple comparison: relay.

  • Reconfiguring: New configuration of any number of PAEs while any remaining PAEs continue with the same function (see configuring).

  • 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

  • Component: UNIT

  • Operating mode: MODE

  • Multiplexer: MUX

  • Negated signal: not

  • Visible register for PLU: PLUREG

  • Internal register: REG

  • Shift registers: sft

  • Function Conventions

  • Shift registers: sft

  • AND function: &















A
B
Q







0
0
0


0
1
0


1
0
0


1
1
1










OR function: #














A
B
Q







0
0
0


0
1
1


1
0
1


1
1
1










NOT function: !
















A
Q









0
1



1
0











GATE function: G














EN
D
Q







0
0



0
1



1
0
0


1
1
1








Claims
  • 1. A Field Programmable Gate Array integrated circuit comprising: a multi-dimensional configurable cell structure including a plurality of configurable cells; anda configurable interconnect connecting the configurable cells;wherein each of at least one of the cells is a data processing circuit that is hard-wired within the Field Programmable Gate Array and includes: at least two input ports, each being at least 4-bit wide;at least one output port being at least 4-bit wide;at least one multiplier hardware unit arranged for receiving an input from the at least two input ports and for providing an output to the at least one output port; andcircuitry that couples the at least two input ports and the at least one output port to the configurable interconnect.
  • 2. The Field Programmable Gate Array integrated circuit according to claim 1, wherein the each of the at least one of the cells has at least two input registers that are at least 4-bit wide.
  • 3. The Field Programmable Gate Array integrated circuit according to any one of claims 1 and 2, wherein the each of the at least one of the cells has at least one output register that is at least 4-bit wide.
  • 4. The Field Programmable Gate Array integrated circuit according to any one of claims 1 and 2, wherein the at least one of the cells comprises at least one floating point unit.
  • 5. The Field Programmable Gate Array integrated circuit according to claim 1, wherein the each of the at least one of the cells has at least 3 inputs, each of which is at least 4-bit wide.
  • 6. The Field Programmable Gate Array integrated circuit according to claim 5, wherein the each of the at least one of the cells has at least one adder and at least one multiplier.
  • 7. The Field Programmable Gate Array integrated circuit according to claim 6, wherein the each of the at least one of the cells has at least one multiplexer located between at least one output of the at least one multiplier and at least one input of the at least one adder.
  • 8. The Field Programmable Gate Array integrated circuit according to claim 7, wherein the multiplexer allows selection of input data for the at least one adder from at least (a) the multiplier and (b) at least one of an input of the respective cell and another cell.
  • 9. The Field Programmable Gate Array integrated circuit according to claim 7, wherein the each of the at least one of the cells has at least one output register and at least one path for feeding back at least one of the output registers to at least one adder input via a multiplexer.
  • 10. The Field Programmable Gate Array integrated circuit according to any one of claims 6 and 7, wherein the each of the at least one of the cells has at least one path for feeding back processing results of the cell as operands back to the cell, the path including at least one register that is at least 4-bit wide.
  • 11. The Field Programmable Gate Array integrated circuit according to any one of claims 6 and 7, wherein the each of the at least one of the cells has at least one path for feeding back an output of the at least one adder as at least one operand back to the cell, the path including at least one register that is at least 4-bit wide.
  • 12. The Field Programmable Gate Array integrated circuit according to any one of claims 6 and 7, wherein the each of the at least one of the cells has at least one output register and at least one path for feeding back an output from at least one of the output registers as operands back into the respective cell.
  • 13. The Field Programmable Gate Array integrated circuit according to claim 6, wherein the each of the at least one of the cells has at least one of (a) at least two input registers, each of which is 4-bit wide and (b) at least one output register that is 4-bit wide.
  • 14. The Field Programmable Gate Array integrated circuit according to any one of claims 6, 9, and 13, wherein at least some of the cells comprise a shift function.
  • 15. The Field Programmable Gate Array integrated circuit according to any one of claims 6, 9, and 13, wherein at least some of the cells comprise a comparator.
  • 16. The Field Programmable Gate Array integrated circuit according to any one of claims 6, 7, 9, and 13, wherein the each of at least one of the cells has at least one input for defining the cell operation independently from other cells at runtime.
  • 17. The Field Programmable Gate Array integrated circuit according to claim 16, wherein the independent definition of the cell operation of the respective cell is performed without disturbing said other cells in their operations.
  • 18. The Field Programmable Gate Array integrated circuit according to claim 16, wherein the each of the at least one of the cells supports selection of one of a set of multiple configurations at runtime.
  • 19. The Field Programmable Gate Array integrated circuit according to any one of claims 6, 7, 9, and 13, wherein the each of the at least one of the cells has at least one status output.
  • 20. The Field Programmable Gate Array integrated circuit according to claim 6, wherein the each of the at least one of the cells includes circuitry for performing a floating point operation.
  • 21. The Field Programmable Gate Array integrated circuit according to claim 1, wherein at least some of the cells comprise a divider.
  • 22. The Field Programmable Gate Array integrated circuit according to claim 3, wherein the at least one of the cells comprises at least one floating point unit.
  • 23. The Field Programmable Gate Array integrated circuit according to claim 1, wherein, for each of at least some of the configurable cells: the configurable cell performs at least one of arithmetic and logic data processing, and has at least one register; anda clock supply of the at least one register is suppressible within the configurable cell.
  • 24. The Field Programmable Gate Array integrated circuit according to claim 1, wherein, for each of at least some of the configurable cells: the configurable cell performs at least one of arithmetic and logic data processing, and has at least one register; anda clock supply of the at least one register is suppressible within the configurable cell for power saving.
  • 25. The Field Programmable Gate Array integrated circuit according to claim 1, wherein, for each of at least some of the configurable cells: the configurable cell performs at least one of arithmetic and logic data processing, and has at least one register; anda clock supply of the at least one register is suppressible (a) within the configurable cell and (b) depending on availability of input data to the configurable cell.
  • 26. The Field Programmable Gate Array integrated circuit according to claim 1, wherein, for each of at least some of the configurable cells: the configurable cell performs at least one of arithmetic and logic data processing, and has at least one register; anda clock supply of the at least one register is suppressible (a) within the configurable cell and (b) depending on acceptability, by a receiver, of output data of the configurable cell.
  • 27. The Field Programmable Gate Array integrated circuit according to claim 1, wherein at least some of the configurable cells perform at least one of arithmetic and logic data processing, and have at least one register, a clock supply to the at least one register being configurably suppressible.
  • 28. The Field Programmable Gate Array integrated circuit according to claim 1, wherein at least some of the configurable cells perform at least one of arithmetic and logic data processing, and have at least one register, a clock supply to the at least one register being configurably suppressible for power saving.
  • 29. The Field Programmable Gate Array integrated circuit according to claim 1, wherein at least some of the configurable cells perform at least one of arithmetic and logic data processing, and have at least one register, an arrangement being provided with the at least one register for disabling a clock supply of the at least one register.
  • 30. The Field Programmable Gate Array integrated circuit according to claim 1, wherein at least some of the configurable cells perform at least one of arithmetic and logic data processing, and have at least one register, an arrangement being provided with the at least one register for disabling a clock supply of the at least one register for power saving.
  • 31. A Field Programmable Gate Array integrated circuit comprising: a two-dimensional configurable cell structure including a plurality of configurable cells; anda configurable interconnect connecting the configurable cells;wherein each of at least one of the cells is a hard-wired implemented logic circuit arranged for implementing a runtime configurable function and includes: an at least 4-bit wide processing unit configurable in function, each of at least two input ports of the at least 4-bit wide processing unit being at least 4-bit wide and having a respective at least 4-bit wide input register, and each of at least one output port of the at least 4-bit wide processing unit being at least 4-bit wide and having a respective at least one at least 4-bit wide output register; andcircuitry that couples the at least two input ports and the at least one output port to the configurable interconnect.
  • 32. The Field Programmable Gate Array Integrated Circuit according to claim 31, wherein a function unit of the at least one of the cells comprises at least one multiplier.
  • 33. The Field Programmable Gate Array Integrated Circuit according to any one of claims 31 and 32, wherein the at least one of the cells comprises at least one floating point unit.
  • 34. The Field Programmable Gate Array Integrated Circuit according to claim 31, wherein the each of the at least one of the cells has at least three input ports that are each at least 4-bit wide.
  • 35. The Field Programmable Gate Array Integrated Circuit according to claim 34, wherein a function unit of the at least one of the cells comprises at least one adder and at least one multiplier.
  • 36. The Field Programmable Gate Array Integrated Circuit according to claim 35, wherein the each of the at least one of the cells has at least one multiplexer located between at least one output of the at least one multiplier and at least one input of the at least one adder.
  • 37. The Field Programmable Gate Array Integrated Circuit according to claim 35, wherein the multiplexer allows selection of input data for the at least one adder from at least (a) the multiplier and (b) at least one of an input of the respective cell and another cell.
  • 38. The Field Programmable Gate Array Integrated Circuit according to any one of claims 35, 36, and 37, wherein the each of the at least one of the cells has at least one path for feeding back processing results of the respective cell as operands back into the respective cell, the path including at least one register that is at least 4-bit wide.
  • 39. The Field Programmable Gate Array Integrated Circuit according to any one of claims 35, 36, and 27, wherein the each of the at least one of the cells has at least one path for feeding back output of the at least one adder as at least one operand back to the respective cell, the path including at least one register that is at least 4-bit wide.
  • 40. The Field Programmable Gate Array Integrated Circuit according to any one of claims 35 and 36, wherein the each of the at least one of the cells has at least one path for feeding back output from at least one of the output registers as operands back into the respective cell.
  • 41. The Field Programmable Gate Array Integrated Circuit according to claim 35, wherein the at least one of the cells has at least one path for feeding back at least one output register to at least one adder input via a multiplexer.
  • 42. The Field Programmable Gate Array Integrated Circuit according to any one of claims 31, 32, 35, and 41, wherein at least some of the cells comprise a shift function.
  • 43. The Field Programmable Gate Array Integrated Circuit according to any one of claims 31, 32, 35, and 41, wherein at least some of the cells comprise a comparator.
  • 44. The Field Programmable Gate Array Integrated Circuit according to any one of claims 31, 35, 36, and 41, wherein each of the at least one of the cells has at least one input for defining a function of the respective cell independently from other cells at runtime.
  • 45. The Field Programmable Gate Array Integrated Circuit according to claim 44, wherein the independent definition of the function of the respective cell is performed without disturbing said other cells in their operations.
  • 46. The Field Programmable Gate Array Integrated Circuit according to any one of claims 31, 35, 36, and 41, wherein the at least one of the cells has at least one status output.
  • 47. The Field Programmable Gate Array Integrated Circuit according to any one of claims 31 and 35, wherein the at least one of the cells supports a selection of one of a set of multiple configurations at runtime.
  • 48. The Field Programmable Gate Array Integrated Circuit according to any one of claims 31 and 35, wherein the at least one of the cells includes circuitry for performing a floating point operation.
  • 49. The Field Programmable Gate Array Integrated Circuit according to claim 31, wherein at least some of the cells comprise a divider.
  • 50. The Field Programmable Gate Array integrated circuit according to claim 31, wherein each of at least some of the configurable cells performs at least one of arithmetic and logic data processing, and has at least one register, a clock supply of the at least one register being suppressible within the configurable cell.
  • 51. The Field Programmable Gate Array integrated circuit according to claim 31, wherein each of at least some of the configurable cells performs at least one of arithmetic and logic data processing, and has at least one register, a clock supply of the at least one register being suppressible within the configurable cell depending on availability of input data to the configurable cell.
  • 52. The Field Programmable Gate Array integrated circuit according to claim 31, wherein each of at least some of the configurable cells performs at least one of arithmetic and logic data processing, and has at least one register, a clock supply of the at least one register being suppressible within the configurable cell depending on acceptability, by a receiver, of output data of the configurable cell.
  • 53. The Field Programmable Gate Array integrated circuit according to claim 31, wherein each of at least some of the configurable cells performs at least one of arithmetic and logic data processing, and has at least one register, a clock supply of the at least one register being suppressible within the configurable cell for power saving.
  • 54. The Field Programmable Gate Array integrated circuit according to claim 31, wherein at least some of the configurable cells perform at least one of arithmetic and logic data processing, and have at least one register, a clock supply to the at least one register being configurably suppressible.
  • 55. The Field Programmable Gate Array integrated circuit according to claim 31, wherein at least some of the configurable cells perform at least one of arithmetic and logic data processing, and have at least one register, a clock supply to the at least one register being configurably suppressible for power saving.
  • 56. The Field Programmable Gate Array integrated circuit according to claim 31, wherein at least some of the configurable cells perform at least one of arithmetic and logic data processing, and have at least one register, an arrangement being provided with the at least one register for disabling a clock supply of the at least one register.
  • 57. The Field Programmable Gate Array integrated circuit according to claim 31, wherein at least some of the configurable cells perform at least one of arithmetic and logic data processing, and have at least one register, an arrangement being provided with the at least one register for disabling a clock supply of the at least one register for power saving.
  • 58. A configurable data processing cell implemented in an integrated circuit, the integrated circuit being configurable in function at runtime and having (a) a multi-dimensionally arranged configurable cell structure and (b) a configurable interconnect connecting configurable cells of the configurable cell structure, wherein the data processing cell is hard-wired implemented in the cell structure, the data processing cell comprising: at least one adder hardware unit;at least one multiplier hardware unit;at least two input ports, each being at least 4-bit wide, the at least two input ports being arranged for providing input to the at least one adder and at least one multiplier;at least one output port being at least 4-bit wide, the at least one multiplier being arranged for providing an output to the at least one output port; andcircuitry that couples the at least two input ports and the at least one output port to the configurable interconnect;wherein at least one of the input ports is arranged such that a function of the data processing cell is definable by the at least one of the input ports independently from other cells at runtime.
  • 59. The configurable data processing cell according to claim 58, wherein the independent definition of the function of the data processing cell is performed without disturbing said other cells in their operations.
  • 60. The configurable data processing cell according to claim 58, further comprising at least two at least 4-bit wide input registers.
  • 61. The configurable data processing cell according to claim 58, further comprising at least one at least 4-bit wide output register.
  • 62. The configurable data processing cell according to any one of claims 58, 59, and 61, further comprising at least one floating point unit.
  • 63. The configurable data processing cell according to claim 58, further comprising at least three input ports that are each at least 4-bit wide.
  • 64. The configurable data processing cell according to claim 58, further comprising at least one multiplexer located between the at least one multiplier and the at least one adder.
  • 65. The configurable data processing cell according to claim 64, wherein the multiplexer allows selection of input data for the at least one adder from at least (a) the multiplier and (b) at least one of another cell and an input of the configurable processing cell.
  • 66. The configurable data processing cell according to claim 64, further comprising at least one path for feeding back processing results of the cell as operands back into the cell, the path including at least one register that is at least 4-bit wide.
  • 67. The configurable data processing cell according to claim 64, further comprising at least one path for feeding back output of the at least one adder as at least one operand back to the cell, the path including at least one register that is at least 4-bit wide.
  • 68. The configurable data processing cell according to claim 64, further comprising at least one output register and at least one path for feeding back output from at least one of output registers as operands back into the cell.
  • 69. The configurable data processing cell according to claim 64, further comprising at least one output register and at least one path for feeding back at least one output register to at least one adder input via a multiplexer.
  • 70. The configurable data processing cell according to claim 58, further comprising at least one of (a) at least two at least 4-bit wide input registers and (b) at least one at least 4-bit wide output register.
  • 71. The configurable data processing cell according to any one of claims 59, 61, 68, 69, and 70, wherein the integrated circuit is a Field Programmable Gate Array (FPGA).
  • 72. The configurable data processing cell according to any one of claims 58, 64, 68, and 70, further comprising a shift function.
  • 73. The configurable data processing cell according to any one of claims 58, 64, 68, and 70, further comprising a comparator.
  • 74. The configurable data processing cell according to any one of claims 58, 64, 68, and 70, wherein the cell supports selection of one of a set of multiple configurations at runtime.
  • 75. The configurable data processing cell according to claim 58, further comprising a divider.
  • 76. The configurable data processing cell according to claim 58, further comprising at least one status output.
  • 77. The configurable data processing cell according to claim 58, wherein the cell includes circuitry for performing a floating point operation.
  • 78. The configurable data processing cell according to claim 58, wherein the configurable data processing cell has at least one register, and an arrangement is provided with the at least one register for disabling a clock supply of the at least one register.
  • 79. The configurable data processing cell according to claim 58, wherein the configurable data processing cell has at least one register, and an arrangement is provided with the at least one register for disabling a clock supply of the at least one register for power saving.
  • 80. The configurable data processing cell according to claim 58, wherein the configurable data processing cell has at least one register, and a clock supply for the at least one register is suppressible.
  • 81. The configurable data processing cell according to claim 58, wherein the configurable data processing cell has at least one register, and a clock supply for the at least one register is suppressible depending on availability of input data to the configurable data processing cell.
  • 82. The configurable data processing cell according to claim 58, wherein the configurable data processing cell has at least one register, and a clock supply for the at least one register is suppressible depending on acceptability, by a receiver, of output data of the configurable data processing cell.
  • 83. The configurable data processing cell according to claim 58, wherein the configurable data processing cell has at least one register, and a clock supply for the at least one register is suppressible for power saving.
  • 84. A configurable data processing cell implemented in an integrated circuit, the integrated circuit being configurable in function at runtime and having (a) a multi-dimensionally arranged configurable cell structure and (b) a configurable interconnect connecting the configurable cells, wherein the configurable data processing cell is hard-wired implemented in the cell structure, the configurable data processing cell comprising: at least three inputs, each being at least 4-bit wide;at least one output being at least 4-bit wide;at least one adder function unit;at least one multiplier function unit; andat least one of (a) at least one arithmetic function unit and (b) at least one logic function unit;wherein individual ones of the function units are selectively interconnectable such that an output of at least one of the at least one adder function unit, the at least one multiplier function unit, and the at least one of (a) at least one arithmetic function unit and (b) at least one logic function unit is selectively used as an input to another of the at least one adder function unit, the at least one multiplier function unit, and the at least one of (a) at least one arithmetic function unit and (b) at least one logic function unit.
  • 85. The configurable data processing cell according to claim 84, wherein at least one of the at least three inputs comprises a 4-bit wide input register.
  • 86. The configurable data processing cell according to claim 84, wherein at least one of the at least one output comprises a 4-bit wide output register.
  • 87. The configurable data processing cell according to claim 86, further comprising at least one path for feeding an output from at least one of the output registers as operands back into the cell.
  • 88. The configurable data processing cell according to claim 86, further comprising at least one path for feeding back at least one output register to at least one adder input via a multiplexer.
  • 89. The configurable data processing cell according to claim 84, further comprising at least one path for feeding processing results of the cell as operands back into the cell, the path including at least one register, the register being at least 4-bit wide.
  • 90. The configurable data processing cell according to claim 89, further comprising a shift function.
  • 91. The configurable data processing cell according to any one of claims 84, 87, 89, and 90, further comprising at least one input for defining the cell's function independently from other cells at runtime.
  • 92. The configurable data processing cell according to claims 91, wherein the integrated circuit is a Field Programmable Gate Array (FPGA).
  • 93. The configurable data processing cell according to claim 91, wherein the independent definition of the cell's function is performed without disturbing said other cells in their operations.
  • 94. The configurable data processing cell according to claim 91, wherein the cell supports selection of one of a set of multiple configurations at runtime.
  • 95. The configurable data processing cell according to claim 89, further comprising a comparator.
  • 96. The configurable data processing cell according to any one of claims 84 and 89, further comprising at least one status output.
  • 97. The configurable data processing cell according to any one of claims 84, 86, 87, 90, and 95, wherein the integrated circuit is a Field Programmable Gate Array (FPGA).
  • 98. The configurable data processing cell according to any one of claims 84 and 89, wherein the cell includes circuitry for performing a floating point operation.
  • 99. The configurable data processing cell according to claim 84, further comprising at least one path for feeding back output of the at least one adder as at least one operand back to the cell, the path including at least one register that is at least 4-bit wide.
  • 100. The configurable data processing cell according to claim 84, further comprising a divider.
  • 101. The configurable data processing cell according to claim 84, further comprising at least one floating point unit.
  • 102. The configurable data processing cell according to claim 96, wherein the integrated circuit is a Field Programmable Gate Array (FPGA).
  • 103. The configurable data processing cell according to claim 84, wherein the configurable data processing cell performs at least one of arithmetic and logic data processing, and has at least one register, an arrangement being provided with the at least one register for disabling a clock supply of the at least one register.
  • 104. The configurable data processing cell according to claim 84, wherein the configurable data processing cell performs at least one of arithmetic and logic data processing, and has at least one register, an arrangement being provided with the at least one register for disabling a clock supply of the at least one register for power saving.
  • 105. The configurable data processing cell according to claim 84, wherein the configurable data processing cell has at least one register, and a clock supply for the register is suppressible.
  • 106. The configurable data processing cell according to claim 84, wherein the configurable data processing cell has at least one register, and a clock supply for the register is suppressible depending on availability of input data to the configurable data processing cell.
  • 107. The configurable data processing cell according to claim 84, wherein the configurable data processing cell has at least one register, and a clock supply for the register is suppressible depending on acceptability, by a receiver, of output data of the configurable data processing cell.
  • 108. The configurable data processing cell according to claim 84, wherein the configurable data processing cell has at least one register, and a clock supply for the register is suppressible for power saving.
  • 109. The configurable data processing cell according to claim 84, wherein at least some of the configurable cells perform at least one of arithmetic and logic data processing, and have at least one register, an arrangement being provided with the at least one register for disabling a clock supply of the at least one register.
  • 110. The configurable data processing cell according to claim 84, wherein at least some of the configurable cells perform at least one of arithmetic and logic data processing, and have at least one register, an arrangement being provided with the at least one register for disabling a clock supply of the at least one register for power saving.
  • 111. A configurable data processing cell implemented in an integrated circuit, the integrated circuit being configurable in function and interconnection at runtime and having (a) a multi-dimensionally arranged configurable cell structure and (b) a configurable interconnect connecting the configurable cells, wherein the data processing cell is hard-wired implemented in the cell structure, the data processing cell comprising: at least two input registers;at least one output register; andat least one hard-wired floating point unit arranged for receiving an input from the at least two input registers and providing an output to the at least one output register.
  • 112. The configurable data processing cell according to claim 111, wherein the at least two input registers include at least two at least 4-bit wide input registers.
  • 113. The configurable data processing cell according to claim 111, wherein the at least one output register includes at least one at least 4-bit wide output register.
  • 114. The configurable data processing cell according to claim 111, further comprising at least one path for feeding processing results of the cell as operands back into the cell, the path including at least one register that is at least 4-bit wide.
  • 115. The configurable data processing cell according to any one of claims 111, 112, 113, and 114, further comprising at least one input for defining the cell's function independently from other cells at runtime without disturbing or influencing other cells in their operation.
  • 116. The configurable data processing cell according to claim 115, wherein the cell supports selection of one of a set of multiple configurations at runtime.
  • 117. The configurable data processing cell according to any one of claims 111 and 114, further comprising at least one status output.
  • 118. The configurable data processing cell according to any one of claims 111, 112, 113, and 114, wherein the Integrated Circuit is a Field Programmable Gate Array (FPGA).
  • 119. The configurable data processing cell according to claim 117, wherein the Integrated Circuit is a Field Programmable Gate Array (FPGA).
  • 120. The configurable data processing cell according to claim 115, wherein the Integrated Circuit is a Field Programmable Gate Array (FPGA).
  • 121. The configurable data processing cell according to claim 111, wherein the configurable processing cell has at least one register for which a clock supply is suppressible.
  • 122. The configurable data processing cell according to claim 111, wherein the configurable processing cell has at least one register for which a clock supply is suppressible depending on availability of input data to the configurable data processing cell.
  • 123. The configurable data processing cell according to claim 111, wherein the configurable processing cell has at least one register for which a clock supply is suppressible depending on acceptability, by a receiver, of output data of the configurable data processing cell.
  • 124. The configurable data processing cell according to claim 111, wherein the configurable processing cell has at least one register for which a clock supply is suppressible for power saving.
  • 125. A data processor integrated circuit that is configurable in function at runtime, comprising: configurable elements arranged in a two-dimensional manner; anda configurable interconnect for connecting the configurable elements in a configurable manner;wherein each of at least some of the configurable elements comprises: at least one ALU (a) being at least 4-bit wide, (b) having a set of predefined, non-alterable instructions, and (c) and including circuitry via which to execute arithmetic logic operations in accordance with said set of predefined, non-alterable instructions;at least two input registers, each being at least 4-bit wide and including circuitry in which operands received over the configurable interconnect are storable;at least one at least 4-bit wide output register for storing result data produced by the at least one ALU in accordance with the configuration information;at least one at least 4-bit wide multiplexer located between at least one of the input registers and at least one input of the at least one ALU, at least one of the at least two input registers being connected to at least a first input of the at least one multiplexer.
  • 126. The data processor integrated circuit according to claim 125, wherein the each of the at least some of the configurable elements further comprises at least one at least 4-bit wide feedback from the at least one output register to at least one input of the at least one multiplexer, for feeding result data back to the at least one ALU.
  • 127. The data processor integrated circuit according to any one of claims 125 and 126, wherein the each of the at least some of the configurable elements is arranged receiving configuration information defining a cell operation independently of other cells at runtime without disturbing or influencing other cells in their operation, the at least one ALU being arranged for executing an arithmetic logic operation in accordance with the configuration information.
  • 128. The data processor integrated circuit according to claim 125, wherein at least some of the configurable elements have at least one register, a clock supply for the at least one register being suppressible.
  • 129. The data processor integrated circuit according to claim 128, wherein the integrated circuit is a Field Programmable Gate Array integrated circuit (FPGA).
  • 130. The data processor integrated circuit according to claim 125, wherein each of at least some of the configurable elements has at least one register, a clock supply for the register being suppressible depending on availability of input data to the configurable element.
  • 131. The data processor integrated circuit according to claim 125, wherein each of at least some of the configurable elements has at least one register, a clock supply for the register being suppressible depending on acceptability, by a receiver, of output data of the configurable element.
  • 132. The data processor integrated circuit according to claim 125, wherein at least some of the configurable elements have at least one register, a clock supply for the at least one register being suppressible for power saving.
  • 133. The data processor integrated circuit according to claim 125, wherein at least some of the configurable elements perform at least one of arithmetic and logic data processing, and have at least one register, a clock supply to the at least one register being configurably suppressible.
  • 134. The data processor integrated circuit according to claim 132, wherein the integrated circuit is a Field Programmable Gate Array (FPGA) integrated circuit.
  • 135. The data processor integrated circuit according to claim 125, wherein at least some of the configurable elements perform at least one of arithmetic and logic data processing, and have at least one register, a clock supply to the at least one register being configurably suppressible for power saving.
  • 136. The data processor integrated circuit according to claim 125, wherein at least some of the configurable elements perform at least one of arithmetic and logic data processing, and have at least one register, an arrangement provided with the at least one register for disabling a clock supply of the at least one register.
  • 137. The data processor integrated circuit according to claim 136, wherein the integrated circuit is a Field Programmable Gate Array integrated (FPGA) circuit.
  • 138. The data processor integrated circuit according to claim 125, wherein at least some of the configurable elements perform at least one of arithmetic and logic data processing, and have at least one register, an arrangement being provided with the at least one register for disabling a clock supply of the at least one register for power saving.
Priority Claims (1)
Number Date Country Kind
196 51 075 Dec 1996 DE national
CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of and claims priority to U.S. patent application Ser. No. 10/791,501, filed on Mar. 1, 2004; now U.S. Pat. No. 7,565,525 which is a continuation of and claims priority to U.S. patent application Ser. No. 10/329,132, filed Dec. 24, 2002; now U.S. Pat. No. 6,958,710 which is a continuation of and claims priority to International Application Serial No. PCT/DE97/02949, filed on Dec. 9, 1997; and which is a continuation-in-part of and claims priority to U.S. patent application Ser. No. 08/946,810, filed on Oct. 8, 1997, now U.S. Pat. No. 6,425,068 the entire contents of each of which are expressly incorporated herein by reference.

US Referenced Citations (531)
Number Name Date Kind
2067477 Cooper Jan 1937 A
3242998 Gubbins Mar 1966 A
3681578 Stevens Aug 1972 A
3757608 Willner Sep 1973 A
3855577 Vandierendonck Dec 1974 A
4233667 Devine et al. Nov 1980 A
4414547 Knapp et al. Nov 1983 A
4498134 Hansen et al. Feb 1985 A
4498172 Bhavsar Feb 1985 A
4566102 Hefner Jan 1986 A
4571736 Agrawal et al. Feb 1986 A
4590583 Miller May 1986 A
4591979 Iwashita May 1986 A
4623997 Tulpule Nov 1986 A
4663706 Allen et al. May 1987 A
4667190 Fant et al. May 1987 A
4682284 Schrofer Jul 1987 A
4686386 Tadao Aug 1987 A
4706216 Carter Nov 1987 A
4720778 Hall et al. Jan 1988 A
4720780 Dolecek Jan 1988 A
4739474 Holsztynski Apr 1988 A
4761755 Ardini et al. Aug 1988 A
4791603 Henry Dec 1988 A
4811214 Nosenchuck et al. Mar 1989 A
4852043 Guest Jul 1989 A
4852048 Morton Jul 1989 A
4860201 Miranker et al. Aug 1989 A
4870302 Freeman Sep 1989 A
4882687 Gordon Nov 1989 A
4884231 Mor et al. Nov 1989 A
4891810 de Corlieu et al. Jan 1990 A
4901268 Judd Feb 1990 A
4910665 Mattheyses et al. Mar 1990 A
4918440 Furtek et al. Apr 1990 A
4959781 Rubenstein et al. Sep 1990 A
4967340 Dawes Oct 1990 A
4972314 Getzinger et al. Nov 1990 A
4992933 Taylor Feb 1991 A
5010401 Murakami et al. Apr 1991 A
5014193 Garner et al. May 1991 A
5015884 Agrawal et al. May 1991 A
5021947 Campbell et al. Jun 1991 A
5023775 Poret Jun 1991 A
5034914 Osterlund Jul 1991 A
5036473 Butts et al. Jul 1991 A
5041924 Blackborow et al. Aug 1991 A
5043978 Nagler et al. Aug 1991 A
5047924 Matsubara et al. Sep 1991 A
5055997 Sluijter et al. Oct 1991 A
5065308 Evans Nov 1991 A
5072178 Matsumoto Dec 1991 A
5081375 Pickett et al. Jan 1992 A
5099447 Myszewski Mar 1992 A
5103311 Sluijter et al. Apr 1992 A
5109503 Cruickshank et al. Apr 1992 A
5113498 Evan et al. May 1992 A
5115510 Okamoto et al. May 1992 A
5123109 Hillis Jun 1992 A
5125801 Nabity et al. Jun 1992 A
5128559 Steele Jul 1992 A
5142469 Weisenborn Aug 1992 A
5144166 Camarota et al. Sep 1992 A
5193202 Jackson et al. Mar 1993 A
5203005 Horst Apr 1993 A
5204935 Mihara et al. Apr 1993 A
5208491 Ebeling et al. May 1993 A
5212716 Ferraiolo et al. May 1993 A
5212777 Gove et al. May 1993 A
5218302 Loewe et al. Jun 1993 A
5226122 Thayer et al. Jul 1993 A
RE34363 Freeman Aug 1993 E
5233539 Agrawal et al. Aug 1993 A
5237686 Asano et al. Aug 1993 A
5243238 Kean Sep 1993 A
5247689 Ewert Sep 1993 A
RE34444 Kaplinsky Nov 1993 E
5274593 Proebsting Dec 1993 A
5276836 Fukumaru et al. Jan 1994 A
5287472 Horst Feb 1994 A
5287511 Robinson et al. Feb 1994 A
5287532 Hunt Feb 1994 A
5294119 Vincent et al. Mar 1994 A
5301284 Estes et al. Apr 1994 A
5301344 Kolchinsky Apr 1994 A
5303172 Magar et al. Apr 1994 A
5311079 Ditlow et al. May 1994 A
5327125 Iwase et al. Jul 1994 A
5336950 Popli et al. Aug 1994 A
5343406 Freeman et al. Aug 1994 A
5347639 Rechtschaffen et al. Sep 1994 A
5349193 Mott et al. Sep 1994 A
5353432 Richek et al. Oct 1994 A
5355508 Kan Oct 1994 A
5361373 Gilson Nov 1994 A
5365125 Goetting et al. Nov 1994 A
5379444 Mumme Jan 1995 A
5386154 Goetting et al. Jan 1995 A
5386518 Reagle et al. Jan 1995 A
5392437 Matter et al. Feb 1995 A
5408643 Katayose Apr 1995 A
5410723 Schmidt et al. Apr 1995 A
5412795 Larson May 1995 A
5418952 Morley et al. May 1995 A
5418953 Hunt et al. May 1995 A
5421019 Holsztynski et al. May 1995 A
5422823 Agrawal et al. Jun 1995 A
5425036 Liu et al. Jun 1995 A
5426378 Ong Jun 1995 A
5428526 Flood et al. Jun 1995 A
5430687 Hung et al. Jul 1995 A
5440245 Galbraith et al. Aug 1995 A
5440538 Olsen et al. Aug 1995 A
5442790 Nosenchuck Aug 1995 A
5444394 Watson et al. Aug 1995 A
5448186 Kawata Sep 1995 A
5450022 New Sep 1995 A
5455525 Ho et al. Oct 1995 A
5457644 McCollum Oct 1995 A
5465375 Thepaut et al. Nov 1995 A
5469003 Kean Nov 1995 A
5473266 Ahanin et al. Dec 1995 A
5473267 Stansfield Dec 1995 A
5475583 Bock et al. Dec 1995 A
5475803 Stearns et al. Dec 1995 A
5475856 Kogge Dec 1995 A
5477525 Okabe Dec 1995 A
5483620 Pechanek et al. Jan 1996 A
5485103 Pedersen et al. Jan 1996 A
5485104 Agrawal et al. Jan 1996 A
5489857 Agrawal et al. Feb 1996 A
5491353 Kean Feb 1996 A
5493239 Zlotnick Feb 1996 A
5497498 Taylor Mar 1996 A
5504439 Tavana Apr 1996 A
5506998 Kato et al. Apr 1996 A
5510730 El Gamal et al. Apr 1996 A
5511173 Yamaura et al. Apr 1996 A
5513366 Agarwal et al. Apr 1996 A
5521837 Frankle et al. May 1996 A
5522083 Gove et al. May 1996 A
5525971 Flynn Jun 1996 A
5530873 Takano Jun 1996 A
5530946 Bouvier et al. Jun 1996 A
5532693 Winters et al. Jul 1996 A
5532957 Malhi Jul 1996 A
5535406 Kolchinsky Jul 1996 A
5537057 Leong et al. Jul 1996 A
5537580 Giomi et al. Jul 1996 A
5537601 Kimura et al. Jul 1996 A
5541530 Cliff et al. Jul 1996 A
5544336 Kato et al. Aug 1996 A
5548773 Kemeny et al. Aug 1996 A
5550782 Cliff et al. Aug 1996 A
5555434 Carlstedt Sep 1996 A
5559450 Ngai et al. Sep 1996 A
5561738 Kinerk et al. Oct 1996 A
5570040 Lytle et al. Oct 1996 A
5572710 Asano et al. Nov 1996 A
5574930 Halverson, Jr. et al. Nov 1996 A
5581731 King et al. Dec 1996 A
5583450 Trimberger et al. Dec 1996 A
5586044 Agrawal et al. Dec 1996 A
5587921 Agrawal et al. Dec 1996 A
5588152 Dapp et al. Dec 1996 A
5590345 Barker et al. Dec 1996 A
5590348 Phillips et al. Dec 1996 A
5596742 Agarwal et al. Jan 1997 A
5600265 El Gamal et al. Feb 1997 A
5600597 Kean et al. Feb 1997 A
5600845 Gilson Feb 1997 A
5606698 Powell Feb 1997 A
5608342 Trimberger Mar 1997 A
5611049 Pitts Mar 1997 A
5617547 Feeney et al. Apr 1997 A
5617577 Barker et al. Apr 1997 A
5619720 Garde et al. Apr 1997 A
5625806 Kromer Apr 1997 A
5625836 Barker et al. Apr 1997 A
5627992 Baror May 1997 A
5634131 Matter et al. May 1997 A
5635851 Tavana Jun 1997 A
5642058 Trimberger et al. Jun 1997 A
5646544 Iadanza Jul 1997 A
5646545 Trimberger et al. Jul 1997 A
5649176 Selvidge et al. Jul 1997 A
5649179 Steenstra et al. Jul 1997 A
5652529 Gould et al. Jul 1997 A
5652894 Hu et al. Jul 1997 A
5655069 Ogawara et al. Aug 1997 A
5655124 Lin Aug 1997 A
5656950 Duong et al. Aug 1997 A
5657330 Matsumoto Aug 1997 A
5659785 Pechanek et al. Aug 1997 A
5659797 Zandveld et al. Aug 1997 A
5675262 Doung et al. Oct 1997 A
5675743 Mavity Oct 1997 A
5680583 Kuijsten Oct 1997 A
5682491 Pechanek et al. Oct 1997 A
5687325 Chang Nov 1997 A
5694602 Smith Dec 1997 A
5696791 Yeung Dec 1997 A
5696976 Nizar et al. Dec 1997 A
5701091 Kean Dec 1997 A
5705938 Kean Jan 1998 A
5713037 Wilkinson et al. Jan 1998 A
5717943 Barker et al. Feb 1998 A
5732209 Vigil et al. Mar 1998 A
5734869 Chen Mar 1998 A
5734921 Dapp et al. Mar 1998 A
5737516 Circello et al. Apr 1998 A
5737565 Mayfield Apr 1998 A
5742180 DeHon et al. Apr 1998 A
5745734 Craft et al. Apr 1998 A
5748872 Norman May 1998 A
5748979 Trimberger May 1998 A
5752035 Trimberger May 1998 A
5754459 Telikepalli May 1998 A
5754820 Yamagami May 1998 A
5754827 Barbier et al. May 1998 A
5754871 Wilkinson et al. May 1998 A
5760602 Tan Jun 1998 A
5761484 Agarwal et al. Jun 1998 A
5773994 Jones Jun 1998 A
5778439 Trimberger et al. Jul 1998 A
5781756 Hung Jul 1998 A
5784636 Rupp Jul 1998 A
5794059 Barker et al. Aug 1998 A
5794062 Baxter Aug 1998 A
5801547 Kean Sep 1998 A
5801715 Norman Sep 1998 A
5801958 Dangelo et al. Sep 1998 A
5802290 Casselman Sep 1998 A
5804986 Jones Sep 1998 A
5815004 Trimberger et al. Sep 1998 A
5815715 Kayhan Sep 1998 A
5815726 Cliff Sep 1998 A
5821774 Veytsman et al. Oct 1998 A
5828229 Cliff et al. Oct 1998 A
5828858 Athanas et al. Oct 1998 A
5831448 Kean Nov 1998 A
5838165 Chatter Nov 1998 A
5841973 Cooke et al. Nov 1998 A
5844422 Trimberger et al. Dec 1998 A
5844888 Markkula, Jr. et al. Dec 1998 A
5848238 Shimomura et al. Dec 1998 A
5854918 Baxter Dec 1998 A
5857097 Henzinger et al. Jan 1999 A
5857109 Taylor Jan 1999 A
5859544 Norman Jan 1999 A
5860119 Dockser Jan 1999 A
5862403 Kanai et al. Jan 1999 A
5865239 Carr Feb 1999 A
5867691 Shiraishi Feb 1999 A
5867723 Peters et al. Feb 1999 A
5870620 Kadosumi et al. Feb 1999 A
5884075 Hester et al. Mar 1999 A
5887162 Williams et al. Mar 1999 A
5887165 Martel et al. Mar 1999 A
5889533 Lee Mar 1999 A
5889982 Rodgers et al. Mar 1999 A
5892370 Eaton et al. Apr 1999 A
5892961 Trimberger Apr 1999 A
5892962 Cloutier Apr 1999 A
5894565 Furtek et al. Apr 1999 A
5901279 Davis, III May 1999 A
5915123 Mirsky et al. Jun 1999 A
5924119 Sindhu et al. Jul 1999 A
5926638 Inoue Jul 1999 A
5927423 Wada et al. Jul 1999 A
5933023 Young Aug 1999 A
5933642 Greenbaum et al. Aug 1999 A
5936424 Young et al. Aug 1999 A
5943242 Vorbach et al. Aug 1999 A
5956518 DeHon et al. Sep 1999 A
5960193 Guttag et al. Sep 1999 A
5960200 Eager et al. Sep 1999 A
5966143 Breternitz, Jr. Oct 1999 A
5966534 Cooke et al. Oct 1999 A
5970254 Cooke et al. Oct 1999 A
5978260 Trimberger et al. Nov 1999 A
5978583 Ekanadham et al. Nov 1999 A
5996083 Gupta et al. Nov 1999 A
5999990 Sharrit et al. Dec 1999 A
6003143 Kim et al. Dec 1999 A
6011407 New Jan 2000 A
6014509 Furtek et al. Jan 2000 A
6020758 Patel et al. Feb 2000 A
6020760 Sample et al. Feb 2000 A
6021490 Vorbach et al. Feb 2000 A
6023564 Trimberger Feb 2000 A
6023742 Ebeling et al. Feb 2000 A
6026481 New et al. Feb 2000 A
6034538 Abramovici Mar 2000 A
6035371 Magloire Mar 2000 A
6038650 Vorbach et al. Mar 2000 A
6038656 Martin et al. Mar 2000 A
6044030 Zheng et al. Mar 2000 A
6047115 Mohan et al. Apr 2000 A
6049222 Lawman Apr 2000 A
6049866 Earl Apr 2000 A
6052773 DeHon et al. Apr 2000 A
6054873 Laramie Apr 2000 A
6055619 North et al. Apr 2000 A
6058469 Baxter May 2000 A
6076157 Borkenhagen et al. Jun 2000 A
6077315 Greenbaum et al. Jun 2000 A
6081903 Vorbach et al. Jun 2000 A
6084429 Trimberger Jul 2000 A
6085317 Smith Jul 2000 A
6086628 Dave et al. Jul 2000 A
6088795 Vorbach et al. Jul 2000 A
6092174 Roussakov Jul 2000 A
6105105 Trimberger et al. Aug 2000 A
6105106 Manning Aug 2000 A
6108760 Mirsky et al. Aug 2000 A
6118724 Higginbottom Sep 2000 A
6119181 Vorbach et al. Sep 2000 A
6122719 Mirsky et al. Sep 2000 A
6125408 McGee et al. Sep 2000 A
6127908 Bozler et al. Oct 2000 A
6128720 Pechanek et al. Oct 2000 A
6134166 Lytle et al. Oct 2000 A
6137307 Iwanczuk et al. Oct 2000 A
6145072 Shams et al. Nov 2000 A
6150837 Beal et al. Nov 2000 A
6150839 New et al. Nov 2000 A
6154048 Iwanczuk et al. Nov 2000 A
6154049 New Nov 2000 A
6157214 Marshall Dec 2000 A
6170051 Dowling Jan 2001 B1
6172520 Lawman et al. Jan 2001 B1
6173434 Wirthlin et al. Jan 2001 B1
6178494 Casselman Jan 2001 B1
6185256 Saito et al. Feb 2001 B1
6185731 Maeda et al. Feb 2001 B1
6188240 Nakaya Feb 2001 B1
6188650 Hamada et al. Feb 2001 B1
6198304 Sasaki Mar 2001 B1
6201406 Iwanczuk et al. Mar 2001 B1
6202182 Abramovici et al. Mar 2001 B1
6204687 Schultz et al. Mar 2001 B1
6211697 Lien et al. Apr 2001 B1
6212650 Guccione Apr 2001 B1
6215326 Jefferson et al. Apr 2001 B1
6216223 Revilla et al. Apr 2001 B1
6219833 Solomon et al. Apr 2001 B1
RE37195 Kean May 2001 E
6230307 Davis et al. May 2001 B1
6240502 Panwar et al. May 2001 B1
6243808 Wang Jun 2001 B1
6247147 Beenstra et al. Jun 2001 B1
6252792 Marshall et al. Jun 2001 B1
6256724 Hocevar et al. Jul 2001 B1
6260179 Ohsawa et al. Jul 2001 B1
6262908 Marshall et al. Jul 2001 B1
6263430 Trimberger et al. Jul 2001 B1
6266760 DeHon et al. Jul 2001 B1
6279077 Nasserbakht et al. Aug 2001 B1
6282627 Wong et al. Aug 2001 B1
6282701 Wygodny et al. Aug 2001 B1
6285624 Chen Sep 2001 B1
6286134 Click, Jr. et al. Sep 2001 B1
6288566 Hanrahan et al. Sep 2001 B1
6289440 Casselman Sep 2001 B1
6298472 Phillips et al. Oct 2001 B1
6301706 Maslennikov et al. Oct 2001 B1
6311200 Hanrahan et al. Oct 2001 B1
6311265 Beckerle et al. Oct 2001 B1
6321366 Tseng et al. Nov 2001 B1
6321373 Ekanadham et al. Nov 2001 B1
6338106 Vorbach et al. Jan 2002 B1
6341318 Dakhil Jan 2002 B1
6347346 Taylor Feb 2002 B1
6349346 Hanrahan et al. Feb 2002 B1
6353841 Marshall et al. Mar 2002 B1
6362650 New et al. Mar 2002 B1
6370596 Dakhil Apr 2002 B1
6373779 Pang et al. Apr 2002 B1
6374286 Gee Apr 2002 B1
6378068 Foster et al. Apr 2002 B1
6381624 Colon-Bonet et al. Apr 2002 B1
6389379 Lin et al. May 2002 B1
6389579 Phillips et al. May 2002 B1
6392912 Hanrahan et al. May 2002 B1
6398383 Huang Jun 2002 B1
6400601 Sudo et al. Jun 2002 B1
6404224 Azegami et al. Jun 2002 B1
6405185 Pechanek et al. Jun 2002 B1
6405299 Vorbach et al. Jun 2002 B1
6421808 McGeer Jul 2002 B1
6421809 Wuytack et al. Jul 2002 B1
6421817 Mohan et al. Jul 2002 B1
6425054 Nguyen Jul 2002 B1
6425068 Vorbach Jul 2002 B1
6426649 Fu et al. Jul 2002 B1
6427156 Chapman et al. Jul 2002 B1
6430309 Pressman et al. Aug 2002 B1
6434642 Camilleri et al. Aug 2002 B1
6434695 Esfahani et al. Aug 2002 B1
6434699 Jones et al. Aug 2002 B1
6437441 Yamamoto Aug 2002 B1
6438747 Schreiber et al. Aug 2002 B1
6457116 Mirsky et al. Sep 2002 B1
6476634 Bilski Nov 2002 B1
6477643 Vorbach et al. Nov 2002 B1
6480937 Vorbach et al. Nov 2002 B1
6480954 Trimberger et al. Nov 2002 B2
6483343 Faith et al. Nov 2002 B1
6487709 Keller et al. Nov 2002 B1
6490695 Zagorski et al. Dec 2002 B1
6496971 Lesea et al. Dec 2002 B1
6504398 Lien et al. Jan 2003 B1
6507898 Gibson et al. Jan 2003 B1
6507947 Schreiber et al. Jan 2003 B1
6513077 Vorbach et al. Jan 2003 B2
6516382 Manning Feb 2003 B2
6518787 Allegrucci et al. Feb 2003 B1
6519674 Lam et al. Feb 2003 B1
6523107 Stansfield et al. Feb 2003 B1
6525678 Veenstra et al. Feb 2003 B1
6526520 Vorbach et al. Feb 2003 B1
6538468 Moore Mar 2003 B1
6538470 Langhammer et al. Mar 2003 B1
6539415 Mercs Mar 2003 B1
6539438 Ledzius et al. Mar 2003 B1
6539477 Seawright Mar 2003 B1
6542394 Marshall et al. Apr 2003 B2
6542844 Hanna Apr 2003 B1
6542998 Vorbach Apr 2003 B1
6553395 Marshall et al. Apr 2003 B2
6553479 Mirsky et al. Apr 2003 B2
6567834 Marshall et al. May 2003 B1
6571381 Vorbach et al. May 2003 B1
6587939 Takano Jul 2003 B1
6598128 Yoshioka et al. Jul 2003 B1
6631487 Abramovici et al. Oct 2003 B1
6633181 Rupp Oct 2003 B1
6657457 Hanrahan et al. Dec 2003 B1
6658564 Smith et al. Dec 2003 B1
6665758 Frazier et al. Dec 2003 B1
6687788 Vorbach et al. Feb 2004 B2
6697979 Vorbach et al. Feb 2004 B1
6704816 Burke Mar 2004 B1
6708325 Cooke et al. Mar 2004 B2
6717436 Kress et al. Apr 2004 B2
6721830 Vorbach et al. Apr 2004 B2
6728871 Vorbach et al. Apr 2004 B1
6745317 Mirsky et al. Jun 2004 B1
6748440 Lisitsa et al. Jun 2004 B1
6751722 Mirsky et al. Jun 2004 B2
6754805 Juan Jun 2004 B1
6757847 Farkash et al. Jun 2004 B1
6757892 Gokhale et al. Jun 2004 B1
6782445 Olgiati et al. Aug 2004 B1
6785826 Durham et al. Aug 2004 B1
6802206 Patterson et al. Oct 2004 B2
6803787 Wicker, Jr. Oct 2004 B1
6820188 Stansfield et al. Nov 2004 B2
6829697 Davis et al. Dec 2004 B1
6847370 Baldwin et al. Jan 2005 B2
6868476 Rosenbluth et al. Mar 2005 B2
6871341 Shyr Mar 2005 B1
6874108 Abramovici et al. Mar 2005 B1
6886092 Douglass et al. Apr 2005 B1
6901502 Yano et al. May 2005 B2
6928523 Yamada Aug 2005 B2
6961924 Bates et al. Nov 2005 B2
6975138 Pani et al. Dec 2005 B2
6977649 Baldwin et al. Dec 2005 B1
7000161 Allen et al. Feb 2006 B1
7007096 Lisitsa et al. Feb 2006 B1
7010687 Ichimura Mar 2006 B2
7028107 Vorbach et al. Apr 2006 B2
7038952 Zack et al. May 2006 B1
7043416 Lin May 2006 B1
7210129 May et al. Apr 2007 B2
7216204 Rosenbluth et al. May 2007 B2
7237087 Vorbach et al. Jun 2007 B2
7249351 Songer et al. Jul 2007 B1
7254649 Subramanian et al. Aug 2007 B2
7340596 Crosland et al. Mar 2008 B1
7346644 Langhammer et al. Mar 2008 B1
7350178 Crosland et al. Mar 2008 B1
7382156 Pani et al. Jun 2008 B2
7595659 Vorbach et al. Sep 2009 B2
7650448 Vorbach et al. Jan 2010 B2
20010001860 Bieu May 2001 A1
20010003834 Shimonishi Jun 2001 A1
20010010074 Nishihara et al. Jul 2001 A1
20010018733 Fujii et al. Aug 2001 A1
20010032305 Barry Oct 2001 A1
20020013861 Adiletta et al. Jan 2002 A1
20020038414 Taylor Mar 2002 A1
20020045952 Blemel Apr 2002 A1
20020083308 Pereira et al. Jun 2002 A1
20020103839 Ozawa Aug 2002 A1
20020124238 Metzgen Sep 2002 A1
20020138716 Master et al. Sep 2002 A1
20020143505 Drusinsky Oct 2002 A1
20020144229 Hanrahan Oct 2002 A1
20020156962 Chopra et al. Oct 2002 A1
20020165886 Lam Nov 2002 A1
20030001615 Sueyoshi et al. Jan 2003 A1
20030014743 Cooke et al. Jan 2003 A1
20030046607 May et al. Mar 2003 A1
20030052711 Taylor Mar 2003 A1
20030055861 Lai et al. Mar 2003 A1
20030056085 Vorbach Mar 2003 A1
20030056091 Greenberg Mar 2003 A1
20030056202 May et al. Mar 2003 A1
20030061542 Bates et al. Mar 2003 A1
20030062922 Douglass et al. Apr 2003 A1
20030086300 Noyes et al. May 2003 A1
20030093662 Vorbach et al. May 2003 A1
20030097513 Vorbach et al. May 2003 A1
20030123579 Safavi et al. Jul 2003 A1
20030135686 Vorbach et al. Jul 2003 A1
20030192032 Andrade et al. Oct 2003 A1
20040015899 May et al. Jan 2004 A1
20040025005 Vorbach et al. Feb 2004 A1
20040078548 Claydon et al. Apr 2004 A1
20040168099 Vorbach et al. Aug 2004 A1
20040199688 Vorbach et al. Oct 2004 A1
20050066213 Vorbach et al. Mar 2005 A1
20050144210 Simkins et al. Jun 2005 A1
20050144212 Simkins et al. Jun 2005 A1
20050144215 Simkins et al. Jun 2005 A1
20060130096 Thendean et al. Oct 2006 A1
20060230094 Simkins et al. Oct 2006 A1
20090085603 Paul et al. Apr 2009 A1
Foreign Referenced Citations (120)
Number Date Country
42 21 278 Jan 1994 DE
44 16 881 Nov 1994 DE
38 55 673 Nov 1996 DE
196 51 075 Jun 1998 DE
196 54 593 Jul 1998 DE
196 54 595 Jul 1998 DE
196 54 846 Jul 1998 DE
197 04 044 Aug 1998 DE
197 04 728 Aug 1998 DE
197 04 742 Sep 1998 DE
198 22 776 Mar 1999 DE
198 07 872 Aug 1999 DE
198 61 088 Feb 2000 DE
199 26 538 Dec 2000 DE
100 28 397 Dec 2001 DE
100 36 627 Feb 2002 DE
101 29 237 Apr 2002 DE
102 04 044 Aug 2003 DE
0 208 457 Jan 1987 EP
0 221 360 May 1987 EP
0 398 552 Nov 1990 EP
0 428 327 May 1991 EP
0 463 721 Jan 1992 EP
0 477 809 Apr 1992 EP
0 485 690 May 1992 EP
0 497 029 Aug 1992 EP
0 539 595 May 1993 EP
0 638 867 Aug 1994 EP
0 628 917 Dec 1994 EP
0 678 985 Oct 1995 EP
0 686 915 Dec 1995 EP
0 707 269 Apr 1996 EP
0 726 532 Aug 1996 EP
0 735 685 Oct 1996 EP
0 746 106 Dec 1996 EP
0 748 051 Dec 1996 EP
0 926 594 Jun 1999 EP
1 061 439 Dec 2000 EP
1 102 674 May 2001 EP
1 115 204 Jul 2001 EP
1 146 432 Oct 2001 EP
0 696 001 Dec 2001 EP
1 669 885 Jun 2006 EP
2 752 466 Feb 1998 FR
2 304 438 Mar 1997 GB
58-58672 Apr 1983 JP
1-229378 Sep 1989 JP
2-130023 May 1990 JP
2-226423 Sep 1990 JP
5-265705 Oct 1993 JP
5-276007 Oct 1993 JP
5-509184 Dec 1993 JP
6-266605 Sep 1994 JP
7-086921 Mar 1995 JP
7-154242 Jun 1995 JP
8-148989 Jun 1995 JP
8-44581 Feb 1996 JP
08069447 Mar 1996 JP
8-101761 Apr 1996 JP
8-102492 Apr 1996 JP
8-221164 Aug 1996 JP
8-250685 Sep 1996 JP
9-27745 Jan 1997 JP
9-294069 Nov 1997 JP
11-184718 Jul 1999 JP
11-307725 Nov 1999 JP
2000-076066 Mar 2000 JP
2000-181566 Jun 2000 JP
2000-201066 Jul 2000 JP
2000-311156 Nov 2000 JP
2001-500682 Jan 2001 JP
2001-167066 Jun 2001 JP
2001-510650 Jul 2001 JP
2002-0033457 Jan 2002 JP
05-509184 Dec 2003 JP
3-961028 Aug 2007 JP
WO9004835 May 1990 WO
WO9011648 Oct 1990 WO
WO9201987 Feb 1992 WO
WO9311503 Jun 1993 WO
WO9406077 Mar 1994 WO
WO9408399 Apr 1994 WO
WO9500161 Jan 1995 WO
WO9526001 Sep 1995 WO
WO9810517 Mar 1998 WO
WO9826356 Jun 1998 WO
WO9828697 Jul 1998 WO
WO9829952 Jul 1998 WO
WO9831102 Jul 1998 WO
WO9835294 Aug 1998 WO
WO9835299 Aug 1998 WO
WO9900731 Jan 1999 WO
WO9900739 Jan 1999 WO
WO9912111 Mar 1999 WO
WO9932975 Jul 1999 WO
WO9940522 Aug 1999 WO
WO9944120 Sep 1999 WO
WO9944147 Sep 1999 WO
WO0017771 Mar 2000 WO
WO0038087 Jun 2000 WO
0045282 Aug 2000 WO
WO0049496 Aug 2000 WO
WO0077652 Dec 2000 WO
WO0155917 Aug 2001 WO
WO0213000 Feb 2002 WO
WO0221010 Mar 2002 WO
WO0229600 Apr 2002 WO
WO0250665 Jun 2002 WO
WO02071196 Sep 2002 WO
WO02071248 Sep 2002 WO
WO02071249 Sep 2002 WO
WO02103532 Dec 2002 WO
WO03017095 Feb 2003 WO
WO03023616 Mar 2003 WO
WO03025781 Mar 2003 WO
WO03032975 Apr 2003 WO
WO03036507 May 2003 WO
WO2004053718 Jun 2004 WO
WO2004114128 Dec 2004 WO
WO2005045692 May 2005 WO
Related Publications (1)
Number Date Country
20090146690 A1 Jun 2009 US
Continuations (3)
Number Date Country
Parent 10791501 Mar 2004 US
Child 12368709 US
Parent 10329132 Dec 2002 US
Child 10791501 US
Parent PCT/DE97/02949 Dec 1997 US
Child 10329132 US
Continuation in Parts (1)
Number Date Country
Parent 08946810 Oct 1997 US
Child PCT/DE97/02949 US