Logic cell array and bus system

Abstract
A logic cell array having a number of logic cells and a segmented bus system for logic cell communication, the bus system including different segment lines having shorter and longer segments for connecting two points in order to be able to minimize the number of bus elements traversed between separate communication start and end points.
Description
FIELD OF THE INVENTION

The present invention relates to logic cell arrays.


BACKGROUND INFORMATION

Logic cell arrays, such as, for example, reconfigurable logic cell arrays include, as particular types, systolic arrays, neuronal networks, multi-processor systems, processors having a number of arithmetic-logic units, and/or logic cells and/or communicative/peripheral cells (I/O), networking and/or network chips, such as crossbar switches, as well as FPGA, DPGA, Xputer, Chameleon chips, etc. The following patents commonly assigned to the assignee of the present application describe logic cell arrays and are incorporated by reference in their entirety: German Patent No. 44 16 881; German Patent No. 197 81 412; German Patent No. 197 81 483; German Patent No. 196 54 846, German Patent No. 196 54 593; German Patent No. 197 04 044; German Patent No. 198 80 129, German Patent No. 198 61 088, German Patent No. 199 80 312; International Patent Application No. PCT/DB 00/01869; German Patent No. 100 36 627, German Patent No. 100 28 397, German Patent No. 101 10 530, German Patent No. 101 11 014, International Patent Application No. PCT/EP 00/10516, and European Patent No. 01 102 674. According to their wide variety, logic cells are herein defined as any cells that contain logic, arithmetic, switches, memory, or peripherals.


In systems such as those previously cited, there are approaches that enable in efficient processing of data which may be implemented in hardware architectures. There nevertheless exists in practical implementations the need to optimize designs, which, in particular, can be structured in a space-saving manner on a wafer and/or can be operated in an energy-saving manner. Additionally, it is desirable to find especially advantageous kinds of operation. One of the difficulties with conventional systems is that a large number of cells have to communicate with each other. The communication may be required in order to pass the data to be processed from one cell to another. This is the case, for example, if a cell is supposed to further process the results from another cell, e.g., by linking of the result obtained there to results obtained from one or more other cells. Furthermore, communication may be required to transmit status signals.


Busses for transmitting signals to one of a number of possible receivers have been used in this context. Busses are bundles of wires, the number of wires typically being determined from the number of bits to be transmitted together, that is, typically in parallel, plus in some cases a series of status lines.


With conventional simple busses, as are used, for example, in PC's for the communication of plug-in boards with the CPU and/or with each other, the bus lines may be routed to all receivers, and then appropriate control signals transmitted along with them, that is, addressing, ensures that only those receivers respond that are supposed to receive the data. Such a system becomes problematic when a great many communicating units need access to the bus or busses. This is because the communication of data must wait, if necessary, until the bus has been released by other units and/or time-slice solutions must be implemented that grant a transmitting unit only a certain transmission time, which as a rule is independent of whether all data has been transmitted in this time, which might also make it necessary to use a number of time slices for the data transmission. For example, this approach is practiced in systems like the token ring network. In systems like logic cell arrays, in which very rapid communication is desired in order to ensure high data processing speeds, this is an undesirable solution.


It has also been proposed that the busses be segmented. If, for example, in a series of logic cells several units to be connected to each other are disposed close together in pairs, a bus line that passes along all units and consequently is long may be separated by means of switches in order to form several subbus systems. In this context, each segment, like the entire bus, comprises the required number of parallel data lines and the additionally required protocol lines; the communication of a pair of logic cells that are disposed close together does not disrupt the communication of another pair that are disposed close together. In this way, the data rate that is transmitted via the bus system may be substantially increased.


However, this system may not work well when integrated on semiconductor chips, such as in CMOS technology, where the structure is typically complex and the operation is energy inefficient.


SUMMARY

According to example embodiments of the present invention, in a logic cell array having a number of logic cells and a segmented bus system for logic cell communication, the bus system includes different segment lines having shorter and longer segments for connecting two points in order to be able to minimize the number of bus elements traversed between separate communication start and end points.


By configuring the busses using segments of great length that are fashioned as a single line for bypassing long paths in a logic cell array, an especially simple design and an especially efficient operation result. By simultaneously providing short segment lines, it is ensured that all points are addressable as needed.


Each of the segment lines may be formed of a plurality of parallel lines whose number is determined by the bus width and/or the bus protocol. Each segment is therefore formed by a bundle of parallel lines. All lines of a segment may have the same length, so that the lines of a line bundle may all be routed to one and the same end point line, such as a data input of a logic cell, where they may be connected to the input members that are assigned to each of their bits.


According to one example embodiment, data conversion logic cells like arithmetic units have three of the line bundles that are required for the processed bit width to be supplied to them as data supply lines. This permits carrying out a linking of operands A, B, C of the A×B+C type within the cell. This operation is of particular significance in the field of digital signal processing, and the bus structure is therefore especially suitable for logic cell arrays for the construction of real-time configurable DSP arrays.


According to another example embodiment, a logic cell array can perform arithmetically multiplicative linking of operands if at least two of the line bundles for data for the bit width being processed are led out from the cells, in particular with one line bundle for high-order bits and one line bundle for low-order bits. In this way, for a data word width of 32 bits, a 64-bit-wide output is created in order to output the result of a multiplication in full width.


In reconfigurable logic cells, control inputs may be addressable in particular via the segmentable bus system and are disposed in such a manner that at least the logic cell's sequence control signals, such as the signals Reset, Step, Stop, Go and Reload, are transferable into the cell. These trigger and/or enable a reset, a reconfiguration and an activation, respectively. For this purpose a corresponding number of bit lines may be provided. In one embodiment, at least two bit-wide data lines are therefore provided for control signal inputs. Each of the control signals may have a separate signal input assigned to it. Alternatively, an input linking circuit on a several-bit-wide status line may provide for an orderly addressing of the cell. These signal inputs are control signal inputs that can carry the signals that control configuration and/or reconfiguration (flow control signals), such as trigger signals. The actual communication of the cell with the unit or a reconfiguring unit, such as a configuration manager (CT or CM) may thus be achieved by techniques, for example, via the so-called ready/ack/rej protocol, which permits a reconfiguration of the cell only under certain conditions. For the details of this protocol, reference is made to the above-listed patents and additional publicly accessible documents about XPP/VPU architecture.


In the case of rebooting. The bus structure may be designed for this accordingly.


Furthermore, the bus system may be routed to I/O interfaces and/or to external data memories. In other words, the segmentation structure may be used to advantage both inside and outside the logic cell field. I/O interfaces transmit from bus systems that are inside chips to the outside. In this context any bus systems, in some cases alternating in time, are connected for external output and/or input. In addition, the possibility may exist of combining several bus systems in such a manner that they are synchronized with each other. For example, any two output bus systems or an input bus and an output bus together may be synchronized.


In an example embodiment of the bus system, a series of interline elements is provided. Here “line” indicates in particular a first-class conductor, such as a continuous metal line within a semiconductor wafer. “Interline elements” indicate those elements that are disposed between any two lines that are assigned to each other. Interline elements may be connecting switches, in particular the control arrangements that respond to the requirements of logic cells and/or the communication thereof and/or other units; thus, the switch may, for example, open or close at the request of a configuration manager, that is, a unit that configures the logic cell field. This makes it possible to use a compiler to establish how the bus structure is to be designed. In particular the compiler or another configuring or controlling unit is able to determine whether the communication between two cells that are separated is to be accomplished via segment lines having shorter or longer segments, and moreover, if there are a number of longer segments, a preference may also be specified through which one of a multiplicity of segment lines the communication is to occur. In this way, the power loss through the switch may be minimized and/or an optimal adaptation of the data conversion and/or processing to signal propagation times may be provided along the bus lines.


The interline elements may additionally or alternatively include multiplexers in order to feed a signal from a line to one of a series of destinations, such as logic cells, and/or lines that continue further and feed the signal to a multiplicity of destinations, in particular selectable destinations, simultaneously.


Furthermore, registers may be provided as interline elements. These perform different tasks. In this manner data may at first be kept on the bus until a destination is ready to retrieve them. Furthermore, when busses are very long, data processing can be prevented from being properly completed if the long periods of time until the data arrive at the destination when paths are long and (in some cases) the return of the reception confirmation is taken into account. Buffering the data in registers increases the total amount of time (delay) until a data packet traverses the bus, but the interim time until arrival of the data (latency) in which the array or individual cells may not be used meaningfully is reduced. A tradeoff between latency and delay may be required, in which the register is switched in, for example, only under predetermined and/or established conditions, such as very long bus paths. It may then be advantageous if the switching on of the register is controlled, e.g., by a control unit or similar item, like a configuration manager, which in turn is able to operate in response to compiler-generated commands. Furthermore, it may be advantageous to provide a register in order to ensure a synchronous arrival of bits of different significance at a destination point. If busses are fed back, that is, a connection is provided from a cell output to the input of the same cell, registers may be used in such high-frequency feedback loops, to prevent damage to components by the register-imposed delay time.


In a particular implementation, registers may be designed all or in part as additive and/or multiplicative registers; specific links may be implemented without problem and with little circuitry effort, and, thus, the logic cell structure may be relieved on a net basis via shifting of simple linking tasks. In particular, a register may be designed precisely for the purpose of linking two operands algebraically; in busses for transmitting status signals that indicate the status of a logic cell or a series of logic cells and/or trigger a change thereof, that is, in busses for so-called trigger vectors, the registers may preferably be designed to implement Boolean links and/or lookup tables, such as modifiable lookup tables.


Line drivers can also be provided as interline elements.


This may be necessary in particular for multiplex systems that provide a very strong signal fanout.


In another example embodiment of the present invention, it is possible to provide a change from one segment line having longer segments to a segment line having shorter segments and/or vice-versa along a data transmission path. This permits the provision of roughly equal signal propagation times for the communication of a larger number of cells in the same direction, that is, along the same bus structure, via an appropriate combination of short and long segments, even if buffer registers are provided. The bus structure in this context is comparable to a street that has fast lanes and crawler lanes and enables a lane change at predetermined intermediate positions.


In yet another example embodiment, the bus system may include a multiplicity of parallel segment lines in which several parallel segment lines are provided with longer segments. The longer segments of the segment lines that have longer segments do not all need to be of the same length; a staggered arrangement may be provided.


When there is a greater number of parallel segment lines, the segment line ends and/or interline elements may be disposed within the segment lines at an offset in relation to each other in the bus direction. Typically, interline elements, such as, switches, registers, multiplexers and drivers are provided at the segment line ends or leads. The hardware technology implementation of these elements then requires substantial space, which may be considerable compared to that of the lines to be disposed in the intermediate layers. The offset disposition of these elements then ensures that space has to be provided only for interline element arrays of, for example, two or three segment lines, but not for interline element dispositions of all available segment lines. Also it is possible not to provide drivers or registers for all interline element dispositions, but only to provide them every nth segment end. However, in this case, it is advantageous that at least three segment lines that have longer segments for at least two segment lines have segment line switching circuits, in particular multiplexers provided at predetermined positions as interline elements. In this way, the desired segment change may be configured as required. Segment changes occur at crossings and are possible among segment pairs or segment groups that vary along the bus. It is then possible that the segment line switching circuits for the change from a first to a second segment line are provided at a first position and the segment line switching circuits for the switch from a second to a third segment line at a second position.


In addition to switching by pairs, it is also possible to select, at a position or a multiplicity of positions, among several segment lines to switch to and/or to which data are simultaneously output.


In an additional aspect of the present invention, two-way communication of the cells is possible for the logic cell array. In bus systems having interline elements, such as drivers and/or registers, directions of travel are defined. In order to enable the communication of the cells in two directions, separate bus systems are provided for opposite running directions. At least in one direction, it is once again possible to provide at least two different segment lines with shorter and longer segments, in particular ones that are once again generally parallel.


If the segment lines are separate for the two directions of travel, a register may be provided for at least one direction of travel. As explained above, the register may be provided in the bus system that is routed in the reverse direction, i.e., to that bus system, with which signals may be routed back from an element output to an element input.


According to another aspect of the present invention, a first bus system may be provided for the transmission of data to be processed and a second bus system may be provided for the transmission of status and/or monitoring or control information. One or both bus systems may be formed with segment lines having short and long segments, and the respective bus systems or bus arrays may be configurable separately from each other, or definable in their circuitry and/or regarding the operations in linking registers or the output of lookup tables.


The bus system may be used in a logic cell array in which a plurality of logic cells are arranged adjacent to each other in a row. The longer segments then bypass at least one logic cell. If the logic cell array includes even more logic cells in a row, the longest segments may bypass more than one logic cell.


It should be pointed out that, in at least two-dimensional logic fields having a disposition of logic cells in rows and columns, a segmented bus system may be provided in each row and each column and have the previously described structure having long and short segments in parallel segment lines.


The described bus structure may be advantageous in arrays in which data processing units, such as logic units, are to be linked to each other. However, special advantages are offered if the logic cells are selected from, include and/or form arithmetic-logic units, DPGA's, Kress arrays, systolic processors and RAW machines, digital signal processors (DSP's) that have more than one arithmetic-logic unit, configurable (programmable) logic cells or other cores and/or PAE's, ALU, input/output (I/O) functions and/or memory management units (I/O) and memories. A successful implementation of a bus structure having segment lines that have short and long segments is the VPU/XPP processor unit produced by the applicant.


Such a processor may have a multiplicity of different communicating logic units disposed in an array, the logic units having at least memory storage and data conversion units and the memory units being disposed close to the edge of the array. This makes it possible to have data run through the array and be buffered, if necessary, at the edge in order to bring about reconfiguration as required. The flow may also occur via parallel rows or columns and/or in a meandering way, in order to thereby provide increased computing power.


Additionally, input/output units may be disposed closer to the edge than the storage units. This allows the buffering of data before processing by passing through the array. However, in any case communication of the logic units, at least from edge to edge, for at least one bus system to be provided that is, in particular, segmentable as previously described. Then, data read from a first memory that is close to the edge may be changed as required in a first data conversion unit that is close to this edge, and transferred from there into at least one other data conversion unit in order to carry out further data modifications as required. The data, after flowing through a plurality of data conversion units into a second memory close to the edge may be stored at a position distant from the first memory, and then a reconfiguration of the data conversion units may be carried out for the re-determination of the data conversion, and the data may be routed through at least one part of the data conversion units, possibly in the opposite direction of travel. It may also be provided that the outgoing run is made in a row and the return run in that row or a row situated beneath it in order to take into consideration pipeline effects.


The processor may have at least one programmable gate array (PGA) and several data modification units having ALU's. At least one PGA may be surrounded by other data conversion units, in particular ALU's, in order to be able to obtain data easily for linking purposes and/or output them.


It is possible that, in an array made up of reconfigurable units, several (sub-) arrays, particularly identical ones, are provided that may be brought into communication with each other. For this purpose, each may include a reconfiguration unit that may be designed for reconfiguration of the reconfigurable element of the array. Running inside the array are the bus structures appropriately described above. A configuration manager, which may in particular be disposed on an array side on which no memory units and/or I/O units are provided is thus assigned to each array, the reconfiguration unit may extend over the breadth of the array, which offers the advantage that an optimal chip form may be produced.


A supervising configuration manager which is common to the arrays and which extends in particular over the breadth of more than one array and which is designed for communication with at least several or all of the supervising configuration managers, may also be provided.


Alternatively or additionally, given such a processor having arrays that may be brought into communication with each other, in particular identical ones that have reconfigurable data conversion units, it is possible for the arrays to have switching units (VPAE's) between them that are disposed among the fields for communication switching.


Using such switching units (VPAE's), data and/or control signals (monitoring signals, trigger vectors, etc.) may be transmitted.


The configuration units of at least two of the arrays may be in direct connection with each other. As a result, a supervising configuration unit may be omitted and/or a fault tolerance may be increased. For this purpose, the communication of the configuration units of the at least two arrays that are in direct connection with each other is determined via dedicated fixed lines and/or data lines that are pre-configured, that is, established during bootup.


The switching units (VPAE's) may include two configuration registers, the first configuration register being addressable by the first array and the second configuration register being addressable by the second array. Only if access to the switching units has been permitted for both arrays, is data transmitted accordingly. For this purpose, the first array may permit the insertion of data in the switching unit by appropriate configuration of the first configuration register and signal the insertion of the data to the other configuration units via the dedicated line. Afterwards, the data is retrievable, which is ascertainable by configuration of the second configuration register. A sluice-like transmission of data is enabled by the VPAE's. The separation of a larger array into sub-arrays in other respects generally allows the reduction of the configuration effort to be handled by a configuration unit and as a result may contribute to an efficient array operation that is not impaired by a bottleneck imposed by a configuration unit.


The sub-arrays may be brought into communication with each other via multiple data conversion and/or transfer units (VPAE's) so that no data rate limitation is produced in the data processing.


The geometric hardware may be configured such that the communication-enabling data conversion units are connectable on both sides via busses running along the array, the busses being designed in particular to run past the array edge and there in particular may be routed further to I/O interface units.


As explained above, the processor may include one or more data relaying rule implementation arrangements, in particular a lookup table that are designed to enable relaying of data and in particular data conversion in response to the joint fulfillment of a multiplicity of criteria, in particular event-related criteria. The data to be relayed may in particular be data or trigger vectors that are involved in the reconfiguration and/or reconfigurability of logic cells. The function or the conversion of the relevant data relaying rule implementation arrangement is configured accordingly.


The processor may also be configured using segmented bus structures so that data conversion units and data storage means are provided, at least a few of the data conversion units being locally assigned data storage arrangement and in particular, an arrangement being provided to locally read out data that is locally written into the local data storage arrangement for the further local recent data modification. In other words, interim results may be stored in a logic cell and be further processed along with other data and/or using other links.


If there is a reconfiguration of a cell array made up of logic cells that are reconfigurable while in operation, which allows in particular a reconfiguration in response to the propagation of specific pre-determined data, then one may select whether the reconfiguration occurs in response to the data propagation for all logic cells into which the data that was pre-specified and/or derived therefrom flow and/or only for a part, in particular a processing branch (e.g., an if/then branch), while at least one other branch remains unchanged, which reduces the reconfiguration effort and/or only a sub-chain of a longer row of logic cells, in particular, sequential data-processing ones, is reconfigured, such as up to a predetermined logic cell, and/or in order to permit the reconfiguration immediately or after that data processing or further data processing. This substantially increases the practical use of the wave reconfiguration. It should be mentioned that such a selective wave reconfiguration is possible using only a few commands, in particular, for example, the commands Reset, Step, Stop, Go and Reload. Consequently, the number of trigger inputs or control inputs that are routed to a reconfigurable logic cell, such as a PAE, is small.


The manner in which a logic cell reacts to a specific characteristic data packet in wave reconfiguration is capable of being pre-loadable. This may happen in particular by pre-loading the lookup tables that are provided in the busses. The busses in this context may in part be routed via logic cells and/or formed by and/or with them.


It is possible without any other measures to use the processor array having the bus system of the present invention in order to approximate the behavior of non-linear systems quickly and simply in calculations. This may happen by approximations being determined for one row of working ranges that are adjacent to each other at one temporary working range (n) and at the working ranges that border it below and above ((n−1), (n+1)), the parameters that enable the approximations are pre-loaded, the behavior with the central (n) working range is approximated until that working range is exceeded inside of which the approximation is suitable, then that approximation (n−1) is used for further work which belongs to the working range into which the exceeding proceeded, and the approximation at that working range (n+1) into which the exceeding did not proceed is overwritten using an approximation (n−2) that, together with the previously used approximation (n), encompasses the currently used approximation (n−1) or the accompanying working range. By overwriting that working range in which the operation value is not run, only three variants need to be pre-loaded in order to ensure a rapid further processing after the range is exceeded. Because the overwriting of the preloaded working range happens during the data processing, a constant data computation is possible during a steady transition of the operation values without greater leaps or abrupt changes. It is possible that this manner of approximation may not transferred to multidimensional cases due to operation value encompassing in more than one direction and corresponding overwriting of the intervals that no longer adjoin the current operation value interval after the overwriting of an n-dimensional operation value interval.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 shows a logic cell array configured in accordance with an example embodiment of the present invention.



FIG. 2 shows a detailed view of the logic cell array having clusters.



FIG. 3 shows an example for a forward register of a configuration bus according to the present invention.



FIG. 4 shows an example embodiment of the hierarchy of configuration managers of a logic cell array according to the present invention.



FIG. 5 shows details of a PAE including data according to an example embodiment of the present invention. The three data inputs A B C in the logic cell, the five trigger inputs for the trigger vectors Reset, Stop, Step, GO and Reload, the two data outputs H(igh) and L(ow) as well as the status signal outputs UVW and the bus coupling are depicted.



FIG. 6
a shows the structure of the logic cell in the block diagram according to an example embodiment of the present invention.



FIG. 6
b shows the structure of a register according to an example embodiment of the present invention.



FIG. 6
c shows the structure of a reverse register for event signals having the optional lookup tables according to an example embodiment of the present invention.



FIG. 6
d shows a forward register having pre-loading capability according to an example embodiment of the present invention.



FIG. 7 shows a structure of a memory cell that has an input that is distinguishable from data conversion logic cells and has a correspondingly different required bus width according to an example embodiment of the present invention.



FIG. 8 shows another detailed view of a reverse register in the configuration bus having a lookup table for the implementation of Boolean links from trigger vector bits according to an example embodiment of the present invention.



FIG. 9 shows additional processor details, in particular of the busses according to an example embodiment of the present invention.



FIG. 10 shows an unsynchronized I/O circuit having two busses according to an example embodiment of the present invention.



FIG. 11 shows a synchronized I/O circuit having two busses according to an example embodiment of the present invention.





DETAILED DESCRIPTION

According to FIG. 1, a processor 1, which may form a unit that may be characterized as an XPP (extreme processing platform), includes two fields or clusters including: a number of arithmetic logic cells (ALU-PAE's=arithmetic logic unit processing array element); memory cells (RAM-PAE's=Random Access Memory processing array element); several illustrated as four input/output cells (I/O elements, input/output processing array element); a bus system running through each field; and a configuration manager that is assigned to the field, these elements together as a cluster forming a unit, which by itself is capable of processing data and doing so as a reconfigurable unit and a higher-order configuration manager being assigned to the two configuration managers (CM) of the cluster in order to form thereby a master cluster or the XPP. It is possible using tree-like hierarchical structures to have more than two fields of processor elements cooperate. In this manner, a higher-order configuration may be placed over more than two configuration managers (CM), which on their part are each assigned to only one individual PAE cluster and/or it may be provided that a multistage configuration manager hierarchy is built up, in which a configuration manager central level is actually assigned to first configuration managers (CM) and in turn is placed under one or more hierarchical levels.



FIG. 1 thus depicts the arrangement of the cells to each other in a two-dimensional matrix and its relative size by way of approximation insofar as the individual cells are disposed very regularly and in particular the PAE's, that is, the memory storage and arithmetic logic cells have approximately the same size, which makes it possible to carry out a page addressing in the generally rectangular and/or regular cell structure having a roughly equal linking to the bus system. The depicted addressing in this context, however, is arbitrary regarding the disposition of memories and arithmetic units in relation to each other, insofar as other dispositions, also involving the I/O cells and/or using still other elements, are possible and are adaptable to a desired special computing task without any further measures. The illustration that is shown is also exemplary in that a three-dimensional disposition of individual cells within the space is also possible, provided that the manufacturing technology of the semiconductor technology that is used permits this.


An individual PAE includes a multiplicity of inputs and outputs. The individual PAE is provided, on the one hand, with data inputs and outputs (A,B,C) and, on the other hand, with control or monitoring inputs and outputs (U,V,W). As is evident from FIG. 1, the PAE's are disposed in horizontal rows, the cells being connected among themselves via a bus system. These horizontal bus systems are connected in the center of the field to the PAE's that are situated above and below them, and to be precise with them only above and below in the depicted example. Thus, the transfer of data and status signals (i.e., control signals) upward and downward is accomplished via the PAE's and, as illustrated in FIG. 1, involves a RAM-PAE or an ALU-PAE. Consequently, all types of PAE's may be connected in the same manner to the bus system and internally wired accordingly. It is also possible to configure the I/O cells for connection to bus lines that are situated one on top of the other, unlike what is depicted).


As a result, the PAE's are used for the relaying of data, that is, for data to be processed as well as control and monitoring data in the vertical direction. The PAE's in this context are configured in such a manner that this relaying may be carried out with or without data modification.


The data modification may at first be accomplished in the actual functional unit of the PAE, e.g., if it is equipped as an arithmetic-logic unit and the data are linked in the arithmetic logic unit. In order to ensure that data may be supplied sufficiently rapidly to be linked in the cell and bring about an optimal utilization of the cell cycling, three lines A,B,C having the bit width that is able to be processed in the cell are routed to the cell as shown in FIG. 5. In this context, a particular additive input length is also possible that allows determining operations of the type (A+B)+C in a time-efficient and space-efficient manner using the cell results. If no data conversion is required, the data may be passed on to the functional unit. In this way, for example, data that are needed in a row further below are passed through into it without being subjected to a modification in the PAE. In the simultaneous routing of, for example, three data words corresponding to three inputs A, B, C, each may be relayed in different ways. Therefore, it is possible, for example, to relay only the data word to line C unconverted, while A and B are linked to each other in the ALU, for example, by A/B division. Alternatively, two data words may also be rerouted, while a data word in the ALU, for example, is linked to a constant or another value temporarily stored there. The convertibility to other data word amounts that are simultaneously routed to the PAE may also if desired be routed to the PAE as three data words; the individual word in this context has the processor-specific bit width, in the present case, for example, 32 bits.


Any inputs and/or outputs of PAE's may be configured using constants of the configuration unit (CT/CM). In this context, constants may remain unchanged during the entire operation of a configuration, or be overwritten during the operation, that is the execution of a configuration of new data of the configuration unit (CT/CM) and/or other sources, such as PAE's.


Instead of a linking of all or a part of the data as in the case involving PAE's having ALU's specifically in the RAM-PAE's, a complete or partial memorization and/or a complete or partial relaying may occur.


The relaying of the data, furthermore, may occur while bypassing the actual data conversion PAE core unit, like the ALU, in such a manner that a conversion of the data occurs before or during the relaying. This may occur by modifying the data while consulting the lookup tables and other linking units, for example, units that sort the relevant data words according to value. These units may be disposed between the bus coupling and the input into the PAE core unit and configurable in their function, whereupon whether the data are relayed unchanged or not is configurable. If they are not relayed unchanged, but rather changed, how the change occurs within the given possibilities is configured. For the status signal relaying in this context the provision of lookup tables is advantageous, because predetermined output signals may be generated with them in response to predetermined input signals without any additional measures.


Furthermore, the data relaying of unchanged data may be accomplished in a configurable manner immediately or delayed by register. The illustrated individual PAE for this purpose has a configurable, connectable forward register and a configurable, connectable reverse register for the data to be processed and a configurable, connectable forward register and a configurable, connectable reverse register for control data, that is, trigger vectors or status signal and/or control flow data. It is indicated that registers having increased (temporary memory) depth, in particular as FIFO registers, would be foreseeable, precisely in order to temporarily store data on a multi-cycle basis. Assigned to the register in question is a configurable multiplexer with which the register in question may be connected into the data path or removed from it, as desired. The multiplexers are also configurable such that results from the cell may be connected on the bus as desired and required. Therefore, for example, the top and bottom bit word that is obtained in a multiplication are output (H,L) and/or only a result data word (H) is output and a data word relayed and output on the bus, even a desired exchange (A<−>H) being configurable. Consequently, a PAE is characterized in the present processor model by a structure that has a central functionality lie an ALU, a RAM and/or, for example, also an FPGA and the additional data relaying functionality, possessing a forward and/or reverse register data relaying functionality comprised of three basic modules, such as FPGA, ALU, RAM and the two (forward/reverse) register data relaying functionality modules, the latter of these being able to implement additional functions. Central functionality in this context does not mean spatial central functionality, but rather functionality in the sense of assigning the central functionality and effect of the particular PAE. The additional functions, which are implemented via the register data relaying functionality modules, include in particular, in the forward register for the data flow, control operations like multiplexing or demultiplexing and copying and/or other manipulations of data. In the reverse register, an ALU functionality may be implemented for the data flow and/or a Boolean linking of event signals, i.e., trigger signals. Thus, the PAE is comprised of modules for the manipulation of data streams, for the operative linking and/or generation of data packets and the processing for the most part via logic linking and generation of event packets.


The input/output modules are likewise adapted in their structure in a particular way to the requirements of the data processing task. For this purpose, each of the input/output modules is provided with several channels, that are able to work independently of each other in the so-called PORT mode (FIG. 10) or in synchronization with each other in the so-called RAM mode (FIG. 11). Each I/O module may be used simultaneously by a plurality of algorithms while using a plurality of algorithms, for which sorting algorithms may also be brought in.


In other words, the input/output module (I/O interface) works in memory (RAM) mode (FIG. 11) as an interface to the external memory. In this context, writing data and address data of any channel are synchronized, that is, an external writing operation is started only if both data packets are present. In reading mode, the I/O unit sorts from externally transmitted packets back to the internal channels. The switching between reading and writing mode may occur, for example, via configuration or, for example, via signals.

Claims
  • 1. A data processor on a chip comprising: a plurality of data processing cores, each of at least some of the processing cores including: at least one arithmetic logic unit that supports at least division and multiplication of at least 32-bit wide data; andat least 3 registers for storing at least 32-bit wide data;a plurality of memory units to buffer at least 32-bit wide data;at least one interface unit for providing at least one communication channel between the data processor and external memory; anda bus system flexibly interconnecting the plurality of processing cores, the plurality of memory units, and the at least one interface;wherein: the bus system includes a first structure dedicated for data transfer in a first direction and a second structure dedicated for data transfer in a second direction; andeach of at least some of the data processing cores includes a physically dedicated connection to at least one physically assigned one of the plurality of memory units, the assigned one of the plurality of memory units being accessible by another of the data processing cores via a secondary bus path of the bus system.
  • 2. The data processor according to claim 1, wherein the at least one secondary bus path includes respective dedicated structures for each of two directions of data transfer.
  • 3. The data processor according to any one of claims 1 and 2, wherein the at least one secondary bus path comprises at least one pipeline register for transferring data.
  • 4. The data processor according to any one of claims 1 and 2, wherein the at least one secondary bus path comprises at least one first-in-first-out (FIFO) buffer for transferring data.
  • 5. The data processor according to any one of claims 1 and 2, wherein the bus system supports transmission of at least 64-bit wide data.
  • 6. The data processor according to any one of claims 1 and 2, wherein the bus system transfers data using a bus protocol.
  • 7. The data processor according to any one of claims 1 and 2, wherein the bus system uses protocol signals for controlling the data transfer.
  • 8. The data processor according to any one of claims 1 and 2, further comprising at least one additional data processing core whose internal architecture is different than each of the plurality of data processing cores.
  • 9. The data processor according to claim 8, wherein the at least one additional data processing core is connectable to at least one of the plurality of memory units only via at least one secondary bus path shared with one or more of the plurality of data processing cores.
  • 10. The data processor according to any one of claims 1 and 2, wherein the at least one interface unit includes at least two interface units, and the at least one communication channel includes a respective communication channel for each of the at least two interface units.
  • 11. The data processor according to any one of claims 1 and 2, wherein the at least one interface unit transfers data between the data processor and external memory in packets.
  • 12. The data processor according to any one of claims 1, 2 and 11, wherein the at least one interface unit supports a plurality of data processor internal data channels.
  • 13. The data processor according to claim 12, wherein the at least one interface unit sorts data received from external memory to provide them to the internal channels.
  • 14. The data processor according to any one of claims 1 and 2, wherein each of at least some of the data processing cores includes at least 8 registers for storing at least one of (a) at least 32-bit wide data and (b) at least 32-bit wide control information.
  • 15. The data processor according to any one of claims 1 and 2, wherein each secondary bus path increases a latency of the data transmission.
  • 16. A data processor on a chip comprising: a plurality of data processing cores, each of at least some of the processing cores including: at least one arithmetic logic unit that supports at least division and multiplication of at least 32-bit wide data; andat least 3 registers for storing at least 32-bit wide data;a plurality of memory units to buffer at least 32-bit wide data;at least one interface unit for providing at least one communication channel between the data processor and external memory; anda bus system flexibly interconnecting the plurality of processing cores, the plurality of memory units, and the at least one interface;wherein: the bus system includes a first structure dedicated for data transfer in a first direction and a second structure dedicated for data transfer in a second direction; andeach of at least some of the data processing cores includes a dedicated connection to at least one assigned one of the plurality of memory units each situated such that no other data processing core and no other memory unit is positioned between the respective data processing core and the respective assigned memory unit, the assigned one of the plurality of memory units being accessible by another of the data processing cores via a secondary bus path of the bus system.
  • 17. The data processor according to claim 16, wherein the at least one secondary bus path includes respective dedicated structures for each of two directions of data transfer.
  • 18. The data processor according to any one of claims 16 and 17, wherein the at least one secondary bus path comprises at least one pipeline register for transferring data.
  • 19. The data processor according to any one of claims 16 and 17, wherein the at least one secondary bus path comprises at least one first-in-first-out (FIFO) buffer for transferring data.
  • 20. The data processor according to any one of claims 16 and 17, wherein the bus system supports transmission of at least 64-bit wide data.
  • 21. The data processor according to any one of claims 16 and 17, wherein the bus system transfers data using a bus protocol.
  • 22. The data processor according to any one of claims 16 and 17, wherein the bus system uses protocol signals for controlling the data transfer.
  • 23. The data processor according to any one of claims 16 and 17, further comprising at least one additional data processing core whose internal architecture is different than each of the plurality of data processing cores.
  • 24. The data processor according to claim 23, wherein the at least one additional data processing core is connectable to at least one of the plurality of memory units only via at least one secondary bus path shared with one or more of the plurality of data processing cores.
  • 25. The data processor according to any one of claims 16 and 17, wherein the at least one interface unit includes at least two interface units, and the at least one communication channel includes a respective communication channel for each of the at least two interface units.
  • 26. The data processor according to any one of claims 16 and 17, wherein the at least one interface unit transfers data between the data processor and external memory in packets.
  • 27. The data processor according to any one of claims 16, 17, and 26, wherein the at least one interface unit supports a plurality of data processor internal data channels.
  • 28. The data processor according to claim 27, wherein the at least one interface unit sorts data received from external memory to provide them to the internal channels.
  • 29. The data processor according to any one of claims 16 and 17, wherein each of at least some of the data processing cores includes at least 8 registers for storing at least one of (a) at least 32-bit wide data and (b) at least 32-bit wide control information.
  • 30. The data processor according to any one of claims 16 and 17, wherein each secondary bus path increases a latency of the data transmission.
CROSS REFERENCE TO RELATED APPLICATIONS

This application is continuation of and claims priority to U.S. patent application Ser. No. 12/371,040, filed on Feb. 13, 2009 now U.S. Pat. No. 8,058,899, which is a continuation of and claims priority to U.S. patent application Ser. No. 10/398,546, filed Jan. 20, 2004 (now U.S. Pat. No. 7,595,659), which is the National Stage of International Patent Application Serial No. PCT/EP01/11593, filed on Oct. 8, 2001, the entire contents of each of which are expressly incorporated herein by reference.

US Referenced Citations (643)
Number Name Date Kind
3564506 Bee et al. Feb 1971 A
3681578 Stevens Aug 1972 A
3753008 Guarnaschelli Aug 1973 A
3754211 Rocher et al. Aug 1973 A
3855577 Vandierendonck Dec 1974 A
3956589 Weathers et al. May 1976 A
3970993 Finnila Jul 1976 A
4151611 Sugawara et al. Apr 1979 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
4594682 Drimak Jun 1986 A
4623997 Tulpule Nov 1986 A
4646300 Goodman et al. Feb 1987 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
4760525 Webb Jul 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 Stolfo et al. Aug 1989 A
4870302 Freeman Sep 1989 A
4873666 Lefebvre et al. Oct 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
4939641 Schwartz et al. Jul 1990 A
4959781 Rubinstein 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
5031179 Yoshida et al. Jul 1991 A
5034914 Osterlund Jul 1991 A
5036473 Butts et al. Jul 1991 A
5036493 Nielsen Jul 1991 A
5041924 Blackborow et al. Aug 1991 A
5043978 Nagler et al. Aug 1991 A
5047924 Fujioka et al. Sep 1991 A
5055997 Sluijter et al. Oct 1991 A
5065308 Evans Nov 1991 A
5072178 Matsumoto Dec 1991 A
5076482 Kozyrski et al. 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
5119290 Loo et al. Jun 1992 A
5123109 Hillis 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
5245616 Olson 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
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
5435000 Boothroyd 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
5493663 Parikh Feb 1996 A
5497498 Taylor Mar 1996 A
5502838 Kikinis 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
5568624 Sites et al. Oct 1996 A
5570040 Lytle et al. Oct 1996 A
5572710 Asano et al. Nov 1996 A
5574927 Scantlin Nov 1996 A
5574930 Halverson, Jr. et al. Nov 1996 A
5581731 King et al. Dec 1996 A
5581734 DiBrino et al. Dec 1996 A
5583450 Trimberger et al. Dec 1996 A
5584013 Cheong 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
5603005 Bauman et al. 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
5632029 Bruce et al. 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
5675757 Davidson et al. Oct 1997 A
5675777 Glickman Oct 1997 A
5677909 Heide Oct 1997 A
5680583 Kuijsten Oct 1997 A
5682491 Pechanek et al. Oct 1997 A
5682544 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
5706482 Matsushima et al. Jan 1998 A
5713037 Wilkinson et al. Jan 1998 A
5717890 Ichida et al. Feb 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
5774704 Williams Jun 1998 A
5778237 Yamamoto et al. Jul 1998 A
5778439 Timberger et al. Jul 1998 A
5781756 Hung Jul 1998 A
5784313 Trimberger et al. Jul 1998 A
5784630 Saito et al. 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 Ku.cedilla.uk.cedilla.akar 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
5832288 Wong Nov 1998 A
5838165 Chatter Nov 1998 A
5838988 Panwar et al. Nov 1998 A
5841973 Kessler 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
5867691 Shiraishi Feb 1999 A
5867723 Chin 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
5895487 Boyd et al. Apr 1999 A
5898602 Rothman et al. Apr 1999 A
5901279 Davis, III May 1999 A
5913925 Kahle et al. Jun 1999 A
5915099 Takata et al. Jun 1999 A
5915123 Mirsky et al. Jun 1999 A
5924119 Sindhu et al. Jul 1999 A
5926638 Inoue 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
5996048 Cherabuddi 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
6045585 Blainey Apr 2000 A
6047115 Mohan et al. Apr 2000 A
6049222 Lawman Apr 2000 A
6049866 Earl Apr 2000 A
6052524 Pauna Apr 2000 A
6052773 DeHon et al. Apr 2000 A
6054873 Laramie Apr 2000 A
6055619 North et al. Apr 2000 A
6058266 Megiddo et al. May 2000 A
6058469 Baxter May 2000 A
6064819 Franssen et al. May 2000 A
6072348 New et al. Jun 2000 A
6075935 Ussery et al. Jun 2000 A
6076157 Borkenhagen et al. Jun 2000 A
6077315 Greenbaum et al. Jun 2000 A
6078736 Guccione 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
RE36839 Simmons et al. Aug 2000 E
6096091 Hartmann Aug 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
6125072 Wu 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
6154826 Wulf et al. Nov 2000 A
6157214 Marshall Dec 2000 A
6170051 Dowling Jan 2001 B1
6172520 Lawman et al. Jan 2001 B1
6173419 Barnett 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
6191614 Schultz et al. Feb 2001 B1
6198304 Sasaki Mar 2001 B1
6201406 Iwanczuk et al. Mar 2001 B1
6202163 Gabzdyl 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
6212544 Borkenhagen 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
6249756 Bunton et al. Jun 2001 B1
6252792 Marshall et al. Jun 2001 B1
6256724 Hocevar et al. Jul 2001 B1
6260114 Schug 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
6289369 Sundaresan Sep 2001 B1
6289440 Casselman Sep 2001 B1
6298043 Mauger et al. Oct 2001 B1
6298396 Loyer et al. Oct 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
6317819 Morton Nov 2001 B1
6321298 Hubis Nov 2001 B1
6321366 Tseng et al. Nov 2001 B1
6321373 Ekanadham et al. Nov 2001 B1
6338106 Vorbach et al. Jan 2002 B1
6339424 Ishikawa et al. Jan 2002 B1
6339840 Kothari 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
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
6434672 Gaither 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
6449283 Chao et al. Sep 2002 B1
6456628 Greim et al. Sep 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
6496740 Robertson et al. Dec 2002 B1
6496902 Faanes 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
6512804 Johnson 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
6606704 Adiletta et al. Aug 2003 B1
6624819 Lewis Sep 2003 B1
6625631 Ruehle Sep 2003 B2
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
6668237 Guccione et al. Dec 2003 B1
6681388 Sato et al. Jan 2004 B1
6687788 Vorbach et al. Feb 2004 B2
6694434 McGee et al. Feb 2004 B1
6697979 Vorbach et al. Feb 2004 B1
6704816 Burke Mar 2004 B1
6708223 Wang et al. Mar 2004 B1
6708325 Cooke et al. Mar 2004 B2
6717436 Kress et al. Apr 2004 B2
6721830 Vorbach et al. Apr 2004 B2
6721884 De Oliveira Kastrup Pereira et al. Apr 2004 B1
6725334 Barroso 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
6802026 Patterson et al. Oct 2004 B1
6803787 Wicker, Jr. Oct 2004 B1
6820188 Stansfield et al. Nov 2004 B2
6829697 Davis et al. Dec 2004 B1
6836842 Guccione et al. Dec 2004 B1
6847370 Baldwin et al. Jan 2005 B2
6859869 Vorbach Feb 2005 B1
6868476 Rosenbluth 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
6957306 So et al. Oct 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
7010667 Vorbach Mar 2006 B2
7010687 Ichimura Mar 2006 B2
7028107 Vorbach et al. Apr 2006 B2
7036114 McWilliams et al. Apr 2006 B2
7038952 Zack et al. May 2006 B1
7043416 Lin May 2006 B1
7144152 Rusu et al. Dec 2006 B2
7155708 Hammes et al. Dec 2006 B2
7164422 Wholey et al. Jan 2007 B1
7188819 Thurmann et al. Mar 2007 B2
7210129 May et al. Apr 2007 B2
7216204 Rosenbluth May 2007 B2
7237087 Vorbach et al. Jun 2007 B2
7249351 Songer et al. Jul 2007 B1
7254649 Subramanian et al. Aug 2007 B2
7266725 Vorbach et al. Sep 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
7455450 Liu et al. Nov 2008 B2
7500043 Wood Mar 2009 B2
7595659 Vorbach et al. Sep 2009 B2
7650448 Vorbach et al. Jan 2010 B2
7657877 Vorbach et al. Feb 2010 B2
7759968 Hussein et al. Jul 2010 B1
7873811 Wolinski et al. Jan 2011 B1
8305835 Schreiber et al. Nov 2012 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
20020004916 Marchand et al. Jan 2002 A1
20020010853 Trimberger et al. Jan 2002 A1
20020013861 Adiletta et al. Jan 2002 A1
20020038414 Taylor Mar 2002 A1
20020045952 Blemel Apr 2002 A1
20020051482 Lomp May 2002 A1
20020073282 Chauvel et al. Jun 2002 A1
20020083308 De Oliveira Kastrup Pereira et al. Jun 2002 A1
20020099759 Gootherts Jul 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
20020147932 Brock et al. Oct 2002 A1
20020152060 Tseng Oct 2002 A1
20020156962 Chopra et al. Oct 2002 A1
20020162097 Meribout 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
20030056062 Prabhu 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
20030070059 Dally 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
20030154349 Berg et al. Aug 2003 A1
20030192032 Andrade et al. Oct 2003 A1
20030226056 Yip et al. Dec 2003 A1
20040015899 May et al. Jan 2004 A1
20040025005 Vorbach et al. Feb 2004 A1
20040039880 Pentkovski et al. Feb 2004 A1
20040078548 Claydon et al. Apr 2004 A1
20040088689 Hammes May 2004 A1
20040088691 Hammes et al. May 2004 A1
20040168099 Vorbach et al. Aug 2004 A1
20040199688 Vorbach et al. Oct 2004 A1
20050066213 Vorbach et al. Mar 2005 A1
20050091468 Morita et al. Apr 2005 A1
20050144210 Simkins et al. Jun 2005 A1
20050144212 Simkins et al. Jun 2005 A1
20050144215 Simkins et al. Jun 2005 A1
20060036988 Allen et al. Feb 2006 A1
20060230094 Simkins et al. Oct 2006 A1
20060230096 Thendean et al. Oct 2006 A1
20070050603 Vorbach et al. Mar 2007 A1
20070083730 Vorbach et al. Apr 2007 A1
20080034184 Norman Feb 2008 A1
20080313383 Morita et al. Dec 2008 A1
20090085603 Paul et al. Apr 2009 A1
20090193384 Sima et al. Jul 2009 A1
20100306602 Kamiya et al. Dec 2010 A1
Foreign Referenced Citations (125)
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 696 001 Feb 1996 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 115 204 Jul 2001 EP
1 146 432 Oct 2001 EP
1 669 885 Jun 2006 EP
2 752 466 Feb 1998 FR
2 304 438 Mar 1997 GB
58-058672 Apr 1983 JP
1044571 Feb 1989 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
7-182160 Jul 1995 JP
7-182167 Jul 1995 JP
8-044581 Feb 1996 JP
8-069447 Mar 1996 JP
8-101761 Apr 1996 JP
8-102492 Apr 1996 JP
8-106443 Apr 1996 JP
8-221164 Aug 1996 JP
8-250685 Sep 1996 JP
9-027745 Jan 1997 JP
9-237284 Sep 1997 JP
9-294069 Nov 1997 JP
11-046187 Feb 1999 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
2001-236221 Aug 2001 JP
2002-0033457 Jan 2002 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
9525306 Sep 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
WO0045282 Aug 2000 WO
WO0049496 Aug 2000 WO
WO0077652 Dec 2000 WO
WO0155917 Aug 2001 WO
WO0213000 Feb 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
WO03036507 May 2003 WO
WO 03091875 Nov 2003 WO
WO2004053718 Jun 2004 WO
WO2004114128 Dec 2004 WO
WO2005045692 May 2005 WO
WO 2007030395 Mar 2007 WO
Non-Patent Literature Citations (402)
Entry
U.S. Reexamination Application Control No. 90/010,979, Vorbach et al., filed May 4, 2010.
U.S. Reexamination Application Control No. 90/011,087, Vorbach et al., filed Jul. 8, 2010.
U.S. Reexamination Application Control No. 90/010,450, Vorbach et al., filed Mar. 27, 2009.
U.S. Appl. No. 60/109,417, Jefferson et al., filed Nov. 18, 1998.
Abnous et al., “Ultra-Low-Power Domain-Specific Multimedia Processors,” U.C. Berkeley, 1996 IEEE, pp. 461-470.
Abnous, A., et al., “The Pleiades Architecture,” Chapter I of The Application of Programmable DSPs in Mobile Communications, A. Gatherer and A. Auslander, Ed., Wiley, 2002, pp. 1-33.
Ade, et al., “Minimum Memory Buffers in DSP Applications,” Electronics Letters, vol. 30, No. 6, Mar. 17, 1994, pp. 469-471.
Advanced RISC Machines, “Introduction to AMBA,” Oct. 1996, Section 1, pp. 1-7.
ARM, “The Architecture for the Digital World,” http://www.arm.com/products/ Mar. 18, 2009, 3 pages.
ARM, “The Architecture for the Digital World; Milestones,” http://www.arm.com/aboutarm/milestones.html Mar. 18, 2009, 5 pages.
ARM Limited, “ARM Architecture Reference Manual,” Dec. 6, 2000, pp. A10-6-A10-7.
Albaharna, O.T. et al., “On the Viability of FPGA-Based Integrated Coprocessors,” Dept. of Electrical and Electronic Engineering, Imperial College of Science, London, 1999 IEEE, pp. 206-215.
Alippi, et al., “Determining the Optimum Extended Instruction Set Architecture for Application Specific Reconfigurable VLIW CPUs,” IEEE, 2001, pp. 50-56.
Altera, “Implementing High-Speed Search Applications with Altera CAM,” Jul. 2001, Ver. 2.1, Application Note 119, 50 pages.
Altera, “Flex 8000 Programmable Logic Device Family,” Altera Corporation Data Sheet, Jan. 2003, pp. 1-62.
Altera, “Flex 10K Embedded Programmable Logic Device Family,” Altera Corporation Data Sheet, Jan. 2003, pp. 1-128.
Altera, “APEX 20K Programmable Logic Device Family,” Altera Corporation Data Sheet, Mar. 2004, ver. 5.1, pp. 1-117.
Altera, “2. TriMatrix Embedded Memory Blocks in Stratix & Stratix GX Devices,” Altera Corporation, Jul. 2005, 28 pages.
Altera, “APEX II Programmable Logic Device Family,” Altera Corporation Data Sheet, Aug. 2002, Ver. 3.0, 99 pages.
Arabi, et al., “PLD Integrates Dedicated High-speed Data Buffering, Complex State machine, and Fast Decode Array,” conference record on WESCON '93, Sep. 28, 1993, pp. 432-436.
Asari, K. et al., “FeRAM circuit technology for system on a chip,” Proceedings First NASA/DoD Workshop on Evolvable Hardware (1999), pp. 193-197.
Athanas, “A Functional Reconfigurable Architecture and Compiler for Adoptive Computing,” IEEE 1993, pp. 49-55.
Athanas, et al., “An Adaptive Hardware Machine Architecture and Compiler for Dynamic Processor Recongifugation,” IEEE, Laboratory for Engineering man/Machine Systems Division of Engineering, Box D, Brown University, Providence, Rhode Island, 1991, pp. 397-400.
Athanas et al., “Processor Reconfiguration Through Instruction-Set Metamorphosis,” 1993, IEEE Computers, pp. 11-18.
Atmel, 5-K-50K Gates Coprocessor FPGA with Free Ram, Data Sheet, Jul. 2006, 55 pages.
Atmel, FPGA-based FIR Filter Application Note, Sep. 1999, 10 pages.
Atmel, “An Introduction to DSP Applications using the AT40K FPGA,” FPGA Application Engineering, San Jose, CA, Apr. 2004, 15 pages.
Atmel, Configurable Logic Design & Application Book, Atmel Corporation, 1995, pp. 2-19 through 2-25.
Atmel, Field Programmable Gate Array Configuration Guide, AT6000 Series Configuration Data Sheet, Sep. 1999, pp. 1-20.
Bacon, D. et al., “Compiler Transformations for High-Performance Computing,” ACM Computing Surveys, 26(4):325-420 (1994).
Bakkes, P.J., et al., “Mixing Fixed and Reconfigurable Logic for Array Processing,” Dept. of Electrical and Electronic Engineering, University of Stellenbosch, South Africa, 1996 IEEE, pp. 118-125.
Ballagh et al., “Java Debug Hardware Models Using JBits,” 8th Reconfigurable Architectures Workshop, 2001, 8 pages.
Baumgarte, V. et al., “PACT XPP—A Self-reconfigurable Data Processing Architecture,” PACT Info. GMBH, Munchen Germany, 2001, 7 pages.
Beck et al., “From control flow to data flow,” TR 89/1050, Oct. 1989, Dept. of Computer Science, Cornell University, Ithaca, NY, pp. 1-25.
Becker, J., “A Partitioning Compiler for Computers with Xputer-based Accelerators,” 1997, Kaiserslautern University, 326 pp.
Becker, J. et al., “Architecture, Memory and Interface Technology Integration of an Industrial/Academic Configurable System-on-Chip (CSoC),” IEEE Computer Society Annual Workshop on VLSI (WVLSI 2003), (Feb. 2003), 6 pages.
Becker, J., “Configurable Systems-on-Chip (CSoC),” (Invited Tutorial), Proc. of 9th Proc. of XV Brazilian Symposium on Integrated Circuit, Design (SBCCI 2002), (Sep. 2002), 6 pages.
Becker et al., “Automatic Parallelism Exploitation for FPL-Based Accelerators,” 1998, Proc. 31st Annual Hawaii International Conference on System Sciences, pp. 169-178.
Becker, J. et al., “Parallelization in Co-compilation for Configurable Accelerators—a Host/accelerator Partitioning Compilation Method,” Proceedings of Asia and South Pacific Design Automation Conference, Yokohama, Japan, Feb. 10-13, 1998, 11 pages.
Bellows et al., “Designing Run-Time Reconfigurable Systems with JHDL,” Journal of VLSI Signal Processing 28, Kluwer Academic Publishers, The Netherlands, 2001, pp. 29-45.
Bittner, “Wormhole Run-time Reconfiguration: Conceptualization and VLSI Design of a High Performance Computing System,” Dissertation, Jan. 23, 1997, pp. I-XX, 1-415.
“BlueGene/L—Hardware Architecture Overview,” BlueGene/L design team, IBM Research, Oct. 17, 2003 slide presentation, pp. 1-23.
“BlueGene/L: the next generation of scalable supercomputer,” Kissel et al., Lawrence Livermore National Laboratory, Livermore, California, Nov. 18, 2002, 29 pages.
BlueGene Project Update, Jan. 2002, IBM slide presentation, 20 pages.
BlueGene/L, “An Overview of the BlueGene/L Supercomputer,” The BlueGene/L Team, IBM and Lawrence Livermore National Laboratory, 2002 IEEE. pp. 1-22.
Bolsens, Ivo (CTO Xilinx), “FPGA, a history of interconnect,” Xilinx slide presentation, posted on the internet Oct. 30, 2008 at http://www.docstoc.com/docs/2198008/FPGA-a-history-of-interconnect, 32 pages.
Bondalapati et al., “Reconfigurable Meshes: Theory and Practice,” Dept. of Electrical Engineering-Systems, Univ. of Southern California, Apr. 1997, Reconfigurable Architectures Workshop, International Parallel Processing Symposium, 15 pages.
Bratt, A, “Motorola field programmable analogue arrays, present hardware and future trends,” Motorola Programmable Technology Centre, Gadbrook Business Centre, Northwich, Cheshire, 1998, The Institute of Electrical Engineers, IEE. Savoy Place, London, pp. 1-5.
Cadambi, et al., “Managing Pipeline-reconfigurable FPGAs,” ACM, 1998, pp. 55-64.
Callahan, et al., “The Garp Architecture and C Compiler,” Computer, Apr. 2000, pp. 62-69.
Cardoso, J.M.P., et al., “A novel algorithm combining temporal partitioning and sharing of functional units,” University of Algarve, Faro, Portugal, 2001 IEEE, pp. 1-10.
Cardoso, Joao M.P., and Markus Weinhardt, “XPP-VC: A C Compiler with Temporal Partitioning for the PACT-XPP Architecture,” Field-Programmable Logic and Applications. Reconfigurable Computing is Going Mainstream, 12th International Conference FPL 2002, Proceedings (Lecture Notes in Computer Science, vol. 2438) Springer-Verlag Berlin, Germany, 2002, pp. 864-874.
Cardoso, J.M.P., “Compilation of Java™ Algorithms onto Reconfigurable Computing Systems with Exploitation of Operation-Level Parallelism,” Ph.D. Thesis, Universidade Tecnica de Lisboa (UTL), Lisbon, Portugal Oct. 2000 (Table of Contents and English Abstract only).
Cardoso, J.M.P., et al., “Compilation and Temporal Partitioning for a Coarse-Grain Reconfigurable Architecture,” New Algorithms, Architectures and Applications for Reconfigurable Computing, Lysacht, P. & Rosentiel, W. eds., (2005) pp. 105-115.
Cardoso, J.M.P., et al., “Macro-Based Hardware Compilation of Java™ Bytecodes into a Dynamic Reconfigurable Computing System,” IEEE, Apr. 21, 1999, pp. 2-11.
Chaudhry, G.M. et al., “Separated caches and buses for multiprocessor system,” Circuits and Systems, 1993; Proceedings of the 36th Midwest Symposium on Detroit, MI, USA, Aug. 16-18, 1993, New York, NY IEEE, Aug. 16, 1993, pp. 1113-1116, XP010119918 ISBN: 0-7803-1760-2.
Chen et al., “A reconfigurable multiprocessor IC for rapid prototyping of algorithmic-specific high-speed DSP data paths,” IEEE Journal of Solid-State Circuits, vol. 27, No. 12, Dec. 1992, pp. 1895-1904.
Cherbaka, Mark F., “Verification and Configuration of a Run-time Reconfigurable Custom Computing Integrated Circuit for DSP Applications,” Thesis: Virginia Polytechnic Institute and State University, Jul. 8, 1996, 106 pages.
Clearspeed, CSX Processor Architecture, Whitepaper, PN-1110-0702, 2007, pp. 1-15, www.clearspeed.com.
Clearspeed, CSX Processor Architecture, Whitepaper, PN-1110-0306, 2006, pp. 1-14, www.clearspeed.com.
Compton, K., et al., “Configurable Computing: A Survey of Systems and Software,” Northwestern University, Dept. of ECE, Technical Report, 1999, (XP-002315148), 39 pages.
Cong et al., “Structural Gate Decomposition for Depth-Optimal Technology Mapping in LUT-Based FPGA Designs,” Univ. of California, ACM Transactions on Design Automation of Electronics Systems, vol. 5, No. 2, Apr. 2000, pp. 193-225.
Cook, Jeffrey J., “The Amalgam Compiler Infrastructure,” Thesis at the University of Illinois at Urbana-Champaign (2004) Chapter 7 & Appendix G.
Cronquist, D., et al., “Architecture Design of Reconfigurable Pipelined Datapaths,” Department of Computer Science and Engineering, University of Washington, Seattle, WA, Proceedings of the 20th Anniversary Conference on Advanced Research in VSLI, 1999, pp. 1-15.
Culler, D.E; Singh, J.P., “Parallel Computer Architecture,” pp. 434-437, 1999, Morgan Kaufmann, San Francisco, CA USA, XP002477559.
Culler, D.E; Singh, J.P., “Parallel Computer Architecture,” p. 17, 1999, Morgan Kaufmann, San Francisco, CA USA, XP002477559.
DeHon, A., “DPGA Utilization and Application,” MIT Artificial Intelligence Laboratory, Proceedings of the Fourth International ACM Symposium on Field-Programmable Gate Arrays (FPGA 1996), IEEE Computer Society, pp. 1-7.
DeHon, Andre, “Reconfigurable Architectures for General-Purpose Computing,” Massachusetts Institute of Technology, Technical Report AITR-1586, Oct. 1996, XP002445054, Cambridge, MA, pp. 1-353.
Del Corso et al., “Microcomputer Buses and Links,” Academic Press Inc. Ltd., 1986, pp. 138-143, 277-285.
Diniz, P., et al., “Automatic Synthesis of Data Storage and Control Structures for FPGA-based Computing Engines,” 2000, IEEE, pp. 91-100.
Diniz, P., et al., “A behavioral synthesis estimation interface for configurable computing,” University of Southern California, Marina Del Rey, CA, 2001 IEEE, pp. 1-2.
Donandt, “Improving Response Time of Programmable Logic Controllers by use of a Boolean Coprocessor,” AEG Research Institute Berlin, IEEE, 1989, pp. 4-167-4-169.
Dutt, et al., “If Software is King for Systems-in-Silicon, What's New in Compilers?” IEEE, 1997, pp. 322-325.
Ebeling, C., et al., “Mapping Applications to the RaPiD Configurable Architecture,” Department of Computer Science and Engineering, University of Washington, Seattle, WA, FPGAs for Custom Computing Machines, 1997. Proceedings., The 5th Annual IEEE Symposium, Publication Date: Apr. 16-18, 1997, 10 pages.
Equator, Pixels to Packets, Enabling Multi-Format High Definition Video, Equator Technologies BSP-15 Product Brief, www.equator.com, 2001, 4 pages.
Fawcett, B.K., “Map, Place and Route: The Key to High-Density PLD Implementation,” Wescon Conference, IEEE Center (Nov. 7, 1995) pp. 292-297.
Ferrante, J., et al., “The Program Dependence Graph and its Use in Optimization ACM Transactions on Programming Languages and Systems,” Jul. 1987, USA, [online] Bd. 9, Nr., 3, pp. 319-349, XP002156651 ISSN: 0164-0935 ACM Digital Library.
Fineberg, S, et al., “Experimental Analysis of a Mixed-Mode Parallel Architecture Using Bitonic Sequence Sorting,” Journal of Parallel and Distributed Computing, vol. 11, No. 3, Mar. 1991, pp. 239-251.
FOLDOC, The Free On-Line Dictionary of Computing, “handshaking,” online Jan. 13, 1995, retrieved from Internet Jan. 23, 2011 at http://foldoc.org/handshake.
Fornaciari, et al., System-level power evaluation metrics, 1997 Proceedings of the 2nd Annual IEEE International Conference on Innovative Systems in Silicon, New York, NY, Oct. 1997, pp. 323-330.
Forstner, “Wer Zuerst Kommt, Mahlt Zuerst!: Teil 3: Einsatzgebiete und Anwendungbeispiele von FIFO-Speichern,” Elektronik, Aug. 2000, pp. 104-109.
Franklin, Manoj, et al., “A Fill-Unit Approach to Multiple Instruction Issue,” Proceedings of the Annual International Symposium on Microarchitecture, Nov. 1994, pp. 162-171.
Freescale Slide Presentation, An Introduction to Motorola's RCF (Reconfigurable Compute Fabric) Technology, Presented by Frank David, Launched by Freescale Semiconductor, Inc., 2004, 39 pages.
Galanis, M.D. et al., “Accelerating Applications by Mapping Critical Kernels on Coarse-Grain Reconfigurable Hardware in Hybrid Systems,” Proceedings of the 13Annual IEEE Symposium on Field-Programmable Custom Computing Machines, 2005, 2 pages.
Genius, D., et al., “A Case for Array Merging in Memory Hierarchies,” Proceedings of the 9th International Workshop on Compilers for Parallel Computers, CPC'01 (Jun. 2001), 10 pages.
Gokhale, M.B., et al., “Automatic Allocation of Arrays to Memories in FPGA processors with Multiple Memory Banks,” Field-Programmable Custom Computing Machines, 1999, IEEE, pp. 63-69.
Guceione et al., “JBits: Java based interface for reconfigurable computing,” Xilinx, Inc., San Jose, CA, 1999, 9 pages.
Guo, Z. et al., “A Compiler Intermediate Representation for Reconfigurable Fabrics,” University of California, Riverside, Dept. of Electrical Engineering, IEEE 2006, 4 pages.
Gwennap, Linley, “P6 Underscores Intel's Lead,” Microprocessor Report, vol. 9., No. 2, Feb. 16, 1995 (MicroDesign Resources), p. 1 and pp. 6-15.
Gwennap, Linley, “Intel's P6 Bus Designed for Multiprocessing,” Microprocessor Report, vol. 9, No. 7 (MicroDesign Resources), May 30, 1995, p. 1 and pp. 6-10.
Hammes, Jeff, et al., “Cameron: High Level Language Compilation for Reconfigurable Systems,” Department of Computer Science, Colorado State University, Conference on Parallel Architectures and Compilation Techniques, Oct. 12-16, 1999, 9 pages.
Hartenstein, R. et al., “A new FPGA architecture for word-oriented datapaths,” Proc. FPL'94, Springer LNCS, Sep. 1994, pp. 144-155.
Hartenstein, R., “Coarse grain reconfigurable architectures,” Design Automation Conference, 2001, Proceedings of the ASP-DAC 2001 Asia and South Pacific, Jan. 30-Feb. 2, 2001, IEEE Jan. 30, 2001, pp. 564-569.
Hartenstein et al., “Parallelizing Compilation for a Novel Data-Parallel Architecture,” 1995, PCAT-94, Parallel Computing: Technology and Practice, 13 pp.
Hartenstein et al., “A Two-Level Co-Design Framework for Xputer-based Data-driven Reconfigurable Accelerators,” 1997, Proceedings of the Thirtieth Annual Hawaii International Conference on System Sciences, 10 pp.
Hastie et al., “The implementation of hardware subroutines on field programmable gate arrays,” Custom Integrated Circuits Conference, 1990, Proceedings of the IEEE 1990, May 16, 1990, pp. 31.3.1-31.4.3 (3 pages).
Hauck, “The Roles of FPGAs in Reprogrammable Systems,” IEEE, Apr. 1998, pp. 615-638.
Hauser, J.R., et al., “Garp: A MIPS Processor with a Reconfigurable Coprocessor,” University of California, Berkeley, IEEE, Apr. 1997, pp. 12-23.
Hauser, John Reid, (Dissertation) “Augmenting a Microprocessor with Reconfigurable Hardware,” University of California, Berkeley, Fall 2000, 255 pages. (submitted in 3 PDFs, Parts 1-3).
Hauser, John R., “The Garp Architecture,” University of California at Berkeley, Computer Science Division, Oct. 1997, pp. 1-55.
Hedge, S.J., “3D WASP Devices for On-line Signal and Data Processing,” 1994, International Conference on Wafer Scale Integration, pp. 11-21.
Hendrich, N., et al., “Silicon Compilation and Rapid Prototyping of Microprogrammed VLSI-Circuits with MIMOLA and SOLO 1400,” Microprocessing & Microprogramming (Sep. 1992) vol. 35(1-5), pp. 287-294.
Huang, Libo et al., “A New Architecture for Multiple-Precision Floating-Point Multiply-Add Fused Unit Design,” School of Computer National University of Defense Technology, China, IEEE 2007, 8 pages.
Hwang, K., “Advanced Computer Architecture—Parallelism, Scalability, Programmability,” 1993, McGraw-Hill, Inc., pp. 348-355.
Hwang, K., “Computer Architecture and Parallel Processing,” Data Flow Computers and VLSI Computations, XP-002418655, 1985 McGraw-Hill, Chapter 10, pp. 732-807.
Hwang, L., et al., “Min-cut Replication in Partitioned Networks,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, [online] Bd. 14, Nr. 1, Jan. 1995, pp. 96-106, XP00053228 USA ISSN: 0278-0070 IEEE Xplore.
IBM Technical Disclosure Bulletin, IBM Corp., New York, XP000424878, Bd. 36, Nr. 11, Nov. 1, 1993, pp. 335-336.
“IEEE Standard Test Access Port and Boundary-Scan Architecture,” IEEE Std. 1149.1-1990, 1993, pp. 1-127.
IMEC, “ADRES multimedia processor & 3MF multimedia platform,” Transferable IP, IMEC Technology Description, (Applicants believe the date to be Oct. 2005), 3 pages.
Intel, “Pentium Pro Family Developer's Manual, vol. 3: Operating System Writer's Guide,” Intel Corporation, Dec. 1995, [submitted in 4 PDF files: Part I, Part II, Part III and Part IV], 458 pages.
Intel, Intel MXP5800/MXP5400 Digital Media Processors, Architecture Overview, Jun. 2004, Revision 2.4, pp. 1-24.
Inside DSP, “Ambric Discloses Massively Parallel Architecture,” Aug. 23, 2006, http://www.insidedsp.com/Articles/tabid/64/articleType/ArticleView/articleId/155/Default.aspx, 2 pages.
Iseli, C., et al. “A C++ Compiler for FPGA Custom Execution Units Synthesis,” IEEE, 1995, pp. 173-179.
Isshiki, Tsuyoshi, et al., “Bit-Serial Pipeline Synthesis for Multi-FPGA Systems with C++Design Capture,” 1996 IEEE, pp. 38-47.
Jacob, J., et al., “Memory Interfacing and Instruction Specification for Reconfigurable Processors,” ACM Feb. 1999, pp. 145-154.
Jantsch, Axel et al., “A Case Study on Hardware/Software Partitioning,” Royal Institute of Technology, Kista, Sweden, Apr. 10, 1994, IEEE, pp. 111-118.
Jantsch, Axel et al., “Hardware/Software Partitioning and Minimizing Memory Interface Traffic,” Electronic System Design Laboratory, Royal Institute of Technology, ESDLab, Electrum 229, S-16440 Kista, Sweden (Apr. 1994), pp. 226-231.
Jo, Manhwee et al., “Implementation of Floating-Point Operations for 3D Graphics on a Coarse-Grained Reconfigurable Architecture,” Design Automation Laboratory, School of EE/CS, Seoul National University, Korea, IEEE 2007, pp. 127-130.
John, L., et al., “A Dynamically Reconfigurable Interconnect for Array Processors,” vol. 6, No. 1, Mar. 1998, IEEE, pp. 150-157.
Kanter, David, “NVIDIA's GT200: Inside a Parallel Processor,” http://wwwrealworldtech.com/page.cfm?ArticleID=RWT090989195242&p=1, Sep. 8, 2008, 27 pages.
Kastrup, B., “Automatic Hardware Synthesis for a Hybrid Reconfigurable CPU Featuring Philips CPLDs,” Proceedings of the PACT Workshop on Reconfigurable Computing, 1998, pp. 5-10.
Kaul, M., et al., “An automated temporal partitioning and loop fission approach of FPGA based reconfigurable synthesis of DSP applications,” University of Cincinnati, Cincinnati, OH, ACM 1999, pp. 616-622.
Kean, T.A., “Configurable Logic: A Dynamically Programmable Cellular Architecture and its VLSI Implementation,” University of Edinburgh (Dissertation) 1988, pp. 1-286. [in two PDFs, Pt.1 and Pt.2.].
Kean, T., et al., “A Fast Constant Coefficient Multiplier for the XC6200,” Xilinx, Inc., Lecture Notes in Computer Science, vol. 1142, Proceedings of the 6th International Workshop of Field-Programmable Logic, 1996, 7 pages.
Kim et al., “A Reconfigurable Multifunction Computing Cache Architecture,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems vol. 9, Issue 4, Aug. 2001 pp. 509-523.
Knittel, Gunter, “A PCI-compatible FPGA-Coprocessor for 2D/3D Image Processing,” University of Turgingen, Germany, 1996 IEEE, pp. 136-145.
Koch, A., et al., “Practical Experiences with the SPARXIL Co-Processor,” 1998, IEEE, pp. 394-398.
Koch, Andreas et al., “High-Level-Language Compilation for Reconfigurable Computers,” Proceedings of European Workshop on Reconfigurable Communication-Centric SOCS (Jun. 2005) 8 pages.
Koren et al., “A data-driven VLSI array for arbitrary algorithms,” IEEE Computer Society, Long Beach, CA vol. 21, No. 10, Oct. 1, 1988, pp. 30-34.
Kung, “Deadlock Avoidance for Systolic Communication,” 1988 Conference Proceedings of the 15th Annual International Symposium on Computer Architecture, May 30, 1998, pp. 252-260.
Lange, H. et al., “Memory access schemes for configurable processors,” Field-Programmable Logic and Applications, International Workshop, FPL, Aug. 27, 2000, pp. 615-625, XP02283963.
Larsen, S., et al., “Increasing and Detecting Memory Address Congruence,” Proceedings of the 2002 IEEE International Conference on Parallel Architectures and Compilation Techniques (PACT'02), pp. 1-12 (Sep. 2002).
Lee et al., “A new distribution network based on controlled switching elements and its applications,” IEEE/ACT Trans. of Networking, vol. 3, No. 1, pp. 70-81, Feb. 1995.
Lee, Jong-eun, et al., “Reconfigurable ALU Array Architecture with Conditional Execution,” International Soc. Design Conference (ISOOC) [online] Oct. 25, 2004, Seoul, Korea, 5 pages.
Lee, R. B., et al., “Multimedia extensions for general-purpose processors,” IEEE Workshop on Signal Processing Systems, SIPS 97—Design and Implementation (1997), pp. 9-23.
Lee, Ming-Hau et al., “Design and Implementation of the MorphoSys Reconfigurable Computing Processors,” The Journal of VLSI Signal Processing, Kluwer Academic Publishers, BO, vol. 24, No. 2-3, Mar. 2, 2000, pp. 1-29.
Li et al., “Hardware-Software Co-Design of Embedded Reconfigurable Architectures,” Los Angeles, CA, 2000 ACM, pp. 507-512.
Li, Zhiyuan, et al., “Configuration prefetching techniques for partial reconfigurable coprocessor with relocation and defragmentation,” International Symposium on Field Programmable Gate Arrays, Feb. 1, 2002, pp. 187-195.
Ling, X., “WASMII: An MPLD with Data-Driven Control on a Virtual Hardware,” Journal of Supercomputing, Kluwer Acdemic Publishers, Dordrecht, Netherlands, 1995, pp. 253-276.
Ling et al., “WASMII: A Multifunction Programmable Logic Device (MPLD) with Data Driven Control,” The Transactions of the Institute of Electronics, Information and Communication Engineers, Apr. 25, 1994, vol. J77-D-1, Nr. 4, pp. 309-317.
Mano, M.M., “Digital Design,” by Prentice Hall, Inc., Englewood Cliffs, New Jersey 07632, 1984, pp. 119-125, 154-161.
Margolus, N., “An FPGA architecture for DRAM-based systolic computations,” Boston University Center for Computational Science and MIT Artificial Intelligence Laboratory, IEEE 1997, pp. 2-11.
Marshall et al., “A Reconfigurable Arithmetic Array for Multimedia Applications,” FPGA '99 Proceedings of the 1999 ACM/SIGDA Seventh International Symposium on Field Programmable Gate Arrays, 10 pages.
Maxfield,C., “Logic that Mutates While-U-Wait,” EDN (Bur. Ed) (USA), EDN (European Edition), Nov. 7, 1996, Cahners Publishing, USA, pp. 137-140, 142.
Mei, Bingfeng, “A Coarse-Grained Reconfigurable Architecture Template and Its Compilation Techniques,” Katholeike Universiteit Leuven, PhD Thesis, Jan. 2005, IMEC vzw, Universitair Micro-Electronica Centrum, Belgium, pp. 1-195 (and Table of Contents).
Mei, Bingfeng et al., “Design and Optimization of Dynamically Reconfigurable Embedded Systems,” IMEC vzw, 2003, Belgium, 7 pages, http://www.imec.be/reconfigurable/pdf/ICERSA—01—design.pdf.
Mei, Bingfeng et al., “Adres: An Architecture with Tightly Coupled VLIW Processor and Coarse-Grained Reconfigurable Matrix,” Proc. Field-Programmable Logic and Applications (FPL 03), Springer, 2003, pp. 61-70.
Melvin, Stephen et al., “Hardware Support for Large Atomic Units in Dynamically Scheduled Machines,” Computer Science Division, University of California, Berkeley, IEEE (1988), pp. 60-63.
Miller, M.J., et al., “High-Speed FIFOs Contend with Widely Differing Data Rates: Dual-port RAM Buffer and Dual-pointer System Provide Rapid, High-density Data Storage and Reduce Overhead,” Computer Design, Sep. 1, 1985, pp. 83-86.
Mirsky, E. DeHon, “Matrix: A Reconfigurable Computing Architecture with Configurable Instruction Distribution and Deployable Resources,” Proceedings of the IEEE Symposium on FPGAs for Custom Computing Machines, 1996, pp. 157-166.
Miyamori, T., et al., “REMARC: Reconfigurable Multimedia Array Coprocessor,” Computer Systems Laboratory, Stanford University, IEICE Transactions on Information and Systems E Series D, 1999; (abstract): Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays, p. 261, Feb. 22-25, 1998, Monterey, California, United States, pp. 1-12.
Moraes, F., et al., “A Physical Synthesis Design Flow Based on Virtual Components,” XV Conference on Design of Circuits and Integrated Systems (Nov. 2000) 6 pages.
Muchnick, S., “Advanced Compiler Design and Implementation,” (Morgan Kaufmann 1997), Table of Contents, 11 pages.
Murphy, C., “Virtual Hardware Using Dynamic Reconfigurable Field Programmable Gate Arrays,” Engineering Development Centre, Liverpool John Moores University, UK, GERI Annual Research Symposium 2005, 8 pages.
Myers, G. “Advances in Computer Architecture,” Wiley-Interscience Publication, 2nd ed., John Wiley & Sons, Inc., 1978, pp. 463-494.
Nageldinger, U., “Design-Space Exploration for Coarse Grained Reconfigurable Architectures,” (Dissertation) Universitaet Kaiserslautern, 2000, Chapter 2, pp. 19-45.
Neumann, T., et al., “A Generic Library for Adaptive Computing Environments,” Field Programmable Logic and Applications, 11th International Conference, FPL 2001, Proceedings (Lecture Notes in Computer Science, vol. 2147) (2001) pp. 503-512.
Nilsson, et al., “The Scalable Tree Protocol—A Cache Coherence Approaches for Large-Scale Multiprocessors,” IEEE, pp. 498-506, Dec. 1992.
Norman, R.S., “Hyperchip Business Summary, The Opportunity,” Jan. 31, 2000, pp. 1-3.
Ohmsha, “Information Processing Handbook,” edited by the Information Processing Society of Japan, pp. 376, Dec. 21, 1998.
Olukotun, K., “The Case for a Single-Chip Microprocessor,” ACM Sigplan Notices, ACM, Association for Computing Machinery, New York, vol. 31, No. 9, Sep. 1996 pp. 2-11.
Ozawa, Motokazu et al., “A Cascade ALU Architecture for Asynchronous Super-Scalar Processors,” IEICE Transactions on Electronics, Electronics Society, Tokyo, Japan, vol. E84-C, No. 2, Feb. 2001, pp. 229-237.
PACT Corporation, “The XPP Communication System,” Technical Report 15 (2000), pp. 1-16.
Parhami, B., “Parallel Counters for Signed Binary Signals,” Signals, Systems and Computers, 1989, Twenty-Third Asilomar Conference, vol. 1, pp. 513-516.
PCI Local Bus Specification, Production Version, Revision 2.1, Portland, OR, Jun. 1, 1995, pp. 1-281.
Piotrowski, A., “IEC-Bus, Die Funktionsweise des IEC-BUS unde seine Anwendung in Geräten und Systemen,” 1987, Franzis-Verlag GmbH, München, pp. 20-25. [English Abstract Provided].
Pirsch, P. et al., “VLSI implementations of image and video multimedia processing systems,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 8, No. 7, Nov. 1998, pp. 878-891.
Pistorius et al., “Generation of Very Large Circuits to Benchmark the Partitioning of FPGAs,” Monterey, CA, ACM 1999, pp. 67-73.
Price et al., “Debug of Reconfigurable Systems,” Xilinx, Inc., San Jose, CA, Proceedings of SPIE, 2000, pp. 181-187.
Quenot, G.M., et al., “A Reconfigurable Compute Engine for Real-Time Vision Automata Prototyping,” Laboratoire Systeme de Perception, DGA/Etablissement Technique Central de l'Armement, France, 1994 IEEE, pp. 91-100.
Razdan et al., A High-Performance Microarchitecture with Hardware-Programmable Functional Units, Micro-27, Proceedings of the 27th Annual International Symposium on Microarchitecture, IEEE Computer Society and Association for Computing Machinery, Nov. 30-Dec. 2, 1994, pp. 172-180.
Rotenberg, Eric., et al., “Trace Cache: a Low Latency Approach to High Bandwidth Instruction Fetching,” Proceedings of the 29th Annual International Symposium on Microarchitecture, Paris, France, IEEE (1996), 12 pages.
Ryo, A., “Auszug aus Handbuch der Informationsverarbeitung,” ed. Information Processing Society of Japan, Information Processing Handbook, New Edition, Software Information Center, Ohmsha, Dec. 1998, 4 pages. [Translation provided].
Saleeba, Z.M.G., “A Self-Reconfiguring Computer System,” Department of Computer Science, Monash University (Dissertation) 1998, pp. 1-306.
Saleeba, M. “A Self-Contained Dynamically Reconfigurable Processor Architecture,” Sixteenth Australian Computer Science Conference, ASCS-16, QLD, Australia, Feb. 1993, pp. 59-70.
Salefski, B. et al., “Re-configurable computing in wireless,” Annual ACM IEEE Design Automation Conference: Proceedings of the 38th conference on Design automation (2001) pp. 178-183.
Schmidt, H. et al., “Behavioral synthesis for FGPA-based computing,” Carnegie Mellon University, Pittsburgh, PA, 1994 IEEE, pp. 125-132.
Schmidt, U. et al., “Datawave: A Single-Chip Multiprocessor for Video Applications,” IEEE Micro, vol. 11, No. 3, May/Jun. 1991, pp. 22-25, 88-94.
Schmit, et al., “Hidden Markov Modeling and Fuzzy Controllers in FPGAs, FPGAs for Custom Computing Machines,” 1995; Proceedings, IEEE Symposium in Napa Valley, CA, Apr. 1995, pp. 214-221.
Schönfeld, M., et al., “The LISA Design Environment for the Synthesis of Array Processors Including Memories for the Data Transfer and Fault Tolerance by Reconfiguration and Coding Techniques,” J. VLSI Signal Processing Systems for Signal, Image, and Video Technology, (Oct. 1, 1995) vol. 11(½), pp. 51-74.
Shin, D., et al., “C-based Interactive RTL Design Methodology,” Technical Report CECS-03-42 (Dec. 2003) pp. 1-16.
Shirazi, et al., “Quantitative analysis of floating point arithmetic on FPGA based custom computing machines,” IEEE Symposium on FPGAs for Custom Computing Machines, IEEE Computer Society Press, Apr. 19-21, 1995, pp. 155-162.
Short, Kenneth L., Microprocessors and Programmed Logic, Prentice Hall, Inc., New Jersey 1981, p. 34.
Siemers, C., “Rechenfabrik Ansaetze Fuer Extrem Parallele Prozessoren,” Verlag Heinze Heise GmbH., Hannover, DE No. 15, Jul. 16, 2001, pp. 170-179.
Siemers et al., “The .>S<puter: A Novel Micoarchitecture Model for Execution inside Superscalar and VLIW Processors Using Reconfigurable Hardware,” Australian Computer Science Communications, vol. 20, No. 4, Computer Architecture, Proceedings of the 3rd Australian Computer Architecture Conference, Perth, John Morris, Ed., Feb. 2-3, 1998, pp. 169-178.
Simunic, et al., Source Code Optimization and Profiling of Energy Consumation in Embedded Systems, Proceedings of the 13th International Symposium on System Synthesis, Sep. 2000, pp. 193-198.
Singh, H. et al., “MorphoSys: An Integrated Reconfigurable System for Data-Parallel Computation-Intensive Applications,” University of California, Irvine, CA. and Federal University of Rio de Janeiro, Brazil, 2000, IEEE Transactions on Computers, pp. 1-35; also published in IEEE Transactions on Computers, vol. 49, No. 5, May 2000, pp. 465-481.
Skokan, Z.E., “Programmable logic machine (A programmable cell array),” IEEE Journal of Solid-State Circuits, vol. 18, Issue 5, Oct. 1983, pp. 572-578.
Sondervan, J., “Retiming and logic synthesis,” Electronic Engineering (Jan. 1993) vol. 65(793), pp. 33, 35-36.
Soni, M., “VLSI Implementation of a Wormhole Run-time Reconfigurable Processor,” Jun. 2001, (Masters Thesis)Virginia Polytechnic Institute and State University, 88 pages.
Sueyoshi, T, “Present Status and Problems of the Reconfigurable Computing Systems Toward the Computer Evolution,” Department of Artificial Intelligence, Kyushi Institute of Technology, Fukuoka, Japan; Institute of Electronics, Information and Communication Engineers, vol. 96, No. 426, IEICE Technical Report (1996), pp. 111-119 [English Abstract Only].
Sundararajan et al., “Testing FPGA Devices Using JBits,” Proc. MAPLD 2001, Maryland, USA, Katz (ed.), NASA, CA, 8 pages.
Sutton et al., “A Multiprocessor DSP System Using PADDI-2,” U.C. Berkeley, 1998 ACM, pp. 62-65.
Tau, E., et al., “A First Generation DPGA Implementation,” FPD'95, pp. 138-143.
Tenca, A.F., et al., “A Variable Long-Precision Arithmetic Unit Design for Reconfigurable Coprocessor Architectures,” University of California, Los Angeles, 1998, pp. 216-225.
The XPP White Paper, Release 2.1, PACT—A Technical Perspective, Mar. 27, 2002, pp. 1-27.
TMS320C54X DSP: CPU and Peripherals, Texas Instruments, 1996, 25 pages.
TMS320C54x DSP: Mnemonic Instruction Set, Texas Instruments, 1996, 342 pages.
Translation of DE 101 39 170, filed Aug. 16, 2001, in related case using Google Translate, 10 pages.
Tsutsui, A., et al., “Yards: FPGA/MPU Hybrid Architecture for Telecommunication Data Processing,” NTT Optical Network Systems Laboratories, Japan, 1997 ACM, pp. 93-99.
Vasell et al., “The Function Processor: A Data-Driven Processor Array for Irregular Computations,” Chalmers University of Technology, Sweden, 1992, pp. 1-21.
Venkatachalam et al., “A highly flexible, distributed multiprocessor architecture for network processing,” Computer Networks, The International Journal of Computer and Telecommunications Networking, vol. 41, No. 5, Apr. 5, 2003, pp. 563-568.
Villasenor, et al., “Configurable Computing Solutions for Automatic Target Recognition,” IEEE, 1996 pp. 70-79.
Villasenor, ct al., “Configurable Computing,” Scientific American, vol. 276, No. 6, Jun. 1997, pp. 66-71.
Villasenor, et al., “Express Letters Video Communications Using Rapidly Reconfigurable Hardware,” IEEE Transactions on Circuits and Systems for Video Technology, IEEE, Inc., NY, Dec. 1995, pp. 565-567.
Wada, et al., “A Performance Evaluation of Tree-based Coherent Distributed Shared Memory,” Proceedings of the Pacific RIM Conference on Communications, Comput and Signal Processing, Victoria, May 19-21, 1993, pp. 390-393.
Waingold, E., et al., “Baring it all to software: Raw machines,” IEEE Computer, Sep. 1997, at 86-93.
Webster's Ninth New Collegiate Dictionary, Merriam-Webster, Inc., 1990, p. 332 (definition of “dedicated”).
Weinhardt, M., “Compilation Methods for Structure-programmable Computers,” dissertation, ISBN 3-89722-011-3, 1997. [Table of Contents and English Abstract Provided].
Weinhardt, Markus et al., “Pipeline Vectorization for Reconfigurable Systems,” 1999, IEEE, pp. 52-62.
Weinhardt, Markus et al., “Pipeline Vectorization,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 20, No. 2, Feb. 2001, pp. 234-248.
Weinhardt, Markus et al., “Memory Access Optimization for Reconfigurable Systems,” IEEE Proceedings Computers and Digital Techniques, 48(3) (May 2001) pp. 1-16.
Wittig, et al., “OneChip: An FPGA Processor with Reconfigurable Logic,” IEEE, 1996, pp. 126-135.
Wolfe, M. et al., “High Performance Compilers for Parallel Computing,” (Addison-Wesley 1996) Table of Contents, 11 pages.
Wu, et al., “A New Cache Directory Scheme,” IEEE, pp. 466-472, Jun. 1996.
Xilinx, “Logic Cell Array Families: XC4000, XC4000A and XC4000H,” 1994, product description, pp. 2-7, 2-9, 2-14, 2-15, 8-16, and 9-14.
Xilinx, “The Programmable Logic Data Book,” 1994, Section 2, pp. 1-231, Section 8, pp. 1, 23-25, 29, 45-52, 169-172.
Xilinx, “Spartan and SpartanXL Families Field Programmable Gate Arrays,” Jan. 1999, Xilinx, pp. 4-3 through 4-70.
Xilinx, “XC6200 Field Programmable Gate Arrays,” Apr. 24, 1997, Xilinx product description, pp. 1-73.
Xilinx, “XC3000 Series Field Programmable Gate Arrays,” Nov. 6, 1998, Xilinx product description, pp. 1-76.
Xilinx, “XC4000E and XC4000X Series Field Programmable Gate Arrays,” May 14, 1999, Xilinx product description, pp. 1-68.
Xilinx, “Virtex-E 1.8 V Extended Memory Field Programmable Gate Arrays,” (v1.5) Jul. 17, 2002, Xilinx Production Product Specification, pp. 1-118.
Xilinx, “Virtex-E 1.8 V Extended Memory Field Programmable Gate Arrays,” (v2.2) Sep. 10, 2002, Xilinx Production Product Specification, pp. 1-52.
Xilinx, “Virtex-II and Virtex-II Pro X FPGA User Guide,” Mar. 28, 2007, Xilinx user guide, pp. 1-559.
Xilinx, “Virtex-II and Virtex-II Pro X FPGA Platform FPGAs: Complete Data Sheet,” (v4.6) Mar. 5, 2007, pp. 1-302.
Xilinx, “Virtex-II Platform FPGAs: Complete Data Sheet,” (v3.5) Nov. 5, 2007, pp. 1-226.
Xilinx, White Paper 370: (Virtex-6 and Spartan-6 FPGA Families) “Reducing Switching Power with Intelligent Clock Gating,” Frederic Rivoallon, May 3, 2010, pp. 1-5.
Xilinx, White Paper 298: (Spartan-6 and Virtex-6 Devices) “Power Consumption at 40 and 50 nm,” Matt Klein, Apr. 13, 2009, pp. 1-21.
Xu, H. et al., “Parallel QR Factorization on a Block Data Flow Architecture,” Conference Proceeding Article, Mar. 1, 1992, pp. 332-336.
Ye, Z.A. et al., “A C-Compiler for a Processor With a Reconfigurable Functional Unit,” FPGA 2000 ACM/SIGNA International Symposium on Field Programmable Gate Arrays, Monterey, CA Feb. 9-11, 2000, pp. 95-100.
Yeung, A. et al., “A data-driven architecture for rapid prototyping of high throughput DSP algorithms,” Dept. of Electrical Engineering and Computer Sciences, Univ. of California, Berkeley, USA, Proceedings VLSI Signal Processing Workshop, IEEE Press, pp. 225-234, Napa, Oct. 1992.
Yeung, A. et al., “A reconfigurable data-driven multiprocessor architecture for rapid prototyping of high throughput DSP algorithms,” Dept. of Electrical Engineering and Computer Sciences, Univ. of California, Berkeley, USA, pp. 169-178, IEEE 1993.
Zhang, et al., “Architectural Evaluation of Flexible Digital Signal Processing for Wireless Receivers, Signals, Systems and Computers,” 2000; Conference Record of the Thirty-Fourth Asilomar Conference, Bd. 1, Oct. 29, 2000, pp. 78-83.
Zhang, et al., “A 1-V Heterogeneous Reconfigurable DSP IC for Wireless Baseband Digital Signal Processing,” IEEE Journal of Solid-State Circuits, vol. 35, No. 11, Nov. 2000, pp. 1697-1704.
Zhang et al., “Abstract: Low-Power Heterogeneous Reconfigurable Digital Signal Processors with Energy-Efficient Interconnect Network,” U.C. Berkeley (2004), pp. 1-120.
Zima, H. et al., “Supercompilers for parallel and vector computers,” (Addison-Wesley 1991) Table of Contents, 5 pages.
Xilinx, Inc.'s and Avnet, Inc.'s Disclosure Pursuant to P.R. 4-2; PACT XPP Technologies, AG. v. Xilinx, Inc. and Avnet, Inc., Case No. 2:07-cv-00563-TJW-CE, U.S. District Court for the Eastern District of Texas, Dec. 28, 2007, 4 pages.
Xilinx, Inc.'s and Avnet, Inc.'s Disclosure Pursuant to P.R. 4-1; PACT XPP Technologies, AG. v. Xilinx, Inc. and Avnet, Inc., Case No. 2:07-cv-00563-TJW-CE, U.S. District Court for the Eastern District of Texas, Dec. 28, 2007, 9 pages.
Defendant's Claim Construction Chart for P.R. 4-2 Constructions and Extrinsic Evidence for Terms Proposed by Defendants, PACT XPP Technologies, AG. v. Xilinix, Inc. and Avnet, Inc., Case No. 2:08-cv-00563-TJW-CE, U.S. District Court for the Eastern District of Texas, Dec. 28, 2007, pp. 1-19.
PACT's P.R. 4-1 List of Claim Terms for Construction, PACT XPP Technologies, AG. v. Xininx, Inc. and Avnet, Inc., Case No. 2:07-cv-00563-TJW-CE, U.S. District Court for Eastern District of Texas, Dec. 28, 2007, pp. 1-7.
PACT's P.R. 4-2 Preliminary Claim Constructions and Extrinsic Evidence, PACT XPP Technologies, AG. v. Xilinx, Inc. and Avnet, Inc., Case No. 2:07-cv-00563-TJW-CE, U.S. District Court for the Eastern District of Texas, Dec. 28, 2007, pp. 1-16, and Exhibits re Extrinsic Evidence Parts in seven (7) separate additional PDF files (Parts 1-7).
Microsoft Press Computer Dictionary, Third Edition, Redmond, WA, 1997, 3 pages.
Microsoft Press Computer Dictionary, Second Edition, Redmond, WA, 1994, 3 pages.
A Dictionary of Computing, Fourth Edition, Oxford University Press, 1997, 4 pages.
Communications Standard Dictionary, Third Edition, Martin Weik (Ed.), Chapman & Hall, 1996, 3 pages.
Dictionary of Communications Technology, Terms Definitions and Abbreviations, Second Edition, Gilbert Held (Ed.), John Wiley & Sons, England, 1995, 5 pages.
The Random House College Dictionary, Revised Edition, Random House, Inc., 1984, 14 pages.
The Random House College Dictionary, Revised Edition, Random House, Inc., 1984, 7 pages.
Random House Webster's College Dictionary with CD-ROM, Random House, 2001, 7 pages.
Random House Webster's College Dictionary with CD-ROM, Random House, 2001, 4 pages.
Random House Personal Computer Dictionary, Second Edition, Philip E. Margolis (Ed.), Random House, New York, 1996, 5 pages.
The IEEE Standard Dictionary of Electrical and Electronics Terms, Sixth Edition, 1996, 36 pages.
The IEEE Standard Dictionary of Electrical and Electronics Terms, Sixth Edition, 1996, 8 pages.
McGraw-Hill Electronics Dictionary, Sixth Edition, Neil Sclater et al. (Ed.), McGraw-Hill, 1997, 3 pages.
Modern Dictionary of Electronics, Sixth Edition, Rudolf Graf (Ed.), Newnes (Butterwoth-Heinemann), 1997, 5 pages.
The American Heritage Dictionary, Fourth Edition, Dell (Houghton-Mifflin), 2001, 5 pages.
The American Heritage Dictionary, Second College Edition, Houghton Mifflin, 1982, 23 pages.
The American Heritage Dictionary, Second College Edition, Houghton Mifflin, 1982, 8 pages.
The American Heritage Dictionary, Third Edition, Dell Publishing (Bantam Doubleday Dell Publishing Group, Inc.), 1994, 4 pages.
The American Heritage Dictionary, Fourth Edition, Dell/Houghton Mifflin 2001, 5 pages.
Webster's New Collegiate Dictionary, Merriam Co., 1981, 5 pages.
Webster's New Collegiate Dictionary, Merriam Co., 1981, 4 pages.
The Oxford American Dictionary and Language Guide, Oxford University Press, 1999, 5 pages.
The Oxford Duden German Dictionary, Edited by the Dudenredaktion and the German Section of the Oxford University Press, W. Scholze-Stubenrecht et al. (Eds), Clarendon Press, Oxford, 1990, 7 pages.
Oxford Dictionary of Computing, Oxford University Press, 2008, 4 pages.
Modern Dictionary of Electronics, Sixth Edition Revised and Updated, Rudolf F. Graf (Ed.), Butterworth-Heinemann, 1997, 7 pages.
Modern Dictionary of Electronics, Sixth Edition Revised and Updated, Rudolf F. Graf (Ed.), Butterworth-Heinemann, 1997, 5 pages.
Garner's Modern American Usage, Bryan A. Garner (Ed.), Oxford University Press, 2003, 3 pages.
The New Fowler's Modern English Usage, R.W. Burchfield (Ed.) , Oxford University Press, 2000, 3 pages.
Wikipedia, the free encyclopedia, “Granularity”, at http://en.wikipiedia.org/wiki/Granularity , Jun. 18, 2010, 4 pages.
Wordsmyth, The Premier Educational Dictionary—Thesaurus, at http://www.wordsmyth.net, “communication”, Jun. 18, 2010, 1 page.
Yahoo! Education, “affect”, at http://education.yahoo.com/reference/dictionary/entry/affect, Jun. 18, 2010, 2 pages.
mPulse Living Language, “high-level”, at http://www.macmillandictionary.com/dictionary/american/high-level , Jun. 18, 2010, 1 page.
MSN Encarta, “regroup”, at http://encarta.msn.com/encnet/features/dictionary/DictionaryResults.aspx?lextype=3&search=regroup , Jun. 17, 2010, 2 pages.
MSN Encarta, “synchronize”, at http://encarta.msn.com/encnet/features/dictionary/DictionaryResults.aspx?lextype=3&search=synchronize , Jun. 17, 2010, 2 pages.
MSN Encarta, “pattern”, at http://encarta.msn.com/encnet/features/dictionary/DictionaryResults.aspx?lextype=3&search=pattern , Jun. 17, 2010, 2 pages.
MSN Encarta, “dimension”, at http://encarta.msn.com/encnet/features/dictionary/DictionaryResults.aspx?lextype=3&search=dimension, Jun. 17, 2010, 2 pages.
MSN Encarta, “communication”, at http://enearta.msn.com/encnet/features/dictionary/DictionaryResults.aspx?lextype=3&search=communication, Jun. 17, 2010, 2 pages.
MSN Encarta, “arrangement”, at http://encarta.msn.com/encnet/features/dictionary/DictionaryResults.aspx?lextype=3&search=arrangement , Jun. 17, 2010, 2 pages.
MSN Encarta, “vector”, at http://encarta.msn.com/encnet/features/dictionary/DictionaryResults.aspx?lextype=3&search=vector , Jul. 30, 2010, 2 pages.
Dictionary.com, “address”, at http://dictionary.reference.com/browse/address , Jun. 18, 2010, 4 pages.
P.R . 4-3 Joint Claim Constructions Statement, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc et al., E.D. Texas, 2:07-cv-00563-CE, Jul. 19, 2010, pp. 1-50.
Order Granting Joint Motion for Leave to File an Amended Joint Claim Construction and Prehearing Statement and Joint Motion to File an Amended Joint Claim Construction and Prehearing Statement Pursuant to Local Patent Rule 4-3, and Exhibit A: P.R. 4-3 Amended Joint Claim Constructions Statement, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-Ce, Aug. 2, 2010, 72 pages.
P.R. 4-3 Amended Joint Claim Constructions Statement, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-Ce, Aug. 3, 2010, pp. 1-65.
Exhibit A—P.R. 4-3 Amended Joint Claim Constructions Statement, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Aug. 2, 2010, pp. 1-66.
PACT's Opening Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc., E.D. Texas, 2:07-cv-00563-CE, Nov. 1, 2010, pp. 1-55.
Declaration of Harry L. (Nick) Tredennick in Support of PACT's Claim Constructions, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Nov. 1, 2010, pp. 1-87.
Transcript of Harry (Nick) L. Tredennick III, Ph.D., Oct. 11, 2010, vol. 1, Exhibit 16 of PACT's Opening Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Nov. 1, 2010, pp. 1-3.
Agreed and Disputed Terms, Exhibit 17 of PACT's Opening Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Nov. 1, 2010, pp. 1-16.
Oral Videotaped Deposition—Joseph McAlexander dated Oct. 12, 2010, vol. 1, Exhibit 18 of PACT's Opening Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Nov. 1, 2010, pp. 1-17.
Expert Report of Joe McAlexander Re Claim Construction dated Sep. 27, 2010, Exhibit 19 of PACT's Opening Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Nov. 1, 2010, pp. 1-112.
Documents from File History of U.S. Appl. No. 09/290,342, filed Apr. 12, 1999, Exhibit 20 of PACT's Opening Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Nov. 1, 2010, pp. 1-37.
Amendment from File History of U.S. Appl. No. 10/156,397, filed May 28, 2002, Exhibit 25 of PACT's Opening Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Nov. 1, 2010, pp. 1-12.
Documents from File History U.S. Appl. No. 09/329,132, filed Jun. 9, 1999, Exhibit 27 of PACT's Opening Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Nov. 1, 2010, pp. 1-36.
Amendment from File History of U.S. Appl. No. 10/791,501, filed Mar. 1, 2004, Exhibit 39 of PACT's Opening Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Nov. 1, 2010, pp. 1-9.
Amendment from File History of U.S. Appl. No. 10/265,846, filed Oct. 7, 2002, Exhibit 40 of PACT's Opening Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Nov. 1, 2010, pp. 1-12.
Defendants Xilinx, Inc. and Avnet, Inc.'s Responsive Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Dec. 6, 2010, pp. 1-55.
Declaration of Aaron Taggart in Support of Defendants Xilinx, Inc. and Avnet, Inc.'s Responsive Claim Construction Brief, Defendants Xilinx, Inc. and Avnet, Inc.'s Responsive Claim Construction Brief (Exhibit A), PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Dec. 6, 2010, pp. 1-5.
Oral Videotaped Deposition Joseph McAlexander (Oct. 12, 2010), Exhibit 1 of Defendants Xilinx, Inc. and Avnet, Inc.'s Responsive Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Dec. 6, 2010, pp. 1-9.
Expert Report of Joe McAlexander re Claim Construction, Exhibit 2 of Defendants Xilinx, Inc. and Avnet, Inc.'s Responsive Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Dec. 6, 2010, pp. 1-137.
Various Documents from File History of U.S. Appl. No. 09/290,342, filed Apr. 12, 1999, Exhibit 6 of Defendants Xilinx, Inc. and Avnet, Inc.'s Responsive Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-Cv-00563-CE, Dec. 6, 2010, pp. 1-181.
Transcript of Harry (Nick) L. Tredennick III, Ph.D., Oct. 11, 2010, vol. 1, Exhibit 7 of Defendants Xilinx, Inc. and Avnet, Inc.'s Responsive Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Dec. 6, 2010, pp. 1-28.
Amendment, Response from File History of U.S. Appl. No. 10/156,397, filed May 28, 2002, Exhibit 15 of Defendants Xilinx, Inc. and Avnet, Inc.'s Responsive Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Dec. 6, 2010, pp. 1-137.
Application from File History of U.S. Appl. No. 08/544,435, filed Nov. 17, 1995, Exhibit 20 of Defendants Xilinx, Inc. and Avnet, Inc.'s Responsive Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Dec. 6, 2010, pp. 1-102.
Documents from File History of U.S. Appl. No. 09/329,132, filed Jun. 9, 1999, Exhibit 24 of Defendants Xilinx, Inc. and Avnet, Inc.'s Responsive Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Dec. 6, 2010, pp. 1-13.
Documents from File History of U.S. Appl. No. 10/791,501, filed Mar. 1, 2004, Exhibit 25 of Defendants Xilinx, Inc. and Avnet, Inc.'s Responsive Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Dec. 6, 2010, pp. 1-14.
Amendment from File History of U.S. Appl. No. 11/246,617, filed Oct. 7, 2005, Exhibit 26 of Defendants Xilinx, Inc. and Avnet, Inc.'s Responsive Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Dec. 6, 2010, pp. 1-9.
Documents from File History of U.S. Appl. No. 08/947,254, filed Oct. 8, 1997, Exhibit 27 of Defendants Xilinx, Inc. and Avnet, Inc.'s Responsive Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Dec. 6, 2010, pp. 1-38.
Documents from File History of U.S. Appl. No. 08/947,254, filed Oct. 8, 1997, specifically, German priority application specification [English translation provided], Exhibit 33 of Defendants Xilinx, Inc. and Avnet, Inc.'s Responsive Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Dec. 6, 2010, 54 pages [including English translation].
Documents from File History of U.S. Appl. No. 09/335,974, filed Jun. 18, 1999, Exhibit 28 of Defendants Xilinx, Inc. and Avnet, Inc.'s Responsive Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Dec. 6, 2010, pp. 1-32.
Documents from File History of U.S. Patent Reexamination Control No. 90/010,450 (filed Mar. 27, 2009), Exhibit 30 of Defendants Xilinx, Inc. and Avnet, Inc.'s Responsive Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Dec. 6, 2010, pp. 1-71.
Documents from File History of U.S. Appl. No. 10/265,846, filed Oct. 7, 2002, Exhibit 32 of Defendants Xilinx, Inc. and Avnet, Inc.'s Responsive Claim Construction Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Dec. 6, 2010, pp. 1-23.
PACT's Claim Construction Reply Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Jan. 7, 2011, pp. 1-20.
Defendants Xilinx, Inc. and Avnet, Inc.'s Claim Construction Surreply Brief, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Jan. 18, 2011, 142 pages.
Markman Hearing Minutes and Attorney Sign-In Sheet, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Feb. 22, 2011, 3 pages; and court transcript, 245 pages.
Memorandum Opinion and Order, PACT XPP Technologies, AG v. Xilinx, Inc. and Avnet, Inc. et al., E.D. Texas, 2:07-cv-00563-CE, Jun. 17, 2011, pp. 1-71.
Atmel Corporation, Atmel 5-K- 50K Gates Coprocessor FPGA and FreeRAM, (www.atmel.com), Apr. 2002 , pp. 1-68.
Glaskowsky, Peter N., “PACT Debuts Extreme Processor; Reconfigurable ALU Array Is Very Powerful—and Very Complex” Microprocessor, The Insider's Guide to Microprocessor Hardware, MicroDesign Resources—Microprocessor Report, Oct. 9, 2000 (www.MPRonline.com), 6 pages.
Glaskowsky, Peter N., “Analysis' Choice Nominees Named; Our Picks for 2002's Most Important Products and Technologies” Microprocessor, The Insider's Guide to Microprocessor Hardware, MicroDesign Resources—Microprocessor Report, Dec. 9, 2002 (www.MPRonline.com), 4 pages.
Lattice Semiconductor Corporation, ispLSI 2000E, 2000VE and 2000 VL Family Architectural Description, Oct. 2001, pp. 1-88.
Olukotun, K. et al., “Rationale, Design and Performance of the Hydra Multiprocessor,” Computer Systems Laboratory, Stanford University, CA, Nov. 1994, pp. 1-19.
PACT Corporate Backgrounder, PACT company release, Oct. 2008, 4 pages.
Page, Ian., “Reconfigurable processor architectures,” Oxford University Computing Laboratory, Oxford UK, Elsevier Science B.V., Microprocessors an Microsystems 20 (1996) pp. 185-196.
Singh, Hartej et al., “Morpho-Sys: A Reconfigurable Architecture for Multimedia Applications,” Univ. of California, Irvine, CA and Federal University of Rio de Janiero, Brazil, at http://www.eng.uci.edu/morphosys/docs/sbcci98.html, 10 pages.
Theodoridis, G. et al., “Chapter 2—A Survey of Coarse-Grain Reconfigurable Architectures and Cad Tools, Basic Definitions, Critical Design Issues and Existing Coarse-grain Reconfigurable Systems,” from S. Vassiliadis, and D. Soudris (eds.) Fine- and Coarse-Grained Reconfigurable Computing, Springer 2007, pp. 89-149.
Weinhardt, Markus et al., “Using Function Folding to Improve Silicon Efficiency of Reconfigurable Arithmetic Arrays,” PACT XPP Technologies AG, Munich, Germany, IEEE 2004, pp. 239-245.
Xilinx, XC6200 Field Programmable Gate Arrays, Advance Product Specification, Jun. 1, 1996 (Version 1.0), pp. 4-255 through 4-286.
Xilinx, Virtex-II Platform FPGA User Guide, UG002 (V2.1) Mar. 28, 2007, pp. 1-502 [Parts 1-3].
Xilinx, XC4000E and SC4000X Serial Field Programmable Gate Arrays, Product Specification (Version 1.6), May 14, 1999, pp. 1-107.
Coelho, F., “Compiling dynamic mappings with array copies,” Jul. 1997, 12 pages, http://delivery.acm.org/10.1145/270000/263786/p168-coelho.pdf.
Janssen et al., “A Specification Invariant Technique for Regularity Improvement between Flow-Graph Clusters,” Mar. 1996, 6 pages, http://delivery.acm.org/10.1145/790000/787534/74230138.pdf.
Microsoft Press Computer Dictionary, Second Edition, 1994, Microsoft Press, ISBN 1-55615-597-2, p. 10.
Newton, Harry, “Newton's Telecom Dictionary,” Ninteenth Edition, 2003, CMP Books, p. 40.
Rehmouni et al., “Formulation and evaluation of scheduling techniques for control flow graphs,” Dec. 1995, 6 pages, http://delivery.acm.org/10.1145/230000/224352/p386-rahmouni.pdf.
Sinha et al., “System-dependence-graph-based slicing of programs with arbitrary interprocedural control flow,” May 1999, 10 pages, http://delivery.acm.org/10.1145/310000/203675/p432-sinha.pdf.
Stallings, William, “Data & Computer Communications,” Sixth Edition, Jun. 2000, Prentice-Hall, Inc., ISBN 0-084370-9, pp. 195-196.
Agarwal, A., et al., “APRIL: A Processor Architecture for Multiprocessing,” Laboratory for Computer Science, MIT, Cambridge, MA, IEEE 1990, pp. 104-114.
Almasi and Gottlieb, Highly Parallel Computing, The Benjamin/Cummings Publishing Company, Inc., Redwood City, CA, 1989, 3 pages (Fig. 4.1).
Advanced RISC Machines Ltd (ARM), “AMBA—Advanced Microcontroller Bus Architecture Specification,” (Document No. ARM IHI 0001C), Sep. 1995, 72 pages.
Alfke, Peter; New, Bernie, Xilinx Application Note, “Additional XC3000 Data,” XAPP 024.000, 1994, pp. 8-11 through 8-20.
Alfke, Peter; New, Bernie, Xilinx Application Note, “Adders, Subtracters and Accumulators in XC3000,” Xapp 022.000, 1994, pp. 8-98.
Alfke, Peter, Xilinx Application Note, “Megabit FIFO in Two Chips: One LCA Device and One DRAM,” XAPP 030.000, 1994, pp. 8-148 through 8-150.
Alfke, Peter, Xilinx Application Note, “Dynamic Reconfiguration,” XAPP 093, Nov. 10, 1997, pp. 13-45 through 13-46.
Alfke, Peter; New, Bernie, Xilinx Application Note, “Implementing State Machines in LCA Devices,” XAPP 027.001, 1994, pp. 8-169 through 8-172.
Algotronix, Ltd., CAL64K Preliminary Data Sheet, Apr. 1989, pp. 1-24.
Algotronix, Ltd., CAL4096 Datasheet, 1992, pp. 1-53.
Algotronix, Ltd., CHS2x4 User Manual, “CHA2x4 Custom Computer,” 1991, pp. 1-38.
Allaire, Bill; Fischer, Bud, Xilinx Application Note, “Block Adaptive Filter,” XAPP 055, Aug. 15, 1996 (Version 1.0), pp. 1-10.
Altera Application Note (73), “Implementing FIR Filters in FLEX Devices,” Altera Corporation, Feb. 1998, ver. 1.01, pp. 1-23.
Athanas, P. (Thesis), “An adaptive machine architecture and compiler for dynamic processor reconfiguration,” Brown University 1992, pp. 1-157.
Berkeley Design Technology, Inc., Buyer's Guide to DSP Processors, 1995, Fremont, CA., pp. 673-698.
Bittner, R. et al., “Colt: An Experiment in Wormhole Run-Time Reconfiguration,” Bradley Department of Electrical and Computer Engineering, Blacksburg, VA, SPIE—International Society for Optical Engineering, vol. 2914/187, Nov. 1996, Boston, MA, pp. 187-194.
Camilleri, Nick; Lockhard, Chris, Xilinx Application Note ,“Improving XC4000 Design Performance,” XAPP 043.000, 1994, pp. 8-21.
Cartier, Lois, Xilinx Application Note, “System Design with New XC4000EX I/O Features,” Feb. 21, 1996, pp. 1-8.
Chen, D., (Thesis) “Programmable arithmetic devices for high speed digital signal processing,” U. California Berkeley 1992, pp. 1-175.
Churcher, S., et al., “The XC6200 FastMap TM Processor Interface,” Xilinx, Inc., Aug. 1995, pp. 1-8.
Cowie, Beth, Xilinx Application Note, “High Performance, Low Area, Interpolator Design for the XC6200,” XAPP 081, May 7, 1997 (Version 1.0), pp. 1-10.
Duncan, Ann, Xilinx Application Note, “A32x16 Reconfigurable Correlator for the XC6200,” XAPP 084, 'Jul. 25, 1997 (Version 1.0), pp. 1-14.
Ebeling, C., et al., “RaPiD—Reconfigurable Pipelined Datapath,” Dept. of Computer Science and Engineering, U. Washington, 1996, pp. 126-135.
Epstein, D., “IBM Extends DSP Performance with Mfast—Powerful Chip Uses Mesh Architecture to Accelerate Graphics, Video,” 1995 MicroDesign Resources, vol. 9, No. 16, Dec. 4, 1995, pp. 231-236.
Fawcett, B., “New SRAM-Based FPGA Architectures Address New Applications,” Xilinx, Inc. San Jose, CA, Nov. 1995, pp. 231-236.
Goslin, G; Newgard, B, Xilinx Application Note, “16-Tap, 8-Bit FIR Filter Applications Guide,” Nov. 21, 1994, pp. 1-5.
Iwanczuk, Roman, Xilinx Application Note, “Using the XC4000 RAM Capability,” XAPP 031.000, 1994, pp. 8-127 through 8-138.
Knapp, Steven, “Using Programmable Logic to Accelerate DSP Functions,” Xilinx, Inc., 1995, pp. 1-8.
New, Bernie, Xilinx Application Note ,“Accelerating Loadable Counters in SC4000,” XAPP 023.001, 1994, pp. 8-82 through 8-85.
New, Bernie, Xilinx Application Note, “Boundary Scan Emulator for XC3000,” XAPP 007.001, 1994, pp. 8-53 through 8-59.
New, Bernie, Xilinx Application Note, “Ultra-Fast Synchronous Counters,” XAPP 014.001, 1994, pp. 8-78 through 8-81.
New, Bernie, Xilinx Application Note, “Using the Dedicated Carry Logic in XC4000,” XAPP 013.001, 1994, pp. 8-105 through 8-115.
New, Bernie, Xilinx Application Note, “Complex Digital Waveform Generator,” XAPP 008.002, 1994, . 8-163 through 8-164.
New, Bernie, Xilinx Application Note, “Bus-Structured Serial Input-Output Device,” XAPP 010.001, 1994, pp. 8-181 through 8-182.
Ridgeway, David, Xilinx Application Note, “Designing Complex 2-Dimensional Convolution Filters,” XAPP 037.000, 1994, pp. 8-175 through 8-177.
Rowson, J., et al., “Second-generation compilers optimize semicustom circuits,” Electronic Design, Feb. 19, 1987, pp. 92-96.
Schewel, J., “A Hardware/Software Co-Design System using Configurable Computing Technology,” Virtual Computer Corporation, Reseda, CA, IEEE 1998, pp. 620-625.
Segers, Dennis, Xilinx Memorandum, “MIKE—Product Description and MRD,” Jun. 8, 1994, pp. 1-29.
Texas Instruments, “TMS320C8x System-Level Synopsis,” Sep. 1995, 75 pages.
Texas Instruments, “TMS320C80 Digital Signal Processor,” Data Sheet, Digital Signal Processing Solutions 1997, 171 pages.
Texas Instruments, “TMS320C80 (MVP Parallel Processor,” User's Guide, Digital Signal Processing Products 1995, 73 pages.
Trainor, D.W., et al., “Implementation of the 2D DCT Using a Xilinx XC6264 FPGA,” 1997, IEEE Workshop of Signal Processing Systems SiPS 97, pp. 541-550.
Trimberger, S, (Ed.) et al., “Field-Programmable Gate Array Technology,” 1994, Kluwer Academic Press, pp. 1-258 (and the Title Page, Table of Contents, and Preface) [274 pages total].
Trimberger, S., “A Reprogrammable Gate Array and Applications,” IEEE 1993, Proceedings of the IEEE, vol. 81, No. 7, Jul. 1993, pp. 1030-1041.
Trimberger, S., et al., “A Time-Multiplexed FPGA,” Xilinx, Inc., 1997 IEEE, pp. 22-28.
Ujvari, Dan, Xilinx Application Note, “Digital Mixer in an XC7272,” XAPP 035.002, 1994, p. 1.
Veendrick, H., et al., “A 1.5 GIPS video signal processor (VSP),” Philips Research Laboratories, The Netherlands, IEEE 1994 Custom Integrated Circuits Conference, pp. 95-98.
Wilkie, Bill, Xilinx Application Note,“Interfacing XC6200 to Microprocessors (TMS320C50 Example),” XAPP 064, Oct. 9, 1996.
Wilkie, Bill, Xilinx Application Note ,“Interfacing XC6200 to Microprocessors (MC68020 Example),” XAPP 063, Oct. 9, 1996.
XCELL, Issue 18, Third Quarter 1995, “Introducing three new FPGA Families!”; “Introducing the XC6200 FPGA Architecture: The First FPGA Architecture Optimized for Coprocessing in Embedded System Applications,” 40 pages.
Xilinx Application Note, Advanced Product Specification, “XC6200 Field Programmable Gate Arrays,” Jun. 1, 1996 (Version 1.0), pp. 4-253-4-286.
Xilinx Application Note, “A Fast Constant Coefficient Multiplier for the XC6200,” XAPP 082, Aug. 24, 1997 (Version 1.0), pp. 1-5.
Xilinx Technical Data, “XC5200 Logic Cell Array Family,” Preliminary (v1.0), Apr. 1995, pp. 1-43.
Xilinx Data Book, “The Programmable Logic Data Book,” 1996, 909 pages.
Xilinx, Series 6000 User's Guide, Jun. 26, 1997, 223 pages.
Yeung, K., (Thesis) “A Data-Driven Multiprocessor Architecture for High Throughput Digital Signal Processing,” Electronics Research Laboratory, U. California Berkeley, Jul. 10, 1995, pp. 1-153.
Yeung, L., et al., “A 2.4GOPS Data-Driven Reconfigurable Multiprocessor IC for DSP,” Dept. of EECS, U. California Berkeley, 1995 IEEE International Solid State Circuits Conference, pp. 108-110.
ZILOG Preliminary Product Specification, “Z86C95 CMOS Z8 Digital Signal Processor,” 1992, pp. 1-82.
ZILOG Preliminary Product Specification, “Z89120 Z89920 (ROMless) 16-Bit Mixed Signal Processor,” 1992, pp. 1-82.
Defendants' Invalidity Contentions in PACT Technologies, AG v. Xilinx, Inc., el al., (E.D. Texas Dec. 28, 2007) (No. 2:07cv563)., including Exhibits a through K in separate PDF files.
Shreekant et al., “The Internet Streaming SIMD Extensions,” Intel Corp., Intel Technology Journal Q2, 1999, pp. 1-8.
Bondalapati et al., “Reconfigurable Computing: Architectures, Models, and Altorithms,” Apr. 2000, Current Science, vol. 78, No. 7, pp. 828-837.
Ganesan et al., “An Integrated Temporal Partitioning and Partial Reconfiguration Technique for Design Latency Improvement,” 2000, Proceedings of the Conference on Design, Automation and Test in Europe, pp. 320-325.
Hartenstein et al., “Using the KressArray for Reconfigurable Computing,” Nov. 1998, SPIE Conference on Configurable Computing: Technology and Applications, pp. 150-161.
Hauck, S., “Configuration Prefetch for Single Context Reconfigurable Coprocessors,” 1998, Proceedings of the 1998 ACM/SIGDA Sixth International Symposium on Field Programmable Gate Arrays, pp. 65-74.
Li et al., “Configuration Caching Management Techniques for Reconfigurable Computing,” 2000, Proceedings of the 2000 IEEE Symposium on Field-Programmable Custom Computing Machines, pp. 22-36.
Related Publications (1)
Number Date Country
20120072699 A1 Mar 2012 US
Continuations (2)
Number Date Country
Parent 12371040 Feb 2009 US
Child 13289296 US
Parent 10398546 US
Child 12371040 US